Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r453-smll-167912645800683.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is StigmergyElection-PT-10a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r453-smll-167912645800683
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 51M
-rw-r--r-- 1 mcc users 9.4K Feb 26 16:33 CTLCardinality.txt
-rw-r--r-- 1 mcc users 111K Feb 26 16:33 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 26 16:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 26 16:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 17:15 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 17:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 16:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 129K Feb 26 16:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Feb 26 16:42 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 26 16:42 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 17:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 50M Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679438280162

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=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyElection-PT-10a
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202303021504
[2023-03-21 22:38:03] [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]
[2023-03-21 22:38:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 22:38:06] [INFO ] Load time of PNML (sax parser for PT used): 2866 ms
[2023-03-21 22:38:06] [INFO ] Transformed 142 places.
[2023-03-21 22:38:07] [INFO ] Transformed 50162 transitions.
[2023-03-21 22:38:07] [INFO ] Found NUPN structural information;
[2023-03-21 22:38:07] [INFO ] Parsed PT model containing 142 places and 50162 transitions and 999212 arcs in 3326 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 15 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 StigmergyElection-PT-10a-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-10a-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-10a-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 31 out of 142 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 142/142 places, 2238/2238 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 130 transition count 2220
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 130 transition count 2220
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 28 place count 126 transition count 2212
Iterating global reduction 0 with 4 rules applied. Total rules applied 32 place count 126 transition count 2212
Applied a total of 32 rules in 91 ms. Remains 126 /142 variables (removed 16) and now considering 2212/2238 (removed 26) transitions.
[2023-03-21 22:38:08] [INFO ] Flow matrix only has 2194 transitions (discarded 18 similar events)
// Phase 1: matrix 2194 rows 126 cols
[2023-03-21 22:38:08] [INFO ] Computed 5 place invariants in 59 ms
[2023-03-21 22:38:09] [INFO ] Implicit Places using invariants in 1832 ms returned []
[2023-03-21 22:38:09] [INFO ] Flow matrix only has 2194 transitions (discarded 18 similar events)
[2023-03-21 22:38:09] [INFO ] Invariant cache hit.
[2023-03-21 22:38:11] [INFO ] State equation strengthened by 2095 read => feed constraints.
[2023-03-21 22:38:11] [INFO ] Implicit Places using invariants and state equation in 1640 ms returned []
Implicit Place search using SMT with State Equation took 3524 ms to find 0 implicit places.
[2023-03-21 22:38:11] [INFO ] Flow matrix only has 2194 transitions (discarded 18 similar events)
[2023-03-21 22:38:11] [INFO ] Invariant cache hit.
[2023-03-21 22:38:13] [INFO ] Dead Transitions using invariants and state equation in 1895 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 126/142 places, 2212/2238 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5520 ms. Remains : 126/142 places, 2212/2238 transitions.
Support contains 31 out of 126 places after structural reductions.
[2023-03-21 22:38:14] [INFO ] Flatten gal took : 555 ms
[2023-03-21 22:38:14] [INFO ] Flatten gal took : 272 ms
[2023-03-21 22:38:15] [INFO ] Input system was already deterministic with 2212 transitions.
Support contains 30 out of 126 places (down from 31) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1694 ms. (steps per millisecond=5 ) properties (out of 20) seen :13
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 6) 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 6) 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 6) 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 6) 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 6) 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 6) seen :1
Running SMT prover for 5 properties.
[2023-03-21 22:38:17] [INFO ] Flow matrix only has 2194 transitions (discarded 18 similar events)
[2023-03-21 22:38:17] [INFO ] Invariant cache hit.
[2023-03-21 22:38:17] [INFO ] After 95ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-21 22:38:17] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-21 22:38:18] [INFO ] After 1104ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-21 22:38:18] [INFO ] State equation strengthened by 2095 read => feed constraints.
[2023-03-21 22:38:19] [INFO ] After 1082ms SMT Verify possible using 2095 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-21 22:38:21] [INFO ] Deduced a trap composed of 14 places in 1327 ms of which 4 ms to minimize.
[2023-03-21 22:38:22] [INFO ] Deduced a trap composed of 13 places in 1253 ms of which 1 ms to minimize.
[2023-03-21 22:38:23] [INFO ] Deduced a trap composed of 12 places in 1068 ms of which 2 ms to minimize.
[2023-03-21 22:38:24] [INFO ] Deduced a trap composed of 12 places in 824 ms of which 1 ms to minimize.
[2023-03-21 22:38:25] [INFO ] Deduced a trap composed of 12 places in 837 ms of which 6 ms to minimize.
[2023-03-21 22:38:26] [INFO ] Deduced a trap composed of 13 places in 734 ms of which 1 ms to minimize.
[2023-03-21 22:38:27] [INFO ] Deduced a trap composed of 13 places in 647 ms of which 5 ms to minimize.
[2023-03-21 22:38:28] [INFO ] Deduced a trap composed of 12 places in 659 ms of which 2 ms to minimize.
[2023-03-21 22:38:28] [INFO ] Deduced a trap composed of 12 places in 602 ms of which 1 ms to minimize.
[2023-03-21 22:38:29] [INFO ] Deduced a trap composed of 10 places in 611 ms of which 1 ms to minimize.
[2023-03-21 22:38:30] [INFO ] Deduced a trap composed of 12 places in 457 ms of which 1 ms to minimize.
[2023-03-21 22:38:30] [INFO ] Deduced a trap composed of 12 places in 347 ms of which 1 ms to minimize.
[2023-03-21 22:38:31] [INFO ] Deduced a trap composed of 11 places in 473 ms of which 1 ms to minimize.
[2023-03-21 22:38:31] [INFO ] Deduced a trap composed of 11 places in 372 ms of which 1 ms to minimize.
[2023-03-21 22:38:32] [INFO ] Deduced a trap composed of 12 places in 382 ms of which 1 ms to minimize.
[2023-03-21 22:38:32] [INFO ] Deduced a trap composed of 12 places in 257 ms of which 1 ms to minimize.
[2023-03-21 22:38:32] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 12545 ms
[2023-03-21 22:38:33] [INFO ] Deduced a trap composed of 12 places in 260 ms of which 1 ms to minimize.
[2023-03-21 22:38:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 436 ms
[2023-03-21 22:38:34] [INFO ] Deduced a trap composed of 12 places in 909 ms of which 1 ms to minimize.
[2023-03-21 22:38:35] [INFO ] Deduced a trap composed of 13 places in 583 ms of which 0 ms to minimize.
[2023-03-21 22:38:35] [INFO ] Deduced a trap composed of 12 places in 390 ms of which 1 ms to minimize.
[2023-03-21 22:38:36] [INFO ] Deduced a trap composed of 12 places in 396 ms of which 1 ms to minimize.
[2023-03-21 22:38:36] [INFO ] Deduced a trap composed of 11 places in 398 ms of which 0 ms to minimize.
[2023-03-21 22:38:37] [INFO ] Deduced a trap composed of 11 places in 363 ms of which 1 ms to minimize.
[2023-03-21 22:38:37] [INFO ] Deduced a trap composed of 12 places in 293 ms of which 1 ms to minimize.
[2023-03-21 22:38:37] [INFO ] Deduced a trap composed of 12 places in 344 ms of which 0 ms to minimize.
[2023-03-21 22:38:38] [INFO ] Deduced a trap composed of 11 places in 240 ms of which 1 ms to minimize.
[2023-03-21 22:38:38] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 4796 ms
[2023-03-21 22:38:38] [INFO ] Deduced a trap composed of 11 places in 379 ms of which 1 ms to minimize.
[2023-03-21 22:38:39] [INFO ] Deduced a trap composed of 11 places in 251 ms of which 1 ms to minimize.
[2023-03-21 22:38:39] [INFO ] Deduced a trap composed of 11 places in 281 ms of which 1 ms to minimize.
[2023-03-21 22:38:39] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1305 ms
[2023-03-21 22:38:39] [INFO ] After 20938ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 500 ms.
[2023-03-21 22:38:40] [INFO ] After 22973ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 49 ms.
Support contains 7 out of 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 2212/2212 transitions.
Graph (complete) has 487 edges and 126 vertex of which 124 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.34 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 25 transitions
Reduce isomorphic transitions removed 25 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 0 with 37 rules applied. Total rules applied 38 place count 124 transition count 2173
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 28 rules applied. Total rules applied 66 place count 112 transition count 2157
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 70 place count 108 transition count 2157
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 18 Pre rules applied. Total rules applied 70 place count 108 transition count 2139
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 106 place count 90 transition count 2139
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 120 place count 76 transition count 2123
Iterating global reduction 3 with 14 rules applied. Total rules applied 134 place count 76 transition count 2123
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 145 place count 65 transition count 2112
Iterating global reduction 3 with 11 rules applied. Total rules applied 156 place count 65 transition count 2112
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 3 with 36 rules applied. Total rules applied 192 place count 65 transition count 2076
Performed 15 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 4 with 30 rules applied. Total rules applied 222 place count 50 transition count 2060
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 223 place count 50 transition count 2059
Discarding 14 places :
Symmetric choice reduction at 5 with 14 rule applications. Total rules 237 place count 36 transition count 2045
Iterating global reduction 5 with 14 rules applied. Total rules applied 251 place count 36 transition count 2045
Ensure Unique test removed 480 transitions
Reduce isomorphic transitions removed 480 transitions.
Iterating post reduction 5 with 480 rules applied. Total rules applied 731 place count 36 transition count 1565
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 733 place count 35 transition count 1564
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 734 place count 34 transition count 1563
Iterating global reduction 6 with 1 rules applied. Total rules applied 735 place count 34 transition count 1563
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 737 place count 34 transition count 1561
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 739 place count 34 transition count 1561
Applied a total of 739 rules in 2223 ms. Remains 34 /126 variables (removed 92) and now considering 1561/2212 (removed 651) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2224 ms. Remains : 34/126 places, 1561/2212 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 2077 ms. (steps per millisecond=4 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1561 rows 34 cols
[2023-03-21 22:38:44] [INFO ] Computed 11 place invariants in 12 ms
[2023-03-21 22:38:44] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-21 22:38:44] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-21 22:38:45] [INFO ] After 473ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-21 22:38:45] [INFO ] State equation strengthened by 1552 read => feed constraints.
[2023-03-21 22:38:45] [INFO ] After 393ms SMT Verify possible using 1552 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-21 22:38:46] [INFO ] Deduced a trap composed of 4 places in 530 ms of which 1 ms to minimize.
[2023-03-21 22:38:46] [INFO ] Deduced a trap composed of 4 places in 569 ms of which 0 ms to minimize.
[2023-03-21 22:38:47] [INFO ] Deduced a trap composed of 4 places in 424 ms of which 2 ms to minimize.
[2023-03-21 22:38:47] [INFO ] Deduced a trap composed of 4 places in 356 ms of which 5 ms to minimize.
[2023-03-21 22:38:48] [INFO ] Deduced a trap composed of 4 places in 301 ms of which 0 ms to minimize.
[2023-03-21 22:38:48] [INFO ] Deduced a trap composed of 4 places in 287 ms of which 1 ms to minimize.
[2023-03-21 22:38:48] [INFO ] Deduced a trap composed of 4 places in 323 ms of which 1 ms to minimize.
[2023-03-21 22:38:49] [INFO ] Deduced a trap composed of 4 places in 262 ms of which 1 ms to minimize.
[2023-03-21 22:38:49] [INFO ] Deduced a trap composed of 4 places in 181 ms of which 1 ms to minimize.
[2023-03-21 22:38:49] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 3830 ms
[2023-03-21 22:38:49] [INFO ] Deduced a trap composed of 5 places in 183 ms of which 1 ms to minimize.
[2023-03-21 22:38:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 300 ms
[2023-03-21 22:38:49] [INFO ] After 4698ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 208 ms.
[2023-03-21 22:38:50] [INFO ] After 5478ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 1 properties in 14 ms.
Support contains 2 out of 34 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 34/34 places, 1561/1561 transitions.
Graph (complete) has 205 edges and 34 vertex of which 33 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 33 transition count 1560
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 2 place count 33 transition count 1559
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 4 place count 32 transition count 1559
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 7 place count 29 transition count 1556
Iterating global reduction 1 with 3 rules applied. Total rules applied 10 place count 29 transition count 1556
Ensure Unique test removed 512 transitions
Reduce isomorphic transitions removed 512 transitions.
Iterating post reduction 1 with 512 rules applied. Total rules applied 522 place count 29 transition count 1044
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 526 place count 27 transition count 1042
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 527 place count 26 transition count 1041
Iterating global reduction 2 with 1 rules applied. Total rules applied 528 place count 26 transition count 1041
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 529 place count 26 transition count 1040
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 530 place count 25 transition count 1039
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 531 place count 24 transition count 1039
Performed 10 Post agglomeration using F-continuation condition with reduction of 1013 identical transitions.
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 559 place count 6 transition count 16
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 569 place count 6 transition count 6
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 570 place count 6 transition count 6
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 571 place count 6 transition count 5
Applied a total of 571 rules in 462 ms. Remains 6 /34 variables (removed 28) and now considering 5/1561 (removed 1556) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 462 ms. Remains : 6/34 places, 5/1561 transitions.
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
FORMULA StigmergyElection-PT-10a-LTLCardinality-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 22 stabilizing places and 21 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p0)||(p0&&F(p1))))))'
Support contains 3 out of 126 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 2212/2212 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 118 transition count 2198
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 118 transition count 2198
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 20 place count 114 transition count 2190
Iterating global reduction 0 with 4 rules applied. Total rules applied 24 place count 114 transition count 2190
Applied a total of 24 rules in 39 ms. Remains 114 /126 variables (removed 12) and now considering 2190/2212 (removed 22) transitions.
[2023-03-21 22:38:51] [INFO ] Flow matrix only has 2178 transitions (discarded 12 similar events)
// Phase 1: matrix 2178 rows 114 cols
[2023-03-21 22:38:51] [INFO ] Computed 3 place invariants in 24 ms
[2023-03-21 22:38:52] [INFO ] Implicit Places using invariants in 1052 ms returned []
[2023-03-21 22:38:52] [INFO ] Flow matrix only has 2178 transitions (discarded 12 similar events)
[2023-03-21 22:38:52] [INFO ] Invariant cache hit.
[2023-03-21 22:38:53] [INFO ] State equation strengthened by 2095 read => feed constraints.
[2023-03-21 22:38:53] [INFO ] Implicit Places using invariants and state equation in 1189 ms returned []
Implicit Place search using SMT with State Equation took 2249 ms to find 0 implicit places.
[2023-03-21 22:38:53] [INFO ] Flow matrix only has 2178 transitions (discarded 12 similar events)
[2023-03-21 22:38:53] [INFO ] Invariant cache hit.
[2023-03-21 22:38:54] [INFO ] Dead Transitions using invariants and state equation in 1553 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 114/126 places, 2190/2212 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3845 ms. Remains : 114/126 places, 2190/2212 transitions.
Stuttering acceptance computed with spot in 363 ms :[true, (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyElection-PT-10a-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 2}]], initial=4, aps=[p1:(OR (EQ s90 0) (EQ s62 1)), p0:(EQ s98 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 2 ms.
FORMULA StigmergyElection-PT-10a-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-10a-LTLCardinality-00 finished in 4321 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 126 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 2212/2212 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 117 transition count 2197
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 117 transition count 2197
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 114 transition count 2191
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 114 transition count 2191
Applied a total of 24 rules in 28 ms. Remains 114 /126 variables (removed 12) and now considering 2191/2212 (removed 21) transitions.
[2023-03-21 22:38:55] [INFO ] Flow matrix only has 2180 transitions (discarded 11 similar events)
// Phase 1: matrix 2180 rows 114 cols
[2023-03-21 22:38:55] [INFO ] Computed 2 place invariants in 11 ms
[2023-03-21 22:38:56] [INFO ] Implicit Places using invariants in 1021 ms returned []
[2023-03-21 22:38:56] [INFO ] Flow matrix only has 2180 transitions (discarded 11 similar events)
[2023-03-21 22:38:56] [INFO ] Invariant cache hit.
[2023-03-21 22:38:57] [INFO ] State equation strengthened by 2095 read => feed constraints.
[2023-03-21 22:38:58] [INFO ] Implicit Places using invariants and state equation in 1893 ms returned []
Implicit Place search using SMT with State Equation took 2920 ms to find 0 implicit places.
[2023-03-21 22:38:58] [INFO ] Flow matrix only has 2180 transitions (discarded 11 similar events)
[2023-03-21 22:38:58] [INFO ] Invariant cache hit.
[2023-03-21 22:39:00] [INFO ] Dead Transitions using invariants and state equation in 1993 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 114/126 places, 2191/2212 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4944 ms. Remains : 114/126 places, 2191/2212 transitions.
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyElection-PT-10a-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s69 0) (EQ s55 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 589 ms.
Product exploration explored 100000 steps with 50000 reset in 464 ms.
Computed a total of 22 stabilizing places and 21 stable transitions
Computed a total of 22 stabilizing places and 21 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 110 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA StigmergyElection-PT-10a-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyElection-PT-10a-LTLCardinality-01 finished in 6256 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 2 out of 126 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 2212/2212 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 118 transition count 2199
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 118 transition count 2199
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 20 place count 114 transition count 2191
Iterating global reduction 0 with 4 rules applied. Total rules applied 24 place count 114 transition count 2191
Applied a total of 24 rules in 28 ms. Remains 114 /126 variables (removed 12) and now considering 2191/2212 (removed 21) transitions.
[2023-03-21 22:39:01] [INFO ] Flow matrix only has 2180 transitions (discarded 11 similar events)
// Phase 1: matrix 2180 rows 114 cols
[2023-03-21 22:39:01] [INFO ] Computed 2 place invariants in 15 ms
[2023-03-21 22:39:02] [INFO ] Implicit Places using invariants in 857 ms returned []
[2023-03-21 22:39:02] [INFO ] Flow matrix only has 2180 transitions (discarded 11 similar events)
[2023-03-21 22:39:02] [INFO ] Invariant cache hit.
[2023-03-21 22:39:03] [INFO ] State equation strengthened by 2095 read => feed constraints.
[2023-03-21 22:39:03] [INFO ] Implicit Places using invariants and state equation in 1123 ms returned []
Implicit Place search using SMT with State Equation took 1985 ms to find 0 implicit places.
[2023-03-21 22:39:03] [INFO ] Flow matrix only has 2180 transitions (discarded 11 similar events)
[2023-03-21 22:39:03] [INFO ] Invariant cache hit.
[2023-03-21 22:39:05] [INFO ] Dead Transitions using invariants and state equation in 2196 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 114/126 places, 2191/2212 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4212 ms. Remains : 114/126 places, 2191/2212 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : StigmergyElection-PT-10a-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s28 0) (EQ s102 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA StigmergyElection-PT-10a-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-10a-LTLCardinality-02 finished in 4318 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(F((F(p1)&&p0)))))))'
Support contains 2 out of 126 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 2212/2212 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 117 transition count 2197
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 117 transition count 2197
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 22 place count 113 transition count 2189
Iterating global reduction 0 with 4 rules applied. Total rules applied 26 place count 113 transition count 2189
Applied a total of 26 rules in 27 ms. Remains 113 /126 variables (removed 13) and now considering 2189/2212 (removed 23) transitions.
[2023-03-21 22:39:05] [INFO ] Flow matrix only has 2178 transitions (discarded 11 similar events)
// Phase 1: matrix 2178 rows 113 cols
[2023-03-21 22:39:06] [INFO ] Computed 2 place invariants in 14 ms
[2023-03-21 22:39:06] [INFO ] Implicit Places using invariants in 768 ms returned []
[2023-03-21 22:39:06] [INFO ] Flow matrix only has 2178 transitions (discarded 11 similar events)
[2023-03-21 22:39:06] [INFO ] Invariant cache hit.
[2023-03-21 22:39:07] [INFO ] State equation strengthened by 2095 read => feed constraints.
[2023-03-21 22:39:07] [INFO ] Implicit Places using invariants and state equation in 1105 ms returned []
Implicit Place search using SMT with State Equation took 1892 ms to find 0 implicit places.
[2023-03-21 22:39:07] [INFO ] Flow matrix only has 2178 transitions (discarded 11 similar events)
[2023-03-21 22:39:07] [INFO ] Invariant cache hit.
[2023-03-21 22:39:10] [INFO ] Dead Transitions using invariants and state equation in 2586 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 113/126 places, 2189/2212 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4508 ms. Remains : 113/126 places, 2189/2212 transitions.
Stuttering acceptance computed with spot in 399 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : StigmergyElection-PT-10a-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}]], initial=5, aps=[p1:(AND (NEQ s29 0) (NEQ s12 1)), p0:(AND (NEQ s29 0) (NEQ s12 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 21 steps with 0 reset in 3 ms.
FORMULA StigmergyElection-PT-10a-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-10a-LTLCardinality-03 finished in 4940 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&X(X(G(p1)))))))'
Support contains 3 out of 126 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 2212/2212 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 120 transition count 2202
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 120 transition count 2202
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 118 transition count 2198
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 118 transition count 2198
Applied a total of 16 rules in 45 ms. Remains 118 /126 variables (removed 8) and now considering 2198/2212 (removed 14) transitions.
[2023-03-21 22:39:10] [INFO ] Flow matrix only has 2184 transitions (discarded 14 similar events)
// Phase 1: matrix 2184 rows 118 cols
[2023-03-21 22:39:10] [INFO ] Computed 3 place invariants in 15 ms
[2023-03-21 22:39:11] [INFO ] Implicit Places using invariants in 813 ms returned []
[2023-03-21 22:39:11] [INFO ] Flow matrix only has 2184 transitions (discarded 14 similar events)
[2023-03-21 22:39:11] [INFO ] Invariant cache hit.
[2023-03-21 22:39:12] [INFO ] State equation strengthened by 2095 read => feed constraints.
[2023-03-21 22:39:12] [INFO ] Implicit Places using invariants and state equation in 1130 ms returned []
Implicit Place search using SMT with State Equation took 1946 ms to find 0 implicit places.
[2023-03-21 22:39:12] [INFO ] Flow matrix only has 2184 transitions (discarded 14 similar events)
[2023-03-21 22:39:12] [INFO ] Invariant cache hit.
[2023-03-21 22:39:14] [INFO ] Dead Transitions using invariants and state equation in 1825 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 118/126 places, 2198/2212 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3818 ms. Remains : 118/126 places, 2198/2212 transitions.
Stuttering acceptance computed with spot in 251 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : StigmergyElection-PT-10a-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 3}, { cond=p0, acceptance={0} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 p1), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 3}, { cond=(AND p0 p1), acceptance={} source=4 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(OR (EQ s70 0) (EQ s46 1)), p1:(EQ s77 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 21 steps with 0 reset in 3 ms.
FORMULA StigmergyElection-PT-10a-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-10a-LTLCardinality-04 finished in 4109 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F((p0&&F(G(p1))))||G((p2 U X(p3))))))'
Support contains 7 out of 126 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 2212/2212 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 119 transition count 2200
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 119 transition count 2200
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 18 place count 115 transition count 2192
Iterating global reduction 0 with 4 rules applied. Total rules applied 22 place count 115 transition count 2192
Applied a total of 22 rules in 41 ms. Remains 115 /126 variables (removed 11) and now considering 2192/2212 (removed 20) transitions.
[2023-03-21 22:39:15] [INFO ] Flow matrix only has 2180 transitions (discarded 12 similar events)
// Phase 1: matrix 2180 rows 115 cols
[2023-03-21 22:39:15] [INFO ] Computed 3 place invariants in 16 ms
[2023-03-21 22:39:16] [INFO ] Implicit Places using invariants in 956 ms returned []
[2023-03-21 22:39:16] [INFO ] Flow matrix only has 2180 transitions (discarded 12 similar events)
[2023-03-21 22:39:16] [INFO ] Invariant cache hit.
[2023-03-21 22:39:16] [INFO ] State equation strengthened by 2095 read => feed constraints.
[2023-03-21 22:39:17] [INFO ] Implicit Places using invariants and state equation in 1115 ms returned []
Implicit Place search using SMT with State Equation took 2073 ms to find 0 implicit places.
[2023-03-21 22:39:17] [INFO ] Flow matrix only has 2180 transitions (discarded 12 similar events)
[2023-03-21 22:39:17] [INFO ] Invariant cache hit.
[2023-03-21 22:39:19] [INFO ] Dead Transitions using invariants and state equation in 2005 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 115/126 places, 2192/2212 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4120 ms. Remains : 115/126 places, 2192/2212 transitions.
Stuttering acceptance computed with spot in 430 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p3) (NOT p1)), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p3)), (NOT p1), (NOT p0)]
Running random walk in product with property : StigmergyElection-PT-10a-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}, { cond=(NOT p2), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 5}, { cond=(AND p2 (NOT p1)), acceptance={} source=1 dest: 6}, { cond=(AND p2 (NOT p0)), acceptance={} source=1 dest: 7}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(NOT p2), acceptance={} source=2 dest: 4}, { cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 6}], [{ cond=(NOT p0), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 5}, { cond=(AND p2 (NOT p0)), acceptance={} source=3 dest: 7}], [{ cond=(NOT p3), acceptance={} source=4 dest: 8}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=5 dest: 9}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=6 dest: 4}, { cond=(AND p2 p1 (NOT p3)), acceptance={} source=6 dest: 6}, { cond=(AND p2 (NOT p1) (NOT p3)), acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p3)), acceptance={} source=7 dest: 5}, { cond=(AND p2 (NOT p0) (NOT p3)), acceptance={0} source=7 dest: 7}], [{ cond=p1, acceptance={} source=8 dest: 8}, { cond=(NOT p1), acceptance={0} source=8 dest: 8}], [{ cond=(NOT p0), acceptance={0} source=9 dest: 9}]], initial=0, aps=[p0:(EQ s114 0), p2:(OR (EQ s34 0) (EQ s83 1)), p1:(AND (EQ s45 0) (EQ s38 1)), p3:(OR (EQ s85 0) (EQ s62 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 24944 reset in 768 ms.
Product exploration explored 100000 steps with 24899 reset in 707 ms.
Computed a total of 22 stabilizing places and 21 stable transitions
Computed a total of 22 stabilizing places and 21 stable transitions
Detected a total of 22/115 stabilizing places and 21/2192 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND p0 p2 (NOT p1) p3), (X (NOT p2)), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND p2 (NOT p1)))), (X (AND (NOT p2) (NOT p0))), (X (NOT p0)), (X (X p3)), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p3))))), true, (X (X (NOT (AND p2 (NOT p0) (NOT p3))))), (X (X (NOT (AND p2 p1 (NOT p3))))), (X (X (NOT p0))), (X (X (NOT (AND p2 (NOT p1) (NOT p3))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1)))))]
Knowledge based reduction with 16 factoid took 1468 ms. Reduced automaton from 10 states, 23 edges and 4 AP (stutter sensitive) to 10 states, 19 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 434 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p3) (NOT p1)), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p3)), (NOT p1), (NOT p0)]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 1649 ms. (steps per millisecond=6 ) properties (out of 13) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 7) 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 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 7) 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 7) 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 7) seen :0
Running SMT prover for 7 properties.
[2023-03-21 22:39:24] [INFO ] Flow matrix only has 2180 transitions (discarded 12 similar events)
[2023-03-21 22:39:24] [INFO ] Invariant cache hit.
[2023-03-21 22:39:24] [INFO ] After 57ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-21 22:39:24] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-21 22:39:26] [INFO ] After 1207ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-21 22:39:26] [INFO ] State equation strengthened by 2095 read => feed constraints.
[2023-03-21 22:39:27] [INFO ] After 1136ms SMT Verify possible using 2095 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-21 22:39:28] [INFO ] Deduced a trap composed of 12 places in 1246 ms of which 2 ms to minimize.
[2023-03-21 22:39:30] [INFO ] Deduced a trap composed of 13 places in 1147 ms of which 1 ms to minimize.
[2023-03-21 22:39:31] [INFO ] Deduced a trap composed of 13 places in 1162 ms of which 0 ms to minimize.
[2023-03-21 22:39:32] [INFO ] Deduced a trap composed of 10 places in 904 ms of which 2 ms to minimize.
[2023-03-21 22:39:33] [INFO ] Deduced a trap composed of 13 places in 798 ms of which 0 ms to minimize.
[2023-03-21 22:39:34] [INFO ] Deduced a trap composed of 10 places in 710 ms of which 1 ms to minimize.
[2023-03-21 22:39:34] [INFO ] Deduced a trap composed of 10 places in 590 ms of which 1 ms to minimize.
[2023-03-21 22:39:35] [INFO ] Deduced a trap composed of 13 places in 624 ms of which 1 ms to minimize.
[2023-03-21 22:39:36] [INFO ] Deduced a trap composed of 10 places in 458 ms of which 1 ms to minimize.
[2023-03-21 22:39:36] [INFO ] Deduced a trap composed of 13 places in 378 ms of which 6 ms to minimize.
[2023-03-21 22:39:36] [INFO ] Deduced a trap composed of 10 places in 358 ms of which 1 ms to minimize.
[2023-03-21 22:39:37] [INFO ] Deduced a trap composed of 12 places in 249 ms of which 1 ms to minimize.
[2023-03-21 22:39:38] [INFO ] Deduced a trap composed of 12 places in 605 ms of which 1 ms to minimize.
[2023-03-21 22:39:38] [INFO ] Deduced a trap composed of 11 places in 571 ms of which 1 ms to minimize.
[2023-03-21 22:39:39] [INFO ] Deduced a trap composed of 12 places in 477 ms of which 1 ms to minimize.
[2023-03-21 22:39:39] [INFO ] Deduced a trap composed of 11 places in 472 ms of which 1 ms to minimize.
[2023-03-21 22:39:40] [INFO ] Deduced a trap composed of 11 places in 370 ms of which 2 ms to minimize.
[2023-03-21 22:39:40] [INFO ] Deduced a trap composed of 11 places in 250 ms of which 1 ms to minimize.
[2023-03-21 22:39:40] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 13112 ms
[2023-03-21 22:39:41] [INFO ] Deduced a trap composed of 12 places in 246 ms of which 1 ms to minimize.
[2023-03-21 22:39:41] [INFO ] Deduced a trap composed of 11 places in 239 ms of which 1 ms to minimize.
[2023-03-21 22:39:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 757 ms
[2023-03-21 22:39:41] [INFO ] Deduced a trap composed of 11 places in 252 ms of which 1 ms to minimize.
[2023-03-21 22:39:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 328 ms
[2023-03-21 22:39:42] [INFO ] Deduced a trap composed of 10 places in 612 ms of which 1 ms to minimize.
[2023-03-21 22:39:43] [INFO ] Deduced a trap composed of 11 places in 566 ms of which 1 ms to minimize.
[2023-03-21 22:39:44] [INFO ] Deduced a trap composed of 12 places in 444 ms of which 1 ms to minimize.
[2023-03-21 22:39:44] [INFO ] Deduced a trap composed of 13 places in 471 ms of which 3 ms to minimize.
[2023-03-21 22:39:45] [INFO ] Deduced a trap composed of 11 places in 497 ms of which 1 ms to minimize.
[2023-03-21 22:39:45] [INFO ] Deduced a trap composed of 11 places in 343 ms of which 2 ms to minimize.
[2023-03-21 22:39:46] [INFO ] Deduced a trap composed of 12 places in 241 ms of which 1 ms to minimize.
[2023-03-21 22:39:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 7 trap constraints in 3940 ms
[2023-03-21 22:39:46] [INFO ] Deduced a trap composed of 10 places in 248 ms of which 1 ms to minimize.
[2023-03-21 22:39:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 425 ms
[2023-03-21 22:39:46] [INFO ] After 20487ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :4
Attempting to minimize the solution found.
Minimization took 571 ms.
[2023-03-21 22:39:47] [INFO ] After 22563ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :4
Fused 7 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 36 ms.
Support contains 7 out of 115 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 115/115 places, 2192/2192 transitions.
Graph (complete) has 473 edges and 115 vertex of which 114 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.11 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 30 rules applied. Total rules applied 31 place count 114 transition count 2161
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 49 place count 105 transition count 2152
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 49 place count 105 transition count 2134
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 85 place count 87 transition count 2134
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 94 place count 78 transition count 2125
Iterating global reduction 2 with 9 rules applied. Total rules applied 103 place count 78 transition count 2125
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 111 place count 70 transition count 2117
Iterating global reduction 2 with 8 rules applied. Total rules applied 119 place count 70 transition count 2117
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 127 place count 70 transition count 2109
Performed 20 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 167 place count 50 transition count 2088
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 168 place count 50 transition count 2087
Discarding 19 places :
Symmetric choice reduction at 4 with 19 rule applications. Total rules 187 place count 31 transition count 2068
Iterating global reduction 4 with 19 rules applied. Total rules applied 206 place count 31 transition count 2068
Ensure Unique test removed 255 transitions
Reduce isomorphic transitions removed 255 transitions.
Iterating post reduction 4 with 255 rules applied. Total rules applied 461 place count 31 transition count 1813
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 462 place count 31 transition count 1812
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 463 place count 31 transition count 1812
Applied a total of 463 rules in 2029 ms. Remains 31 /115 variables (removed 84) and now considering 1812/2192 (removed 380) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2029 ms. Remains : 31/115 places, 1812/2192 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 2534 ms. (steps per millisecond=3 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 4) 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 4) 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 4) 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 4) seen :0
Finished probabilistic random walk after 1881 steps, run visited all 4 properties in 45 ms. (steps per millisecond=41 )
Probabilistic random walk after 1881 steps, saw 1852 distinct states, run finished after 46 ms. (steps per millisecond=40 ) properties seen :4
Found 3 invariant AP formulas.
Knowledge obtained : [(AND p0 p2 (NOT p1) p3), (X (NOT p2)), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND p2 (NOT p1)))), (X (AND (NOT p2) (NOT p0))), (X (NOT p0)), (X (X p3)), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p3))))), true, (X (X (NOT (AND p2 (NOT p0) (NOT p3))))), (X (X (NOT (AND p2 p1 (NOT p3))))), (X (X (NOT p0))), (X (X (NOT (AND p2 (NOT p1) (NOT p3))))), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND p2 p1 (NOT p3)))), (G (NOT (AND (NOT p2) (NOT p3)))), (G (NOT (AND (NOT p2) (NOT p0) (NOT p3))))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (F (AND p2 (NOT p1) (NOT p3))), (F (AND p2 (NOT p0))), (F (AND (NOT p2) (NOT p0))), (F (AND (NOT p0) (NOT p3))), (F p1), (F (NOT p3)), (F (NOT p2)), (F (NOT p0)), (F (NOT (AND p2 (NOT p1)))), (F (AND p2 (NOT p0) (NOT p3)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 19 factoid took 2042 ms. Reduced automaton from 10 states, 19 edges and 4 AP (stutter sensitive) to 10 states, 19 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 562 ms :[false, false, (NOT p3), (AND (NOT p0) (NOT p3)), (NOT p3), (AND (NOT p0) (NOT p3)), (NOT p3), (AND (NOT p0) (NOT p3)), (OR (NOT p1) (NOT p3)), (NOT p0)]
Stuttering acceptance computed with spot in 557 ms :[false, false, (NOT p3), (AND (NOT p0) (NOT p3)), (NOT p3), (AND (NOT p0) (NOT p3)), (NOT p3), (AND (NOT p0) (NOT p3)), (OR (NOT p1) (NOT p3)), (NOT p0)]
Support contains 7 out of 115 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 2192/2192 transitions.
Applied a total of 0 rules in 13 ms. Remains 115 /115 variables (removed 0) and now considering 2192/2192 (removed 0) transitions.
[2023-03-21 22:39:55] [INFO ] Flow matrix only has 2180 transitions (discarded 12 similar events)
[2023-03-21 22:39:55] [INFO ] Invariant cache hit.
[2023-03-21 22:39:56] [INFO ] Implicit Places using invariants in 825 ms returned []
[2023-03-21 22:39:56] [INFO ] Flow matrix only has 2180 transitions (discarded 12 similar events)
[2023-03-21 22:39:56] [INFO ] Invariant cache hit.
[2023-03-21 22:39:56] [INFO ] State equation strengthened by 2095 read => feed constraints.
[2023-03-21 22:39:57] [INFO ] Implicit Places using invariants and state equation in 998 ms returned []
Implicit Place search using SMT with State Equation took 1833 ms to find 0 implicit places.
[2023-03-21 22:39:57] [INFO ] Flow matrix only has 2180 transitions (discarded 12 similar events)
[2023-03-21 22:39:57] [INFO ] Invariant cache hit.
[2023-03-21 22:39:59] [INFO ] Dead Transitions using invariants and state equation in 2030 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3879 ms. Remains : 115/115 places, 2192/2192 transitions.
Computed a total of 22 stabilizing places and 21 stable transitions
Computed a total of 22 stabilizing places and 21 stable transitions
Detected a total of 22/115 stabilizing places and 21/2192 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND p0 p2 p3 (NOT p1)), (X p3), (X (NOT (AND p0 p2 p3 (NOT p1)))), (X (X p3)), true, (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND p0 p2 p3 (NOT p1))))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
Knowledge based reduction with 9 factoid took 559 ms. Reduced automaton from 10 states, 19 edges and 4 AP (stutter sensitive) to 10 states, 16 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 537 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3)) (AND p1 (NOT p3))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3)) (AND p1 (NOT p3))), (NOT p3), (AND (NOT p0) (NOT p3)), (NOT p3), (AND (NOT p0) (NOT p3)), (NOT p3), (AND (NOT p0) (NOT p3)), (OR (NOT p3) (NOT p1)), (NOT p0)]
Incomplete random walk after 10000 steps, including 4 resets, run finished after 1450 ms. (steps per millisecond=6 ) properties (out of 8) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 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 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-21 22:40:01] [INFO ] Flow matrix only has 2180 transitions (discarded 12 similar events)
[2023-03-21 22:40:01] [INFO ] Invariant cache hit.
[2023-03-21 22:40:01] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-21 22:40:02] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-21 22:40:02] [INFO ] After 890ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-21 22:40:03] [INFO ] State equation strengthened by 2095 read => feed constraints.
[2023-03-21 22:40:03] [INFO ] After 593ms SMT Verify possible using 2095 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-21 22:40:05] [INFO ] Deduced a trap composed of 10 places in 1294 ms of which 1 ms to minimize.
[2023-03-21 22:40:06] [INFO ] Deduced a trap composed of 11 places in 1178 ms of which 1 ms to minimize.
[2023-03-21 22:40:07] [INFO ] Deduced a trap composed of 10 places in 1066 ms of which 1 ms to minimize.
[2023-03-21 22:40:08] [INFO ] Deduced a trap composed of 12 places in 900 ms of which 1 ms to minimize.
[2023-03-21 22:40:09] [INFO ] Deduced a trap composed of 14 places in 858 ms of which 0 ms to minimize.
[2023-03-21 22:40:10] [INFO ] Deduced a trap composed of 11 places in 865 ms of which 0 ms to minimize.
[2023-03-21 22:40:11] [INFO ] Deduced a trap composed of 13 places in 717 ms of which 1 ms to minimize.
[2023-03-21 22:40:12] [INFO ] Deduced a trap composed of 13 places in 631 ms of which 1 ms to minimize.
[2023-03-21 22:40:12] [INFO ] Deduced a trap composed of 13 places in 591 ms of which 2 ms to minimize.
[2023-03-21 22:40:13] [INFO ] Deduced a trap composed of 10 places in 504 ms of which 1 ms to minimize.
[2023-03-21 22:40:13] [INFO ] Deduced a trap composed of 11 places in 376 ms of which 0 ms to minimize.
[2023-03-21 22:40:14] [INFO ] Deduced a trap composed of 10 places in 253 ms of which 0 ms to minimize.
[2023-03-21 22:40:14] [INFO ] Deduced a trap composed of 11 places in 360 ms of which 1 ms to minimize.
[2023-03-21 22:40:14] [INFO ] Deduced a trap composed of 11 places in 245 ms of which 1 ms to minimize.
[2023-03-21 22:40:15] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 11286 ms
[2023-03-21 22:40:15] [INFO ] Deduced a trap composed of 10 places in 256 ms of which 1 ms to minimize.
[2023-03-21 22:40:15] [INFO ] Deduced a trap composed of 11 places in 248 ms of which 1 ms to minimize.
[2023-03-21 22:40:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 785 ms
[2023-03-21 22:40:15] [INFO ] After 12825ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 213 ms.
[2023-03-21 22:40:16] [INFO ] After 14188ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 9 ms.
Support contains 3 out of 115 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 115/115 places, 2192/2192 transitions.
Graph (complete) has 473 edges and 115 vertex of which 114 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 30 rules applied. Total rules applied 31 place count 114 transition count 2161
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 49 place count 105 transition count 2152
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 49 place count 105 transition count 2132
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 89 place count 85 transition count 2132
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 99 place count 75 transition count 2121
Iterating global reduction 2 with 10 rules applied. Total rules applied 109 place count 75 transition count 2121
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 118 place count 66 transition count 2112
Iterating global reduction 2 with 9 rules applied. Total rules applied 127 place count 66 transition count 2112
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 136 place count 66 transition count 2103
Performed 20 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 176 place count 46 transition count 2082
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 196 place count 26 transition count 2062
Iterating global reduction 3 with 20 rules applied. Total rules applied 216 place count 26 transition count 2062
Ensure Unique test removed 1022 transitions
Reduce isomorphic transitions removed 1022 transitions.
Iterating post reduction 3 with 1022 rules applied. Total rules applied 1238 place count 26 transition count 1040
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 1239 place count 26 transition count 1039
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 1240 place count 26 transition count 1039
Applied a total of 1240 rules in 965 ms. Remains 26 /115 variables (removed 89) and now considering 1039/2192 (removed 1153) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 966 ms. Remains : 26/115 places, 1039/2192 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1244 ms. (steps per millisecond=8 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :0
Finished probabilistic random walk after 1106 steps, run visited all 2 properties in 21 ms. (steps per millisecond=52 )
Probabilistic random walk after 1106 steps, saw 1028 distinct states, run finished after 21 ms. (steps per millisecond=52 ) properties seen :2
Knowledge obtained : [(AND p0 p2 p3 (NOT p1)), (X p3), (X (NOT (AND p0 p2 p3 (NOT p1)))), (X (X p3)), true, (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND p0 p2 p3 (NOT p1))))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (AND (NOT p0) (NOT p2))), (F (NOT p0)), (F (AND p1 p3)), (F (AND (NOT p0) (NOT p3))), (F (OR p1 (NOT p0) (NOT p2))), (F (NOT p3)), (F (NOT p2)), (F (NOT (OR (NOT p1) (NOT p3))))]
Knowledge based reduction with 9 factoid took 1186 ms. Reduced automaton from 10 states, 16 edges and 4 AP (stutter sensitive) to 10 states, 16 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 591 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3)) (AND p1 (NOT p3))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3)) (AND p1 (NOT p3))), (NOT p3), (AND (NOT p0) (NOT p3)), (NOT p3), (AND (NOT p0) (NOT p3)), (NOT p3), (AND (NOT p0) (NOT p3)), (OR (NOT p3) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 584 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3)) (AND p1 (NOT p3))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3)) (AND p1 (NOT p3))), (NOT p3), (AND (NOT p0) (NOT p3)), (NOT p3), (AND (NOT p0) (NOT p3)), (NOT p3), (AND (NOT p0) (NOT p3)), (OR (NOT p3) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 586 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3)) (AND p1 (NOT p3))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3)) (AND p1 (NOT p3))), (NOT p3), (AND (NOT p0) (NOT p3)), (NOT p3), (AND (NOT p0) (NOT p3)), (NOT p3), (AND (NOT p0) (NOT p3)), (OR (NOT p3) (NOT p1)), (NOT p0)]
Product exploration explored 100000 steps with 7 reset in 1151 ms.
Product exploration explored 100000 steps with 0 reset in 1070 ms.
Applying partial POR strategy [false, false, false, false, true, true, true, true, true, true]
Stuttering acceptance computed with spot in 455 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3)) (AND p1 (NOT p3))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3)) (AND p1 (NOT p3))), (NOT p3), (AND (NOT p0) (NOT p3)), (NOT p3), (AND (NOT p0) (NOT p3)), (NOT p3), (AND (NOT p0) (NOT p3)), (OR (NOT p3) (NOT p1)), (NOT p0)]
Support contains 7 out of 115 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 115/115 places, 2192/2192 transitions.
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 9 Pre rules applied. Total rules applied 0 place count 115 transition count 2193
Deduced a syphon composed of 9 places in 1 ms
Iterating global reduction 0 with 9 rules applied. Total rules applied 9 place count 115 transition count 2193
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 37 places in 1 ms
Iterating global reduction 0 with 28 rules applied. Total rules applied 37 place count 115 transition count 2203
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 55 place count 97 transition count 2184
Deduced a syphon composed of 36 places in 2 ms
Iterating global reduction 0 with 18 rules applied. Total rules applied 73 place count 97 transition count 2184
Ensure Unique test removed 255 transitions
Reduce isomorphic transitions removed 255 transitions.
Iterating post reduction 0 with 255 rules applied. Total rules applied 328 place count 97 transition count 1929
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 45 places in 0 ms
Iterating global reduction 1 with 9 rules applied. Total rules applied 337 place count 97 transition count 1948
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 346 place count 88 transition count 1930
Deduced a syphon composed of 36 places in 1 ms
Iterating global reduction 1 with 9 rules applied. Total rules applied 355 place count 88 transition count 1930
Deduced a syphon composed of 36 places in 1 ms
Drop transitions removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 1 with 22 rules applied. Total rules applied 377 place count 88 transition count 1908
Deduced a syphon composed of 36 places in 0 ms
Applied a total of 377 rules in 2080 ms. Remains 88 /115 variables (removed 27) and now considering 1908/2192 (removed 284) transitions.
[2023-03-21 22:40:26] [INFO ] Redundant transitions in 360 ms returned []
[2023-03-21 22:40:26] [INFO ] Flow matrix only has 1896 transitions (discarded 12 similar events)
// Phase 1: matrix 1896 rows 88 cols
[2023-03-21 22:40:26] [INFO ] Computed 3 place invariants in 9 ms
[2023-03-21 22:40:28] [INFO ] Dead Transitions using invariants and state equation in 1457 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 88/115 places, 1908/2192 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3904 ms. Remains : 88/115 places, 1908/2192 transitions.
Built C files in :
/tmp/ltsmin10502063492155027819
[2023-03-21 22:40:28] [INFO ] Built C files in 144ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10502063492155027819
Running compilation step : cd /tmp/ltsmin10502063492155027819;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10502063492155027819;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10502063492155027819;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 7 out of 115 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 2192/2192 transitions.
Applied a total of 0 rules in 9 ms. Remains 115 /115 variables (removed 0) and now considering 2192/2192 (removed 0) transitions.
[2023-03-21 22:40:31] [INFO ] Flow matrix only has 2180 transitions (discarded 12 similar events)
// Phase 1: matrix 2180 rows 115 cols
[2023-03-21 22:40:31] [INFO ] Computed 3 place invariants in 16 ms
[2023-03-21 22:40:32] [INFO ] Implicit Places using invariants in 737 ms returned []
[2023-03-21 22:40:32] [INFO ] Flow matrix only has 2180 transitions (discarded 12 similar events)
[2023-03-21 22:40:32] [INFO ] Invariant cache hit.
[2023-03-21 22:40:32] [INFO ] State equation strengthened by 2095 read => feed constraints.
[2023-03-21 22:40:33] [INFO ] Implicit Places using invariants and state equation in 1106 ms returned []
Implicit Place search using SMT with State Equation took 1847 ms to find 0 implicit places.
[2023-03-21 22:40:33] [INFO ] Flow matrix only has 2180 transitions (discarded 12 similar events)
[2023-03-21 22:40:33] [INFO ] Invariant cache hit.
[2023-03-21 22:40:34] [INFO ] Dead Transitions using invariants and state equation in 1561 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3419 ms. Remains : 115/115 places, 2192/2192 transitions.
Built C files in :
/tmp/ltsmin15884685923404476790
[2023-03-21 22:40:35] [INFO ] Built C files in 59ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15884685923404476790
Running compilation step : cd /tmp/ltsmin15884685923404476790;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15884685923404476790;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15884685923404476790;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-21 22:40:38] [INFO ] Flatten gal took : 184 ms
[2023-03-21 22:40:38] [INFO ] Flatten gal took : 162 ms
[2023-03-21 22:40:38] [INFO ] Time to serialize gal into /tmp/LTL11236897572504976429.gal : 61 ms
[2023-03-21 22:40:38] [INFO ] Time to serialize properties into /tmp/LTL13370493030522349658.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11236897572504976429.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13600938613484272188.hoa' '-atoms' '/tmp/LTL13370493030522349658.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL13370493030522349658.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13600938613484272188.hoa
Detected timeout of ITS tools.
[2023-03-21 22:40:54] [INFO ] Flatten gal took : 237 ms
[2023-03-21 22:40:54] [INFO ] Flatten gal took : 211 ms
[2023-03-21 22:40:54] [INFO ] Time to serialize gal into /tmp/LTL11704884922984477893.gal : 46 ms
[2023-03-21 22:40:54] [INFO ] Time to serialize properties into /tmp/LTL12274712657638544003.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11704884922984477893.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12274712657638544003.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X((F(("(p141==0)")&&(F(G("((p56==0)&&(p46==1))")))))||(G(("((p42==0)||(p104==1))")U(X("((p106==0)||(p79==1))")))))))
Formula 0 simplified : X(F(!"((p42==0)||(p104==1))" R X!"((p106==0)||(p79==1))") & (GF!"((p56==0)&&(p46==1))" | G!"(p141==0)"))
Detected timeout of ITS tools.
[2023-03-21 22:41:09] [INFO ] Flatten gal took : 158 ms
[2023-03-21 22:41:09] [INFO ] Applying decomposition
[2023-03-21 22:41:09] [INFO ] Flatten gal took : 141 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph5975154889826367688.txt' '-o' '/tmp/graph5975154889826367688.bin' '-w' '/tmp/graph5975154889826367688.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph5975154889826367688.bin' '-l' '-1' '-v' '-w' '/tmp/graph5975154889826367688.weights' '-q' '0' '-e' '0.001'
[2023-03-21 22:41:10] [INFO ] Decomposing Gal with order
[2023-03-21 22:41:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-21 22:41:11] [INFO ] Removed a total of 20566 redundant transitions.
[2023-03-21 22:41:12] [INFO ] Flatten gal took : 848 ms
[2023-03-21 22:41:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 66 labels/synchronizations in 276 ms.
[2023-03-21 22:41:12] [INFO ] Time to serialize gal into /tmp/LTL5021064524256239019.gal : 26 ms
[2023-03-21 22:41:12] [INFO ] Time to serialize properties into /tmp/LTL13052895062630985757.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5021064524256239019.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13052895062630985757.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X((F(("(i2.i0.u0.p141==0)")&&(F(G("((i1.u13.p56==0)&&(i3.u38.p46==1))")))))||(G(("((i1.u10.p42==0)||(i2.i1.u27.p104==1))")U(X("((u2...191
Formula 0 simplified : X(F(!"((i1.u10.p42==0)||(i2.i1.u27.p104==1))" R X!"((u29.p106==0)||(i3.u20.p79==1))") & (GF!"((i1.u13.p56==0)&&(i3.u38.p46==1))" | G...178
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1279259115541774559
[2023-03-21 22:41:27] [INFO ] Built C files in 47ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1279259115541774559
Running compilation step : cd /tmp/ltsmin1279259115541774559;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1279259115541774559;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1279259115541774559;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property StigmergyElection-PT-10a-LTLCardinality-07 finished in 135580 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 126 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 126/126 places, 2212/2212 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 124 transition count 2172
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 1 with 39 rules applied. Total rules applied 79 place count 85 transition count 2172
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 79 place count 85 transition count 2161
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 101 place count 74 transition count 2161
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 114 place count 61 transition count 2142
Iterating global reduction 2 with 13 rules applied. Total rules applied 127 place count 61 transition count 2142
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 2 with 31 rules applied. Total rules applied 158 place count 61 transition count 2111
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 158 place count 61 transition count 2107
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 166 place count 57 transition count 2107
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 170 place count 53 transition count 2099
Iterating global reduction 3 with 4 rules applied. Total rules applied 174 place count 53 transition count 2099
Ensure Unique test removed 480 transitions
Reduce isomorphic transitions removed 480 transitions.
Iterating post reduction 3 with 480 rules applied. Total rules applied 654 place count 53 transition count 1619
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 674 place count 43 transition count 1609
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 684 place count 43 transition count 1599
Drop transitions removed 1498 transitions
Redundant transition composition rules discarded 1498 transitions
Iterating global reduction 5 with 1498 rules applied. Total rules applied 2182 place count 43 transition count 101
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 2202 place count 33 transition count 91
Reduce places removed 10 places and 10 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 2212 place count 23 transition count 81
Applied a total of 2212 rules in 838 ms. Remains 23 /126 variables (removed 103) and now considering 81/2212 (removed 2131) transitions.
[2023-03-21 22:41:31] [INFO ] Flow matrix only has 71 transitions (discarded 10 similar events)
// Phase 1: matrix 71 rows 23 cols
[2023-03-21 22:41:31] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-21 22:41:31] [INFO ] Implicit Places using invariants in 80 ms returned []
[2023-03-21 22:41:31] [INFO ] Flow matrix only has 71 transitions (discarded 10 similar events)
[2023-03-21 22:41:31] [INFO ] Invariant cache hit.
[2023-03-21 22:41:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-21 22:41:31] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 236 ms to find 0 implicit places.
[2023-03-21 22:41:31] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-21 22:41:31] [INFO ] Flow matrix only has 71 transitions (discarded 10 similar events)
[2023-03-21 22:41:31] [INFO ] Invariant cache hit.
[2023-03-21 22:41:31] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 23/126 places, 81/2212 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1150 ms. Remains : 23/126 places, 81/2212 transitions.
Stuttering acceptance computed with spot in 211 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyElection-PT-10a-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s20 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA StigmergyElection-PT-10a-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-10a-LTLCardinality-10 finished in 1377 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((F(p0)&&F(G(p1)))))))'
Support contains 4 out of 126 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 2212/2212 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 119 transition count 2201
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 119 transition count 2201
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 116 transition count 2195
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 116 transition count 2195
Applied a total of 20 rules in 29 ms. Remains 116 /126 variables (removed 10) and now considering 2195/2212 (removed 17) transitions.
[2023-03-21 22:41:31] [INFO ] Flow matrix only has 2183 transitions (discarded 12 similar events)
// Phase 1: matrix 2183 rows 116 cols
[2023-03-21 22:41:32] [INFO ] Computed 2 place invariants in 10 ms
[2023-03-21 22:41:32] [INFO ] Implicit Places using invariants in 753 ms returned []
[2023-03-21 22:41:32] [INFO ] Flow matrix only has 2183 transitions (discarded 12 similar events)
[2023-03-21 22:41:32] [INFO ] Invariant cache hit.
[2023-03-21 22:41:33] [INFO ] State equation strengthened by 2095 read => feed constraints.
[2023-03-21 22:41:33] [INFO ] Implicit Places using invariants and state equation in 1071 ms returned []
Implicit Place search using SMT with State Equation took 1827 ms to find 0 implicit places.
[2023-03-21 22:41:33] [INFO ] Flow matrix only has 2183 transitions (discarded 12 similar events)
[2023-03-21 22:41:33] [INFO ] Invariant cache hit.
[2023-03-21 22:41:35] [INFO ] Dead Transitions using invariants and state equation in 2182 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 116/126 places, 2195/2212 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4039 ms. Remains : 116/126 places, 2195/2212 transitions.
Stuttering acceptance computed with spot in 267 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : StigmergyElection-PT-10a-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 4}, { cond=true, acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}], [{ cond=p1, acceptance={} source=5 dest: 5}, { cond=(NOT p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(OR (EQ s11 0) (EQ s72 1)), p1:(OR (EQ s85 0) (EQ s17 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 34 steps with 0 reset in 4 ms.
FORMULA StigmergyElection-PT-10a-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-10a-LTLCardinality-11 finished in 4334 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 126 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 2212/2212 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 117 transition count 2197
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 117 transition count 2197
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 22 place count 113 transition count 2189
Iterating global reduction 0 with 4 rules applied. Total rules applied 26 place count 113 transition count 2189
Applied a total of 26 rules in 31 ms. Remains 113 /126 variables (removed 13) and now considering 2189/2212 (removed 23) transitions.
[2023-03-21 22:41:36] [INFO ] Flow matrix only has 2178 transitions (discarded 11 similar events)
// Phase 1: matrix 2178 rows 113 cols
[2023-03-21 22:41:36] [INFO ] Computed 2 place invariants in 8 ms
[2023-03-21 22:41:37] [INFO ] Implicit Places using invariants in 943 ms returned []
[2023-03-21 22:41:37] [INFO ] Flow matrix only has 2178 transitions (discarded 11 similar events)
[2023-03-21 22:41:37] [INFO ] Invariant cache hit.
[2023-03-21 22:41:37] [INFO ] State equation strengthened by 2095 read => feed constraints.
[2023-03-21 22:41:39] [INFO ] Implicit Places using invariants and state equation in 2108 ms returned [112]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 3059 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 112/126 places, 2189/2212 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 92 transition count 2169
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 92 transition count 2169
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 50 place count 82 transition count 2159
Iterating global reduction 0 with 10 rules applied. Total rules applied 60 place count 82 transition count 2159
Applied a total of 60 rules in 26 ms. Remains 82 /112 variables (removed 30) and now considering 2159/2189 (removed 30) transitions.
[2023-03-21 22:41:39] [INFO ] Flow matrix only has 2148 transitions (discarded 11 similar events)
// Phase 1: matrix 2148 rows 82 cols
[2023-03-21 22:41:39] [INFO ] Computed 1 place invariants in 7 ms
[2023-03-21 22:41:40] [INFO ] Implicit Places using invariants in 593 ms returned []
[2023-03-21 22:41:40] [INFO ] Flow matrix only has 2148 transitions (discarded 11 similar events)
[2023-03-21 22:41:40] [INFO ] Invariant cache hit.
[2023-03-21 22:41:40] [INFO ] State equation strengthened by 2055 read => feed constraints.
[2023-03-21 22:41:41] [INFO ] Implicit Places using invariants and state equation in 1166 ms returned []
Implicit Place search using SMT with State Equation took 1761 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 82/126 places, 2159/2212 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 4878 ms. Remains : 82/126 places, 2159/2212 transitions.
Stuttering acceptance computed with spot in 91 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyElection-PT-10a-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s32 0) (EQ s16 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 5006 steps with 0 reset in 812 ms.
FORMULA StigmergyElection-PT-10a-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-10a-LTLCardinality-12 finished in 5802 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(p0)))'
Support contains 1 out of 126 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 2212/2212 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 117 transition count 2197
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 117 transition count 2197
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 22 place count 113 transition count 2189
Iterating global reduction 0 with 4 rules applied. Total rules applied 26 place count 113 transition count 2189
Applied a total of 26 rules in 23 ms. Remains 113 /126 variables (removed 13) and now considering 2189/2212 (removed 23) transitions.
[2023-03-21 22:41:42] [INFO ] Flow matrix only has 2178 transitions (discarded 11 similar events)
// Phase 1: matrix 2178 rows 113 cols
[2023-03-21 22:41:42] [INFO ] Computed 2 place invariants in 8 ms
[2023-03-21 22:41:42] [INFO ] Implicit Places using invariants in 680 ms returned []
[2023-03-21 22:41:42] [INFO ] Flow matrix only has 2178 transitions (discarded 11 similar events)
[2023-03-21 22:41:42] [INFO ] Invariant cache hit.
[2023-03-21 22:41:43] [INFO ] State equation strengthened by 2095 read => feed constraints.
[2023-03-21 22:41:45] [INFO ] Implicit Places using invariants and state equation in 2523 ms returned [112]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 3209 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 112/126 places, 2189/2212 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 93 transition count 2170
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 93 transition count 2170
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 48 place count 83 transition count 2160
Iterating global reduction 0 with 10 rules applied. Total rules applied 58 place count 83 transition count 2160
Applied a total of 58 rules in 39 ms. Remains 83 /112 variables (removed 29) and now considering 2160/2189 (removed 29) transitions.
[2023-03-21 22:41:45] [INFO ] Flow matrix only has 2149 transitions (discarded 11 similar events)
// Phase 1: matrix 2149 rows 83 cols
[2023-03-21 22:41:45] [INFO ] Computed 1 place invariants in 8 ms
[2023-03-21 22:41:45] [INFO ] Implicit Places using invariants in 552 ms returned []
[2023-03-21 22:41:45] [INFO ] Flow matrix only has 2149 transitions (discarded 11 similar events)
[2023-03-21 22:41:45] [INFO ] Invariant cache hit.
[2023-03-21 22:41:46] [INFO ] State equation strengthened by 2055 read => feed constraints.
[2023-03-21 22:41:47] [INFO ] Implicit Places using invariants and state equation in 1885 ms returned []
Implicit Place search using SMT with State Equation took 2439 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 83/126 places, 2160/2212 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 5711 ms. Remains : 83/126 places, 2160/2212 transitions.
Stuttering acceptance computed with spot in 125 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : StigmergyElection-PT-10a-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=3, aps=[p0:(EQ s62 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA StigmergyElection-PT-10a-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-10a-LTLCardinality-13 finished in 5854 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 2 out of 126 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 2212/2212 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 118 transition count 2199
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 118 transition count 2199
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 19 place count 115 transition count 2193
Iterating global reduction 0 with 3 rules applied. Total rules applied 22 place count 115 transition count 2193
Applied a total of 22 rules in 25 ms. Remains 115 /126 variables (removed 11) and now considering 2193/2212 (removed 19) transitions.
[2023-03-21 22:41:47] [INFO ] Flow matrix only has 2181 transitions (discarded 12 similar events)
// Phase 1: matrix 2181 rows 115 cols
[2023-03-21 22:41:47] [INFO ] Computed 2 place invariants in 8 ms
[2023-03-21 22:41:48] [INFO ] Implicit Places using invariants in 614 ms returned []
[2023-03-21 22:41:48] [INFO ] Flow matrix only has 2181 transitions (discarded 12 similar events)
[2023-03-21 22:41:48] [INFO ] Invariant cache hit.
[2023-03-21 22:41:49] [INFO ] State equation strengthened by 2095 read => feed constraints.
[2023-03-21 22:41:50] [INFO ] Implicit Places using invariants and state equation in 2081 ms returned [114]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 2700 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 114/126 places, 2193/2212 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 96 transition count 2175
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 96 transition count 2175
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 45 place count 87 transition count 2166
Iterating global reduction 0 with 9 rules applied. Total rules applied 54 place count 87 transition count 2166
Applied a total of 54 rules in 23 ms. Remains 87 /114 variables (removed 27) and now considering 2166/2193 (removed 27) transitions.
[2023-03-21 22:41:50] [INFO ] Flow matrix only has 2154 transitions (discarded 12 similar events)
// Phase 1: matrix 2154 rows 87 cols
[2023-03-21 22:41:50] [INFO ] Computed 1 place invariants in 6 ms
[2023-03-21 22:41:51] [INFO ] Implicit Places using invariants in 560 ms returned []
[2023-03-21 22:41:51] [INFO ] Flow matrix only has 2154 transitions (discarded 12 similar events)
[2023-03-21 22:41:51] [INFO ] Invariant cache hit.
[2023-03-21 22:41:51] [INFO ] State equation strengthened by 2055 read => feed constraints.
[2023-03-21 22:41:52] [INFO ] Implicit Places using invariants and state equation in 1493 ms returned []
Implicit Place search using SMT with State Equation took 2060 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 87/126 places, 2166/2212 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 4809 ms. Remains : 87/126 places, 2166/2212 transitions.
Stuttering acceptance computed with spot in 137 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyElection-PT-10a-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(AND (EQ s25 0) (EQ s22 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]]
Stuttering criterion allowed to conclude after 21 steps with 0 reset in 1 ms.
FORMULA StigmergyElection-PT-10a-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-10a-LTLCardinality-14 finished in 4969 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(p0)))'
Support contains 2 out of 126 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 2212/2212 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 117 transition count 2197
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 117 transition count 2197
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 22 place count 113 transition count 2189
Iterating global reduction 0 with 4 rules applied. Total rules applied 26 place count 113 transition count 2189
Applied a total of 26 rules in 23 ms. Remains 113 /126 variables (removed 13) and now considering 2189/2212 (removed 23) transitions.
[2023-03-21 22:41:52] [INFO ] Flow matrix only has 2178 transitions (discarded 11 similar events)
// Phase 1: matrix 2178 rows 113 cols
[2023-03-21 22:41:52] [INFO ] Computed 2 place invariants in 7 ms
[2023-03-21 22:41:53] [INFO ] Implicit Places using invariants in 622 ms returned []
[2023-03-21 22:41:53] [INFO ] Flow matrix only has 2178 transitions (discarded 11 similar events)
[2023-03-21 22:41:53] [INFO ] Invariant cache hit.
[2023-03-21 22:41:54] [INFO ] State equation strengthened by 2095 read => feed constraints.
[2023-03-21 22:41:55] [INFO ] Implicit Places using invariants and state equation in 2051 ms returned [112]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 2682 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 112/126 places, 2189/2212 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 93 transition count 2170
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 93 transition count 2170
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 47 place count 84 transition count 2161
Iterating global reduction 0 with 9 rules applied. Total rules applied 56 place count 84 transition count 2161
Applied a total of 56 rules in 24 ms. Remains 84 /112 variables (removed 28) and now considering 2161/2189 (removed 28) transitions.
[2023-03-21 22:41:55] [INFO ] Flow matrix only has 2150 transitions (discarded 11 similar events)
// Phase 1: matrix 2150 rows 84 cols
[2023-03-21 22:41:55] [INFO ] Computed 1 place invariants in 8 ms
[2023-03-21 22:41:56] [INFO ] Implicit Places using invariants in 550 ms returned []
[2023-03-21 22:41:56] [INFO ] Flow matrix only has 2150 transitions (discarded 11 similar events)
[2023-03-21 22:41:56] [INFO ] Invariant cache hit.
[2023-03-21 22:41:56] [INFO ] State equation strengthened by 2055 read => feed constraints.
[2023-03-21 22:41:57] [INFO ] Implicit Places using invariants and state equation in 1496 ms returned []
Implicit Place search using SMT with State Equation took 2048 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 84/126 places, 2161/2212 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 4778 ms. Remains : 84/126 places, 2161/2212 transitions.
Stuttering acceptance computed with spot in 117 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : StigmergyElection-PT-10a-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=3, aps=[p0:(OR (EQ s77 0) (EQ s39 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 224 ms.
Product exploration explored 100000 steps with 33333 reset in 234 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 (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 2 factoid took 48 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA StigmergyElection-PT-10a-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyElection-PT-10a-LTLCardinality-15 finished in 5439 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F((p0&&F(G(p1))))||G((p2 U X(p3))))))'
[2023-03-21 22:41:58] [INFO ] Flatten gal took : 148 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin15626645980255475215
[2023-03-21 22:41:58] [INFO ] Too many transitions (2212) to apply POR reductions. Disabling POR matrices.
[2023-03-21 22:41:58] [INFO ] Built C files in 82ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15626645980255475215
Running compilation step : cd /tmp/ltsmin15626645980255475215;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2023-03-21 22:41:58] [INFO ] Applying decomposition
[2023-03-21 22:41:59] [INFO ] Flatten gal took : 161 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph17633519929102078551.txt' '-o' '/tmp/graph17633519929102078551.bin' '-w' '/tmp/graph17633519929102078551.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph17633519929102078551.bin' '-l' '-1' '-v' '-w' '/tmp/graph17633519929102078551.weights' '-q' '0' '-e' '0.001'
[2023-03-21 22:41:59] [INFO ] Decomposing Gal with order
[2023-03-21 22:41:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-21 22:42:00] [INFO ] Removed a total of 20568 redundant transitions.
[2023-03-21 22:42:00] [INFO ] Flatten gal took : 503 ms
[2023-03-21 22:42:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 76 labels/synchronizations in 303 ms.
[2023-03-21 22:42:00] [INFO ] Time to serialize gal into /tmp/LTLCardinality14931706557112983213.gal : 25 ms
[2023-03-21 22:42:00] [INFO ] Time to serialize properties into /tmp/LTLCardinality16864199637563891199.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality14931706557112983213.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality16864199637563891199.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 1 LTL properties
Checking formula 0 : !((X((F(("(i5.i0.u0.p141==0)")&&(F(G("((i0.u17.p56==0)&&(i2.u37.p46==1))")))))||(G(("((i0.u13.p42==0)||(i5.i1.u30.p104==1))")U(X("((i5...197
Formula 0 simplified : X(F(!"((i0.u13.p42==0)||(i5.i1.u30.p104==1))" R X!"((i5.i1.u32.p106==0)||(i2.u26.p79==1))") & (GF!"((i0.u17.p56==0)&&(i2.u37.p46==1)...184
Compilation finished in 12557 ms.
Running link step : cd /tmp/ltsmin15626645980255475215;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 183 ms.
Running LTSmin : cd /tmp/ltsmin15626645980255475215;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((<>(((LTLAPp0==true)&&<>([]((LTLAPp1==true)))))||[](((LTLAPp2==true) U X((LTLAPp3==true))))))' '--buchi-type=spotba'
LTSmin run took 886099 ms.
FORMULA StigmergyElection-PT-10a-LTLCardinality-07 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 1134363 ms.

BK_STOP 1679439419277

--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is StigmergyElection-PT-10a, 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 r453-smll-167912645800683"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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