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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 51M
-rw-r--r-- 1 mcc users 7.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 23 07:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 19 07:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 19:23 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.1K Apr 11 18:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 94K Apr 11 18:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Apr 11 18:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 39K Apr 11 18:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:59 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 51M 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-09a-LTLCardinality-00
FORMULA_NAME StigmergyCommit-PT-09a-LTLCardinality-01
FORMULA_NAME StigmergyCommit-PT-09a-LTLCardinality-02
FORMULA_NAME StigmergyCommit-PT-09a-LTLCardinality-03
FORMULA_NAME StigmergyCommit-PT-09a-LTLCardinality-04
FORMULA_NAME StigmergyCommit-PT-09a-LTLCardinality-05
FORMULA_NAME StigmergyCommit-PT-09a-LTLCardinality-06
FORMULA_NAME StigmergyCommit-PT-09a-LTLCardinality-07
FORMULA_NAME StigmergyCommit-PT-09a-LTLCardinality-08
FORMULA_NAME StigmergyCommit-PT-09a-LTLCardinality-09
FORMULA_NAME StigmergyCommit-PT-09a-LTLCardinality-10
FORMULA_NAME StigmergyCommit-PT-09a-LTLCardinality-11
FORMULA_NAME StigmergyCommit-PT-09a-LTLCardinality-12
FORMULA_NAME StigmergyCommit-PT-09a-LTLCardinality-13
FORMULA_NAME StigmergyCommit-PT-09a-LTLCardinality-14
FORMULA_NAME StigmergyCommit-PT-09a-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717119402187

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyCommit-PT-09a
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-31 01:36:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-31 01:36:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 01:36:45] [INFO ] Load time of PNML (sax parser for PT used): 1920 ms
[2024-05-31 01:36:47] [INFO ] Transformed 364 places.
[2024-05-31 01:36:47] [INFO ] Transformed 50444 transitions.
[2024-05-31 01:36:47] [INFO ] Found NUPN structural information;
[2024-05-31 01:36:47] [INFO ] Parsed PT model containing 364 places and 50444 transitions and 999956 arcs in 3613 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Ensure Unique test removed 47924 transitions
Reduce redundant transitions removed 47924 transitions.
FORMULA StigmergyCommit-PT-09a-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-09a-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-09a-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-09a-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-09a-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-09a-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-09a-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-09a-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 24 out of 364 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 364/364 places, 2520/2520 transitions.
Discarding 72 places :
Symmetric choice reduction at 0 with 72 rule applications. Total rules 72 place count 292 transition count 2441
Iterating global reduction 0 with 72 rules applied. Total rules applied 144 place count 292 transition count 2441
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 152 place count 292 transition count 2433
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 185 place count 259 transition count 2393
Iterating global reduction 1 with 33 rules applied. Total rules applied 218 place count 259 transition count 2393
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 227 place count 259 transition count 2384
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 233 place count 253 transition count 2378
Iterating global reduction 2 with 6 rules applied. Total rules applied 239 place count 253 transition count 2378
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 244 place count 248 transition count 2373
Iterating global reduction 2 with 5 rules applied. Total rules applied 249 place count 248 transition count 2373
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 254 place count 243 transition count 2368
Iterating global reduction 2 with 5 rules applied. Total rules applied 259 place count 243 transition count 2368
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 264 place count 238 transition count 2363
Iterating global reduction 2 with 5 rules applied. Total rules applied 269 place count 238 transition count 2363
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 274 place count 238 transition count 2358
Applied a total of 274 rules in 149 ms. Remains 238 /364 variables (removed 126) and now considering 2358/2520 (removed 162) transitions.
[2024-05-31 01:36:48] [INFO ] Flow matrix only has 2344 transitions (discarded 14 similar events)
// Phase 1: matrix 2344 rows 238 cols
[2024-05-31 01:36:48] [INFO ] Computed 2 invariants in 48 ms
[2024-05-31 01:36:48] [INFO ] Implicit Places using invariants in 838 ms returned []
[2024-05-31 01:36:48] [INFO ] Flow matrix only has 2344 transitions (discarded 14 similar events)
[2024-05-31 01:36:48] [INFO ] Invariant cache hit.
[2024-05-31 01:36:49] [INFO ] State equation strengthened by 2149 read => feed constraints.
[2024-05-31 01:36:51] [INFO ] Implicit Places using invariants and state equation in 2593 ms returned [237]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 3467 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 237/364 places, 2358/2520 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 213 transition count 2334
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 213 transition count 2334
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 55 place count 213 transition count 2327
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 64 place count 204 transition count 2318
Iterating global reduction 1 with 9 rules applied. Total rules applied 73 place count 204 transition count 2318
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 80 place count 197 transition count 2311
Iterating global reduction 1 with 7 rules applied. Total rules applied 87 place count 197 transition count 2311
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 94 place count 190 transition count 2304
Iterating global reduction 1 with 7 rules applied. Total rules applied 101 place count 190 transition count 2304
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 106 place count 185 transition count 2299
Iterating global reduction 1 with 5 rules applied. Total rules applied 111 place count 185 transition count 2299
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 115 place count 181 transition count 2295
Iterating global reduction 1 with 4 rules applied. Total rules applied 119 place count 181 transition count 2295
Applied a total of 119 rules in 75 ms. Remains 181 /237 variables (removed 56) and now considering 2295/2358 (removed 63) transitions.
[2024-05-31 01:36:51] [INFO ] Flow matrix only has 2281 transitions (discarded 14 similar events)
// Phase 1: matrix 2281 rows 181 cols
[2024-05-31 01:36:51] [INFO ] Computed 1 invariants in 11 ms
[2024-05-31 01:36:52] [INFO ] Implicit Places using invariants in 517 ms returned []
[2024-05-31 01:36:52] [INFO ] Flow matrix only has 2281 transitions (discarded 14 similar events)
[2024-05-31 01:36:52] [INFO ] Invariant cache hit.
[2024-05-31 01:36:53] [INFO ] State equation strengthened by 2055 read => feed constraints.
[2024-05-31 01:36:54] [INFO ] Implicit Places using invariants and state equation in 1932 ms returned []
Implicit Place search using SMT with State Equation took 2454 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 181/364 places, 2295/2520 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 6147 ms. Remains : 181/364 places, 2295/2520 transitions.
Support contains 24 out of 181 places after structural reductions.
[2024-05-31 01:36:54] [INFO ] Flatten gal took : 313 ms
[2024-05-31 01:36:54] [INFO ] Flatten gal took : 190 ms
[2024-05-31 01:36:55] [INFO ] Input system was already deterministic with 2295 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1338 ms. (steps per millisecond=7 ) properties (out of 16) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
[2024-05-31 01:36:56] [INFO ] Flow matrix only has 2281 transitions (discarded 14 similar events)
[2024-05-31 01:36:56] [INFO ] Invariant cache hit.
[2024-05-31 01:36:56] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-31 01:36:56] [INFO ] After 135ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2024-05-31 01:36:57] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-31 01:36:58] [INFO ] After 967ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2024-05-31 01:36:58] [INFO ] State equation strengthened by 2055 read => feed constraints.
[2024-05-31 01:36:59] [INFO ] After 859ms SMT Verify possible using 2055 Read/Feed constraints in natural domain returned unsat :0 sat :12
[2024-05-31 01:37:00] [INFO ] Deduced a trap composed of 13 places in 693 ms of which 6 ms to minimize.
[2024-05-31 01:37:00] [INFO ] Deduced a trap composed of 13 places in 546 ms of which 1 ms to minimize.
[2024-05-31 01:37:01] [INFO ] Deduced a trap composed of 17 places in 446 ms of which 1 ms to minimize.
[2024-05-31 01:37:01] [INFO ] Deduced a trap composed of 15 places in 375 ms of which 2 ms to minimize.
[2024-05-31 01:37:01] [INFO ] Deduced a trap composed of 13 places in 330 ms of which 1 ms to minimize.
[2024-05-31 01:37:02] [INFO ] Deduced a trap composed of 13 places in 280 ms of which 0 ms to minimize.
[2024-05-31 01:37:02] [INFO ] Deduced a trap composed of 13 places in 260 ms of which 1 ms to minimize.
[2024-05-31 01:37:02] [INFO ] Deduced a trap composed of 13 places in 207 ms of which 2 ms to minimize.
[2024-05-31 01:37:03] [INFO ] Deduced a trap composed of 13 places in 160 ms of which 0 ms to minimize.
[2024-05-31 01:37:03] [INFO ] Deduced a trap composed of 13 places in 157 ms of which 0 ms to minimize.
[2024-05-31 01:37:03] [INFO ] Deduced a trap composed of 15 places in 174 ms of which 0 ms to minimize.
[2024-05-31 01:37:03] [INFO ] Deduced a trap composed of 13 places in 129 ms of which 9 ms to minimize.
[2024-05-31 01:37:03] [INFO ] Deduced a trap composed of 13 places in 166 ms of which 0 ms to minimize.
[2024-05-31 01:37:04] [INFO ] Deduced a trap composed of 16 places in 127 ms of which 1 ms to minimize.
[2024-05-31 01:37:04] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 4904 ms
[2024-05-31 01:37:04] [INFO ] Deduced a trap composed of 13 places in 125 ms of which 1 ms to minimize.
[2024-05-31 01:37:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 214 ms
[2024-05-31 01:37:04] [INFO ] Deduced a trap composed of 13 places in 120 ms of which 0 ms to minimize.
[2024-05-31 01:37:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 213 ms
[2024-05-31 01:37:05] [INFO ] Deduced a trap composed of 18 places in 195 ms of which 0 ms to minimize.
[2024-05-31 01:37:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 233 ms
[2024-05-31 01:37:05] [INFO ] Deduced a trap composed of 16 places in 127 ms of which 0 ms to minimize.
[2024-05-31 01:37:05] [INFO ] Deduced a trap composed of 18 places in 113 ms of which 0 ms to minimize.
[2024-05-31 01:37:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 336 ms
[2024-05-31 01:37:05] [INFO ] Deduced a trap composed of 13 places in 116 ms of which 1 ms to minimize.
[2024-05-31 01:37:05] [INFO ] Deduced a trap composed of 13 places in 117 ms of which 0 ms to minimize.
[2024-05-31 01:37:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 395 ms
[2024-05-31 01:37:06] [INFO ] Deduced a trap composed of 13 places in 145 ms of which 1 ms to minimize.
[2024-05-31 01:37:06] [INFO ] Deduced a trap composed of 13 places in 116 ms of which 0 ms to minimize.
[2024-05-31 01:37:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 365 ms
[2024-05-31 01:37:06] [INFO ] Deduced a trap composed of 13 places in 156 ms of which 1 ms to minimize.
[2024-05-31 01:37:06] [INFO ] Deduced a trap composed of 16 places in 161 ms of which 1 ms to minimize.
[2024-05-31 01:37:06] [INFO ] Deduced a trap composed of 18 places in 113 ms of which 0 ms to minimize.
[2024-05-31 01:37:07] [INFO ] Deduced a trap composed of 18 places in 110 ms of which 0 ms to minimize.
[2024-05-31 01:37:07] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 840 ms
[2024-05-31 01:37:07] [INFO ] Deduced a trap composed of 16 places in 131 ms of which 1 ms to minimize.
[2024-05-31 01:37:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 277 ms
[2024-05-31 01:37:07] [INFO ] Deduced a trap composed of 13 places in 131 ms of which 1 ms to minimize.
[2024-05-31 01:37:07] [INFO ] Deduced a trap composed of 16 places in 131 ms of which 1 ms to minimize.
[2024-05-31 01:37:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 464 ms
[2024-05-31 01:37:08] [INFO ] Deduced a trap composed of 16 places in 164 ms of which 0 ms to minimize.
[2024-05-31 01:37:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 278 ms
[2024-05-31 01:37:08] [INFO ] After 9912ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :9
Attempting to minimize the solution found.
Minimization took 485 ms.
[2024-05-31 01:37:08] [INFO ] After 11859ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :9
Fused 12 Parikh solutions to 9 different solutions.
Parikh walk visited 0 properties in 97 ms.
Support contains 12 out of 181 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 181/181 places, 2295/2295 transitions.
Graph (complete) has 533 edges and 181 vertex of which 180 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.28 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Drop transitions removed 75 transitions
Trivial Post-agglo rules discarded 75 transitions
Performed 75 trivial Post agglomeration. Transition count delta: 75
Iterating post reduction 0 with 99 rules applied. Total rules applied 100 place count 180 transition count 2195
Reduce places removed 75 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 102 rules applied. Total rules applied 202 place count 105 transition count 2168
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 215 place count 93 transition count 2167
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 215 place count 93 transition count 2164
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 221 place count 90 transition count 2164
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 233 place count 78 transition count 2152
Iterating global reduction 3 with 12 rules applied. Total rules applied 245 place count 78 transition count 2152
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 247 place count 78 transition count 2150
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 253 place count 72 transition count 2144
Iterating global reduction 4 with 6 rules applied. Total rules applied 259 place count 72 transition count 2144
Performed 39 Post agglomeration using F-continuation condition with reduction of 2016 identical transitions.
Deduced a syphon composed of 39 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 4 with 80 rules applied. Total rules applied 339 place count 31 transition count 89
Drop transitions removed 24 transitions
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 51 transitions.
Iterating post reduction 4 with 51 rules applied. Total rules applied 390 place count 31 transition count 38
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 396 place count 31 transition count 32
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 397 place count 30 transition count 31
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 398 place count 29 transition count 31
Applied a total of 398 rules in 222 ms. Remains 29 /181 variables (removed 152) and now considering 31/2295 (removed 2264) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 222 ms. Remains : 29/181 places, 31/2295 transitions.
Finished random walk after 167 steps, including 0 resets, run visited all 9 properties in 3 ms. (steps per millisecond=55 )
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 3 atomic propositions for a total of 8 simplifications.
FORMULA StigmergyCommit-PT-09a-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 20 stabilizing places and 20 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' '!(G(F(p0)))'
Support contains 2 out of 181 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 181/181 places, 2295/2295 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 78 transitions
Trivial Post-agglo rules discarded 78 transitions
Performed 78 trivial Post agglomeration. Transition count delta: 78
Iterating post reduction 0 with 78 rules applied. Total rules applied 78 place count 180 transition count 2216
Reduce places removed 78 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 89 rules applied. Total rules applied 167 place count 102 transition count 2205
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 169 place count 101 transition count 2204
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 169 place count 101 transition count 2191
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 195 place count 88 transition count 2191
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 197 place count 86 transition count 2187
Iterating global reduction 3 with 2 rules applied. Total rules applied 199 place count 86 transition count 2187
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 201 place count 84 transition count 2183
Iterating global reduction 3 with 2 rules applied. Total rules applied 203 place count 84 transition count 2183
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 206 place count 84 transition count 2180
Performed 40 Post agglomeration using F-continuation condition with reduction of 16 identical transitions.
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 4 with 80 rules applied. Total rules applied 286 place count 44 transition count 2124
Ensure Unique test removed 518 transitions
Reduce isomorphic transitions removed 518 transitions.
Iterating post reduction 4 with 518 rules applied. Total rules applied 804 place count 44 transition count 1606
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 812 place count 40 transition count 1602
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 816 place count 40 transition count 1598
Drop transitions removed 1529 transitions
Redundant transition composition rules discarded 1529 transitions
Iterating global reduction 6 with 1529 rules applied. Total rules applied 2345 place count 40 transition count 69
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 6 with 20 rules applied. Total rules applied 2365 place count 30 transition count 59
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 2366 place count 30 transition count 59
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 2367 place count 30 transition count 58
Reduce places removed 5 places and 5 transitions.
Iterating global reduction 6 with 5 rules applied. Total rules applied 2372 place count 25 transition count 53
Applied a total of 2372 rules in 600 ms. Remains 25 /181 variables (removed 156) and now considering 53/2295 (removed 2242) transitions.
[2024-05-31 01:37:10] [INFO ] Flow matrix only has 42 transitions (discarded 11 similar events)
// Phase 1: matrix 42 rows 25 cols
[2024-05-31 01:37:10] [INFO ] Computed 1 invariants in 1 ms
[2024-05-31 01:37:10] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-31 01:37:10] [INFO ] Flow matrix only has 42 transitions (discarded 11 similar events)
[2024-05-31 01:37:10] [INFO ] Invariant cache hit.
[2024-05-31 01:37:10] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-31 01:37:10] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
[2024-05-31 01:37:10] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-31 01:37:10] [INFO ] Flow matrix only has 42 transitions (discarded 11 similar events)
[2024-05-31 01:37:10] [INFO ] Invariant cache hit.
[2024-05-31 01:37:10] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 25/181 places, 53/2295 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 774 ms. Remains : 25/181 places, 53/2295 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 205 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-09a-LTLCardinality-00 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 s13 0) (EQ s21 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 0 reset in 132 ms.
Product exploration explored 100000 steps with 2 reset in 86 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [p0, (X (NOT p0)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 93 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 1 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=0 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X (NOT p0)), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 110 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 53/53 transitions.
Applied a total of 0 rules in 3 ms. Remains 25 /25 variables (removed 0) and now considering 53/53 (removed 0) transitions.
[2024-05-31 01:37:11] [INFO ] Flow matrix only has 42 transitions (discarded 11 similar events)
[2024-05-31 01:37:11] [INFO ] Invariant cache hit.
[2024-05-31 01:37:11] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-31 01:37:11] [INFO ] Flow matrix only has 42 transitions (discarded 11 similar events)
[2024-05-31 01:37:11] [INFO ] Invariant cache hit.
[2024-05-31 01:37:11] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-31 01:37:11] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
[2024-05-31 01:37:11] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-31 01:37:11] [INFO ] Flow matrix only has 42 transitions (discarded 11 similar events)
[2024-05-31 01:37:11] [INFO ] Invariant cache hit.
[2024-05-31 01:37:11] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 132 ms. Remains : 25/25 places, 53/53 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [p0, (X (NOT p0)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 76 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 64 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X (NOT p0)), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 97 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 73 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1 reset in 43 ms.
Product exploration explored 100000 steps with 0 reset in 153 ms.
Built C files in :
/tmp/ltsmin13828657597231968149
[2024-05-31 01:37:11] [INFO ] Computing symmetric may disable matrix : 53 transitions.
[2024-05-31 01:37:11] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 01:37:11] [INFO ] Computing symmetric may enable matrix : 53 transitions.
[2024-05-31 01:37:11] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 01:37:11] [INFO ] Computing Do-Not-Accords matrix : 53 transitions.
[2024-05-31 01:37:11] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 01:37:12] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13828657597231968149
Running compilation step : cd /tmp/ltsmin13828657597231968149;'/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 256 ms.
Running link step : cd /tmp/ltsmin13828657597231968149;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin13828657597231968149;'/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/stateBased2839975468200135045.hoa' '--buchi-type=spotba'
LTSmin run took 90 ms.
FORMULA StigmergyCommit-PT-09a-LTLCardinality-00 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property StigmergyCommit-PT-09a-LTLCardinality-00 finished in 2962 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||(p1&&X(F(p2))))))'
Support contains 3 out of 181 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 181/181 places, 2295/2295 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 163 transition count 2274
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 163 transition count 2274
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 40 place count 163 transition count 2270
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 53 place count 150 transition count 2254
Iterating global reduction 1 with 13 rules applied. Total rules applied 66 place count 150 transition count 2254
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 67 place count 150 transition count 2253
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 77 place count 140 transition count 2243
Iterating global reduction 2 with 10 rules applied. Total rules applied 87 place count 140 transition count 2243
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 88 place count 140 transition count 2242
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 94 place count 134 transition count 2236
Iterating global reduction 3 with 6 rules applied. Total rules applied 100 place count 134 transition count 2236
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 102 place count 134 transition count 2234
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 104 place count 132 transition count 2232
Iterating global reduction 4 with 2 rules applied. Total rules applied 106 place count 132 transition count 2232
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 107 place count 131 transition count 2231
Iterating global reduction 4 with 1 rules applied. Total rules applied 108 place count 131 transition count 2231
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 109 place count 131 transition count 2230
Applied a total of 109 rules in 64 ms. Remains 131 /181 variables (removed 50) and now considering 2230/2295 (removed 65) transitions.
[2024-05-31 01:37:12] [INFO ] Flow matrix only has 2219 transitions (discarded 11 similar events)
// Phase 1: matrix 2219 rows 131 cols
[2024-05-31 01:37:12] [INFO ] Computed 1 invariants in 18 ms
[2024-05-31 01:37:13] [INFO ] Implicit Places using invariants in 594 ms returned []
[2024-05-31 01:37:13] [INFO ] Flow matrix only has 2219 transitions (discarded 11 similar events)
[2024-05-31 01:37:13] [INFO ] Invariant cache hit.
[2024-05-31 01:37:13] [INFO ] State equation strengthened by 2055 read => feed constraints.
[2024-05-31 01:37:14] [INFO ] Implicit Places using invariants and state equation in 1250 ms returned []
Implicit Place search using SMT with State Equation took 1848 ms to find 0 implicit places.
[2024-05-31 01:37:14] [INFO ] Flow matrix only has 2219 transitions (discarded 11 similar events)
[2024-05-31 01:37:14] [INFO ] Invariant cache hit.
[2024-05-31 01:37:15] [INFO ] Dead Transitions using invariants and state equation in 752 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 131/181 places, 2230/2295 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2666 ms. Remains : 131/181 places, 2230/2295 transitions.
Stuttering acceptance computed with spot in 97 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : StigmergyCommit-PT-09a-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s77 0) (EQ s63 1)), p1:(OR (EQ s63 0) (EQ s77 1)), p2:(EQ s8 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 2632 reset in 428 ms.
Product exploration explored 100000 steps with 2606 reset in 499 ms.
Computed a total of 8 stabilizing places and 8 stable transitions
Computed a total of 8 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 104 ms. Reduced automaton from 2 states, 3 edges and 3 AP (stutter sensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(AND (NOT p0) (NOT p2))]
Finished random walk after 19 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=9 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 7 factoid took 133 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 47 ms :[(AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 32 ms :[(AND (NOT p0) (NOT p2))]
[2024-05-31 01:37:16] [INFO ] Flow matrix only has 2219 transitions (discarded 11 similar events)
[2024-05-31 01:37:16] [INFO ] Invariant cache hit.
[2024-05-31 01:37:16] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-31 01:37:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 01:37:17] [INFO ] [Real]Absence check using state equation in 354 ms returned sat
[2024-05-31 01:37:18] [INFO ] State equation strengthened by 2055 read => feed constraints.
[2024-05-31 01:37:18] [INFO ] [Real]Added 2055 Read/Feed constraints in 176 ms returned sat
[2024-05-31 01:37:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 01:37:18] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-31 01:37:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 01:37:19] [INFO ] [Nat]Absence check using state equation in 330 ms returned sat
[2024-05-31 01:37:19] [INFO ] [Nat]Added 2055 Read/Feed constraints in 188 ms returned sat
[2024-05-31 01:37:19] [INFO ] Computed and/alt/rep : 141/173/141 causal constraints (skipped 2077 transitions) in 490 ms.
[2024-05-31 01:37:21] [INFO ] Added : 99 causal constraints over 20 iterations in 2394 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Support contains 3 out of 131 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 131/131 places, 2230/2230 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 130 transition count 2196
Reduce places removed 33 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 35 rules applied. Total rules applied 68 place count 97 transition count 2194
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 70 place count 96 transition count 2193
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 70 place count 96 transition count 2182
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 92 place count 85 transition count 2182
Performed 39 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 39 places in 1 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 3 with 78 rules applied. Total rules applied 170 place count 46 transition count 2135
Ensure Unique test removed 1033 transitions
Reduce isomorphic transitions removed 1033 transitions.
Iterating post reduction 3 with 1033 rules applied. Total rules applied 1203 place count 46 transition count 1102
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 1219 place count 38 transition count 1094
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 1227 place count 38 transition count 1086
Drop transitions removed 1033 transitions
Redundant transition composition rules discarded 1033 transitions
Iterating global reduction 5 with 1033 rules applied. Total rules applied 2260 place count 38 transition count 53
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 5 with 20 rules applied. Total rules applied 2280 place count 28 transition count 43
Partial Post-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 2284 place count 28 transition count 43
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 2285 place count 28 transition count 42
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 2286 place count 27 transition count 41
Applied a total of 2286 rules in 286 ms. Remains 27 /131 variables (removed 104) and now considering 41/2230 (removed 2189) transitions.
[2024-05-31 01:37:21] [INFO ] Flow matrix only has 30 transitions (discarded 11 similar events)
// Phase 1: matrix 30 rows 27 cols
[2024-05-31 01:37:21] [INFO ] Computed 1 invariants in 0 ms
[2024-05-31 01:37:22] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-31 01:37:22] [INFO ] Flow matrix only has 30 transitions (discarded 11 similar events)
[2024-05-31 01:37:22] [INFO ] Invariant cache hit.
[2024-05-31 01:37:22] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-31 01:37:22] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
[2024-05-31 01:37:22] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-31 01:37:22] [INFO ] Flow matrix only has 30 transitions (discarded 11 similar events)
[2024-05-31 01:37:22] [INFO ] Invariant cache hit.
[2024-05-31 01:37:22] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 27/131 places, 41/2230 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 390 ms. Remains : 27/131 places, 41/2230 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 11 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA StigmergyCommit-PT-09a-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyCommit-PT-09a-LTLCardinality-03 finished in 9698 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&F(p1))))'
Support contains 3 out of 181 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 181/181 places, 2295/2295 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 164 transition count 2275
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 164 transition count 2275
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 38 place count 164 transition count 2271
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 50 place count 152 transition count 2256
Iterating global reduction 1 with 12 rules applied. Total rules applied 62 place count 152 transition count 2256
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 63 place count 152 transition count 2255
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 73 place count 142 transition count 2245
Iterating global reduction 2 with 10 rules applied. Total rules applied 83 place count 142 transition count 2245
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 84 place count 142 transition count 2244
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 90 place count 136 transition count 2238
Iterating global reduction 3 with 6 rules applied. Total rules applied 96 place count 136 transition count 2238
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 98 place count 136 transition count 2236
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 101 place count 133 transition count 2233
Iterating global reduction 4 with 3 rules applied. Total rules applied 104 place count 133 transition count 2233
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 105 place count 132 transition count 2232
Iterating global reduction 4 with 1 rules applied. Total rules applied 106 place count 132 transition count 2232
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 107 place count 132 transition count 2231
Applied a total of 107 rules in 62 ms. Remains 132 /181 variables (removed 49) and now considering 2231/2295 (removed 64) transitions.
[2024-05-31 01:37:22] [INFO ] Flow matrix only has 2220 transitions (discarded 11 similar events)
// Phase 1: matrix 2220 rows 132 cols
[2024-05-31 01:37:22] [INFO ] Computed 1 invariants in 10 ms
[2024-05-31 01:37:22] [INFO ] Implicit Places using invariants in 580 ms returned []
[2024-05-31 01:37:22] [INFO ] Flow matrix only has 2220 transitions (discarded 11 similar events)
[2024-05-31 01:37:22] [INFO ] Invariant cache hit.
[2024-05-31 01:37:23] [INFO ] State equation strengthened by 2055 read => feed constraints.
[2024-05-31 01:37:24] [INFO ] Implicit Places using invariants and state equation in 1290 ms returned []
Implicit Place search using SMT with State Equation took 1872 ms to find 0 implicit places.
[2024-05-31 01:37:24] [INFO ] Flow matrix only has 2220 transitions (discarded 11 similar events)
[2024-05-31 01:37:24] [INFO ] Invariant cache hit.
[2024-05-31 01:37:24] [INFO ] Dead Transitions using invariants and state equation in 708 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 132/181 places, 2231/2295 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2644 ms. Remains : 132/181 places, 2231/2295 transitions.
Stuttering acceptance computed with spot in 138 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : StigmergyCommit-PT-09a-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(AND (EQ s116 0) (EQ s113 1)), p0:(EQ s68 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA StigmergyCommit-PT-09a-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-09a-LTLCardinality-04 finished in 2800 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 X(p1))))'
Support contains 3 out of 181 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 181/181 places, 2295/2295 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 163 transition count 2275
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 163 transition count 2275
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 41 place count 163 transition count 2270
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 53 place count 151 transition count 2256
Iterating global reduction 1 with 12 rules applied. Total rules applied 65 place count 151 transition count 2256
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 66 place count 151 transition count 2255
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 75 place count 142 transition count 2246
Iterating global reduction 2 with 9 rules applied. Total rules applied 84 place count 142 transition count 2246
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 91 place count 135 transition count 2239
Iterating global reduction 2 with 7 rules applied. Total rules applied 98 place count 135 transition count 2239
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 100 place count 135 transition count 2237
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 104 place count 131 transition count 2233
Iterating global reduction 3 with 4 rules applied. Total rules applied 108 place count 131 transition count 2233
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 109 place count 131 transition count 2232
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 110 place count 130 transition count 2231
Iterating global reduction 4 with 1 rules applied. Total rules applied 111 place count 130 transition count 2231
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 112 place count 130 transition count 2230
Applied a total of 112 rules in 58 ms. Remains 130 /181 variables (removed 51) and now considering 2230/2295 (removed 65) transitions.
[2024-05-31 01:37:24] [INFO ] Flow matrix only has 2218 transitions (discarded 12 similar events)
// Phase 1: matrix 2218 rows 130 cols
[2024-05-31 01:37:24] [INFO ] Computed 1 invariants in 14 ms
[2024-05-31 01:37:25] [INFO ] Implicit Places using invariants in 563 ms returned []
[2024-05-31 01:37:25] [INFO ] Flow matrix only has 2218 transitions (discarded 12 similar events)
[2024-05-31 01:37:25] [INFO ] Invariant cache hit.
[2024-05-31 01:37:26] [INFO ] State equation strengthened by 2055 read => feed constraints.
[2024-05-31 01:37:26] [INFO ] Implicit Places using invariants and state equation in 1327 ms returned []
Implicit Place search using SMT with State Equation took 1892 ms to find 0 implicit places.
[2024-05-31 01:37:26] [INFO ] Flow matrix only has 2218 transitions (discarded 12 similar events)
[2024-05-31 01:37:26] [INFO ] Invariant cache hit.
[2024-05-31 01:37:27] [INFO ] Dead Transitions using invariants and state equation in 705 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 130/181 places, 2230/2295 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2655 ms. Remains : 130/181 places, 2230/2295 transitions.
Stuttering acceptance computed with spot in 202 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-09a-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 4}, { cond=p0, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(EQ s49 1), p1:(OR (EQ s48 0) (EQ s101 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 221 ms.
Product exploration explored 100000 steps with 33333 reset in 224 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 14 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA StigmergyCommit-PT-09a-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyCommit-PT-09a-LTLCardinality-05 finished in 3358 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(F((G(!p0)||(!p1&&G(p2)))))||(p1&&F((G(!p0)||(!p1&&G(p2))))))))'
Support contains 5 out of 181 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 181/181 places, 2295/2295 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 0 with 71 rules applied. Total rules applied 71 place count 180 transition count 2223
Reduce places removed 71 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 79 rules applied. Total rules applied 150 place count 109 transition count 2215
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 153 place count 108 transition count 2213
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 154 place count 107 transition count 2213
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 13 Pre rules applied. Total rules applied 154 place count 107 transition count 2200
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 180 place count 94 transition count 2200
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 182 place count 92 transition count 2196
Iterating global reduction 4 with 2 rules applied. Total rules applied 184 place count 92 transition count 2196
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 186 place count 90 transition count 2192
Iterating global reduction 4 with 2 rules applied. Total rules applied 188 place count 90 transition count 2192
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 191 place count 90 transition count 2189
Performed 40 Post agglomeration using F-continuation condition with reduction of 16 identical transitions.
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 5 with 80 rules applied. Total rules applied 271 place count 50 transition count 2133
Ensure Unique test removed 518 transitions
Reduce isomorphic transitions removed 518 transitions.
Iterating post reduction 5 with 518 rules applied. Total rules applied 789 place count 50 transition count 1615
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 797 place count 46 transition count 1611
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 801 place count 46 transition count 1607
Drop transitions removed 1497 transitions
Redundant transition composition rules discarded 1497 transitions
Iterating global reduction 7 with 1497 rules applied. Total rules applied 2298 place count 46 transition count 110
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 7 with 20 rules applied. Total rules applied 2318 place count 36 transition count 100
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 2319 place count 36 transition count 100
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 2320 place count 36 transition count 99
Reduce places removed 5 places and 5 transitions.
Iterating global reduction 7 with 5 rules applied. Total rules applied 2325 place count 31 transition count 94
Applied a total of 2325 rules in 354 ms. Remains 31 /181 variables (removed 150) and now considering 94/2295 (removed 2201) transitions.
[2024-05-31 01:37:28] [INFO ] Flow matrix only has 83 transitions (discarded 11 similar events)
// Phase 1: matrix 83 rows 31 cols
[2024-05-31 01:37:28] [INFO ] Computed 1 invariants in 2 ms
[2024-05-31 01:37:28] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-31 01:37:28] [INFO ] Flow matrix only has 83 transitions (discarded 11 similar events)
[2024-05-31 01:37:28] [INFO ] Invariant cache hit.
[2024-05-31 01:37:28] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-31 01:37:28] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
[2024-05-31 01:37:28] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-31 01:37:28] [INFO ] Flow matrix only has 83 transitions (discarded 11 similar events)
[2024-05-31 01:37:28] [INFO ] Invariant cache hit.
[2024-05-31 01:37:28] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 31/181 places, 94/2295 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 526 ms. Remains : 31/181 places, 94/2295 transitions.
Stuttering acceptance computed with spot in 234 ms :[(OR (AND p0 (NOT p2)) (AND p0 p1)), (OR (AND p0 (NOT p2)) (AND p0 p1)), (AND p0 (NOT p2)), (OR (AND p0 (NOT p2)) (AND p0 p1)), (AND p0 (NOT p2))]
Running random walk in product with property : StigmergyCommit-PT-09a-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p2 p0), acceptance={1} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0, 1} source=2 dest: 1}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p2 p0), acceptance={1} source=2 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND p1 p2), acceptance={} source=2 dest: 4}], [{ cond=(OR (AND p1 (NOT p0)) (AND (NOT p2) (NOT p0))), acceptance={0} source=3 dest: 3}, { cond=(OR (AND p1 p0) (AND (NOT p2) p0)), acceptance={0, 1} source=3 dest: 3}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p1) p2 p0), acceptance={1} source=3 dest: 4}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p2) p0), acceptance={0, 1} source=4 dest: 3}, { cond=(AND p2 (NOT p0)), acceptance={} source=4 dest: 4}, { cond=(AND p2 p0), acceptance={1} source=4 dest: 4}]], initial=0, aps=[p1:(OR (EQ s19 0) (EQ s22 1)), p2:(NEQ s16 1), p0:(OR (EQ s28 0) (EQ s5 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 162 ms.
Product exploration explored 100000 steps with 0 reset in 88 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p1 p2 p0), (X (AND (NOT p1) p2)), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p1 p2))), (X (AND (NOT p1) p2 p0)), (X (NOT (OR (AND p1 p0) (AND (NOT p2) p0)))), (X (NOT p1)), (X (NOT (OR (AND p1 (NOT p0)) (AND (NOT p2) (NOT p0))))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (X (AND p1 p2))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X p1)), (X (X (NOT (OR (AND p1 (NOT p0)) (AND (NOT p2) (NOT p0)))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND p2 p0))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (OR (AND p1 p0) (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 27 factoid took 320 ms. Reduced automaton from 5 states, 23 edges and 3 AP (stutter insensitive) to 5 states, 16 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 249 ms :[(OR (AND p0 (NOT p2)) (AND p0 p1)), (OR (AND p0 (NOT p2)) (AND p0 p1)), (AND p0 (NOT p2)), false, false]
Incomplete random walk after 10000 steps, including 229 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 8) seen :6
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-31 01:37:30] [INFO ] Flow matrix only has 83 transitions (discarded 11 similar events)
[2024-05-31 01:37:30] [INFO ] Invariant cache hit.
[2024-05-31 01:37:30] [INFO ] After 22ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-31 01:37:30] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-31 01:37:30] [INFO ] After 22ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-31 01:37:30] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-31 01:37:30] [INFO ] After 10ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-31 01:37:30] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2024-05-31 01:37:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 39 ms
[2024-05-31 01:37:30] [INFO ] After 55ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :0
[2024-05-31 01:37:30] [INFO ] After 102ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p1 p2 p0), (X (AND (NOT p1) p2)), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p1 p2))), (X (AND (NOT p1) p2 p0)), (X (NOT (OR (AND p1 p0) (AND (NOT p2) p0)))), (X (NOT p1)), (X (NOT (OR (AND p1 (NOT p0)) (AND (NOT p2) (NOT p0))))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (X (AND p1 p2))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X p1)), (X (X (NOT (OR (AND p1 (NOT p0)) (AND (NOT p2) (NOT p0)))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND p2 p0))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (OR (AND p1 p0) (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (G (NOT (AND (NOT p2) (NOT p0)))), (G (NOT (AND (NOT p1) p2 (NOT p0))))]
False Knowledge obtained : [(F (NOT (OR (AND p1 p0) (AND (NOT p2) p0)))), (F (AND p2 (NOT p0))), (F (AND (NOT p2) p0)), (F (AND (NOT p1) p2 p0)), (F (OR (AND p1 (NOT p0)) (AND (NOT p2) (NOT p0)))), (F (NOT (AND p2 p0)))]
Knowledge based reduction with 29 factoid took 1064 ms. Reduced automaton from 5 states, 16 edges and 3 AP (stutter insensitive) to 4 states, 12 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 178 ms :[(OR (NOT p2) (AND p0 p1)), (OR (NOT p2) (AND p0 p1)), (NOT p2), false]
Stuttering acceptance computed with spot in 174 ms :[(OR (NOT p2) (AND p0 p1)), (OR (NOT p2) (AND p0 p1)), (NOT p2), false]
[2024-05-31 01:37:31] [INFO ] Flow matrix only has 83 transitions (discarded 11 similar events)
[2024-05-31 01:37:31] [INFO ] Invariant cache hit.
[2024-05-31 01:37:31] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-31 01:37:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 01:37:31] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2024-05-31 01:37:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 01:37:31] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-31 01:37:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 01:37:31] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2024-05-31 01:37:31] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-31 01:37:31] [INFO ] [Nat]Added 12 Read/Feed constraints in 2 ms returned sat
[2024-05-31 01:37:31] [INFO ] Computed and/alt/rep : 71/195/71 causal constraints (skipped 11 transitions) in 6 ms.
[2024-05-31 01:37:31] [INFO ] Added : 5 causal constraints over 2 iterations in 20 ms. Result :sat
Could not prove EG (AND p0 p1)
Support contains 5 out of 31 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 31/31 places, 94/94 transitions.
Applied a total of 0 rules in 3 ms. Remains 31 /31 variables (removed 0) and now considering 94/94 (removed 0) transitions.
[2024-05-31 01:37:31] [INFO ] Flow matrix only has 83 transitions (discarded 11 similar events)
[2024-05-31 01:37:31] [INFO ] Invariant cache hit.
[2024-05-31 01:37:31] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-31 01:37:31] [INFO ] Flow matrix only has 83 transitions (discarded 11 similar events)
[2024-05-31 01:37:31] [INFO ] Invariant cache hit.
[2024-05-31 01:37:31] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-31 01:37:31] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
[2024-05-31 01:37:31] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-31 01:37:31] [INFO ] Flow matrix only has 83 transitions (discarded 11 similar events)
[2024-05-31 01:37:31] [INFO ] Invariant cache hit.
[2024-05-31 01:37:31] [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 157 ms. Remains : 31/31 places, 94/94 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p1 p2 p0), (X (AND p2 p0)), (X (AND (NOT p1) p2 p0)), (X (NOT (AND p2 (NOT p0)))), (X p2), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT (OR (AND p1 p0) (NOT p2)))), (X (X (AND p2 p0))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X p2)), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (OR (AND p1 p0) (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 138 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter insensitive) to 4 states, 12 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 196 ms :[(OR (NOT p2) (AND p0 p1)), (OR (NOT p2) (AND p0 p1)), (NOT p2), false]
Incomplete random walk after 10000 steps, including 264 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 7) seen :6
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-31 01:37:32] [INFO ] Flow matrix only has 83 transitions (discarded 11 similar events)
[2024-05-31 01:37:32] [INFO ] Invariant cache hit.
[2024-05-31 01:37:32] [INFO ] After 22ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 01:37:32] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-31 01:37:32] [INFO ] After 20ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 01:37:32] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-31 01:37:32] [INFO ] After 5ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-31 01:37:32] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2024-05-31 01:37:32] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-31 01:37:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 62 ms
[2024-05-31 01:37:32] [INFO ] After 71ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :0
[2024-05-31 01:37:32] [INFO ] After 114ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p2 p0), (X (AND p2 p0)), (X (AND (NOT p1) p2 p0)), (X (NOT (AND p2 (NOT p0)))), (X p2), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT (OR (AND p1 p0) (NOT p2)))), (X (X (AND p2 p0))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X p2)), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (OR (AND p1 p0) (NOT p2)))), (G (NOT (AND (NOT p0) p2 (NOT p1))))]
False Knowledge obtained : [(F (NOT (OR (AND p0 p1) (NOT p2)))), (F (NOT (AND p0 p2))), (F (NOT p2)), (F (AND p2 (NOT p1))), (F (AND (NOT p0) p2)), (F (AND p0 p2 (NOT p1)))]
Knowledge based reduction with 14 factoid took 411 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter insensitive) to 4 states, 12 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 199 ms :[(OR (NOT p2) (AND p0 p1)), (OR (NOT p2) (AND p0 p1)), (NOT p2), false]
Stuttering acceptance computed with spot in 170 ms :[(OR (NOT p2) (AND p0 p1)), (OR (NOT p2) (AND p0 p1)), (NOT p2), false]
[2024-05-31 01:37:33] [INFO ] Flow matrix only has 83 transitions (discarded 11 similar events)
[2024-05-31 01:37:33] [INFO ] Invariant cache hit.
[2024-05-31 01:37:33] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-31 01:37:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 01:37:33] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2024-05-31 01:37:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 01:37:33] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-31 01:37:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 01:37:33] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2024-05-31 01:37:33] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-31 01:37:33] [INFO ] [Nat]Added 12 Read/Feed constraints in 2 ms returned sat
[2024-05-31 01:37:33] [INFO ] Computed and/alt/rep : 71/195/71 causal constraints (skipped 11 transitions) in 4 ms.
[2024-05-31 01:37:33] [INFO ] Added : 5 causal constraints over 2 iterations in 26 ms. Result :sat
Could not prove EG (AND p0 p1)
Stuttering acceptance computed with spot in 162 ms :[(OR (NOT p2) (AND p0 p1)), (OR (NOT p2) (AND p0 p1)), (NOT p2), false]
Product exploration explored 100000 steps with 0 reset in 58 ms.
Product exploration explored 100000 steps with 0 reset in 59 ms.
Built C files in :
/tmp/ltsmin7918800720917545481
[2024-05-31 01:37:33] [INFO ] Computing symmetric may disable matrix : 94 transitions.
[2024-05-31 01:37:33] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 01:37:33] [INFO ] Computing symmetric may enable matrix : 94 transitions.
[2024-05-31 01:37:33] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 01:37:33] [INFO ] Computing Do-Not-Accords matrix : 94 transitions.
[2024-05-31 01:37:33] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 01:37:33] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7918800720917545481
Running compilation step : cd /tmp/ltsmin7918800720917545481;'/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 282 ms.
Running link step : cd /tmp/ltsmin7918800720917545481;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin7918800720917545481;'/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/stateBased13017912948288134841.hoa' '--buchi-type=spotba'
LTSmin run took 100 ms.
FORMULA StigmergyCommit-PT-09a-LTLCardinality-09 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property StigmergyCommit-PT-09a-LTLCardinality-09 finished in 5908 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 1 out of 181 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 181/181 places, 2295/2295 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 162 transition count 2273
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 162 transition count 2273
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 43 place count 162 transition count 2268
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 56 place count 149 transition count 2252
Iterating global reduction 1 with 13 rules applied. Total rules applied 69 place count 149 transition count 2252
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 70 place count 149 transition count 2251
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 80 place count 139 transition count 2241
Iterating global reduction 2 with 10 rules applied. Total rules applied 90 place count 139 transition count 2241
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 91 place count 139 transition count 2240
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 97 place count 133 transition count 2234
Iterating global reduction 3 with 6 rules applied. Total rules applied 103 place count 133 transition count 2234
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 104 place count 133 transition count 2233
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 108 place count 129 transition count 2229
Iterating global reduction 4 with 4 rules applied. Total rules applied 112 place count 129 transition count 2229
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 113 place count 129 transition count 2228
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 114 place count 128 transition count 2227
Iterating global reduction 5 with 1 rules applied. Total rules applied 115 place count 128 transition count 2227
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 116 place count 128 transition count 2226
Applied a total of 116 rules in 51 ms. Remains 128 /181 variables (removed 53) and now considering 2226/2295 (removed 69) transitions.
[2024-05-31 01:37:34] [INFO ] Flow matrix only has 2215 transitions (discarded 11 similar events)
// Phase 1: matrix 2215 rows 128 cols
[2024-05-31 01:37:34] [INFO ] Computed 1 invariants in 12 ms
[2024-05-31 01:37:34] [INFO ] Implicit Places using invariants in 592 ms returned []
[2024-05-31 01:37:34] [INFO ] Flow matrix only has 2215 transitions (discarded 11 similar events)
[2024-05-31 01:37:34] [INFO ] Invariant cache hit.
[2024-05-31 01:37:35] [INFO ] State equation strengthened by 2055 read => feed constraints.
[2024-05-31 01:37:36] [INFO ] Implicit Places using invariants and state equation in 1354 ms returned []
Implicit Place search using SMT with State Equation took 1954 ms to find 0 implicit places.
[2024-05-31 01:37:36] [INFO ] Flow matrix only has 2215 transitions (discarded 11 similar events)
[2024-05-31 01:37:36] [INFO ] Invariant cache hit.
[2024-05-31 01:37:36] [INFO ] Dead Transitions using invariants and state equation in 710 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 128/181 places, 2226/2295 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2716 ms. Remains : 128/181 places, 2226/2295 transitions.
Stuttering acceptance computed with spot in 235 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-09a-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(EQ s32 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA StigmergyCommit-PT-09a-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-09a-LTLCardinality-10 finished in 2976 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 181 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 181/181 places, 2295/2295 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 78 transitions
Trivial Post-agglo rules discarded 78 transitions
Performed 78 trivial Post agglomeration. Transition count delta: 78
Iterating post reduction 0 with 78 rules applied. Total rules applied 78 place count 180 transition count 2216
Reduce places removed 78 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 89 rules applied. Total rules applied 167 place count 102 transition count 2205
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 169 place count 101 transition count 2204
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 169 place count 101 transition count 2191
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 195 place count 88 transition count 2191
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 198 place count 85 transition count 2185
Iterating global reduction 3 with 3 rules applied. Total rules applied 201 place count 85 transition count 2185
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 204 place count 82 transition count 2179
Iterating global reduction 3 with 3 rules applied. Total rules applied 207 place count 82 transition count 2179
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 214 place count 82 transition count 2172
Performed 39 Post agglomeration using F-continuation condition with reduction of 13 identical transitions.
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 4 with 78 rules applied. Total rules applied 292 place count 43 transition count 2120
Ensure Unique test removed 1027 transitions
Reduce isomorphic transitions removed 1027 transitions.
Iterating post reduction 4 with 1027 rules applied. Total rules applied 1319 place count 43 transition count 1093
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 1327 place count 39 transition count 1089
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 1331 place count 39 transition count 1085
Drop transitions removed 1033 transitions
Redundant transition composition rules discarded 1033 transitions
Iterating global reduction 6 with 1033 rules applied. Total rules applied 2364 place count 39 transition count 52
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 6 with 20 rules applied. Total rules applied 2384 place count 29 transition count 42
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 2386 place count 29 transition count 42
Reduce places removed 6 places and 6 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 2392 place count 23 transition count 36
Applied a total of 2392 rules in 240 ms. Remains 23 /181 variables (removed 158) and now considering 36/2295 (removed 2259) transitions.
[2024-05-31 01:37:37] [INFO ] Flow matrix only has 25 transitions (discarded 11 similar events)
// Phase 1: matrix 25 rows 23 cols
[2024-05-31 01:37:37] [INFO ] Computed 1 invariants in 1 ms
[2024-05-31 01:37:37] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-31 01:37:37] [INFO ] Flow matrix only has 25 transitions (discarded 11 similar events)
[2024-05-31 01:37:37] [INFO ] Invariant cache hit.
[2024-05-31 01:37:37] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
[2024-05-31 01:37:37] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-31 01:37:37] [INFO ] Flow matrix only has 25 transitions (discarded 11 similar events)
[2024-05-31 01:37:37] [INFO ] Invariant cache hit.
[2024-05-31 01:37:37] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 23/181 places, 36/2295 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 345 ms. Remains : 23/181 places, 36/2295 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-09a-LTLCardinality-11 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:(EQ s18 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 0 steps with 0 reset in 0 ms.
FORMULA StigmergyCommit-PT-09a-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-09a-LTLCardinality-11 finished in 447 ms.
All properties solved by simple procedures.
Total runtime 53917 ms.

BK_STOP 1717119458581

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="StigmergyCommit-PT-09a"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is StigmergyCommit-PT-09a, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r417-tall-171690555800127"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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