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-171690532200396.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 StigmergyElection-PT-11a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r400-tall-171690532200396
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 154M
-rw-r--r-- 1 mcc users 8.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 99K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K 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.9K Apr 23 08:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 23 08:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 08:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 08:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.5K Apr 11 21:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 59K Apr 11 21:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.2K Apr 11 20:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 24K Apr 11 20:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 08:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 08:00 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 153M May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717020645978

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyElection-PT-11a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-29 22:10:47] [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 22:10:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 22:10:52] [INFO ] Load time of PNML (sax parser for PT used): 5520 ms
[2024-05-29 22:10:53] [INFO ] Transformed 156 places.
[2024-05-29 22:10:53] [INFO ] Transformed 136650 transitions.
[2024-05-29 22:10:53] [INFO ] Found NUPN structural information;
[2024-05-29 22:10:53] [INFO ] Parsed PT model containing 156 places and 136650 transitions and 3001363 arcs in 6821 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 110 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 132345 transitions
Reduce redundant transitions removed 132345 transitions.
FORMULA StigmergyElection-PT-11a-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-11a-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-11a-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 11 out of 156 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 156/156 places, 4305/4305 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 135 transition count 4273
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 135 transition count 4273
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 53 place count 124 transition count 4251
Iterating global reduction 0 with 11 rules applied. Total rules applied 64 place count 124 transition count 4251
Applied a total of 64 rules in 82 ms. Remains 124 /156 variables (removed 32) and now considering 4251/4305 (removed 54) transitions.
[2024-05-29 22:10:55] [INFO ] Flow matrix only has 4239 transitions (discarded 12 similar events)
// Phase 1: matrix 4239 rows 124 cols
[2024-05-29 22:10:55] [INFO ] Computed 2 invariants in 70 ms
[2024-05-29 22:10:55] [INFO ] Implicit Places using invariants in 296 ms returned []
[2024-05-29 22:10:55] [INFO ] Flow matrix only has 4239 transitions (discarded 12 similar events)
[2024-05-29 22:10:55] [INFO ] Invariant cache hit.
[2024-05-29 22:10:57] [INFO ] State equation strengthened by 4148 read => feed constraints.
[2024-05-29 22:10:58] [INFO ] Implicit Places using invariants and state equation in 3119 ms returned [123]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 3460 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 123/156 places, 4251/4305 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 101 transition count 4229
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 101 transition count 4229
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 55 place count 90 transition count 4218
Iterating global reduction 0 with 11 rules applied. Total rules applied 66 place count 90 transition count 4218
Applied a total of 66 rules in 65 ms. Remains 90 /123 variables (removed 33) and now considering 4218/4251 (removed 33) transitions.
[2024-05-29 22:10:58] [INFO ] Flow matrix only has 4206 transitions (discarded 12 similar events)
// Phase 1: matrix 4206 rows 90 cols
[2024-05-29 22:10:58] [INFO ] Computed 1 invariants in 29 ms
[2024-05-29 22:10:58] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-29 22:10:58] [INFO ] Flow matrix only has 4206 transitions (discarded 12 similar events)
[2024-05-29 22:10:58] [INFO ] Invariant cache hit.
[2024-05-29 22:11:00] [INFO ] State equation strengthened by 4104 read => feed constraints.
[2024-05-29 22:11:00] [INFO ] Implicit Places using invariants and state equation in 2166 ms returned []
Implicit Place search using SMT with State Equation took 2227 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 90/156 places, 4218/4305 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 5853 ms. Remains : 90/156 places, 4218/4305 transitions.
Support contains 11 out of 90 places after structural reductions.
[2024-05-29 22:11:01] [INFO ] Flatten gal took : 560 ms
[2024-05-29 22:11:01] [INFO ] Flatten gal took : 373 ms
[2024-05-29 22:11:02] [INFO ] Input system was already deterministic with 4218 transitions.
Reduction of identical properties reduced properties to check from 8 to 3
RANDOM walk for 40000 steps (9 resets) in 12082 ms. (3 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 295 ms. (135 steps per ms) remains 1/1 properties
[2024-05-29 22:11:06] [INFO ] Flow matrix only has 4206 transitions (discarded 12 similar events)
[2024-05-29 22:11:06] [INFO ] Invariant cache hit.
[2024-05-29 22:11:07] [INFO ] State equation strengthened by 4104 read => feed constraints.
Problem AtomicPropp6 is UNSAT
After SMT solving in domain Real declared 11/4296 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 29 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1 constraints, State Equation: 0/90 constraints, ReadFeed: 0/4104 constraints, PredecessorRefiner: 0/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 1281ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
FORMULA StigmergyElection-PT-11a-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 1 stabilizing places and 1 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' '!(F((F(p1)&&p0)))'
Support contains 11 out of 90 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 90/90 places, 4218/4218 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 22 Pre rules applied. Total rules applied 0 place count 89 transition count 4195
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 0 with 44 rules applied. Total rules applied 44 place count 67 transition count 4195
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 0 with 44 rules applied. Total rules applied 88 place count 45 transition count 4173
Ensure Unique test removed 2047 transitions
Reduce isomorphic transitions removed 2047 transitions.
Iterating post reduction 0 with 2047 rules applied. Total rules applied 2135 place count 45 transition count 2126
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 1 with 11 rules applied. Total rules applied 2146 place count 45 transition count 2115
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 1 with 22 rules applied. Total rules applied 2168 place count 34 transition count 2104
Applied a total of 2168 rules in 2145 ms. Remains 34 /90 variables (removed 56) and now considering 2104/4218 (removed 2114) transitions.
[2024-05-29 22:11:09] [INFO ] Flow matrix only has 2092 transitions (discarded 12 similar events)
// Phase 1: matrix 2092 rows 34 cols
[2024-05-29 22:11:09] [INFO ] Computed 1 invariants in 11 ms
[2024-05-29 22:11:09] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-29 22:11:09] [INFO ] Flow matrix only has 2092 transitions (discarded 12 similar events)
[2024-05-29 22:11:09] [INFO ] Invariant cache hit.
[2024-05-29 22:11:10] [INFO ] State equation strengthened by 2069 read => feed constraints.
[2024-05-29 22:11:10] [INFO ] Implicit Places using invariants and state equation in 674 ms returned []
Implicit Place search using SMT with State Equation took 719 ms to find 0 implicit places.
[2024-05-29 22:11:10] [INFO ] Redundant transitions in 316 ms returned []
Running 2093 sub problems to find dead transitions.
[2024-05-29 22:11:10] [INFO ] Flow matrix only has 2092 transitions (discarded 12 similar events)
[2024-05-29 22:11:10] [INFO ] Invariant cache hit.
[2024-05-29 22:11:11] [INFO ] State equation strengthened by 2069 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 1 (OVERLAPS) 11/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
[2024-05-29 22:11:50] [INFO ] Deduced a trap composed of 4 places in 94 ms of which 4 ms to minimize.
[2024-05-29 22:11:50] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 1 ms to minimize.
[2024-05-29 22:11:50] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 0 ms to minimize.
[2024-05-29 22:11:50] [INFO ] Deduced a trap composed of 4 places in 265 ms of which 25 ms to minimize.
[2024-05-29 22:11:51] [INFO ] Deduced a trap composed of 4 places in 739 ms of which 28 ms to minimize.
[2024-05-29 22:11:52] [INFO ] Deduced a trap composed of 4 places in 433 ms of which 2 ms to minimize.
[2024-05-29 22:11:52] [INFO ] Deduced a trap composed of 4 places in 415 ms of which 1 ms to minimize.
[2024-05-29 22:11:52] [INFO ] Deduced a trap composed of 4 places in 223 ms of which 1 ms to minimize.
[2024-05-29 22:11:52] [INFO ] Deduced a trap composed of 4 places in 163 ms of which 0 ms to minimize.
[2024-05-29 22:11:53] [INFO ] Deduced a trap composed of 4 places in 697 ms of which 1 ms to minimize.
[2024-05-29 22:11:54] [INFO ] Deduced a trap composed of 4 places in 687 ms of which 1 ms to minimize.
[2024-05-29 22:11:54] [INFO ] Deduced a trap composed of 4 places in 692 ms of which 1 ms to minimize.
[2024-05-29 22:11:55] [INFO ] Deduced a trap composed of 4 places in 636 ms of which 1 ms to minimize.
[2024-05-29 22:11:56] [INFO ] Deduced a trap composed of 4 places in 688 ms of which 1 ms to minimize.
[2024-05-29 22:11:56] [INFO ] Deduced a trap composed of 4 places in 691 ms of which 2 ms to minimize.
[2024-05-29 22:11:57] [INFO ] Deduced a trap composed of 4 places in 581 ms of which 0 ms to minimize.
[2024-05-29 22:11:58] [INFO ] Deduced a trap composed of 4 places in 467 ms of which 1 ms to minimize.
[2024-05-29 22:11:58] [INFO ] Deduced a trap composed of 4 places in 447 ms of which 0 ms to minimize.
[2024-05-29 22:11:58] [INFO ] Deduced a trap composed of 4 places in 342 ms of which 1 ms to minimize.
[2024-05-29 22:11:59] [INFO ] Deduced a trap composed of 4 places in 518 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
[2024-05-29 22:11:59] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 0 ms to minimize.
[2024-05-29 22:11:59] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 1 ms to minimize.
[2024-05-29 22:11:59] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 1 ms to minimize.
[2024-05-29 22:12:00] [INFO ] Deduced a trap composed of 4 places in 103 ms of which 1 ms to minimize.
[2024-05-29 22:12:00] [INFO ] Deduced a trap composed of 4 places in 109 ms of which 1 ms to minimize.
[2024-05-29 22:12:00] [INFO ] Deduced a trap composed of 4 places in 122 ms of which 0 ms to minimize.
[2024-05-29 22:12:00] [INFO ] Deduced a trap composed of 4 places in 147 ms of which 0 ms to minimize.
[2024-05-29 22:12:00] [INFO ] Deduced a trap composed of 4 places in 115 ms of which 0 ms to minimize.
[2024-05-29 22:12:00] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 1 ms to minimize.
[2024-05-29 22:12:00] [INFO ] Deduced a trap composed of 4 places in 109 ms of which 0 ms to minimize.
[2024-05-29 22:12:00] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 0 ms to minimize.
[2024-05-29 22:12:00] [INFO ] Deduced a trap composed of 4 places in 118 ms of which 1 ms to minimize.
[2024-05-29 22:12:01] [INFO ] Deduced a trap composed of 4 places in 126 ms of which 2 ms to minimize.
[2024-05-29 22:12:01] [INFO ] Deduced a trap composed of 4 places in 297 ms of which 1 ms to minimize.
[2024-05-29 22:12:01] [INFO ] Deduced a trap composed of 4 places in 279 ms of which 1 ms to minimize.
[2024-05-29 22:12:01] [INFO ] Deduced a trap composed of 4 places in 226 ms of which 1 ms to minimize.
[2024-05-29 22:12:02] [INFO ] Deduced a trap composed of 4 places in 202 ms of which 0 ms to minimize.
[2024-05-29 22:12:02] [INFO ] Deduced a trap composed of 4 places in 162 ms of which 1 ms to minimize.
[2024-05-29 22:12:02] [INFO ] Deduced a trap composed of 4 places in 114 ms of which 0 ms to minimize.
[2024-05-29 22:12:02] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
[2024-05-29 22:12:06] [INFO ] Deduced a trap composed of 4 places in 369 ms of which 1 ms to minimize.
[2024-05-29 22:12:06] [INFO ] Deduced a trap composed of 4 places in 356 ms of which 0 ms to minimize.
[2024-05-29 22:12:07] [INFO ] Deduced a trap composed of 4 places in 301 ms of which 0 ms to minimize.
[2024-05-29 22:12:07] [INFO ] Deduced a trap composed of 4 places in 281 ms of which 0 ms to minimize.
[2024-05-29 22:12:07] [INFO ] Deduced a trap composed of 4 places in 225 ms of which 0 ms to minimize.
[2024-05-29 22:12:07] [INFO ] Deduced a trap composed of 4 places in 173 ms of which 1 ms to minimize.
[2024-05-29 22:12:08] [INFO ] Deduced a trap composed of 4 places in 271 ms of which 0 ms to minimize.
[2024-05-29 22:12:08] [INFO ] Deduced a trap composed of 4 places in 220 ms of which 0 ms to minimize.
[2024-05-29 22:12:08] [INFO ] Deduced a trap composed of 4 places in 222 ms of which 1 ms to minimize.
[2024-05-29 22:12:08] [INFO ] Deduced a trap composed of 4 places in 168 ms of which 1 ms to minimize.
[2024-05-29 22:12:08] [INFO ] Deduced a trap composed of 4 places in 160 ms of which 1 ms to minimize.
[2024-05-29 22:12:09] [INFO ] Deduced a trap composed of 4 places in 179 ms of which 1 ms to minimize.
[2024-05-29 22:12:09] [INFO ] Deduced a trap composed of 4 places in 123 ms of which 1 ms to minimize.
[2024-05-29 22:12:09] [INFO ] Deduced a trap composed of 4 places in 118 ms of which 2 ms to minimize.
[2024-05-29 22:12:09] [INFO ] Deduced a trap composed of 4 places in 170 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 34/2126 variables, and 56 constraints, problems are : Problem set: 0 solved, 2093 unsolved in 30054 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/34 constraints, ReadFeed: 0/2069 constraints, PredecessorRefiner: 2093/1 constraints, Known Traps: 55/55 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2093 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 1 (OVERLAPS) 11/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 55/56 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 4 (OVERLAPS) 2091/2125 variables, 34/90 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2125 variables, 2068/2158 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2125/2126 variables, and 2159 constraints, problems are : Problem set: 0 solved, 2093 unsolved in 30062 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 34/34 constraints, ReadFeed: 2068/2069 constraints, PredecessorRefiner: 2093/1 constraints, Known Traps: 55/55 constraints]
After SMT, in 93035ms problems are : Problem set: 0 solved, 2093 unsolved
Search for dead transitions found 0 dead transitions in 93064ms
Starting structural reductions in SI_LTL mode, iteration 1 : 34/90 places, 2104/4218 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 96265 ms. Remains : 34/90 places, 2104/4218 transitions.
Stuttering acceptance computed with spot in 221 ms :[(NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : StigmergyElection-PT-11a-LTLFireability-00
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 9 ms.
FORMULA StigmergyElection-PT-11a-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-11a-LTLFireability-00 finished in 96560 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(G((p0||(p0 U X(p0))))))'
Support contains 11 out of 90 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 90/90 places, 4218/4218 transitions.
Applied a total of 0 rules in 19 ms. Remains 90 /90 variables (removed 0) and now considering 4218/4218 (removed 0) transitions.
[2024-05-29 22:12:44] [INFO ] Flow matrix only has 4206 transitions (discarded 12 similar events)
// Phase 1: matrix 4206 rows 90 cols
[2024-05-29 22:12:44] [INFO ] Computed 1 invariants in 21 ms
[2024-05-29 22:12:44] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-05-29 22:12:44] [INFO ] Flow matrix only has 4206 transitions (discarded 12 similar events)
[2024-05-29 22:12:44] [INFO ] Invariant cache hit.
[2024-05-29 22:12:45] [INFO ] State equation strengthened by 4104 read => feed constraints.
[2024-05-29 22:12:46] [INFO ] Implicit Places using invariants and state equation in 1995 ms returned []
Implicit Place search using SMT with State Equation took 2091 ms to find 0 implicit places.
Running 4217 sub problems to find dead transitions.
[2024-05-29 22:12:46] [INFO ] Flow matrix only has 4206 transitions (discarded 12 similar events)
[2024-05-29 22:12:46] [INFO ] Invariant cache hit.
[2024-05-29 22:12:47] [INFO ] State equation strengthened by 4104 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4217 unsolved
At refinement iteration 1 (OVERLAPS) 1/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4217 unsolved
[2024-05-29 22:14:24] [INFO ] Deduced a trap composed of 9 places in 1302 ms of which 4 ms to minimize.
[2024-05-29 22:14:26] [INFO ] Deduced a trap composed of 9 places in 1326 ms of which 1 ms to minimize.
SMT process timed out in 99825ms, After SMT, problems are : Problem set: 0 solved, 4217 unsolved
Search for dead transitions found 0 dead transitions in 99890ms
Finished structural reductions in LTL mode , in 1 iterations and 102026 ms. Remains : 90/90 places, 4218/4218 transitions.
Stuttering acceptance computed with spot in 122 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyElection-PT-11a-LTLFireability-01
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA StigmergyElection-PT-11a-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-11a-LTLFireability-01 finished in 102183 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((X(((p1||X(G(p1))) U (!p1&&(p1||X(G(p1))))))||p0))))'
Support contains 11 out of 90 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 90/90 places, 4218/4218 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 22 Pre rules applied. Total rules applied 0 place count 89 transition count 4195
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 0 with 44 rules applied. Total rules applied 44 place count 67 transition count 4195
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 2 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 0 with 44 rules applied. Total rules applied 88 place count 45 transition count 4173
Ensure Unique test removed 2047 transitions
Reduce isomorphic transitions removed 2047 transitions.
Iterating post reduction 0 with 2047 rules applied. Total rules applied 2135 place count 45 transition count 2126
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 1 with 11 rules applied. Total rules applied 2146 place count 45 transition count 2115
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 1 with 22 rules applied. Total rules applied 2168 place count 34 transition count 2104
Applied a total of 2168 rules in 1803 ms. Remains 34 /90 variables (removed 56) and now considering 2104/4218 (removed 2114) transitions.
[2024-05-29 22:14:28] [INFO ] Flow matrix only has 2092 transitions (discarded 12 similar events)
// Phase 1: matrix 2092 rows 34 cols
[2024-05-29 22:14:28] [INFO ] Computed 1 invariants in 5 ms
[2024-05-29 22:14:28] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-29 22:14:28] [INFO ] Flow matrix only has 2092 transitions (discarded 12 similar events)
[2024-05-29 22:14:28] [INFO ] Invariant cache hit.
[2024-05-29 22:14:28] [INFO ] State equation strengthened by 2069 read => feed constraints.
[2024-05-29 22:14:28] [INFO ] Implicit Places using invariants and state equation in 623 ms returned []
Implicit Place search using SMT with State Equation took 679 ms to find 0 implicit places.
[2024-05-29 22:14:29] [INFO ] Redundant transitions in 352 ms returned []
Running 2093 sub problems to find dead transitions.
[2024-05-29 22:14:29] [INFO ] Flow matrix only has 2092 transitions (discarded 12 similar events)
[2024-05-29 22:14:29] [INFO ] Invariant cache hit.
[2024-05-29 22:14:29] [INFO ] State equation strengthened by 2069 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 1 (OVERLAPS) 11/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
[2024-05-29 22:15:08] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 1 ms to minimize.
[2024-05-29 22:15:08] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 1 ms to minimize.
[2024-05-29 22:15:08] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 0 ms to minimize.
[2024-05-29 22:15:08] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 0 ms to minimize.
[2024-05-29 22:15:08] [INFO ] Deduced a trap composed of 4 places in 194 ms of which 1 ms to minimize.
[2024-05-29 22:15:08] [INFO ] Deduced a trap composed of 4 places in 190 ms of which 1 ms to minimize.
[2024-05-29 22:15:08] [INFO ] Deduced a trap composed of 4 places in 192 ms of which 2 ms to minimize.
[2024-05-29 22:15:09] [INFO ] Deduced a trap composed of 4 places in 192 ms of which 0 ms to minimize.
[2024-05-29 22:15:09] [INFO ] Deduced a trap composed of 4 places in 141 ms of which 0 ms to minimize.
[2024-05-29 22:15:09] [INFO ] Deduced a trap composed of 4 places in 621 ms of which 1 ms to minimize.
[2024-05-29 22:15:10] [INFO ] Deduced a trap composed of 4 places in 632 ms of which 0 ms to minimize.
[2024-05-29 22:15:11] [INFO ] Deduced a trap composed of 4 places in 625 ms of which 1 ms to minimize.
[2024-05-29 22:15:11] [INFO ] Deduced a trap composed of 4 places in 617 ms of which 1 ms to minimize.
[2024-05-29 22:15:12] [INFO ] Deduced a trap composed of 4 places in 612 ms of which 1 ms to minimize.
[2024-05-29 22:15:12] [INFO ] Deduced a trap composed of 4 places in 617 ms of which 1 ms to minimize.
[2024-05-29 22:15:13] [INFO ] Deduced a trap composed of 4 places in 524 ms of which 1 ms to minimize.
[2024-05-29 22:15:13] [INFO ] Deduced a trap composed of 4 places in 458 ms of which 0 ms to minimize.
[2024-05-29 22:15:14] [INFO ] Deduced a trap composed of 4 places in 397 ms of which 1 ms to minimize.
[2024-05-29 22:15:14] [INFO ] Deduced a trap composed of 4 places in 337 ms of which 0 ms to minimize.
[2024-05-29 22:15:15] [INFO ] Deduced a trap composed of 4 places in 525 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
[2024-05-29 22:15:15] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
[2024-05-29 22:15:15] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 1 ms to minimize.
[2024-05-29 22:15:15] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 0 ms to minimize.
[2024-05-29 22:15:15] [INFO ] Deduced a trap composed of 4 places in 102 ms of which 0 ms to minimize.
[2024-05-29 22:15:16] [INFO ] Deduced a trap composed of 4 places in 112 ms of which 0 ms to minimize.
[2024-05-29 22:15:16] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 1 ms to minimize.
[2024-05-29 22:15:16] [INFO ] Deduced a trap composed of 4 places in 108 ms of which 0 ms to minimize.
[2024-05-29 22:15:16] [INFO ] Deduced a trap composed of 4 places in 102 ms of which 1 ms to minimize.
[2024-05-29 22:15:16] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 1 ms to minimize.
[2024-05-29 22:15:16] [INFO ] Deduced a trap composed of 4 places in 99 ms of which 1 ms to minimize.
[2024-05-29 22:15:16] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 1 ms to minimize.
[2024-05-29 22:15:16] [INFO ] Deduced a trap composed of 4 places in 95 ms of which 1 ms to minimize.
[2024-05-29 22:15:16] [INFO ] Deduced a trap composed of 4 places in 99 ms of which 1 ms to minimize.
[2024-05-29 22:15:17] [INFO ] Deduced a trap composed of 4 places in 298 ms of which 1 ms to minimize.
[2024-05-29 22:15:17] [INFO ] Deduced a trap composed of 4 places in 237 ms of which 0 ms to minimize.
[2024-05-29 22:15:17] [INFO ] Deduced a trap composed of 4 places in 199 ms of which 0 ms to minimize.
[2024-05-29 22:15:17] [INFO ] Deduced a trap composed of 4 places in 189 ms of which 0 ms to minimize.
[2024-05-29 22:15:17] [INFO ] Deduced a trap composed of 4 places in 147 ms of which 1 ms to minimize.
[2024-05-29 22:15:17] [INFO ] Deduced a trap composed of 4 places in 107 ms of which 0 ms to minimize.
[2024-05-29 22:15:18] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
[2024-05-29 22:15:22] [INFO ] Deduced a trap composed of 4 places in 344 ms of which 1 ms to minimize.
[2024-05-29 22:15:22] [INFO ] Deduced a trap composed of 4 places in 342 ms of which 1 ms to minimize.
[2024-05-29 22:15:22] [INFO ] Deduced a trap composed of 4 places in 293 ms of which 0 ms to minimize.
[2024-05-29 22:15:22] [INFO ] Deduced a trap composed of 4 places in 240 ms of which 1 ms to minimize.
[2024-05-29 22:15:23] [INFO ] Deduced a trap composed of 4 places in 193 ms of which 0 ms to minimize.
[2024-05-29 22:15:23] [INFO ] Deduced a trap composed of 4 places in 149 ms of which 1 ms to minimize.
[2024-05-29 22:15:23] [INFO ] Deduced a trap composed of 4 places in 241 ms of which 0 ms to minimize.
[2024-05-29 22:15:23] [INFO ] Deduced a trap composed of 4 places in 197 ms of which 0 ms to minimize.
[2024-05-29 22:15:23] [INFO ] Deduced a trap composed of 4 places in 189 ms of which 1 ms to minimize.
[2024-05-29 22:15:24] [INFO ] Deduced a trap composed of 4 places in 154 ms of which 0 ms to minimize.
[2024-05-29 22:15:24] [INFO ] Deduced a trap composed of 4 places in 144 ms of which 1 ms to minimize.
[2024-05-29 22:15:24] [INFO ] Deduced a trap composed of 4 places in 148 ms of which 1 ms to minimize.
[2024-05-29 22:15:24] [INFO ] Deduced a trap composed of 4 places in 102 ms of which 0 ms to minimize.
[2024-05-29 22:15:24] [INFO ] Deduced a trap composed of 4 places in 105 ms of which 0 ms to minimize.
[2024-05-29 22:15:24] [INFO ] Deduced a trap composed of 4 places in 146 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 34/2126 variables, and 56 constraints, problems are : Problem set: 0 solved, 2093 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/34 constraints, ReadFeed: 0/2069 constraints, PredecessorRefiner: 2093/1 constraints, Known Traps: 55/55 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2093 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 1 (OVERLAPS) 11/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 55/56 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 4 (OVERLAPS) 2091/2125 variables, 34/90 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2125 variables, 2068/2158 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2125/2126 variables, and 2159 constraints, problems are : Problem set: 0 solved, 2093 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 34/34 constraints, ReadFeed: 2068/2069 constraints, PredecessorRefiner: 2093/1 constraints, Known Traps: 55/55 constraints]
After SMT, in 92586ms problems are : Problem set: 0 solved, 2093 unsolved
Search for dead transitions found 0 dead transitions in 92607ms
Starting structural reductions in SI_LTL mode, iteration 1 : 34/90 places, 2104/4218 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 95455 ms. Remains : 34/90 places, 2104/4218 transitions.
Stuttering acceptance computed with spot in 145 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : StigmergyElection-PT-11a-LTLFireability-02
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 2 ms.
FORMULA StigmergyElection-PT-11a-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-11a-LTLFireability-02 finished in 95630 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(p0)||G(!p0)))'
Support contains 11 out of 90 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 90/90 places, 4218/4218 transitions.
Applied a total of 0 rules in 17 ms. Remains 90 /90 variables (removed 0) and now considering 4218/4218 (removed 0) transitions.
[2024-05-29 22:16:02] [INFO ] Flow matrix only has 4206 transitions (discarded 12 similar events)
// Phase 1: matrix 4206 rows 90 cols
[2024-05-29 22:16:02] [INFO ] Computed 1 invariants in 18 ms
[2024-05-29 22:16:02] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-29 22:16:02] [INFO ] Flow matrix only has 4206 transitions (discarded 12 similar events)
[2024-05-29 22:16:02] [INFO ] Invariant cache hit.
[2024-05-29 22:16:03] [INFO ] State equation strengthened by 4104 read => feed constraints.
[2024-05-29 22:16:03] [INFO ] Implicit Places using invariants and state equation in 1328 ms returned []
Implicit Place search using SMT with State Equation took 1381 ms to find 0 implicit places.
Running 4217 sub problems to find dead transitions.
[2024-05-29 22:16:03] [INFO ] Flow matrix only has 4206 transitions (discarded 12 similar events)
[2024-05-29 22:16:03] [INFO ] Invariant cache hit.
[2024-05-29 22:16:03] [INFO ] State equation strengthened by 4104 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4217 unsolved
At refinement iteration 1 (OVERLAPS) 1/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4217 unsolved
[2024-05-29 22:17:38] [INFO ] Deduced a trap composed of 9 places in 1283 ms of which 1 ms to minimize.
[2024-05-29 22:17:39] [INFO ] Deduced a trap composed of 9 places in 1306 ms of which 1 ms to minimize.
SMT process timed out in 95934ms, After SMT, problems are : Problem set: 0 solved, 4217 unsolved
Search for dead transitions found 0 dead transitions in 95975ms
Finished structural reductions in LTL mode , in 1 iterations and 97393 ms. Remains : 90/90 places, 4218/4218 transitions.
Stuttering acceptance computed with spot in 177 ms :[true, (NOT p0), false, false, p0]
Running random walk in product with property : StigmergyElection-PT-11a-LTLFireability-03
Entered a terminal (fully accepting) state of product in 23 steps with 0 reset in 3 ms.
FORMULA StigmergyElection-PT-11a-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-11a-LTLFireability-03 finished in 97602 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((X(G(!p2))||p1))&&p0)))'
Support contains 11 out of 90 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 90/90 places, 4218/4218 transitions.
Applied a total of 0 rules in 17 ms. Remains 90 /90 variables (removed 0) and now considering 4218/4218 (removed 0) transitions.
[2024-05-29 22:17:39] [INFO ] Flow matrix only has 4206 transitions (discarded 12 similar events)
[2024-05-29 22:17:39] [INFO ] Invariant cache hit.
[2024-05-29 22:17:39] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-29 22:17:39] [INFO ] Flow matrix only has 4206 transitions (discarded 12 similar events)
[2024-05-29 22:17:39] [INFO ] Invariant cache hit.
[2024-05-29 22:17:40] [INFO ] State equation strengthened by 4104 read => feed constraints.
[2024-05-29 22:17:41] [INFO ] Implicit Places using invariants and state equation in 1339 ms returned []
Implicit Place search using SMT with State Equation took 1370 ms to find 0 implicit places.
Running 4217 sub problems to find dead transitions.
[2024-05-29 22:17:41] [INFO ] Flow matrix only has 4206 transitions (discarded 12 similar events)
[2024-05-29 22:17:41] [INFO ] Invariant cache hit.
[2024-05-29 22:17:41] [INFO ] State equation strengthened by 4104 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4217 unsolved
At refinement iteration 1 (OVERLAPS) 1/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4217 unsolved
[2024-05-29 22:19:16] [INFO ] Deduced a trap composed of 9 places in 1279 ms of which 2 ms to minimize.
[2024-05-29 22:19:17] [INFO ] Deduced a trap composed of 9 places in 1298 ms of which 1 ms to minimize.
SMT process timed out in 96782ms, After SMT, problems are : Problem set: 0 solved, 4217 unsolved
Search for dead transitions found 0 dead transitions in 96824ms
Finished structural reductions in LTL mode , in 1 iterations and 98233 ms. Remains : 90/90 places, 4218/4218 transitions.
Stuttering acceptance computed with spot in 163 ms :[(OR (NOT p0) (AND (NOT p1) p2)), (OR (AND (NOT p0) p2) (AND (NOT p1) p2)), (AND (NOT p1) p2), (AND (NOT p1) p2)]
Running random walk in product with property : StigmergyElection-PT-11a-LTLFireability-05
Stuttering criterion allowed to conclude after 23 steps with 0 reset in 4 ms.
FORMULA StigmergyElection-PT-11a-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-11a-LTLFireability-05 finished in 98437 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 11 out of 90 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 90/90 places, 4218/4218 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 22 Pre rules applied. Total rules applied 0 place count 89 transition count 4195
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 0 with 44 rules applied. Total rules applied 44 place count 67 transition count 4195
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 0 with 44 rules applied. Total rules applied 88 place count 45 transition count 4173
Ensure Unique test removed 2047 transitions
Reduce isomorphic transitions removed 2047 transitions.
Iterating post reduction 0 with 2047 rules applied. Total rules applied 2135 place count 45 transition count 2126
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 1 with 11 rules applied. Total rules applied 2146 place count 45 transition count 2115
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 1 with 22 rules applied. Total rules applied 2168 place count 34 transition count 2104
Applied a total of 2168 rules in 1664 ms. Remains 34 /90 variables (removed 56) and now considering 2104/4218 (removed 2114) transitions.
[2024-05-29 22:19:19] [INFO ] Flow matrix only has 2092 transitions (discarded 12 similar events)
// Phase 1: matrix 2092 rows 34 cols
[2024-05-29 22:19:19] [INFO ] Computed 1 invariants in 14 ms
[2024-05-29 22:19:19] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-29 22:19:19] [INFO ] Flow matrix only has 2092 transitions (discarded 12 similar events)
[2024-05-29 22:19:19] [INFO ] Invariant cache hit.
[2024-05-29 22:19:20] [INFO ] State equation strengthened by 2069 read => feed constraints.
[2024-05-29 22:19:20] [INFO ] Implicit Places using invariants and state equation in 619 ms returned []
Implicit Place search using SMT with State Equation took 658 ms to find 0 implicit places.
[2024-05-29 22:19:20] [INFO ] Redundant transitions in 283 ms returned []
Running 2093 sub problems to find dead transitions.
[2024-05-29 22:19:20] [INFO ] Flow matrix only has 2092 transitions (discarded 12 similar events)
[2024-05-29 22:19:20] [INFO ] Invariant cache hit.
[2024-05-29 22:19:20] [INFO ] State equation strengthened by 2069 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 1 (OVERLAPS) 11/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
[2024-05-29 22:19:59] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 0 ms to minimize.
[2024-05-29 22:19:59] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 1 ms to minimize.
[2024-05-29 22:19:59] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 1 ms to minimize.
[2024-05-29 22:19:59] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 1 ms to minimize.
[2024-05-29 22:19:59] [INFO ] Deduced a trap composed of 4 places in 190 ms of which 1 ms to minimize.
[2024-05-29 22:20:00] [INFO ] Deduced a trap composed of 4 places in 188 ms of which 1 ms to minimize.
[2024-05-29 22:20:00] [INFO ] Deduced a trap composed of 4 places in 190 ms of which 1 ms to minimize.
[2024-05-29 22:20:00] [INFO ] Deduced a trap composed of 4 places in 186 ms of which 0 ms to minimize.
[2024-05-29 22:20:00] [INFO ] Deduced a trap composed of 4 places in 146 ms of which 0 ms to minimize.
[2024-05-29 22:20:01] [INFO ] Deduced a trap composed of 4 places in 636 ms of which 0 ms to minimize.
[2024-05-29 22:20:01] [INFO ] Deduced a trap composed of 4 places in 604 ms of which 0 ms to minimize.
[2024-05-29 22:20:02] [INFO ] Deduced a trap composed of 4 places in 623 ms of which 0 ms to minimize.
[2024-05-29 22:20:03] [INFO ] Deduced a trap composed of 4 places in 599 ms of which 1 ms to minimize.
[2024-05-29 22:20:03] [INFO ] Deduced a trap composed of 4 places in 594 ms of which 1 ms to minimize.
[2024-05-29 22:20:04] [INFO ] Deduced a trap composed of 4 places in 614 ms of which 1 ms to minimize.
[2024-05-29 22:20:04] [INFO ] Deduced a trap composed of 4 places in 525 ms of which 0 ms to minimize.
[2024-05-29 22:20:05] [INFO ] Deduced a trap composed of 4 places in 453 ms of which 0 ms to minimize.
[2024-05-29 22:20:05] [INFO ] Deduced a trap composed of 4 places in 383 ms of which 1 ms to minimize.
[2024-05-29 22:20:06] [INFO ] Deduced a trap composed of 4 places in 336 ms of which 0 ms to minimize.
[2024-05-29 22:20:06] [INFO ] Deduced a trap composed of 4 places in 503 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
[2024-05-29 22:20:06] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 1 ms to minimize.
[2024-05-29 22:20:07] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 1 ms to minimize.
[2024-05-29 22:20:07] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 1 ms to minimize.
[2024-05-29 22:20:07] [INFO ] Deduced a trap composed of 4 places in 106 ms of which 0 ms to minimize.
[2024-05-29 22:20:07] [INFO ] Deduced a trap composed of 4 places in 101 ms of which 1 ms to minimize.
[2024-05-29 22:20:07] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 1 ms to minimize.
[2024-05-29 22:20:07] [INFO ] Deduced a trap composed of 4 places in 111 ms of which 2 ms to minimize.
[2024-05-29 22:20:07] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 1 ms to minimize.
[2024-05-29 22:20:07] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 0 ms to minimize.
[2024-05-29 22:20:07] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 0 ms to minimize.
[2024-05-29 22:20:07] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 0 ms to minimize.
[2024-05-29 22:20:07] [INFO ] Deduced a trap composed of 4 places in 99 ms of which 0 ms to minimize.
[2024-05-29 22:20:08] [INFO ] Deduced a trap composed of 4 places in 98 ms of which 0 ms to minimize.
[2024-05-29 22:20:08] [INFO ] Deduced a trap composed of 4 places in 292 ms of which 0 ms to minimize.
[2024-05-29 22:20:08] [INFO ] Deduced a trap composed of 4 places in 243 ms of which 1 ms to minimize.
[2024-05-29 22:20:08] [INFO ] Deduced a trap composed of 4 places in 194 ms of which 1 ms to minimize.
[2024-05-29 22:20:09] [INFO ] Deduced a trap composed of 4 places in 189 ms of which 1 ms to minimize.
[2024-05-29 22:20:09] [INFO ] Deduced a trap composed of 4 places in 144 ms of which 1 ms to minimize.
[2024-05-29 22:20:09] [INFO ] Deduced a trap composed of 4 places in 100 ms of which 0 ms to minimize.
[2024-05-29 22:20:09] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
[2024-05-29 22:20:13] [INFO ] Deduced a trap composed of 4 places in 345 ms of which 0 ms to minimize.
[2024-05-29 22:20:13] [INFO ] Deduced a trap composed of 4 places in 337 ms of which 0 ms to minimize.
[2024-05-29 22:20:13] [INFO ] Deduced a trap composed of 4 places in 288 ms of which 0 ms to minimize.
[2024-05-29 22:20:14] [INFO ] Deduced a trap composed of 4 places in 238 ms of which 0 ms to minimize.
[2024-05-29 22:20:14] [INFO ] Deduced a trap composed of 4 places in 198 ms of which 0 ms to minimize.
[2024-05-29 22:20:14] [INFO ] Deduced a trap composed of 4 places in 150 ms of which 1 ms to minimize.
[2024-05-29 22:20:14] [INFO ] Deduced a trap composed of 4 places in 240 ms of which 0 ms to minimize.
[2024-05-29 22:20:14] [INFO ] Deduced a trap composed of 4 places in 196 ms of which 0 ms to minimize.
[2024-05-29 22:20:15] [INFO ] Deduced a trap composed of 4 places in 201 ms of which 0 ms to minimize.
[2024-05-29 22:20:15] [INFO ] Deduced a trap composed of 4 places in 164 ms of which 0 ms to minimize.
[2024-05-29 22:20:15] [INFO ] Deduced a trap composed of 4 places in 148 ms of which 1 ms to minimize.
[2024-05-29 22:20:15] [INFO ] Deduced a trap composed of 4 places in 147 ms of which 1 ms to minimize.
[2024-05-29 22:20:15] [INFO ] Deduced a trap composed of 4 places in 110 ms of which 0 ms to minimize.
[2024-05-29 22:20:15] [INFO ] Deduced a trap composed of 4 places in 99 ms of which 0 ms to minimize.
[2024-05-29 22:20:15] [INFO ] Deduced a trap composed of 4 places in 140 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 34/2126 variables, and 56 constraints, problems are : Problem set: 0 solved, 2093 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/34 constraints, ReadFeed: 0/2069 constraints, PredecessorRefiner: 2093/1 constraints, Known Traps: 55/55 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2093 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 1 (OVERLAPS) 11/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 55/56 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 4 (OVERLAPS) 2091/2125 variables, 34/90 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2125 variables, 2068/2158 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2125/2126 variables, and 2159 constraints, problems are : Problem set: 0 solved, 2093 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 34/34 constraints, ReadFeed: 2068/2069 constraints, PredecessorRefiner: 2093/1 constraints, Known Traps: 55/55 constraints]
After SMT, in 92392ms problems are : Problem set: 0 solved, 2093 unsolved
Search for dead transitions found 0 dead transitions in 92412ms
Starting structural reductions in SI_LTL mode, iteration 1 : 34/90 places, 2104/4218 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 95029 ms. Remains : 34/90 places, 2104/4218 transitions.
Stuttering acceptance computed with spot in 95 ms :[(NOT p0)]
Running random walk in product with property : StigmergyElection-PT-11a-LTLFireability-06
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 1 ms.
FORMULA StigmergyElection-PT-11a-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-11a-LTLFireability-06 finished in 95149 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(G(p0)))'
Support contains 11 out of 90 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 90/90 places, 4218/4218 transitions.
Applied a total of 0 rules in 15 ms. Remains 90 /90 variables (removed 0) and now considering 4218/4218 (removed 0) transitions.
[2024-05-29 22:20:53] [INFO ] Flow matrix only has 4206 transitions (discarded 12 similar events)
// Phase 1: matrix 4206 rows 90 cols
[2024-05-29 22:20:53] [INFO ] Computed 1 invariants in 22 ms
[2024-05-29 22:20:53] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-29 22:20:53] [INFO ] Flow matrix only has 4206 transitions (discarded 12 similar events)
[2024-05-29 22:20:53] [INFO ] Invariant cache hit.
[2024-05-29 22:20:54] [INFO ] State equation strengthened by 4104 read => feed constraints.
[2024-05-29 22:20:54] [INFO ] Implicit Places using invariants and state equation in 1363 ms returned []
Implicit Place search using SMT with State Equation took 1427 ms to find 0 implicit places.
Running 4217 sub problems to find dead transitions.
[2024-05-29 22:20:54] [INFO ] Flow matrix only has 4206 transitions (discarded 12 similar events)
[2024-05-29 22:20:54] [INFO ] Invariant cache hit.
[2024-05-29 22:20:54] [INFO ] State equation strengthened by 4104 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4217 unsolved
At refinement iteration 1 (OVERLAPS) 1/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4217 unsolved
[2024-05-29 22:22:30] [INFO ] Deduced a trap composed of 9 places in 1278 ms of which 2 ms to minimize.
[2024-05-29 22:22:31] [INFO ] Deduced a trap composed of 9 places in 1300 ms of which 0 ms to minimize.
SMT process timed out in 96600ms, After SMT, problems are : Problem set: 0 solved, 4217 unsolved
Search for dead transitions found 0 dead transitions in 96642ms
Finished structural reductions in LTL mode , in 1 iterations and 98100 ms. Remains : 90/90 places, 4218/4218 transitions.
Stuttering acceptance computed with spot in 85 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyElection-PT-11a-LTLFireability-08
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA StigmergyElection-PT-11a-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-11a-LTLFireability-08 finished in 98205 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 11 out of 90 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 90/90 places, 4218/4218 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 22 Pre rules applied. Total rules applied 0 place count 89 transition count 4195
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 0 with 44 rules applied. Total rules applied 44 place count 67 transition count 4195
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 0 with 44 rules applied. Total rules applied 88 place count 45 transition count 4173
Ensure Unique test removed 2047 transitions
Reduce isomorphic transitions removed 2047 transitions.
Iterating post reduction 0 with 2047 rules applied. Total rules applied 2135 place count 45 transition count 2126
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 1 with 11 rules applied. Total rules applied 2146 place count 45 transition count 2115
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 1 with 22 rules applied. Total rules applied 2168 place count 34 transition count 2104
Applied a total of 2168 rules in 1664 ms. Remains 34 /90 variables (removed 56) and now considering 2104/4218 (removed 2114) transitions.
[2024-05-29 22:22:33] [INFO ] Flow matrix only has 2092 transitions (discarded 12 similar events)
// Phase 1: matrix 2092 rows 34 cols
[2024-05-29 22:22:33] [INFO ] Computed 1 invariants in 11 ms
[2024-05-29 22:22:33] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-29 22:22:33] [INFO ] Flow matrix only has 2092 transitions (discarded 12 similar events)
[2024-05-29 22:22:33] [INFO ] Invariant cache hit.
[2024-05-29 22:22:33] [INFO ] State equation strengthened by 2069 read => feed constraints.
[2024-05-29 22:22:33] [INFO ] Implicit Places using invariants and state equation in 628 ms returned []
Implicit Place search using SMT with State Equation took 677 ms to find 0 implicit places.
[2024-05-29 22:22:34] [INFO ] Redundant transitions in 254 ms returned []
Running 2093 sub problems to find dead transitions.
[2024-05-29 22:22:34] [INFO ] Flow matrix only has 2092 transitions (discarded 12 similar events)
[2024-05-29 22:22:34] [INFO ] Invariant cache hit.
[2024-05-29 22:22:34] [INFO ] State equation strengthened by 2069 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 1 (OVERLAPS) 11/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
[2024-05-29 22:23:12] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 1 ms to minimize.
[2024-05-29 22:23:12] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 1 ms to minimize.
[2024-05-29 22:23:13] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 0 ms to minimize.
[2024-05-29 22:23:13] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 0 ms to minimize.
[2024-05-29 22:23:13] [INFO ] Deduced a trap composed of 4 places in 200 ms of which 1 ms to minimize.
[2024-05-29 22:23:13] [INFO ] Deduced a trap composed of 4 places in 193 ms of which 0 ms to minimize.
[2024-05-29 22:23:13] [INFO ] Deduced a trap composed of 4 places in 189 ms of which 0 ms to minimize.
[2024-05-29 22:23:13] [INFO ] Deduced a trap composed of 4 places in 195 ms of which 0 ms to minimize.
[2024-05-29 22:23:14] [INFO ] Deduced a trap composed of 4 places in 149 ms of which 1 ms to minimize.
[2024-05-29 22:23:14] [INFO ] Deduced a trap composed of 4 places in 648 ms of which 1 ms to minimize.
[2024-05-29 22:23:15] [INFO ] Deduced a trap composed of 4 places in 642 ms of which 1 ms to minimize.
[2024-05-29 22:23:16] [INFO ] Deduced a trap composed of 4 places in 631 ms of which 1 ms to minimize.
[2024-05-29 22:23:16] [INFO ] Deduced a trap composed of 4 places in 634 ms of which 1 ms to minimize.
[2024-05-29 22:23:17] [INFO ] Deduced a trap composed of 4 places in 641 ms of which 1 ms to minimize.
[2024-05-29 22:23:17] [INFO ] Deduced a trap composed of 4 places in 606 ms of which 0 ms to minimize.
[2024-05-29 22:23:18] [INFO ] Deduced a trap composed of 4 places in 513 ms of which 1 ms to minimize.
[2024-05-29 22:23:18] [INFO ] Deduced a trap composed of 4 places in 445 ms of which 1 ms to minimize.
[2024-05-29 22:23:19] [INFO ] Deduced a trap composed of 4 places in 390 ms of which 0 ms to minimize.
[2024-05-29 22:23:19] [INFO ] Deduced a trap composed of 4 places in 324 ms of which 1 ms to minimize.
[2024-05-29 22:23:20] [INFO ] Deduced a trap composed of 4 places in 497 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
[2024-05-29 22:23:20] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
[2024-05-29 22:23:20] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 0 ms to minimize.
[2024-05-29 22:23:20] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 0 ms to minimize.
[2024-05-29 22:23:20] [INFO ] Deduced a trap composed of 4 places in 98 ms of which 1 ms to minimize.
[2024-05-29 22:23:20] [INFO ] Deduced a trap composed of 4 places in 99 ms of which 0 ms to minimize.
[2024-05-29 22:23:20] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 1 ms to minimize.
[2024-05-29 22:23:21] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 0 ms to minimize.
[2024-05-29 22:23:21] [INFO ] Deduced a trap composed of 4 places in 97 ms of which 0 ms to minimize.
[2024-05-29 22:23:21] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 0 ms to minimize.
[2024-05-29 22:23:21] [INFO ] Deduced a trap composed of 4 places in 103 ms of which 1 ms to minimize.
[2024-05-29 22:23:21] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 0 ms to minimize.
[2024-05-29 22:23:21] [INFO ] Deduced a trap composed of 4 places in 94 ms of which 0 ms to minimize.
[2024-05-29 22:23:21] [INFO ] Deduced a trap composed of 4 places in 109 ms of which 1 ms to minimize.
[2024-05-29 22:23:21] [INFO ] Deduced a trap composed of 4 places in 295 ms of which 1 ms to minimize.
[2024-05-29 22:23:22] [INFO ] Deduced a trap composed of 4 places in 238 ms of which 1 ms to minimize.
[2024-05-29 22:23:22] [INFO ] Deduced a trap composed of 4 places in 190 ms of which 1 ms to minimize.
[2024-05-29 22:23:22] [INFO ] Deduced a trap composed of 4 places in 189 ms of which 0 ms to minimize.
[2024-05-29 22:23:22] [INFO ] Deduced a trap composed of 4 places in 152 ms of which 0 ms to minimize.
[2024-05-29 22:23:22] [INFO ] Deduced a trap composed of 4 places in 108 ms of which 1 ms to minimize.
[2024-05-29 22:23:22] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
[2024-05-29 22:23:26] [INFO ] Deduced a trap composed of 4 places in 335 ms of which 1 ms to minimize.
[2024-05-29 22:23:27] [INFO ] Deduced a trap composed of 4 places in 338 ms of which 1 ms to minimize.
[2024-05-29 22:23:27] [INFO ] Deduced a trap composed of 4 places in 285 ms of which 0 ms to minimize.
[2024-05-29 22:23:27] [INFO ] Deduced a trap composed of 4 places in 240 ms of which 0 ms to minimize.
[2024-05-29 22:23:27] [INFO ] Deduced a trap composed of 4 places in 193 ms of which 0 ms to minimize.
[2024-05-29 22:23:28] [INFO ] Deduced a trap composed of 4 places in 145 ms of which 0 ms to minimize.
[2024-05-29 22:23:28] [INFO ] Deduced a trap composed of 4 places in 240 ms of which 1 ms to minimize.
[2024-05-29 22:23:28] [INFO ] Deduced a trap composed of 4 places in 192 ms of which 0 ms to minimize.
[2024-05-29 22:23:28] [INFO ] Deduced a trap composed of 4 places in 185 ms of which 0 ms to minimize.
[2024-05-29 22:23:28] [INFO ] Deduced a trap composed of 4 places in 143 ms of which 0 ms to minimize.
[2024-05-29 22:23:28] [INFO ] Deduced a trap composed of 4 places in 151 ms of which 0 ms to minimize.
[2024-05-29 22:23:29] [INFO ] Deduced a trap composed of 4 places in 144 ms of which 0 ms to minimize.
[2024-05-29 22:23:29] [INFO ] Deduced a trap composed of 4 places in 98 ms of which 0 ms to minimize.
[2024-05-29 22:23:29] [INFO ] Deduced a trap composed of 4 places in 110 ms of which 0 ms to minimize.
[2024-05-29 22:23:29] [INFO ] Deduced a trap composed of 4 places in 145 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 34/2126 variables, and 56 constraints, problems are : Problem set: 0 solved, 2093 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/34 constraints, ReadFeed: 0/2069 constraints, PredecessorRefiner: 2093/1 constraints, Known Traps: 55/55 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2093 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 1 (OVERLAPS) 11/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 55/56 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 4 (OVERLAPS) 2091/2125 variables, 34/90 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2125 variables, 2068/2158 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2125/2126 variables, and 2159 constraints, problems are : Problem set: 0 solved, 2093 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 34/34 constraints, ReadFeed: 2068/2069 constraints, PredecessorRefiner: 2093/1 constraints, Known Traps: 55/55 constraints]
After SMT, in 92423ms problems are : Problem set: 0 solved, 2093 unsolved
Search for dead transitions found 0 dead transitions in 92444ms
Starting structural reductions in SI_LTL mode, iteration 1 : 34/90 places, 2104/4218 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 95050 ms. Remains : 34/90 places, 2104/4218 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : StigmergyElection-PT-11a-LTLFireability-09
Product exploration explored 100000 steps with 8333 reset in 4842 ms.
Product exploration explored 100000 steps with 8333 reset in 4780 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 65 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 27 ms :[(NOT p0)]
RANDOM walk for 44 steps (0 resets) in 9 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 108 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 32 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
[2024-05-29 22:24:16] [INFO ] Flow matrix only has 2092 transitions (discarded 12 similar events)
[2024-05-29 22:24:16] [INFO ] Invariant cache hit.
[2024-05-29 22:24:17] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-29 22:24:18] [INFO ] [Real]Absence check using state equation in 339 ms returned sat
[2024-05-29 22:24:18] [INFO ] State equation strengthened by 2069 read => feed constraints.
[2024-05-29 22:24:19] [INFO ] [Real]Added 2069 Read/Feed constraints in 214 ms returned sat
[2024-05-29 22:24:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 22:24:20] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-29 22:24:20] [INFO ] [Nat]Absence check using state equation in 332 ms returned sat
[2024-05-29 22:24:20] [INFO ] [Nat]Added 2069 Read/Feed constraints in 262 ms returned sat
[2024-05-29 22:24:21] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 2081 transitions) in 515 ms.
[2024-05-29 22:24:21] [INFO ] Added : 0 causal constraints over 0 iterations in 669 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 11 out of 34 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 34/34 places, 2104/2104 transitions.
Applied a total of 0 rules in 745 ms. Remains 34 /34 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
[2024-05-29 22:24:22] [INFO ] Flow matrix only has 2092 transitions (discarded 12 similar events)
[2024-05-29 22:24:22] [INFO ] Invariant cache hit.
[2024-05-29 22:24:22] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-29 22:24:22] [INFO ] Flow matrix only has 2092 transitions (discarded 12 similar events)
[2024-05-29 22:24:22] [INFO ] Invariant cache hit.
[2024-05-29 22:24:22] [INFO ] State equation strengthened by 2069 read => feed constraints.
[2024-05-29 22:24:22] [INFO ] Implicit Places using invariants and state equation in 671 ms returned []
Implicit Place search using SMT with State Equation took 705 ms to find 0 implicit places.
[2024-05-29 22:24:23] [INFO ] Redundant transitions in 225 ms returned []
Running 2093 sub problems to find dead transitions.
[2024-05-29 22:24:23] [INFO ] Flow matrix only has 2092 transitions (discarded 12 similar events)
[2024-05-29 22:24:23] [INFO ] Invariant cache hit.
[2024-05-29 22:24:23] [INFO ] State equation strengthened by 2069 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 1 (OVERLAPS) 11/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
[2024-05-29 22:25:02] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 1 ms to minimize.
[2024-05-29 22:25:02] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 0 ms to minimize.
[2024-05-29 22:25:02] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
[2024-05-29 22:25:02] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 2 ms to minimize.
[2024-05-29 22:25:02] [INFO ] Deduced a trap composed of 4 places in 191 ms of which 0 ms to minimize.
[2024-05-29 22:25:02] [INFO ] Deduced a trap composed of 4 places in 192 ms of which 0 ms to minimize.
[2024-05-29 22:25:03] [INFO ] Deduced a trap composed of 4 places in 186 ms of which 0 ms to minimize.
[2024-05-29 22:25:03] [INFO ] Deduced a trap composed of 4 places in 193 ms of which 1 ms to minimize.
[2024-05-29 22:25:03] [INFO ] Deduced a trap composed of 4 places in 148 ms of which 1 ms to minimize.
[2024-05-29 22:25:04] [INFO ] Deduced a trap composed of 4 places in 631 ms of which 0 ms to minimize.
[2024-05-29 22:25:04] [INFO ] Deduced a trap composed of 4 places in 626 ms of which 1 ms to minimize.
[2024-05-29 22:25:05] [INFO ] Deduced a trap composed of 4 places in 628 ms of which 1 ms to minimize.
[2024-05-29 22:25:06] [INFO ] Deduced a trap composed of 4 places in 609 ms of which 1 ms to minimize.
[2024-05-29 22:25:06] [INFO ] Deduced a trap composed of 4 places in 617 ms of which 0 ms to minimize.
[2024-05-29 22:25:07] [INFO ] Deduced a trap composed of 4 places in 621 ms of which 1 ms to minimize.
[2024-05-29 22:25:07] [INFO ] Deduced a trap composed of 4 places in 527 ms of which 1 ms to minimize.
[2024-05-29 22:25:08] [INFO ] Deduced a trap composed of 4 places in 453 ms of which 1 ms to minimize.
[2024-05-29 22:25:08] [INFO ] Deduced a trap composed of 4 places in 396 ms of which 0 ms to minimize.
[2024-05-29 22:25:09] [INFO ] Deduced a trap composed of 4 places in 330 ms of which 1 ms to minimize.
[2024-05-29 22:25:09] [INFO ] Deduced a trap composed of 4 places in 508 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
[2024-05-29 22:25:09] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 0 ms to minimize.
[2024-05-29 22:25:10] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 0 ms to minimize.
[2024-05-29 22:25:10] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 1 ms to minimize.
[2024-05-29 22:25:10] [INFO ] Deduced a trap composed of 4 places in 106 ms of which 1 ms to minimize.
[2024-05-29 22:25:10] [INFO ] Deduced a trap composed of 4 places in 107 ms of which 0 ms to minimize.
[2024-05-29 22:25:10] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 1 ms to minimize.
[2024-05-29 22:25:10] [INFO ] Deduced a trap composed of 4 places in 102 ms of which 1 ms to minimize.
[2024-05-29 22:25:10] [INFO ] Deduced a trap composed of 4 places in 110 ms of which 4 ms to minimize.
[2024-05-29 22:25:10] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
[2024-05-29 22:25:10] [INFO ] Deduced a trap composed of 4 places in 106 ms of which 0 ms to minimize.
[2024-05-29 22:25:10] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 1 ms to minimize.
[2024-05-29 22:25:10] [INFO ] Deduced a trap composed of 4 places in 97 ms of which 0 ms to minimize.
[2024-05-29 22:25:11] [INFO ] Deduced a trap composed of 4 places in 108 ms of which 1 ms to minimize.
[2024-05-29 22:25:11] [INFO ] Deduced a trap composed of 4 places in 303 ms of which 0 ms to minimize.
[2024-05-29 22:25:11] [INFO ] Deduced a trap composed of 4 places in 244 ms of which 0 ms to minimize.
[2024-05-29 22:25:11] [INFO ] Deduced a trap composed of 4 places in 194 ms of which 0 ms to minimize.
[2024-05-29 22:25:12] [INFO ] Deduced a trap composed of 4 places in 190 ms of which 1 ms to minimize.
[2024-05-29 22:25:12] [INFO ] Deduced a trap composed of 4 places in 145 ms of which 1 ms to minimize.
[2024-05-29 22:25:12] [INFO ] Deduced a trap composed of 4 places in 111 ms of which 0 ms to minimize.
[2024-05-29 22:25:12] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
[2024-05-29 22:25:16] [INFO ] Deduced a trap composed of 4 places in 358 ms of which 1 ms to minimize.
[2024-05-29 22:25:16] [INFO ] Deduced a trap composed of 4 places in 342 ms of which 0 ms to minimize.
[2024-05-29 22:25:16] [INFO ] Deduced a trap composed of 4 places in 297 ms of which 0 ms to minimize.
[2024-05-29 22:25:17] [INFO ] Deduced a trap composed of 4 places in 240 ms of which 0 ms to minimize.
[2024-05-29 22:25:17] [INFO ] Deduced a trap composed of 4 places in 188 ms of which 0 ms to minimize.
[2024-05-29 22:25:17] [INFO ] Deduced a trap composed of 4 places in 153 ms of which 4 ms to minimize.
[2024-05-29 22:25:17] [INFO ] Deduced a trap composed of 4 places in 245 ms of which 0 ms to minimize.
[2024-05-29 22:25:17] [INFO ] Deduced a trap composed of 4 places in 199 ms of which 0 ms to minimize.
[2024-05-29 22:25:18] [INFO ] Deduced a trap composed of 4 places in 190 ms of which 1 ms to minimize.
[2024-05-29 22:25:18] [INFO ] Deduced a trap composed of 4 places in 147 ms of which 0 ms to minimize.
[2024-05-29 22:25:18] [INFO ] Deduced a trap composed of 4 places in 150 ms of which 0 ms to minimize.
[2024-05-29 22:25:18] [INFO ] Deduced a trap composed of 4 places in 150 ms of which 1 ms to minimize.
[2024-05-29 22:25:18] [INFO ] Deduced a trap composed of 4 places in 106 ms of which 1 ms to minimize.
[2024-05-29 22:25:18] [INFO ] Deduced a trap composed of 4 places in 103 ms of which 0 ms to minimize.
[2024-05-29 22:25:19] [INFO ] Deduced a trap composed of 4 places in 141 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 34/2126 variables, and 56 constraints, problems are : Problem set: 0 solved, 2093 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/34 constraints, ReadFeed: 0/2069 constraints, PredecessorRefiner: 2093/1 constraints, Known Traps: 55/55 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2093 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 1 (OVERLAPS) 11/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 55/56 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 4 (OVERLAPS) 2091/2125 variables, 34/90 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2125 variables, 2068/2158 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2125/2126 variables, and 2159 constraints, problems are : Problem set: 0 solved, 2093 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 34/34 constraints, ReadFeed: 2068/2069 constraints, PredecessorRefiner: 2093/1 constraints, Known Traps: 55/55 constraints]
After SMT, in 92707ms problems are : Problem set: 0 solved, 2093 unsolved
Search for dead transitions found 0 dead transitions in 92731ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 94424 ms. Remains : 34/34 places, 2104/2104 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 109 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)]
RANDOM walk for 44 steps (0 resets) in 8 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 91 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 32 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
[2024-05-29 22:25:56] [INFO ] Flow matrix only has 2092 transitions (discarded 12 similar events)
[2024-05-29 22:25:56] [INFO ] Invariant cache hit.
[2024-05-29 22:25:57] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-29 22:25:57] [INFO ] [Real]Absence check using state equation in 354 ms returned sat
[2024-05-29 22:25:57] [INFO ] State equation strengthened by 2069 read => feed constraints.
[2024-05-29 22:25:58] [INFO ] [Real]Added 2069 Read/Feed constraints in 210 ms returned sat
[2024-05-29 22:25:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 22:25:59] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-29 22:25:59] [INFO ] [Nat]Absence check using state equation in 352 ms returned sat
[2024-05-29 22:25:59] [INFO ] [Nat]Added 2069 Read/Feed constraints in 266 ms returned sat
[2024-05-29 22:26:00] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 2081 transitions) in 384 ms.
[2024-05-29 22:26:00] [INFO ] Added : 0 causal constraints over 0 iterations in 531 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Product exploration explored 100000 steps with 8333 reset in 4791 ms.
Product exploration explored 100000 steps with 8333 reset in 4806 ms.
Built C files in :
/tmp/ltsmin324129971346740911
[2024-05-29 22:26:10] [INFO ] Too many transitions (2104) to apply POR reductions. Disabling POR matrices.
[2024-05-29 22:26:10] [INFO ] Built C files in 81ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin324129971346740911
Running compilation step : cd /tmp/ltsmin324129971346740911;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin324129971346740911;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin324129971346740911;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 11 out of 34 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 34/34 places, 2104/2104 transitions.
Applied a total of 0 rules in 663 ms. Remains 34 /34 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
[2024-05-29 22:26:13] [INFO ] Flow matrix only has 2092 transitions (discarded 12 similar events)
[2024-05-29 22:26:13] [INFO ] Invariant cache hit.
[2024-05-29 22:26:13] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-29 22:26:13] [INFO ] Flow matrix only has 2092 transitions (discarded 12 similar events)
[2024-05-29 22:26:13] [INFO ] Invariant cache hit.
[2024-05-29 22:26:14] [INFO ] State equation strengthened by 2069 read => feed constraints.
[2024-05-29 22:26:14] [INFO ] Implicit Places using invariants and state equation in 657 ms returned []
Implicit Place search using SMT with State Equation took 685 ms to find 0 implicit places.
[2024-05-29 22:26:14] [INFO ] Redundant transitions in 226 ms returned []
Running 2093 sub problems to find dead transitions.
[2024-05-29 22:26:14] [INFO ] Flow matrix only has 2092 transitions (discarded 12 similar events)
[2024-05-29 22:26:14] [INFO ] Invariant cache hit.
[2024-05-29 22:26:15] [INFO ] State equation strengthened by 2069 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 1 (OVERLAPS) 11/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
[2024-05-29 22:26:53] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 1 ms to minimize.
[2024-05-29 22:26:54] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 0 ms to minimize.
[2024-05-29 22:26:54] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 1 ms to minimize.
[2024-05-29 22:26:54] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 0 ms to minimize.
[2024-05-29 22:26:54] [INFO ] Deduced a trap composed of 4 places in 189 ms of which 0 ms to minimize.
[2024-05-29 22:26:54] [INFO ] Deduced a trap composed of 4 places in 192 ms of which 1 ms to minimize.
[2024-05-29 22:26:54] [INFO ] Deduced a trap composed of 4 places in 185 ms of which 0 ms to minimize.
[2024-05-29 22:26:54] [INFO ] Deduced a trap composed of 4 places in 197 ms of which 1 ms to minimize.
[2024-05-29 22:26:55] [INFO ] Deduced a trap composed of 4 places in 147 ms of which 1 ms to minimize.
[2024-05-29 22:26:55] [INFO ] Deduced a trap composed of 4 places in 645 ms of which 1 ms to minimize.
[2024-05-29 22:26:56] [INFO ] Deduced a trap composed of 4 places in 615 ms of which 0 ms to minimize.
[2024-05-29 22:26:57] [INFO ] Deduced a trap composed of 4 places in 621 ms of which 1 ms to minimize.
[2024-05-29 22:26:57] [INFO ] Deduced a trap composed of 4 places in 613 ms of which 0 ms to minimize.
[2024-05-29 22:26:58] [INFO ] Deduced a trap composed of 4 places in 607 ms of which 0 ms to minimize.
[2024-05-29 22:26:58] [INFO ] Deduced a trap composed of 4 places in 620 ms of which 1 ms to minimize.
[2024-05-29 22:26:59] [INFO ] Deduced a trap composed of 4 places in 523 ms of which 0 ms to minimize.
[2024-05-29 22:26:59] [INFO ] Deduced a trap composed of 4 places in 439 ms of which 1 ms to minimize.
[2024-05-29 22:27:00] [INFO ] Deduced a trap composed of 4 places in 388 ms of which 0 ms to minimize.
[2024-05-29 22:27:00] [INFO ] Deduced a trap composed of 4 places in 342 ms of which 0 ms to minimize.
[2024-05-29 22:27:01] [INFO ] Deduced a trap composed of 4 places in 509 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
[2024-05-29 22:27:01] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 1 ms to minimize.
[2024-05-29 22:27:01] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 1 ms to minimize.
[2024-05-29 22:27:01] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 0 ms to minimize.
[2024-05-29 22:27:01] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 1 ms to minimize.
[2024-05-29 22:27:01] [INFO ] Deduced a trap composed of 4 places in 102 ms of which 0 ms to minimize.
[2024-05-29 22:27:01] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 1 ms to minimize.
[2024-05-29 22:27:02] [INFO ] Deduced a trap composed of 4 places in 107 ms of which 0 ms to minimize.
[2024-05-29 22:27:02] [INFO ] Deduced a trap composed of 4 places in 99 ms of which 0 ms to minimize.
[2024-05-29 22:27:02] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 1 ms to minimize.
[2024-05-29 22:27:02] [INFO ] Deduced a trap composed of 4 places in 101 ms of which 0 ms to minimize.
[2024-05-29 22:27:02] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 0 ms to minimize.
[2024-05-29 22:27:02] [INFO ] Deduced a trap composed of 4 places in 97 ms of which 0 ms to minimize.
[2024-05-29 22:27:02] [INFO ] Deduced a trap composed of 4 places in 111 ms of which 0 ms to minimize.
[2024-05-29 22:27:02] [INFO ] Deduced a trap composed of 4 places in 290 ms of which 0 ms to minimize.
[2024-05-29 22:27:03] [INFO ] Deduced a trap composed of 4 places in 243 ms of which 1 ms to minimize.
[2024-05-29 22:27:03] [INFO ] Deduced a trap composed of 4 places in 195 ms of which 0 ms to minimize.
[2024-05-29 22:27:03] [INFO ] Deduced a trap composed of 4 places in 194 ms of which 1 ms to minimize.
[2024-05-29 22:27:03] [INFO ] Deduced a trap composed of 4 places in 147 ms of which 0 ms to minimize.
[2024-05-29 22:27:03] [INFO ] Deduced a trap composed of 4 places in 106 ms of which 1 ms to minimize.
[2024-05-29 22:27:03] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
[2024-05-29 22:27:07] [INFO ] Deduced a trap composed of 4 places in 350 ms of which 0 ms to minimize.
[2024-05-29 22:27:08] [INFO ] Deduced a trap composed of 4 places in 338 ms of which 0 ms to minimize.
[2024-05-29 22:27:08] [INFO ] Deduced a trap composed of 4 places in 303 ms of which 0 ms to minimize.
[2024-05-29 22:27:08] [INFO ] Deduced a trap composed of 4 places in 252 ms of which 1 ms to minimize.
[2024-05-29 22:27:08] [INFO ] Deduced a trap composed of 4 places in 199 ms of which 1 ms to minimize.
[2024-05-29 22:27:09] [INFO ] Deduced a trap composed of 4 places in 149 ms of which 0 ms to minimize.
[2024-05-29 22:27:09] [INFO ] Deduced a trap composed of 4 places in 241 ms of which 1 ms to minimize.
[2024-05-29 22:27:09] [INFO ] Deduced a trap composed of 4 places in 200 ms of which 0 ms to minimize.
[2024-05-29 22:27:09] [INFO ] Deduced a trap composed of 4 places in 201 ms of which 1 ms to minimize.
[2024-05-29 22:27:09] [INFO ] Deduced a trap composed of 4 places in 149 ms of which 0 ms to minimize.
[2024-05-29 22:27:09] [INFO ] Deduced a trap composed of 4 places in 150 ms of which 0 ms to minimize.
[2024-05-29 22:27:10] [INFO ] Deduced a trap composed of 4 places in 146 ms of which 0 ms to minimize.
[2024-05-29 22:27:10] [INFO ] Deduced a trap composed of 4 places in 114 ms of which 0 ms to minimize.
[2024-05-29 22:27:10] [INFO ] Deduced a trap composed of 4 places in 102 ms of which 1 ms to minimize.
[2024-05-29 22:27:10] [INFO ] Deduced a trap composed of 4 places in 149 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 34/2126 variables, and 56 constraints, problems are : Problem set: 0 solved, 2093 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/34 constraints, ReadFeed: 0/2069 constraints, PredecessorRefiner: 2093/1 constraints, Known Traps: 55/55 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2093 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 1 (OVERLAPS) 11/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 55/56 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 4 (OVERLAPS) 2091/2125 variables, 34/90 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2125 variables, 2068/2158 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2125/2126 variables, and 2159 constraints, problems are : Problem set: 0 solved, 2093 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 34/34 constraints, ReadFeed: 2068/2069 constraints, PredecessorRefiner: 2093/1 constraints, Known Traps: 55/55 constraints]
After SMT, in 92829ms problems are : Problem set: 0 solved, 2093 unsolved
Search for dead transitions found 0 dead transitions in 92851ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 94435 ms. Remains : 34/34 places, 2104/2104 transitions.
Built C files in :
/tmp/ltsmin14791189665215474123
[2024-05-29 22:27:47] [INFO ] Too many transitions (2104) to apply POR reductions. Disabling POR matrices.
[2024-05-29 22:27:47] [INFO ] Built C files in 43ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14791189665215474123
Running compilation step : cd /tmp/ltsmin14791189665215474123;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14791189665215474123;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14791189665215474123;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-29 22:27:51] [INFO ] Flatten gal took : 149 ms
[2024-05-29 22:27:51] [INFO ] Flatten gal took : 133 ms
[2024-05-29 22:27:51] [INFO ] Time to serialize gal into /tmp/LTL12497615524621976036.gal : 58 ms
[2024-05-29 22:27:51] [INFO ] Time to serialize properties into /tmp/LTL14293594020214754799.prop : 0 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/LTL12497615524621976036.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16878080421910635040.hoa' '-atoms' '/tmp/LTL14293594020214754799.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/LTL14293594020214754799.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16878080421910635040.hoa
Reverse transition relation is NOT exact ! Due to transitions t3, t8, t13, t18, t23, t28, t33, t38, t43, t48, t53, t72.t4216, t73.t4214, t71.t4212, t74.t42...338
Detected timeout of ITS tools.
[2024-05-29 22:28:07] [INFO ] Flatten gal took : 132 ms
[2024-05-29 22:28:07] [INFO ] Flatten gal took : 133 ms
[2024-05-29 22:28:07] [INFO ] Time to serialize gal into /tmp/LTL13342094096227138700.gal : 29 ms
[2024-05-29 22:28:07] [INFO ] Time to serialize properties into /tmp/LTL5378557422235755597.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/LTL13342094096227138700.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5378557422235755597.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...276
Read 1 LTL properties
Checking formula 0 : !((F("(((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&(((p68==1)&&(p82==1))&&((p96==1)&&(p110==1))))&&(((p124==1)&&(p138==1))&&(p152==...163
Formula 0 simplified : G!"(((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&(((p68==1)&&(p82==1))&&((p96==1)&&(p110==1))))&&(((p124==1)&&(p138==1))&&(p152==1...159
Reverse transition relation is NOT exact ! Due to transitions t3, t8, t13, t18, t23, t28, t33, t38, t43, t48, t53, t72.t4216, t73.t4214, t71.t4212, t74.t42...338
Detected timeout of ITS tools.
[2024-05-29 22:28:22] [INFO ] Flatten gal took : 129 ms
[2024-05-29 22:28:22] [INFO ] Applying decomposition
[2024-05-29 22:28:22] [INFO ] Flatten gal took : 130 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/graph4724321154725820448.txt' '-o' '/tmp/graph4724321154725820448.bin' '-w' '/tmp/graph4724321154725820448.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4724321154725820448.bin' '-l' '-1' '-v' '-w' '/tmp/graph4724321154725820448.weights' '-q' '0' '-e' '0.001'
[2024-05-29 22:28:23] [INFO ] Decomposing Gal with order
[2024-05-29 22:28:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 22:28:23] [INFO ] Removed a total of 22725 redundant transitions.
[2024-05-29 22:28:23] [INFO ] Flatten gal took : 549 ms
[2024-05-29 22:28:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 231 ms.
[2024-05-29 22:28:24] [INFO ] Time to serialize gal into /tmp/LTL1471180899187516266.gal : 30 ms
[2024-05-29 22:28:24] [INFO ] Time to serialize properties into /tmp/LTL6671067596091927575.ltl : 0 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/LTL1471180899187516266.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6671067596091927575.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...254
Read 1 LTL properties
Checking formula 0 : !((F("(((((u0.p12==1)&&(u1.p26==1))&&((u2.p40==1)&&(u3.p54==1)))&&(((u4.p68==1)&&(u5.p82==1))&&((u6.p96==1)&&(u7.p110==1))))&&(((u8.p1...197
Formula 0 simplified : G!"(((((u0.p12==1)&&(u1.p26==1))&&((u2.p40==1)&&(u3.p54==1)))&&(((u4.p68==1)&&(u5.p82==1))&&((u6.p96==1)&&(u7.p110==1))))&&(((u8.p12...193
Reverse transition relation is NOT exact ! Due to transitions u0.t53, u0.t72.t4216, u1.t48, u1.t73.t4214, u2.t43, u2.t71.t4212, u3.t38, u3.t74.t4210, u4.t3...406
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
64 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,0.806545,30260,1,0,6253,123,19566,1441,133,262,24459
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA StigmergyElection-PT-11a-LTLFireability-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property StigmergyElection-PT-11a-LTLFireability-09 finished in 353533 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 11 out of 90 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 90/90 places, 4218/4218 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 22 Pre rules applied. Total rules applied 0 place count 89 transition count 4195
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 0 with 44 rules applied. Total rules applied 44 place count 67 transition count 4195
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 0 with 44 rules applied. Total rules applied 88 place count 45 transition count 4173
Ensure Unique test removed 2047 transitions
Reduce isomorphic transitions removed 2047 transitions.
Iterating post reduction 0 with 2047 rules applied. Total rules applied 2135 place count 45 transition count 2126
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 1 with 11 rules applied. Total rules applied 2146 place count 45 transition count 2115
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 1 with 22 rules applied. Total rules applied 2168 place count 34 transition count 2104
Applied a total of 2168 rules in 1654 ms. Remains 34 /90 variables (removed 56) and now considering 2104/4218 (removed 2114) transitions.
[2024-05-29 22:28:26] [INFO ] Flow matrix only has 2092 transitions (discarded 12 similar events)
[2024-05-29 22:28:26] [INFO ] Invariant cache hit.
[2024-05-29 22:28:26] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-29 22:28:26] [INFO ] Flow matrix only has 2092 transitions (discarded 12 similar events)
[2024-05-29 22:28:26] [INFO ] Invariant cache hit.
[2024-05-29 22:28:27] [INFO ] State equation strengthened by 2069 read => feed constraints.
[2024-05-29 22:28:27] [INFO ] Implicit Places using invariants and state equation in 648 ms returned []
Implicit Place search using SMT with State Equation took 678 ms to find 0 implicit places.
[2024-05-29 22:28:27] [INFO ] Redundant transitions in 224 ms returned []
Running 2093 sub problems to find dead transitions.
[2024-05-29 22:28:27] [INFO ] Flow matrix only has 2092 transitions (discarded 12 similar events)
[2024-05-29 22:28:27] [INFO ] Invariant cache hit.
[2024-05-29 22:28:27] [INFO ] State equation strengthened by 2069 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 1 (OVERLAPS) 11/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
[2024-05-29 22:29:11] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 0 ms to minimize.
[2024-05-29 22:29:11] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 0 ms to minimize.
[2024-05-29 22:29:11] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 1 ms to minimize.
[2024-05-29 22:29:11] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 1 ms to minimize.
[2024-05-29 22:29:11] [INFO ] Deduced a trap composed of 4 places in 225 ms of which 1 ms to minimize.
[2024-05-29 22:29:11] [INFO ] Deduced a trap composed of 4 places in 191 ms of which 0 ms to minimize.
[2024-05-29 22:29:12] [INFO ] Deduced a trap composed of 4 places in 224 ms of which 2 ms to minimize.
[2024-05-29 22:29:12] [INFO ] Deduced a trap composed of 4 places in 203 ms of which 1 ms to minimize.
[2024-05-29 22:29:12] [INFO ] Deduced a trap composed of 4 places in 170 ms of which 1 ms to minimize.
[2024-05-29 22:29:13] [INFO ] Deduced a trap composed of 4 places in 692 ms of which 1 ms to minimize.
[2024-05-29 22:29:13] [INFO ] Deduced a trap composed of 4 places in 626 ms of which 0 ms to minimize.
[2024-05-29 22:29:14] [INFO ] Deduced a trap composed of 4 places in 618 ms of which 1 ms to minimize.
[2024-05-29 22:29:15] [INFO ] Deduced a trap composed of 4 places in 622 ms of which 1 ms to minimize.
[2024-05-29 22:29:15] [INFO ] Deduced a trap composed of 4 places in 604 ms of which 1 ms to minimize.
[2024-05-29 22:29:16] [INFO ] Deduced a trap composed of 4 places in 622 ms of which 0 ms to minimize.
[2024-05-29 22:29:16] [INFO ] Deduced a trap composed of 4 places in 528 ms of which 0 ms to minimize.
[2024-05-29 22:29:17] [INFO ] Deduced a trap composed of 4 places in 460 ms of which 1 ms to minimize.
[2024-05-29 22:29:17] [INFO ] Deduced a trap composed of 4 places in 400 ms of which 0 ms to minimize.
[2024-05-29 22:29:18] [INFO ] Deduced a trap composed of 4 places in 338 ms of which 0 ms to minimize.
[2024-05-29 22:29:18] [INFO ] Deduced a trap composed of 4 places in 514 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
[2024-05-29 22:29:18] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 0 ms to minimize.
[2024-05-29 22:29:19] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 0 ms to minimize.
[2024-05-29 22:29:19] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 1 ms to minimize.
[2024-05-29 22:29:19] [INFO ] Deduced a trap composed of 4 places in 108 ms of which 0 ms to minimize.
[2024-05-29 22:29:19] [INFO ] Deduced a trap composed of 4 places in 106 ms of which 1 ms to minimize.
[2024-05-29 22:29:19] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 1 ms to minimize.
[2024-05-29 22:29:19] [INFO ] Deduced a trap composed of 4 places in 102 ms of which 0 ms to minimize.
[2024-05-29 22:29:19] [INFO ] Deduced a trap composed of 4 places in 102 ms of which 1 ms to minimize.
[2024-05-29 22:29:19] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 0 ms to minimize.
[2024-05-29 22:29:19] [INFO ] Deduced a trap composed of 4 places in 105 ms of which 0 ms to minimize.
[2024-05-29 22:29:19] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 1 ms to minimize.
[2024-05-29 22:29:19] [INFO ] Deduced a trap composed of 4 places in 96 ms of which 1 ms to minimize.
[2024-05-29 22:29:20] [INFO ] Deduced a trap composed of 4 places in 101 ms of which 1 ms to minimize.
[2024-05-29 22:29:20] [INFO ] Deduced a trap composed of 4 places in 293 ms of which 0 ms to minimize.
[2024-05-29 22:29:20] [INFO ] Deduced a trap composed of 4 places in 235 ms of which 1 ms to minimize.
[2024-05-29 22:29:20] [INFO ] Deduced a trap composed of 4 places in 190 ms of which 1 ms to minimize.
[2024-05-29 22:29:20] [INFO ] Deduced a trap composed of 4 places in 190 ms of which 0 ms to minimize.
[2024-05-29 22:29:21] [INFO ] Deduced a trap composed of 4 places in 146 ms of which 0 ms to minimize.
[2024-05-29 22:29:21] [INFO ] Deduced a trap composed of 4 places in 107 ms of which 1 ms to minimize.
[2024-05-29 22:29:21] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
[2024-05-29 22:29:25] [INFO ] Deduced a trap composed of 4 places in 365 ms of which 1 ms to minimize.
[2024-05-29 22:29:25] [INFO ] Deduced a trap composed of 4 places in 352 ms of which 1 ms to minimize.
[2024-05-29 22:29:25] [INFO ] Deduced a trap composed of 4 places in 297 ms of which 0 ms to minimize.
[2024-05-29 22:29:26] [INFO ] Deduced a trap composed of 4 places in 249 ms of which 0 ms to minimize.
[2024-05-29 22:29:26] [INFO ] Deduced a trap composed of 4 places in 208 ms of which 1 ms to minimize.
[2024-05-29 22:29:26] [INFO ] Deduced a trap composed of 4 places in 150 ms of which 0 ms to minimize.
[2024-05-29 22:29:26] [INFO ] Deduced a trap composed of 4 places in 249 ms of which 0 ms to minimize.
[2024-05-29 22:29:26] [INFO ] Deduced a trap composed of 4 places in 204 ms of which 0 ms to minimize.
[2024-05-29 22:29:27] [INFO ] Deduced a trap composed of 4 places in 197 ms of which 0 ms to minimize.
[2024-05-29 22:29:27] [INFO ] Deduced a trap composed of 4 places in 150 ms of which 0 ms to minimize.
[2024-05-29 22:29:27] [INFO ] Deduced a trap composed of 4 places in 148 ms of which 0 ms to minimize.
[2024-05-29 22:29:27] [INFO ] Deduced a trap composed of 4 places in 145 ms of which 0 ms to minimize.
[2024-05-29 22:29:27] [INFO ] Deduced a trap composed of 4 places in 105 ms of which 0 ms to minimize.
[2024-05-29 22:29:27] [INFO ] Deduced a trap composed of 4 places in 106 ms of which 0 ms to minimize.
[2024-05-29 22:29:27] [INFO ] Deduced a trap composed of 4 places in 145 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 34/2126 variables, and 56 constraints, problems are : Problem set: 0 solved, 2093 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/34 constraints, ReadFeed: 0/2069 constraints, PredecessorRefiner: 2093/1 constraints, Known Traps: 55/55 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2093 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 1 (OVERLAPS) 11/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 55/56 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 4 (OVERLAPS) 2091/2125 variables, 34/90 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2125 variables, 2068/2158 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2125/2126 variables, and 2159 constraints, problems are : Problem set: 0 solved, 2093 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 34/34 constraints, ReadFeed: 2068/2069 constraints, PredecessorRefiner: 2093/1 constraints, Known Traps: 55/55 constraints]
After SMT, in 97157ms problems are : Problem set: 0 solved, 2093 unsolved
Search for dead transitions found 0 dead transitions in 97177ms
Starting structural reductions in SI_LTL mode, iteration 1 : 34/90 places, 2104/4218 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 99744 ms. Remains : 34/90 places, 2104/4218 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Running random walk in product with property : StigmergyElection-PT-11a-LTLFireability-11
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 1 ms.
FORMULA StigmergyElection-PT-11a-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-11a-LTLFireability-11 finished in 99819 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 11 out of 90 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 90/90 places, 4218/4218 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 22 Pre rules applied. Total rules applied 0 place count 89 transition count 4195
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 0 with 44 rules applied. Total rules applied 44 place count 67 transition count 4195
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 0 with 44 rules applied. Total rules applied 88 place count 45 transition count 4173
Ensure Unique test removed 2047 transitions
Reduce isomorphic transitions removed 2047 transitions.
Iterating post reduction 0 with 2047 rules applied. Total rules applied 2135 place count 45 transition count 2126
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 1 with 11 rules applied. Total rules applied 2146 place count 45 transition count 2115
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 1 with 22 rules applied. Total rules applied 2168 place count 34 transition count 2104
Applied a total of 2168 rules in 1653 ms. Remains 34 /90 variables (removed 56) and now considering 2104/4218 (removed 2114) transitions.
[2024-05-29 22:30:06] [INFO ] Flow matrix only has 2092 transitions (discarded 12 similar events)
[2024-05-29 22:30:06] [INFO ] Invariant cache hit.
[2024-05-29 22:30:06] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-29 22:30:06] [INFO ] Flow matrix only has 2092 transitions (discarded 12 similar events)
[2024-05-29 22:30:06] [INFO ] Invariant cache hit.
[2024-05-29 22:30:06] [INFO ] State equation strengthened by 2069 read => feed constraints.
[2024-05-29 22:30:07] [INFO ] Implicit Places using invariants and state equation in 623 ms returned []
Implicit Place search using SMT with State Equation took 660 ms to find 0 implicit places.
[2024-05-29 22:30:07] [INFO ] Redundant transitions in 259 ms returned []
Running 2093 sub problems to find dead transitions.
[2024-05-29 22:30:07] [INFO ] Flow matrix only has 2092 transitions (discarded 12 similar events)
[2024-05-29 22:30:07] [INFO ] Invariant cache hit.
[2024-05-29 22:30:07] [INFO ] State equation strengthened by 2069 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 1 (OVERLAPS) 11/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
[2024-05-29 22:30:46] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 0 ms to minimize.
[2024-05-29 22:30:46] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 0 ms to minimize.
[2024-05-29 22:30:46] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 1 ms to minimize.
[2024-05-29 22:30:46] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 1 ms to minimize.
[2024-05-29 22:30:46] [INFO ] Deduced a trap composed of 4 places in 199 ms of which 1 ms to minimize.
[2024-05-29 22:30:47] [INFO ] Deduced a trap composed of 4 places in 194 ms of which 1 ms to minimize.
[2024-05-29 22:30:47] [INFO ] Deduced a trap composed of 4 places in 187 ms of which 0 ms to minimize.
[2024-05-29 22:30:47] [INFO ] Deduced a trap composed of 4 places in 190 ms of which 0 ms to minimize.
[2024-05-29 22:30:47] [INFO ] Deduced a trap composed of 4 places in 143 ms of which 0 ms to minimize.
[2024-05-29 22:30:48] [INFO ] Deduced a trap composed of 4 places in 634 ms of which 0 ms to minimize.
[2024-05-29 22:30:48] [INFO ] Deduced a trap composed of 4 places in 618 ms of which 0 ms to minimize.
[2024-05-29 22:30:49] [INFO ] Deduced a trap composed of 4 places in 632 ms of which 1 ms to minimize.
[2024-05-29 22:30:50] [INFO ] Deduced a trap composed of 4 places in 632 ms of which 1 ms to minimize.
[2024-05-29 22:30:50] [INFO ] Deduced a trap composed of 4 places in 594 ms of which 1 ms to minimize.
[2024-05-29 22:30:51] [INFO ] Deduced a trap composed of 4 places in 602 ms of which 1 ms to minimize.
[2024-05-29 22:30:51] [INFO ] Deduced a trap composed of 4 places in 514 ms of which 1 ms to minimize.
[2024-05-29 22:30:52] [INFO ] Deduced a trap composed of 4 places in 449 ms of which 0 ms to minimize.
[2024-05-29 22:30:52] [INFO ] Deduced a trap composed of 4 places in 393 ms of which 1 ms to minimize.
[2024-05-29 22:30:53] [INFO ] Deduced a trap composed of 4 places in 334 ms of which 1 ms to minimize.
[2024-05-29 22:30:53] [INFO ] Deduced a trap composed of 4 places in 512 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
[2024-05-29 22:30:54] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 0 ms to minimize.
[2024-05-29 22:30:54] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 0 ms to minimize.
[2024-05-29 22:30:54] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 1 ms to minimize.
[2024-05-29 22:30:54] [INFO ] Deduced a trap composed of 4 places in 105 ms of which 1 ms to minimize.
[2024-05-29 22:30:54] [INFO ] Deduced a trap composed of 4 places in 106 ms of which 0 ms to minimize.
[2024-05-29 22:30:54] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 0 ms to minimize.
[2024-05-29 22:30:54] [INFO ] Deduced a trap composed of 4 places in 103 ms of which 0 ms to minimize.
[2024-05-29 22:30:54] [INFO ] Deduced a trap composed of 4 places in 102 ms of which 1 ms to minimize.
[2024-05-29 22:30:54] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 1 ms to minimize.
[2024-05-29 22:30:54] [INFO ] Deduced a trap composed of 4 places in 111 ms of which 5 ms to minimize.
[2024-05-29 22:30:54] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 0 ms to minimize.
[2024-05-29 22:30:55] [INFO ] Deduced a trap composed of 4 places in 101 ms of which 1 ms to minimize.
[2024-05-29 22:30:55] [INFO ] Deduced a trap composed of 4 places in 103 ms of which 0 ms to minimize.
[2024-05-29 22:30:55] [INFO ] Deduced a trap composed of 4 places in 310 ms of which 0 ms to minimize.
[2024-05-29 22:30:55] [INFO ] Deduced a trap composed of 4 places in 238 ms of which 1 ms to minimize.
[2024-05-29 22:30:55] [INFO ] Deduced a trap composed of 4 places in 203 ms of which 1 ms to minimize.
[2024-05-29 22:30:56] [INFO ] Deduced a trap composed of 4 places in 189 ms of which 0 ms to minimize.
[2024-05-29 22:30:56] [INFO ] Deduced a trap composed of 4 places in 144 ms of which 0 ms to minimize.
[2024-05-29 22:30:56] [INFO ] Deduced a trap composed of 4 places in 99 ms of which 0 ms to minimize.
[2024-05-29 22:30:56] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
[2024-05-29 22:31:00] [INFO ] Deduced a trap composed of 4 places in 345 ms of which 0 ms to minimize.
[2024-05-29 22:31:00] [INFO ] Deduced a trap composed of 4 places in 339 ms of which 1 ms to minimize.
[2024-05-29 22:31:01] [INFO ] Deduced a trap composed of 4 places in 292 ms of which 1 ms to minimize.
[2024-05-29 22:31:01] [INFO ] Deduced a trap composed of 4 places in 256 ms of which 1 ms to minimize.
[2024-05-29 22:31:01] [INFO ] Deduced a trap composed of 4 places in 198 ms of which 1 ms to minimize.
[2024-05-29 22:31:01] [INFO ] Deduced a trap composed of 4 places in 145 ms of which 0 ms to minimize.
[2024-05-29 22:31:01] [INFO ] Deduced a trap composed of 4 places in 237 ms of which 0 ms to minimize.
[2024-05-29 22:31:02] [INFO ] Deduced a trap composed of 4 places in 192 ms of which 1 ms to minimize.
[2024-05-29 22:31:02] [INFO ] Deduced a trap composed of 4 places in 180 ms of which 0 ms to minimize.
[2024-05-29 22:31:02] [INFO ] Deduced a trap composed of 4 places in 158 ms of which 0 ms to minimize.
[2024-05-29 22:31:02] [INFO ] Deduced a trap composed of 4 places in 147 ms of which 1 ms to minimize.
[2024-05-29 22:31:02] [INFO ] Deduced a trap composed of 4 places in 150 ms of which 1 ms to minimize.
[2024-05-29 22:31:02] [INFO ] Deduced a trap composed of 4 places in 108 ms of which 0 ms to minimize.
[2024-05-29 22:31:03] [INFO ] Deduced a trap composed of 4 places in 100 ms of which 1 ms to minimize.
[2024-05-29 22:31:03] [INFO ] Deduced a trap composed of 4 places in 140 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 34/2126 variables, and 56 constraints, problems are : Problem set: 0 solved, 2093 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/34 constraints, ReadFeed: 0/2069 constraints, PredecessorRefiner: 2093/1 constraints, Known Traps: 55/55 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2093 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 1 (OVERLAPS) 11/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 55/56 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 4 (OVERLAPS) 2091/2125 variables, 34/90 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2125 variables, 2068/2158 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2125/2126 variables, and 2159 constraints, problems are : Problem set: 0 solved, 2093 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 34/34 constraints, ReadFeed: 2068/2069 constraints, PredecessorRefiner: 2093/1 constraints, Known Traps: 55/55 constraints]
After SMT, in 92718ms problems are : Problem set: 0 solved, 2093 unsolved
Search for dead transitions found 0 dead transitions in 92738ms
Starting structural reductions in SI_LTL mode, iteration 1 : 34/90 places, 2104/4218 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 95326 ms. Remains : 34/90 places, 2104/4218 transitions.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Running random walk in product with property : StigmergyElection-PT-11a-LTLFireability-12
Product exploration explored 100000 steps with 8333 reset in 4719 ms.
Product exploration explored 100000 steps with 8333 reset in 4772 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 84 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 44 ms :[(NOT p0)]
RANDOM walk for 44 steps (0 resets) in 9 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 102 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 28 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
[2024-05-29 22:31:50] [INFO ] Flow matrix only has 2092 transitions (discarded 12 similar events)
[2024-05-29 22:31:50] [INFO ] Invariant cache hit.
[2024-05-29 22:31:51] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-29 22:31:51] [INFO ] [Real]Absence check using state equation in 349 ms returned sat
[2024-05-29 22:31:51] [INFO ] State equation strengthened by 2069 read => feed constraints.
[2024-05-29 22:31:51] [INFO ] [Real]Added 2069 Read/Feed constraints in 212 ms returned sat
[2024-05-29 22:31:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 22:31:53] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-29 22:31:53] [INFO ] [Nat]Absence check using state equation in 345 ms returned sat
[2024-05-29 22:31:53] [INFO ] [Nat]Added 2069 Read/Feed constraints in 263 ms returned sat
[2024-05-29 22:31:54] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 2081 transitions) in 244 ms.
[2024-05-29 22:31:54] [INFO ] Added : 0 causal constraints over 0 iterations in 390 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 11 out of 34 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 34/34 places, 2104/2104 transitions.
Applied a total of 0 rules in 670 ms. Remains 34 /34 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
[2024-05-29 22:31:54] [INFO ] Flow matrix only has 2092 transitions (discarded 12 similar events)
[2024-05-29 22:31:54] [INFO ] Invariant cache hit.
[2024-05-29 22:31:54] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-29 22:31:54] [INFO ] Flow matrix only has 2092 transitions (discarded 12 similar events)
[2024-05-29 22:31:54] [INFO ] Invariant cache hit.
[2024-05-29 22:31:55] [INFO ] State equation strengthened by 2069 read => feed constraints.
[2024-05-29 22:31:55] [INFO ] Implicit Places using invariants and state equation in 639 ms returned []
Implicit Place search using SMT with State Equation took 668 ms to find 0 implicit places.
[2024-05-29 22:31:55] [INFO ] Redundant transitions in 222 ms returned []
Running 2093 sub problems to find dead transitions.
[2024-05-29 22:31:55] [INFO ] Flow matrix only has 2092 transitions (discarded 12 similar events)
[2024-05-29 22:31:55] [INFO ] Invariant cache hit.
[2024-05-29 22:31:55] [INFO ] State equation strengthened by 2069 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 1 (OVERLAPS) 11/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
[2024-05-29 22:32:35] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 1 ms to minimize.
[2024-05-29 22:32:35] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 1 ms to minimize.
[2024-05-29 22:32:35] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 0 ms to minimize.
[2024-05-29 22:32:35] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 0 ms to minimize.
[2024-05-29 22:32:35] [INFO ] Deduced a trap composed of 4 places in 193 ms of which 0 ms to minimize.
[2024-05-29 22:32:36] [INFO ] Deduced a trap composed of 4 places in 188 ms of which 0 ms to minimize.
[2024-05-29 22:32:36] [INFO ] Deduced a trap composed of 4 places in 197 ms of which 1 ms to minimize.
[2024-05-29 22:32:36] [INFO ] Deduced a trap composed of 4 places in 197 ms of which 1 ms to minimize.
[2024-05-29 22:32:36] [INFO ] Deduced a trap composed of 4 places in 144 ms of which 1 ms to minimize.
[2024-05-29 22:32:37] [INFO ] Deduced a trap composed of 4 places in 630 ms of which 1 ms to minimize.
[2024-05-29 22:32:37] [INFO ] Deduced a trap composed of 4 places in 615 ms of which 0 ms to minimize.
[2024-05-29 22:32:38] [INFO ] Deduced a trap composed of 4 places in 625 ms of which 0 ms to minimize.
[2024-05-29 22:32:39] [INFO ] Deduced a trap composed of 4 places in 605 ms of which 0 ms to minimize.
[2024-05-29 22:32:39] [INFO ] Deduced a trap composed of 4 places in 605 ms of which 0 ms to minimize.
[2024-05-29 22:32:40] [INFO ] Deduced a trap composed of 4 places in 620 ms of which 1 ms to minimize.
[2024-05-29 22:32:40] [INFO ] Deduced a trap composed of 4 places in 523 ms of which 0 ms to minimize.
[2024-05-29 22:32:41] [INFO ] Deduced a trap composed of 4 places in 454 ms of which 1 ms to minimize.
[2024-05-29 22:32:41] [INFO ] Deduced a trap composed of 4 places in 390 ms of which 0 ms to minimize.
[2024-05-29 22:32:42] [INFO ] Deduced a trap composed of 4 places in 330 ms of which 1 ms to minimize.
[2024-05-29 22:32:42] [INFO ] Deduced a trap composed of 4 places in 512 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
[2024-05-29 22:32:43] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 1 ms to minimize.
[2024-05-29 22:32:43] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 0 ms to minimize.
[2024-05-29 22:32:43] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 0 ms to minimize.
[2024-05-29 22:32:43] [INFO ] Deduced a trap composed of 4 places in 108 ms of which 1 ms to minimize.
[2024-05-29 22:32:43] [INFO ] Deduced a trap composed of 4 places in 99 ms of which 1 ms to minimize.
[2024-05-29 22:32:43] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 0 ms to minimize.
[2024-05-29 22:32:43] [INFO ] Deduced a trap composed of 4 places in 101 ms of which 1 ms to minimize.
[2024-05-29 22:32:43] [INFO ] Deduced a trap composed of 4 places in 108 ms of which 1 ms to minimize.
[2024-05-29 22:32:43] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 0 ms to minimize.
[2024-05-29 22:32:43] [INFO ] Deduced a trap composed of 4 places in 108 ms of which 1 ms to minimize.
[2024-05-29 22:32:43] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 0 ms to minimize.
[2024-05-29 22:32:44] [INFO ] Deduced a trap composed of 4 places in 99 ms of which 0 ms to minimize.
[2024-05-29 22:32:44] [INFO ] Deduced a trap composed of 4 places in 109 ms of which 0 ms to minimize.
[2024-05-29 22:32:44] [INFO ] Deduced a trap composed of 4 places in 300 ms of which 1 ms to minimize.
[2024-05-29 22:32:44] [INFO ] Deduced a trap composed of 4 places in 246 ms of which 1 ms to minimize.
[2024-05-29 22:32:44] [INFO ] Deduced a trap composed of 4 places in 195 ms of which 0 ms to minimize.
[2024-05-29 22:32:45] [INFO ] Deduced a trap composed of 4 places in 186 ms of which 0 ms to minimize.
[2024-05-29 22:32:45] [INFO ] Deduced a trap composed of 4 places in 152 ms of which 1 ms to minimize.
[2024-05-29 22:32:45] [INFO ] Deduced a trap composed of 4 places in 103 ms of which 0 ms to minimize.
[2024-05-29 22:32:45] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
[2024-05-29 22:32:49] [INFO ] Deduced a trap composed of 4 places in 353 ms of which 1 ms to minimize.
[2024-05-29 22:32:49] [INFO ] Deduced a trap composed of 4 places in 348 ms of which 1 ms to minimize.
[2024-05-29 22:32:50] [INFO ] Deduced a trap composed of 4 places in 290 ms of which 0 ms to minimize.
[2024-05-29 22:32:50] [INFO ] Deduced a trap composed of 4 places in 244 ms of which 0 ms to minimize.
[2024-05-29 22:32:50] [INFO ] Deduced a trap composed of 4 places in 199 ms of which 1 ms to minimize.
[2024-05-29 22:32:50] [INFO ] Deduced a trap composed of 4 places in 155 ms of which 1 ms to minimize.
[2024-05-29 22:32:50] [INFO ] Deduced a trap composed of 4 places in 245 ms of which 0 ms to minimize.
[2024-05-29 22:32:51] [INFO ] Deduced a trap composed of 4 places in 193 ms of which 1 ms to minimize.
[2024-05-29 22:32:51] [INFO ] Deduced a trap composed of 4 places in 198 ms of which 0 ms to minimize.
[2024-05-29 22:32:51] [INFO ] Deduced a trap composed of 4 places in 152 ms of which 1 ms to minimize.
[2024-05-29 22:32:51] [INFO ] Deduced a trap composed of 4 places in 152 ms of which 0 ms to minimize.
[2024-05-29 22:32:51] [INFO ] Deduced a trap composed of 4 places in 152 ms of which 1 ms to minimize.
[2024-05-29 22:32:51] [INFO ] Deduced a trap composed of 4 places in 106 ms of which 0 ms to minimize.
[2024-05-29 22:32:52] [INFO ] Deduced a trap composed of 4 places in 107 ms of which 0 ms to minimize.
[2024-05-29 22:32:52] [INFO ] Deduced a trap composed of 4 places in 147 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 34/2126 variables, and 56 constraints, problems are : Problem set: 0 solved, 2093 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/34 constraints, ReadFeed: 0/2069 constraints, PredecessorRefiner: 2093/1 constraints, Known Traps: 55/55 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2093 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 1 (OVERLAPS) 11/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 55/56 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 4 (OVERLAPS) 2091/2125 variables, 34/90 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2125 variables, 2068/2158 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2125/2126 variables, and 2159 constraints, problems are : Problem set: 0 solved, 2093 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 34/34 constraints, ReadFeed: 2068/2069 constraints, PredecessorRefiner: 2093/1 constraints, Known Traps: 55/55 constraints]
After SMT, in 93390ms problems are : Problem set: 0 solved, 2093 unsolved
Search for dead transitions found 0 dead transitions in 93411ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 94982 ms. Remains : 34/34 places, 2104/2104 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 66 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 27 ms :[(NOT p0)]
RANDOM walk for 44 steps (0 resets) in 9 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 97 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 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
[2024-05-29 22:33:29] [INFO ] Flow matrix only has 2092 transitions (discarded 12 similar events)
[2024-05-29 22:33:29] [INFO ] Invariant cache hit.
[2024-05-29 22:33:30] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-29 22:33:31] [INFO ] [Real]Absence check using state equation in 346 ms returned sat
[2024-05-29 22:33:31] [INFO ] State equation strengthened by 2069 read => feed constraints.
[2024-05-29 22:33:31] [INFO ] [Real]Added 2069 Read/Feed constraints in 208 ms returned sat
[2024-05-29 22:33:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 22:33:32] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-29 22:33:32] [INFO ] [Nat]Absence check using state equation in 347 ms returned sat
[2024-05-29 22:33:33] [INFO ] [Nat]Added 2069 Read/Feed constraints in 264 ms returned sat
[2024-05-29 22:33:33] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 2081 transitions) in 236 ms.
[2024-05-29 22:33:33] [INFO ] Added : 0 causal constraints over 0 iterations in 381 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Product exploration explored 100000 steps with 8333 reset in 4787 ms.
Product exploration explored 100000 steps with 8333 reset in 4799 ms.
Built C files in :
/tmp/ltsmin9849419539173598125
[2024-05-29 22:33:43] [INFO ] Too many transitions (2104) to apply POR reductions. Disabling POR matrices.
[2024-05-29 22:33:43] [INFO ] Built C files in 52ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9849419539173598125
Running compilation step : cd /tmp/ltsmin9849419539173598125;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9849419539173598125;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9849419539173598125;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 11 out of 34 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 34/34 places, 2104/2104 transitions.
Applied a total of 0 rules in 662 ms. Remains 34 /34 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
[2024-05-29 22:33:47] [INFO ] Flow matrix only has 2092 transitions (discarded 12 similar events)
[2024-05-29 22:33:47] [INFO ] Invariant cache hit.
[2024-05-29 22:33:47] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-29 22:33:47] [INFO ] Flow matrix only has 2092 transitions (discarded 12 similar events)
[2024-05-29 22:33:47] [INFO ] Invariant cache hit.
[2024-05-29 22:33:47] [INFO ] State equation strengthened by 2069 read => feed constraints.
[2024-05-29 22:33:47] [INFO ] Implicit Places using invariants and state equation in 635 ms returned []
Implicit Place search using SMT with State Equation took 662 ms to find 0 implicit places.
[2024-05-29 22:33:47] [INFO ] Redundant transitions in 225 ms returned []
Running 2093 sub problems to find dead transitions.
[2024-05-29 22:33:47] [INFO ] Flow matrix only has 2092 transitions (discarded 12 similar events)
[2024-05-29 22:33:47] [INFO ] Invariant cache hit.
[2024-05-29 22:33:48] [INFO ] State equation strengthened by 2069 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 1 (OVERLAPS) 11/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
[2024-05-29 22:34:27] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 1 ms to minimize.
[2024-05-29 22:34:27] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 0 ms to minimize.
[2024-05-29 22:34:27] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 1 ms to minimize.
[2024-05-29 22:34:27] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 1 ms to minimize.
[2024-05-29 22:34:27] [INFO ] Deduced a trap composed of 4 places in 200 ms of which 0 ms to minimize.
[2024-05-29 22:34:27] [INFO ] Deduced a trap composed of 4 places in 194 ms of which 0 ms to minimize.
[2024-05-29 22:34:27] [INFO ] Deduced a trap composed of 4 places in 197 ms of which 0 ms to minimize.
[2024-05-29 22:34:28] [INFO ] Deduced a trap composed of 4 places in 195 ms of which 1 ms to minimize.
[2024-05-29 22:34:28] [INFO ] Deduced a trap composed of 4 places in 144 ms of which 5 ms to minimize.
[2024-05-29 22:34:28] [INFO ] Deduced a trap composed of 4 places in 629 ms of which 0 ms to minimize.
[2024-05-29 22:34:29] [INFO ] Deduced a trap composed of 4 places in 620 ms of which 1 ms to minimize.
[2024-05-29 22:34:30] [INFO ] Deduced a trap composed of 4 places in 623 ms of which 0 ms to minimize.
[2024-05-29 22:34:30] [INFO ] Deduced a trap composed of 4 places in 625 ms of which 1 ms to minimize.
[2024-05-29 22:34:31] [INFO ] Deduced a trap composed of 4 places in 618 ms of which 0 ms to minimize.
[2024-05-29 22:34:32] [INFO ] Deduced a trap composed of 4 places in 636 ms of which 1 ms to minimize.
[2024-05-29 22:34:32] [INFO ] Deduced a trap composed of 4 places in 526 ms of which 0 ms to minimize.
[2024-05-29 22:34:33] [INFO ] Deduced a trap composed of 4 places in 442 ms of which 1 ms to minimize.
[2024-05-29 22:34:33] [INFO ] Deduced a trap composed of 4 places in 393 ms of which 1 ms to minimize.
[2024-05-29 22:34:33] [INFO ] Deduced a trap composed of 4 places in 338 ms of which 0 ms to minimize.
[2024-05-29 22:34:34] [INFO ] Deduced a trap composed of 4 places in 511 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
[2024-05-29 22:34:34] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 1 ms to minimize.
[2024-05-29 22:34:34] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 0 ms to minimize.
[2024-05-29 22:34:34] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 1 ms to minimize.
[2024-05-29 22:34:35] [INFO ] Deduced a trap composed of 4 places in 106 ms of which 0 ms to minimize.
[2024-05-29 22:34:35] [INFO ] Deduced a trap composed of 4 places in 102 ms of which 2 ms to minimize.
[2024-05-29 22:34:35] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 0 ms to minimize.
[2024-05-29 22:34:35] [INFO ] Deduced a trap composed of 4 places in 110 ms of which 1 ms to minimize.
[2024-05-29 22:34:35] [INFO ] Deduced a trap composed of 4 places in 109 ms of which 0 ms to minimize.
[2024-05-29 22:34:35] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 0 ms to minimize.
[2024-05-29 22:34:35] [INFO ] Deduced a trap composed of 4 places in 106 ms of which 1 ms to minimize.
[2024-05-29 22:34:35] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 1 ms to minimize.
[2024-05-29 22:34:35] [INFO ] Deduced a trap composed of 4 places in 106 ms of which 0 ms to minimize.
[2024-05-29 22:34:35] [INFO ] Deduced a trap composed of 4 places in 107 ms of which 0 ms to minimize.
[2024-05-29 22:34:36] [INFO ] Deduced a trap composed of 4 places in 297 ms of which 1 ms to minimize.
[2024-05-29 22:34:36] [INFO ] Deduced a trap composed of 4 places in 247 ms of which 0 ms to minimize.
[2024-05-29 22:34:36] [INFO ] Deduced a trap composed of 4 places in 197 ms of which 1 ms to minimize.
[2024-05-29 22:34:36] [INFO ] Deduced a trap composed of 4 places in 191 ms of which 1 ms to minimize.
[2024-05-29 22:34:37] [INFO ] Deduced a trap composed of 4 places in 142 ms of which 0 ms to minimize.
[2024-05-29 22:34:37] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 0 ms to minimize.
[2024-05-29 22:34:37] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
[2024-05-29 22:34:41] [INFO ] Deduced a trap composed of 4 places in 352 ms of which 1 ms to minimize.
[2024-05-29 22:34:41] [INFO ] Deduced a trap composed of 4 places in 352 ms of which 0 ms to minimize.
[2024-05-29 22:34:41] [INFO ] Deduced a trap composed of 4 places in 296 ms of which 0 ms to minimize.
[2024-05-29 22:34:42] [INFO ] Deduced a trap composed of 4 places in 249 ms of which 0 ms to minimize.
[2024-05-29 22:34:42] [INFO ] Deduced a trap composed of 4 places in 209 ms of which 1 ms to minimize.
[2024-05-29 22:34:42] [INFO ] Deduced a trap composed of 4 places in 149 ms of which 1 ms to minimize.
[2024-05-29 22:34:42] [INFO ] Deduced a trap composed of 4 places in 238 ms of which 1 ms to minimize.
[2024-05-29 22:34:42] [INFO ] Deduced a trap composed of 4 places in 201 ms of which 0 ms to minimize.
[2024-05-29 22:34:43] [INFO ] Deduced a trap composed of 4 places in 202 ms of which 0 ms to minimize.
[2024-05-29 22:34:43] [INFO ] Deduced a trap composed of 4 places in 147 ms of which 0 ms to minimize.
[2024-05-29 22:34:43] [INFO ] Deduced a trap composed of 4 places in 147 ms of which 0 ms to minimize.
[2024-05-29 22:34:43] [INFO ] Deduced a trap composed of 4 places in 151 ms of which 1 ms to minimize.
[2024-05-29 22:34:43] [INFO ] Deduced a trap composed of 4 places in 103 ms of which 1 ms to minimize.
[2024-05-29 22:34:43] [INFO ] Deduced a trap composed of 4 places in 108 ms of which 1 ms to minimize.
[2024-05-29 22:34:43] [INFO ] Deduced a trap composed of 4 places in 152 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 34/2126 variables, and 56 constraints, problems are : Problem set: 0 solved, 2093 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/34 constraints, ReadFeed: 0/2069 constraints, PredecessorRefiner: 2093/1 constraints, Known Traps: 55/55 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2093 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 1 (OVERLAPS) 11/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 55/56 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 4 (OVERLAPS) 2091/2125 variables, 34/90 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2125 variables, 2068/2158 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2125/2126 variables, and 2159 constraints, problems are : Problem set: 0 solved, 2093 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 34/34 constraints, ReadFeed: 2068/2069 constraints, PredecessorRefiner: 2093/1 constraints, Known Traps: 55/55 constraints]
After SMT, in 92792ms problems are : Problem set: 0 solved, 2093 unsolved
Search for dead transitions found 0 dead transitions in 92813ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 94374 ms. Remains : 34/34 places, 2104/2104 transitions.
Built C files in :
/tmp/ltsmin13233716141511604974
[2024-05-29 22:35:20] [INFO ] Too many transitions (2104) to apply POR reductions. Disabling POR matrices.
[2024-05-29 22:35:20] [INFO ] Built C files in 35ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13233716141511604974
Running compilation step : cd /tmp/ltsmin13233716141511604974;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13233716141511604974;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13233716141511604974;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-29 22:35:24] [INFO ] Flatten gal took : 133 ms
[2024-05-29 22:35:24] [INFO ] Flatten gal took : 135 ms
[2024-05-29 22:35:24] [INFO ] Time to serialize gal into /tmp/LTL4772989831295093346.gal : 101 ms
[2024-05-29 22:35:24] [INFO ] Time to serialize properties into /tmp/LTL6212807976765945996.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/LTL4772989831295093346.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13591530709766281530.hoa' '-atoms' '/tmp/LTL6212807976765945996.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...318
Loading property file /tmp/LTL6212807976765945996.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13591530709766281530.hoa
Reverse transition relation is NOT exact ! Due to transitions t3, t8, t13, t18, t23, t28, t33, t38, t43, t48, t53, t72.t4216, t73.t4214, t71.t4212, t74.t42...338
Detected timeout of ITS tools.
[2024-05-29 22:35:39] [INFO ] Flatten gal took : 131 ms
[2024-05-29 22:35:39] [INFO ] Flatten gal took : 133 ms
[2024-05-29 22:35:39] [INFO ] Time to serialize gal into /tmp/LTL7716536799606930959.gal : 27 ms
[2024-05-29 22:35:39] [INFO ] Time to serialize properties into /tmp/LTL2438469254039788399.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/LTL7716536799606930959.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2438469254039788399.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 : !((F("(((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&(((p68==1)&&(p82==1))&&((p96==1)&&(p110==1))))&&(((p124==1)&&(p138==1))&&(p152==...163
Formula 0 simplified : G!"(((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&(((p68==1)&&(p82==1))&&((p96==1)&&(p110==1))))&&(((p124==1)&&(p138==1))&&(p152==1...159
Reverse transition relation is NOT exact ! Due to transitions t3, t8, t13, t18, t23, t28, t33, t38, t43, t48, t53, t72.t4216, t73.t4214, t71.t4212, t74.t42...338
Detected timeout of ITS tools.
[2024-05-29 22:35:55] [INFO ] Flatten gal took : 130 ms
[2024-05-29 22:35:55] [INFO ] Applying decomposition
[2024-05-29 22:35:55] [INFO ] Flatten gal took : 132 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/graph15984665682239509619.txt' '-o' '/tmp/graph15984665682239509619.bin' '-w' '/tmp/graph15984665682239509619.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15984665682239509619.bin' '-l' '-1' '-v' '-w' '/tmp/graph15984665682239509619.weights' '-q' '0' '-e' '0.001'
[2024-05-29 22:35:55] [INFO ] Decomposing Gal with order
[2024-05-29 22:35:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 22:35:56] [INFO ] Removed a total of 22725 redundant transitions.
[2024-05-29 22:35:56] [INFO ] Flatten gal took : 283 ms
[2024-05-29 22:35:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 99 ms.
[2024-05-29 22:35:56] [INFO ] Time to serialize gal into /tmp/LTL5935651679830998106.gal : 20 ms
[2024-05-29 22:35:56] [INFO ] Time to serialize properties into /tmp/LTL15250930221727812057.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/LTL5935651679830998106.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15250930221727812057.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 : !((F("(((((u0.p12==1)&&(u1.p26==1))&&((u2.p40==1)&&(u3.p54==1)))&&(((u4.p68==1)&&(u5.p82==1))&&((u6.p96==1)&&(u7.p110==1))))&&(((u8.p1...197
Formula 0 simplified : G!"(((((u0.p12==1)&&(u1.p26==1))&&((u2.p40==1)&&(u3.p54==1)))&&(((u4.p68==1)&&(u5.p82==1))&&((u6.p96==1)&&(u7.p110==1))))&&(((u8.p12...193
Reverse transition relation is NOT exact ! Due to transitions u0.t53, u0.t72.t4216, u1.t48, u1.t73.t4214, u2.t43, u2.t71.t4212, u3.t38, u3.t74.t4210, u4.t3...406
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
69 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,0.864665,30528,1,0,6260,127,19560,1440,133,278,24379
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA StigmergyElection-PT-11a-LTLFireability-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property StigmergyElection-PT-11a-LTLFireability-12 finished in 352372 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(((p1 U G(!p1))&&p0)))'
Support contains 11 out of 90 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 90/90 places, 4218/4218 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 22 Pre rules applied. Total rules applied 0 place count 89 transition count 4195
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 0 with 44 rules applied. Total rules applied 44 place count 67 transition count 4195
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 0 with 44 rules applied. Total rules applied 88 place count 45 transition count 4173
Ensure Unique test removed 2047 transitions
Reduce isomorphic transitions removed 2047 transitions.
Iterating post reduction 0 with 2047 rules applied. Total rules applied 2135 place count 45 transition count 2126
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 1 with 11 rules applied. Total rules applied 2146 place count 45 transition count 2115
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 1 with 22 rules applied. Total rules applied 2168 place count 34 transition count 2104
Applied a total of 2168 rules in 1638 ms. Remains 34 /90 variables (removed 56) and now considering 2104/4218 (removed 2114) transitions.
[2024-05-29 22:35:58] [INFO ] Flow matrix only has 2092 transitions (discarded 12 similar events)
[2024-05-29 22:35:58] [INFO ] Invariant cache hit.
[2024-05-29 22:35:58] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-29 22:35:58] [INFO ] Flow matrix only has 2092 transitions (discarded 12 similar events)
[2024-05-29 22:35:58] [INFO ] Invariant cache hit.
[2024-05-29 22:35:59] [INFO ] State equation strengthened by 2069 read => feed constraints.
[2024-05-29 22:35:59] [INFO ] Implicit Places using invariants and state equation in 632 ms returned []
Implicit Place search using SMT with State Equation took 663 ms to find 0 implicit places.
[2024-05-29 22:35:59] [INFO ] Redundant transitions in 219 ms returned []
Running 2093 sub problems to find dead transitions.
[2024-05-29 22:35:59] [INFO ] Flow matrix only has 2092 transitions (discarded 12 similar events)
[2024-05-29 22:35:59] [INFO ] Invariant cache hit.
[2024-05-29 22:35:59] [INFO ] State equation strengthened by 2069 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 1 (OVERLAPS) 11/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
[2024-05-29 22:36:38] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 1 ms to minimize.
[2024-05-29 22:36:38] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 1 ms to minimize.
[2024-05-29 22:36:38] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 1 ms to minimize.
[2024-05-29 22:36:38] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 1 ms to minimize.
[2024-05-29 22:36:39] [INFO ] Deduced a trap composed of 4 places in 222 ms of which 1 ms to minimize.
[2024-05-29 22:36:39] [INFO ] Deduced a trap composed of 4 places in 199 ms of which 0 ms to minimize.
[2024-05-29 22:36:39] [INFO ] Deduced a trap composed of 4 places in 214 ms of which 0 ms to minimize.
[2024-05-29 22:36:39] [INFO ] Deduced a trap composed of 4 places in 198 ms of which 1 ms to minimize.
[2024-05-29 22:36:39] [INFO ] Deduced a trap composed of 4 places in 149 ms of which 0 ms to minimize.
[2024-05-29 22:36:40] [INFO ] Deduced a trap composed of 4 places in 634 ms of which 0 ms to minimize.
[2024-05-29 22:36:41] [INFO ] Deduced a trap composed of 4 places in 637 ms of which 0 ms to minimize.
[2024-05-29 22:36:41] [INFO ] Deduced a trap composed of 4 places in 688 ms of which 1 ms to minimize.
[2024-05-29 22:36:42] [INFO ] Deduced a trap composed of 4 places in 684 ms of which 0 ms to minimize.
[2024-05-29 22:36:43] [INFO ] Deduced a trap composed of 4 places in 626 ms of which 1 ms to minimize.
[2024-05-29 22:36:43] [INFO ] Deduced a trap composed of 4 places in 631 ms of which 1 ms to minimize.
[2024-05-29 22:36:44] [INFO ] Deduced a trap composed of 4 places in 517 ms of which 0 ms to minimize.
[2024-05-29 22:36:44] [INFO ] Deduced a trap composed of 4 places in 459 ms of which 0 ms to minimize.
[2024-05-29 22:36:45] [INFO ] Deduced a trap composed of 4 places in 404 ms of which 0 ms to minimize.
[2024-05-29 22:36:45] [INFO ] Deduced a trap composed of 4 places in 335 ms of which 0 ms to minimize.
[2024-05-29 22:36:46] [INFO ] Deduced a trap composed of 4 places in 507 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
[2024-05-29 22:36:46] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 0 ms to minimize.
[2024-05-29 22:36:46] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 0 ms to minimize.
[2024-05-29 22:36:46] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 1 ms to minimize.
[2024-05-29 22:36:46] [INFO ] Deduced a trap composed of 4 places in 102 ms of which 0 ms to minimize.
[2024-05-29 22:36:46] [INFO ] Deduced a trap composed of 4 places in 102 ms of which 0 ms to minimize.
[2024-05-29 22:36:46] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 0 ms to minimize.
[2024-05-29 22:36:47] [INFO ] Deduced a trap composed of 4 places in 100 ms of which 1 ms to minimize.
[2024-05-29 22:36:47] [INFO ] Deduced a trap composed of 4 places in 100 ms of which 0 ms to minimize.
[2024-05-29 22:36:47] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 1 ms to minimize.
[2024-05-29 22:36:47] [INFO ] Deduced a trap composed of 4 places in 105 ms of which 0 ms to minimize.
[2024-05-29 22:36:47] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 0 ms to minimize.
[2024-05-29 22:36:47] [INFO ] Deduced a trap composed of 4 places in 97 ms of which 0 ms to minimize.
[2024-05-29 22:36:47] [INFO ] Deduced a trap composed of 4 places in 103 ms of which 1 ms to minimize.
[2024-05-29 22:36:47] [INFO ] Deduced a trap composed of 4 places in 289 ms of which 0 ms to minimize.
[2024-05-29 22:36:48] [INFO ] Deduced a trap composed of 4 places in 245 ms of which 1 ms to minimize.
[2024-05-29 22:36:48] [INFO ] Deduced a trap composed of 4 places in 190 ms of which 0 ms to minimize.
[2024-05-29 22:36:48] [INFO ] Deduced a trap composed of 4 places in 186 ms of which 0 ms to minimize.
[2024-05-29 22:36:48] [INFO ] Deduced a trap composed of 4 places in 140 ms of which 1 ms to minimize.
[2024-05-29 22:36:48] [INFO ] Deduced a trap composed of 4 places in 102 ms of which 1 ms to minimize.
[2024-05-29 22:36:48] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
[2024-05-29 22:36:52] [INFO ] Deduced a trap composed of 4 places in 359 ms of which 1 ms to minimize.
[2024-05-29 22:36:53] [INFO ] Deduced a trap composed of 4 places in 353 ms of which 1 ms to minimize.
[2024-05-29 22:36:53] [INFO ] Deduced a trap composed of 4 places in 298 ms of which 0 ms to minimize.
[2024-05-29 22:36:53] [INFO ] Deduced a trap composed of 4 places in 245 ms of which 0 ms to minimize.
[2024-05-29 22:36:53] [INFO ] Deduced a trap composed of 4 places in 201 ms of which 1 ms to minimize.
[2024-05-29 22:36:54] [INFO ] Deduced a trap composed of 4 places in 156 ms of which 1 ms to minimize.
[2024-05-29 22:36:54] [INFO ] Deduced a trap composed of 4 places in 245 ms of which 0 ms to minimize.
[2024-05-29 22:36:54] [INFO ] Deduced a trap composed of 4 places in 198 ms of which 1 ms to minimize.
[2024-05-29 22:36:54] [INFO ] Deduced a trap composed of 4 places in 194 ms of which 0 ms to minimize.
[2024-05-29 22:36:54] [INFO ] Deduced a trap composed of 4 places in 152 ms of which 0 ms to minimize.
[2024-05-29 22:36:55] [INFO ] Deduced a trap composed of 4 places in 154 ms of which 1 ms to minimize.
[2024-05-29 22:36:55] [INFO ] Deduced a trap composed of 4 places in 151 ms of which 0 ms to minimize.
[2024-05-29 22:36:55] [INFO ] Deduced a trap composed of 4 places in 112 ms of which 0 ms to minimize.
[2024-05-29 22:36:55] [INFO ] Deduced a trap composed of 4 places in 103 ms of which 0 ms to minimize.
[2024-05-29 22:36:55] [INFO ] Deduced a trap composed of 4 places in 151 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 34/2126 variables, and 56 constraints, problems are : Problem set: 0 solved, 2093 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/34 constraints, ReadFeed: 0/2069 constraints, PredecessorRefiner: 2093/1 constraints, Known Traps: 55/55 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2093 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 1 (OVERLAPS) 11/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 55/56 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 4 (OVERLAPS) 2091/2125 variables, 34/90 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2125 variables, 2068/2158 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2125/2126 variables, and 2159 constraints, problems are : Problem set: 0 solved, 2093 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 34/34 constraints, ReadFeed: 2068/2069 constraints, PredecessorRefiner: 2093/1 constraints, Known Traps: 55/55 constraints]
After SMT, in 92783ms problems are : Problem set: 0 solved, 2093 unsolved
Search for dead transitions found 0 dead transitions in 92804ms
Starting structural reductions in SI_LTL mode, iteration 1 : 34/90 places, 2104/4218 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 95336 ms. Remains : 34/90 places, 2104/4218 transitions.
Stuttering acceptance computed with spot in 139 ms :[(OR (NOT p0) p1), p1, p1]
Running random walk in product with property : StigmergyElection-PT-11a-LTLFireability-14
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 2 ms.
FORMULA StigmergyElection-PT-11a-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-11a-LTLFireability-14 finished in 95504 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(F(p0)))'
Support contains 11 out of 90 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 90/90 places, 4218/4218 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 22 Pre rules applied. Total rules applied 0 place count 89 transition count 4195
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 0 with 44 rules applied. Total rules applied 44 place count 67 transition count 4195
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 0 with 44 rules applied. Total rules applied 88 place count 45 transition count 4173
Ensure Unique test removed 2047 transitions
Reduce isomorphic transitions removed 2047 transitions.
Iterating post reduction 0 with 2047 rules applied. Total rules applied 2135 place count 45 transition count 2126
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 1 with 11 rules applied. Total rules applied 2146 place count 45 transition count 2115
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 1 with 22 rules applied. Total rules applied 2168 place count 34 transition count 2104
Applied a total of 2168 rules in 1649 ms. Remains 34 /90 variables (removed 56) and now considering 2104/4218 (removed 2114) transitions.
[2024-05-29 22:37:34] [INFO ] Flow matrix only has 2092 transitions (discarded 12 similar events)
[2024-05-29 22:37:34] [INFO ] Invariant cache hit.
[2024-05-29 22:37:34] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-29 22:37:34] [INFO ] Flow matrix only has 2092 transitions (discarded 12 similar events)
[2024-05-29 22:37:34] [INFO ] Invariant cache hit.
[2024-05-29 22:37:34] [INFO ] State equation strengthened by 2069 read => feed constraints.
[2024-05-29 22:37:34] [INFO ] Implicit Places using invariants and state equation in 643 ms returned []
Implicit Place search using SMT with State Equation took 683 ms to find 0 implicit places.
[2024-05-29 22:37:35] [INFO ] Redundant transitions in 222 ms returned []
Running 2093 sub problems to find dead transitions.
[2024-05-29 22:37:35] [INFO ] Flow matrix only has 2092 transitions (discarded 12 similar events)
[2024-05-29 22:37:35] [INFO ] Invariant cache hit.
[2024-05-29 22:37:35] [INFO ] State equation strengthened by 2069 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 1 (OVERLAPS) 11/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
[2024-05-29 22:38:14] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 0 ms to minimize.
[2024-05-29 22:38:14] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 1 ms to minimize.
[2024-05-29 22:38:14] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 1 ms to minimize.
[2024-05-29 22:38:14] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 1 ms to minimize.
[2024-05-29 22:38:14] [INFO ] Deduced a trap composed of 4 places in 197 ms of which 1 ms to minimize.
[2024-05-29 22:38:14] [INFO ] Deduced a trap composed of 4 places in 193 ms of which 0 ms to minimize.
[2024-05-29 22:38:15] [INFO ] Deduced a trap composed of 4 places in 192 ms of which 0 ms to minimize.
[2024-05-29 22:38:15] [INFO ] Deduced a trap composed of 4 places in 191 ms of which 0 ms to minimize.
[2024-05-29 22:38:15] [INFO ] Deduced a trap composed of 4 places in 145 ms of which 1 ms to minimize.
[2024-05-29 22:38:16] [INFO ] Deduced a trap composed of 4 places in 616 ms of which 1 ms to minimize.
[2024-05-29 22:38:16] [INFO ] Deduced a trap composed of 4 places in 614 ms of which 1 ms to minimize.
[2024-05-29 22:38:17] [INFO ] Deduced a trap composed of 4 places in 623 ms of which 0 ms to minimize.
[2024-05-29 22:38:17] [INFO ] Deduced a trap composed of 4 places in 623 ms of which 0 ms to minimize.
[2024-05-29 22:38:18] [INFO ] Deduced a trap composed of 4 places in 601 ms of which 1 ms to minimize.
[2024-05-29 22:38:19] [INFO ] Deduced a trap composed of 4 places in 609 ms of which 1 ms to minimize.
[2024-05-29 22:38:19] [INFO ] Deduced a trap composed of 4 places in 518 ms of which 1 ms to minimize.
[2024-05-29 22:38:20] [INFO ] Deduced a trap composed of 4 places in 452 ms of which 0 ms to minimize.
[2024-05-29 22:38:20] [INFO ] Deduced a trap composed of 4 places in 384 ms of which 0 ms to minimize.
[2024-05-29 22:38:20] [INFO ] Deduced a trap composed of 4 places in 333 ms of which 0 ms to minimize.
[2024-05-29 22:38:21] [INFO ] Deduced a trap composed of 4 places in 514 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
[2024-05-29 22:38:21] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 0 ms to minimize.
[2024-05-29 22:38:21] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 0 ms to minimize.
[2024-05-29 22:38:21] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 1 ms to minimize.
[2024-05-29 22:38:22] [INFO ] Deduced a trap composed of 4 places in 101 ms of which 1 ms to minimize.
[2024-05-29 22:38:22] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 0 ms to minimize.
[2024-05-29 22:38:22] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 1 ms to minimize.
[2024-05-29 22:38:22] [INFO ] Deduced a trap composed of 4 places in 103 ms of which 0 ms to minimize.
[2024-05-29 22:38:22] [INFO ] Deduced a trap composed of 4 places in 105 ms of which 0 ms to minimize.
[2024-05-29 22:38:22] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 0 ms to minimize.
[2024-05-29 22:38:22] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 0 ms to minimize.
[2024-05-29 22:38:22] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 0 ms to minimize.
[2024-05-29 22:38:22] [INFO ] Deduced a trap composed of 4 places in 98 ms of which 1 ms to minimize.
[2024-05-29 22:38:22] [INFO ] Deduced a trap composed of 4 places in 102 ms of which 0 ms to minimize.
[2024-05-29 22:38:23] [INFO ] Deduced a trap composed of 4 places in 304 ms of which 0 ms to minimize.
[2024-05-29 22:38:23] [INFO ] Deduced a trap composed of 4 places in 229 ms of which 1 ms to minimize.
[2024-05-29 22:38:23] [INFO ] Deduced a trap composed of 4 places in 197 ms of which 1 ms to minimize.
[2024-05-29 22:38:23] [INFO ] Deduced a trap composed of 4 places in 190 ms of which 1 ms to minimize.
[2024-05-29 22:38:24] [INFO ] Deduced a trap composed of 4 places in 147 ms of which 0 ms to minimize.
[2024-05-29 22:38:24] [INFO ] Deduced a trap composed of 4 places in 107 ms of which 1 ms to minimize.
[2024-05-29 22:38:24] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
[2024-05-29 22:38:28] [INFO ] Deduced a trap composed of 4 places in 364 ms of which 1 ms to minimize.
[2024-05-29 22:38:28] [INFO ] Deduced a trap composed of 4 places in 348 ms of which 0 ms to minimize.
[2024-05-29 22:38:28] [INFO ] Deduced a trap composed of 4 places in 293 ms of which 1 ms to minimize.
[2024-05-29 22:38:29] [INFO ] Deduced a trap composed of 4 places in 243 ms of which 0 ms to minimize.
[2024-05-29 22:38:29] [INFO ] Deduced a trap composed of 4 places in 200 ms of which 1 ms to minimize.
[2024-05-29 22:38:29] [INFO ] Deduced a trap composed of 4 places in 147 ms of which 0 ms to minimize.
[2024-05-29 22:38:29] [INFO ] Deduced a trap composed of 4 places in 245 ms of which 1 ms to minimize.
[2024-05-29 22:38:29] [INFO ] Deduced a trap composed of 4 places in 196 ms of which 0 ms to minimize.
[2024-05-29 22:38:30] [INFO ] Deduced a trap composed of 4 places in 198 ms of which 0 ms to minimize.
[2024-05-29 22:38:30] [INFO ] Deduced a trap composed of 4 places in 154 ms of which 0 ms to minimize.
[2024-05-29 22:38:30] [INFO ] Deduced a trap composed of 4 places in 151 ms of which 0 ms to minimize.
[2024-05-29 22:38:30] [INFO ] Deduced a trap composed of 4 places in 158 ms of which 0 ms to minimize.
[2024-05-29 22:38:30] [INFO ] Deduced a trap composed of 4 places in 103 ms of which 0 ms to minimize.
[2024-05-29 22:38:30] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 0 ms to minimize.
[2024-05-29 22:38:30] [INFO ] Deduced a trap composed of 4 places in 146 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 34/2126 variables, and 56 constraints, problems are : Problem set: 0 solved, 2093 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/34 constraints, ReadFeed: 0/2069 constraints, PredecessorRefiner: 2093/1 constraints, Known Traps: 55/55 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2093 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 1 (OVERLAPS) 11/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 55/56 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 4 (OVERLAPS) 2091/2125 variables, 34/90 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2125 variables, 2068/2158 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2125/2126 variables, and 2159 constraints, problems are : Problem set: 0 solved, 2093 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 34/34 constraints, ReadFeed: 2068/2069 constraints, PredecessorRefiner: 2093/1 constraints, Known Traps: 55/55 constraints]
After SMT, in 92771ms problems are : Problem set: 0 solved, 2093 unsolved
Search for dead transitions found 0 dead transitions in 92792ms
Starting structural reductions in SI_LTL mode, iteration 1 : 34/90 places, 2104/4218 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 95364 ms. Remains : 34/90 places, 2104/4218 transitions.
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyElection-PT-11a-LTLFireability-15
Stuttering criterion allowed to conclude after 3420 steps with 284 reset in 184 ms.
FORMULA StigmergyElection-PT-11a-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-11a-LTLFireability-15 finished in 95657 ms.
All properties solved by simple procedures.
Total runtime 1701186 ms.

BK_STOP 1717022348396

--------------------
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="StigmergyElection-PT-11a"
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 StigmergyElection-PT-11a, 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-171690532200396"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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