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-171690555700063.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 StigmergyCommit-PT-02b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r417-tall-171690555700063
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 584K
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 23 07:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:58 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 23 07:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.4K Apr 11 17:42 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 70K Apr 11 17:42 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Apr 11 17:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Apr 11 17:41 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:58 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:58 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 231K 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 StigmergyCommit-PT-02b-LTLFireability-00
FORMULA_NAME StigmergyCommit-PT-02b-LTLFireability-01
FORMULA_NAME StigmergyCommit-PT-02b-LTLFireability-02
FORMULA_NAME StigmergyCommit-PT-02b-LTLFireability-03
FORMULA_NAME StigmergyCommit-PT-02b-LTLFireability-04
FORMULA_NAME StigmergyCommit-PT-02b-LTLFireability-05
FORMULA_NAME StigmergyCommit-PT-02b-LTLFireability-06
FORMULA_NAME StigmergyCommit-PT-02b-LTLFireability-07
FORMULA_NAME StigmergyCommit-PT-02b-LTLFireability-08
FORMULA_NAME StigmergyCommit-PT-02b-LTLFireability-09
FORMULA_NAME StigmergyCommit-PT-02b-LTLFireability-10
FORMULA_NAME StigmergyCommit-PT-02b-LTLFireability-11
FORMULA_NAME StigmergyCommit-PT-02b-LTLFireability-12
FORMULA_NAME StigmergyCommit-PT-02b-LTLFireability-13
FORMULA_NAME StigmergyCommit-PT-02b-LTLFireability-14
FORMULA_NAME StigmergyCommit-PT-02b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717110710394

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=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyCommit-PT-02b
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-30 23:11:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-30 23:11:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 23:11:53] [INFO ] Load time of PNML (sax parser for PT used): 78 ms
[2024-05-30 23:11:53] [INFO ] Transformed 928 places.
[2024-05-30 23:11:53] [INFO ] Transformed 1040 transitions.
[2024-05-30 23:11:53] [INFO ] Found NUPN structural information;
[2024-05-30 23:11:53] [INFO ] Parsed PT model containing 928 places and 1040 transitions and 2439 arcs in 151 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA StigmergyCommit-PT-02b-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-02b-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-02b-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-02b-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 928 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 928/928 places, 1040/1040 transitions.
Discarding 65 places :
Symmetric choice reduction at 0 with 65 rule applications. Total rules 65 place count 863 transition count 975
Iterating global reduction 0 with 65 rules applied. Total rules applied 130 place count 863 transition count 975
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 171 place count 822 transition count 934
Iterating global reduction 0 with 41 rules applied. Total rules applied 212 place count 822 transition count 934
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 236 place count 798 transition count 910
Iterating global reduction 0 with 24 rules applied. Total rules applied 260 place count 798 transition count 910
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 280 place count 778 transition count 890
Iterating global reduction 0 with 20 rules applied. Total rules applied 300 place count 778 transition count 890
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 318 place count 760 transition count 872
Iterating global reduction 0 with 18 rules applied. Total rules applied 336 place count 760 transition count 872
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 353 place count 743 transition count 855
Iterating global reduction 0 with 17 rules applied. Total rules applied 370 place count 743 transition count 855
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 387 place count 726 transition count 838
Iterating global reduction 0 with 17 rules applied. Total rules applied 404 place count 726 transition count 838
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 420 place count 710 transition count 822
Iterating global reduction 0 with 16 rules applied. Total rules applied 436 place count 710 transition count 822
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 449 place count 697 transition count 809
Iterating global reduction 0 with 13 rules applied. Total rules applied 462 place count 697 transition count 809
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 472 place count 687 transition count 799
Iterating global reduction 0 with 10 rules applied. Total rules applied 482 place count 687 transition count 799
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 485 place count 687 transition count 796
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 488 place count 684 transition count 793
Iterating global reduction 1 with 3 rules applied. Total rules applied 491 place count 684 transition count 793
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 493 place count 682 transition count 791
Iterating global reduction 1 with 2 rules applied. Total rules applied 495 place count 682 transition count 791
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 496 place count 681 transition count 790
Iterating global reduction 1 with 1 rules applied. Total rules applied 497 place count 681 transition count 790
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 498 place count 680 transition count 789
Iterating global reduction 1 with 1 rules applied. Total rules applied 499 place count 680 transition count 789
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 500 place count 679 transition count 788
Iterating global reduction 1 with 1 rules applied. Total rules applied 501 place count 679 transition count 788
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 502 place count 678 transition count 787
Iterating global reduction 1 with 1 rules applied. Total rules applied 503 place count 678 transition count 787
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 504 place count 677 transition count 786
Iterating global reduction 1 with 1 rules applied. Total rules applied 505 place count 677 transition count 786
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 506 place count 676 transition count 785
Iterating global reduction 1 with 1 rules applied. Total rules applied 507 place count 676 transition count 785
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 508 place count 675 transition count 784
Iterating global reduction 1 with 1 rules applied. Total rules applied 509 place count 675 transition count 784
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 510 place count 674 transition count 783
Iterating global reduction 1 with 1 rules applied. Total rules applied 511 place count 674 transition count 783
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 512 place count 673 transition count 782
Iterating global reduction 1 with 1 rules applied. Total rules applied 513 place count 673 transition count 782
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 514 place count 672 transition count 781
Iterating global reduction 1 with 1 rules applied. Total rules applied 515 place count 672 transition count 781
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 516 place count 672 transition count 780
Applied a total of 516 rules in 827 ms. Remains 672 /928 variables (removed 256) and now considering 780/1040 (removed 260) transitions.
// Phase 1: matrix 780 rows 672 cols
[2024-05-30 23:11:54] [INFO ] Computed 4 invariants in 30 ms
[2024-05-30 23:11:54] [INFO ] Implicit Places using invariants in 277 ms returned []
[2024-05-30 23:11:54] [INFO ] Invariant cache hit.
[2024-05-30 23:11:55] [INFO ] Implicit Places using invariants and state equation in 372 ms returned []
Implicit Place search using SMT with State Equation took 676 ms to find 0 implicit places.
[2024-05-30 23:11:55] [INFO ] Invariant cache hit.
[2024-05-30 23:11:55] [INFO ] Dead Transitions using invariants and state equation in 334 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 672/928 places, 780/1040 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1841 ms. Remains : 672/928 places, 780/1040 transitions.
Support contains 33 out of 672 places after structural reductions.
[2024-05-30 23:11:55] [INFO ] Flatten gal took : 71 ms
[2024-05-30 23:11:55] [INFO ] Flatten gal took : 33 ms
[2024-05-30 23:11:55] [INFO ] Input system was already deterministic with 780 transitions.
Support contains 31 out of 672 places (down from 33) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 167 resets, run finished after 491 ms. (steps per millisecond=20 ) properties (out of 24) seen :6
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 18) seen :0
Running SMT prover for 18 properties.
[2024-05-30 23:11:56] [INFO ] Invariant cache hit.
[2024-05-30 23:11:56] [INFO ] [Real]Absence check using 4 positive place invariants in 7 ms returned sat
[2024-05-30 23:11:57] [INFO ] After 317ms SMT Verify possible using state equation in real domain returned unsat :0 sat :4 real:14
[2024-05-30 23:11:57] [INFO ] Deduced a trap composed of 323 places in 156 ms of which 5 ms to minimize.
[2024-05-30 23:11:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 224 ms
[2024-05-30 23:11:57] [INFO ] After 744ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2 real:16
Attempting to minimize the solution found.
Minimization took 83 ms.
[2024-05-30 23:11:57] [INFO ] After 1213ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2 real:16
[2024-05-30 23:11:58] [INFO ] [Nat]Absence check using 4 positive place invariants in 5 ms returned sat
[2024-05-30 23:11:58] [INFO ] After 692ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :17
[2024-05-30 23:11:59] [INFO ] Deduced a trap composed of 323 places in 133 ms of which 2 ms to minimize.
[2024-05-30 23:11:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 194 ms
[2024-05-30 23:11:59] [INFO ] Deduced a trap composed of 325 places in 162 ms of which 2 ms to minimize.
[2024-05-30 23:11:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 239 ms
[2024-05-30 23:11:59] [INFO ] Deduced a trap composed of 304 places in 143 ms of which 1 ms to minimize.
[2024-05-30 23:11:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 203 ms
[2024-05-30 23:12:00] [INFO ] Deduced a trap composed of 322 places in 165 ms of which 1 ms to minimize.
[2024-05-30 23:12:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 216 ms
[2024-05-30 23:12:00] [INFO ] Deduced a trap composed of 334 places in 141 ms of which 1 ms to minimize.
[2024-05-30 23:12:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 208 ms
[2024-05-30 23:12:00] [INFO ] After 2457ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :17
Attempting to minimize the solution found.
Minimization took 455 ms.
[2024-05-30 23:12:01] [INFO ] After 3394ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :17
Fused 18 Parikh solutions to 16 different solutions.
Parikh walk visited 3 properties in 173 ms.
Support contains 21 out of 672 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 672/672 places, 780/780 transitions.
Graph (trivial) has 628 edges and 672 vertex of which 50 / 672 are part of one of the 9 SCC in 8 ms
Free SCC test removed 41 places
Drop transitions removed 55 transitions
Reduce isomorphic transitions removed 55 transitions.
Graph (complete) has 917 edges and 631 vertex of which 627 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.3 ms
Discarding 4 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 438 transitions
Trivial Post-agglo rules discarded 438 transitions
Performed 438 trivial Post agglomeration. Transition count delta: 438
Iterating post reduction 0 with 441 rules applied. Total rules applied 443 place count 627 transition count 283
Reduce places removed 438 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 444 rules applied. Total rules applied 887 place count 189 transition count 277
Reduce places removed 3 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 2 with 10 rules applied. Total rules applied 897 place count 186 transition count 270
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 905 place count 179 transition count 269
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 36 Pre rules applied. Total rules applied 905 place count 179 transition count 233
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 4 with 72 rules applied. Total rules applied 977 place count 143 transition count 233
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 981 place count 139 transition count 229
Iterating global reduction 4 with 4 rules applied. Total rules applied 985 place count 139 transition count 229
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 985 place count 139 transition count 227
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 989 place count 137 transition count 227
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 990 place count 136 transition count 226
Iterating global reduction 4 with 1 rules applied. Total rules applied 991 place count 136 transition count 226
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 4 with 46 rules applied. Total rules applied 1037 place count 113 transition count 203
Drop transitions removed 1 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 1041 place count 113 transition count 199
Discarding 12 places :
Symmetric choice reduction at 5 with 12 rule applications. Total rules 1053 place count 101 transition count 166
Iterating global reduction 5 with 12 rules applied. Total rules applied 1065 place count 101 transition count 166
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 1068 place count 101 transition count 163
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 1073 place count 96 transition count 158
Iterating global reduction 6 with 5 rules applied. Total rules applied 1078 place count 96 transition count 158
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 1083 place count 91 transition count 153
Iterating global reduction 6 with 5 rules applied. Total rules applied 1088 place count 91 transition count 153
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 1090 place count 91 transition count 151
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 7 with 12 rules applied. Total rules applied 1102 place count 85 transition count 145
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -16
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 1108 place count 82 transition count 161
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 1109 place count 82 transition count 160
Free-agglomeration rule applied 22 times with reduction of 3 identical transitions.
Iterating global reduction 7 with 22 rules applied. Total rules applied 1131 place count 82 transition count 135
Reduce places removed 22 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 23 rules applied. Total rules applied 1154 place count 60 transition count 134
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 8 with 12 rules applied. Total rules applied 1166 place count 60 transition count 122
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 1168 place count 60 transition count 122
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 1169 place count 60 transition count 121
Applied a total of 1169 rules in 117 ms. Remains 60 /672 variables (removed 612) and now considering 121/780 (removed 659) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 117 ms. Remains : 60/672 places, 121/780 transitions.
Incomplete random walk after 10000 steps, including 1215 resets, run finished after 143 ms. (steps per millisecond=69 ) properties (out of 14) seen :13
Incomplete Best-First random walk after 10000 steps, including 161 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 121 rows 60 cols
[2024-05-30 23:12:01] [INFO ] Computed 4 invariants in 2 ms
[2024-05-30 23:12:01] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-30 23:12:01] [INFO ] After 62ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-30 23:12:01] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-30 23:12:01] [INFO ] After 23ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-30 23:12:01] [INFO ] State equation strengthened by 46 read => feed constraints.
[2024-05-30 23:12:01] [INFO ] After 8ms SMT Verify possible using 46 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-30 23:12:01] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-05-30 23:12:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 40 ms
[2024-05-30 23:12:01] [INFO ] After 53ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2024-05-30 23:12:01] [INFO ] After 116ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 14 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=14 )
Parikh walk visited 1 properties in 0 ms.
FORMULA StigmergyCommit-PT-02b-LTLFireability-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 126 stabilizing places and 132 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(X((F(p0)&&F(G(p1)))))))'
Support contains 4 out of 672 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 672/672 places, 780/780 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 658 transition count 766
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 658 transition count 766
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 37 place count 649 transition count 757
Iterating global reduction 0 with 9 rules applied. Total rules applied 46 place count 649 transition count 757
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 52 place count 643 transition count 751
Iterating global reduction 0 with 6 rules applied. Total rules applied 58 place count 643 transition count 751
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 64 place count 637 transition count 745
Iterating global reduction 0 with 6 rules applied. Total rules applied 70 place count 637 transition count 745
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 74 place count 633 transition count 741
Iterating global reduction 0 with 4 rules applied. Total rules applied 78 place count 633 transition count 741
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 81 place count 630 transition count 738
Iterating global reduction 0 with 3 rules applied. Total rules applied 84 place count 630 transition count 738
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 87 place count 627 transition count 735
Iterating global reduction 0 with 3 rules applied. Total rules applied 90 place count 627 transition count 735
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 93 place count 624 transition count 732
Iterating global reduction 0 with 3 rules applied. Total rules applied 96 place count 624 transition count 732
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 99 place count 621 transition count 729
Iterating global reduction 0 with 3 rules applied. Total rules applied 102 place count 621 transition count 729
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 105 place count 618 transition count 726
Iterating global reduction 0 with 3 rules applied. Total rules applied 108 place count 618 transition count 726
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 110 place count 616 transition count 724
Iterating global reduction 0 with 2 rules applied. Total rules applied 112 place count 616 transition count 724
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 114 place count 614 transition count 722
Iterating global reduction 0 with 2 rules applied. Total rules applied 116 place count 614 transition count 722
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 118 place count 612 transition count 720
Iterating global reduction 0 with 2 rules applied. Total rules applied 120 place count 612 transition count 720
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 122 place count 610 transition count 718
Iterating global reduction 0 with 2 rules applied. Total rules applied 124 place count 610 transition count 718
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 126 place count 608 transition count 716
Iterating global reduction 0 with 2 rules applied. Total rules applied 128 place count 608 transition count 716
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 129 place count 608 transition count 715
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 130 place count 607 transition count 714
Iterating global reduction 1 with 1 rules applied. Total rules applied 131 place count 607 transition count 714
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 132 place count 606 transition count 713
Iterating global reduction 1 with 1 rules applied. Total rules applied 133 place count 606 transition count 713
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 134 place count 605 transition count 712
Iterating global reduction 1 with 1 rules applied. Total rules applied 135 place count 605 transition count 712
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 136 place count 604 transition count 711
Iterating global reduction 1 with 1 rules applied. Total rules applied 137 place count 604 transition count 711
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 138 place count 603 transition count 710
Iterating global reduction 1 with 1 rules applied. Total rules applied 139 place count 603 transition count 710
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 140 place count 602 transition count 709
Iterating global reduction 1 with 1 rules applied. Total rules applied 141 place count 602 transition count 709
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 142 place count 601 transition count 708
Iterating global reduction 1 with 1 rules applied. Total rules applied 143 place count 601 transition count 708
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 144 place count 601 transition count 707
Applied a total of 144 rules in 315 ms. Remains 601 /672 variables (removed 71) and now considering 707/780 (removed 73) transitions.
// Phase 1: matrix 707 rows 601 cols
[2024-05-30 23:12:02] [INFO ] Computed 4 invariants in 11 ms
[2024-05-30 23:12:02] [INFO ] Implicit Places using invariants in 117 ms returned []
[2024-05-30 23:12:02] [INFO ] Invariant cache hit.
[2024-05-30 23:12:02] [INFO ] Implicit Places using invariants and state equation in 268 ms returned []
Implicit Place search using SMT with State Equation took 390 ms to find 0 implicit places.
[2024-05-30 23:12:02] [INFO ] Invariant cache hit.
[2024-05-30 23:12:03] [INFO ] Dead Transitions using invariants and state equation in 276 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 601/672 places, 707/780 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 984 ms. Remains : 601/672 places, 707/780 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 427 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : StigmergyCommit-PT-02b-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 4}, { cond=true, acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}], [{ cond=p1, acceptance={} source=5 dest: 5}, { cond=(NOT p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(AND (EQ s268 1) (EQ s590 1) (EQ s505 1)), p1:(EQ s133 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 67 steps with 0 reset in 3 ms.
FORMULA StigmergyCommit-PT-02b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-02b-LTLFireability-00 finished in 1470 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 672 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 672/672 places, 780/780 transitions.
Graph (trivial) has 664 edges and 672 vertex of which 53 / 672 are part of one of the 9 SCC in 2 ms
Free SCC test removed 44 places
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 463 transitions
Trivial Post-agglo rules discarded 463 transitions
Performed 463 trivial Post agglomeration. Transition count delta: 463
Iterating post reduction 0 with 463 rules applied. Total rules applied 464 place count 627 transition count 266
Reduce places removed 463 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 470 rules applied. Total rules applied 934 place count 164 transition count 259
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 937 place count 161 transition count 259
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 32 Pre rules applied. Total rules applied 937 place count 161 transition count 227
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 1001 place count 129 transition count 227
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 1011 place count 119 transition count 217
Iterating global reduction 3 with 10 rules applied. Total rules applied 1021 place count 119 transition count 217
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 1021 place count 119 transition count 214
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 1027 place count 116 transition count 214
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 1030 place count 113 transition count 211
Iterating global reduction 3 with 3 rules applied. Total rules applied 1033 place count 113 transition count 211
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1034 place count 113 transition count 210
Performed 25 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
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 1084 place count 88 transition count 184
Discarding 20 places :
Symmetric choice reduction at 4 with 20 rule applications. Total rules 1104 place count 68 transition count 124
Iterating global reduction 4 with 20 rules applied. Total rules applied 1124 place count 68 transition count 124
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 1133 place count 68 transition count 115
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 1144 place count 57 transition count 101
Iterating global reduction 5 with 11 rules applied. Total rules applied 1155 place count 57 transition count 101
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1156 place count 57 transition count 100
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 1166 place count 47 transition count 90
Iterating global reduction 6 with 10 rules applied. Total rules applied 1176 place count 47 transition count 90
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 1180 place count 47 transition count 86
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 1186 place count 44 transition count 83
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -10
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 1192 place count 41 transition count 93
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 1195 place count 41 transition count 90
Applied a total of 1195 rules in 55 ms. Remains 41 /672 variables (removed 631) and now considering 90/780 (removed 690) transitions.
[2024-05-30 23:12:03] [INFO ] Flow matrix only has 86 transitions (discarded 4 similar events)
// Phase 1: matrix 86 rows 41 cols
[2024-05-30 23:12:03] [INFO ] Computed 2 invariants in 1 ms
[2024-05-30 23:12:03] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-30 23:12:03] [INFO ] Flow matrix only has 86 transitions (discarded 4 similar events)
[2024-05-30 23:12:03] [INFO ] Invariant cache hit.
[2024-05-30 23:12:03] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-05-30 23:12:03] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
[2024-05-30 23:12:03] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-30 23:12:03] [INFO ] Flow matrix only has 86 transitions (discarded 4 similar events)
[2024-05-30 23:12:03] [INFO ] Invariant cache hit.
[2024-05-30 23:12:03] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 41/672 places, 90/780 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 259 ms. Remains : 41/672 places, 90/780 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-02b-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(NEQ s32 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 242 reset in 161 ms.
Product exploration explored 100000 steps with 292 reset in 63 ms.
Computed a total of 1 stabilizing places and 8 stable transitions
Computed a total of 1 stabilizing places and 8 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 74 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Finished random walk after 8062 steps, including 1336 resets, run visited all 1 properties in 29 ms. (steps per millisecond=278 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 455 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 41 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 41/41 places, 90/90 transitions.
Applied a total of 0 rules in 3 ms. Remains 41 /41 variables (removed 0) and now considering 90/90 (removed 0) transitions.
[2024-05-30 23:12:04] [INFO ] Flow matrix only has 86 transitions (discarded 4 similar events)
[2024-05-30 23:12:04] [INFO ] Invariant cache hit.
[2024-05-30 23:12:04] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-30 23:12:04] [INFO ] Flow matrix only has 86 transitions (discarded 4 similar events)
[2024-05-30 23:12:04] [INFO ] Invariant cache hit.
[2024-05-30 23:12:04] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-05-30 23:12:05] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
[2024-05-30 23:12:05] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-30 23:12:05] [INFO ] Flow matrix only has 86 transitions (discarded 4 similar events)
[2024-05-30 23:12:05] [INFO ] Invariant cache hit.
[2024-05-30 23:12:05] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 143 ms. Remains : 41/41 places, 90/90 transitions.
Computed a total of 1 stabilizing places and 8 stable transitions
Computed a total of 1 stabilizing places and 8 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 82 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 1648 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 251 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 436 steps, run visited all 1 properties in 10 ms. (steps per millisecond=43 )
Probabilistic random walk after 436 steps, saw 236 distinct states, run finished after 10 ms. (steps per millisecond=43 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 95 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 558 reset in 38 ms.
Product exploration explored 100000 steps with 52 reset in 60 ms.
Built C files in :
/tmp/ltsmin693911803612312655
[2024-05-30 23:12:05] [INFO ] Computing symmetric may disable matrix : 90 transitions.
[2024-05-30 23:12:05] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 23:12:05] [INFO ] Computing symmetric may enable matrix : 90 transitions.
[2024-05-30 23:12:05] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 23:12:05] [INFO ] Computing Do-Not-Accords matrix : 90 transitions.
[2024-05-30 23:12:05] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 23:12:05] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin693911803612312655
Running compilation step : cd /tmp/ltsmin693911803612312655;'/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 266 ms.
Running link step : cd /tmp/ltsmin693911803612312655;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin693911803612312655;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8008690242686967111.hoa' '--buchi-type=spotba'
LTSmin run took 111 ms.
FORMULA StigmergyCommit-PT-02b-LTLFireability-01 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property StigmergyCommit-PT-02b-LTLFireability-01 finished in 2629 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 1 out of 672 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 672/672 places, 780/780 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 657 transition count 765
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 657 transition count 765
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 40 place count 647 transition count 755
Iterating global reduction 0 with 10 rules applied. Total rules applied 50 place count 647 transition count 755
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 57 place count 640 transition count 748
Iterating global reduction 0 with 7 rules applied. Total rules applied 64 place count 640 transition count 748
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 71 place count 633 transition count 741
Iterating global reduction 0 with 7 rules applied. Total rules applied 78 place count 633 transition count 741
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 83 place count 628 transition count 736
Iterating global reduction 0 with 5 rules applied. Total rules applied 88 place count 628 transition count 736
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 91 place count 625 transition count 733
Iterating global reduction 0 with 3 rules applied. Total rules applied 94 place count 625 transition count 733
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 97 place count 622 transition count 730
Iterating global reduction 0 with 3 rules applied. Total rules applied 100 place count 622 transition count 730
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 103 place count 619 transition count 727
Iterating global reduction 0 with 3 rules applied. Total rules applied 106 place count 619 transition count 727
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 109 place count 616 transition count 724
Iterating global reduction 0 with 3 rules applied. Total rules applied 112 place count 616 transition count 724
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 115 place count 613 transition count 721
Iterating global reduction 0 with 3 rules applied. Total rules applied 118 place count 613 transition count 721
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 120 place count 611 transition count 719
Iterating global reduction 0 with 2 rules applied. Total rules applied 122 place count 611 transition count 719
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 124 place count 609 transition count 717
Iterating global reduction 0 with 2 rules applied. Total rules applied 126 place count 609 transition count 717
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 128 place count 607 transition count 715
Iterating global reduction 0 with 2 rules applied. Total rules applied 130 place count 607 transition count 715
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 132 place count 605 transition count 713
Iterating global reduction 0 with 2 rules applied. Total rules applied 134 place count 605 transition count 713
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 136 place count 603 transition count 711
Iterating global reduction 0 with 2 rules applied. Total rules applied 138 place count 603 transition count 711
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 139 place count 603 transition count 710
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 140 place count 602 transition count 709
Iterating global reduction 1 with 1 rules applied. Total rules applied 141 place count 602 transition count 709
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 142 place count 601 transition count 708
Iterating global reduction 1 with 1 rules applied. Total rules applied 143 place count 601 transition count 708
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 144 place count 600 transition count 707
Iterating global reduction 1 with 1 rules applied. Total rules applied 145 place count 600 transition count 707
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 146 place count 599 transition count 706
Iterating global reduction 1 with 1 rules applied. Total rules applied 147 place count 599 transition count 706
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 148 place count 598 transition count 705
Iterating global reduction 1 with 1 rules applied. Total rules applied 149 place count 598 transition count 705
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 150 place count 597 transition count 704
Iterating global reduction 1 with 1 rules applied. Total rules applied 151 place count 597 transition count 704
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 152 place count 596 transition count 703
Iterating global reduction 1 with 1 rules applied. Total rules applied 153 place count 596 transition count 703
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 154 place count 596 transition count 702
Applied a total of 154 rules in 271 ms. Remains 596 /672 variables (removed 76) and now considering 702/780 (removed 78) transitions.
// Phase 1: matrix 702 rows 596 cols
[2024-05-30 23:12:06] [INFO ] Computed 4 invariants in 7 ms
[2024-05-30 23:12:06] [INFO ] Implicit Places using invariants in 114 ms returned []
[2024-05-30 23:12:06] [INFO ] Invariant cache hit.
[2024-05-30 23:12:06] [INFO ] Implicit Places using invariants and state equation in 308 ms returned []
Implicit Place search using SMT with State Equation took 427 ms to find 0 implicit places.
[2024-05-30 23:12:06] [INFO ] Invariant cache hit.
[2024-05-30 23:12:07] [INFO ] Dead Transitions using invariants and state equation in 286 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 596/672 places, 702/780 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 987 ms. Remains : 596/672 places, 702/780 transitions.
Stuttering acceptance computed with spot in 87 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-02b-LTLFireability-02 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:(NEQ s82 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 130 steps with 1 reset in 2 ms.
FORMULA StigmergyCommit-PT-02b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-02b-LTLFireability-02 finished in 1094 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(F(p0)))'
Support contains 2 out of 672 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 672/672 places, 780/780 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 659 transition count 767
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 659 transition count 767
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 34 place count 651 transition count 759
Iterating global reduction 0 with 8 rules applied. Total rules applied 42 place count 651 transition count 759
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 48 place count 645 transition count 753
Iterating global reduction 0 with 6 rules applied. Total rules applied 54 place count 645 transition count 753
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 60 place count 639 transition count 747
Iterating global reduction 0 with 6 rules applied. Total rules applied 66 place count 639 transition count 747
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 71 place count 634 transition count 742
Iterating global reduction 0 with 5 rules applied. Total rules applied 76 place count 634 transition count 742
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 79 place count 631 transition count 739
Iterating global reduction 0 with 3 rules applied. Total rules applied 82 place count 631 transition count 739
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 85 place count 628 transition count 736
Iterating global reduction 0 with 3 rules applied. Total rules applied 88 place count 628 transition count 736
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 91 place count 625 transition count 733
Iterating global reduction 0 with 3 rules applied. Total rules applied 94 place count 625 transition count 733
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 97 place count 622 transition count 730
Iterating global reduction 0 with 3 rules applied. Total rules applied 100 place count 622 transition count 730
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 103 place count 619 transition count 727
Iterating global reduction 0 with 3 rules applied. Total rules applied 106 place count 619 transition count 727
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 108 place count 617 transition count 725
Iterating global reduction 0 with 2 rules applied. Total rules applied 110 place count 617 transition count 725
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 112 place count 615 transition count 723
Iterating global reduction 0 with 2 rules applied. Total rules applied 114 place count 615 transition count 723
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 116 place count 613 transition count 721
Iterating global reduction 0 with 2 rules applied. Total rules applied 118 place count 613 transition count 721
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 120 place count 611 transition count 719
Iterating global reduction 0 with 2 rules applied. Total rules applied 122 place count 611 transition count 719
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 124 place count 609 transition count 717
Iterating global reduction 0 with 2 rules applied. Total rules applied 126 place count 609 transition count 717
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 127 place count 609 transition count 716
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 128 place count 608 transition count 715
Iterating global reduction 1 with 1 rules applied. Total rules applied 129 place count 608 transition count 715
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 130 place count 607 transition count 714
Iterating global reduction 1 with 1 rules applied. Total rules applied 131 place count 607 transition count 714
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 132 place count 606 transition count 713
Iterating global reduction 1 with 1 rules applied. Total rules applied 133 place count 606 transition count 713
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 134 place count 605 transition count 712
Iterating global reduction 1 with 1 rules applied. Total rules applied 135 place count 605 transition count 712
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 136 place count 604 transition count 711
Iterating global reduction 1 with 1 rules applied. Total rules applied 137 place count 604 transition count 711
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 138 place count 603 transition count 710
Iterating global reduction 1 with 1 rules applied. Total rules applied 139 place count 603 transition count 710
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 140 place count 602 transition count 709
Iterating global reduction 1 with 1 rules applied. Total rules applied 141 place count 602 transition count 709
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 142 place count 602 transition count 708
Applied a total of 142 rules in 293 ms. Remains 602 /672 variables (removed 70) and now considering 708/780 (removed 72) transitions.
// Phase 1: matrix 708 rows 602 cols
[2024-05-30 23:12:07] [INFO ] Computed 4 invariants in 10 ms
[2024-05-30 23:12:07] [INFO ] Implicit Places using invariants in 116 ms returned []
[2024-05-30 23:12:07] [INFO ] Invariant cache hit.
[2024-05-30 23:12:07] [INFO ] Implicit Places using invariants and state equation in 269 ms returned []
Implicit Place search using SMT with State Equation took 388 ms to find 0 implicit places.
[2024-05-30 23:12:07] [INFO ] Invariant cache hit.
[2024-05-30 23:12:08] [INFO ] Dead Transitions using invariants and state equation in 278 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 602/672 places, 708/780 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 961 ms. Remains : 602/672 places, 708/780 transitions.
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-02b-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (NEQ s263 1) (NEQ s453 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][false, false]]
Product exploration explored 100000 steps with 50000 reset in 408 ms.
Product exploration explored 100000 steps with 50000 reset in 370 ms.
Computed a total of 123 stabilizing places and 129 stable transitions
Computed a total of 123 stabilizing places and 129 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 16 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA StigmergyCommit-PT-02b-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyCommit-PT-02b-LTLFireability-03 finished in 1846 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 U (p1||G(!p0))))))'
Support contains 4 out of 672 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 672/672 places, 780/780 transitions.
Graph (trivial) has 662 edges and 672 vertex of which 53 / 672 are part of one of the 9 SCC in 1 ms
Free SCC test removed 44 places
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 462 transitions
Trivial Post-agglo rules discarded 462 transitions
Performed 462 trivial Post agglomeration. Transition count delta: 462
Iterating post reduction 0 with 462 rules applied. Total rules applied 463 place count 627 transition count 267
Reduce places removed 462 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 469 rules applied. Total rules applied 932 place count 165 transition count 260
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 935 place count 162 transition count 260
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 32 Pre rules applied. Total rules applied 935 place count 162 transition count 228
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 999 place count 130 transition count 228
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 1008 place count 121 transition count 219
Iterating global reduction 3 with 9 rules applied. Total rules applied 1017 place count 121 transition count 219
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 1017 place count 121 transition count 216
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 1023 place count 118 transition count 216
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1025 place count 116 transition count 214
Iterating global reduction 3 with 2 rules applied. Total rules applied 1027 place count 116 transition count 214
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1028 place count 116 transition count 213
Performed 25 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
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 1078 place count 91 transition count 186
Discarding 20 places :
Symmetric choice reduction at 4 with 20 rule applications. Total rules 1098 place count 71 transition count 126
Iterating global reduction 4 with 20 rules applied. Total rules applied 1118 place count 71 transition count 126
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 1126 place count 71 transition count 118
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 1137 place count 60 transition count 104
Iterating global reduction 5 with 11 rules applied. Total rules applied 1148 place count 60 transition count 104
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1149 place count 60 transition count 103
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 1159 place count 50 transition count 93
Iterating global reduction 6 with 10 rules applied. Total rules applied 1169 place count 50 transition count 93
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 1173 place count 50 transition count 89
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 1179 place count 47 transition count 86
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -13
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 1185 place count 44 transition count 99
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 1188 place count 44 transition count 96
Applied a total of 1188 rules in 37 ms. Remains 44 /672 variables (removed 628) and now considering 96/780 (removed 684) transitions.
[2024-05-30 23:12:09] [INFO ] Flow matrix only has 92 transitions (discarded 4 similar events)
// Phase 1: matrix 92 rows 44 cols
[2024-05-30 23:12:09] [INFO ] Computed 2 invariants in 0 ms
[2024-05-30 23:12:09] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-30 23:12:09] [INFO ] Flow matrix only has 92 transitions (discarded 4 similar events)
[2024-05-30 23:12:09] [INFO ] Invariant cache hit.
[2024-05-30 23:12:09] [INFO ] State equation strengthened by 19 read => feed constraints.
[2024-05-30 23:12:09] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
[2024-05-30 23:12:09] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-30 23:12:09] [INFO ] Flow matrix only has 92 transitions (discarded 4 similar events)
[2024-05-30 23:12:09] [INFO ] Invariant cache hit.
[2024-05-30 23:12:09] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 44/672 places, 96/780 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 172 ms. Remains : 44/672 places, 96/780 transitions.
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : StigmergyCommit-PT-02b-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (NEQ s11 1) (NOT (AND (EQ s6 1) (EQ s21 1) (EQ s33 1)))), p0:(AND (EQ s6 1) (EQ s21 1) (EQ s33 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 190 reset in 145 ms.
Product exploration explored 100000 steps with 232 reset in 206 ms.
Computed a total of 1 stabilizing places and 8 stable transitions
Computed a total of 1 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 88 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Incomplete random walk after 10000 steps, including 1543 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 2) seen :1
Finished Best-First random walk after 741 steps, including 16 resets, run visited all 1 properties in 6 ms. (steps per millisecond=123 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 157 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 84 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Support contains 4 out of 44 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 44/44 places, 96/96 transitions.
Applied a total of 0 rules in 7 ms. Remains 44 /44 variables (removed 0) and now considering 96/96 (removed 0) transitions.
[2024-05-30 23:12:10] [INFO ] Flow matrix only has 92 transitions (discarded 4 similar events)
[2024-05-30 23:12:10] [INFO ] Invariant cache hit.
[2024-05-30 23:12:10] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-30 23:12:10] [INFO ] Flow matrix only has 92 transitions (discarded 4 similar events)
[2024-05-30 23:12:10] [INFO ] Invariant cache hit.
[2024-05-30 23:12:10] [INFO ] State equation strengthened by 19 read => feed constraints.
[2024-05-30 23:12:10] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
[2024-05-30 23:12:10] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-30 23:12:10] [INFO ] Flow matrix only has 92 transitions (discarded 4 similar events)
[2024-05-30 23:12:10] [INFO ] Invariant cache hit.
[2024-05-30 23:12:10] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 166 ms. Remains : 44/44 places, 96/96 transitions.
Computed a total of 1 stabilizing places and 8 stable transitions
Computed a total of 1 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 92 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Finished random walk after 7509 steps, including 1147 resets, run visited all 2 properties in 19 ms. (steps per millisecond=395 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 132 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 93 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 65 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 67 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 1368 reset in 49 ms.
Product exploration explored 100000 steps with 913 reset in 40 ms.
Built C files in :
/tmp/ltsmin16963229303447148615
[2024-05-30 23:12:11] [INFO ] Computing symmetric may disable matrix : 96 transitions.
[2024-05-30 23:12:11] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 23:12:11] [INFO ] Computing symmetric may enable matrix : 96 transitions.
[2024-05-30 23:12:11] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 23:12:11] [INFO ] Computing Do-Not-Accords matrix : 96 transitions.
[2024-05-30 23:12:11] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 23:12:11] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16963229303447148615
Running compilation step : cd /tmp/ltsmin16963229303447148615;'/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 195 ms.
Running link step : cd /tmp/ltsmin16963229303447148615;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin16963229303447148615;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased44555048177306678.hoa' '--buchi-type=spotba'
LTSmin run took 124 ms.
FORMULA StigmergyCommit-PT-02b-LTLFireability-04 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property StigmergyCommit-PT-02b-LTLFireability-04 finished in 2398 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 672 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 672/672 places, 780/780 transitions.
Graph (trivial) has 664 edges and 672 vertex of which 53 / 672 are part of one of the 9 SCC in 1 ms
Free SCC test removed 44 places
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Drop transitions removed 462 transitions
Trivial Post-agglo rules discarded 462 transitions
Performed 462 trivial Post agglomeration. Transition count delta: 462
Iterating post reduction 0 with 462 rules applied. Total rules applied 463 place count 628 transition count 268
Reduce places removed 462 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 469 rules applied. Total rules applied 932 place count 166 transition count 261
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 936 place count 163 transition count 260
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 937 place count 162 transition count 260
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 33 Pre rules applied. Total rules applied 937 place count 162 transition count 227
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 4 with 66 rules applied. Total rules applied 1003 place count 129 transition count 227
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 1012 place count 120 transition count 218
Iterating global reduction 4 with 9 rules applied. Total rules applied 1021 place count 120 transition count 218
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 1021 place count 120 transition count 216
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 1025 place count 118 transition count 216
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 1028 place count 115 transition count 213
Iterating global reduction 4 with 3 rules applied. Total rules applied 1031 place count 115 transition count 213
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1032 place count 115 transition count 212
Performed 27 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 5 with 54 rules applied. Total rules applied 1086 place count 88 transition count 183
Discarding 19 places :
Symmetric choice reduction at 5 with 19 rule applications. Total rules 1105 place count 69 transition count 124
Iterating global reduction 5 with 19 rules applied. Total rules applied 1124 place count 69 transition count 124
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 1133 place count 69 transition count 115
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 1143 place count 59 transition count 102
Iterating global reduction 6 with 10 rules applied. Total rules applied 1153 place count 59 transition count 102
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1154 place count 59 transition count 101
Discarding 9 places :
Symmetric choice reduction at 7 with 9 rule applications. Total rules 1163 place count 50 transition count 92
Iterating global reduction 7 with 9 rules applied. Total rules applied 1172 place count 50 transition count 92
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 1175 place count 50 transition count 89
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 1181 place count 47 transition count 86
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 1187 place count 44 transition count 96
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 1190 place count 44 transition count 93
Applied a total of 1190 rules in 28 ms. Remains 44 /672 variables (removed 628) and now considering 93/780 (removed 687) transitions.
[2024-05-30 23:12:11] [INFO ] Flow matrix only has 89 transitions (discarded 4 similar events)
// Phase 1: matrix 89 rows 44 cols
[2024-05-30 23:12:11] [INFO ] Computed 2 invariants in 1 ms
[2024-05-30 23:12:11] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-30 23:12:11] [INFO ] Flow matrix only has 89 transitions (discarded 4 similar events)
[2024-05-30 23:12:11] [INFO ] Invariant cache hit.
[2024-05-30 23:12:11] [INFO ] State equation strengthened by 28 read => feed constraints.
[2024-05-30 23:12:11] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
[2024-05-30 23:12:11] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-30 23:12:11] [INFO ] Flow matrix only has 89 transitions (discarded 4 similar events)
[2024-05-30 23:12:11] [INFO ] Invariant cache hit.
[2024-05-30 23:12:11] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 44/672 places, 93/780 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 161 ms. Remains : 44/672 places, 93/780 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-02b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s0 1) (EQ s20 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA StigmergyCommit-PT-02b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-02b-LTLFireability-05 finished in 245 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)) U (F(G(p1))||(p0&&G(p2)))))'
Support contains 3 out of 672 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 672/672 places, 780/780 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 660 transition count 768
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 660 transition count 768
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 31 place count 653 transition count 761
Iterating global reduction 0 with 7 rules applied. Total rules applied 38 place count 653 transition count 761
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 44 place count 647 transition count 755
Iterating global reduction 0 with 6 rules applied. Total rules applied 50 place count 647 transition count 755
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 56 place count 641 transition count 749
Iterating global reduction 0 with 6 rules applied. Total rules applied 62 place count 641 transition count 749
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 66 place count 637 transition count 745
Iterating global reduction 0 with 4 rules applied. Total rules applied 70 place count 637 transition count 745
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 72 place count 635 transition count 743
Iterating global reduction 0 with 2 rules applied. Total rules applied 74 place count 635 transition count 743
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 76 place count 633 transition count 741
Iterating global reduction 0 with 2 rules applied. Total rules applied 78 place count 633 transition count 741
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 80 place count 631 transition count 739
Iterating global reduction 0 with 2 rules applied. Total rules applied 82 place count 631 transition count 739
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 84 place count 629 transition count 737
Iterating global reduction 0 with 2 rules applied. Total rules applied 86 place count 629 transition count 737
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 88 place count 627 transition count 735
Iterating global reduction 0 with 2 rules applied. Total rules applied 90 place count 627 transition count 735
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 91 place count 626 transition count 734
Iterating global reduction 0 with 1 rules applied. Total rules applied 92 place count 626 transition count 734
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 93 place count 625 transition count 733
Iterating global reduction 0 with 1 rules applied. Total rules applied 94 place count 625 transition count 733
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 95 place count 624 transition count 732
Iterating global reduction 0 with 1 rules applied. Total rules applied 96 place count 624 transition count 732
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 97 place count 623 transition count 731
Iterating global reduction 0 with 1 rules applied. Total rules applied 98 place count 623 transition count 731
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 99 place count 622 transition count 730
Iterating global reduction 0 with 1 rules applied. Total rules applied 100 place count 622 transition count 730
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 101 place count 622 transition count 729
Applied a total of 101 rules in 201 ms. Remains 622 /672 variables (removed 50) and now considering 729/780 (removed 51) transitions.
// Phase 1: matrix 729 rows 622 cols
[2024-05-30 23:12:11] [INFO ] Computed 4 invariants in 11 ms
[2024-05-30 23:12:12] [INFO ] Implicit Places using invariants in 130 ms returned []
[2024-05-30 23:12:12] [INFO ] Invariant cache hit.
[2024-05-30 23:12:12] [INFO ] Implicit Places using invariants and state equation in 311 ms returned []
Implicit Place search using SMT with State Equation took 443 ms to find 0 implicit places.
[2024-05-30 23:12:12] [INFO ] Invariant cache hit.
[2024-05-30 23:12:12] [INFO ] Dead Transitions using invariants and state equation in 294 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 622/672 places, 729/780 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 940 ms. Remains : 622/672 places, 729/780 transitions.
Stuttering acceptance computed with spot in 203 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) p0 (NOT p2))]
Running random walk in product with property : StigmergyCommit-PT-02b-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(OR (AND p1 (NOT p0)) (AND p1 (NOT p2))), acceptance={1} source=0 dest: 0}, { cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p1) (NOT p2))), acceptance={0, 1} source=0 dest: 0}, { cond=(OR (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND p1 p0 p2), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p0 p2), acceptance={0} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND p1 p0 (NOT p2)), acceptance={1} source=2 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0, 1} source=2 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND p1 p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 4}], [{ cond=p1, acceptance={1} source=3 dest: 3}, { cond=(NOT p1), acceptance={0, 1} source=3 dest: 3}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(AND p0 p2), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(NEQ s338 1), p0:(EQ s73 1), p2:(EQ s621 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 1643 reset in 100 ms.
Product exploration explored 100000 steps with 1216 reset in 141 ms.
Computed a total of 125 stabilizing places and 131 stable transitions
Computed a total of 125 stabilizing places and 131 stable transitions
Detected a total of 125/622 stabilizing places and 131/729 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0) (NOT p2)), (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p1) (NOT p2))))), (X (NOT (AND p1 p2))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (OR (AND p1 (NOT p0)) (AND p1 (NOT p2)))), (X (NOT (AND p1 p0 p2))), (X (NOT (AND (NOT p1) p0 p2))), (X (OR (NOT p0) (NOT p2))), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND p1 p0 (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X (NOT p0)), (X (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p1) (NOT p2)))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (OR (AND p1 (NOT p0)) (AND p1 (NOT p2))))), (X (X (NOT (AND p1 p0 p2)))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (OR (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X (AND p1 p2))), (X (X (NOT (AND p1 p2)))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 27 factoid took 1058 ms. Reduced automaton from 5 states, 18 edges and 3 AP (stutter sensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(NOT p1)]
Incomplete random walk after 10000 steps, including 165 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1049571 steps, run timeout after 3001 ms. (steps per millisecond=349 ) properties seen :{}
Probabilistic random walk after 1049571 steps, saw 229671 distinct states, run finished after 3004 ms. (steps per millisecond=349 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-30 23:12:17] [INFO ] Invariant cache hit.
[2024-05-30 23:12:17] [INFO ] [Real]Absence check using 4 positive place invariants in 5 ms returned sat
[2024-05-30 23:12:17] [INFO ] After 213ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-30 23:12:17] [INFO ] Deduced a trap composed of 300 places in 127 ms of which 0 ms to minimize.
[2024-05-30 23:12:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 192 ms
[2024-05-30 23:12:17] [INFO ] After 438ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-30 23:12:17] [INFO ] After 533ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-30 23:12:17] [INFO ] [Nat]Absence check using 4 positive place invariants in 5 ms returned sat
[2024-05-30 23:12:18] [INFO ] After 205ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-30 23:12:18] [INFO ] Deduced a trap composed of 300 places in 138 ms of which 1 ms to minimize.
[2024-05-30 23:12:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 191 ms
[2024-05-30 23:12:18] [INFO ] After 413ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 23 ms.
[2024-05-30 23:12:18] [INFO ] After 524ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 622 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 622/622 places, 729/729 transitions.
Graph (trivial) has 617 edges and 622 vertex of which 51 / 622 are part of one of the 9 SCC in 1 ms
Free SCC test removed 42 places
Drop transitions removed 57 transitions
Reduce isomorphic transitions removed 57 transitions.
Graph (complete) has 856 edges and 580 vertex of which 577 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 434 transitions
Trivial Post-agglo rules discarded 434 transitions
Performed 434 trivial Post agglomeration. Transition count delta: 434
Iterating post reduction 0 with 437 rules applied. Total rules applied 439 place count 577 transition count 235
Reduce places removed 434 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 443 rules applied. Total rules applied 882 place count 143 transition count 226
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 885 place count 140 transition count 226
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 35 Pre rules applied. Total rules applied 885 place count 140 transition count 191
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 955 place count 105 transition count 191
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 956 place count 104 transition count 190
Iterating global reduction 3 with 1 rules applied. Total rules applied 957 place count 104 transition count 190
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 957 place count 104 transition count 189
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 959 place count 103 transition count 189
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 1005 place count 80 transition count 166
Drop transitions removed 1 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 1012 place count 80 transition count 159
Discarding 19 places :
Symmetric choice reduction at 4 with 19 rule applications. Total rules 1031 place count 61 transition count 103
Iterating global reduction 4 with 19 rules applied. Total rules applied 1050 place count 61 transition count 103
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 1060 place count 61 transition count 93
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 1069 place count 52 transition count 84
Iterating global reduction 5 with 9 rules applied. Total rules applied 1078 place count 52 transition count 84
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 1084 place count 46 transition count 78
Iterating global reduction 5 with 6 rules applied. Total rules applied 1090 place count 46 transition count 78
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 1093 place count 46 transition count 75
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 1099 place count 43 transition count 72
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 1107 place count 39 transition count 92
Free-agglomeration rule applied 17 times with reduction of 7 identical transitions.
Iterating global reduction 6 with 17 rules applied. Total rules applied 1124 place count 39 transition count 68
Reduce places removed 17 places and 0 transitions.
Drop transitions removed 4 transitions
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 6 with 33 rules applied. Total rules applied 1157 place count 22 transition count 52
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 1160 place count 19 transition count 49
Iterating global reduction 7 with 3 rules applied. Total rules applied 1163 place count 19 transition count 49
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 1166 place count 19 transition count 46
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 8 with 12 rules applied. Total rules applied 1178 place count 19 transition count 34
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 1180 place count 19 transition count 34
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 1181 place count 19 transition count 33
Applied a total of 1181 rules in 25 ms. Remains 19 /622 variables (removed 603) and now considering 33/729 (removed 696) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 19/622 places, 33/729 transitions.
Finished random walk after 24 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=24 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 (NOT p0) (NOT p2)), (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p1) (NOT p2))))), (X (NOT (AND p1 p2))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (OR (AND p1 (NOT p0)) (AND p1 (NOT p2)))), (X (NOT (AND p1 p0 p2))), (X (NOT (AND (NOT p1) p0 p2))), (X (OR (NOT p0) (NOT p2))), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND p1 p0 (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X (NOT p0)), (X (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p1) (NOT p2)))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (OR (AND p1 (NOT p0)) (AND p1 (NOT p2))))), (X (X (NOT (AND p1 p0 p2)))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (OR (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X (AND p1 p2))), (X (X (NOT (AND p1 p2)))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (NOT p1))]
Knowledge based reduction with 27 factoid took 2834 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p1)]
Support contains 1 out of 622 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 622/622 places, 729/729 transitions.
Graph (trivial) has 613 edges and 622 vertex of which 51 / 622 are part of one of the 9 SCC in 2 ms
Free SCC test removed 42 places
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 425 transitions
Trivial Post-agglo rules discarded 425 transitions
Performed 425 trivial Post agglomeration. Transition count delta: 425
Iterating post reduction 0 with 425 rules applied. Total rules applied 426 place count 579 transition count 255
Reduce places removed 425 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 434 rules applied. Total rules applied 860 place count 154 transition count 246
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 863 place count 151 transition count 246
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 32 Pre rules applied. Total rules applied 863 place count 151 transition count 214
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 927 place count 119 transition count 214
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 929 place count 117 transition count 212
Iterating global reduction 3 with 2 rules applied. Total rules applied 931 place count 117 transition count 212
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 3 with 52 rules applied. Total rules applied 983 place count 91 transition count 186
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 1002 place count 72 transition count 127
Iterating global reduction 3 with 19 rules applied. Total rules applied 1021 place count 72 transition count 127
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 1031 place count 72 transition count 117
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 1039 place count 64 transition count 107
Iterating global reduction 4 with 8 rules applied. Total rules applied 1047 place count 64 transition count 107
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 1055 place count 56 transition count 99
Iterating global reduction 4 with 8 rules applied. Total rules applied 1063 place count 56 transition count 99
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 1066 place count 56 transition count 96
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 1074 place count 52 transition count 92
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 1080 place count 49 transition count 102
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 1083 place count 49 transition count 99
Applied a total of 1083 rules in 26 ms. Remains 49 /622 variables (removed 573) and now considering 99/729 (removed 630) transitions.
[2024-05-30 23:12:21] [INFO ] Flow matrix only has 95 transitions (discarded 4 similar events)
// Phase 1: matrix 95 rows 49 cols
[2024-05-30 23:12:21] [INFO ] Computed 2 invariants in 0 ms
[2024-05-30 23:12:21] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-30 23:12:21] [INFO ] Flow matrix only has 95 transitions (discarded 4 similar events)
[2024-05-30 23:12:21] [INFO ] Invariant cache hit.
[2024-05-30 23:12:21] [INFO ] State equation strengthened by 28 read => feed constraints.
[2024-05-30 23:12:21] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
[2024-05-30 23:12:21] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-30 23:12:21] [INFO ] Flow matrix only has 95 transitions (discarded 4 similar events)
[2024-05-30 23:12:21] [INFO ] Invariant cache hit.
[2024-05-30 23:12:21] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 49/622 places, 99/729 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 167 ms. Remains : 49/622 places, 99/729 transitions.
Computed a total of 3 stabilizing places and 10 stable transitions
Computed a total of 3 stabilizing places and 10 stable transitions
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 75 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 44 ms :[(NOT p1)]
Incomplete random walk after 10000 steps, including 1213 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 249 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 5019 steps, run visited all 1 properties in 8 ms. (steps per millisecond=627 )
Probabilistic random walk after 5019 steps, saw 1704 distinct states, run finished after 8 ms. (steps per millisecond=627 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 102 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 56 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 41 ms :[(NOT p1)]
Product exploration explored 100000 steps with 1065 reset in 40 ms.
Product exploration explored 100000 steps with 59 reset in 34 ms.
Built C files in :
/tmp/ltsmin15315877036663545641
[2024-05-30 23:12:21] [INFO ] Computing symmetric may disable matrix : 99 transitions.
[2024-05-30 23:12:21] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 23:12:21] [INFO ] Computing symmetric may enable matrix : 99 transitions.
[2024-05-30 23:12:21] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 23:12:21] [INFO ] Computing Do-Not-Accords matrix : 99 transitions.
[2024-05-30 23:12:21] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 23:12:21] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15315877036663545641
Running compilation step : cd /tmp/ltsmin15315877036663545641;'/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 369 ms.
Running link step : cd /tmp/ltsmin15315877036663545641;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin15315877036663545641;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased3443390901949906431.hoa' '--buchi-type=spotba'
LTSmin run took 111 ms.
FORMULA StigmergyCommit-PT-02b-LTLFireability-06 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property StigmergyCommit-PT-02b-LTLFireability-06 finished in 10763 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((F(G(p0))&&F(p1)))||G(p2))))'
Support contains 5 out of 672 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 672/672 places, 780/780 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 659 transition count 767
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 659 transition count 767
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 35 place count 650 transition count 758
Iterating global reduction 0 with 9 rules applied. Total rules applied 44 place count 650 transition count 758
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 50 place count 644 transition count 752
Iterating global reduction 0 with 6 rules applied. Total rules applied 56 place count 644 transition count 752
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 62 place count 638 transition count 746
Iterating global reduction 0 with 6 rules applied. Total rules applied 68 place count 638 transition count 746
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 72 place count 634 transition count 742
Iterating global reduction 0 with 4 rules applied. Total rules applied 76 place count 634 transition count 742
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 79 place count 631 transition count 739
Iterating global reduction 0 with 3 rules applied. Total rules applied 82 place count 631 transition count 739
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 85 place count 628 transition count 736
Iterating global reduction 0 with 3 rules applied. Total rules applied 88 place count 628 transition count 736
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 91 place count 625 transition count 733
Iterating global reduction 0 with 3 rules applied. Total rules applied 94 place count 625 transition count 733
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 97 place count 622 transition count 730
Iterating global reduction 0 with 3 rules applied. Total rules applied 100 place count 622 transition count 730
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 103 place count 619 transition count 727
Iterating global reduction 0 with 3 rules applied. Total rules applied 106 place count 619 transition count 727
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 108 place count 617 transition count 725
Iterating global reduction 0 with 2 rules applied. Total rules applied 110 place count 617 transition count 725
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 112 place count 615 transition count 723
Iterating global reduction 0 with 2 rules applied. Total rules applied 114 place count 615 transition count 723
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 116 place count 613 transition count 721
Iterating global reduction 0 with 2 rules applied. Total rules applied 118 place count 613 transition count 721
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 120 place count 611 transition count 719
Iterating global reduction 0 with 2 rules applied. Total rules applied 122 place count 611 transition count 719
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 124 place count 609 transition count 717
Iterating global reduction 0 with 2 rules applied. Total rules applied 126 place count 609 transition count 717
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 127 place count 609 transition count 716
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 128 place count 608 transition count 715
Iterating global reduction 1 with 1 rules applied. Total rules applied 129 place count 608 transition count 715
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 130 place count 607 transition count 714
Iterating global reduction 1 with 1 rules applied. Total rules applied 131 place count 607 transition count 714
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 132 place count 606 transition count 713
Iterating global reduction 1 with 1 rules applied. Total rules applied 133 place count 606 transition count 713
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 134 place count 605 transition count 712
Iterating global reduction 1 with 1 rules applied. Total rules applied 135 place count 605 transition count 712
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 136 place count 604 transition count 711
Iterating global reduction 1 with 1 rules applied. Total rules applied 137 place count 604 transition count 711
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 138 place count 603 transition count 710
Iterating global reduction 1 with 1 rules applied. Total rules applied 139 place count 603 transition count 710
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 140 place count 602 transition count 709
Iterating global reduction 1 with 1 rules applied. Total rules applied 141 place count 602 transition count 709
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 142 place count 602 transition count 708
Applied a total of 142 rules in 280 ms. Remains 602 /672 variables (removed 70) and now considering 708/780 (removed 72) transitions.
// Phase 1: matrix 708 rows 602 cols
[2024-05-30 23:12:22] [INFO ] Computed 4 invariants in 8 ms
[2024-05-30 23:12:22] [INFO ] Implicit Places using invariants in 119 ms returned []
[2024-05-30 23:12:22] [INFO ] Invariant cache hit.
[2024-05-30 23:12:23] [INFO ] Implicit Places using invariants and state equation in 336 ms returned []
Implicit Place search using SMT with State Equation took 460 ms to find 0 implicit places.
[2024-05-30 23:12:23] [INFO ] Invariant cache hit.
[2024-05-30 23:12:23] [INFO ] Dead Transitions using invariants and state equation in 270 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 602/672 places, 708/780 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1011 ms. Remains : 602/672 places, 708/780 transitions.
Stuttering acceptance computed with spot in 221 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : StigmergyCommit-PT-02b-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(NOT p2), acceptance={} source=1 dest: 4}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 2}, { cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(EQ s548 1), p0:(EQ s510 0), p1:(AND (EQ s62 1) (EQ s255 1) (EQ s427 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 50 steps with 0 reset in 0 ms.
FORMULA StigmergyCommit-PT-02b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-02b-LTLFireability-07 finished in 1255 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((G(p1)&&p0)) U p2))'
Support contains 2 out of 672 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 672/672 places, 780/780 transitions.
Graph (trivial) has 664 edges and 672 vertex of which 53 / 672 are part of one of the 9 SCC in 3 ms
Free SCC test removed 44 places
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 465 transitions
Trivial Post-agglo rules discarded 465 transitions
Performed 465 trivial Post agglomeration. Transition count delta: 465
Iterating post reduction 0 with 465 rules applied. Total rules applied 466 place count 627 transition count 264
Reduce places removed 465 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 472 rules applied. Total rules applied 938 place count 162 transition count 257
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 941 place count 159 transition count 257
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 32 Pre rules applied. Total rules applied 941 place count 159 transition count 225
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 1005 place count 127 transition count 225
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 1013 place count 119 transition count 217
Iterating global reduction 3 with 8 rules applied. Total rules applied 1021 place count 119 transition count 217
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 1021 place count 119 transition count 216
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1023 place count 118 transition count 216
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 1026 place count 115 transition count 213
Iterating global reduction 3 with 3 rules applied. Total rules applied 1029 place count 115 transition count 213
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1030 place count 115 transition count 212
Performed 27 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 4 with 54 rules applied. Total rules applied 1084 place count 88 transition count 183
Discarding 18 places :
Symmetric choice reduction at 4 with 18 rule applications. Total rules 1102 place count 70 transition count 131
Iterating global reduction 4 with 18 rules applied. Total rules applied 1120 place count 70 transition count 131
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 1127 place count 70 transition count 124
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 1138 place count 59 transition count 110
Iterating global reduction 5 with 11 rules applied. Total rules applied 1149 place count 59 transition count 110
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1150 place count 59 transition count 109
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 1160 place count 49 transition count 99
Iterating global reduction 6 with 10 rules applied. Total rules applied 1170 place count 49 transition count 99
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 1174 place count 49 transition count 95
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 1180 place count 46 transition count 92
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -10
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 1186 place count 43 transition count 102
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 1189 place count 43 transition count 99
Applied a total of 1189 rules in 33 ms. Remains 43 /672 variables (removed 629) and now considering 99/780 (removed 681) transitions.
[2024-05-30 23:12:23] [INFO ] Flow matrix only has 95 transitions (discarded 4 similar events)
// Phase 1: matrix 95 rows 43 cols
[2024-05-30 23:12:23] [INFO ] Computed 2 invariants in 1 ms
[2024-05-30 23:12:23] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-30 23:12:23] [INFO ] Flow matrix only has 95 transitions (discarded 4 similar events)
[2024-05-30 23:12:23] [INFO ] Invariant cache hit.
[2024-05-30 23:12:23] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-05-30 23:12:23] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
[2024-05-30 23:12:23] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-30 23:12:23] [INFO ] Flow matrix only has 95 transitions (discarded 4 similar events)
[2024-05-30 23:12:23] [INFO ] Invariant cache hit.
[2024-05-30 23:12:23] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 43/672 places, 99/780 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 199 ms. Remains : 43/672 places, 99/780 transitions.
Stuttering acceptance computed with spot in 121 ms :[(NOT p2), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : StigmergyCommit-PT-02b-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(OR (AND (NOT p2) (NOT p0)) (AND (NOT p2) (NOT p1))), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p0 p1), acceptance={} source=0 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p2:(EQ s6 1), p0:(AND (EQ s6 1) (EQ s18 1)), p1:(EQ s18 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 3 steps with 0 reset in 0 ms.
FORMULA StigmergyCommit-PT-02b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-02b-LTLFireability-08 finished in 339 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(G(p1))))'
Support contains 3 out of 672 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 672/672 places, 780/780 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 658 transition count 766
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 658 transition count 766
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 37 place count 649 transition count 757
Iterating global reduction 0 with 9 rules applied. Total rules applied 46 place count 649 transition count 757
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 52 place count 643 transition count 751
Iterating global reduction 0 with 6 rules applied. Total rules applied 58 place count 643 transition count 751
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 64 place count 637 transition count 745
Iterating global reduction 0 with 6 rules applied. Total rules applied 70 place count 637 transition count 745
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 74 place count 633 transition count 741
Iterating global reduction 0 with 4 rules applied. Total rules applied 78 place count 633 transition count 741
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 80 place count 631 transition count 739
Iterating global reduction 0 with 2 rules applied. Total rules applied 82 place count 631 transition count 739
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 84 place count 629 transition count 737
Iterating global reduction 0 with 2 rules applied. Total rules applied 86 place count 629 transition count 737
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 88 place count 627 transition count 735
Iterating global reduction 0 with 2 rules applied. Total rules applied 90 place count 627 transition count 735
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 92 place count 625 transition count 733
Iterating global reduction 0 with 2 rules applied. Total rules applied 94 place count 625 transition count 733
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 96 place count 623 transition count 731
Iterating global reduction 0 with 2 rules applied. Total rules applied 98 place count 623 transition count 731
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 99 place count 622 transition count 730
Iterating global reduction 0 with 1 rules applied. Total rules applied 100 place count 622 transition count 730
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 101 place count 621 transition count 729
Iterating global reduction 0 with 1 rules applied. Total rules applied 102 place count 621 transition count 729
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 103 place count 620 transition count 728
Iterating global reduction 0 with 1 rules applied. Total rules applied 104 place count 620 transition count 728
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 105 place count 619 transition count 727
Iterating global reduction 0 with 1 rules applied. Total rules applied 106 place count 619 transition count 727
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 107 place count 618 transition count 726
Iterating global reduction 0 with 1 rules applied. Total rules applied 108 place count 618 transition count 726
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 109 place count 617 transition count 725
Iterating global reduction 0 with 1 rules applied. Total rules applied 110 place count 617 transition count 725
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 111 place count 616 transition count 724
Iterating global reduction 0 with 1 rules applied. Total rules applied 112 place count 616 transition count 724
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 113 place count 615 transition count 723
Iterating global reduction 0 with 1 rules applied. Total rules applied 114 place count 615 transition count 723
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 115 place count 614 transition count 722
Iterating global reduction 0 with 1 rules applied. Total rules applied 116 place count 614 transition count 722
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 117 place count 613 transition count 721
Iterating global reduction 0 with 1 rules applied. Total rules applied 118 place count 613 transition count 721
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 119 place count 612 transition count 720
Iterating global reduction 0 with 1 rules applied. Total rules applied 120 place count 612 transition count 720
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 121 place count 611 transition count 719
Iterating global reduction 0 with 1 rules applied. Total rules applied 122 place count 611 transition count 719
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 123 place count 611 transition count 718
Applied a total of 123 rules in 284 ms. Remains 611 /672 variables (removed 61) and now considering 718/780 (removed 62) transitions.
// Phase 1: matrix 718 rows 611 cols
[2024-05-30 23:12:24] [INFO ] Computed 4 invariants in 7 ms
[2024-05-30 23:12:24] [INFO ] Implicit Places using invariants in 107 ms returned []
[2024-05-30 23:12:24] [INFO ] Invariant cache hit.
[2024-05-30 23:12:24] [INFO ] Implicit Places using invariants and state equation in 287 ms returned []
Implicit Place search using SMT with State Equation took 405 ms to find 0 implicit places.
[2024-05-30 23:12:24] [INFO ] Invariant cache hit.
[2024-05-30 23:12:25] [INFO ] Dead Transitions using invariants and state equation in 259 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 611/672 places, 718/780 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 949 ms. Remains : 611/672 places, 718/780 transitions.
Stuttering acceptance computed with spot in 110 ms :[(NOT p1), true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : StigmergyCommit-PT-02b-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p1), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(AND (EQ s349 1) (EQ s487 1)), p0:(EQ s539 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA StigmergyCommit-PT-02b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-02b-LTLFireability-11 finished in 1080 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(F((p0||(F((p1&&G(p2)))&&G(p3))))))'
Support contains 3 out of 672 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 672/672 places, 780/780 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 658 transition count 766
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 658 transition count 766
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 38 place count 648 transition count 756
Iterating global reduction 0 with 10 rules applied. Total rules applied 48 place count 648 transition count 756
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 55 place count 641 transition count 749
Iterating global reduction 0 with 7 rules applied. Total rules applied 62 place count 641 transition count 749
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 69 place count 634 transition count 742
Iterating global reduction 0 with 7 rules applied. Total rules applied 76 place count 634 transition count 742
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 81 place count 629 transition count 737
Iterating global reduction 0 with 5 rules applied. Total rules applied 86 place count 629 transition count 737
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 88 place count 627 transition count 735
Iterating global reduction 0 with 2 rules applied. Total rules applied 90 place count 627 transition count 735
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 92 place count 625 transition count 733
Iterating global reduction 0 with 2 rules applied. Total rules applied 94 place count 625 transition count 733
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 96 place count 623 transition count 731
Iterating global reduction 0 with 2 rules applied. Total rules applied 98 place count 623 transition count 731
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 100 place count 621 transition count 729
Iterating global reduction 0 with 2 rules applied. Total rules applied 102 place count 621 transition count 729
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 104 place count 619 transition count 727
Iterating global reduction 0 with 2 rules applied. Total rules applied 106 place count 619 transition count 727
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 107 place count 618 transition count 726
Iterating global reduction 0 with 1 rules applied. Total rules applied 108 place count 618 transition count 726
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 109 place count 617 transition count 725
Iterating global reduction 0 with 1 rules applied. Total rules applied 110 place count 617 transition count 725
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 111 place count 616 transition count 724
Iterating global reduction 0 with 1 rules applied. Total rules applied 112 place count 616 transition count 724
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 113 place count 615 transition count 723
Iterating global reduction 0 with 1 rules applied. Total rules applied 114 place count 615 transition count 723
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 115 place count 614 transition count 722
Iterating global reduction 0 with 1 rules applied. Total rules applied 116 place count 614 transition count 722
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 117 place count 613 transition count 721
Iterating global reduction 0 with 1 rules applied. Total rules applied 118 place count 613 transition count 721
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 119 place count 612 transition count 720
Iterating global reduction 0 with 1 rules applied. Total rules applied 120 place count 612 transition count 720
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 121 place count 611 transition count 719
Iterating global reduction 0 with 1 rules applied. Total rules applied 122 place count 611 transition count 719
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 123 place count 610 transition count 718
Iterating global reduction 0 with 1 rules applied. Total rules applied 124 place count 610 transition count 718
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 125 place count 609 transition count 717
Iterating global reduction 0 with 1 rules applied. Total rules applied 126 place count 609 transition count 717
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 127 place count 608 transition count 716
Iterating global reduction 0 with 1 rules applied. Total rules applied 128 place count 608 transition count 716
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 129 place count 607 transition count 715
Iterating global reduction 0 with 1 rules applied. Total rules applied 130 place count 607 transition count 715
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 131 place count 607 transition count 714
Applied a total of 131 rules in 288 ms. Remains 607 /672 variables (removed 65) and now considering 714/780 (removed 66) transitions.
// Phase 1: matrix 714 rows 607 cols
[2024-05-30 23:12:25] [INFO ] Computed 4 invariants in 8 ms
[2024-05-30 23:12:25] [INFO ] Implicit Places using invariants in 113 ms returned []
[2024-05-30 23:12:25] [INFO ] Invariant cache hit.
[2024-05-30 23:12:25] [INFO ] Implicit Places using invariants and state equation in 286 ms returned []
Implicit Place search using SMT with State Equation took 409 ms to find 0 implicit places.
[2024-05-30 23:12:25] [INFO ] Invariant cache hit.
[2024-05-30 23:12:26] [INFO ] Dead Transitions using invariants and state equation in 268 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 607/672 places, 714/780 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 965 ms. Remains : 607/672 places, 714/780 transitions.
Stuttering acceptance computed with spot in 235 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : StigmergyCommit-PT-02b-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={0} source=1 dest: 1}, { cond=(OR (AND (NOT p0) (NOT p1) p3) (AND (NOT p0) (NOT p2) p3)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p3), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p1 p2 p3), acceptance={} source=1 dest: 4}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) p3), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s346 0), p3:(EQ s529 0), p1:(EQ s444 1), p2:(EQ s444 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 356 ms.
Product exploration explored 100000 steps with 50000 reset in 352 ms.
Computed a total of 123 stabilizing places and 129 stable transitions
Computed a total of 123 stabilizing places and 129 stable transitions
Knowledge obtained : [(AND p0 p3 (NOT p1) p2), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p0) p3))), (X (NOT (OR (AND (NOT p0) (NOT p1) p3) (AND (NOT p0) (NOT p2) p3)))), (X (NOT (AND (NOT p0) p1 p2 p3))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (NOT (OR (AND (NOT p0) (NOT p1) p3) (AND (NOT p0) (NOT p2) p3))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 p2 p3))))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 13 factoid took 107 ms. Reduced automaton from 5 states, 11 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA StigmergyCommit-PT-02b-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyCommit-PT-02b-LTLFireability-15 finished in 2044 ms.
All properties solved by simple procedures.
Total runtime 33942 ms.

BK_STOP 1717110748196

--------------------
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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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 LTLFireability -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="StigmergyCommit-PT-02b"
export BK_EXAMINATION="LTLFireability"
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 StigmergyCommit-PT-02b, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r417-tall-171690555700063"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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