Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.8M
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 07:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 07:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 07:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 11 17:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 107K Apr 11 17:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Apr 11 17:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 11 17:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:59 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 5.4M May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716989622268

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyCommit-PT-07a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-29 13:33:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-29 13:33:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 13:33:43] [INFO ] Load time of PNML (sax parser for PT used): 426 ms
[2024-05-29 13:33:43] [INFO ] Transformed 292 places.
[2024-05-29 13:33:43] [INFO ] Transformed 7108 transitions.
[2024-05-29 13:33:43] [INFO ] Found NUPN structural information;
[2024-05-29 13:33:43] [INFO ] Parsed PT model containing 292 places and 7108 transitions and 108222 arcs in 596 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 6218 transitions
Reduce redundant transitions removed 6218 transitions.
FORMULA StigmergyCommit-PT-07a-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-07a-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 9 out of 292 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 292/292 places, 890/890 transitions.
Discarding 63 places :
Symmetric choice reduction at 0 with 63 rule applications. Total rules 63 place count 229 transition count 819
Iterating global reduction 0 with 63 rules applied. Total rules applied 126 place count 229 transition count 819
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 134 place count 229 transition count 811
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 167 place count 196 transition count 770
Iterating global reduction 1 with 33 rules applied. Total rules applied 200 place count 196 transition count 770
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 208 place count 196 transition count 762
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 216 place count 188 transition count 754
Iterating global reduction 2 with 8 rules applied. Total rules applied 224 place count 188 transition count 754
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 232 place count 180 transition count 746
Iterating global reduction 2 with 8 rules applied. Total rules applied 240 place count 180 transition count 746
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 248 place count 172 transition count 738
Iterating global reduction 2 with 8 rules applied. Total rules applied 256 place count 172 transition count 738
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 264 place count 164 transition count 730
Iterating global reduction 2 with 8 rules applied. Total rules applied 272 place count 164 transition count 730
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 280 place count 164 transition count 722
Applied a total of 280 rules in 91 ms. Remains 164 /292 variables (removed 128) and now considering 722/890 (removed 168) transitions.
[2024-05-29 13:33:44] [INFO ] Flow matrix only has 712 transitions (discarded 10 similar events)
// Phase 1: matrix 712 rows 164 cols
[2024-05-29 13:33:44] [INFO ] Computed 3 invariants in 24 ms
[2024-05-29 13:33:44] [INFO ] Implicit Places using invariants in 228 ms returned []
[2024-05-29 13:33:44] [INFO ] Flow matrix only has 712 transitions (discarded 10 similar events)
[2024-05-29 13:33:44] [INFO ] Invariant cache hit.
[2024-05-29 13:33:44] [INFO ] State equation strengthened by 581 read => feed constraints.
[2024-05-29 13:33:45] [INFO ] Implicit Places using invariants and state equation in 1161 ms returned [163]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1421 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 163/292 places, 722/890 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 140 transition count 699
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 140 transition count 699
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 54 place count 140 transition count 691
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 62 place count 132 transition count 683
Iterating global reduction 1 with 8 rules applied. Total rules applied 70 place count 132 transition count 683
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 78 place count 124 transition count 675
Iterating global reduction 1 with 8 rules applied. Total rules applied 86 place count 124 transition count 675
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 94 place count 116 transition count 667
Iterating global reduction 1 with 8 rules applied. Total rules applied 102 place count 116 transition count 667
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 110 place count 108 transition count 659
Iterating global reduction 1 with 8 rules applied. Total rules applied 118 place count 108 transition count 659
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 125 place count 101 transition count 652
Iterating global reduction 1 with 7 rules applied. Total rules applied 132 place count 101 transition count 652
Applied a total of 132 rules in 25 ms. Remains 101 /163 variables (removed 62) and now considering 652/722 (removed 70) transitions.
[2024-05-29 13:33:45] [INFO ] Flow matrix only has 642 transitions (discarded 10 similar events)
// Phase 1: matrix 642 rows 101 cols
[2024-05-29 13:33:45] [INFO ] Computed 2 invariants in 6 ms
[2024-05-29 13:33:45] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-29 13:33:45] [INFO ] Flow matrix only has 642 transitions (discarded 10 similar events)
[2024-05-29 13:33:45] [INFO ] Invariant cache hit.
[2024-05-29 13:33:45] [INFO ] State equation strengthened by 517 read => feed constraints.
[2024-05-29 13:33:45] [INFO ] Implicit Places using invariants and state equation in 183 ms returned []
Implicit Place search using SMT with State Equation took 217 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 101/292 places, 652/890 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1770 ms. Remains : 101/292 places, 652/890 transitions.
Support contains 9 out of 101 places after structural reductions.
[2024-05-29 13:33:46] [INFO ] Flatten gal took : 117 ms
[2024-05-29 13:33:46] [INFO ] Flatten gal took : 79 ms
[2024-05-29 13:33:46] [INFO ] Input system was already deterministic with 652 transitions.
Reduction of identical properties reduced properties to check from 5 to 3
RANDOM walk for 204 steps (0 resets) in 23 ms. (8 steps per ms) remains 0/3 properties
FORMULA StigmergyCommit-PT-07a-LTLFireability-13 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 3 stabilizing places and 3 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(F(p1))&&p0))))'
Support contains 8 out of 101 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 652/652 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 100 transition count 651
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 100 transition count 651
Applied a total of 2 rules in 6 ms. Remains 100 /101 variables (removed 1) and now considering 651/652 (removed 1) transitions.
[2024-05-29 13:33:46] [INFO ] Flow matrix only has 642 transitions (discarded 9 similar events)
// Phase 1: matrix 642 rows 100 cols
[2024-05-29 13:33:46] [INFO ] Computed 1 invariants in 5 ms
[2024-05-29 13:33:46] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-29 13:33:46] [INFO ] Flow matrix only has 642 transitions (discarded 9 similar events)
[2024-05-29 13:33:46] [INFO ] Invariant cache hit.
[2024-05-29 13:33:46] [INFO ] State equation strengthened by 517 read => feed constraints.
[2024-05-29 13:33:47] [INFO ] Implicit Places using invariants and state equation in 176 ms returned []
Implicit Place search using SMT with State Equation took 213 ms to find 0 implicit places.
Running 650 sub problems to find dead transitions.
[2024-05-29 13:33:47] [INFO ] Flow matrix only has 642 transitions (discarded 9 similar events)
[2024-05-29 13:33:47] [INFO ] Invariant cache hit.
[2024-05-29 13:33:47] [INFO ] State equation strengthened by 517 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 1 (OVERLAPS) 1/100 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-29 13:33:56] [INFO ] Deduced a trap composed of 17 places in 170 ms of which 10 ms to minimize.
[2024-05-29 13:33:56] [INFO ] Deduced a trap composed of 18 places in 160 ms of which 2 ms to minimize.
[2024-05-29 13:33:56] [INFO ] Deduced a trap composed of 13 places in 147 ms of which 1 ms to minimize.
[2024-05-29 13:33:56] [INFO ] Deduced a trap composed of 14 places in 141 ms of which 1 ms to minimize.
[2024-05-29 13:33:56] [INFO ] Deduced a trap composed of 14 places in 152 ms of which 1 ms to minimize.
[2024-05-29 13:33:57] [INFO ] Deduced a trap composed of 13 places in 115 ms of which 1 ms to minimize.
[2024-05-29 13:33:57] [INFO ] Deduced a trap composed of 13 places in 114 ms of which 1 ms to minimize.
[2024-05-29 13:33:57] [INFO ] Deduced a trap composed of 13 places in 119 ms of which 1 ms to minimize.
[2024-05-29 13:33:57] [INFO ] Deduced a trap composed of 15 places in 115 ms of which 1 ms to minimize.
[2024-05-29 13:33:57] [INFO ] Deduced a trap composed of 13 places in 115 ms of which 1 ms to minimize.
[2024-05-29 13:33:57] [INFO ] Deduced a trap composed of 13 places in 99 ms of which 0 ms to minimize.
[2024-05-29 13:33:57] [INFO ] Deduced a trap composed of 13 places in 238 ms of which 1 ms to minimize.
[2024-05-29 13:33:57] [INFO ] Deduced a trap composed of 14 places in 94 ms of which 1 ms to minimize.
[2024-05-29 13:33:58] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 1 ms to minimize.
[2024-05-29 13:33:58] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 0 ms to minimize.
[2024-05-29 13:33:58] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 1 ms to minimize.
[2024-05-29 13:33:58] [INFO ] Deduced a trap composed of 13 places in 111 ms of which 0 ms to minimize.
[2024-05-29 13:33:58] [INFO ] Deduced a trap composed of 15 places in 110 ms of which 1 ms to minimize.
[2024-05-29 13:33:58] [INFO ] Deduced a trap composed of 13 places in 120 ms of which 3 ms to minimize.
[2024-05-29 13:33:58] [INFO ] Deduced a trap composed of 14 places in 100 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-29 13:33:58] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 0 ms to minimize.
[2024-05-29 13:33:59] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 1 ms to minimize.
[2024-05-29 13:33:59] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 1 ms to minimize.
[2024-05-29 13:33:59] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 1 ms to minimize.
[2024-05-29 13:33:59] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 1 ms to minimize.
[2024-05-29 13:33:59] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-05-29 13:33:59] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 1 ms to minimize.
[2024-05-29 13:33:59] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 0 ms to minimize.
[2024-05-29 13:33:59] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 0 ms to minimize.
[2024-05-29 13:33:59] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 1 ms to minimize.
[2024-05-29 13:33:59] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-05-29 13:33:59] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2024-05-29 13:33:59] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 1 ms to minimize.
[2024-05-29 13:33:59] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 1 ms to minimize.
[2024-05-29 13:33:59] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 2 ms to minimize.
[2024-05-29 13:34:00] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 1 ms to minimize.
[2024-05-29 13:34:00] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 0 ms to minimize.
[2024-05-29 13:34:00] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 0 ms to minimize.
[2024-05-29 13:34:00] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 0 ms to minimize.
[2024-05-29 13:34:00] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-29 13:34:01] [INFO ] Deduced a trap composed of 13 places in 84 ms of which 0 ms to minimize.
[2024-05-29 13:34:01] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 0 ms to minimize.
[2024-05-29 13:34:01] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 1 ms to minimize.
[2024-05-29 13:34:01] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 1 ms to minimize.
[2024-05-29 13:34:01] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 1 ms to minimize.
[2024-05-29 13:34:02] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 0 ms to minimize.
[2024-05-29 13:34:02] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 1 ms to minimize.
[2024-05-29 13:34:02] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 0 ms to minimize.
[2024-05-29 13:34:02] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 0 ms to minimize.
[2024-05-29 13:34:02] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 1 ms to minimize.
[2024-05-29 13:34:02] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 1 ms to minimize.
[2024-05-29 13:34:02] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 0 ms to minimize.
[2024-05-29 13:34:02] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 1 ms to minimize.
[2024-05-29 13:34:02] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 1 ms to minimize.
[2024-05-29 13:34:02] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 1 ms to minimize.
[2024-05-29 13:34:02] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 0 ms to minimize.
[2024-05-29 13:34:03] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 4 ms to minimize.
[2024-05-29 13:34:03] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 0 ms to minimize.
[2024-05-29 13:34:04] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 0 ms to minimize.
[2024-05-29 13:34:04] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-29 13:34:04] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 0 ms to minimize.
[2024-05-29 13:34:04] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 0 ms to minimize.
[2024-05-29 13:34:04] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 0 ms to minimize.
[2024-05-29 13:34:04] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
[2024-05-29 13:34:04] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 0 ms to minimize.
[2024-05-29 13:34:05] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 0 ms to minimize.
[2024-05-29 13:34:05] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 0 ms to minimize.
[2024-05-29 13:34:05] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 1 ms to minimize.
[2024-05-29 13:34:05] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 1 ms to minimize.
[2024-05-29 13:34:05] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 0 ms to minimize.
[2024-05-29 13:34:05] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 0 ms to minimize.
[2024-05-29 13:34:05] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 1 ms to minimize.
[2024-05-29 13:34:05] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 1 ms to minimize.
[2024-05-29 13:34:05] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2024-05-29 13:34:05] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 1 ms to minimize.
[2024-05-29 13:34:05] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 0 ms to minimize.
[2024-05-29 13:34:06] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 0 ms to minimize.
[2024-05-29 13:34:06] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2024-05-29 13:34:06] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 0 ms to minimize.
[2024-05-29 13:34:06] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-29 13:34:06] [INFO ] Deduced a trap composed of 13 places in 126 ms of which 1 ms to minimize.
[2024-05-29 13:34:06] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 0 ms to minimize.
[2024-05-29 13:34:06] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2024-05-29 13:34:07] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 0 ms to minimize.
[2024-05-29 13:34:07] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 2 ms to minimize.
[2024-05-29 13:34:07] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 1 ms to minimize.
[2024-05-29 13:34:07] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
[2024-05-29 13:34:07] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 0 ms to minimize.
[2024-05-29 13:34:08] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 1 ms to minimize.
[2024-05-29 13:34:08] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 0 ms to minimize.
[2024-05-29 13:34:09] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 1 ms to minimize.
[2024-05-29 13:34:09] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 12/93 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/100 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 8 (OVERLAPS) 641/741 variables, 100/193 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/741 variables, 516/709 constraints. Problems are: Problem set: 0 solved, 650 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 741/742 variables, and 709 constraints, problems are : Problem set: 0 solved, 650 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 100/100 constraints, ReadFeed: 516/517 constraints, PredecessorRefiner: 650/650 constraints, Known Traps: 92/92 constraints]
Escalating to Integer solving :Problem set: 0 solved, 650 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 1 (OVERLAPS) 1/100 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 92/93 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-29 13:34:28] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 5 (OVERLAPS) 641/741 variables, 100/194 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/741 variables, 516/710 constraints. Problems are: Problem set: 0 solved, 650 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 741/742 variables, and 1360 constraints, problems are : Problem set: 0 solved, 650 unsolved in 30875 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 100/100 constraints, ReadFeed: 516/517 constraints, PredecessorRefiner: 650/650 constraints, Known Traps: 93/93 constraints]
After SMT, in 67294ms problems are : Problem set: 0 solved, 650 unsolved
Search for dead transitions found 0 dead transitions in 67315ms
Starting structural reductions in LTL mode, iteration 1 : 100/101 places, 651/652 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 67542 ms. Remains : 100/101 places, 651/652 transitions.
Stuttering acceptance computed with spot in 309 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-07a-LTLFireability-00
Product exploration explored 100000 steps with 1923 reset in 473 ms.
Product exploration explored 100000 steps with 1923 reset in 347 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 88 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 193 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0)]
Reduction of identical properties reduced properties to check from 2 to 1
RANDOM walk for 204 steps (0 resets) in 9 ms. (20 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p1), (F p0)]
Knowledge based reduction with 5 factoid took 132 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 211 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 183 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0)]
[2024-05-29 13:34:56] [INFO ] Flow matrix only has 642 transitions (discarded 9 similar events)
[2024-05-29 13:34:56] [INFO ] Invariant cache hit.
[2024-05-29 13:34:56] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-29 13:34:56] [INFO ] [Real]Absence check using state equation in 102 ms returned sat
[2024-05-29 13:34:56] [INFO ] State equation strengthened by 517 read => feed constraints.
[2024-05-29 13:34:56] [INFO ] [Real]Added 517 Read/Feed constraints in 47 ms returned sat
[2024-05-29 13:34:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 13:34:56] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-29 13:34:57] [INFO ] [Nat]Absence check using state equation in 100 ms returned sat
[2024-05-29 13:34:57] [INFO ] [Nat]Added 517 Read/Feed constraints in 49 ms returned sat
[2024-05-29 13:34:57] [INFO ] Computed and/alt/rep : 106/130/106 causal constraints (skipped 535 transitions) in 83 ms.
[2024-05-29 13:34:57] [INFO ] Added : 82 causal constraints over 17 iterations in 777 ms. Result :sat
Could not prove EG (NOT p1)
[2024-05-29 13:34:57] [INFO ] Flow matrix only has 642 transitions (discarded 9 similar events)
[2024-05-29 13:34:57] [INFO ] Invariant cache hit.
[2024-05-29 13:34:58] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-29 13:34:58] [INFO ] [Real]Absence check using state equation in 100 ms returned sat
[2024-05-29 13:34:58] [INFO ] State equation strengthened by 517 read => feed constraints.
[2024-05-29 13:34:58] [INFO ] [Real]Added 517 Read/Feed constraints in 47 ms returned sat
[2024-05-29 13:34:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 13:34:58] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-29 13:34:58] [INFO ] [Nat]Absence check using state equation in 100 ms returned sat
[2024-05-29 13:34:58] [INFO ] [Nat]Added 517 Read/Feed constraints in 53 ms returned sat
[2024-05-29 13:34:58] [INFO ] Computed and/alt/rep : 106/130/106 causal constraints (skipped 535 transitions) in 51 ms.
[2024-05-29 13:34:59] [INFO ] Added : 82 causal constraints over 17 iterations in 729 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 8 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 651/651 transitions.
Applied a total of 0 rules in 2 ms. Remains 100 /100 variables (removed 0) and now considering 651/651 (removed 0) transitions.
[2024-05-29 13:34:59] [INFO ] Flow matrix only has 642 transitions (discarded 9 similar events)
[2024-05-29 13:34:59] [INFO ] Invariant cache hit.
[2024-05-29 13:34:59] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-29 13:34:59] [INFO ] Flow matrix only has 642 transitions (discarded 9 similar events)
[2024-05-29 13:34:59] [INFO ] Invariant cache hit.
[2024-05-29 13:34:59] [INFO ] State equation strengthened by 517 read => feed constraints.
[2024-05-29 13:34:59] [INFO ] Implicit Places using invariants and state equation in 172 ms returned []
Implicit Place search using SMT with State Equation took 202 ms to find 0 implicit places.
Running 650 sub problems to find dead transitions.
[2024-05-29 13:34:59] [INFO ] Flow matrix only has 642 transitions (discarded 9 similar events)
[2024-05-29 13:34:59] [INFO ] Invariant cache hit.
[2024-05-29 13:34:59] [INFO ] State equation strengthened by 517 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 1 (OVERLAPS) 1/100 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-29 13:35:07] [INFO ] Deduced a trap composed of 17 places in 140 ms of which 1 ms to minimize.
[2024-05-29 13:35:08] [INFO ] Deduced a trap composed of 18 places in 128 ms of which 1 ms to minimize.
[2024-05-29 13:35:08] [INFO ] Deduced a trap composed of 13 places in 137 ms of which 0 ms to minimize.
[2024-05-29 13:35:08] [INFO ] Deduced a trap composed of 14 places in 138 ms of which 1 ms to minimize.
[2024-05-29 13:35:08] [INFO ] Deduced a trap composed of 14 places in 137 ms of which 1 ms to minimize.
[2024-05-29 13:35:08] [INFO ] Deduced a trap composed of 13 places in 121 ms of which 1 ms to minimize.
[2024-05-29 13:35:08] [INFO ] Deduced a trap composed of 13 places in 111 ms of which 0 ms to minimize.
[2024-05-29 13:35:08] [INFO ] Deduced a trap composed of 13 places in 119 ms of which 0 ms to minimize.
[2024-05-29 13:35:08] [INFO ] Deduced a trap composed of 15 places in 113 ms of which 1 ms to minimize.
[2024-05-29 13:35:09] [INFO ] Deduced a trap composed of 13 places in 111 ms of which 1 ms to minimize.
[2024-05-29 13:35:09] [INFO ] Deduced a trap composed of 13 places in 93 ms of which 1 ms to minimize.
[2024-05-29 13:35:09] [INFO ] Deduced a trap composed of 13 places in 99 ms of which 1 ms to minimize.
[2024-05-29 13:35:09] [INFO ] Deduced a trap composed of 14 places in 99 ms of which 1 ms to minimize.
[2024-05-29 13:35:09] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 0 ms to minimize.
[2024-05-29 13:35:09] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 1 ms to minimize.
[2024-05-29 13:35:09] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 1 ms to minimize.
[2024-05-29 13:35:09] [INFO ] Deduced a trap composed of 13 places in 114 ms of which 0 ms to minimize.
[2024-05-29 13:35:09] [INFO ] Deduced a trap composed of 15 places in 117 ms of which 0 ms to minimize.
[2024-05-29 13:35:10] [INFO ] Deduced a trap composed of 13 places in 118 ms of which 1 ms to minimize.
[2024-05-29 13:35:10] [INFO ] Deduced a trap composed of 14 places in 99 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-29 13:35:10] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 1 ms to minimize.
[2024-05-29 13:35:10] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 1 ms to minimize.
[2024-05-29 13:35:10] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 1 ms to minimize.
[2024-05-29 13:35:10] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 0 ms to minimize.
[2024-05-29 13:35:10] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 1 ms to minimize.
[2024-05-29 13:35:10] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 0 ms to minimize.
[2024-05-29 13:35:10] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 1 ms to minimize.
[2024-05-29 13:35:10] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 1 ms to minimize.
[2024-05-29 13:35:10] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 1 ms to minimize.
[2024-05-29 13:35:10] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 1 ms to minimize.
[2024-05-29 13:35:11] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 0 ms to minimize.
[2024-05-29 13:35:11] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 0 ms to minimize.
[2024-05-29 13:35:11] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 0 ms to minimize.
[2024-05-29 13:35:11] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 0 ms to minimize.
[2024-05-29 13:35:11] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 0 ms to minimize.
[2024-05-29 13:35:11] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 0 ms to minimize.
[2024-05-29 13:35:11] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 0 ms to minimize.
[2024-05-29 13:35:11] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 0 ms to minimize.
[2024-05-29 13:35:11] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 0 ms to minimize.
[2024-05-29 13:35:11] [INFO ] Deduced a trap composed of 13 places in 82 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-29 13:35:13] [INFO ] Deduced a trap composed of 13 places in 89 ms of which 1 ms to minimize.
[2024-05-29 13:35:13] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 1 ms to minimize.
[2024-05-29 13:35:13] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 0 ms to minimize.
[2024-05-29 13:35:13] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 1 ms to minimize.
[2024-05-29 13:35:13] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 1 ms to minimize.
[2024-05-29 13:35:13] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 0 ms to minimize.
[2024-05-29 13:35:13] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 1 ms to minimize.
[2024-05-29 13:35:13] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 0 ms to minimize.
[2024-05-29 13:35:13] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 0 ms to minimize.
[2024-05-29 13:35:13] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 4 ms to minimize.
[2024-05-29 13:35:13] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 0 ms to minimize.
[2024-05-29 13:35:14] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 0 ms to minimize.
[2024-05-29 13:35:14] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 1 ms to minimize.
[2024-05-29 13:35:14] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 0 ms to minimize.
[2024-05-29 13:35:14] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 0 ms to minimize.
[2024-05-29 13:35:14] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 0 ms to minimize.
[2024-05-29 13:35:14] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 1 ms to minimize.
[2024-05-29 13:35:14] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 1 ms to minimize.
[2024-05-29 13:35:16] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 0 ms to minimize.
[2024-05-29 13:35:16] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-29 13:35:16] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 0 ms to minimize.
[2024-05-29 13:35:16] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 1 ms to minimize.
[2024-05-29 13:35:16] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 0 ms to minimize.
[2024-05-29 13:35:16] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 0 ms to minimize.
[2024-05-29 13:35:16] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 0 ms to minimize.
[2024-05-29 13:35:16] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
[2024-05-29 13:35:16] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2024-05-29 13:35:16] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 1 ms to minimize.
[2024-05-29 13:35:16] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 0 ms to minimize.
[2024-05-29 13:35:17] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 0 ms to minimize.
[2024-05-29 13:35:17] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 0 ms to minimize.
[2024-05-29 13:35:17] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 0 ms to minimize.
[2024-05-29 13:35:17] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 0 ms to minimize.
[2024-05-29 13:35:17] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
[2024-05-29 13:35:17] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 0 ms to minimize.
[2024-05-29 13:35:17] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 0 ms to minimize.
[2024-05-29 13:35:17] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 0 ms to minimize.
[2024-05-29 13:35:17] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 0 ms to minimize.
[2024-05-29 13:35:17] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 1 ms to minimize.
[2024-05-29 13:35:17] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-29 13:35:18] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 1 ms to minimize.
[2024-05-29 13:35:18] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 0 ms to minimize.
[2024-05-29 13:35:18] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
[2024-05-29 13:35:18] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 0 ms to minimize.
[2024-05-29 13:35:18] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 0 ms to minimize.
[2024-05-29 13:35:18] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 1 ms to minimize.
[2024-05-29 13:35:18] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 0 ms to minimize.
[2024-05-29 13:35:18] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
[2024-05-29 13:35:20] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 1 ms to minimize.
[2024-05-29 13:35:20] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 0 ms to minimize.
[2024-05-29 13:35:20] [INFO ] Deduced a trap composed of 13 places in 145 ms of which 1 ms to minimize.
[2024-05-29 13:35:20] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 12/93 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/100 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 8 (OVERLAPS) 641/741 variables, 100/193 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/741 variables, 516/709 constraints. Problems are: Problem set: 0 solved, 650 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 741/742 variables, and 709 constraints, problems are : Problem set: 0 solved, 650 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 100/100 constraints, ReadFeed: 516/517 constraints, PredecessorRefiner: 650/650 constraints, Known Traps: 92/92 constraints]
Escalating to Integer solving :Problem set: 0 solved, 650 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 1 (OVERLAPS) 1/100 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 92/93 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-29 13:35:40] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 5 (OVERLAPS) 641/741 variables, 100/194 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/741 variables, 516/710 constraints. Problems are: Problem set: 0 solved, 650 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 741/742 variables, and 1360 constraints, problems are : Problem set: 0 solved, 650 unsolved in 30560 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 100/100 constraints, ReadFeed: 516/517 constraints, PredecessorRefiner: 650/650 constraints, Known Traps: 93/93 constraints]
After SMT, in 66357ms problems are : Problem set: 0 solved, 650 unsolved
Search for dead transitions found 0 dead transitions in 66368ms
Finished structural reductions in LTL mode , in 1 iterations and 66576 ms. Remains : 100/100 places, 651/651 transitions.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 93 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 214 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0)]
Reduction of identical properties reduced properties to check from 2 to 1
RANDOM walk for 204 steps (0 resets) in 13 ms. (14 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p1), (F p0)]
Knowledge based reduction with 3 factoid took 264 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 190 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 195 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0)]
[2024-05-29 13:36:06] [INFO ] Flow matrix only has 642 transitions (discarded 9 similar events)
[2024-05-29 13:36:06] [INFO ] Invariant cache hit.
[2024-05-29 13:36:07] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-29 13:36:07] [INFO ] [Real]Absence check using state equation in 105 ms returned sat
[2024-05-29 13:36:07] [INFO ] State equation strengthened by 517 read => feed constraints.
[2024-05-29 13:36:07] [INFO ] [Real]Added 517 Read/Feed constraints in 44 ms returned sat
[2024-05-29 13:36:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 13:36:07] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-29 13:36:07] [INFO ] [Nat]Absence check using state equation in 98 ms returned sat
[2024-05-29 13:36:07] [INFO ] [Nat]Added 517 Read/Feed constraints in 51 ms returned sat
[2024-05-29 13:36:07] [INFO ] Computed and/alt/rep : 106/130/106 causal constraints (skipped 535 transitions) in 43 ms.
[2024-05-29 13:36:08] [INFO ] Added : 82 causal constraints over 17 iterations in 688 ms. Result :sat
Could not prove EG (NOT p1)
[2024-05-29 13:36:08] [INFO ] Flow matrix only has 642 transitions (discarded 9 similar events)
[2024-05-29 13:36:08] [INFO ] Invariant cache hit.
[2024-05-29 13:36:08] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-29 13:36:08] [INFO ] [Real]Absence check using state equation in 102 ms returned sat
[2024-05-29 13:36:08] [INFO ] State equation strengthened by 517 read => feed constraints.
[2024-05-29 13:36:08] [INFO ] [Real]Added 517 Read/Feed constraints in 43 ms returned sat
[2024-05-29 13:36:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 13:36:08] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-29 13:36:08] [INFO ] [Nat]Absence check using state equation in 103 ms returned sat
[2024-05-29 13:36:08] [INFO ] [Nat]Added 517 Read/Feed constraints in 53 ms returned sat
[2024-05-29 13:36:08] [INFO ] Computed and/alt/rep : 106/130/106 causal constraints (skipped 535 transitions) in 43 ms.
[2024-05-29 13:36:09] [INFO ] Added : 82 causal constraints over 17 iterations in 669 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 183 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0)]
Product exploration explored 100000 steps with 1923 reset in 315 ms.
Product exploration explored 100000 steps with 1923 reset in 302 ms.
Applying partial POR strategy [false, false, true, true, true]
Stuttering acceptance computed with spot in 187 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0)]
Support contains 8 out of 100 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 100/100 places, 651/651 transitions.
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 100 transition count 651
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 8 Pre rules applied. Total rules applied 25 place count 100 transition count 659
Deduced a syphon composed of 33 places in 0 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 33 place count 100 transition count 659
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 49 place count 84 transition count 643
Deduced a syphon composed of 17 places in 0 ms
Iterating global reduction 1 with 16 rules applied. Total rules applied 65 place count 84 transition count 643
Performed 33 Post agglomeration using F-continuation condition with reduction of 16 identical transitions.
Deduced a syphon composed of 50 places in 0 ms
Iterating global reduction 1 with 33 rules applied. Total rules applied 98 place count 84 transition count 651
Ensure Unique test removed 271 transitions
Reduce isomorphic transitions removed 271 transitions.
Iterating post reduction 1 with 271 rules applied. Total rules applied 369 place count 84 transition count 380
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 387 place count 66 transition count 362
Deduced a syphon composed of 32 places in 1 ms
Iterating global reduction 2 with 18 rules applied. Total rules applied 405 place count 66 transition count 362
Deduced a syphon composed of 32 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 2 with 16 rules applied. Total rules applied 421 place count 66 transition count 346
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 40 places in 0 ms
Iterating global reduction 2 with 8 rules applied. Total rules applied 429 place count 66 transition count 346
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 445 place count 50 transition count 330
Deduced a syphon composed of 24 places in 0 ms
Iterating global reduction 2 with 16 rules applied. Total rules applied 461 place count 50 transition count 330
Deduced a syphon composed of 24 places in 0 ms
Applied a total of 461 rules in 154 ms. Remains 50 /100 variables (removed 50) and now considering 330/651 (removed 321) transitions.
[2024-05-29 13:36:10] [INFO ] Redundant transitions in 23 ms returned []
Running 329 sub problems to find dead transitions.
[2024-05-29 13:36:10] [INFO ] Flow matrix only has 321 transitions (discarded 9 similar events)
// Phase 1: matrix 321 rows 50 cols
[2024-05-29 13:36:10] [INFO ] Computed 1 invariants in 3 ms
[2024-05-29 13:36:10] [INFO ] State equation strengthened by 271 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 1 (OVERLAPS) 1/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 329 unsolved
[2024-05-29 13:36:13] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 0 ms to minimize.
[2024-05-29 13:36:13] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 0 ms to minimize.
[2024-05-29 13:36:13] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 0 ms to minimize.
[2024-05-29 13:36:13] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 1 ms to minimize.
[2024-05-29 13:36:13] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 1 ms to minimize.
[2024-05-29 13:36:13] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 1 ms to minimize.
[2024-05-29 13:36:13] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 0 ms to minimize.
[2024-05-29 13:36:13] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 1 ms to minimize.
[2024-05-29 13:36:13] [INFO ] Deduced a trap composed of 5 places in 82 ms of which 1 ms to minimize.
[2024-05-29 13:36:13] [INFO ] Deduced a trap composed of 5 places in 90 ms of which 0 ms to minimize.
[2024-05-29 13:36:13] [INFO ] Deduced a trap composed of 5 places in 61 ms of which 0 ms to minimize.
[2024-05-29 13:36:13] [INFO ] Deduced a trap composed of 5 places in 60 ms of which 1 ms to minimize.
[2024-05-29 13:36:13] [INFO ] Deduced a trap composed of 5 places in 69 ms of which 1 ms to minimize.
[2024-05-29 13:36:13] [INFO ] Deduced a trap composed of 5 places in 53 ms of which 0 ms to minimize.
[2024-05-29 13:36:13] [INFO ] Deduced a trap composed of 5 places in 45 ms of which 0 ms to minimize.
[2024-05-29 13:36:13] [INFO ] Deduced a trap composed of 5 places in 45 ms of which 0 ms to minimize.
[2024-05-29 13:36:13] [INFO ] Deduced a trap composed of 5 places in 49 ms of which 1 ms to minimize.
[2024-05-29 13:36:14] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 0 ms to minimize.
[2024-05-29 13:36:14] [INFO ] Deduced a trap composed of 5 places in 49 ms of which 1 ms to minimize.
[2024-05-29 13:36:14] [INFO ] Deduced a trap composed of 5 places in 49 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 329 unsolved
[2024-05-29 13:36:14] [INFO ] Deduced a trap composed of 5 places in 51 ms of which 1 ms to minimize.
[2024-05-29 13:36:14] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 0 ms to minimize.
[2024-05-29 13:36:14] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 0 ms to minimize.
[2024-05-29 13:36:14] [INFO ] Deduced a trap composed of 5 places in 61 ms of which 1 ms to minimize.
[2024-05-29 13:36:14] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 1 ms to minimize.
[2024-05-29 13:36:14] [INFO ] Deduced a trap composed of 5 places in 56 ms of which 0 ms to minimize.
[2024-05-29 13:36:14] [INFO ] Deduced a trap composed of 5 places in 47 ms of which 0 ms to minimize.
[2024-05-29 13:36:14] [INFO ] Deduced a trap composed of 5 places in 45 ms of which 1 ms to minimize.
[2024-05-29 13:36:14] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 1 ms to minimize.
[2024-05-29 13:36:14] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 1 ms to minimize.
[2024-05-29 13:36:14] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 0 ms to minimize.
[2024-05-29 13:36:14] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 0 ms to minimize.
[2024-05-29 13:36:14] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 1 ms to minimize.
[2024-05-29 13:36:14] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 0 ms to minimize.
[2024-05-29 13:36:14] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 0 ms to minimize.
[2024-05-29 13:36:14] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 0 ms to minimize.
[2024-05-29 13:36:14] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 ms to minimize.
[2024-05-29 13:36:15] [INFO ] Deduced a trap composed of 5 places in 206 ms of which 0 ms to minimize.
[2024-05-29 13:36:15] [INFO ] Deduced a trap composed of 5 places in 49 ms of which 1 ms to minimize.
[2024-05-29 13:36:15] [INFO ] Deduced a trap composed of 5 places in 54 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 329 unsolved
[2024-05-29 13:36:15] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 1 ms to minimize.
[2024-05-29 13:36:15] [INFO ] Deduced a trap composed of 5 places in 48 ms of which 0 ms to minimize.
[2024-05-29 13:36:15] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 0 ms to minimize.
[2024-05-29 13:36:15] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 1 ms to minimize.
[2024-05-29 13:36:15] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 0 ms to minimize.
[2024-05-29 13:36:16] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 1 ms to minimize.
[2024-05-29 13:36:16] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 0 ms to minimize.
[2024-05-29 13:36:16] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 0 ms to minimize.
[2024-05-29 13:36:16] [INFO ] Deduced a trap composed of 5 places in 49 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 9/50 constraints. Problems are: Problem set: 0 solved, 329 unsolved
[2024-05-29 13:36:16] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 0 ms to minimize.
[2024-05-29 13:36:16] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 1 ms to minimize.
[2024-05-29 13:36:16] [INFO ] Deduced a trap composed of 5 places in 51 ms of which 0 ms to minimize.
[2024-05-29 13:36:16] [INFO ] Deduced a trap composed of 5 places in 53 ms of which 1 ms to minimize.
[2024-05-29 13:36:16] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 5/55 constraints. Problems are: Problem set: 0 solved, 329 unsolved
[2024-05-29 13:36:17] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 0 ms to minimize.
[2024-05-29 13:36:17] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/50 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 329 unsolved
[2024-05-29 13:36:18] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 0 ms to minimize.
[2024-05-29 13:36:18] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 1 ms to minimize.
[2024-05-29 13:36:18] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 0 ms to minimize.
[2024-05-29 13:36:18] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 0 ms to minimize.
[2024-05-29 13:36:18] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/50 variables, 5/62 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/50 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 329 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD71 is UNSAT
At refinement iteration 9 (OVERLAPS) 320/370 variables, 50/112 constraints. Problems are: Problem set: 32 solved, 297 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/370 variables, 270/382 constraints. Problems are: Problem set: 32 solved, 297 unsolved
[2024-05-29 13:36:21] [INFO ] Deduced a trap composed of 5 places in 54 ms of which 1 ms to minimize.
[2024-05-29 13:36:21] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 1 ms to minimize.
[2024-05-29 13:36:21] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 1 ms to minimize.
[2024-05-29 13:36:21] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 0 ms to minimize.
[2024-05-29 13:36:21] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/370 variables, 5/387 constraints. Problems are: Problem set: 32 solved, 297 unsolved
[2024-05-29 13:36:24] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 0 ms to minimize.
[2024-05-29 13:36:25] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/370 variables, 2/389 constraints. Problems are: Problem set: 32 solved, 297 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/370 variables, 0/389 constraints. Problems are: Problem set: 32 solved, 297 unsolved
At refinement iteration 14 (OVERLAPS) 1/371 variables, 1/390 constraints. Problems are: Problem set: 32 solved, 297 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/371 variables, 0/390 constraints. Problems are: Problem set: 32 solved, 297 unsolved
At refinement iteration 16 (OVERLAPS) 0/371 variables, 0/390 constraints. Problems are: Problem set: 32 solved, 297 unsolved
No progress, stopping.
After SMT solving in domain Real declared 371/371 variables, and 390 constraints, problems are : Problem set: 32 solved, 297 unsolved in 27464 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 50/50 constraints, ReadFeed: 271/271 constraints, PredecessorRefiner: 329/329 constraints, Known Traps: 68/68 constraints]
Escalating to Integer solving :Problem set: 32 solved, 297 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 32 solved, 297 unsolved
At refinement iteration 1 (OVERLAPS) 25/50 variables, 1/1 constraints. Problems are: Problem set: 32 solved, 297 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 68/69 constraints. Problems are: Problem set: 32 solved, 297 unsolved
[2024-05-29 13:36:40] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 1 ms to minimize.
[2024-05-29 13:36:40] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 3 ms to minimize.
[2024-05-29 13:36:40] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 0 ms to minimize.
[2024-05-29 13:36:40] [INFO ] Deduced a trap composed of 5 places in 45 ms of which 1 ms to minimize.
[2024-05-29 13:36:40] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 5/74 constraints. Problems are: Problem set: 32 solved, 297 unsolved
[2024-05-29 13:36:41] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 0 ms to minimize.
[2024-05-29 13:36:41] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 2/76 constraints. Problems are: Problem set: 32 solved, 297 unsolved
[2024-05-29 13:36:42] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 1 ms to minimize.
[2024-05-29 13:36:42] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 1 ms to minimize.
[2024-05-29 13:36:42] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 0 ms to minimize.
[2024-05-29 13:36:42] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 4/80 constraints. Problems are: Problem set: 32 solved, 297 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/50 variables, 0/80 constraints. Problems are: Problem set: 32 solved, 297 unsolved
At refinement iteration 7 (OVERLAPS) 320/370 variables, 50/130 constraints. Problems are: Problem set: 32 solved, 297 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/370 variables, 270/400 constraints. Problems are: Problem set: 32 solved, 297 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/370 variables, 297/697 constraints. Problems are: Problem set: 32 solved, 297 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/370 variables, 0/697 constraints. Problems are: Problem set: 32 solved, 297 unsolved
At refinement iteration 11 (OVERLAPS) 1/371 variables, 1/698 constraints. Problems are: Problem set: 32 solved, 297 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 371/371 variables, and 698 constraints, problems are : Problem set: 32 solved, 297 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 50/50 constraints, ReadFeed: 271/271 constraints, PredecessorRefiner: 297/329 constraints, Known Traps: 79/79 constraints]
After SMT, in 58879ms problems are : Problem set: 32 solved, 297 unsolved
Search for dead transitions found 32 dead transitions in 58882ms
Found 32 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 32 transitions
Dead transitions reduction (with SMT) removed 32 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 50/100 places, 298/651 transitions.
Graph (complete) has 233 edges and 50 vertex of which 26 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.8 ms
Discarding 24 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 38 ms. Remains 26 /50 variables (removed 24) and now considering 298/298 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 26/100 places, 298/651 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 59109 ms. Remains : 26/100 places, 298/651 transitions.
Built C files in :
/tmp/ltsmin11887037645338754264
[2024-05-29 13:37:09] [INFO ] Built C files in 40ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11887037645338754264
Running compilation step : cd /tmp/ltsmin11887037645338754264;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1981 ms.
Running link step : cd /tmp/ltsmin11887037645338754264;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin11887037645338754264;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased17017946062339421259.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 8 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 651/651 transitions.
Applied a total of 0 rules in 10 ms. Remains 100 /100 variables (removed 0) and now considering 651/651 (removed 0) transitions.
[2024-05-29 13:37:24] [INFO ] Flow matrix only has 642 transitions (discarded 9 similar events)
// Phase 1: matrix 642 rows 100 cols
[2024-05-29 13:37:24] [INFO ] Computed 1 invariants in 8 ms
[2024-05-29 13:37:24] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-29 13:37:24] [INFO ] Flow matrix only has 642 transitions (discarded 9 similar events)
[2024-05-29 13:37:24] [INFO ] Invariant cache hit.
[2024-05-29 13:37:25] [INFO ] State equation strengthened by 517 read => feed constraints.
[2024-05-29 13:37:25] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 203 ms to find 0 implicit places.
Running 650 sub problems to find dead transitions.
[2024-05-29 13:37:25] [INFO ] Flow matrix only has 642 transitions (discarded 9 similar events)
[2024-05-29 13:37:25] [INFO ] Invariant cache hit.
[2024-05-29 13:37:25] [INFO ] State equation strengthened by 517 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 1 (OVERLAPS) 1/100 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-29 13:37:33] [INFO ] Deduced a trap composed of 17 places in 124 ms of which 0 ms to minimize.
[2024-05-29 13:37:33] [INFO ] Deduced a trap composed of 18 places in 132 ms of which 1 ms to minimize.
[2024-05-29 13:37:34] [INFO ] Deduced a trap composed of 13 places in 134 ms of which 1 ms to minimize.
[2024-05-29 13:37:34] [INFO ] Deduced a trap composed of 14 places in 132 ms of which 1 ms to minimize.
[2024-05-29 13:37:34] [INFO ] Deduced a trap composed of 14 places in 130 ms of which 1 ms to minimize.
[2024-05-29 13:37:34] [INFO ] Deduced a trap composed of 13 places in 115 ms of which 1 ms to minimize.
[2024-05-29 13:37:34] [INFO ] Deduced a trap composed of 13 places in 115 ms of which 1 ms to minimize.
[2024-05-29 13:37:34] [INFO ] Deduced a trap composed of 13 places in 263 ms of which 1 ms to minimize.
[2024-05-29 13:37:35] [INFO ] Deduced a trap composed of 15 places in 110 ms of which 1 ms to minimize.
[2024-05-29 13:37:35] [INFO ] Deduced a trap composed of 13 places in 122 ms of which 0 ms to minimize.
[2024-05-29 13:37:35] [INFO ] Deduced a trap composed of 13 places in 105 ms of which 1 ms to minimize.
[2024-05-29 13:37:35] [INFO ] Deduced a trap composed of 13 places in 167 ms of which 0 ms to minimize.
[2024-05-29 13:37:35] [INFO ] Deduced a trap composed of 14 places in 96 ms of which 1 ms to minimize.
[2024-05-29 13:37:35] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 0 ms to minimize.
[2024-05-29 13:37:35] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 1 ms to minimize.
[2024-05-29 13:37:35] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 0 ms to minimize.
[2024-05-29 13:37:35] [INFO ] Deduced a trap composed of 13 places in 110 ms of which 1 ms to minimize.
[2024-05-29 13:37:36] [INFO ] Deduced a trap composed of 15 places in 112 ms of which 1 ms to minimize.
[2024-05-29 13:37:36] [INFO ] Deduced a trap composed of 13 places in 109 ms of which 1 ms to minimize.
[2024-05-29 13:37:36] [INFO ] Deduced a trap composed of 14 places in 103 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-29 13:37:36] [INFO ] Deduced a trap composed of 13 places in 90 ms of which 0 ms to minimize.
[2024-05-29 13:37:36] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 1 ms to minimize.
[2024-05-29 13:37:36] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 0 ms to minimize.
[2024-05-29 13:37:36] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 1 ms to minimize.
[2024-05-29 13:37:36] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 0 ms to minimize.
[2024-05-29 13:37:36] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 0 ms to minimize.
[2024-05-29 13:37:36] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 1 ms to minimize.
[2024-05-29 13:37:36] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 1 ms to minimize.
[2024-05-29 13:37:36] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 1 ms to minimize.
[2024-05-29 13:37:37] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 0 ms to minimize.
[2024-05-29 13:37:37] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2024-05-29 13:37:37] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 0 ms to minimize.
[2024-05-29 13:37:37] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 0 ms to minimize.
[2024-05-29 13:37:37] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 0 ms to minimize.
[2024-05-29 13:37:37] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 0 ms to minimize.
[2024-05-29 13:37:37] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 0 ms to minimize.
[2024-05-29 13:37:37] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 1 ms to minimize.
[2024-05-29 13:37:37] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 0 ms to minimize.
[2024-05-29 13:37:37] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2024-05-29 13:37:37] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-29 13:37:39] [INFO ] Deduced a trap composed of 13 places in 87 ms of which 1 ms to minimize.
[2024-05-29 13:37:39] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 1 ms to minimize.
[2024-05-29 13:37:39] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 0 ms to minimize.
[2024-05-29 13:37:39] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 1 ms to minimize.
[2024-05-29 13:37:39] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 0 ms to minimize.
[2024-05-29 13:37:39] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 0 ms to minimize.
[2024-05-29 13:37:39] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 1 ms to minimize.
[2024-05-29 13:37:39] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 0 ms to minimize.
[2024-05-29 13:37:39] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 0 ms to minimize.
[2024-05-29 13:37:39] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 1 ms to minimize.
[2024-05-29 13:37:39] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 0 ms to minimize.
[2024-05-29 13:37:39] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 0 ms to minimize.
[2024-05-29 13:37:39] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 1 ms to minimize.
[2024-05-29 13:37:40] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 1 ms to minimize.
[2024-05-29 13:37:40] [INFO ] Deduced a trap composed of 13 places in 89 ms of which 1 ms to minimize.
[2024-05-29 13:37:40] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
[2024-05-29 13:37:40] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 1 ms to minimize.
[2024-05-29 13:37:40] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 0 ms to minimize.
[2024-05-29 13:37:41] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2024-05-29 13:37:42] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-29 13:37:42] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 0 ms to minimize.
[2024-05-29 13:37:42] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 1 ms to minimize.
[2024-05-29 13:37:42] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2024-05-29 13:37:42] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
[2024-05-29 13:37:42] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 0 ms to minimize.
[2024-05-29 13:37:42] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 0 ms to minimize.
[2024-05-29 13:37:42] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2024-05-29 13:37:42] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 0 ms to minimize.
[2024-05-29 13:37:42] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 0 ms to minimize.
[2024-05-29 13:37:42] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
[2024-05-29 13:37:42] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 1 ms to minimize.
[2024-05-29 13:37:43] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
[2024-05-29 13:37:43] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 0 ms to minimize.
[2024-05-29 13:37:43] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 0 ms to minimize.
[2024-05-29 13:37:43] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2024-05-29 13:37:43] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
[2024-05-29 13:37:43] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 0 ms to minimize.
[2024-05-29 13:37:43] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-05-29 13:37:43] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 1 ms to minimize.
[2024-05-29 13:37:43] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-29 13:37:44] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 0 ms to minimize.
[2024-05-29 13:37:44] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-05-29 13:37:44] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 0 ms to minimize.
[2024-05-29 13:37:44] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 1 ms to minimize.
[2024-05-29 13:37:44] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 1 ms to minimize.
[2024-05-29 13:37:44] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 0 ms to minimize.
[2024-05-29 13:37:44] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 0 ms to minimize.
[2024-05-29 13:37:44] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2024-05-29 13:37:46] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 0 ms to minimize.
[2024-05-29 13:37:46] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 1 ms to minimize.
[2024-05-29 13:37:46] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 1 ms to minimize.
[2024-05-29 13:37:46] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 12/93 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/100 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 8 (OVERLAPS) 641/741 variables, 100/193 constraints. Problems are: Problem set: 0 solved, 650 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 9 (INCLUDED_ONLY) 0/741 variables, 516/709 constraints. Problems are: Problem set: 0 solved, 650 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 741/742 variables, and 709 constraints, problems are : Problem set: 0 solved, 650 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 100/100 constraints, ReadFeed: 516/517 constraints, PredecessorRefiner: 650/650 constraints, Known Traps: 92/92 constraints]
Escalating to Integer solving :Problem set: 0 solved, 650 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 1 (OVERLAPS) 1/100 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 92/93 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-29 13:38:05] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 5 (OVERLAPS) 641/741 variables, 100/194 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/741 variables, 516/710 constraints. Problems are: Problem set: 0 solved, 650 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 741/742 variables, and 1360 constraints, problems are : Problem set: 0 solved, 650 unsolved in 30634 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 100/100 constraints, ReadFeed: 516/517 constraints, PredecessorRefiner: 650/650 constraints, Known Traps: 93/93 constraints]
After SMT, in 66685ms problems are : Problem set: 0 solved, 650 unsolved
Search for dead transitions found 0 dead transitions in 66697ms
Finished structural reductions in LTL mode , in 1 iterations and 66915 ms. Remains : 100/100 places, 651/651 transitions.
Built C files in :
/tmp/ltsmin11028992715776695450
[2024-05-29 13:38:31] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11028992715776695450
Running compilation step : cd /tmp/ltsmin11028992715776695450;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1717 ms.
Running link step : cd /tmp/ltsmin11028992715776695450;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin11028992715776695450;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased3146963626031030161.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 13:38:47] [INFO ] Flatten gal took : 56 ms
[2024-05-29 13:38:47] [INFO ] Flatten gal took : 51 ms
[2024-05-29 13:38:47] [INFO ] Time to serialize gal into /tmp/LTL18078370283376342538.gal : 11 ms
[2024-05-29 13:38:47] [INFO ] Time to serialize properties into /tmp/LTL16367075982542718492.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18078370283376342538.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14942717967091767201.hoa' '-atoms' '/tmp/LTL16367075982542718492.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL16367075982542718492.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14942717967091767201.hoa
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t8, t9, t11, t13, t14, t16, t18, t19, t21, t23, t24, t26, t28, t29, t31, t33,...455
Detected timeout of ITS tools.
[2024-05-29 13:39:02] [INFO ] Flatten gal took : 38 ms
[2024-05-29 13:39:02] [INFO ] Flatten gal took : 36 ms
[2024-05-29 13:39:02] [INFO ] Time to serialize gal into /tmp/LTL101011738852417542.gal : 12 ms
[2024-05-29 13:39:02] [INFO ] Time to serialize properties into /tmp/LTL11604948651685907257.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL101011738852417542.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11604948651685907257.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(F(("((((p30==1)&&(p66==1))&&((p102==1)&&(p138==1)))&&(((p174==1)&&(p210==1))&&((p246==1)&&(p282==1))))")&&(G(F("((((p30==1)&&(p66...244
Formula 0 simplified : FG!"((((p30==1)&&(p66==1))&&((p102==1)&&(p138==1)))&&(((p174==1)&&(p210==1))&&((p246==1)&&(p282==1))))"
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t8, t9, t11, t13, t14, t16, t18, t19, t21, t23, t24, t26, t28, t29, t31, t33,...455
Detected timeout of ITS tools.
[2024-05-29 13:39:17] [INFO ] Flatten gal took : 32 ms
[2024-05-29 13:39:17] [INFO ] Applying decomposition
[2024-05-29 13:39:17] [INFO ] Flatten gal took : 31 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph12556040792488478608.txt' '-o' '/tmp/graph12556040792488478608.bin' '-w' '/tmp/graph12556040792488478608.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12556040792488478608.bin' '-l' '-1' '-v' '-w' '/tmp/graph12556040792488478608.weights' '-q' '0' '-e' '0.001'
[2024-05-29 13:39:17] [INFO ] Decomposing Gal with order
[2024-05-29 13:39:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 13:39:17] [INFO ] Removed a total of 4139 redundant transitions.
[2024-05-29 13:39:17] [INFO ] Flatten gal took : 168 ms
[2024-05-29 13:39:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 18 labels/synchronizations in 58 ms.
[2024-05-29 13:39:17] [INFO ] Time to serialize gal into /tmp/LTL8349400150878407994.gal : 12 ms
[2024-05-29 13:39:17] [INFO ] Time to serialize properties into /tmp/LTL17174000875017662478.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8349400150878407994.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17174000875017662478.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(F(("((((i1.u0.p30==1)&&(i1.u10.p66==1))&&((i1.u5.p102==1)&&(i1.u6.p138==1)))&&(((i1.u12.p174==1)&&(i1.u28.p210==1))&&((i1.u21.p24...350
Formula 0 simplified : FG!"((((i1.u0.p30==1)&&(i1.u10.p66==1))&&((i1.u5.p102==1)&&(i1.u6.p138==1)))&&(((i1.u12.p174==1)&&(i1.u28.p210==1))&&((i1.u21.p246==...179
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t6, t13, t18, t21, t24, t29, t31, t34, t636, t638, t640, t642, t644, t646, t648, t650...626
53 unique states visited
53 strongly connected components in search stack
54 transitions explored
53 items max in DFS search stack
1285 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,12.9033,251896,1,0,259767,480,15541,1.17696e+06,241,1953,1898070
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA StigmergyCommit-PT-07a-LTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property StigmergyCommit-PT-07a-LTLFireability-00 finished in 345005 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 8 out of 101 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 101/101 places, 652/652 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 100 transition count 626
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 50 place count 75 transition count 626
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 50 place count 75 transition count 618
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 66 place count 67 transition count 618
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 67 place count 66 transition count 617
Iterating global reduction 2 with 1 rules applied. Total rules applied 68 place count 66 transition count 617
Performed 25 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 118 place count 41 transition count 583
Ensure Unique test removed 255 transitions
Reduce isomorphic transitions removed 255 transitions.
Iterating post reduction 2 with 255 rules applied. Total rules applied 373 place count 41 transition count 328
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 387 place count 34 transition count 321
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 394 place count 34 transition count 314
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 402 place count 34 transition count 306
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 418 place count 26 transition count 298
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 419 place count 25 transition count 297
Applied a total of 419 rules in 103 ms. Remains 25 /101 variables (removed 76) and now considering 297/652 (removed 355) transitions.
[2024-05-29 13:39:31] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
// Phase 1: matrix 288 rows 25 cols
[2024-05-29 13:39:31] [INFO ] Computed 1 invariants in 3 ms
[2024-05-29 13:39:31] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-29 13:39:31] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
[2024-05-29 13:39:31] [INFO ] Invariant cache hit.
[2024-05-29 13:39:31] [INFO ] State equation strengthened by 271 read => feed constraints.
[2024-05-29 13:39:32] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
[2024-05-29 13:39:32] [INFO ] Redundant transitions in 7 ms returned []
Running 289 sub problems to find dead transitions.
[2024-05-29 13:39:32] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
[2024-05-29 13:39:32] [INFO ] Invariant cache hit.
[2024-05-29 13:39:32] [INFO ] State equation strengthened by 271 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (OVERLAPS) 8/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-05-29 13:39:33] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 4 ms to minimize.
[2024-05-29 13:39:33] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-29 13:39:33] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-29 13:39:33] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 0 ms to minimize.
[2024-05-29 13:39:34] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 0 ms to minimize.
[2024-05-29 13:39:34] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 0 ms to minimize.
[2024-05-29 13:39:34] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2024-05-29 13:39:34] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-05-29 13:39:34] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
[2024-05-29 13:39:34] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
[2024-05-29 13:39:34] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
[2024-05-29 13:39:34] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 0 ms to minimize.
[2024-05-29 13:39:34] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 0 ms to minimize.
[2024-05-29 13:39:34] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 0 ms to minimize.
[2024-05-29 13:39:34] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 1 ms to minimize.
[2024-05-29 13:39:34] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 0 ms to minimize.
[2024-05-29 13:39:34] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 2 ms to minimize.
[2024-05-29 13:39:34] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 1 ms to minimize.
[2024-05-29 13:39:34] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 0 ms to minimize.
[2024-05-29 13:39:34] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-05-29 13:39:34] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2024-05-29 13:39:34] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-29 13:39:34] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2024-05-29 13:39:34] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-29 13:39:34] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2024-05-29 13:39:35] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-29 13:39:35] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-29 13:39:35] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 0 ms to minimize.
[2024-05-29 13:39:35] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-05-29 13:39:35] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-29 13:39:35] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-29 13:39:35] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-29 13:39:35] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 0 ms to minimize.
[2024-05-29 13:39:35] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2024-05-29 13:39:35] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-29 13:39:35] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-29 13:39:35] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-29 13:39:35] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 0 ms to minimize.
[2024-05-29 13:39:35] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-05-29 13:39:35] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-05-29 13:39:35] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
[2024-05-29 13:39:35] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2024-05-29 13:39:35] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-05-29 13:39:35] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 4/45 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-05-29 13:39:36] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-29 13:39:36] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-05-29 13:39:36] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
[2024-05-29 13:39:36] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/25 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 8 (OVERLAPS) 287/312 variables, 25/74 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/312 variables, 270/344 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/312 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 11 (OVERLAPS) 1/313 variables, 1/345 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/313 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 13 (OVERLAPS) 0/313 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 289 unsolved
No progress, stopping.
After SMT solving in domain Real declared 313/313 variables, and 345 constraints, problems are : Problem set: 0 solved, 289 unsolved in 16990 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 271/271 constraints, PredecessorRefiner: 289/289 constraints, Known Traps: 48/48 constraints]
Escalating to Integer solving :Problem set: 0 solved, 289 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (OVERLAPS) 8/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 48/49 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 4 (OVERLAPS) 287/312 variables, 25/74 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 270/344 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 289/633 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/312 variables, 0/633 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 8 (OVERLAPS) 1/313 variables, 1/634 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/313 variables, 0/634 constraints. Problems are: Problem set: 0 solved, 289 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 313/313 variables, and 634 constraints, problems are : Problem set: 0 solved, 289 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 271/271 constraints, PredecessorRefiner: 289/289 constraints, Known Traps: 48/48 constraints]
After SMT, in 48346ms problems are : Problem set: 0 solved, 289 unsolved
Search for dead transitions found 0 dead transitions in 48348ms
Starting structural reductions in SI_LTL mode, iteration 1 : 25/101 places, 297/652 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 48588 ms. Remains : 25/101 places, 297/652 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-07a-LTLFireability-01
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 1 ms.
FORMULA StigmergyCommit-PT-07a-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-07a-LTLFireability-01 finished in 48654 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((G(F(X(G(p1))))&&X(p1)&&F(p1)&&p0))))'
Support contains 8 out of 101 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 652/652 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 100 transition count 651
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 100 transition count 651
Applied a total of 2 rules in 3 ms. Remains 100 /101 variables (removed 1) and now considering 651/652 (removed 1) transitions.
[2024-05-29 13:40:20] [INFO ] Flow matrix only has 642 transitions (discarded 9 similar events)
// Phase 1: matrix 642 rows 100 cols
[2024-05-29 13:40:20] [INFO ] Computed 1 invariants in 8 ms
[2024-05-29 13:40:20] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-29 13:40:20] [INFO ] Flow matrix only has 642 transitions (discarded 9 similar events)
[2024-05-29 13:40:20] [INFO ] Invariant cache hit.
[2024-05-29 13:40:20] [INFO ] State equation strengthened by 517 read => feed constraints.
[2024-05-29 13:40:20] [INFO ] Implicit Places using invariants and state equation in 172 ms returned []
Implicit Place search using SMT with State Equation took 212 ms to find 0 implicit places.
Running 650 sub problems to find dead transitions.
[2024-05-29 13:40:20] [INFO ] Flow matrix only has 642 transitions (discarded 9 similar events)
[2024-05-29 13:40:20] [INFO ] Invariant cache hit.
[2024-05-29 13:40:20] [INFO ] State equation strengthened by 517 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 1 (OVERLAPS) 1/100 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-29 13:40:29] [INFO ] Deduced a trap composed of 17 places in 137 ms of which 1 ms to minimize.
[2024-05-29 13:40:29] [INFO ] Deduced a trap composed of 18 places in 143 ms of which 0 ms to minimize.
[2024-05-29 13:40:29] [INFO ] Deduced a trap composed of 13 places in 133 ms of which 1 ms to minimize.
[2024-05-29 13:40:29] [INFO ] Deduced a trap composed of 14 places in 130 ms of which 1 ms to minimize.
[2024-05-29 13:40:29] [INFO ] Deduced a trap composed of 14 places in 136 ms of which 1 ms to minimize.
[2024-05-29 13:40:29] [INFO ] Deduced a trap composed of 13 places in 111 ms of which 1 ms to minimize.
[2024-05-29 13:40:29] [INFO ] Deduced a trap composed of 13 places in 110 ms of which 0 ms to minimize.
[2024-05-29 13:40:30] [INFO ] Deduced a trap composed of 13 places in 294 ms of which 1 ms to minimize.
[2024-05-29 13:40:30] [INFO ] Deduced a trap composed of 15 places in 121 ms of which 1 ms to minimize.
[2024-05-29 13:40:30] [INFO ] Deduced a trap composed of 13 places in 119 ms of which 1 ms to minimize.
[2024-05-29 13:40:30] [INFO ] Deduced a trap composed of 13 places in 100 ms of which 0 ms to minimize.
[2024-05-29 13:40:30] [INFO ] Deduced a trap composed of 13 places in 107 ms of which 0 ms to minimize.
[2024-05-29 13:40:30] [INFO ] Deduced a trap composed of 14 places in 97 ms of which 1 ms to minimize.
[2024-05-29 13:40:30] [INFO ] Deduced a trap composed of 13 places in 87 ms of which 1 ms to minimize.
[2024-05-29 13:40:30] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 1 ms to minimize.
[2024-05-29 13:40:31] [INFO ] Deduced a trap composed of 13 places in 84 ms of which 0 ms to minimize.
[2024-05-29 13:40:31] [INFO ] Deduced a trap composed of 13 places in 119 ms of which 0 ms to minimize.
[2024-05-29 13:40:31] [INFO ] Deduced a trap composed of 15 places in 122 ms of which 0 ms to minimize.
[2024-05-29 13:40:31] [INFO ] Deduced a trap composed of 13 places in 124 ms of which 1 ms to minimize.
[2024-05-29 13:40:31] [INFO ] Deduced a trap composed of 14 places in 108 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-29 13:40:31] [INFO ] Deduced a trap composed of 13 places in 93 ms of which 1 ms to minimize.
[2024-05-29 13:40:31] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 0 ms to minimize.
[2024-05-29 13:40:31] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 1 ms to minimize.
[2024-05-29 13:40:31] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 1 ms to minimize.
[2024-05-29 13:40:32] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 1 ms to minimize.
[2024-05-29 13:40:32] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2024-05-29 13:40:32] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 1 ms to minimize.
[2024-05-29 13:40:32] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 0 ms to minimize.
[2024-05-29 13:40:32] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 0 ms to minimize.
[2024-05-29 13:40:32] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 1 ms to minimize.
[2024-05-29 13:40:32] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2024-05-29 13:40:32] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
[2024-05-29 13:40:32] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 1 ms to minimize.
[2024-05-29 13:40:32] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 1 ms to minimize.
[2024-05-29 13:40:32] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 1 ms to minimize.
[2024-05-29 13:40:32] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 1 ms to minimize.
[2024-05-29 13:40:32] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 1 ms to minimize.
[2024-05-29 13:40:32] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2024-05-29 13:40:32] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2024-05-29 13:40:33] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-29 13:40:34] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 1 ms to minimize.
[2024-05-29 13:40:34] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 1 ms to minimize.
[2024-05-29 13:40:34] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 0 ms to minimize.
[2024-05-29 13:40:34] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 0 ms to minimize.
[2024-05-29 13:40:34] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 0 ms to minimize.
[2024-05-29 13:40:34] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 0 ms to minimize.
[2024-05-29 13:40:34] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 0 ms to minimize.
[2024-05-29 13:40:34] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 0 ms to minimize.
[2024-05-29 13:40:35] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-05-29 13:40:35] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 1 ms to minimize.
[2024-05-29 13:40:35] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 0 ms to minimize.
[2024-05-29 13:40:35] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 0 ms to minimize.
[2024-05-29 13:40:35] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 0 ms to minimize.
[2024-05-29 13:40:35] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 0 ms to minimize.
[2024-05-29 13:40:35] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 1 ms to minimize.
[2024-05-29 13:40:35] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 0 ms to minimize.
[2024-05-29 13:40:35] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 0 ms to minimize.
[2024-05-29 13:40:35] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 0 ms to minimize.
[2024-05-29 13:40:37] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 0 ms to minimize.
[2024-05-29 13:40:37] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-29 13:40:37] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 0 ms to minimize.
[2024-05-29 13:40:37] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 1 ms to minimize.
[2024-05-29 13:40:37] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 0 ms to minimize.
[2024-05-29 13:40:37] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2024-05-29 13:40:37] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 0 ms to minimize.
[2024-05-29 13:40:37] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 0 ms to minimize.
[2024-05-29 13:40:37] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 0 ms to minimize.
[2024-05-29 13:40:38] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 1 ms to minimize.
[2024-05-29 13:40:38] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 1 ms to minimize.
[2024-05-29 13:40:38] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 0 ms to minimize.
[2024-05-29 13:40:38] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 1 ms to minimize.
[2024-05-29 13:40:38] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 1 ms to minimize.
[2024-05-29 13:40:38] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 0 ms to minimize.
[2024-05-29 13:40:38] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 0 ms to minimize.
[2024-05-29 13:40:38] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 0 ms to minimize.
[2024-05-29 13:40:38] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 1 ms to minimize.
[2024-05-29 13:40:38] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 1 ms to minimize.
[2024-05-29 13:40:38] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 0 ms to minimize.
[2024-05-29 13:40:39] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 1 ms to minimize.
[2024-05-29 13:40:39] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-29 13:40:39] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 0 ms to minimize.
[2024-05-29 13:40:39] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 0 ms to minimize.
[2024-05-29 13:40:39] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 0 ms to minimize.
[2024-05-29 13:40:39] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 0 ms to minimize.
[2024-05-29 13:40:39] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 1 ms to minimize.
[2024-05-29 13:40:40] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 0 ms to minimize.
[2024-05-29 13:40:40] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 0 ms to minimize.
[2024-05-29 13:40:40] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2024-05-29 13:40:41] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 1 ms to minimize.
[2024-05-29 13:40:41] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 0 ms to minimize.
[2024-05-29 13:40:41] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 0 ms to minimize.
[2024-05-29 13:40:41] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 12/93 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/100 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 8 (OVERLAPS) 641/741 variables, 100/193 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/741 variables, 516/709 constraints. Problems are: Problem set: 0 solved, 650 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 741/742 variables, and 709 constraints, problems are : Problem set: 0 solved, 650 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 100/100 constraints, ReadFeed: 516/517 constraints, PredecessorRefiner: 650/650 constraints, Known Traps: 92/92 constraints]
Escalating to Integer solving :Problem set: 0 solved, 650 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 1 (OVERLAPS) 1/100 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 92/93 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-29 13:41:01] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 5 (OVERLAPS) 641/741 variables, 100/194 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/741 variables, 516/710 constraints. Problems are: Problem set: 0 solved, 650 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 741/742 variables, and 1360 constraints, problems are : Problem set: 0 solved, 650 unsolved in 30502 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 100/100 constraints, ReadFeed: 516/517 constraints, PredecessorRefiner: 650/650 constraints, Known Traps: 93/93 constraints]
After SMT, in 66366ms problems are : Problem set: 0 solved, 650 unsolved
Search for dead transitions found 0 dead transitions in 66373ms
Starting structural reductions in LTL mode, iteration 1 : 100/101 places, 651/652 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 66591 ms. Remains : 100/101 places, 651/652 transitions.
Stuttering acceptance computed with spot in 157 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : StigmergyCommit-PT-07a-LTLFireability-03
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA StigmergyCommit-PT-07a-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-07a-LTLFireability-03 finished in 66766 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 8 out of 101 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 652/652 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 100 transition count 651
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 100 transition count 651
Applied a total of 2 rules in 8 ms. Remains 100 /101 variables (removed 1) and now considering 651/652 (removed 1) transitions.
[2024-05-29 13:41:27] [INFO ] Flow matrix only has 642 transitions (discarded 9 similar events)
[2024-05-29 13:41:27] [INFO ] Invariant cache hit.
[2024-05-29 13:41:27] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-05-29 13:41:27] [INFO ] Flow matrix only has 642 transitions (discarded 9 similar events)
[2024-05-29 13:41:27] [INFO ] Invariant cache hit.
[2024-05-29 13:41:27] [INFO ] State equation strengthened by 517 read => feed constraints.
[2024-05-29 13:41:27] [INFO ] Implicit Places using invariants and state equation in 168 ms returned []
Implicit Place search using SMT with State Equation took 197 ms to find 0 implicit places.
Running 650 sub problems to find dead transitions.
[2024-05-29 13:41:27] [INFO ] Flow matrix only has 642 transitions (discarded 9 similar events)
[2024-05-29 13:41:27] [INFO ] Invariant cache hit.
[2024-05-29 13:41:27] [INFO ] State equation strengthened by 517 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 1 (OVERLAPS) 1/100 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-29 13:41:36] [INFO ] Deduced a trap composed of 17 places in 141 ms of which 1 ms to minimize.
[2024-05-29 13:41:36] [INFO ] Deduced a trap composed of 18 places in 136 ms of which 1 ms to minimize.
[2024-05-29 13:41:36] [INFO ] Deduced a trap composed of 13 places in 135 ms of which 1 ms to minimize.
[2024-05-29 13:41:36] [INFO ] Deduced a trap composed of 14 places in 136 ms of which 1 ms to minimize.
[2024-05-29 13:41:36] [INFO ] Deduced a trap composed of 14 places in 128 ms of which 0 ms to minimize.
[2024-05-29 13:41:37] [INFO ] Deduced a trap composed of 13 places in 118 ms of which 0 ms to minimize.
[2024-05-29 13:41:37] [INFO ] Deduced a trap composed of 13 places in 110 ms of which 0 ms to minimize.
[2024-05-29 13:41:37] [INFO ] Deduced a trap composed of 13 places in 111 ms of which 0 ms to minimize.
[2024-05-29 13:41:37] [INFO ] Deduced a trap composed of 15 places in 107 ms of which 1 ms to minimize.
[2024-05-29 13:41:37] [INFO ] Deduced a trap composed of 13 places in 109 ms of which 1 ms to minimize.
[2024-05-29 13:41:37] [INFO ] Deduced a trap composed of 13 places in 95 ms of which 1 ms to minimize.
[2024-05-29 13:41:37] [INFO ] Deduced a trap composed of 13 places in 99 ms of which 1 ms to minimize.
[2024-05-29 13:41:37] [INFO ] Deduced a trap composed of 14 places in 103 ms of which 4 ms to minimize.
[2024-05-29 13:41:37] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 1 ms to minimize.
[2024-05-29 13:41:37] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 0 ms to minimize.
[2024-05-29 13:41:38] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 0 ms to minimize.
[2024-05-29 13:41:38] [INFO ] Deduced a trap composed of 13 places in 114 ms of which 0 ms to minimize.
[2024-05-29 13:41:38] [INFO ] Deduced a trap composed of 15 places in 110 ms of which 1 ms to minimize.
[2024-05-29 13:41:38] [INFO ] Deduced a trap composed of 13 places in 120 ms of which 1 ms to minimize.
[2024-05-29 13:41:38] [INFO ] Deduced a trap composed of 14 places in 102 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-29 13:41:38] [INFO ] Deduced a trap composed of 13 places in 87 ms of which 1 ms to minimize.
[2024-05-29 13:41:38] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 0 ms to minimize.
[2024-05-29 13:41:38] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 1 ms to minimize.
[2024-05-29 13:41:38] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 1 ms to minimize.
[2024-05-29 13:41:38] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 1 ms to minimize.
[2024-05-29 13:41:39] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 0 ms to minimize.
[2024-05-29 13:41:39] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 0 ms to minimize.
[2024-05-29 13:41:39] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 1 ms to minimize.
[2024-05-29 13:41:39] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 0 ms to minimize.
[2024-05-29 13:41:39] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
[2024-05-29 13:41:39] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 0 ms to minimize.
[2024-05-29 13:41:39] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 0 ms to minimize.
[2024-05-29 13:41:39] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 0 ms to minimize.
[2024-05-29 13:41:39] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 1 ms to minimize.
[2024-05-29 13:41:39] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 0 ms to minimize.
[2024-05-29 13:41:39] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 0 ms to minimize.
[2024-05-29 13:41:39] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 0 ms to minimize.
[2024-05-29 13:41:39] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 0 ms to minimize.
[2024-05-29 13:41:39] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2024-05-29 13:41:40] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-29 13:41:41] [INFO ] Deduced a trap composed of 13 places in 87 ms of which 0 ms to minimize.
[2024-05-29 13:41:41] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 0 ms to minimize.
[2024-05-29 13:41:41] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 1 ms to minimize.
[2024-05-29 13:41:41] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 1 ms to minimize.
[2024-05-29 13:41:41] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 1 ms to minimize.
[2024-05-29 13:41:41] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 0 ms to minimize.
[2024-05-29 13:41:41] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 0 ms to minimize.
[2024-05-29 13:41:41] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 0 ms to minimize.
[2024-05-29 13:41:41] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 2 ms to minimize.
[2024-05-29 13:41:42] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 1 ms to minimize.
[2024-05-29 13:41:42] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 1 ms to minimize.
[2024-05-29 13:41:42] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 0 ms to minimize.
[2024-05-29 13:41:42] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 0 ms to minimize.
[2024-05-29 13:41:42] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 0 ms to minimize.
[2024-05-29 13:41:42] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 1 ms to minimize.
[2024-05-29 13:41:42] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 0 ms to minimize.
[2024-05-29 13:41:42] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 0 ms to minimize.
[2024-05-29 13:41:42] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 0 ms to minimize.
[2024-05-29 13:41:44] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
[2024-05-29 13:41:44] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-29 13:41:44] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 0 ms to minimize.
[2024-05-29 13:41:44] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 1 ms to minimize.
[2024-05-29 13:41:44] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2024-05-29 13:41:44] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
[2024-05-29 13:41:44] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 0 ms to minimize.
[2024-05-29 13:41:44] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 0 ms to minimize.
[2024-05-29 13:41:44] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 0 ms to minimize.
[2024-05-29 13:41:44] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 1 ms to minimize.
[2024-05-29 13:41:44] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 0 ms to minimize.
[2024-05-29 13:41:45] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2024-05-29 13:41:45] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 0 ms to minimize.
[2024-05-29 13:41:45] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 1 ms to minimize.
[2024-05-29 13:41:45] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 1 ms to minimize.
[2024-05-29 13:41:45] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 0 ms to minimize.
[2024-05-29 13:41:45] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
[2024-05-29 13:41:45] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 0 ms to minimize.
[2024-05-29 13:41:45] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 1 ms to minimize.
[2024-05-29 13:41:45] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 0 ms to minimize.
[2024-05-29 13:41:45] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 1 ms to minimize.
[2024-05-29 13:41:45] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-29 13:41:46] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 1 ms to minimize.
[2024-05-29 13:41:46] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-05-29 13:41:46] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 0 ms to minimize.
[2024-05-29 13:41:46] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 0 ms to minimize.
[2024-05-29 13:41:46] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 0 ms to minimize.
[2024-05-29 13:41:46] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 1 ms to minimize.
[2024-05-29 13:41:47] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 0 ms to minimize.
[2024-05-29 13:41:47] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 0 ms to minimize.
[2024-05-29 13:41:48] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 1 ms to minimize.
[2024-05-29 13:41:48] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 0 ms to minimize.
[2024-05-29 13:41:48] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 1 ms to minimize.
[2024-05-29 13:41:48] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 12/93 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/100 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 8 (OVERLAPS) 641/741 variables, 100/193 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/741 variables, 516/709 constraints. Problems are: Problem set: 0 solved, 650 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 741/742 variables, and 709 constraints, problems are : Problem set: 0 solved, 650 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 100/100 constraints, ReadFeed: 516/517 constraints, PredecessorRefiner: 650/650 constraints, Known Traps: 92/92 constraints]
Escalating to Integer solving :Problem set: 0 solved, 650 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 1 (OVERLAPS) 1/100 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 92/93 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-29 13:42:08] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 5 (OVERLAPS) 641/741 variables, 100/194 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/741 variables, 516/710 constraints. Problems are: Problem set: 0 solved, 650 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 741/742 variables, and 1360 constraints, problems are : Problem set: 0 solved, 650 unsolved in 30589 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 100/100 constraints, ReadFeed: 516/517 constraints, PredecessorRefiner: 650/650 constraints, Known Traps: 93/93 constraints]
After SMT, in 66870ms problems are : Problem set: 0 solved, 650 unsolved
Search for dead transitions found 0 dead transitions in 66877ms
Starting structural reductions in LTL mode, iteration 1 : 100/101 places, 651/652 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 67086 ms. Remains : 100/101 places, 651/652 transitions.
Stuttering acceptance computed with spot in 205 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-07a-LTLFireability-04
Entered a terminal (fully accepting) state of product in 51 steps with 0 reset in 4 ms.
FORMULA StigmergyCommit-PT-07a-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-07a-LTLFireability-04 finished in 67311 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!p0||X(p0)))'
Support contains 8 out of 101 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 652/652 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 100 transition count 651
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 100 transition count 651
Applied a total of 2 rules in 6 ms. Remains 100 /101 variables (removed 1) and now considering 651/652 (removed 1) transitions.
[2024-05-29 13:42:34] [INFO ] Flow matrix only has 642 transitions (discarded 9 similar events)
[2024-05-29 13:42:34] [INFO ] Invariant cache hit.
[2024-05-29 13:42:34] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-29 13:42:34] [INFO ] Flow matrix only has 642 transitions (discarded 9 similar events)
[2024-05-29 13:42:34] [INFO ] Invariant cache hit.
[2024-05-29 13:42:34] [INFO ] State equation strengthened by 517 read => feed constraints.
[2024-05-29 13:42:34] [INFO ] Implicit Places using invariants and state equation in 168 ms returned []
Implicit Place search using SMT with State Equation took 198 ms to find 0 implicit places.
Running 650 sub problems to find dead transitions.
[2024-05-29 13:42:34] [INFO ] Flow matrix only has 642 transitions (discarded 9 similar events)
[2024-05-29 13:42:34] [INFO ] Invariant cache hit.
[2024-05-29 13:42:34] [INFO ] State equation strengthened by 517 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 1 (OVERLAPS) 1/100 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-29 13:42:43] [INFO ] Deduced a trap composed of 17 places in 139 ms of which 1 ms to minimize.
[2024-05-29 13:42:43] [INFO ] Deduced a trap composed of 18 places in 136 ms of which 0 ms to minimize.
[2024-05-29 13:42:43] [INFO ] Deduced a trap composed of 13 places in 138 ms of which 0 ms to minimize.
[2024-05-29 13:42:43] [INFO ] Deduced a trap composed of 14 places in 136 ms of which 1 ms to minimize.
[2024-05-29 13:42:44] [INFO ] Deduced a trap composed of 14 places in 141 ms of which 1 ms to minimize.
[2024-05-29 13:42:44] [INFO ] Deduced a trap composed of 13 places in 113 ms of which 0 ms to minimize.
[2024-05-29 13:42:44] [INFO ] Deduced a trap composed of 13 places in 117 ms of which 1 ms to minimize.
[2024-05-29 13:42:44] [INFO ] Deduced a trap composed of 13 places in 118 ms of which 1 ms to minimize.
[2024-05-29 13:42:44] [INFO ] Deduced a trap composed of 15 places in 115 ms of which 0 ms to minimize.
[2024-05-29 13:42:44] [INFO ] Deduced a trap composed of 13 places in 114 ms of which 0 ms to minimize.
[2024-05-29 13:42:44] [INFO ] Deduced a trap composed of 13 places in 97 ms of which 1 ms to minimize.
[2024-05-29 13:42:44] [INFO ] Deduced a trap composed of 13 places in 95 ms of which 0 ms to minimize.
[2024-05-29 13:42:44] [INFO ] Deduced a trap composed of 14 places in 94 ms of which 0 ms to minimize.
[2024-05-29 13:42:44] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 0 ms to minimize.
[2024-05-29 13:42:45] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 1 ms to minimize.
[2024-05-29 13:42:45] [INFO ] Deduced a trap composed of 13 places in 84 ms of which 0 ms to minimize.
[2024-05-29 13:42:45] [INFO ] Deduced a trap composed of 13 places in 115 ms of which 1 ms to minimize.
[2024-05-29 13:42:45] [INFO ] Deduced a trap composed of 15 places in 114 ms of which 0 ms to minimize.
[2024-05-29 13:42:45] [INFO ] Deduced a trap composed of 13 places in 303 ms of which 0 ms to minimize.
[2024-05-29 13:42:45] [INFO ] Deduced a trap composed of 14 places in 104 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-29 13:42:46] [INFO ] Deduced a trap composed of 13 places in 93 ms of which 1 ms to minimize.
[2024-05-29 13:42:46] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 1 ms to minimize.
[2024-05-29 13:42:46] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 0 ms to minimize.
[2024-05-29 13:42:46] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 1 ms to minimize.
[2024-05-29 13:42:46] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 0 ms to minimize.
[2024-05-29 13:42:46] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 0 ms to minimize.
[2024-05-29 13:42:46] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 1 ms to minimize.
[2024-05-29 13:42:46] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 0 ms to minimize.
[2024-05-29 13:42:46] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 1 ms to minimize.
[2024-05-29 13:42:46] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 0 ms to minimize.
[2024-05-29 13:42:46] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 0 ms to minimize.
[2024-05-29 13:42:46] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
[2024-05-29 13:42:46] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 0 ms to minimize.
[2024-05-29 13:42:46] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 0 ms to minimize.
[2024-05-29 13:42:47] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 0 ms to minimize.
[2024-05-29 13:42:47] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 0 ms to minimize.
[2024-05-29 13:42:47] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 1 ms to minimize.
[2024-05-29 13:42:47] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2024-05-29 13:42:47] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2024-05-29 13:42:47] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-29 13:42:48] [INFO ] Deduced a trap composed of 13 places in 94 ms of which 1 ms to minimize.
[2024-05-29 13:42:48] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 1 ms to minimize.
[2024-05-29 13:42:48] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 1 ms to minimize.
[2024-05-29 13:42:49] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 1 ms to minimize.
[2024-05-29 13:42:49] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 0 ms to minimize.
[2024-05-29 13:42:49] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 0 ms to minimize.
[2024-05-29 13:42:49] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 1 ms to minimize.
[2024-05-29 13:42:49] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2024-05-29 13:42:49] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2024-05-29 13:42:49] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 1 ms to minimize.
[2024-05-29 13:42:49] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 0 ms to minimize.
[2024-05-29 13:42:49] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-05-29 13:42:49] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 1 ms to minimize.
[2024-05-29 13:42:49] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 1 ms to minimize.
[2024-05-29 13:42:49] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 0 ms to minimize.
[2024-05-29 13:42:50] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
[2024-05-29 13:42:50] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 0 ms to minimize.
[2024-05-29 13:42:50] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 1 ms to minimize.
[2024-05-29 13:42:51] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
[2024-05-29 13:42:51] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-29 13:42:51] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 1 ms to minimize.
[2024-05-29 13:42:51] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 1 ms to minimize.
[2024-05-29 13:42:52] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2024-05-29 13:42:52] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 0 ms to minimize.
[2024-05-29 13:42:52] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2024-05-29 13:42:52] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 0 ms to minimize.
[2024-05-29 13:42:52] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
[2024-05-29 13:42:52] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 0 ms to minimize.
[2024-05-29 13:42:52] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 1 ms to minimize.
[2024-05-29 13:42:52] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 0 ms to minimize.
[2024-05-29 13:42:52] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 1 ms to minimize.
[2024-05-29 13:42:52] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 1 ms to minimize.
[2024-05-29 13:42:52] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 1 ms to minimize.
[2024-05-29 13:42:52] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
[2024-05-29 13:42:52] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
[2024-05-29 13:42:53] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 1 ms to minimize.
[2024-05-29 13:42:53] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 1 ms to minimize.
[2024-05-29 13:42:53] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
[2024-05-29 13:42:53] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 0 ms to minimize.
[2024-05-29 13:42:53] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-29 13:42:53] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 0 ms to minimize.
[2024-05-29 13:42:53] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-05-29 13:42:53] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 0 ms to minimize.
[2024-05-29 13:42:54] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 0 ms to minimize.
[2024-05-29 13:42:54] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 0 ms to minimize.
[2024-05-29 13:42:54] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 0 ms to minimize.
[2024-05-29 13:42:54] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 0 ms to minimize.
[2024-05-29 13:42:54] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 0 ms to minimize.
[2024-05-29 13:42:56] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 1 ms to minimize.
[2024-05-29 13:42:56] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 1 ms to minimize.
[2024-05-29 13:42:56] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 0 ms to minimize.
[2024-05-29 13:42:56] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 12/93 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/100 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 8 (OVERLAPS) 641/741 variables, 100/193 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/741 variables, 516/709 constraints. Problems are: Problem set: 0 solved, 650 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 741/742 variables, and 709 constraints, problems are : Problem set: 0 solved, 650 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 100/100 constraints, ReadFeed: 516/517 constraints, PredecessorRefiner: 650/650 constraints, Known Traps: 92/92 constraints]
Escalating to Integer solving :Problem set: 0 solved, 650 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 1 (OVERLAPS) 1/100 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 92/93 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-29 13:43:15] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 5 (OVERLAPS) 641/741 variables, 100/194 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/741 variables, 516/710 constraints. Problems are: Problem set: 0 solved, 650 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 741/742 variables, and 1360 constraints, problems are : Problem set: 0 solved, 650 unsolved in 30578 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 100/100 constraints, ReadFeed: 516/517 constraints, PredecessorRefiner: 650/650 constraints, Known Traps: 93/93 constraints]
After SMT, in 66602ms problems are : Problem set: 0 solved, 650 unsolved
Search for dead transitions found 0 dead transitions in 66610ms
Starting structural reductions in LTL mode, iteration 1 : 100/101 places, 651/652 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 66819 ms. Remains : 100/101 places, 651/652 transitions.
Initial state reduction rules removed 1 formulas.
Stuttering acceptance computed with spot in 101 ms :[true, false, (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-07a-LTLFireability-05
Initial state of product has no viable successors after 0 steps with 0 reset in 0 ms.
FORMULA StigmergyCommit-PT-07a-LTLFireability-05 TRUE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-07a-LTLFireability-05 finished in 66939 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 8 out of 101 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 652/652 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 100 transition count 651
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 100 transition count 651
Applied a total of 2 rules in 6 ms. Remains 100 /101 variables (removed 1) and now considering 651/652 (removed 1) transitions.
[2024-05-29 13:43:41] [INFO ] Flow matrix only has 642 transitions (discarded 9 similar events)
[2024-05-29 13:43:41] [INFO ] Invariant cache hit.
[2024-05-29 13:43:41] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-29 13:43:41] [INFO ] Flow matrix only has 642 transitions (discarded 9 similar events)
[2024-05-29 13:43:41] [INFO ] Invariant cache hit.
[2024-05-29 13:43:41] [INFO ] State equation strengthened by 517 read => feed constraints.
[2024-05-29 13:43:41] [INFO ] Implicit Places using invariants and state equation in 172 ms returned []
Implicit Place search using SMT with State Equation took 206 ms to find 0 implicit places.
Running 650 sub problems to find dead transitions.
[2024-05-29 13:43:41] [INFO ] Flow matrix only has 642 transitions (discarded 9 similar events)
[2024-05-29 13:43:41] [INFO ] Invariant cache hit.
[2024-05-29 13:43:41] [INFO ] State equation strengthened by 517 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 1 (OVERLAPS) 1/100 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-29 13:43:50] [INFO ] Deduced a trap composed of 17 places in 136 ms of which 0 ms to minimize.
[2024-05-29 13:43:50] [INFO ] Deduced a trap composed of 18 places in 134 ms of which 1 ms to minimize.
[2024-05-29 13:43:50] [INFO ] Deduced a trap composed of 13 places in 142 ms of which 1 ms to minimize.
[2024-05-29 13:43:50] [INFO ] Deduced a trap composed of 14 places in 131 ms of which 1 ms to minimize.
[2024-05-29 13:43:51] [INFO ] Deduced a trap composed of 14 places in 138 ms of which 0 ms to minimize.
[2024-05-29 13:43:51] [INFO ] Deduced a trap composed of 13 places in 121 ms of which 1 ms to minimize.
[2024-05-29 13:43:51] [INFO ] Deduced a trap composed of 13 places in 115 ms of which 1 ms to minimize.
[2024-05-29 13:43:51] [INFO ] Deduced a trap composed of 13 places in 120 ms of which 0 ms to minimize.
[2024-05-29 13:43:51] [INFO ] Deduced a trap composed of 15 places in 119 ms of which 0 ms to minimize.
[2024-05-29 13:43:51] [INFO ] Deduced a trap composed of 13 places in 117 ms of which 1 ms to minimize.
[2024-05-29 13:43:51] [INFO ] Deduced a trap composed of 13 places in 93 ms of which 1 ms to minimize.
[2024-05-29 13:43:51] [INFO ] Deduced a trap composed of 13 places in 254 ms of which 1 ms to minimize.
[2024-05-29 13:43:52] [INFO ] Deduced a trap composed of 14 places in 92 ms of which 0 ms to minimize.
[2024-05-29 13:43:52] [INFO ] Deduced a trap composed of 13 places in 84 ms of which 0 ms to minimize.
[2024-05-29 13:43:52] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 1 ms to minimize.
[2024-05-29 13:43:52] [INFO ] Deduced a trap composed of 13 places in 92 ms of which 1 ms to minimize.
[2024-05-29 13:43:52] [INFO ] Deduced a trap composed of 13 places in 114 ms of which 1 ms to minimize.
[2024-05-29 13:43:52] [INFO ] Deduced a trap composed of 15 places in 123 ms of which 1 ms to minimize.
[2024-05-29 13:43:52] [INFO ] Deduced a trap composed of 13 places in 114 ms of which 1 ms to minimize.
[2024-05-29 13:43:52] [INFO ] Deduced a trap composed of 14 places in 101 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-29 13:43:53] [INFO ] Deduced a trap composed of 13 places in 88 ms of which 1 ms to minimize.
[2024-05-29 13:43:53] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 1 ms to minimize.
[2024-05-29 13:43:53] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 0 ms to minimize.
[2024-05-29 13:43:53] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 0 ms to minimize.
[2024-05-29 13:43:53] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 1 ms to minimize.
[2024-05-29 13:43:53] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 0 ms to minimize.
[2024-05-29 13:43:53] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 0 ms to minimize.
[2024-05-29 13:43:53] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 0 ms to minimize.
[2024-05-29 13:43:53] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 1 ms to minimize.
[2024-05-29 13:43:53] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
[2024-05-29 13:43:53] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-05-29 13:43:53] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
[2024-05-29 13:43:53] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 0 ms to minimize.
[2024-05-29 13:43:53] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 0 ms to minimize.
[2024-05-29 13:43:54] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 1 ms to minimize.
[2024-05-29 13:43:54] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 0 ms to minimize.
[2024-05-29 13:43:54] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 0 ms to minimize.
[2024-05-29 13:43:54] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
[2024-05-29 13:43:54] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2024-05-29 13:43:54] [INFO ] Deduced a trap composed of 13 places in 87 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-29 13:43:55] [INFO ] Deduced a trap composed of 13 places in 88 ms of which 0 ms to minimize.
[2024-05-29 13:43:55] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 1 ms to minimize.
[2024-05-29 13:43:55] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 0 ms to minimize.
[2024-05-29 13:43:56] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 0 ms to minimize.
[2024-05-29 13:43:56] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 1 ms to minimize.
[2024-05-29 13:43:56] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 1 ms to minimize.
[2024-05-29 13:43:56] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 1 ms to minimize.
[2024-05-29 13:43:56] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2024-05-29 13:43:56] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
[2024-05-29 13:43:56] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 1 ms to minimize.
[2024-05-29 13:43:56] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 1 ms to minimize.
[2024-05-29 13:43:56] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2024-05-29 13:43:56] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 0 ms to minimize.
[2024-05-29 13:43:56] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 0 ms to minimize.
[2024-05-29 13:43:56] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 1 ms to minimize.
[2024-05-29 13:43:56] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2024-05-29 13:43:57] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 1 ms to minimize.
[2024-05-29 13:43:57] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 0 ms to minimize.
[2024-05-29 13:43:58] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 1 ms to minimize.
[2024-05-29 13:43:58] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-29 13:43:58] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 0 ms to minimize.
[2024-05-29 13:43:58] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 0 ms to minimize.
[2024-05-29 13:43:58] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 0 ms to minimize.
[2024-05-29 13:43:58] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
[2024-05-29 13:43:59] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 0 ms to minimize.
[2024-05-29 13:43:59] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
[2024-05-29 13:43:59] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2024-05-29 13:43:59] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 1 ms to minimize.
[2024-05-29 13:43:59] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 1 ms to minimize.
[2024-05-29 13:43:59] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 0 ms to minimize.
[2024-05-29 13:43:59] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 0 ms to minimize.
[2024-05-29 13:43:59] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 1 ms to minimize.
[2024-05-29 13:43:59] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 0 ms to minimize.
[2024-05-29 13:43:59] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 0 ms to minimize.
[2024-05-29 13:43:59] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
[2024-05-29 13:43:59] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 1 ms to minimize.
[2024-05-29 13:44:00] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
[2024-05-29 13:44:00] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 0 ms to minimize.
[2024-05-29 13:44:00] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 0 ms to minimize.
[2024-05-29 13:44:00] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-29 13:44:00] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 0 ms to minimize.
[2024-05-29 13:44:00] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 0 ms to minimize.
[2024-05-29 13:44:00] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2024-05-29 13:44:01] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 0 ms to minimize.
[2024-05-29 13:44:01] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 0 ms to minimize.
[2024-05-29 13:44:01] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 0 ms to minimize.
[2024-05-29 13:44:01] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 0 ms to minimize.
[2024-05-29 13:44:01] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 0 ms to minimize.
[2024-05-29 13:44:02] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 0 ms to minimize.
[2024-05-29 13:44:03] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
[2024-05-29 13:44:03] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
[2024-05-29 13:44:03] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 12/93 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/100 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 8 (OVERLAPS) 641/741 variables, 100/193 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/741 variables, 516/709 constraints. Problems are: Problem set: 0 solved, 650 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 741/742 variables, and 709 constraints, problems are : Problem set: 0 solved, 650 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 100/100 constraints, ReadFeed: 516/517 constraints, PredecessorRefiner: 650/650 constraints, Known Traps: 92/92 constraints]
Escalating to Integer solving :Problem set: 0 solved, 650 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 1 (OVERLAPS) 1/100 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 92/93 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-29 13:44:22] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 5 (OVERLAPS) 641/741 variables, 100/194 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/741 variables, 516/710 constraints. Problems are: Problem set: 0 solved, 650 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 741/742 variables, and 1360 constraints, problems are : Problem set: 0 solved, 650 unsolved in 30649 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 100/100 constraints, ReadFeed: 516/517 constraints, PredecessorRefiner: 650/650 constraints, Known Traps: 93/93 constraints]
After SMT, in 66748ms problems are : Problem set: 0 solved, 650 unsolved
Search for dead transitions found 0 dead transitions in 66756ms
Starting structural reductions in LTL mode, iteration 1 : 100/101 places, 651/652 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 66971 ms. Remains : 100/101 places, 651/652 transitions.
Stuttering acceptance computed with spot in 183 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-07a-LTLFireability-06
Entered a terminal (fully accepting) state of product in 51 steps with 0 reset in 2 ms.
FORMULA StigmergyCommit-PT-07a-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-07a-LTLFireability-06 finished in 67171 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 8 out of 101 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 652/652 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 100 transition count 651
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 100 transition count 651
Applied a total of 2 rules in 6 ms. Remains 100 /101 variables (removed 1) and now considering 651/652 (removed 1) transitions.
[2024-05-29 13:44:48] [INFO ] Flow matrix only has 642 transitions (discarded 9 similar events)
[2024-05-29 13:44:48] [INFO ] Invariant cache hit.
[2024-05-29 13:44:48] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-29 13:44:48] [INFO ] Flow matrix only has 642 transitions (discarded 9 similar events)
[2024-05-29 13:44:48] [INFO ] Invariant cache hit.
[2024-05-29 13:44:48] [INFO ] State equation strengthened by 517 read => feed constraints.
[2024-05-29 13:44:48] [INFO ] Implicit Places using invariants and state equation in 176 ms returned []
Implicit Place search using SMT with State Equation took 207 ms to find 0 implicit places.
Running 650 sub problems to find dead transitions.
[2024-05-29 13:44:48] [INFO ] Flow matrix only has 642 transitions (discarded 9 similar events)
[2024-05-29 13:44:48] [INFO ] Invariant cache hit.
[2024-05-29 13:44:48] [INFO ] State equation strengthened by 517 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 1 (OVERLAPS) 1/100 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-29 13:44:57] [INFO ] Deduced a trap composed of 17 places in 142 ms of which 0 ms to minimize.
[2024-05-29 13:44:57] [INFO ] Deduced a trap composed of 18 places in 136 ms of which 0 ms to minimize.
[2024-05-29 13:44:57] [INFO ] Deduced a trap composed of 13 places in 140 ms of which 1 ms to minimize.
[2024-05-29 13:44:58] [INFO ] Deduced a trap composed of 14 places in 142 ms of which 0 ms to minimize.
[2024-05-29 13:44:58] [INFO ] Deduced a trap composed of 14 places in 136 ms of which 0 ms to minimize.
[2024-05-29 13:44:58] [INFO ] Deduced a trap composed of 13 places in 120 ms of which 1 ms to minimize.
[2024-05-29 13:44:58] [INFO ] Deduced a trap composed of 13 places in 115 ms of which 0 ms to minimize.
[2024-05-29 13:44:58] [INFO ] Deduced a trap composed of 13 places in 110 ms of which 1 ms to minimize.
[2024-05-29 13:44:58] [INFO ] Deduced a trap composed of 15 places in 112 ms of which 1 ms to minimize.
[2024-05-29 13:44:58] [INFO ] Deduced a trap composed of 13 places in 115 ms of which 1 ms to minimize.
[2024-05-29 13:44:58] [INFO ] Deduced a trap composed of 13 places in 93 ms of which 0 ms to minimize.
[2024-05-29 13:44:58] [INFO ] Deduced a trap composed of 13 places in 93 ms of which 1 ms to minimize.
[2024-05-29 13:44:59] [INFO ] Deduced a trap composed of 14 places in 94 ms of which 0 ms to minimize.
[2024-05-29 13:44:59] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 1 ms to minimize.
[2024-05-29 13:44:59] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 1 ms to minimize.
[2024-05-29 13:44:59] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 0 ms to minimize.
[2024-05-29 13:44:59] [INFO ] Deduced a trap composed of 13 places in 114 ms of which 1 ms to minimize.
[2024-05-29 13:44:59] [INFO ] Deduced a trap composed of 15 places in 113 ms of which 1 ms to minimize.
[2024-05-29 13:44:59] [INFO ] Deduced a trap composed of 13 places in 113 ms of which 1 ms to minimize.
[2024-05-29 13:44:59] [INFO ] Deduced a trap composed of 14 places in 101 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-29 13:45:00] [INFO ] Deduced a trap composed of 13 places in 90 ms of which 0 ms to minimize.
[2024-05-29 13:45:00] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 1 ms to minimize.
[2024-05-29 13:45:00] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 0 ms to minimize.
[2024-05-29 13:45:00] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 1 ms to minimize.
[2024-05-29 13:45:00] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 1 ms to minimize.
[2024-05-29 13:45:00] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
[2024-05-29 13:45:00] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 0 ms to minimize.
[2024-05-29 13:45:00] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 1 ms to minimize.
[2024-05-29 13:45:00] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 1 ms to minimize.
[2024-05-29 13:45:00] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 0 ms to minimize.
[2024-05-29 13:45:00] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 0 ms to minimize.
[2024-05-29 13:45:00] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 0 ms to minimize.
[2024-05-29 13:45:00] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 0 ms to minimize.
[2024-05-29 13:45:00] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 0 ms to minimize.
[2024-05-29 13:45:00] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 0 ms to minimize.
[2024-05-29 13:45:01] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 0 ms to minimize.
[2024-05-29 13:45:01] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 0 ms to minimize.
[2024-05-29 13:45:01] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-05-29 13:45:01] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 0 ms to minimize.
[2024-05-29 13:45:01] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-29 13:45:02] [INFO ] Deduced a trap composed of 13 places in 93 ms of which 0 ms to minimize.
[2024-05-29 13:45:02] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 1 ms to minimize.
[2024-05-29 13:45:03] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 1 ms to minimize.
[2024-05-29 13:45:03] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 0 ms to minimize.
[2024-05-29 13:45:03] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 0 ms to minimize.
[2024-05-29 13:45:03] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
[2024-05-29 13:45:03] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 1 ms to minimize.
[2024-05-29 13:45:03] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 0 ms to minimize.
[2024-05-29 13:45:03] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2024-05-29 13:45:03] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 1 ms to minimize.
[2024-05-29 13:45:03] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 0 ms to minimize.
[2024-05-29 13:45:03] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-05-29 13:45:03] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 0 ms to minimize.
[2024-05-29 13:45:03] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 1 ms to minimize.
[2024-05-29 13:45:03] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 1 ms to minimize.
[2024-05-29 13:45:04] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2024-05-29 13:45:04] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 1 ms to minimize.
[2024-05-29 13:45:04] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 0 ms to minimize.
[2024-05-29 13:45:05] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
[2024-05-29 13:45:05] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-29 13:45:05] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 0 ms to minimize.
[2024-05-29 13:45:05] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 0 ms to minimize.
[2024-05-29 13:45:06] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2024-05-29 13:45:06] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2024-05-29 13:45:06] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
[2024-05-29 13:45:06] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
[2024-05-29 13:45:06] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2024-05-29 13:45:06] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 1 ms to minimize.
[2024-05-29 13:45:06] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 1 ms to minimize.
[2024-05-29 13:45:06] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 0 ms to minimize.
[2024-05-29 13:45:06] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 0 ms to minimize.
[2024-05-29 13:45:06] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 0 ms to minimize.
[2024-05-29 13:45:06] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 0 ms to minimize.
[2024-05-29 13:45:06] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 0 ms to minimize.
[2024-05-29 13:45:06] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 0 ms to minimize.
[2024-05-29 13:45:07] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 0 ms to minimize.
[2024-05-29 13:45:07] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 1 ms to minimize.
[2024-05-29 13:45:07] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 0 ms to minimize.
[2024-05-29 13:45:07] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 0 ms to minimize.
[2024-05-29 13:45:07] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-29 13:45:07] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 1 ms to minimize.
[2024-05-29 13:45:07] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 0 ms to minimize.
[2024-05-29 13:45:07] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
[2024-05-29 13:45:08] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 1 ms to minimize.
[2024-05-29 13:45:08] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 0 ms to minimize.
[2024-05-29 13:45:08] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 0 ms to minimize.
[2024-05-29 13:45:08] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 0 ms to minimize.
[2024-05-29 13:45:08] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 0 ms to minimize.
[2024-05-29 13:45:09] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 0 ms to minimize.
[2024-05-29 13:45:10] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 0 ms to minimize.
[2024-05-29 13:45:10] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 1 ms to minimize.
[2024-05-29 13:45:10] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 12/93 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/100 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 8 (OVERLAPS) 641/741 variables, 100/193 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/741 variables, 516/709 constraints. Problems are: Problem set: 0 solved, 650 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 741/742 variables, and 709 constraints, problems are : Problem set: 0 solved, 650 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 100/100 constraints, ReadFeed: 516/517 constraints, PredecessorRefiner: 650/650 constraints, Known Traps: 92/92 constraints]
Escalating to Integer solving :Problem set: 0 solved, 650 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 1 (OVERLAPS) 1/100 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 92/93 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-29 13:45:29] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 5 (OVERLAPS) 641/741 variables, 100/194 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/741 variables, 516/710 constraints. Problems are: Problem set: 0 solved, 650 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 741/742 variables, and 1360 constraints, problems are : Problem set: 0 solved, 650 unsolved in 30652 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 100/100 constraints, ReadFeed: 516/517 constraints, PredecessorRefiner: 650/650 constraints, Known Traps: 93/93 constraints]
After SMT, in 66709ms problems are : Problem set: 0 solved, 650 unsolved
Search for dead transitions found 0 dead transitions in 66717ms
Starting structural reductions in LTL mode, iteration 1 : 100/101 places, 651/652 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 66932 ms. Remains : 100/101 places, 651/652 transitions.
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-07a-LTLFireability-08
Product exploration explored 100000 steps with 1923 reset in 330 ms.
Product exploration explored 100000 steps with 1923 reset in 311 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 77 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 204 steps (0 resets) in 7 ms. (25 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 106 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0)]
[2024-05-29 13:45:56] [INFO ] Flow matrix only has 642 transitions (discarded 9 similar events)
[2024-05-29 13:45:56] [INFO ] Invariant cache hit.
[2024-05-29 13:45:56] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-29 13:45:57] [INFO ] [Real]Absence check using state equation in 101 ms returned sat
[2024-05-29 13:45:57] [INFO ] State equation strengthened by 517 read => feed constraints.
[2024-05-29 13:45:57] [INFO ] [Real]Added 517 Read/Feed constraints in 42 ms returned sat
[2024-05-29 13:45:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 13:45:57] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-29 13:45:57] [INFO ] [Nat]Absence check using state equation in 95 ms returned sat
[2024-05-29 13:45:57] [INFO ] [Nat]Added 517 Read/Feed constraints in 51 ms returned sat
[2024-05-29 13:45:57] [INFO ] Computed and/alt/rep : 106/130/106 causal constraints (skipped 535 transitions) in 44 ms.
[2024-05-29 13:45:58] [INFO ] Added : 82 causal constraints over 17 iterations in 678 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 8 out of 100 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 100/100 places, 651/651 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 99 transition count 625
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 50 place count 74 transition count 625
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 50 place count 74 transition count 617
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 66 place count 66 transition count 617
Performed 25 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 116 place count 41 transition count 583
Ensure Unique test removed 255 transitions
Reduce isomorphic transitions removed 255 transitions.
Iterating post reduction 2 with 255 rules applied. Total rules applied 371 place count 41 transition count 328
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 385 place count 34 transition count 321
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 392 place count 34 transition count 314
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 400 place count 34 transition count 306
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 416 place count 26 transition count 298
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 417 place count 25 transition count 297
Applied a total of 417 rules in 84 ms. Remains 25 /100 variables (removed 75) and now considering 297/651 (removed 354) transitions.
[2024-05-29 13:45:58] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
// Phase 1: matrix 288 rows 25 cols
[2024-05-29 13:45:58] [INFO ] Computed 1 invariants in 2 ms
[2024-05-29 13:45:58] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-29 13:45:58] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
[2024-05-29 13:45:58] [INFO ] Invariant cache hit.
[2024-05-29 13:45:58] [INFO ] State equation strengthened by 271 read => feed constraints.
[2024-05-29 13:45:58] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
[2024-05-29 13:45:58] [INFO ] Redundant transitions in 7 ms returned []
Running 289 sub problems to find dead transitions.
[2024-05-29 13:45:58] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
[2024-05-29 13:45:58] [INFO ] Invariant cache hit.
[2024-05-29 13:45:58] [INFO ] State equation strengthened by 271 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (OVERLAPS) 8/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-05-29 13:46:00] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-29 13:46:00] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-29 13:46:00] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-05-29 13:46:00] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 0 ms to minimize.
[2024-05-29 13:46:00] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 1 ms to minimize.
[2024-05-29 13:46:00] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 0 ms to minimize.
[2024-05-29 13:46:00] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 0 ms to minimize.
[2024-05-29 13:46:00] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2024-05-29 13:46:00] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 1 ms to minimize.
[2024-05-29 13:46:00] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 0 ms to minimize.
[2024-05-29 13:46:00] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 0 ms to minimize.
[2024-05-29 13:46:00] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 0 ms to minimize.
[2024-05-29 13:46:00] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 0 ms to minimize.
[2024-05-29 13:46:00] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 1 ms to minimize.
[2024-05-29 13:46:00] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 1 ms to minimize.
[2024-05-29 13:46:00] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 0 ms to minimize.
[2024-05-29 13:46:00] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 3 ms to minimize.
[2024-05-29 13:46:01] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 0 ms to minimize.
[2024-05-29 13:46:01] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 1 ms to minimize.
[2024-05-29 13:46:01] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-05-29 13:46:01] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-05-29 13:46:01] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-29 13:46:01] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2024-05-29 13:46:01] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-29 13:46:01] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2024-05-29 13:46:01] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-29 13:46:01] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-29 13:46:01] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
[2024-05-29 13:46:01] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-05-29 13:46:01] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2024-05-29 13:46:01] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-05-29 13:46:01] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-29 13:46:01] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
[2024-05-29 13:46:01] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2024-05-29 13:46:01] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-29 13:46:01] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-29 13:46:01] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-29 13:46:01] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
[2024-05-29 13:46:01] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-05-29 13:46:01] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-05-29 13:46:02] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 0 ms to minimize.
[2024-05-29 13:46:02] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
[2024-05-29 13:46:02] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2024-05-29 13:46:02] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 4/45 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-05-29 13:46:02] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2024-05-29 13:46:02] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-05-29 13:46:03] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
[2024-05-29 13:46:03] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/25 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 8 (OVERLAPS) 287/312 variables, 25/74 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/312 variables, 270/344 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/312 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 11 (OVERLAPS) 1/313 variables, 1/345 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/313 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 13 (OVERLAPS) 0/313 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 289 unsolved
No progress, stopping.
After SMT solving in domain Real declared 313/313 variables, and 345 constraints, problems are : Problem set: 0 solved, 289 unsolved in 17051 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 271/271 constraints, PredecessorRefiner: 289/289 constraints, Known Traps: 48/48 constraints]
Escalating to Integer solving :Problem set: 0 solved, 289 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (OVERLAPS) 8/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 48/49 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 4 (OVERLAPS) 287/312 variables, 25/74 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 270/344 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 289/633 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/312 variables, 0/633 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 8 (OVERLAPS) 1/313 variables, 1/634 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/313 variables, 0/634 constraints. Problems are: Problem set: 0 solved, 289 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 313/313 variables, and 634 constraints, problems are : Problem set: 0 solved, 289 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 271/271 constraints, PredecessorRefiner: 289/289 constraints, Known Traps: 48/48 constraints]
After SMT, in 48477ms problems are : Problem set: 0 solved, 289 unsolved
Search for dead transitions found 0 dead transitions in 48480ms
Starting structural reductions in SI_LTL mode, iteration 1 : 25/100 places, 297/651 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 48686 ms. Remains : 25/100 places, 297/651 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 65 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 32 steps (0 resets) in 5 ms. (5 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 94 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
[2024-05-29 13:46:47] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
[2024-05-29 13:46:47] [INFO ] Invariant cache hit.
[2024-05-29 13:46:47] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-29 13:46:47] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2024-05-29 13:46:47] [INFO ] State equation strengthened by 271 read => feed constraints.
[2024-05-29 13:46:47] [INFO ] [Real]Added 271 Read/Feed constraints in 30 ms returned sat
[2024-05-29 13:46:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 13:46:47] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-29 13:46:47] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2024-05-29 13:46:47] [INFO ] [Nat]Added 271 Read/Feed constraints in 30 ms returned sat
[2024-05-29 13:46:47] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 280 transitions) in 20 ms.
[2024-05-29 13:46:47] [INFO ] Added : 0 causal constraints over 0 iterations in 44 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 11111 reset in 656 ms.
Product exploration explored 100000 steps with 11111 reset in 720 ms.
Built C files in :
/tmp/ltsmin17338418829187123515
[2024-05-29 13:46:49] [INFO ] Computing symmetric may disable matrix : 297 transitions.
[2024-05-29 13:46:49] [INFO ] Computation of Complete disable matrix. took 29 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 13:46:49] [INFO ] Computing symmetric may enable matrix : 297 transitions.
[2024-05-29 13:46:49] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 13:46:49] [INFO ] Computing Do-Not-Accords matrix : 297 transitions.
[2024-05-29 13:46:49] [INFO ] Computation of Completed DNA matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 13:46:49] [INFO ] Built C files in 96ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17338418829187123515
Running compilation step : cd /tmp/ltsmin17338418829187123515;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1110 ms.
Running link step : cd /tmp/ltsmin17338418829187123515;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin17338418829187123515;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased17721481167497629609.hoa' '--buchi-type=spotba'
LTSmin run took 517 ms.
FORMULA StigmergyCommit-PT-07a-LTLFireability-08 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property StigmergyCommit-PT-07a-LTLFireability-08 finished in 122247 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 8 out of 101 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 101/101 places, 652/652 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 100 transition count 626
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 50 place count 75 transition count 626
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 50 place count 75 transition count 618
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 66 place count 67 transition count 618
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 67 place count 66 transition count 617
Iterating global reduction 2 with 1 rules applied. Total rules applied 68 place count 66 transition count 617
Performed 25 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 118 place count 41 transition count 583
Ensure Unique test removed 255 transitions
Reduce isomorphic transitions removed 255 transitions.
Iterating post reduction 2 with 255 rules applied. Total rules applied 373 place count 41 transition count 328
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 387 place count 34 transition count 321
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 394 place count 34 transition count 314
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 402 place count 34 transition count 306
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 418 place count 26 transition count 298
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 419 place count 25 transition count 297
Applied a total of 419 rules in 74 ms. Remains 25 /101 variables (removed 76) and now considering 297/652 (removed 355) transitions.
[2024-05-29 13:46:50] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
[2024-05-29 13:46:50] [INFO ] Invariant cache hit.
[2024-05-29 13:46:50] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-05-29 13:46:50] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
[2024-05-29 13:46:50] [INFO ] Invariant cache hit.
[2024-05-29 13:46:51] [INFO ] State equation strengthened by 271 read => feed constraints.
[2024-05-29 13:46:51] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
[2024-05-29 13:46:51] [INFO ] Redundant transitions in 6 ms returned []
Running 289 sub problems to find dead transitions.
[2024-05-29 13:46:51] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
[2024-05-29 13:46:51] [INFO ] Invariant cache hit.
[2024-05-29 13:46:51] [INFO ] State equation strengthened by 271 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (OVERLAPS) 8/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-05-29 13:46:52] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-29 13:46:52] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-29 13:46:52] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2024-05-29 13:46:53] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 1 ms to minimize.
[2024-05-29 13:46:53] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
[2024-05-29 13:46:53] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 0 ms to minimize.
[2024-05-29 13:46:53] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 1 ms to minimize.
[2024-05-29 13:46:53] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2024-05-29 13:46:53] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 0 ms to minimize.
[2024-05-29 13:46:53] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 0 ms to minimize.
[2024-05-29 13:46:53] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 0 ms to minimize.
[2024-05-29 13:46:53] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 0 ms to minimize.
[2024-05-29 13:46:53] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 0 ms to minimize.
[2024-05-29 13:46:53] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 0 ms to minimize.
[2024-05-29 13:46:53] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 0 ms to minimize.
[2024-05-29 13:46:53] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 0 ms to minimize.
[2024-05-29 13:46:53] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 0 ms to minimize.
[2024-05-29 13:46:53] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 0 ms to minimize.
[2024-05-29 13:46:53] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 0 ms to minimize.
[2024-05-29 13:46:53] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-05-29 13:46:53] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-29 13:46:53] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-29 13:46:54] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2024-05-29 13:46:54] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-05-29 13:46:54] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2024-05-29 13:46:54] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-29 13:46:54] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-29 13:46:54] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2024-05-29 13:46:54] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2024-05-29 13:46:54] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-05-29 13:46:54] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-05-29 13:46:54] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-29 13:46:54] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2024-05-29 13:46:54] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-05-29 13:46:54] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-29 13:46:54] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2024-05-29 13:46:54] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-29 13:46:54] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 0 ms to minimize.
[2024-05-29 13:46:54] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-05-29 13:46:54] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-05-29 13:46:54] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
[2024-05-29 13:46:54] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 0 ms to minimize.
[2024-05-29 13:46:54] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
[2024-05-29 13:46:55] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 4/45 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-05-29 13:46:55] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2024-05-29 13:46:55] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-05-29 13:46:55] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
[2024-05-29 13:46:55] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/25 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 8 (OVERLAPS) 287/312 variables, 25/74 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/312 variables, 270/344 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/312 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 11 (OVERLAPS) 1/313 variables, 1/345 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/313 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 13 (OVERLAPS) 0/313 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 289 unsolved
No progress, stopping.
After SMT solving in domain Real declared 313/313 variables, and 345 constraints, problems are : Problem set: 0 solved, 289 unsolved in 17367 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 271/271 constraints, PredecessorRefiner: 289/289 constraints, Known Traps: 48/48 constraints]
Escalating to Integer solving :Problem set: 0 solved, 289 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (OVERLAPS) 8/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 48/49 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 4 (OVERLAPS) 287/312 variables, 25/74 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 270/344 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 289/633 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/312 variables, 0/633 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 8 (OVERLAPS) 1/313 variables, 1/634 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/313 variables, 0/634 constraints. Problems are: Problem set: 0 solved, 289 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 313/313 variables, and 634 constraints, problems are : Problem set: 0 solved, 289 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 271/271 constraints, PredecessorRefiner: 289/289 constraints, Known Traps: 48/48 constraints]
After SMT, in 48716ms problems are : Problem set: 0 solved, 289 unsolved
Search for dead transitions found 0 dead transitions in 48719ms
Starting structural reductions in SI_LTL mode, iteration 1 : 25/101 places, 297/652 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 48908 ms. Remains : 25/101 places, 297/652 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-07a-LTLFireability-09
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 1 ms.
FORMULA StigmergyCommit-PT-07a-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-07a-LTLFireability-09 finished in 48964 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!p0 U G(p0)))'
Support contains 8 out of 101 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 101/101 places, 652/652 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 100 transition count 626
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 50 place count 75 transition count 626
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 50 place count 75 transition count 618
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 66 place count 67 transition count 618
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 67 place count 66 transition count 617
Iterating global reduction 2 with 1 rules applied. Total rules applied 68 place count 66 transition count 617
Performed 25 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 118 place count 41 transition count 583
Ensure Unique test removed 255 transitions
Reduce isomorphic transitions removed 255 transitions.
Iterating post reduction 2 with 255 rules applied. Total rules applied 373 place count 41 transition count 328
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 387 place count 34 transition count 321
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 394 place count 34 transition count 314
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 402 place count 34 transition count 306
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 418 place count 26 transition count 298
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 419 place count 25 transition count 297
Applied a total of 419 rules in 72 ms. Remains 25 /101 variables (removed 76) and now considering 297/652 (removed 355) transitions.
[2024-05-29 13:47:39] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
[2024-05-29 13:47:39] [INFO ] Invariant cache hit.
[2024-05-29 13:47:39] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-29 13:47:39] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
[2024-05-29 13:47:39] [INFO ] Invariant cache hit.
[2024-05-29 13:47:39] [INFO ] State equation strengthened by 271 read => feed constraints.
[2024-05-29 13:47:40] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
[2024-05-29 13:47:40] [INFO ] Redundant transitions in 5 ms returned []
Running 289 sub problems to find dead transitions.
[2024-05-29 13:47:40] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
[2024-05-29 13:47:40] [INFO ] Invariant cache hit.
[2024-05-29 13:47:40] [INFO ] State equation strengthened by 271 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (OVERLAPS) 8/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-05-29 13:47:41] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-29 13:47:41] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-29 13:47:41] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-05-29 13:47:42] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 1 ms to minimize.
[2024-05-29 13:47:42] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 0 ms to minimize.
[2024-05-29 13:47:42] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 0 ms to minimize.
[2024-05-29 13:47:42] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 0 ms to minimize.
[2024-05-29 13:47:42] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-05-29 13:47:42] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 0 ms to minimize.
[2024-05-29 13:47:42] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 1 ms to minimize.
[2024-05-29 13:47:42] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 1 ms to minimize.
[2024-05-29 13:47:42] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 0 ms to minimize.
[2024-05-29 13:47:42] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 0 ms to minimize.
[2024-05-29 13:47:42] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 1 ms to minimize.
[2024-05-29 13:47:42] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 0 ms to minimize.
[2024-05-29 13:47:42] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 0 ms to minimize.
[2024-05-29 13:47:42] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 0 ms to minimize.
[2024-05-29 13:47:42] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 0 ms to minimize.
[2024-05-29 13:47:42] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 1 ms to minimize.
[2024-05-29 13:47:42] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-05-29 13:47:42] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-29 13:47:42] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-29 13:47:43] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2024-05-29 13:47:43] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-29 13:47:43] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
[2024-05-29 13:47:43] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-05-29 13:47:43] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-29 13:47:43] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2024-05-29 13:47:43] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-05-29 13:47:43] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-29 13:47:43] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-29 13:47:43] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-29 13:47:43] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 1 ms to minimize.
[2024-05-29 13:47:43] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 0 ms to minimize.
[2024-05-29 13:47:43] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2024-05-29 13:47:43] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-05-29 13:47:43] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-29 13:47:43] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
[2024-05-29 13:47:43] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
[2024-05-29 13:47:43] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-05-29 13:47:43] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
[2024-05-29 13:47:43] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2024-05-29 13:47:43] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-05-29 13:47:43] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 4/45 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-05-29 13:47:44] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2024-05-29 13:47:44] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-05-29 13:47:44] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
[2024-05-29 13:47:44] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/25 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 8 (OVERLAPS) 287/312 variables, 25/74 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/312 variables, 270/344 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/312 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 11 (OVERLAPS) 1/313 variables, 1/345 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/313 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 13 (OVERLAPS) 0/313 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 289 unsolved
No progress, stopping.
After SMT solving in domain Real declared 313/313 variables, and 345 constraints, problems are : Problem set: 0 solved, 289 unsolved in 16934 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 271/271 constraints, PredecessorRefiner: 289/289 constraints, Known Traps: 48/48 constraints]
Escalating to Integer solving :Problem set: 0 solved, 289 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (OVERLAPS) 8/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 48/49 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 4 (OVERLAPS) 287/312 variables, 25/74 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 270/344 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 289/633 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/312 variables, 0/633 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 8 (OVERLAPS) 1/313 variables, 1/634 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/313 variables, 0/634 constraints. Problems are: Problem set: 0 solved, 289 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 313/313 variables, and 634 constraints, problems are : Problem set: 0 solved, 289 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 271/271 constraints, PredecessorRefiner: 289/289 constraints, Known Traps: 48/48 constraints]
After SMT, in 48289ms problems are : Problem set: 0 solved, 289 unsolved
Search for dead transitions found 0 dead transitions in 48292ms
Starting structural reductions in SI_LTL mode, iteration 1 : 25/101 places, 297/652 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 48489 ms. Remains : 25/101 places, 297/652 transitions.
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), true, (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-07a-LTLFireability-10
Entered a terminal (fully accepting) state of product in 9 steps with 0 reset in 0 ms.
FORMULA StigmergyCommit-PT-07a-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-07a-LTLFireability-10 finished in 48598 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&F(p1))))'
Support contains 8 out of 101 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 101/101 places, 652/652 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 100 transition count 626
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 50 place count 75 transition count 626
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 50 place count 75 transition count 618
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 66 place count 67 transition count 618
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 67 place count 66 transition count 617
Iterating global reduction 2 with 1 rules applied. Total rules applied 68 place count 66 transition count 617
Performed 25 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 118 place count 41 transition count 583
Ensure Unique test removed 255 transitions
Reduce isomorphic transitions removed 255 transitions.
Iterating post reduction 2 with 255 rules applied. Total rules applied 373 place count 41 transition count 328
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 387 place count 34 transition count 321
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 394 place count 34 transition count 314
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 402 place count 34 transition count 306
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 418 place count 26 transition count 298
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 419 place count 25 transition count 297
Applied a total of 419 rules in 87 ms. Remains 25 /101 variables (removed 76) and now considering 297/652 (removed 355) transitions.
[2024-05-29 13:48:28] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
[2024-05-29 13:48:28] [INFO ] Invariant cache hit.
[2024-05-29 13:48:28] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-29 13:48:28] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
[2024-05-29 13:48:28] [INFO ] Invariant cache hit.
[2024-05-29 13:48:28] [INFO ] State equation strengthened by 271 read => feed constraints.
[2024-05-29 13:48:28] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
[2024-05-29 13:48:28] [INFO ] Redundant transitions in 7 ms returned []
Running 289 sub problems to find dead transitions.
[2024-05-29 13:48:28] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
[2024-05-29 13:48:28] [INFO ] Invariant cache hit.
[2024-05-29 13:48:28] [INFO ] State equation strengthened by 271 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (OVERLAPS) 8/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-05-29 13:48:30] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-29 13:48:30] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-29 13:48:30] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2024-05-29 13:48:30] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 0 ms to minimize.
[2024-05-29 13:48:30] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 1 ms to minimize.
[2024-05-29 13:48:30] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 0 ms to minimize.
[2024-05-29 13:48:30] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2024-05-29 13:48:30] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-05-29 13:48:30] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2024-05-29 13:48:30] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 0 ms to minimize.
[2024-05-29 13:48:31] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 1 ms to minimize.
[2024-05-29 13:48:31] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 0 ms to minimize.
[2024-05-29 13:48:31] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 0 ms to minimize.
[2024-05-29 13:48:31] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
[2024-05-29 13:48:31] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 0 ms to minimize.
[2024-05-29 13:48:31] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 0 ms to minimize.
[2024-05-29 13:48:31] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 0 ms to minimize.
[2024-05-29 13:48:31] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 0 ms to minimize.
[2024-05-29 13:48:31] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 0 ms to minimize.
[2024-05-29 13:48:31] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-05-29 13:48:31] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-29 13:48:31] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-29 13:48:31] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
[2024-05-29 13:48:31] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-29 13:48:31] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2024-05-29 13:48:31] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-05-29 13:48:31] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-29 13:48:31] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2024-05-29 13:48:31] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2024-05-29 13:48:31] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-05-29 13:48:31] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-05-29 13:48:31] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-29 13:48:31] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
[2024-05-29 13:48:32] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2024-05-29 13:48:32] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-29 13:48:32] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-29 13:48:32] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-05-29 13:48:32] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 0 ms to minimize.
[2024-05-29 13:48:32] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-05-29 13:48:32] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-05-29 13:48:32] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 0 ms to minimize.
[2024-05-29 13:48:32] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2024-05-29 13:48:32] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
[2024-05-29 13:48:32] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 4/45 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-05-29 13:48:33] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-05-29 13:48:33] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-05-29 13:48:33] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2024-05-29 13:48:33] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/25 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 8 (OVERLAPS) 287/312 variables, 25/74 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/312 variables, 270/344 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/312 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 11 (OVERLAPS) 1/313 variables, 1/345 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/313 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 13 (OVERLAPS) 0/313 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 289 unsolved
No progress, stopping.
After SMT solving in domain Real declared 313/313 variables, and 345 constraints, problems are : Problem set: 0 solved, 289 unsolved in 16590 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 271/271 constraints, PredecessorRefiner: 289/289 constraints, Known Traps: 48/48 constraints]
Escalating to Integer solving :Problem set: 0 solved, 289 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (OVERLAPS) 8/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 48/49 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 4 (OVERLAPS) 287/312 variables, 25/74 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 270/344 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 289/633 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/312 variables, 0/633 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 8 (OVERLAPS) 1/313 variables, 1/634 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/313 variables, 0/634 constraints. Problems are: Problem set: 0 solved, 289 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 313/313 variables, and 634 constraints, problems are : Problem set: 0 solved, 289 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 271/271 constraints, PredecessorRefiner: 289/289 constraints, Known Traps: 48/48 constraints]
After SMT, in 48029ms problems are : Problem set: 0 solved, 289 unsolved
Search for dead transitions found 0 dead transitions in 48033ms
Starting structural reductions in SI_LTL mode, iteration 1 : 25/101 places, 297/652 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 48244 ms. Remains : 25/101 places, 297/652 transitions.
Stuttering acceptance computed with spot in 89 ms :[(NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : StigmergyCommit-PT-07a-LTLFireability-11
Product exploration explored 100000 steps with 11111 reset in 648 ms.
Product exploration explored 100000 steps with 11111 reset in 661 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X (AND p0 (NOT p1))), (X p0), (X (X (NOT p1))), (X (X (AND p0 (NOT p1)))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 109 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 88 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 32 steps (0 resets) in 4 ms. (6 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X (AND p0 (NOT p1))), (X p0), (X (X (NOT p1))), (X (X (AND p0 (NOT p1)))), (X (X p0))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 7 factoid took 207 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 81 ms :[(NOT p1), (NOT p1)]
[2024-05-29 13:49:18] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
[2024-05-29 13:49:18] [INFO ] Invariant cache hit.
[2024-05-29 13:49:18] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-29 13:49:18] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2024-05-29 13:49:18] [INFO ] State equation strengthened by 271 read => feed constraints.
[2024-05-29 13:49:18] [INFO ] [Real]Added 271 Read/Feed constraints in 28 ms returned sat
[2024-05-29 13:49:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 13:49:19] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-29 13:49:19] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2024-05-29 13:49:19] [INFO ] [Nat]Added 271 Read/Feed constraints in 28 ms returned sat
[2024-05-29 13:49:19] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 280 transitions) in 19 ms.
[2024-05-29 13:49:19] [INFO ] Added : 0 causal constraints over 0 iterations in 42 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 8 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 297/297 transitions.
Applied a total of 0 rules in 18 ms. Remains 25 /25 variables (removed 0) and now considering 297/297 (removed 0) transitions.
[2024-05-29 13:49:19] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
[2024-05-29 13:49:19] [INFO ] Invariant cache hit.
[2024-05-29 13:49:19] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-29 13:49:19] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
[2024-05-29 13:49:19] [INFO ] Invariant cache hit.
[2024-05-29 13:49:19] [INFO ] State equation strengthened by 271 read => feed constraints.
[2024-05-29 13:49:19] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
[2024-05-29 13:49:19] [INFO ] Redundant transitions in 6 ms returned []
Running 289 sub problems to find dead transitions.
[2024-05-29 13:49:19] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
[2024-05-29 13:49:19] [INFO ] Invariant cache hit.
[2024-05-29 13:49:19] [INFO ] State equation strengthened by 271 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (OVERLAPS) 8/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-05-29 13:49:21] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-29 13:49:21] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-29 13:49:21] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-29 13:49:21] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 1 ms to minimize.
[2024-05-29 13:49:21] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 0 ms to minimize.
[2024-05-29 13:49:21] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 0 ms to minimize.
[2024-05-29 13:49:21] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 0 ms to minimize.
[2024-05-29 13:49:21] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 0 ms to minimize.
[2024-05-29 13:49:21] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 0 ms to minimize.
[2024-05-29 13:49:21] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 1 ms to minimize.
[2024-05-29 13:49:21] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 0 ms to minimize.
[2024-05-29 13:49:21] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 0 ms to minimize.
[2024-05-29 13:49:21] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 1 ms to minimize.
[2024-05-29 13:49:21] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 1 ms to minimize.
[2024-05-29 13:49:21] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 0 ms to minimize.
[2024-05-29 13:49:21] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 0 ms to minimize.
[2024-05-29 13:49:22] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 1 ms to minimize.
[2024-05-29 13:49:22] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 0 ms to minimize.
[2024-05-29 13:49:22] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 0 ms to minimize.
[2024-05-29 13:49:22] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-05-29 13:49:22] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-29 13:49:22] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-29 13:49:22] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2024-05-29 13:49:22] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-05-29 13:49:22] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2024-05-29 13:49:22] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-05-29 13:49:22] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-29 13:49:22] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 0 ms to minimize.
[2024-05-29 13:49:22] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2024-05-29 13:49:22] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-29 13:49:22] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-29 13:49:22] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-29 13:49:22] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2024-05-29 13:49:22] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
[2024-05-29 13:49:22] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-05-29 13:49:22] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2024-05-29 13:49:22] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-29 13:49:22] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 1 ms to minimize.
[2024-05-29 13:49:22] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2024-05-29 13:49:22] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-05-29 13:49:23] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 1 ms to minimize.
[2024-05-29 13:49:23] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 0 ms to minimize.
[2024-05-29 13:49:23] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
[2024-05-29 13:49:23] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 4/45 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-05-29 13:49:23] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-05-29 13:49:23] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-05-29 13:49:24] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 0 ms to minimize.
[2024-05-29 13:49:24] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/25 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 8 (OVERLAPS) 287/312 variables, 25/74 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/312 variables, 270/344 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/312 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 11 (OVERLAPS) 1/313 variables, 1/345 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/313 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 13 (OVERLAPS) 0/313 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 289 unsolved
No progress, stopping.
After SMT solving in domain Real declared 313/313 variables, and 345 constraints, problems are : Problem set: 0 solved, 289 unsolved in 17214 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 271/271 constraints, PredecessorRefiner: 289/289 constraints, Known Traps: 48/48 constraints]
Escalating to Integer solving :Problem set: 0 solved, 289 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (OVERLAPS) 8/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 48/49 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 4 (OVERLAPS) 287/312 variables, 25/74 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 270/344 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 289/633 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/312 variables, 0/633 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 8 (OVERLAPS) 1/313 variables, 1/634 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/313 variables, 0/634 constraints. Problems are: Problem set: 0 solved, 289 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 313/313 variables, and 634 constraints, problems are : Problem set: 0 solved, 289 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 271/271 constraints, PredecessorRefiner: 289/289 constraints, Known Traps: 48/48 constraints]
After SMT, in 48620ms problems are : Problem set: 0 solved, 289 unsolved
Search for dead transitions found 0 dead transitions in 48623ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 48766 ms. Remains : 25/25 places, 297/297 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 97 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 32 steps (0 resets) in 7 ms. (4 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 3 factoid took 96 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 78 ms :[(NOT p1), (NOT p1)]
[2024-05-29 13:50:08] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
[2024-05-29 13:50:08] [INFO ] Invariant cache hit.
[2024-05-29 13:50:08] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-29 13:50:08] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2024-05-29 13:50:08] [INFO ] State equation strengthened by 271 read => feed constraints.
[2024-05-29 13:50:08] [INFO ] [Real]Added 271 Read/Feed constraints in 28 ms returned sat
[2024-05-29 13:50:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 13:50:08] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-29 13:50:08] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2024-05-29 13:50:08] [INFO ] [Nat]Added 271 Read/Feed constraints in 30 ms returned sat
[2024-05-29 13:50:08] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 280 transitions) in 19 ms.
[2024-05-29 13:50:08] [INFO ] Added : 0 causal constraints over 0 iterations in 55 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 76 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 11111 reset in 650 ms.
Product exploration explored 100000 steps with 11111 reset in 656 ms.
Built C files in :
/tmp/ltsmin8288682289371144245
[2024-05-29 13:50:10] [INFO ] Computing symmetric may disable matrix : 297 transitions.
[2024-05-29 13:50:10] [INFO ] Computation of Complete disable matrix. took 17 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 13:50:10] [INFO ] Computing symmetric may enable matrix : 297 transitions.
[2024-05-29 13:50:10] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 13:50:10] [INFO ] Computing Do-Not-Accords matrix : 297 transitions.
[2024-05-29 13:50:10] [INFO ] Computation of Completed DNA matrix. took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 13:50:10] [INFO ] Built C files in 74ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8288682289371144245
Running compilation step : cd /tmp/ltsmin8288682289371144245;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1102 ms.
Running link step : cd /tmp/ltsmin8288682289371144245;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin8288682289371144245;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13909917288250824787.hoa' '--buchi-type=spotba'
LTSmin run took 358 ms.
FORMULA StigmergyCommit-PT-07a-LTLFireability-11 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property StigmergyCommit-PT-07a-LTLFireability-11 finished in 103358 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||G(p1))))'
Support contains 9 out of 101 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 652/652 transitions.
Applied a total of 0 rules in 2 ms. Remains 101 /101 variables (removed 0) and now considering 652/652 (removed 0) transitions.
[2024-05-29 13:50:11] [INFO ] Flow matrix only has 642 transitions (discarded 10 similar events)
// Phase 1: matrix 642 rows 101 cols
[2024-05-29 13:50:11] [INFO ] Computed 2 invariants in 4 ms
[2024-05-29 13:50:11] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-29 13:50:11] [INFO ] Flow matrix only has 642 transitions (discarded 10 similar events)
[2024-05-29 13:50:11] [INFO ] Invariant cache hit.
[2024-05-29 13:50:11] [INFO ] State equation strengthened by 517 read => feed constraints.
[2024-05-29 13:50:12] [INFO ] Implicit Places using invariants and state equation in 168 ms returned []
Implicit Place search using SMT with State Equation took 206 ms to find 0 implicit places.
Running 651 sub problems to find dead transitions.
[2024-05-29 13:50:12] [INFO ] Flow matrix only has 642 transitions (discarded 10 similar events)
[2024-05-29 13:50:12] [INFO ] Invariant cache hit.
[2024-05-29 13:50:12] [INFO ] State equation strengthened by 517 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 651 unsolved
At refinement iteration 1 (OVERLAPS) 1/101 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 651 unsolved
[2024-05-29 13:50:20] [INFO ] Deduced a trap composed of 18 places in 135 ms of which 1 ms to minimize.
[2024-05-29 13:50:20] [INFO ] Deduced a trap composed of 13 places in 140 ms of which 1 ms to minimize.
[2024-05-29 13:50:20] [INFO ] Deduced a trap composed of 13 places in 133 ms of which 0 ms to minimize.
[2024-05-29 13:50:20] [INFO ] Deduced a trap composed of 13 places in 133 ms of which 1 ms to minimize.
[2024-05-29 13:50:21] [INFO ] Deduced a trap composed of 18 places in 133 ms of which 1 ms to minimize.
[2024-05-29 13:50:21] [INFO ] Deduced a trap composed of 14 places in 134 ms of which 0 ms to minimize.
[2024-05-29 13:50:21] [INFO ] Deduced a trap composed of 13 places in 113 ms of which 1 ms to minimize.
[2024-05-29 13:50:21] [INFO ] Deduced a trap composed of 13 places in 120 ms of which 1 ms to minimize.
[2024-05-29 13:50:21] [INFO ] Deduced a trap composed of 13 places in 111 ms of which 1 ms to minimize.
[2024-05-29 13:50:21] [INFO ] Deduced a trap composed of 13 places in 113 ms of which 1 ms to minimize.
[2024-05-29 13:50:21] [INFO ] Deduced a trap composed of 13 places in 112 ms of which 0 ms to minimize.
[2024-05-29 13:50:21] [INFO ] Deduced a trap composed of 13 places in 112 ms of which 1 ms to minimize.
[2024-05-29 13:50:22] [INFO ] Deduced a trap composed of 13 places in 111 ms of which 0 ms to minimize.
[2024-05-29 13:50:22] [INFO ] Deduced a trap composed of 13 places in 97 ms of which 1 ms to minimize.
[2024-05-29 13:50:22] [INFO ] Deduced a trap composed of 14 places in 97 ms of which 0 ms to minimize.
[2024-05-29 13:50:22] [INFO ] Deduced a trap composed of 13 places in 82 ms of which 1 ms to minimize.
[2024-05-29 13:50:22] [INFO ] Deduced a trap composed of 14 places in 103 ms of which 1 ms to minimize.
[2024-05-29 13:50:22] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 0 ms to minimize.
[2024-05-29 13:50:22] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 1 ms to minimize.
[2024-05-29 13:50:22] [INFO ] Deduced a trap composed of 18 places in 81 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 651 unsolved
[2024-05-29 13:50:22] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 1 ms to minimize.
[2024-05-29 13:50:22] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 1 ms to minimize.
[2024-05-29 13:50:23] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 1 ms to minimize.
[2024-05-29 13:50:23] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 0 ms to minimize.
[2024-05-29 13:50:23] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 0 ms to minimize.
[2024-05-29 13:50:23] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 0 ms to minimize.
[2024-05-29 13:50:23] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 1 ms to minimize.
[2024-05-29 13:50:23] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 1 ms to minimize.
[2024-05-29 13:50:23] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 0 ms to minimize.
[2024-05-29 13:50:23] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 0 ms to minimize.
[2024-05-29 13:50:23] [INFO ] Deduced a trap composed of 13 places in 85 ms of which 1 ms to minimize.
[2024-05-29 13:50:23] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 1 ms to minimize.
[2024-05-29 13:50:23] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 1 ms to minimize.
[2024-05-29 13:50:23] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 0 ms to minimize.
[2024-05-29 13:50:23] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 0 ms to minimize.
[2024-05-29 13:50:23] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 0 ms to minimize.
[2024-05-29 13:50:24] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2024-05-29 13:50:24] [INFO ] Deduced a trap composed of 13 places in 201 ms of which 1 ms to minimize.
[2024-05-29 13:50:24] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 1 ms to minimize.
[2024-05-29 13:50:24] [INFO ] Deduced a trap composed of 15 places in 107 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 651 unsolved
[2024-05-29 13:50:26] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 0 ms to minimize.
[2024-05-29 13:50:26] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 0 ms to minimize.
[2024-05-29 13:50:26] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2024-05-29 13:50:26] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 1 ms to minimize.
[2024-05-29 13:50:26] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 0 ms to minimize.
[2024-05-29 13:50:26] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 1 ms to minimize.
[2024-05-29 13:50:26] [INFO ] Deduced a trap composed of 18 places in 71 ms of which 1 ms to minimize.
[2024-05-29 13:50:26] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 1 ms to minimize.
[2024-05-29 13:50:26] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
[2024-05-29 13:50:26] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 0 ms to minimize.
[2024-05-29 13:50:26] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 1 ms to minimize.
[2024-05-29 13:50:27] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 0 ms to minimize.
[2024-05-29 13:50:27] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 0 ms to minimize.
[2024-05-29 13:50:27] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 0 ms to minimize.
[2024-05-29 13:50:27] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 0 ms to minimize.
[2024-05-29 13:50:28] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 0 ms to minimize.
[2024-05-29 13:50:28] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-05-29 13:50:28] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 0 ms to minimize.
[2024-05-29 13:50:28] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 19/61 constraints. Problems are: Problem set: 0 solved, 651 unsolved
[2024-05-29 13:50:29] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 0 ms to minimize.
[2024-05-29 13:50:29] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 0 ms to minimize.
[2024-05-29 13:50:29] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
[2024-05-29 13:50:29] [INFO ] Deduced a trap composed of 18 places in 88 ms of which 0 ms to minimize.
[2024-05-29 13:50:29] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 0 ms to minimize.
[2024-05-29 13:50:29] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 0 ms to minimize.
[2024-05-29 13:50:29] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 0 ms to minimize.
[2024-05-29 13:50:29] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 0 ms to minimize.
[2024-05-29 13:50:29] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 0 ms to minimize.
[2024-05-29 13:50:29] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 0 ms to minimize.
[2024-05-29 13:50:30] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 0 ms to minimize.
[2024-05-29 13:50:30] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 0 ms to minimize.
[2024-05-29 13:50:31] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/101 variables, 13/74 constraints. Problems are: Problem set: 0 solved, 651 unsolved
[2024-05-29 13:50:31] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 0 ms to minimize.
[2024-05-29 13:50:32] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 0 ms to minimize.
[2024-05-29 13:50:32] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 0 ms to minimize.
[2024-05-29 13:50:32] [INFO ] Deduced a trap composed of 17 places in 85 ms of which 1 ms to minimize.
[2024-05-29 13:50:32] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 0 ms to minimize.
[2024-05-29 13:50:32] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 0 ms to minimize.
[2024-05-29 13:50:32] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 0 ms to minimize.
[2024-05-29 13:50:32] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 0 ms to minimize.
[2024-05-29 13:50:32] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 1 ms to minimize.
[2024-05-29 13:50:32] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/101 variables, 10/84 constraints. Problems are: Problem set: 0 solved, 651 unsolved
[2024-05-29 13:50:36] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 1 ms to minimize.
[2024-05-29 13:50:37] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/101 variables, 2/86 constraints. Problems are: Problem set: 0 solved, 651 unsolved
[2024-05-29 13:50:38] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
[2024-05-29 13:50:38] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 1 ms to minimize.
[2024-05-29 13:50:38] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 1 ms to minimize.
[2024-05-29 13:50:38] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2024-05-29 13:50:38] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 1 ms to minimize.
[2024-05-29 13:50:38] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 0 ms to minimize.
[2024-05-29 13:50:38] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 0 ms to minimize.
[2024-05-29 13:50:38] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 1 ms to minimize.
[2024-05-29 13:50:38] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2024-05-29 13:50:38] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
[2024-05-29 13:50:38] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 0 ms to minimize.
[2024-05-29 13:50:38] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 0 ms to minimize.
[2024-05-29 13:50:40] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 0 ms to minimize.
[2024-05-29 13:50:40] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 0 ms to minimize.
[2024-05-29 13:50:40] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-05-29 13:50:40] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 0 ms to minimize.
[2024-05-29 13:50:40] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 1 ms to minimize.
[2024-05-29 13:50:40] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/101 variables, 18/104 constraints. Problems are: Problem set: 0 solved, 651 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/101 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 651 unsolved
At refinement iteration 10 (OVERLAPS) 641/742 variables, 101/205 constraints. Problems are: Problem set: 0 solved, 651 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/742 variables, 516/721 constraints. Problems are: Problem set: 0 solved, 651 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 742/743 variables, and 721 constraints, problems are : Problem set: 0 solved, 651 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 101/101 constraints, ReadFeed: 516/517 constraints, PredecessorRefiner: 651/651 constraints, Known Traps: 102/102 constraints]
Escalating to Integer solving :Problem set: 0 solved, 651 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 651 unsolved
At refinement iteration 1 (OVERLAPS) 1/101 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 651 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 102/104 constraints. Problems are: Problem set: 0 solved, 651 unsolved
[2024-05-29 13:50:50] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 0 ms to minimize.
[2024-05-29 13:50:50] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 2/106 constraints. Problems are: Problem set: 0 solved, 651 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 651 unsolved
At refinement iteration 5 (OVERLAPS) 641/742 variables, 101/207 constraints. Problems are: Problem set: 0 solved, 651 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/742 variables, 516/723 constraints. Problems are: Problem set: 0 solved, 651 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/742 variables, 651/1374 constraints. Problems are: Problem set: 0 solved, 651 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 742/743 variables, and 1374 constraints, problems are : Problem set: 0 solved, 651 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 101/101 constraints, ReadFeed: 516/517 constraints, PredecessorRefiner: 651/651 constraints, Known Traps: 104/104 constraints]
After SMT, in 65875ms problems are : Problem set: 0 solved, 651 unsolved
Search for dead transitions found 0 dead transitions in 65881ms
Finished structural reductions in LTL mode , in 1 iterations and 66091 ms. Remains : 101/101 places, 652/652 transitions.
Stuttering acceptance computed with spot in 127 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : StigmergyCommit-PT-07a-LTLFireability-12
Product exploration explored 100000 steps with 1923 reset in 323 ms.
Product exploration explored 100000 steps with 1923 reset in 334 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 91 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 199 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
RANDOM walk for 40000 steps (17 resets) in 1240 ms. (32 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 151 ms. (263 steps per ms) remains 1/1 properties
[2024-05-29 13:51:19] [INFO ] Flow matrix only has 642 transitions (discarded 10 similar events)
[2024-05-29 13:51:19] [INFO ] Invariant cache hit.
[2024-05-29 13:51:19] [INFO ] State equation strengthened by 517 read => feed constraints.
Problem apf0 is UNSAT
After SMT solving in domain Real declared 9/743 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 21 ms.
Refiners :[Positive P Invariants (semi-flows): 0/2 constraints, State Equation: 0/101 constraints, ReadFeed: 0/517 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 111ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (G (OR (NOT p0) (NOT p1)))]
False Knowledge obtained : [(F p0), (F (NOT (OR (NOT p0) p1))), (F (NOT p1)), (F (NOT (OR p0 p1))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 10 factoid took 231 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 154 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false]
Stuttering acceptance computed with spot in 210 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false]
Support contains 9 out of 101 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 101/101 places, 652/652 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 100 transition count 626
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 50 place count 75 transition count 626
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 50 place count 75 transition count 618
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 66 place count 67 transition count 618
Performed 24 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 114 place count 43 transition count 586
Ensure Unique test removed 256 transitions
Reduce isomorphic transitions removed 256 transitions.
Iterating post reduction 2 with 256 rules applied. Total rules applied 370 place count 43 transition count 330
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 384 place count 36 transition count 323
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 391 place count 36 transition count 316
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 399 place count 36 transition count 308
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 415 place count 28 transition count 300
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 416 place count 28 transition count 300
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 417 place count 27 transition count 299
Applied a total of 417 rules in 76 ms. Remains 27 /101 variables (removed 74) and now considering 299/652 (removed 353) transitions.
[2024-05-29 13:51:20] [INFO ] Flow matrix only has 289 transitions (discarded 10 similar events)
// Phase 1: matrix 289 rows 27 cols
[2024-05-29 13:51:20] [INFO ] Computed 2 invariants in 3 ms
[2024-05-29 13:51:20] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-29 13:51:20] [INFO ] Flow matrix only has 289 transitions (discarded 10 similar events)
[2024-05-29 13:51:20] [INFO ] Invariant cache hit.
[2024-05-29 13:51:20] [INFO ] State equation strengthened by 271 read => feed constraints.
[2024-05-29 13:51:20] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
[2024-05-29 13:51:20] [INFO ] Redundant transitions in 5 ms returned []
Running 291 sub problems to find dead transitions.
[2024-05-29 13:51:20] [INFO ] Flow matrix only has 289 transitions (discarded 10 similar events)
[2024-05-29 13:51:20] [INFO ] Invariant cache hit.
[2024-05-29 13:51:20] [INFO ] State equation strengthened by 271 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 1 (OVERLAPS) 8/27 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 291 unsolved
[2024-05-29 13:51:22] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2024-05-29 13:51:22] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-29 13:51:22] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-05-29 13:51:22] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2024-05-29 13:51:22] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
[2024-05-29 13:51:22] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2024-05-29 13:51:22] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2024-05-29 13:51:22] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2024-05-29 13:51:22] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-05-29 13:51:22] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2024-05-29 13:51:22] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 0 ms to minimize.
[2024-05-29 13:51:22] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 0 ms to minimize.
[2024-05-29 13:51:22] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 0 ms to minimize.
[2024-05-29 13:51:22] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 0 ms to minimize.
[2024-05-29 13:51:22] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2024-05-29 13:51:22] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 0 ms to minimize.
[2024-05-29 13:51:22] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
[2024-05-29 13:51:22] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-05-29 13:51:22] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 1 ms to minimize.
[2024-05-29 13:51:22] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 291 unsolved
[2024-05-29 13:51:23] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-29 13:51:23] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-29 13:51:23] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-29 13:51:23] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2024-05-29 13:51:23] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-29 13:51:23] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-05-29 13:51:23] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-29 13:51:23] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
[2024-05-29 13:51:23] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 9/31 constraints. Problems are: Problem set: 0 solved, 291 unsolved
[2024-05-29 13:51:23] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
[2024-05-29 13:51:23] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/27 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 6 (OVERLAPS) 288/315 variables, 27/60 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/315 variables, 270/330 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/315 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 9 (OVERLAPS) 1/316 variables, 1/331 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/316 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 11 (OVERLAPS) 0/316 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 291 unsolved
No progress, stopping.
After SMT solving in domain Real declared 316/316 variables, and 331 constraints, problems are : Problem set: 0 solved, 291 unsolved in 14027 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 27/27 constraints, ReadFeed: 271/271 constraints, PredecessorRefiner: 291/291 constraints, Known Traps: 31/31 constraints]
Escalating to Integer solving :Problem set: 0 solved, 291 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 1 (OVERLAPS) 8/27 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 31/33 constraints. Problems are: Problem set: 0 solved, 291 unsolved
[2024-05-29 13:51:36] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 0 ms to minimize.
[2024-05-29 13:51:36] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 0 ms to minimize.
[2024-05-29 13:51:36] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 0 ms to minimize.
[2024-05-29 13:51:36] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
[2024-05-29 13:51:36] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
[2024-05-29 13:51:36] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-05-29 13:51:36] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
[2024-05-29 13:51:36] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2024-05-29 13:51:36] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2024-05-29 13:51:36] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-05-29 13:51:36] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-29 13:51:36] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-05-29 13:51:36] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 13/46 constraints. Problems are: Problem set: 0 solved, 291 unsolved
[2024-05-29 13:51:37] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 1 ms to minimize.
[2024-05-29 13:51:37] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2024-05-29 13:51:37] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2024-05-29 13:51:37] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-29 13:51:37] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2024-05-29 13:51:37] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2024-05-29 13:51:37] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 0 ms to minimize.
[2024-05-29 13:51:37] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 8/54 constraints. Problems are: Problem set: 0 solved, 291 unsolved
[2024-05-29 13:51:37] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2024-05-29 13:51:37] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 1 ms to minimize.
[2024-05-29 13:51:37] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 0 ms to minimize.
[2024-05-29 13:51:37] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 1 ms to minimize.
[2024-05-29 13:51:37] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 0 ms to minimize.
[2024-05-29 13:51:38] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 0 ms to minimize.
[2024-05-29 13:51:38] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2024-05-29 13:51:38] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/27 variables, 8/62 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/27 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 7 (OVERLAPS) 288/315 variables, 27/89 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/315 variables, 270/359 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/315 variables, 291/650 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/315 variables, 0/650 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 11 (OVERLAPS) 1/316 variables, 1/651 constraints. Problems are: Problem set: 0 solved, 291 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 316/316 variables, and 651 constraints, problems are : Problem set: 0 solved, 291 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 27/27 constraints, ReadFeed: 271/271 constraints, PredecessorRefiner: 291/291 constraints, Known Traps: 60/60 constraints]
After SMT, in 45384ms problems are : Problem set: 0 solved, 291 unsolved
Search for dead transitions found 0 dead transitions in 45387ms
Starting structural reductions in SI_LTL mode, iteration 1 : 27/101 places, 299/652 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 45588 ms. Remains : 27/101 places, 299/652 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 114 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 193 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false]
RANDOM walk for 5084 steps (25 resets) in 100 ms. (50 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 p1))), (F p0), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 9 factoid took 204 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 182 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false]
Stuttering acceptance computed with spot in 210 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false]
Stuttering acceptance computed with spot in 190 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false]
Product exploration explored 100000 steps with 11111 reset in 681 ms.
Product exploration explored 100000 steps with 11111 reset in 689 ms.
Built C files in :
/tmp/ltsmin6987338040338164841
[2024-05-29 13:52:08] [INFO ] Computing symmetric may disable matrix : 299 transitions.
[2024-05-29 13:52:08] [INFO ] Computation of Complete disable matrix. took 43 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 13:52:08] [INFO ] Computing symmetric may enable matrix : 299 transitions.
[2024-05-29 13:52:08] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 13:52:08] [INFO ] Computing Do-Not-Accords matrix : 299 transitions.
[2024-05-29 13:52:08] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 13:52:08] [INFO ] Built C files in 88ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6987338040338164841
Running compilation step : cd /tmp/ltsmin6987338040338164841;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1109 ms.
Running link step : cd /tmp/ltsmin6987338040338164841;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin6987338040338164841;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4039308820207130181.hoa' '--buchi-type=spotba'
LTSmin run took 398 ms.
FORMULA StigmergyCommit-PT-07a-LTLFireability-12 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property StigmergyCommit-PT-07a-LTLFireability-12 finished in 118133 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 8 out of 101 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 101/101 places, 652/652 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 100 transition count 626
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 50 place count 75 transition count 626
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 50 place count 75 transition count 618
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 66 place count 67 transition count 618
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 67 place count 66 transition count 617
Iterating global reduction 2 with 1 rules applied. Total rules applied 68 place count 66 transition count 617
Performed 25 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 118 place count 41 transition count 583
Ensure Unique test removed 255 transitions
Reduce isomorphic transitions removed 255 transitions.
Iterating post reduction 2 with 255 rules applied. Total rules applied 373 place count 41 transition count 328
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 387 place count 34 transition count 321
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 394 place count 34 transition count 314
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 402 place count 34 transition count 306
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 418 place count 26 transition count 298
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 419 place count 25 transition count 297
Applied a total of 419 rules in 72 ms. Remains 25 /101 variables (removed 76) and now considering 297/652 (removed 355) transitions.
[2024-05-29 13:52:10] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
// Phase 1: matrix 288 rows 25 cols
[2024-05-29 13:52:10] [INFO ] Computed 1 invariants in 3 ms
[2024-05-29 13:52:10] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-29 13:52:10] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
[2024-05-29 13:52:10] [INFO ] Invariant cache hit.
[2024-05-29 13:52:10] [INFO ] State equation strengthened by 271 read => feed constraints.
[2024-05-29 13:52:10] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
[2024-05-29 13:52:10] [INFO ] Redundant transitions in 5 ms returned []
Running 289 sub problems to find dead transitions.
[2024-05-29 13:52:10] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
[2024-05-29 13:52:10] [INFO ] Invariant cache hit.
[2024-05-29 13:52:10] [INFO ] State equation strengthened by 271 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (OVERLAPS) 8/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-05-29 13:52:11] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-29 13:52:12] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-29 13:52:12] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2024-05-29 13:52:12] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 0 ms to minimize.
[2024-05-29 13:52:12] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 0 ms to minimize.
[2024-05-29 13:52:12] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 1 ms to minimize.
[2024-05-29 13:52:12] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 0 ms to minimize.
[2024-05-29 13:52:12] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2024-05-29 13:52:12] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
[2024-05-29 13:52:12] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 1 ms to minimize.
[2024-05-29 13:52:12] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 0 ms to minimize.
[2024-05-29 13:52:12] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 1 ms to minimize.
[2024-05-29 13:52:12] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 1 ms to minimize.
[2024-05-29 13:52:12] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 0 ms to minimize.
[2024-05-29 13:52:12] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 0 ms to minimize.
[2024-05-29 13:52:12] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
[2024-05-29 13:52:12] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 0 ms to minimize.
[2024-05-29 13:52:12] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 0 ms to minimize.
[2024-05-29 13:52:12] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
[2024-05-29 13:52:12] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-05-29 13:52:13] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-29 13:52:13] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-29 13:52:13] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2024-05-29 13:52:13] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2024-05-29 13:52:13] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2024-05-29 13:52:13] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2024-05-29 13:52:13] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-29 13:52:13] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2024-05-29 13:52:13] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2024-05-29 13:52:13] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2024-05-29 13:52:13] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-29 13:52:13] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-29 13:52:13] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
[2024-05-29 13:52:13] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 0 ms to minimize.
[2024-05-29 13:52:13] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-29 13:52:13] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2024-05-29 13:52:13] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-29 13:52:13] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
[2024-05-29 13:52:13] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2024-05-29 13:52:13] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-05-29 13:52:13] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 0 ms to minimize.
[2024-05-29 13:52:14] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2024-05-29 13:52:14] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2024-05-29 13:52:14] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 4/45 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-05-29 13:52:14] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2024-05-29 13:52:14] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-05-29 13:52:14] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
[2024-05-29 13:52:14] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/25 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 8 (OVERLAPS) 287/312 variables, 25/74 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/312 variables, 270/344 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/312 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 11 (OVERLAPS) 1/313 variables, 1/345 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/313 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 13 (OVERLAPS) 0/313 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 289 unsolved
No progress, stopping.
After SMT solving in domain Real declared 313/313 variables, and 345 constraints, problems are : Problem set: 0 solved, 289 unsolved in 17470 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 271/271 constraints, PredecessorRefiner: 289/289 constraints, Known Traps: 48/48 constraints]
Escalating to Integer solving :Problem set: 0 solved, 289 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (OVERLAPS) 8/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 48/49 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 4 (OVERLAPS) 287/312 variables, 25/74 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 270/344 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 289/633 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/312 variables, 0/633 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 8 (OVERLAPS) 1/313 variables, 1/634 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/313 variables, 0/634 constraints. Problems are: Problem set: 0 solved, 289 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 313/313 variables, and 634 constraints, problems are : Problem set: 0 solved, 289 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 271/271 constraints, PredecessorRefiner: 289/289 constraints, Known Traps: 48/48 constraints]
After SMT, in 48821ms problems are : Problem set: 0 solved, 289 unsolved
Search for dead transitions found 0 dead transitions in 48824ms
Starting structural reductions in SI_LTL mode, iteration 1 : 25/101 places, 297/652 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 49018 ms. Remains : 25/101 places, 297/652 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-07a-LTLFireability-14
Product exploration explored 100000 steps with 11111 reset in 651 ms.
Product exploration explored 100000 steps with 11111 reset in 656 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 79 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
RANDOM walk for 32 steps (0 resets) in 6 ms. (4 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 113 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
[2024-05-29 13:53:00] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
[2024-05-29 13:53:00] [INFO ] Invariant cache hit.
[2024-05-29 13:53:00] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-29 13:53:00] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2024-05-29 13:53:00] [INFO ] State equation strengthened by 271 read => feed constraints.
[2024-05-29 13:53:00] [INFO ] [Real]Added 271 Read/Feed constraints in 29 ms returned sat
[2024-05-29 13:53:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 13:53:00] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-29 13:53:01] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2024-05-29 13:53:01] [INFO ] [Nat]Added 271 Read/Feed constraints in 30 ms returned sat
[2024-05-29 13:53:01] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 280 transitions) in 19 ms.
[2024-05-29 13:53:01] [INFO ] Added : 0 causal constraints over 0 iterations in 42 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 8 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 297/297 transitions.
Applied a total of 0 rules in 16 ms. Remains 25 /25 variables (removed 0) and now considering 297/297 (removed 0) transitions.
[2024-05-29 13:53:01] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
[2024-05-29 13:53:01] [INFO ] Invariant cache hit.
[2024-05-29 13:53:01] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-29 13:53:01] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
[2024-05-29 13:53:01] [INFO ] Invariant cache hit.
[2024-05-29 13:53:01] [INFO ] State equation strengthened by 271 read => feed constraints.
[2024-05-29 13:53:01] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
[2024-05-29 13:53:01] [INFO ] Redundant transitions in 8 ms returned []
Running 289 sub problems to find dead transitions.
[2024-05-29 13:53:01] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
[2024-05-29 13:53:01] [INFO ] Invariant cache hit.
[2024-05-29 13:53:01] [INFO ] State equation strengthened by 271 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (OVERLAPS) 8/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-05-29 13:53:03] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-29 13:53:03] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-29 13:53:03] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-29 13:53:03] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 0 ms to minimize.
[2024-05-29 13:53:03] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 0 ms to minimize.
[2024-05-29 13:53:03] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 1 ms to minimize.
[2024-05-29 13:53:03] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 0 ms to minimize.
[2024-05-29 13:53:03] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-05-29 13:53:03] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2024-05-29 13:53:03] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 1 ms to minimize.
[2024-05-29 13:53:03] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 0 ms to minimize.
[2024-05-29 13:53:03] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 0 ms to minimize.
[2024-05-29 13:53:03] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 0 ms to minimize.
[2024-05-29 13:53:03] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
[2024-05-29 13:53:03] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 1 ms to minimize.
[2024-05-29 13:53:03] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 0 ms to minimize.
[2024-05-29 13:53:03] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 0 ms to minimize.
[2024-05-29 13:53:03] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 0 ms to minimize.
[2024-05-29 13:53:03] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 0 ms to minimize.
[2024-05-29 13:53:04] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-05-29 13:53:04] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-29 13:53:04] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-29 13:53:04] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-05-29 13:53:04] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-29 13:53:04] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2024-05-29 13:53:04] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2024-05-29 13:53:04] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-29 13:53:04] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
[2024-05-29 13:53:04] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2024-05-29 13:53:04] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-05-29 13:53:04] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-29 13:53:04] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-29 13:53:04] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
[2024-05-29 13:53:04] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2024-05-29 13:53:04] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-29 13:53:04] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-29 13:53:04] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-29 13:53:04] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 0 ms to minimize.
[2024-05-29 13:53:04] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2024-05-29 13:53:04] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-05-29 13:53:05] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 0 ms to minimize.
[2024-05-29 13:53:05] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2024-05-29 13:53:05] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2024-05-29 13:53:05] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 4/45 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-05-29 13:53:05] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2024-05-29 13:53:05] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-05-29 13:53:05] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
[2024-05-29 13:53:05] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/25 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 8 (OVERLAPS) 287/312 variables, 25/74 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/312 variables, 270/344 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/312 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 11 (OVERLAPS) 1/313 variables, 1/345 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/313 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 13 (OVERLAPS) 0/313 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 289 unsolved
No progress, stopping.
After SMT solving in domain Real declared 313/313 variables, and 345 constraints, problems are : Problem set: 0 solved, 289 unsolved in 17023 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 271/271 constraints, PredecessorRefiner: 289/289 constraints, Known Traps: 48/48 constraints]
Escalating to Integer solving :Problem set: 0 solved, 289 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (OVERLAPS) 8/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 48/49 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 4 (OVERLAPS) 287/312 variables, 25/74 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 270/344 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 289/633 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/312 variables, 0/633 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 8 (OVERLAPS) 1/313 variables, 1/634 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/313 variables, 0/634 constraints. Problems are: Problem set: 0 solved, 289 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 313/313 variables, and 634 constraints, problems are : Problem set: 0 solved, 289 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 271/271 constraints, PredecessorRefiner: 289/289 constraints, Known Traps: 48/48 constraints]
After SMT, in 48373ms problems are : Problem set: 0 solved, 289 unsolved
Search for dead transitions found 0 dead transitions in 48376ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 48517 ms. Remains : 25/25 places, 297/297 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 78 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
RANDOM walk for 32 steps (0 resets) in 4 ms. (6 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 118 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
[2024-05-29 13:53:49] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
[2024-05-29 13:53:49] [INFO ] Invariant cache hit.
[2024-05-29 13:53:50] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-29 13:53:50] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2024-05-29 13:53:50] [INFO ] State equation strengthened by 271 read => feed constraints.
[2024-05-29 13:53:50] [INFO ] [Real]Added 271 Read/Feed constraints in 30 ms returned sat
[2024-05-29 13:53:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 13:53:50] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-29 13:53:50] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2024-05-29 13:53:50] [INFO ] [Nat]Added 271 Read/Feed constraints in 30 ms returned sat
[2024-05-29 13:53:50] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 280 transitions) in 19 ms.
[2024-05-29 13:53:50] [INFO ] Added : 0 causal constraints over 0 iterations in 43 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Product exploration explored 100000 steps with 11111 reset in 651 ms.
Product exploration explored 100000 steps with 11111 reset in 657 ms.
Built C files in :
/tmp/ltsmin8103154692494445995
[2024-05-29 13:53:51] [INFO ] Computing symmetric may disable matrix : 297 transitions.
[2024-05-29 13:53:51] [INFO ] Computation of Complete disable matrix. took 17 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 13:53:51] [INFO ] Computing symmetric may enable matrix : 297 transitions.
[2024-05-29 13:53:51] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 13:53:51] [INFO ] Computing Do-Not-Accords matrix : 297 transitions.
[2024-05-29 13:53:51] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 13:53:51] [INFO ] Built C files in 61ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8103154692494445995
Running compilation step : cd /tmp/ltsmin8103154692494445995;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1105 ms.
Running link step : cd /tmp/ltsmin8103154692494445995;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin8103154692494445995;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased9806884130605428908.hoa' '--buchi-type=spotba'
LTSmin run took 591 ms.
FORMULA StigmergyCommit-PT-07a-LTLFireability-14 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property StigmergyCommit-PT-07a-LTLFireability-14 finished in 103641 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((G(F(!p0)) U p0)))))'
Support contains 8 out of 101 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 652/652 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 100 transition count 651
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 100 transition count 651
Applied a total of 2 rules in 3 ms. Remains 100 /101 variables (removed 1) and now considering 651/652 (removed 1) transitions.
[2024-05-29 13:53:53] [INFO ] Flow matrix only has 642 transitions (discarded 9 similar events)
// Phase 1: matrix 642 rows 100 cols
[2024-05-29 13:53:53] [INFO ] Computed 1 invariants in 5 ms
[2024-05-29 13:53:53] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-29 13:53:53] [INFO ] Flow matrix only has 642 transitions (discarded 9 similar events)
[2024-05-29 13:53:53] [INFO ] Invariant cache hit.
[2024-05-29 13:53:53] [INFO ] State equation strengthened by 517 read => feed constraints.
[2024-05-29 13:53:53] [INFO ] Implicit Places using invariants and state equation in 174 ms returned []
Implicit Place search using SMT with State Equation took 206 ms to find 0 implicit places.
Running 650 sub problems to find dead transitions.
[2024-05-29 13:53:53] [INFO ] Flow matrix only has 642 transitions (discarded 9 similar events)
[2024-05-29 13:53:53] [INFO ] Invariant cache hit.
[2024-05-29 13:53:53] [INFO ] State equation strengthened by 517 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 1 (OVERLAPS) 1/100 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-29 13:54:02] [INFO ] Deduced a trap composed of 17 places in 136 ms of which 0 ms to minimize.
[2024-05-29 13:54:02] [INFO ] Deduced a trap composed of 18 places in 132 ms of which 1 ms to minimize.
[2024-05-29 13:54:02] [INFO ] Deduced a trap composed of 13 places in 130 ms of which 0 ms to minimize.
[2024-05-29 13:54:02] [INFO ] Deduced a trap composed of 14 places in 136 ms of which 0 ms to minimize.
[2024-05-29 13:54:02] [INFO ] Deduced a trap composed of 14 places in 136 ms of which 0 ms to minimize.
[2024-05-29 13:54:02] [INFO ] Deduced a trap composed of 13 places in 110 ms of which 1 ms to minimize.
[2024-05-29 13:54:02] [INFO ] Deduced a trap composed of 13 places in 115 ms of which 1 ms to minimize.
[2024-05-29 13:54:03] [INFO ] Deduced a trap composed of 13 places in 117 ms of which 1 ms to minimize.
[2024-05-29 13:54:03] [INFO ] Deduced a trap composed of 15 places in 112 ms of which 1 ms to minimize.
[2024-05-29 13:54:03] [INFO ] Deduced a trap composed of 13 places in 124 ms of which 0 ms to minimize.
[2024-05-29 13:54:03] [INFO ] Deduced a trap composed of 13 places in 99 ms of which 1 ms to minimize.
[2024-05-29 13:54:03] [INFO ] Deduced a trap composed of 13 places in 102 ms of which 0 ms to minimize.
[2024-05-29 13:54:03] [INFO ] Deduced a trap composed of 14 places in 99 ms of which 1 ms to minimize.
[2024-05-29 13:54:03] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 1 ms to minimize.
[2024-05-29 13:54:03] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 1 ms to minimize.
[2024-05-29 13:54:03] [INFO ] Deduced a trap composed of 13 places in 87 ms of which 1 ms to minimize.
[2024-05-29 13:54:03] [INFO ] Deduced a trap composed of 13 places in 118 ms of which 1 ms to minimize.
[2024-05-29 13:54:04] [INFO ] Deduced a trap composed of 15 places in 116 ms of which 0 ms to minimize.
[2024-05-29 13:54:04] [INFO ] Deduced a trap composed of 13 places in 112 ms of which 1 ms to minimize.
[2024-05-29 13:54:04] [INFO ] Deduced a trap composed of 14 places in 102 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-29 13:54:04] [INFO ] Deduced a trap composed of 13 places in 88 ms of which 1 ms to minimize.
[2024-05-29 13:54:04] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 0 ms to minimize.
[2024-05-29 13:54:04] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 1 ms to minimize.
[2024-05-29 13:54:04] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 0 ms to minimize.
[2024-05-29 13:54:04] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 1 ms to minimize.
[2024-05-29 13:54:04] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-05-29 13:54:04] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 1 ms to minimize.
[2024-05-29 13:54:05] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 1 ms to minimize.
[2024-05-29 13:54:05] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 1 ms to minimize.
[2024-05-29 13:54:05] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 1 ms to minimize.
[2024-05-29 13:54:05] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2024-05-29 13:54:05] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 1 ms to minimize.
[2024-05-29 13:54:05] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 0 ms to minimize.
[2024-05-29 13:54:05] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 1 ms to minimize.
[2024-05-29 13:54:05] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 0 ms to minimize.
[2024-05-29 13:54:05] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 1 ms to minimize.
[2024-05-29 13:54:05] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 1 ms to minimize.
[2024-05-29 13:54:05] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2024-05-29 13:54:05] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 0 ms to minimize.
[2024-05-29 13:54:05] [INFO ] Deduced a trap composed of 13 places in 84 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-29 13:54:07] [INFO ] Deduced a trap composed of 13 places in 89 ms of which 1 ms to minimize.
[2024-05-29 13:54:07] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 1 ms to minimize.
[2024-05-29 13:54:07] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 1 ms to minimize.
[2024-05-29 13:54:07] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 1 ms to minimize.
[2024-05-29 13:54:07] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 0 ms to minimize.
[2024-05-29 13:54:07] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 0 ms to minimize.
[2024-05-29 13:54:07] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 1 ms to minimize.
[2024-05-29 13:54:07] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 0 ms to minimize.
[2024-05-29 13:54:07] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 0 ms to minimize.
[2024-05-29 13:54:08] [INFO ] Deduced a trap composed of 13 places in 214 ms of which 0 ms to minimize.
[2024-05-29 13:54:08] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 0 ms to minimize.
[2024-05-29 13:54:08] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-05-29 13:54:08] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 0 ms to minimize.
[2024-05-29 13:54:08] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 0 ms to minimize.
[2024-05-29 13:54:08] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 0 ms to minimize.
[2024-05-29 13:54:08] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 0 ms to minimize.
[2024-05-29 13:54:08] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 1 ms to minimize.
[2024-05-29 13:54:08] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 1 ms to minimize.
[2024-05-29 13:54:10] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 0 ms to minimize.
[2024-05-29 13:54:10] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-29 13:54:10] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 1 ms to minimize.
[2024-05-29 13:54:10] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 1 ms to minimize.
[2024-05-29 13:54:10] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 0 ms to minimize.
[2024-05-29 13:54:11] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 0 ms to minimize.
[2024-05-29 13:54:11] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2024-05-29 13:54:11] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 0 ms to minimize.
[2024-05-29 13:54:11] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 0 ms to minimize.
[2024-05-29 13:54:11] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 0 ms to minimize.
[2024-05-29 13:54:11] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
[2024-05-29 13:54:11] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
[2024-05-29 13:54:11] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 1 ms to minimize.
[2024-05-29 13:54:11] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 1 ms to minimize.
[2024-05-29 13:54:11] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 0 ms to minimize.
[2024-05-29 13:54:11] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2024-05-29 13:54:11] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 0 ms to minimize.
[2024-05-29 13:54:11] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
[2024-05-29 13:54:12] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 1 ms to minimize.
[2024-05-29 13:54:12] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 0 ms to minimize.
[2024-05-29 13:54:12] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 0 ms to minimize.
[2024-05-29 13:54:12] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-29 13:54:12] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 0 ms to minimize.
[2024-05-29 13:54:12] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 0 ms to minimize.
[2024-05-29 13:54:12] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 0 ms to minimize.
[2024-05-29 13:54:13] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 1 ms to minimize.
[2024-05-29 13:54:13] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 0 ms to minimize.
[2024-05-29 13:54:13] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 1 ms to minimize.
[2024-05-29 13:54:13] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
[2024-05-29 13:54:13] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 0 ms to minimize.
[2024-05-29 13:54:14] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 1 ms to minimize.
[2024-05-29 13:54:14] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 1 ms to minimize.
[2024-05-29 13:54:15] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 1 ms to minimize.
[2024-05-29 13:54:15] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 12/93 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/100 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 8 (OVERLAPS) 641/741 variables, 100/193 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/741 variables, 516/709 constraints. Problems are: Problem set: 0 solved, 650 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 741/742 variables, and 709 constraints, problems are : Problem set: 0 solved, 650 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 100/100 constraints, ReadFeed: 516/517 constraints, PredecessorRefiner: 650/650 constraints, Known Traps: 92/92 constraints]
Escalating to Integer solving :Problem set: 0 solved, 650 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 1 (OVERLAPS) 1/100 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 92/93 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-29 13:54:34] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 5 (OVERLAPS) 641/741 variables, 100/194 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/741 variables, 516/710 constraints. Problems are: Problem set: 0 solved, 650 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 741/742 variables, and 1360 constraints, problems are : Problem set: 0 solved, 650 unsolved in 30567 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 100/100 constraints, ReadFeed: 516/517 constraints, PredecessorRefiner: 650/650 constraints, Known Traps: 93/93 constraints]
After SMT, in 66337ms problems are : Problem set: 0 solved, 650 unsolved
Search for dead transitions found 0 dead transitions in 66344ms
Starting structural reductions in LTL mode, iteration 1 : 100/101 places, 651/652 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 66555 ms. Remains : 100/101 places, 651/652 transitions.
Stuttering acceptance computed with spot in 372 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), p0, p0]
Running random walk in product with property : StigmergyCommit-PT-07a-LTLFireability-15
Stuttering criterion allowed to conclude after 51 steps with 0 reset in 1 ms.
FORMULA StigmergyCommit-PT-07a-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-07a-LTLFireability-15 finished in 66945 ms.
All properties solved by simple procedures.
Total runtime 1277158 ms.

BK_STOP 1716990900585

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="StigmergyCommit-PT-07a"
export BK_EXAMINATION="LTLFireability"
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-5568"
echo " Executing tool itstools"
echo " Input is StigmergyCommit-PT-07a, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r400-tall-171690531700172"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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