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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 440K
-rw-r--r-- 1 mcc users 8.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 100K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 07:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 23 07:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.7K Apr 11 18:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 101K Apr 11 18:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Apr 11 18:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 46K Apr 11 18:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:59 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 15K 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-02a-LTLFireability-00
FORMULA_NAME StigmergyElection-PT-02a-LTLFireability-01
FORMULA_NAME StigmergyElection-PT-02a-LTLFireability-02
FORMULA_NAME StigmergyElection-PT-02a-LTLFireability-03
FORMULA_NAME StigmergyElection-PT-02a-LTLFireability-04
FORMULA_NAME StigmergyElection-PT-02a-LTLFireability-05
FORMULA_NAME StigmergyElection-PT-02a-LTLFireability-06
FORMULA_NAME StigmergyElection-PT-02a-LTLFireability-07
FORMULA_NAME StigmergyElection-PT-02a-LTLFireability-08
FORMULA_NAME StigmergyElection-PT-02a-LTLFireability-09
FORMULA_NAME StigmergyElection-PT-02a-LTLFireability-10
FORMULA_NAME StigmergyElection-PT-02a-LTLFireability-11
FORMULA_NAME StigmergyElection-PT-02a-LTLFireability-12
FORMULA_NAME StigmergyElection-PT-02a-LTLFireability-13
FORMULA_NAME StigmergyElection-PT-02a-LTLFireability-14
FORMULA_NAME StigmergyElection-PT-02a-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717006212132

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-02a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-29 18:10:13] [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 18:10:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 18:10:13] [INFO ] Load time of PNML (sax parser for PT used): 44 ms
[2024-05-29 18:10:13] [INFO ] Transformed 30 places.
[2024-05-29 18:10:13] [INFO ] Transformed 66 transitions.
[2024-05-29 18:10:13] [INFO ] Found NUPN structural information;
[2024-05-29 18:10:13] [INFO ] Parsed PT model containing 30 places and 66 transitions and 196 arcs in 153 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 18 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Ensure Unique test removed 20 transitions
Reduce redundant transitions removed 20 transitions.
FORMULA StigmergyElection-PT-02a-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-02a-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-02a-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-02a-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-02a-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 13 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 46/46 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 29 transition count 45
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 29 transition count 45
Applied a total of 2 rules in 15 ms. Remains 29 /30 variables (removed 1) and now considering 45/46 (removed 1) transitions.
[2024-05-29 18:10:13] [INFO ] Flow matrix only has 40 transitions (discarded 5 similar events)
// Phase 1: matrix 40 rows 29 cols
[2024-05-29 18:10:13] [INFO ] Computed 2 invariants in 8 ms
[2024-05-29 18:10:13] [INFO ] Implicit Places using invariants in 135 ms returned []
[2024-05-29 18:10:13] [INFO ] Flow matrix only has 40 transitions (discarded 5 similar events)
[2024-05-29 18:10:13] [INFO ] Invariant cache hit.
[2024-05-29 18:10:13] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-05-29 18:10:13] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 234 ms to find 0 implicit places.
Running 44 sub problems to find dead transitions.
[2024-05-29 18:10:13] [INFO ] Flow matrix only has 40 transitions (discarded 5 similar events)
[2024-05-29 18:10:13] [INFO ] Invariant cache hit.
[2024-05-29 18:10:13] [INFO ] State equation strengthened by 15 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (OVERLAPS) 1/29 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 44 unsolved
[2024-05-29 18:10:14] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 7 ms to minimize.
[2024-05-29 18:10:14] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
[2024-05-29 18:10:14] [INFO ] Deduced a trap composed of 15 places in 21 ms of which 1 ms to minimize.
[2024-05-29 18:10:14] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (OVERLAPS) 39/68 variables, 29/35 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 14/49 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (OVERLAPS) 1/69 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/69 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 9 (OVERLAPS) 0/69 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Real declared 69/69 variables, and 50 constraints, problems are : Problem set: 0 solved, 44 unsolved in 874 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 29/29 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 44 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (OVERLAPS) 1/29 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 44 unsolved
[2024-05-29 18:10:14] [INFO ] Deduced a trap composed of 15 places in 21 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (OVERLAPS) 39/68 variables, 29/36 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 14/50 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/68 variables, 44/94 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/68 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 9 (OVERLAPS) 1/69 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/69 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 11 (OVERLAPS) 0/69 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Int declared 69/69 variables, and 95 constraints, problems are : Problem set: 0 solved, 44 unsolved in 586 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 29/29 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 5/5 constraints]
After SMT, in 1505ms problems are : Problem set: 0 solved, 44 unsolved
Search for dead transitions found 0 dead transitions in 1514ms
Starting structural reductions in LTL mode, iteration 1 : 29/30 places, 45/46 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1783 ms. Remains : 29/30 places, 45/46 transitions.
Support contains 13 out of 29 places after structural reductions.
[2024-05-29 18:10:15] [INFO ] Flatten gal took : 18 ms
[2024-05-29 18:10:15] [INFO ] Flatten gal took : 6 ms
[2024-05-29 18:10:15] [INFO ] Input system was already deterministic with 45 transitions.
RANDOM walk for 364 steps (12 resets) in 39 ms. (9 steps per ms) remains 0/12 properties
FORMULA StigmergyElection-PT-02a-LTLFireability-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 6 stabilizing places and 5 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(p0))'
Support contains 1 out of 29 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 29/29 places, 45/45 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 27 transition count 36
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 17 place count 19 transition count 36
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 17 place count 19 transition count 33
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 23 place count 16 transition count 33
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 25 place count 14 transition count 29
Iterating global reduction 2 with 2 rules applied. Total rules applied 27 place count 14 transition count 29
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 28 place count 13 transition count 27
Iterating global reduction 2 with 1 rules applied. Total rules applied 29 place count 13 transition count 27
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 30 place count 13 transition count 26
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 34 place count 11 transition count 24
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 36 place count 11 transition count 22
Performed 2 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 40 place count 9 transition count 22
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 44 place count 9 transition count 18
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 48 place count 9 transition count 14
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 50 place count 7 transition count 12
Applied a total of 50 rules in 16 ms. Remains 7 /29 variables (removed 22) and now considering 12/45 (removed 33) transitions.
[2024-05-29 18:10:15] [INFO ] Flow matrix only has 9 transitions (discarded 3 similar events)
// Phase 1: matrix 9 rows 7 cols
[2024-05-29 18:10:15] [INFO ] Computed 1 invariants in 1 ms
[2024-05-29 18:10:15] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-29 18:10:15] [INFO ] Flow matrix only has 9 transitions (discarded 3 similar events)
[2024-05-29 18:10:15] [INFO ] Invariant cache hit.
[2024-05-29 18:10:15] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
[2024-05-29 18:10:15] [INFO ] Redundant transitions in 1 ms returned []
Running 7 sub problems to find dead transitions.
[2024-05-29 18:10:15] [INFO ] Flow matrix only has 9 transitions (discarded 3 similar events)
[2024-05-29 18:10:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 2/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-29 18:10:16] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 0 ms to minimize.
[2024-05-29 18:10:16] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/7 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 8/15 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 0/15 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 15/16 variables, and 10 constraints, problems are : Problem set: 0 solved, 7 unsolved in 98 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 7/7 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 2/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/7 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 8/15 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 0/15 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 15/16 variables, and 17 constraints, problems are : Problem set: 0 solved, 7 unsolved in 56 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 7/7 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 2/2 constraints]
After SMT, in 159ms problems are : Problem set: 0 solved, 7 unsolved
Search for dead transitions found 0 dead transitions in 159ms
Starting structural reductions in SI_LTL mode, iteration 1 : 7/29 places, 12/45 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 220 ms. Remains : 7/29 places, 12/45 transitions.
Stuttering acceptance computed with spot in 128 ms :[(NOT p0)]
Running random walk in product with property : StigmergyElection-PT-02a-LTLFireability-00
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA StigmergyElection-PT-02a-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-02a-LTLFireability-00 finished in 407 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0||G(F(p1)))))))'
Support contains 3 out of 29 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 29/29 places, 45/45 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 28 transition count 43
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 28 transition count 43
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 27 transition count 41
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 27 transition count 41
Applied a total of 4 rules in 4 ms. Remains 27 /29 variables (removed 2) and now considering 41/45 (removed 4) transitions.
[2024-05-29 18:10:16] [INFO ] Flow matrix only has 37 transitions (discarded 4 similar events)
// Phase 1: matrix 37 rows 27 cols
[2024-05-29 18:10:16] [INFO ] Computed 2 invariants in 3 ms
[2024-05-29 18:10:16] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-29 18:10:16] [INFO ] Flow matrix only has 37 transitions (discarded 4 similar events)
[2024-05-29 18:10:16] [INFO ] Invariant cache hit.
[2024-05-29 18:10:16] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-05-29 18:10:16] [INFO ] Implicit Places using invariants and state equation in 38 ms returned [26]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 69 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 26/29 places, 41/45 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 23 transition count 38
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 23 transition count 38
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 21 transition count 36
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 21 transition count 36
Applied a total of 10 rules in 2 ms. Remains 21 /26 variables (removed 5) and now considering 36/41 (removed 5) transitions.
[2024-05-29 18:10:16] [INFO ] Flow matrix only has 32 transitions (discarded 4 similar events)
// Phase 1: matrix 32 rows 21 cols
[2024-05-29 18:10:16] [INFO ] Computed 1 invariants in 1 ms
[2024-05-29 18:10:16] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-05-29 18:10:16] [INFO ] Flow matrix only has 32 transitions (discarded 4 similar events)
[2024-05-29 18:10:16] [INFO ] Invariant cache hit.
[2024-05-29 18:10:16] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-29 18:10:16] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 21/29 places, 36/45 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 124 ms. Remains : 21/29 places, 36/45 transitions.
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : StigmergyElection-PT-02a-LTLFireability-01
Product exploration explored 100000 steps with 16666 reset in 299 ms.
Product exploration explored 100000 steps with 16666 reset in 106 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 91 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 63 steps (1 resets) in 8 ms. (7 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F p0)]
Knowledge based reduction with 4 factoid took 133 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 159 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 168 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-05-29 18:10:17] [INFO ] Flow matrix only has 32 transitions (discarded 4 similar events)
[2024-05-29 18:10:17] [INFO ] Invariant cache hit.
[2024-05-29 18:10:17] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-29 18:10:17] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-29 18:10:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 18:10:17] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-29 18:10:17] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-05-29 18:10:17] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-29 18:10:17] [INFO ] [Nat]Added 7 Read/Feed constraints in 1 ms returned sat
[2024-05-29 18:10:17] [INFO ] Computed and/alt/rep : 30/93/30 causal constraints (skipped 1 transitions) in 3 ms.
[2024-05-29 18:10:17] [INFO ] Added : 26 causal constraints over 6 iterations in 32 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 3 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 36/36 transitions.
Applied a total of 0 rules in 0 ms. Remains 21 /21 variables (removed 0) and now considering 36/36 (removed 0) transitions.
[2024-05-29 18:10:17] [INFO ] Flow matrix only has 32 transitions (discarded 4 similar events)
[2024-05-29 18:10:17] [INFO ] Invariant cache hit.
[2024-05-29 18:10:17] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-05-29 18:10:17] [INFO ] Flow matrix only has 32 transitions (discarded 4 similar events)
[2024-05-29 18:10:17] [INFO ] Invariant cache hit.
[2024-05-29 18:10:17] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-29 18:10:17] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
Running 35 sub problems to find dead transitions.
[2024-05-29 18:10:17] [INFO ] Flow matrix only has 32 transitions (discarded 4 similar events)
[2024-05-29 18:10:17] [INFO ] Invariant cache hit.
[2024-05-29 18:10:17] [INFO ] State equation strengthened by 7 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 1 (OVERLAPS) 1/21 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 35 unsolved
[2024-05-29 18:10:18] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 1 ms to minimize.
[2024-05-29 18:10:18] [INFO ] Deduced a trap composed of 12 places in 19 ms of which 1 ms to minimize.
[2024-05-29 18:10:18] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 0 ms to minimize.
[2024-05-29 18:10:18] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 1 ms to minimize.
[2024-05-29 18:10:18] [INFO ] Deduced a trap composed of 12 places in 18 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 35 unsolved
[2024-05-29 18:10:18] [INFO ] Deduced a trap composed of 13 places in 20 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 5 (OVERLAPS) 31/52 variables, 21/28 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 6/34 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/52 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 8 (OVERLAPS) 1/53 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/53 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 10 (OVERLAPS) 0/53 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 35 unsolved
No progress, stopping.
After SMT solving in domain Real declared 53/53 variables, and 35 constraints, problems are : Problem set: 0 solved, 35 unsolved in 573 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 21/21 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 35/35 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 35 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 1 (OVERLAPS) 1/21 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 4 (OVERLAPS) 31/52 variables, 21/28 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 6/34 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 35/69 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/52 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 8 (OVERLAPS) 1/53 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/53 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 10 (OVERLAPS) 0/53 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 35 unsolved
No progress, stopping.
After SMT solving in domain Int declared 53/53 variables, and 70 constraints, problems are : Problem set: 0 solved, 35 unsolved in 367 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 21/21 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 35/35 constraints, Known Traps: 6/6 constraints]
After SMT, in 948ms problems are : Problem set: 0 solved, 35 unsolved
Search for dead transitions found 0 dead transitions in 948ms
Finished structural reductions in LTL mode , in 1 iterations and 999 ms. Remains : 21/21 places, 36/36 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 83 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 145 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 281 steps (7 resets) in 17 ms. (15 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F p0)]
Knowledge based reduction with 4 factoid took 139 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 129 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 146 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-05-29 18:10:19] [INFO ] Flow matrix only has 32 transitions (discarded 4 similar events)
[2024-05-29 18:10:19] [INFO ] Invariant cache hit.
[2024-05-29 18:10:19] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-29 18:10:19] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-29 18:10:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 18:10:19] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-29 18:10:19] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-05-29 18:10:19] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-29 18:10:19] [INFO ] [Nat]Added 7 Read/Feed constraints in 2 ms returned sat
[2024-05-29 18:10:19] [INFO ] Computed and/alt/rep : 30/93/30 causal constraints (skipped 1 transitions) in 2 ms.
[2024-05-29 18:10:19] [INFO ] Added : 26 causal constraints over 6 iterations in 23 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 166 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 16666 reset in 73 ms.
Product exploration explored 100000 steps with 16666 reset in 141 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 166 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 21 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 36/36 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 21 transition count 36
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 4 Pre rules applied. Total rules applied 1 place count 21 transition count 38
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 5 place count 21 transition count 38
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 9 place count 21 transition count 40
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 10 place count 21 transition count 39
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 11 place count 20 transition count 38
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 20 transition count 38
Deduced a syphon composed of 8 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 15 place count 20 transition count 35
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 10 places in 0 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 17 place count 20 transition count 35
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 20 place count 17 transition count 32
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 2 with 3 rules applied. Total rules applied 23 place count 17 transition count 32
Deduced a syphon composed of 7 places in 0 ms
Applied a total of 23 rules in 11 ms. Remains 17 /21 variables (removed 4) and now considering 32/36 (removed 4) transitions.
[2024-05-29 18:10:20] [INFO ] Redundant transitions in 1 ms returned []
Running 31 sub problems to find dead transitions.
[2024-05-29 18:10:20] [INFO ] Flow matrix only has 28 transitions (discarded 4 similar events)
// Phase 1: matrix 28 rows 17 cols
[2024-05-29 18:10:20] [INFO ] Computed 1 invariants in 0 ms
[2024-05-29 18:10:20] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 1 (OVERLAPS) 1/17 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 31 unsolved
[2024-05-29 18:10:20] [INFO ] Deduced a trap composed of 7 places in 20 ms of which 1 ms to minimize.
[2024-05-29 18:10:20] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 0 ms to minimize.
[2024-05-29 18:10:20] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 1 ms to minimize.
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD18 is UNSAT
[2024-05-29 18:10:20] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 4/5 constraints. Problems are: Problem set: 10 solved, 21 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/17 variables, 0/5 constraints. Problems are: Problem set: 10 solved, 21 unsolved
At refinement iteration 4 (OVERLAPS) 27/44 variables, 17/22 constraints. Problems are: Problem set: 10 solved, 21 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 7/29 constraints. Problems are: Problem set: 10 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/44 variables, 0/29 constraints. Problems are: Problem set: 10 solved, 21 unsolved
At refinement iteration 7 (OVERLAPS) 1/45 variables, 1/30 constraints. Problems are: Problem set: 10 solved, 21 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/45 variables, 0/30 constraints. Problems are: Problem set: 10 solved, 21 unsolved
At refinement iteration 9 (OVERLAPS) 0/45 variables, 0/30 constraints. Problems are: Problem set: 10 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Real declared 45/45 variables, and 30 constraints, problems are : Problem set: 10 solved, 21 unsolved in 325 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 17/17 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 31/31 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 10 solved, 21 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 10 solved, 21 unsolved
At refinement iteration 1 (OVERLAPS) 8/17 variables, 1/1 constraints. Problems are: Problem set: 10 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 4/5 constraints. Problems are: Problem set: 10 solved, 21 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/17 variables, 0/5 constraints. Problems are: Problem set: 10 solved, 21 unsolved
At refinement iteration 4 (OVERLAPS) 27/44 variables, 17/22 constraints. Problems are: Problem set: 10 solved, 21 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 7/29 constraints. Problems are: Problem set: 10 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/44 variables, 21/50 constraints. Problems are: Problem set: 10 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/44 variables, 0/50 constraints. Problems are: Problem set: 10 solved, 21 unsolved
At refinement iteration 8 (OVERLAPS) 1/45 variables, 1/51 constraints. Problems are: Problem set: 10 solved, 21 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/45 variables, 0/51 constraints. Problems are: Problem set: 10 solved, 21 unsolved
At refinement iteration 10 (OVERLAPS) 0/45 variables, 0/51 constraints. Problems are: Problem set: 10 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Int declared 45/45 variables, and 51 constraints, problems are : Problem set: 10 solved, 21 unsolved in 215 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 17/17 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 21/31 constraints, Known Traps: 4/4 constraints]
After SMT, in 550ms problems are : Problem set: 10 solved, 21 unsolved
Search for dead transitions found 10 dead transitions in 550ms
Found 10 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 10 transitions
Dead transitions reduction (with SMT) removed 10 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 17/21 places, 22/36 transitions.
Graph (complete) has 29 edges and 17 vertex of which 10 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.2 ms
Discarding 7 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 5 ms. Remains 10 /17 variables (removed 7) and now considering 22/22 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 10/21 places, 22/36 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 575 ms. Remains : 10/21 places, 22/36 transitions.
Built C files in :
/tmp/ltsmin16367073912366329839
[2024-05-29 18:10:21] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16367073912366329839
Running compilation step : cd /tmp/ltsmin16367073912366329839;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 224 ms.
Running link step : cd /tmp/ltsmin16367073912366329839;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin16367073912366329839;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased416184394139621420.hoa' '--buchi-type=spotba'
LTSmin run took 177 ms.
FORMULA StigmergyElection-PT-02a-LTLFireability-01 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property StigmergyElection-PT-02a-LTLFireability-01 finished in 5289 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||X((p1 U p0))))))'
Support contains 3 out of 29 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 29/29 places, 45/45 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 27 transition count 41
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 27 transition count 41
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 26 transition count 39
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 26 transition count 39
Applied a total of 6 rules in 2 ms. Remains 26 /29 variables (removed 3) and now considering 39/45 (removed 6) transitions.
[2024-05-29 18:10:21] [INFO ] Flow matrix only has 36 transitions (discarded 3 similar events)
// Phase 1: matrix 36 rows 26 cols
[2024-05-29 18:10:21] [INFO ] Computed 2 invariants in 0 ms
[2024-05-29 18:10:21] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-29 18:10:21] [INFO ] Flow matrix only has 36 transitions (discarded 3 similar events)
[2024-05-29 18:10:21] [INFO ] Invariant cache hit.
[2024-05-29 18:10:21] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-05-29 18:10:21] [INFO ] Implicit Places using invariants and state equation in 36 ms returned [25]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 61 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 25/29 places, 39/45 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 22 transition count 36
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 22 transition count 36
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 20 transition count 34
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 20 transition count 34
Applied a total of 10 rules in 8 ms. Remains 20 /25 variables (removed 5) and now considering 34/39 (removed 5) transitions.
[2024-05-29 18:10:21] [INFO ] Flow matrix only has 31 transitions (discarded 3 similar events)
// Phase 1: matrix 31 rows 20 cols
[2024-05-29 18:10:21] [INFO ] Computed 1 invariants in 2 ms
[2024-05-29 18:10:21] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-29 18:10:21] [INFO ] Flow matrix only has 31 transitions (discarded 3 similar events)
[2024-05-29 18:10:21] [INFO ] Invariant cache hit.
[2024-05-29 18:10:21] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-29 18:10:21] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 20/29 places, 34/45 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 120 ms. Remains : 20/29 places, 34/45 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyElection-PT-02a-LTLFireability-02
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA StigmergyElection-PT-02a-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-02a-LTLFireability-02 finished in 213 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 2 out of 29 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 29/29 places, 45/45 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 27 transition count 40
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 9 place count 23 transition count 40
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 9 place count 23 transition count 34
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 21 place count 17 transition count 34
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 25 place count 13 transition count 28
Iterating global reduction 2 with 4 rules applied. Total rules applied 29 place count 13 transition count 28
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 31 place count 11 transition count 24
Iterating global reduction 2 with 2 rules applied. Total rules applied 33 place count 11 transition count 24
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 36 place count 11 transition count 21
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 40 place count 9 transition count 19
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 42 place count 9 transition count 17
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 46 place count 7 transition count 15
Applied a total of 46 rules in 10 ms. Remains 7 /29 variables (removed 22) and now considering 15/45 (removed 30) transitions.
[2024-05-29 18:10:21] [INFO ] Flow matrix only has 12 transitions (discarded 3 similar events)
// Phase 1: matrix 12 rows 7 cols
[2024-05-29 18:10:21] [INFO ] Computed 1 invariants in 1 ms
[2024-05-29 18:10:21] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-05-29 18:10:21] [INFO ] Flow matrix only has 12 transitions (discarded 3 similar events)
[2024-05-29 18:10:21] [INFO ] Invariant cache hit.
[2024-05-29 18:10:21] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-29 18:10:21] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2024-05-29 18:10:21] [INFO ] Redundant transitions in 0 ms returned []
Running 13 sub problems to find dead transitions.
[2024-05-29 18:10:21] [INFO ] Flow matrix only has 12 transitions (discarded 3 similar events)
[2024-05-29 18:10:21] [INFO ] Invariant cache hit.
[2024-05-29 18:10:21] [INFO ] State equation strengthened by 7 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 2/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-29 18:10:21] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-29 18:10:21] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/7 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 11/18 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/18 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/18 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 1/19 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/19 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (OVERLAPS) 0/19 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 19/19 variables, and 17 constraints, problems are : Problem set: 0 solved, 13 unsolved in 153 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 7/7 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 2/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/7 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 11/18 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/18 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/18 variables, 13/29 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/18 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 1/19 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/19 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (OVERLAPS) 0/19 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 19/19 variables, and 30 constraints, problems are : Problem set: 0 solved, 13 unsolved in 96 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 7/7 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 2/2 constraints]
After SMT, in 265ms problems are : Problem set: 0 solved, 13 unsolved
Search for dead transitions found 0 dead transitions in 266ms
Starting structural reductions in SI_LTL mode, iteration 1 : 7/29 places, 15/45 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 328 ms. Remains : 7/29 places, 15/45 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Running random walk in product with property : StigmergyElection-PT-02a-LTLFireability-04
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA StigmergyElection-PT-02a-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-02a-LTLFireability-04 finished in 387 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&F((G(p1)||G(F(p2))))))))'
Support contains 4 out of 29 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 29/29 places, 45/45 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 28 transition count 43
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 28 transition count 43
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 27 transition count 41
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 27 transition count 41
Applied a total of 4 rules in 6 ms. Remains 27 /29 variables (removed 2) and now considering 41/45 (removed 4) transitions.
[2024-05-29 18:10:22] [INFO ] Flow matrix only has 37 transitions (discarded 4 similar events)
// Phase 1: matrix 37 rows 27 cols
[2024-05-29 18:10:22] [INFO ] Computed 2 invariants in 2 ms
[2024-05-29 18:10:22] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-29 18:10:22] [INFO ] Flow matrix only has 37 transitions (discarded 4 similar events)
[2024-05-29 18:10:22] [INFO ] Invariant cache hit.
[2024-05-29 18:10:22] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-05-29 18:10:22] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
Running 40 sub problems to find dead transitions.
[2024-05-29 18:10:22] [INFO ] Flow matrix only has 37 transitions (discarded 4 similar events)
[2024-05-29 18:10:22] [INFO ] Invariant cache hit.
[2024-05-29 18:10:22] [INFO ] State equation strengthened by 15 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (OVERLAPS) 1/27 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-05-29 18:10:22] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-05-29 18:10:22] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 0 ms to minimize.
[2024-05-29 18:10:22] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 0 ms to minimize.
[2024-05-29 18:10:22] [INFO ] Deduced a trap composed of 15 places in 17 ms of which 1 ms to minimize.
[2024-05-29 18:10:22] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 1 ms to minimize.
[2024-05-29 18:10:22] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-05-29 18:10:22] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (OVERLAPS) 36/63 variables, 27/36 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/63 variables, 14/50 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/63 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 8 (OVERLAPS) 1/64 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/64 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 10 (OVERLAPS) 0/64 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Real declared 64/64 variables, and 51 constraints, problems are : Problem set: 0 solved, 40 unsolved in 714 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 27/27 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 40 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (OVERLAPS) 1/27 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (OVERLAPS) 36/63 variables, 27/36 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 14/50 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/63 variables, 40/90 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/63 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 8 (OVERLAPS) 1/64 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/64 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 10 (OVERLAPS) 0/64 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Int declared 64/64 variables, and 91 constraints, problems are : Problem set: 0 solved, 40 unsolved in 452 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 27/27 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 7/7 constraints]
After SMT, in 1175ms problems are : Problem set: 0 solved, 40 unsolved
Search for dead transitions found 0 dead transitions in 1176ms
Starting structural reductions in LTL mode, iteration 1 : 27/29 places, 41/45 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1275 ms. Remains : 27/29 places, 41/45 transitions.
Stuttering acceptance computed with spot in 207 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : StigmergyElection-PT-02a-LTLFireability-05
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA StigmergyElection-PT-02a-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-02a-LTLFireability-05 finished in 1505 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 29 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 29/29 places, 45/45 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 27 transition count 41
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 27 transition count 41
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 25 transition count 37
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 25 transition count 37
Applied a total of 8 rules in 3 ms. Remains 25 /29 variables (removed 4) and now considering 37/45 (removed 8) transitions.
[2024-05-29 18:10:23] [INFO ] Flow matrix only has 34 transitions (discarded 3 similar events)
// Phase 1: matrix 34 rows 25 cols
[2024-05-29 18:10:23] [INFO ] Computed 2 invariants in 2 ms
[2024-05-29 18:10:23] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-29 18:10:23] [INFO ] Flow matrix only has 34 transitions (discarded 3 similar events)
[2024-05-29 18:10:23] [INFO ] Invariant cache hit.
[2024-05-29 18:10:23] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-05-29 18:10:23] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
Running 36 sub problems to find dead transitions.
[2024-05-29 18:10:23] [INFO ] Flow matrix only has 34 transitions (discarded 3 similar events)
[2024-05-29 18:10:23] [INFO ] Invariant cache hit.
[2024-05-29 18:10:23] [INFO ] State equation strengthened by 15 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (OVERLAPS) 1/25 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 36 unsolved
[2024-05-29 18:10:23] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 1 ms to minimize.
[2024-05-29 18:10:23] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
[2024-05-29 18:10:23] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 1 ms to minimize.
[2024-05-29 18:10:23] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 0 ms to minimize.
[2024-05-29 18:10:24] [INFO ] Deduced a trap composed of 13 places in 21 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 4 (OVERLAPS) 33/58 variables, 25/32 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 14/46 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/58 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 7 (OVERLAPS) 1/59 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/59 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 9 (OVERLAPS) 0/59 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 36 unsolved
No progress, stopping.
After SMT solving in domain Real declared 59/59 variables, and 47 constraints, problems are : Problem set: 0 solved, 36 unsolved in 585 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 25/25 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 36 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (OVERLAPS) 1/25 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 4 (OVERLAPS) 33/58 variables, 25/32 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 14/46 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/58 variables, 36/82 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/58 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 8 (OVERLAPS) 1/59 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/59 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 10 (OVERLAPS) 0/59 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 36 unsolved
No progress, stopping.
After SMT solving in domain Int declared 59/59 variables, and 83 constraints, problems are : Problem set: 0 solved, 36 unsolved in 392 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 25/25 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 5/5 constraints]
After SMT, in 988ms problems are : Problem set: 0 solved, 36 unsolved
Search for dead transitions found 0 dead transitions in 989ms
Starting structural reductions in LTL mode, iteration 1 : 25/29 places, 37/45 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1071 ms. Remains : 25/29 places, 37/45 transitions.
Stuttering acceptance computed with spot in 120 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyElection-PT-02a-LTLFireability-07
Product exploration explored 100000 steps with 33333 reset in 97 ms.
Product exploration explored 100000 steps with 33333 reset in 92 ms.
Computed a total of 6 stabilizing places and 5 stable transitions
Computed a total of 6 stabilizing places and 5 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 16 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA StigmergyElection-PT-02a-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyElection-PT-02a-LTLFireability-07 finished in 1413 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 29 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 29/29 places, 45/45 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 27 transition count 41
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 27 transition count 41
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 25 transition count 37
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 25 transition count 37
Applied a total of 8 rules in 3 ms. Remains 25 /29 variables (removed 4) and now considering 37/45 (removed 8) transitions.
[2024-05-29 18:10:25] [INFO ] Flow matrix only has 34 transitions (discarded 3 similar events)
[2024-05-29 18:10:25] [INFO ] Invariant cache hit.
[2024-05-29 18:10:25] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-29 18:10:25] [INFO ] Flow matrix only has 34 transitions (discarded 3 similar events)
[2024-05-29 18:10:25] [INFO ] Invariant cache hit.
[2024-05-29 18:10:25] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-05-29 18:10:25] [INFO ] Implicit Places using invariants and state equation in 42 ms returned [24]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 73 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 24/29 places, 37/45 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 21 transition count 34
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 21 transition count 34
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 20 transition count 33
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 20 transition count 33
Applied a total of 8 rules in 1 ms. Remains 20 /24 variables (removed 4) and now considering 33/37 (removed 4) transitions.
[2024-05-29 18:10:25] [INFO ] Flow matrix only has 30 transitions (discarded 3 similar events)
// Phase 1: matrix 30 rows 20 cols
[2024-05-29 18:10:25] [INFO ] Computed 1 invariants in 1 ms
[2024-05-29 18:10:25] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-29 18:10:25] [INFO ] Flow matrix only has 30 transitions (discarded 3 similar events)
[2024-05-29 18:10:25] [INFO ] Invariant cache hit.
[2024-05-29 18:10:25] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-29 18:10:25] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 20/29 places, 33/45 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 129 ms. Remains : 20/29 places, 33/45 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyElection-PT-02a-LTLFireability-08
Product exploration explored 100000 steps with 50000 reset in 96 ms.
Product exploration explored 100000 steps with 50000 reset in 65 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 13 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA StigmergyElection-PT-02a-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyElection-PT-02a-LTLFireability-08 finished in 391 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&&(p1||G(p0)))))||G(p2)))'
Support contains 3 out of 29 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 29/29 places, 45/45 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 27 transition count 41
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 24 transition count 41
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 7 place count 24 transition count 36
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 17 place count 19 transition count 36
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 21 place count 15 transition count 30
Iterating global reduction 2 with 4 rules applied. Total rules applied 25 place count 15 transition count 30
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 27 place count 13 transition count 26
Iterating global reduction 2 with 2 rules applied. Total rules applied 29 place count 13 transition count 26
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 30 place count 13 transition count 25
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 34 place count 11 transition count 23
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 36 place count 11 transition count 21
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 40 place count 9 transition count 19
Applied a total of 40 rules in 15 ms. Remains 9 /29 variables (removed 20) and now considering 19/45 (removed 26) transitions.
[2024-05-29 18:10:25] [INFO ] Flow matrix only has 16 transitions (discarded 3 similar events)
// Phase 1: matrix 16 rows 9 cols
[2024-05-29 18:10:25] [INFO ] Computed 1 invariants in 1 ms
[2024-05-29 18:10:25] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-05-29 18:10:25] [INFO ] Flow matrix only has 16 transitions (discarded 3 similar events)
[2024-05-29 18:10:25] [INFO ] Invariant cache hit.
[2024-05-29 18:10:25] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-29 18:10:25] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2024-05-29 18:10:25] [INFO ] Redundant transitions in 1 ms returned []
Running 17 sub problems to find dead transitions.
[2024-05-29 18:10:25] [INFO ] Flow matrix only has 16 transitions (discarded 3 similar events)
[2024-05-29 18:10:25] [INFO ] Invariant cache hit.
[2024-05-29 18:10:25] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 2/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2024-05-29 18:10:25] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-29 18:10:25] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 1 ms to minimize.
[2024-05-29 18:10:25] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 15/24 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/24 variables, 7/20 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/24 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 1/25 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/25 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (OVERLAPS) 0/25 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 25/25 variables, and 21 constraints, problems are : Problem set: 0 solved, 17 unsolved in 195 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 9/9 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 2/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 15/24 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/24 variables, 7/20 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/24 variables, 17/37 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/24 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 1/25 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/25 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (OVERLAPS) 0/25 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 25/25 variables, and 38 constraints, problems are : Problem set: 0 solved, 17 unsolved in 145 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 9/9 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 3/3 constraints]
After SMT, in 345ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 345ms
Starting structural reductions in SI_LTL mode, iteration 1 : 9/29 places, 19/45 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 410 ms. Remains : 9/29 places, 19/45 transitions.
Stuttering acceptance computed with spot in 209 ms :[(AND (NOT p2) (NOT p0)), (NOT p0)]
Running random walk in product with property : StigmergyElection-PT-02a-LTLFireability-09
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA StigmergyElection-PT-02a-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-02a-LTLFireability-09 finished in 642 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 29 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 29/29 places, 45/45 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 27 transition count 41
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 27 transition count 41
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 25 transition count 37
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 25 transition count 37
Applied a total of 8 rules in 5 ms. Remains 25 /29 variables (removed 4) and now considering 37/45 (removed 8) transitions.
[2024-05-29 18:10:26] [INFO ] Flow matrix only has 34 transitions (discarded 3 similar events)
// Phase 1: matrix 34 rows 25 cols
[2024-05-29 18:10:26] [INFO ] Computed 2 invariants in 0 ms
[2024-05-29 18:10:26] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-29 18:10:26] [INFO ] Flow matrix only has 34 transitions (discarded 3 similar events)
[2024-05-29 18:10:26] [INFO ] Invariant cache hit.
[2024-05-29 18:10:26] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-05-29 18:10:26] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
Running 36 sub problems to find dead transitions.
[2024-05-29 18:10:26] [INFO ] Flow matrix only has 34 transitions (discarded 3 similar events)
[2024-05-29 18:10:26] [INFO ] Invariant cache hit.
[2024-05-29 18:10:26] [INFO ] State equation strengthened by 15 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (OVERLAPS) 1/25 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 36 unsolved
[2024-05-29 18:10:26] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 3 ms to minimize.
[2024-05-29 18:10:26] [INFO ] Deduced a trap composed of 13 places in 20 ms of which 0 ms to minimize.
[2024-05-29 18:10:26] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 1 ms to minimize.
[2024-05-29 18:10:26] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 0 ms to minimize.
[2024-05-29 18:10:26] [INFO ] Deduced a trap composed of 13 places in 19 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 4 (OVERLAPS) 33/58 variables, 25/32 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 14/46 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/58 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 7 (OVERLAPS) 1/59 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/59 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 9 (OVERLAPS) 0/59 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 36 unsolved
No progress, stopping.
After SMT solving in domain Real declared 59/59 variables, and 47 constraints, problems are : Problem set: 0 solved, 36 unsolved in 543 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 25/25 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 36 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (OVERLAPS) 1/25 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 4 (OVERLAPS) 33/58 variables, 25/32 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 14/46 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/58 variables, 36/82 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/58 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 8 (OVERLAPS) 1/59 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/59 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 10 (OVERLAPS) 0/59 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 36 unsolved
No progress, stopping.
After SMT solving in domain Int declared 59/59 variables, and 83 constraints, problems are : Problem set: 0 solved, 36 unsolved in 385 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 25/25 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 5/5 constraints]
After SMT, in 936ms problems are : Problem set: 0 solved, 36 unsolved
Search for dead transitions found 0 dead transitions in 937ms
Starting structural reductions in LTL mode, iteration 1 : 25/29 places, 37/45 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1003 ms. Remains : 25/29 places, 37/45 transitions.
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyElection-PT-02a-LTLFireability-11
Product exploration explored 100000 steps with 50000 reset in 109 ms.
Product exploration explored 100000 steps with 50000 reset in 91 ms.
Computed a total of 6 stabilizing places and 5 stable transitions
Computed a total of 6 stabilizing places and 5 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 18 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA StigmergyElection-PT-02a-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyElection-PT-02a-LTLFireability-11 finished in 1327 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(G((!p1||X(G(!p1)))))))'
Support contains 4 out of 29 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 29/29 places, 45/45 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 27 transition count 41
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 27 transition count 41
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 25 transition count 37
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 25 transition count 37
Applied a total of 8 rules in 4 ms. Remains 25 /29 variables (removed 4) and now considering 37/45 (removed 8) transitions.
[2024-05-29 18:10:27] [INFO ] Flow matrix only has 34 transitions (discarded 3 similar events)
[2024-05-29 18:10:27] [INFO ] Invariant cache hit.
[2024-05-29 18:10:27] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-29 18:10:27] [INFO ] Flow matrix only has 34 transitions (discarded 3 similar events)
[2024-05-29 18:10:27] [INFO ] Invariant cache hit.
[2024-05-29 18:10:27] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-05-29 18:10:27] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
Running 36 sub problems to find dead transitions.
[2024-05-29 18:10:27] [INFO ] Flow matrix only has 34 transitions (discarded 3 similar events)
[2024-05-29 18:10:27] [INFO ] Invariant cache hit.
[2024-05-29 18:10:27] [INFO ] State equation strengthened by 15 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (OVERLAPS) 1/25 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 36 unsolved
[2024-05-29 18:10:27] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-05-29 18:10:27] [INFO ] Deduced a trap composed of 13 places in 20 ms of which 1 ms to minimize.
[2024-05-29 18:10:27] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 0 ms to minimize.
[2024-05-29 18:10:27] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 0 ms to minimize.
[2024-05-29 18:10:27] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 4 (OVERLAPS) 33/58 variables, 25/32 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 14/46 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/58 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 7 (OVERLAPS) 1/59 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/59 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 9 (OVERLAPS) 0/59 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 36 unsolved
No progress, stopping.
After SMT solving in domain Real declared 59/59 variables, and 47 constraints, problems are : Problem set: 0 solved, 36 unsolved in 539 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 25/25 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 36 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (OVERLAPS) 1/25 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 4 (OVERLAPS) 33/58 variables, 25/32 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 14/46 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/58 variables, 36/82 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/58 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 8 (OVERLAPS) 1/59 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/59 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 10 (OVERLAPS) 0/59 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 36 unsolved
No progress, stopping.
After SMT solving in domain Int declared 59/59 variables, and 83 constraints, problems are : Problem set: 0 solved, 36 unsolved in 396 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 25/25 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 5/5 constraints]
After SMT, in 943ms problems are : Problem set: 0 solved, 36 unsolved
Search for dead transitions found 0 dead transitions in 944ms
Starting structural reductions in LTL mode, iteration 1 : 25/29 places, 37/45 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1008 ms. Remains : 25/29 places, 37/45 transitions.
Stuttering acceptance computed with spot in 137 ms :[p1, p1, p1, true]
Running random walk in product with property : StigmergyElection-PT-02a-LTLFireability-15
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA StigmergyElection-PT-02a-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-02a-LTLFireability-15 finished in 1160 ms.
All properties solved by simple procedures.
Total runtime 15310 ms.

BK_STOP 1717006228689

--------------------
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-02a"
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-02a, 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-171690531900252"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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