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.r536-tall-171690532000268.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 ltsminxred
Input is StigmergyElection-PT-03a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r536-tall-171690532000268
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 512K
-rw-r--r-- 1 mcc users 8.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 23 07:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 07:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 11 18:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 130K Apr 11 18:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Apr 11 18:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K 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 31K 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-03a-LTLFireability-00
FORMULA_NAME StigmergyElection-PT-03a-LTLFireability-01
FORMULA_NAME StigmergyElection-PT-03a-LTLFireability-02
FORMULA_NAME StigmergyElection-PT-03a-LTLFireability-03
FORMULA_NAME StigmergyElection-PT-03a-LTLFireability-04
FORMULA_NAME StigmergyElection-PT-03a-LTLFireability-05
FORMULA_NAME StigmergyElection-PT-03a-LTLFireability-06
FORMULA_NAME StigmergyElection-PT-03a-LTLFireability-07
FORMULA_NAME StigmergyElection-PT-03a-LTLFireability-08
FORMULA_NAME StigmergyElection-PT-03a-LTLFireability-09
FORMULA_NAME StigmergyElection-PT-03a-LTLFireability-10
FORMULA_NAME StigmergyElection-PT-03a-LTLFireability-11
FORMULA_NAME StigmergyElection-PT-03a-LTLFireability-12
FORMULA_NAME StigmergyElection-PT-03a-LTLFireability-13
FORMULA_NAME StigmergyElection-PT-03a-LTLFireability-14
FORMULA_NAME StigmergyElection-PT-03a-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717245003195

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyElection-PT-03a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 12:30:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 12:30:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 12:30:04] [INFO ] Load time of PNML (sax parser for PT used): 54 ms
[2024-06-01 12:30:04] [INFO ] Transformed 44 places.
[2024-06-01 12:30:04] [INFO ] Transformed 118 transitions.
[2024-06-01 12:30:04] [INFO ] Found NUPN structural information;
[2024-06-01 12:30:04] [INFO ] Parsed PT model containing 44 places and 118 transitions and 467 arcs in 146 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 45 transitions
Reduce redundant transitions removed 45 transitions.
FORMULA StigmergyElection-PT-03a-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-03a-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 20 out of 44 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 44/44 places, 73/73 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 42 transition count 71
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 42 transition count 71
Applied a total of 4 rules in 22 ms. Remains 42 /44 variables (removed 2) and now considering 71/73 (removed 2) transitions.
[2024-06-01 12:30:04] [INFO ] Flow matrix only has 64 transitions (discarded 7 similar events)
// Phase 1: matrix 64 rows 42 cols
[2024-06-01 12:30:04] [INFO ] Computed 2 invariants in 8 ms
[2024-06-01 12:30:04] [INFO ] Implicit Places using invariants in 152 ms returned []
[2024-06-01 12:30:04] [INFO ] Flow matrix only has 64 transitions (discarded 7 similar events)
[2024-06-01 12:30:04] [INFO ] Invariant cache hit.
[2024-06-01 12:30:04] [INFO ] State equation strengthened by 28 read => feed constraints.
[2024-06-01 12:30:04] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 258 ms to find 0 implicit places.
Running 70 sub problems to find dead transitions.
[2024-06-01 12:30:04] [INFO ] Flow matrix only has 64 transitions (discarded 7 similar events)
[2024-06-01 12:30:04] [INFO ] Invariant cache hit.
[2024-06-01 12:30:04] [INFO ] State equation strengthened by 28 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 1 (OVERLAPS) 1/42 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 70 unsolved
[2024-06-01 12:30:05] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 7 ms to minimize.
[2024-06-01 12:30:05] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2024-06-01 12:30:05] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
[2024-06-01 12:30:05] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
[2024-06-01 12:30:05] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 1 ms to minimize.
[2024-06-01 12:30:05] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
[2024-06-01 12:30:05] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 0 ms to minimize.
[2024-06-01 12:30:05] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
[2024-06-01 12:30:05] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 0 ms to minimize.
[2024-06-01 12:30:05] [INFO ] Deduced a trap composed of 15 places in 16 ms of which 0 ms to minimize.
[2024-06-01 12:30:05] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 0 ms to minimize.
[2024-06-01 12:30:05] [INFO ] Deduced a trap composed of 12 places in 18 ms of which 0 ms to minimize.
[2024-06-01 12:30:05] [INFO ] Deduced a trap composed of 15 places in 17 ms of which 1 ms to minimize.
[2024-06-01 12:30:05] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 1 ms to minimize.
[2024-06-01 12:30:05] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
[2024-06-01 12:30:05] [INFO ] Deduced a trap composed of 15 places in 21 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 4 (OVERLAPS) 63/105 variables, 42/60 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 27/87 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/105 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 7 (OVERLAPS) 1/106 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/106 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 9 (OVERLAPS) 0/106 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Real declared 106/106 variables, and 88 constraints, problems are : Problem set: 0 solved, 70 unsolved in 1895 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 42/42 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 70/70 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 70 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 1 (OVERLAPS) 1/42 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 4 (OVERLAPS) 63/105 variables, 42/60 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 27/87 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/105 variables, 70/157 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/105 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 8 (OVERLAPS) 1/106 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/106 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 10 (OVERLAPS) 0/106 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Int declared 106/106 variables, and 158 constraints, problems are : Problem set: 0 solved, 70 unsolved in 1249 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 42/42 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 70/70 constraints, Known Traps: 16/16 constraints]
After SMT, in 3205ms problems are : Problem set: 0 solved, 70 unsolved
Search for dead transitions found 0 dead transitions in 3224ms
Starting structural reductions in LTL mode, iteration 1 : 42/44 places, 71/73 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3520 ms. Remains : 42/44 places, 71/73 transitions.
Support contains 20 out of 42 places after structural reductions.
[2024-06-01 12:30:08] [INFO ] Flatten gal took : 19 ms
[2024-06-01 12:30:08] [INFO ] Flatten gal took : 8 ms
[2024-06-01 12:30:08] [INFO ] Input system was already deterministic with 71 transitions.
RANDOM walk for 40000 steps (575 resets) in 642 ms. (62 steps per ms) remains 1/20 properties
BEST_FIRST walk for 40004 steps (267 resets) in 182 ms. (218 steps per ms) remains 1/1 properties
[2024-06-01 12:30:08] [INFO ] Flow matrix only has 64 transitions (discarded 7 similar events)
[2024-06-01 12:30:08] [INFO ] Invariant cache hit.
[2024-06-01 12:30:08] [INFO ] State equation strengthened by 28 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp17 is UNSAT
After SMT solving in domain Real declared 41/106 variables, and 1 constraints, problems are : Problem set: 1 solved, 0 unsolved in 21 ms.
Refiners :[Positive P Invariants (semi-flows): 1/2 constraints, State Equation: 0/42 constraints, ReadFeed: 0/28 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 27ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA StigmergyElection-PT-03a-LTLFireability-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
Computed a total of 8 stabilizing places and 7 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(G((p0&&(F(p2)||p1)))))'
Support contains 5 out of 42 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 42/42 places, 71/71 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 40 transition count 65
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 11 place count 35 transition count 65
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 11 place count 35 transition count 56
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 29 place count 26 transition count 56
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 34 place count 21 transition count 49
Iterating global reduction 2 with 5 rules applied. Total rules applied 39 place count 21 transition count 49
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 40 place count 20 transition count 47
Iterating global reduction 2 with 1 rules applied. Total rules applied 41 place count 20 transition count 47
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 42 place count 20 transition count 46
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 48 place count 17 transition count 43
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 51 place count 17 transition count 40
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 57 place count 14 transition count 37
Applied a total of 57 rules in 19 ms. Remains 14 /42 variables (removed 28) and now considering 37/71 (removed 34) transitions.
[2024-06-01 12:30:09] [INFO ] Flow matrix only has 32 transitions (discarded 5 similar events)
// Phase 1: matrix 32 rows 14 cols
[2024-06-01 12:30:09] [INFO ] Computed 1 invariants in 0 ms
[2024-06-01 12:30:09] [INFO ] Implicit Places using invariants in 15 ms returned []
[2024-06-01 12:30:09] [INFO ] Flow matrix only has 32 transitions (discarded 5 similar events)
[2024-06-01 12:30:09] [INFO ] Invariant cache hit.
[2024-06-01 12:30:09] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-06-01 12:30:09] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2024-06-01 12:30:09] [INFO ] Redundant transitions in 0 ms returned []
Running 34 sub problems to find dead transitions.
[2024-06-01 12:30:09] [INFO ] Flow matrix only has 32 transitions (discarded 5 similar events)
[2024-06-01 12:30:09] [INFO ] Invariant cache hit.
[2024-06-01 12:30:09] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 1 (OVERLAPS) 3/14 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 34 unsolved
[2024-06-01 12:30:09] [INFO ] Deduced a trap composed of 6 places in 17 ms of which 0 ms to minimize.
[2024-06-01 12:30:09] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-06-01 12:30:09] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-06-01 12:30:09] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 1 ms to minimize.
[2024-06-01 12:30:09] [INFO ] Deduced a trap composed of 6 places in 14 ms of which 0 ms to minimize.
[2024-06-01 12:30:09] [INFO ] Deduced a trap composed of 6 places in 15 ms of which 0 ms to minimize.
[2024-06-01 12:30:09] [INFO ] Deduced a trap composed of 6 places in 16 ms of which 1 ms to minimize.
[2024-06-01 12:30:09] [INFO ] Deduced a trap composed of 6 places in 13 ms of which 1 ms to minimize.
[2024-06-01 12:30:09] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 4 (OVERLAPS) 31/45 variables, 14/24 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/45 variables, 17/41 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/45 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 7 (OVERLAPS) 1/46 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/46 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 9 (OVERLAPS) 0/46 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 34 unsolved
No progress, stopping.
After SMT solving in domain Real declared 46/46 variables, and 42 constraints, problems are : Problem set: 0 solved, 34 unsolved in 491 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 14/14 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 34/34 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 34 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 1 (OVERLAPS) 3/14 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 4 (OVERLAPS) 31/45 variables, 14/24 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/45 variables, 17/41 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/45 variables, 34/75 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/45 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 8 (OVERLAPS) 1/46 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/46 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 10 (OVERLAPS) 0/46 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 34 unsolved
No progress, stopping.
After SMT solving in domain Int declared 46/46 variables, and 76 constraints, problems are : Problem set: 0 solved, 34 unsolved in 374 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 14/14 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 34/34 constraints, Known Traps: 9/9 constraints]
After SMT, in 887ms problems are : Problem set: 0 solved, 34 unsolved
Search for dead transitions found 0 dead transitions in 888ms
Starting structural reductions in SI_LTL mode, iteration 1 : 14/42 places, 37/71 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 958 ms. Remains : 14/42 places, 37/71 transitions.
Stuttering acceptance computed with spot in 183 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : StigmergyElection-PT-03a-LTLFireability-00
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 2 ms.
FORMULA StigmergyElection-PT-03a-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-03a-LTLFireability-00 finished in 1194 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((((G(p0) U p1) U p2)||X(X(G(p3)))))'
Support contains 6 out of 42 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 42/42 places, 71/71 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 41 transition count 69
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 41 transition count 69
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 40 transition count 67
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 40 transition count 67
Applied a total of 4 rules in 2 ms. Remains 40 /42 variables (removed 2) and now considering 67/71 (removed 4) transitions.
[2024-06-01 12:30:10] [INFO ] Flow matrix only has 61 transitions (discarded 6 similar events)
// Phase 1: matrix 61 rows 40 cols
[2024-06-01 12:30:10] [INFO ] Computed 2 invariants in 1 ms
[2024-06-01 12:30:10] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-06-01 12:30:10] [INFO ] Flow matrix only has 61 transitions (discarded 6 similar events)
[2024-06-01 12:30:10] [INFO ] Invariant cache hit.
[2024-06-01 12:30:10] [INFO ] State equation strengthened by 28 read => feed constraints.
[2024-06-01 12:30:10] [INFO ] Implicit Places using invariants and state equation in 53 ms returned [39]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 83 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 39/42 places, 67/71 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 35 transition count 63
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 35 transition count 63
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 32 transition count 60
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 32 transition count 60
Applied a total of 14 rules in 1 ms. Remains 32 /39 variables (removed 7) and now considering 60/67 (removed 7) transitions.
[2024-06-01 12:30:10] [INFO ] Flow matrix only has 54 transitions (discarded 6 similar events)
// Phase 1: matrix 54 rows 32 cols
[2024-06-01 12:30:10] [INFO ] Computed 1 invariants in 5 ms
[2024-06-01 12:30:10] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-06-01 12:30:10] [INFO ] Flow matrix only has 54 transitions (discarded 6 similar events)
[2024-06-01 12:30:10] [INFO ] Invariant cache hit.
[2024-06-01 12:30:10] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-06-01 12:30:10] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 32/42 places, 60/71 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 141 ms. Remains : 32/42 places, 60/71 transitions.
Stuttering acceptance computed with spot in 523 ms :[(AND (NOT p2) (NOT p3)), (NOT p3), (OR (AND (NOT p0) p1 (NOT p3)) (AND (NOT p1) p2 (NOT p3))), (AND (NOT p2) (NOT p3)), (NOT p3), true, (AND (NOT p3) (NOT p0)), (AND (NOT p1) p0 (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p0), (NOT p1), (NOT p2)]
Running random walk in product with property : StigmergyElection-PT-03a-LTLFireability-02
Product exploration explored 100000 steps with 12500 reset in 330 ms.
Product exploration explored 100000 steps with 12500 reset in 211 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 p2) p1 (NOT p0) p3), (X (NOT p2)), (X (OR (AND (NOT p2) p1) (AND (NOT p2) p0))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (OR (AND p2 (NOT p0)) (AND p1 (NOT p0)))), (X (NOT (OR (AND p2 p0) (AND p1 p0)))), (X (NOT (AND p2 (NOT p1) p0))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT p0)), (X p1), (X (X (NOT p2))), (X (X p3)), (X (X (AND (NOT p0) p3))), (X (X (NOT (AND (NOT p1) p0 p3)))), (X (X (NOT (OR (AND (NOT p2) p1 (NOT p3)) (AND (NOT p2) p0 (NOT p3)))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0) (NOT p3))))), (X (X (OR (AND (NOT p2) p1 p3) (AND (NOT p2) p0 p3)))), (X (X (NOT (AND (NOT p2) (NOT p1) p0 (NOT p3))))), (X (X (NOT (AND p0 p3)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0) p3)))), (X (X (NOT (AND (NOT p1) p0 (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) (NOT p1) p0 p3)))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 26 factoid took 172 ms. Reduced automaton from 12 states, 37 edges and 4 AP (stutter sensitive) to 10 states, 28 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 376 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p3), true, (AND (NOT p3) (NOT p0)), (AND (NOT p3) p0 (NOT p1)), (AND (NOT p2) (NOT p3)), (NOT p0), (NOT p1), (NOT p2)]
RANDOM walk for 40000 steps (531 resets) in 466 ms. (85 steps per ms) remains 8/21 properties
BEST_FIRST walk for 40004 steps (108 resets) in 121 ms. (327 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (109 resets) in 281 ms. (141 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (103 resets) in 59 ms. (666 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (78 resets) in 98 ms. (404 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (121 resets) in 111 ms. (357 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (94 resets) in 62 ms. (634 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (100 resets) in 119 ms. (333 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (108 resets) in 40 ms. (975 steps per ms) remains 8/8 properties
[2024-06-01 12:30:12] [INFO ] Flow matrix only has 54 transitions (discarded 6 similar events)
[2024-06-01 12:30:12] [INFO ] Invariant cache hit.
[2024-06-01 12:30:12] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 26/32 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 12:30:12] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 1 ms to minimize.
Problem apf7 is UNSAT
Problem apf13 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 1/2 constraints. Problems are: Problem set: 2 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 0/2 constraints. Problems are: Problem set: 2 solved, 6 unsolved
Problem apf3 is UNSAT
Problem apf11 is UNSAT
Problem apf14 is UNSAT
Problem apf16 is UNSAT
Problem apf17 is UNSAT
Problem apf20 is UNSAT
After SMT solving in domain Real declared 85/86 variables, and 34 constraints, problems are : Problem set: 8 solved, 0 unsolved in 88 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 32/32 constraints, ReadFeed: 0/16 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 1/1 constraints]
After SMT, in 99ms problems are : Problem set: 8 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 8 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0) p3), (X (NOT p2)), (X (OR (AND (NOT p2) p1) (AND (NOT p2) p0))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (OR (AND p2 (NOT p0)) (AND p1 (NOT p0)))), (X (NOT (OR (AND p2 p0) (AND p1 p0)))), (X (NOT (AND p2 (NOT p1) p0))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT p0)), (X p1), (X (X (NOT p2))), (X (X p3)), (X (X (AND (NOT p0) p3))), (X (X (NOT (AND (NOT p1) p0 p3)))), (X (X (NOT (OR (AND (NOT p2) p1 (NOT p3)) (AND (NOT p2) p0 (NOT p3)))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0) (NOT p3))))), (X (X (OR (AND (NOT p2) p1 p3) (AND (NOT p2) p0 p3)))), (X (X (NOT (AND (NOT p2) (NOT p1) p0 (NOT p3))))), (X (X (NOT (AND p0 p3)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0) p3)))), (X (X (NOT (AND (NOT p1) p0 (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) (NOT p1) p0 p3)))), (X (X p1)), (G (OR p1 p2 (NOT p0) p3)), (G (OR p1 (NOT p0) (NOT p3))), (G (OR p1 p2 (NOT p0))), (G (OR p1 (NOT p0) p3)), (G (OR p1 p2 (NOT p0) (NOT p3))), (G (OR (NOT p0) p3)), (G (OR p1 p2 p0 p3)), (G (OR p1 (NOT p0)))]
False Knowledge obtained : [(F (NOT (OR (AND p1 (NOT p2) p3) (AND (NOT p2) p0 p3)))), (F (NOT (AND (OR (NOT p1) p2 p3) (OR p2 (NOT p0) p3)))), (F (NOT (OR p0 p3))), (F (NOT (OR p1 p0))), (F (NOT (OR p1 p2 p0))), (F (NOT (OR (AND p1 (NOT p2)) (AND (NOT p2) p0)))), (F (NOT (OR p1 p2 p0 (NOT p3)))), (F (NOT p1)), (F p2), (F p0), (F (NOT (AND (NOT p0) p3))), (F (NOT p3)), (F (NOT (OR (NOT p0) (NOT p3))))]
Knowledge based reduction with 34 factoid took 649 ms. Reduced automaton from 10 states, 28 edges and 4 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 216 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p3), true, (AND (NOT p2) (NOT p3)), (NOT p2)]
Stuttering acceptance computed with spot in 205 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p3), true, (AND (NOT p2) (NOT p3)), (NOT p2)]
Support contains 5 out of 32 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 60/60 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 60/60 (removed 0) transitions.
[2024-06-01 12:30:13] [INFO ] Flow matrix only has 54 transitions (discarded 6 similar events)
[2024-06-01 12:30:13] [INFO ] Invariant cache hit.
[2024-06-01 12:30:13] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-06-01 12:30:13] [INFO ] Flow matrix only has 54 transitions (discarded 6 similar events)
[2024-06-01 12:30:13] [INFO ] Invariant cache hit.
[2024-06-01 12:30:13] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-06-01 12:30:13] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
Running 59 sub problems to find dead transitions.
[2024-06-01 12:30:13] [INFO ] Flow matrix only has 54 transitions (discarded 6 similar events)
[2024-06-01 12:30:13] [INFO ] Invariant cache hit.
[2024-06-01 12:30:13] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (OVERLAPS) 1/32 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-06-01 12:30:14] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 0 ms to minimize.
[2024-06-01 12:30:14] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 0 ms to minimize.
[2024-06-01 12:30:14] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 1 ms to minimize.
[2024-06-01 12:30:14] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 1 ms to minimize.
[2024-06-01 12:30:14] [INFO ] Deduced a trap composed of 12 places in 18 ms of which 1 ms to minimize.
[2024-06-01 12:30:14] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 1 ms to minimize.
[2024-06-01 12:30:14] [INFO ] Deduced a trap composed of 12 places in 16 ms of which 1 ms to minimize.
[2024-06-01 12:30:14] [INFO ] Deduced a trap composed of 12 places in 18 ms of which 1 ms to minimize.
[2024-06-01 12:30:14] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 3 ms to minimize.
[2024-06-01 12:30:14] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
[2024-06-01 12:30:14] [INFO ] Deduced a trap composed of 13 places in 19 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-06-01 12:30:14] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 7 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 5 (OVERLAPS) 53/85 variables, 32/45 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/85 variables, 15/60 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/85 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 8 (OVERLAPS) 1/86 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/86 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 10 (OVERLAPS) 0/86 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Real declared 86/86 variables, and 61 constraints, problems are : Problem set: 0 solved, 59 unsolved in 1266 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 32/32 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 59 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (OVERLAPS) 1/32 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-06-01 12:30:15] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 5 (OVERLAPS) 53/85 variables, 32/46 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/85 variables, 15/61 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/85 variables, 59/120 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/85 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 9 (OVERLAPS) 1/86 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/86 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 11 (OVERLAPS) 0/86 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Int declared 86/86 variables, and 121 constraints, problems are : Problem set: 0 solved, 59 unsolved in 1271 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 32/32 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 13/13 constraints]
After SMT, in 2555ms problems are : Problem set: 0 solved, 59 unsolved
Search for dead transitions found 0 dead transitions in 2556ms
Finished structural reductions in LTL mode , in 1 iterations and 2609 ms. Remains : 32/32 places, 60/60 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 p3 p1 (NOT p2)), (X (X (NOT p2))), (X (X p3)), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p1 (NOT p2) p3))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 180 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 214 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p3), true, (AND (NOT p2) (NOT p3)), (NOT p2)]
RANDOM walk for 151 steps (1 resets) in 5 ms. (25 steps per ms) remains 0/7 properties
Knowledge obtained : [(AND p3 p1 (NOT p2)), (X (X (NOT p2))), (X (X p3)), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p1 (NOT p2) p3))), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p1 p2))), (F (NOT (OR p2 p3))), (F (NOT p1)), (F (NOT (AND p1 (NOT p2) p3))), (F p2), (F (NOT (AND p1 (NOT p2)))), (F (NOT p3))]
Knowledge based reduction with 7 factoid took 294 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 231 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p3), true, (AND (NOT p2) (NOT p3)), (NOT p2)]
Stuttering acceptance computed with spot in 212 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p3), true, (AND (NOT p2) (NOT p3)), (NOT p2)]
Stuttering acceptance computed with spot in 219 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p3), true, (AND (NOT p2) (NOT p3)), (NOT p2)]
Product exploration explored 100000 steps with 12500 reset in 93 ms.
Product exploration explored 100000 steps with 12500 reset in 156 ms.
Applying partial POR strategy [false, false, true, true, false, true]
Stuttering acceptance computed with spot in 225 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p3), true, (AND (NOT p2) (NOT p3)), (NOT p2)]
Support contains 5 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 60/60 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 32 transition count 60
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 5 Pre rules applied. Total rules applied 2 place count 32 transition count 62
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 7 place count 32 transition count 62
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 31 transition count 60
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 31 transition count 60
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 30 transition count 58
Deduced a syphon composed of 7 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 30 transition count 58
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 13 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 17 place count 30 transition count 61
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 20 place count 30 transition count 58
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 22 place count 28 transition count 56
Deduced a syphon composed of 11 places in 0 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 24 place count 28 transition count 56
Deduced a syphon composed of 11 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 2 with 5 rules applied. Total rules applied 29 place count 28 transition count 51
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 14 places in 0 ms
Iterating global reduction 2 with 3 rules applied. Total rules applied 32 place count 28 transition count 51
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 37 place count 23 transition count 46
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 2 with 5 rules applied. Total rules applied 42 place count 23 transition count 46
Deduced a syphon composed of 9 places in 0 ms
Applied a total of 42 rules in 16 ms. Remains 23 /32 variables (removed 9) and now considering 46/60 (removed 14) transitions.
[2024-06-01 12:30:18] [INFO ] Redundant transitions in 1 ms returned []
Running 45 sub problems to find dead transitions.
[2024-06-01 12:30:18] [INFO ] Flow matrix only has 41 transitions (discarded 5 similar events)
// Phase 1: matrix 41 rows 23 cols
[2024-06-01 12:30:18] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 12:30:18] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 1 (OVERLAPS) 1/23 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 45 unsolved
[2024-06-01 12:30:18] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 0 ms to minimize.
[2024-06-01 12:30:18] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 0 ms to minimize.
[2024-06-01 12:30:18] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 1 ms to minimize.
[2024-06-01 12:30:18] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 0 ms to minimize.
[2024-06-01 12:30:18] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 1 ms to minimize.
[2024-06-01 12:30:18] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 1 ms to minimize.
[2024-06-01 12:30:18] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 0 ms to minimize.
[2024-06-01 12:30:18] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 45 unsolved
[2024-06-01 12:30:18] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
[2024-06-01 12:30:18] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/23 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 45 unsolved
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD25 is UNSAT
At refinement iteration 5 (OVERLAPS) 40/63 variables, 23/34 constraints. Problems are: Problem set: 12 solved, 33 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/63 variables, 15/49 constraints. Problems are: Problem set: 12 solved, 33 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/63 variables, 0/49 constraints. Problems are: Problem set: 12 solved, 33 unsolved
At refinement iteration 8 (OVERLAPS) 1/64 variables, 1/50 constraints. Problems are: Problem set: 12 solved, 33 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/64 variables, 0/50 constraints. Problems are: Problem set: 12 solved, 33 unsolved
At refinement iteration 10 (OVERLAPS) 0/64 variables, 0/50 constraints. Problems are: Problem set: 12 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Real declared 64/64 variables, and 50 constraints, problems are : Problem set: 12 solved, 33 unsolved in 745 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 23/23 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 45/45 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 12 solved, 33 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 12 solved, 33 unsolved
At refinement iteration 1 (OVERLAPS) 10/23 variables, 1/1 constraints. Problems are: Problem set: 12 solved, 33 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 10/11 constraints. Problems are: Problem set: 12 solved, 33 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/23 variables, 0/11 constraints. Problems are: Problem set: 12 solved, 33 unsolved
At refinement iteration 4 (OVERLAPS) 40/63 variables, 23/34 constraints. Problems are: Problem set: 12 solved, 33 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 15/49 constraints. Problems are: Problem set: 12 solved, 33 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/63 variables, 33/82 constraints. Problems are: Problem set: 12 solved, 33 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/63 variables, 0/82 constraints. Problems are: Problem set: 12 solved, 33 unsolved
At refinement iteration 8 (OVERLAPS) 1/64 variables, 1/83 constraints. Problems are: Problem set: 12 solved, 33 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/64 variables, 0/83 constraints. Problems are: Problem set: 12 solved, 33 unsolved
At refinement iteration 10 (OVERLAPS) 0/64 variables, 0/83 constraints. Problems are: Problem set: 12 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Int declared 64/64 variables, and 83 constraints, problems are : Problem set: 12 solved, 33 unsolved in 470 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 23/23 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 33/45 constraints, Known Traps: 10/10 constraints]
After SMT, in 1232ms problems are : Problem set: 12 solved, 33 unsolved
Search for dead transitions found 12 dead transitions in 1233ms
Found 12 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 12 transitions
Dead transitions reduction (with SMT) removed 12 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 23/32 places, 34/60 transitions.
Graph (complete) has 51 edges and 23 vertex of which 14 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 12 ms. Remains 14 /23 variables (removed 9) and now considering 34/34 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 14/32 places, 34/60 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1270 ms. Remains : 14/32 places, 34/60 transitions.
Support contains 5 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 60/60 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 31 transition count 58
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 31 transition count 58
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 30 transition count 56
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 30 transition count 56
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 29 transition count 55
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 29 transition count 55
Applied a total of 6 rules in 2 ms. Remains 29 /32 variables (removed 3) and now considering 55/60 (removed 5) transitions.
[2024-06-01 12:30:19] [INFO ] Flow matrix only has 50 transitions (discarded 5 similar events)
// Phase 1: matrix 50 rows 29 cols
[2024-06-01 12:30:19] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 12:30:19] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-06-01 12:30:19] [INFO ] Flow matrix only has 50 transitions (discarded 5 similar events)
[2024-06-01 12:30:19] [INFO ] Invariant cache hit.
[2024-06-01 12:30:19] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-06-01 12:30:19] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
Running 54 sub problems to find dead transitions.
[2024-06-01 12:30:19] [INFO ] Flow matrix only has 50 transitions (discarded 5 similar events)
[2024-06-01 12:30:19] [INFO ] Invariant cache hit.
[2024-06-01 12:30:19] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 1 (OVERLAPS) 1/29 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-06-01 12:30:19] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 1 ms to minimize.
[2024-06-01 12:30:19] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 1 ms to minimize.
[2024-06-01 12:30:19] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 0 ms to minimize.
[2024-06-01 12:30:19] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 1 ms to minimize.
[2024-06-01 12:30:20] [INFO ] Deduced a trap composed of 12 places in 18 ms of which 0 ms to minimize.
[2024-06-01 12:30:20] [INFO ] Deduced a trap composed of 12 places in 19 ms of which 1 ms to minimize.
[2024-06-01 12:30:20] [INFO ] Deduced a trap composed of 13 places in 14 ms of which 1 ms to minimize.
[2024-06-01 12:30:20] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 4 ms to minimize.
[2024-06-01 12:30:20] [INFO ] Deduced a trap composed of 9 places in 17 ms of which 1 ms to minimize.
[2024-06-01 12:30:20] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 0 ms to minimize.
[2024-06-01 12:30:20] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2024-06-01 12:30:20] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 0 ms to minimize.
[2024-06-01 12:30:20] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 13/14 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-06-01 12:30:20] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 5 (OVERLAPS) 49/78 variables, 29/44 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 15/59 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-06-01 12:30:20] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/78 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/78 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 9 (OVERLAPS) 1/79 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/79 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 11 (OVERLAPS) 0/79 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Real declared 79/79 variables, and 61 constraints, problems are : Problem set: 0 solved, 54 unsolved in 1372 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 29/29 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 54 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 1 (OVERLAPS) 1/29 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 15/16 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 4 (OVERLAPS) 49/78 variables, 29/45 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 15/60 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 54/114 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/78 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 8 (OVERLAPS) 1/79 variables, 1/115 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/79 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 10 (OVERLAPS) 0/79 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Int declared 79/79 variables, and 115 constraints, problems are : Problem set: 0 solved, 54 unsolved in 955 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 29/29 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 15/15 constraints]
After SMT, in 2344ms problems are : Problem set: 0 solved, 54 unsolved
Search for dead transitions found 0 dead transitions in 2345ms
Starting structural reductions in LTL mode, iteration 1 : 29/32 places, 55/60 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2397 ms. Remains : 29/32 places, 55/60 transitions.
Treatment of property StigmergyElection-PT-03a-LTLFireability-02 finished in 11884 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(!p0)&&(G(p1)||X(X(F((G(!p0)||p2)))))))'
Support contains 4 out of 42 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 42/42 places, 71/71 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 39 transition count 65
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 39 transition count 65
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 37 transition count 61
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 37 transition count 61
Applied a total of 10 rules in 2 ms. Remains 37 /42 variables (removed 5) and now considering 61/71 (removed 10) transitions.
[2024-06-01 12:30:22] [INFO ] Flow matrix only has 57 transitions (discarded 4 similar events)
// Phase 1: matrix 57 rows 37 cols
[2024-06-01 12:30:22] [INFO ] Computed 2 invariants in 0 ms
[2024-06-01 12:30:22] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-06-01 12:30:22] [INFO ] Flow matrix only has 57 transitions (discarded 4 similar events)
[2024-06-01 12:30:22] [INFO ] Invariant cache hit.
[2024-06-01 12:30:22] [INFO ] State equation strengthened by 28 read => feed constraints.
[2024-06-01 12:30:22] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
Running 60 sub problems to find dead transitions.
[2024-06-01 12:30:22] [INFO ] Flow matrix only has 57 transitions (discarded 4 similar events)
[2024-06-01 12:30:22] [INFO ] Invariant cache hit.
[2024-06-01 12:30:22] [INFO ] State equation strengthened by 28 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 1/37 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-06-01 12:30:22] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 0 ms to minimize.
[2024-06-01 12:30:22] [INFO ] Deduced a trap composed of 14 places in 14 ms of which 1 ms to minimize.
[2024-06-01 12:30:22] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 1 ms to minimize.
[2024-06-01 12:30:22] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 1 ms to minimize.
[2024-06-01 12:30:22] [INFO ] Deduced a trap composed of 10 places in 18 ms of which 1 ms to minimize.
[2024-06-01 12:30:22] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-06-01 12:30:22] [INFO ] Deduced a trap composed of 11 places in 18 ms of which 0 ms to minimize.
[2024-06-01 12:30:22] [INFO ] Deduced a trap composed of 11 places in 19 ms of which 1 ms to minimize.
[2024-06-01 12:30:22] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 0 ms to minimize.
[2024-06-01 12:30:22] [INFO ] Deduced a trap composed of 13 places in 21 ms of which 1 ms to minimize.
[2024-06-01 12:30:22] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 1 ms to minimize.
[2024-06-01 12:30:22] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 0 ms to minimize.
[2024-06-01 12:30:22] [INFO ] Deduced a trap composed of 13 places in 21 ms of which 0 ms to minimize.
[2024-06-01 12:30:22] [INFO ] Deduced a trap composed of 11 places in 18 ms of which 1 ms to minimize.
[2024-06-01 12:30:22] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 15/17 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 56/93 variables, 37/54 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/93 variables, 27/81 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/93 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 1/94 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/94 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (OVERLAPS) 0/94 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 94/94 variables, and 82 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1370 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 37/37 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 1/37 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 15/17 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-06-01 12:30:23] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-06-01 12:30:23] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/37 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 56/93 variables, 37/56 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/93 variables, 27/83 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/93 variables, 60/143 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/93 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (OVERLAPS) 1/94 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/94 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 12 (OVERLAPS) 0/94 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 94/94 variables, and 144 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1275 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 37/37 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 17/17 constraints]
After SMT, in 2659ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 2660ms
Starting structural reductions in LTL mode, iteration 1 : 37/42 places, 61/71 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2738 ms. Remains : 37/42 places, 61/71 transitions.
Stuttering acceptance computed with spot in 231 ms :[p0, p0, (AND p0 (NOT p2)), (AND (NOT p1) p0 (NOT p2)), true, (AND p0 (NOT p2)), (AND p0 (NOT p2) (NOT p1))]
Running random walk in product with property : StigmergyElection-PT-03a-LTLFireability-03
Entered a terminal (fully accepting) state of product in 4 steps with 1 reset in 1 ms.
FORMULA StigmergyElection-PT-03a-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-03a-LTLFireability-03 finished in 2985 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X((F(p0) U G(p1)))))'
Support contains 4 out of 42 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 42/42 places, 71/71 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 40 transition count 64
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 34 transition count 64
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 13 place count 34 transition count 55
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 31 place count 25 transition count 55
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 36 place count 20 transition count 48
Iterating global reduction 2 with 5 rules applied. Total rules applied 41 place count 20 transition count 48
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 43 place count 18 transition count 44
Iterating global reduction 2 with 2 rules applied. Total rules applied 45 place count 18 transition count 44
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 48 place count 18 transition count 41
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 54 place count 15 transition count 38
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 57 place count 15 transition count 35
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 63 place count 12 transition count 32
Applied a total of 63 rules in 21 ms. Remains 12 /42 variables (removed 30) and now considering 32/71 (removed 39) transitions.
[2024-06-01 12:30:25] [INFO ] Flow matrix only has 27 transitions (discarded 5 similar events)
// Phase 1: matrix 27 rows 12 cols
[2024-06-01 12:30:25] [INFO ] Computed 1 invariants in 0 ms
[2024-06-01 12:30:25] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-06-01 12:30:25] [INFO ] Flow matrix only has 27 transitions (discarded 5 similar events)
[2024-06-01 12:30:25] [INFO ] Invariant cache hit.
[2024-06-01 12:30:25] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-06-01 12:30:25] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2024-06-01 12:30:25] [INFO ] Redundant transitions in 0 ms returned []
Running 29 sub problems to find dead transitions.
[2024-06-01 12:30:25] [INFO ] Flow matrix only has 27 transitions (discarded 5 similar events)
[2024-06-01 12:30:25] [INFO ] Invariant cache hit.
[2024-06-01 12:30:25] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (OVERLAPS) 3/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 29 unsolved
[2024-06-01 12:30:25] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-06-01 12:30:25] [INFO ] Deduced a trap composed of 6 places in 14 ms of which 1 ms to minimize.
[2024-06-01 12:30:25] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-06-01 12:30:25] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 29 unsolved
[2024-06-01 12:30:25] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-06-01 12:30:25] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-06-01 12:30:25] [INFO ] Deduced a trap composed of 6 places in 16 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 29 unsolved
[2024-06-01 12:30:25] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 29 unsolved
[2024-06-01 12:30:25] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/12 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/12 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 7 (OVERLAPS) 26/38 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/38 variables, 15/37 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/38 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 10 (OVERLAPS) 1/39 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/39 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 12 (OVERLAPS) 0/39 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Real declared 39/39 variables, and 38 constraints, problems are : Problem set: 0 solved, 29 unsolved in 561 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 12/12 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 29 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (OVERLAPS) 3/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (OVERLAPS) 26/38 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 15/37 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 29/66 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/38 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 8 (OVERLAPS) 1/39 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/39 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 10 (OVERLAPS) 0/39 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Int declared 39/39 variables, and 67 constraints, problems are : Problem set: 0 solved, 29 unsolved in 302 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 12/12 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 9/9 constraints]
After SMT, in 878ms problems are : Problem set: 0 solved, 29 unsolved
Search for dead transitions found 0 dead transitions in 878ms
Starting structural reductions in SI_LTL mode, iteration 1 : 12/42 places, 32/71 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 950 ms. Remains : 12/42 places, 32/71 transitions.
Stuttering acceptance computed with spot in 133 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : StigmergyElection-PT-03a-LTLFireability-04
Stuttering criterion allowed to conclude after 7 steps with 1 reset in 0 ms.
FORMULA StigmergyElection-PT-03a-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-03a-LTLFireability-04 finished in 1104 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))||G(p1)))'
Support contains 3 out of 42 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 42/42 places, 71/71 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 40 transition count 67
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 40 transition count 67
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 38 transition count 63
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 38 transition count 63
Applied a total of 8 rules in 4 ms. Remains 38 /42 variables (removed 4) and now considering 63/71 (removed 8) transitions.
[2024-06-01 12:30:26] [INFO ] Flow matrix only has 58 transitions (discarded 5 similar events)
// Phase 1: matrix 58 rows 38 cols
[2024-06-01 12:30:26] [INFO ] Computed 2 invariants in 1 ms
[2024-06-01 12:30:26] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-06-01 12:30:26] [INFO ] Flow matrix only has 58 transitions (discarded 5 similar events)
[2024-06-01 12:30:26] [INFO ] Invariant cache hit.
[2024-06-01 12:30:26] [INFO ] State equation strengthened by 28 read => feed constraints.
[2024-06-01 12:30:26] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
Running 62 sub problems to find dead transitions.
[2024-06-01 12:30:26] [INFO ] Flow matrix only has 58 transitions (discarded 5 similar events)
[2024-06-01 12:30:26] [INFO ] Invariant cache hit.
[2024-06-01 12:30:26] [INFO ] State equation strengthened by 28 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 1 (OVERLAPS) 1/38 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 62 unsolved
[2024-06-01 12:30:26] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
[2024-06-01 12:30:26] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 1 ms to minimize.
[2024-06-01 12:30:26] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 0 ms to minimize.
[2024-06-01 12:30:26] [INFO ] Deduced a trap composed of 12 places in 18 ms of which 1 ms to minimize.
[2024-06-01 12:30:26] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2024-06-01 12:30:26] [INFO ] Deduced a trap composed of 15 places in 15 ms of which 0 ms to minimize.
[2024-06-01 12:30:26] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 0 ms to minimize.
[2024-06-01 12:30:26] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 1 ms to minimize.
[2024-06-01 12:30:26] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 0 ms to minimize.
[2024-06-01 12:30:26] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 0 ms to minimize.
[2024-06-01 12:30:26] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2024-06-01 12:30:26] [INFO ] Deduced a trap composed of 10 places in 18 ms of which 0 ms to minimize.
[2024-06-01 12:30:26] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 1 ms to minimize.
[2024-06-01 12:30:26] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 62 unsolved
[2024-06-01 12:30:26] [INFO ] Deduced a trap composed of 13 places in 20 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 5 (OVERLAPS) 57/95 variables, 38/55 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/95 variables, 27/82 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/95 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 8 (OVERLAPS) 1/96 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/96 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 10 (OVERLAPS) 0/96 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 62 unsolved
No progress, stopping.
After SMT solving in domain Real declared 96/96 variables, and 83 constraints, problems are : Problem set: 0 solved, 62 unsolved in 1427 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 38/38 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 62/62 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 62 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 1 (OVERLAPS) 1/38 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 15/17 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 4 (OVERLAPS) 57/95 variables, 38/55 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/95 variables, 27/82 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/95 variables, 62/144 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/95 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 8 (OVERLAPS) 1/96 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/96 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 10 (OVERLAPS) 0/96 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 62 unsolved
No progress, stopping.
After SMT solving in domain Int declared 96/96 variables, and 145 constraints, problems are : Problem set: 0 solved, 62 unsolved in 1014 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 38/38 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 62/62 constraints, Known Traps: 15/15 constraints]
After SMT, in 2453ms problems are : Problem set: 0 solved, 62 unsolved
Search for dead transitions found 0 dead transitions in 2455ms
Starting structural reductions in LTL mode, iteration 1 : 38/42 places, 63/71 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2528 ms. Remains : 38/42 places, 63/71 transitions.
Stuttering acceptance computed with spot in 127 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : StigmergyElection-PT-03a-LTLFireability-05
Product exploration explored 100000 steps with 22269 reset in 65 ms.
Product exploration explored 100000 steps with 22222 reset in 116 ms.
Computed a total of 8 stabilizing places and 7 stable transitions
Computed a total of 8 stabilizing places and 7 stable transitions
Detected a total of 8/38 stabilizing places and 7/63 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 253 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 14 steps (0 resets) in 4 ms. (2 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F p0)]
Knowledge based reduction with 8 factoid took 278 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
[2024-06-01 12:30:29] [INFO ] Flow matrix only has 58 transitions (discarded 5 similar events)
[2024-06-01 12:30:29] [INFO ] Invariant cache hit.
[2024-06-01 12:30:29] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-06-01 12:30:29] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-06-01 12:30:29] [INFO ] State equation strengthened by 28 read => feed constraints.
[2024-06-01 12:30:29] [INFO ] [Real]Added 28 Read/Feed constraints in 2 ms returned sat
[2024-06-01 12:30:29] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 12:30:29] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 12:30:30] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-06-01 12:30:30] [INFO ] [Nat]Added 28 Read/Feed constraints in 2 ms returned sat
[2024-06-01 12:30:30] [INFO ] Computed and/alt/rep : 39/73/39 causal constraints (skipped 18 transitions) in 3 ms.
[2024-06-01 12:30:30] [INFO ] Added : 12 causal constraints over 3 iterations in 20 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 38 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 38/38 places, 63/63 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 38 transition count 60
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 35 transition count 60
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 24 place count 26 transition count 51
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 28 place count 22 transition count 47
Iterating global reduction 0 with 4 rules applied. Total rules applied 32 place count 22 transition count 47
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 35 place count 22 transition count 44
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 39 place count 20 transition count 42
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 42 place count 20 transition count 39
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 20 transition count 39
Applied a total of 43 rules in 9 ms. Remains 20 /38 variables (removed 18) and now considering 39/63 (removed 24) transitions.
[2024-06-01 12:30:30] [INFO ] Flow matrix only has 34 transitions (discarded 5 similar events)
// Phase 1: matrix 34 rows 20 cols
[2024-06-01 12:30:30] [INFO ] Computed 2 invariants in 0 ms
[2024-06-01 12:30:30] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-06-01 12:30:30] [INFO ] Flow matrix only has 34 transitions (discarded 5 similar events)
[2024-06-01 12:30:30] [INFO ] Invariant cache hit.
[2024-06-01 12:30:30] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-06-01 12:30:30] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2024-06-01 12:30:30] [INFO ] Redundant transitions in 0 ms returned []
Running 38 sub problems to find dead transitions.
[2024-06-01 12:30:30] [INFO ] Flow matrix only has 34 transitions (discarded 5 similar events)
[2024-06-01 12:30:30] [INFO ] Invariant cache hit.
[2024-06-01 12:30:30] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (OVERLAPS) 1/20 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-06-01 12:30:30] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 0 ms to minimize.
[2024-06-01 12:30:30] [INFO ] Deduced a trap composed of 6 places in 16 ms of which 1 ms to minimize.
[2024-06-01 12:30:30] [INFO ] Deduced a trap composed of 9 places in 18 ms of which 0 ms to minimize.
[2024-06-01 12:30:30] [INFO ] Deduced a trap composed of 6 places in 13 ms of which 1 ms to minimize.
[2024-06-01 12:30:30] [INFO ] Deduced a trap composed of 8 places in 19 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-06-01 12:30:30] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 0 ms to minimize.
[2024-06-01 12:30:30] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 0 ms to minimize.
[2024-06-01 12:30:30] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-06-01 12:30:30] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/20 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (OVERLAPS) 33/53 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/53 variables, 24/55 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/53 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 9 (OVERLAPS) 1/54 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/54 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 11 (OVERLAPS) 0/54 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Real declared 54/54 variables, and 56 constraints, problems are : Problem set: 0 solved, 38 unsolved in 701 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 20/20 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 38 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (OVERLAPS) 1/20 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (OVERLAPS) 33/53 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 24/55 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/53 variables, 38/93 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/53 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 8 (OVERLAPS) 1/54 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/54 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 10 (OVERLAPS) 0/54 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Int declared 54/54 variables, and 94 constraints, problems are : Problem set: 0 solved, 38 unsolved in 496 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 20/20 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 9/9 constraints]
After SMT, in 1208ms problems are : Problem set: 0 solved, 38 unsolved
Search for dead transitions found 0 dead transitions in 1213ms
Starting structural reductions in SI_LTL mode, iteration 1 : 20/38 places, 39/63 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1282 ms. Remains : 20/38 places, 39/63 transitions.
Computed a total of 4 stabilizing places and 3 stable transitions
Computed a total of 4 stabilizing places and 3 stable transitions
Detected a total of 4/20 stabilizing places and 3/39 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 135 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 12 steps (0 resets) in 4 ms. (2 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 3 factoid took 149 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
[2024-06-01 12:30:31] [INFO ] Flow matrix only has 34 transitions (discarded 5 similar events)
[2024-06-01 12:30:31] [INFO ] Invariant cache hit.
[2024-06-01 12:30:31] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-06-01 12:30:31] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-06-01 12:30:31] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-06-01 12:30:31] [INFO ] [Real]Added 25 Read/Feed constraints in 2 ms returned sat
[2024-06-01 12:30:31] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 12:30:31] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 12:30:31] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-06-01 12:30:31] [INFO ] [Nat]Added 25 Read/Feed constraints in 2 ms returned sat
[2024-06-01 12:30:31] [INFO ] Computed and/alt/rep : 32/198/32 causal constraints (skipped 1 transitions) in 2 ms.
[2024-06-01 12:30:31] [INFO ] Added : 11 causal constraints over 3 iterations in 17 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25016 reset in 90 ms.
Product exploration explored 100000 steps with 25001 reset in 73 ms.
Support contains 2 out of 20 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 20/20 places, 39/39 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 19 transition count 37
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 19 transition count 37
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 18 transition count 36
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 18 transition count 35
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 6 place count 17 transition count 34
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 17 transition count 34
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 11 place count 17 transition count 30
Applied a total of 11 rules in 3 ms. Remains 17 /20 variables (removed 3) and now considering 30/39 (removed 9) transitions.
[2024-06-01 12:30:32] [INFO ] Flow matrix only has 26 transitions (discarded 4 similar events)
// Phase 1: matrix 26 rows 17 cols
[2024-06-01 12:30:32] [INFO ] Computed 2 invariants in 1 ms
[2024-06-01 12:30:32] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-06-01 12:30:32] [INFO ] Flow matrix only has 26 transitions (discarded 4 similar events)
[2024-06-01 12:30:32] [INFO ] Invariant cache hit.
[2024-06-01 12:30:32] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-01 12:30:32] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2024-06-01 12:30:32] [INFO ] Redundant transitions in 0 ms returned []
Running 29 sub problems to find dead transitions.
[2024-06-01 12:30:32] [INFO ] Flow matrix only has 26 transitions (discarded 4 similar events)
[2024-06-01 12:30:32] [INFO ] Invariant cache hit.
[2024-06-01 12:30:32] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (OVERLAPS) 1/17 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 29 unsolved
[2024-06-01 12:30:32] [INFO ] Deduced a trap composed of 6 places in 15 ms of which 1 ms to minimize.
[2024-06-01 12:30:32] [INFO ] Deduced a trap composed of 6 places in 16 ms of which 0 ms to minimize.
[2024-06-01 12:30:32] [INFO ] Deduced a trap composed of 6 places in 18 ms of which 0 ms to minimize.
[2024-06-01 12:30:32] [INFO ] Deduced a trap composed of 6 places in 17 ms of which 1 ms to minimize.
[2024-06-01 12:30:32] [INFO ] Deduced a trap composed of 6 places in 13 ms of which 1 ms to minimize.
[2024-06-01 12:30:32] [INFO ] Deduced a trap composed of 6 places in 14 ms of which 0 ms to minimize.
[2024-06-01 12:30:32] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 0 ms to minimize.
[2024-06-01 12:30:32] [INFO ] Deduced a trap composed of 6 places in 13 ms of which 1 ms to minimize.
[2024-06-01 12:30:32] [INFO ] Deduced a trap composed of 7 places in 18 ms of which 0 ms to minimize.
[2024-06-01 12:30:32] [INFO ] Deduced a trap composed of 8 places in 16 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 29 unsolved
[2024-06-01 12:30:32] [INFO ] Deduced a trap composed of 7 places in 16 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/17 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (OVERLAPS) 25/42 variables, 17/30 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/42 variables, 19/49 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/42 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 8 (OVERLAPS) 1/43 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/43 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 10 (OVERLAPS) 0/43 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Real declared 43/43 variables, and 50 constraints, problems are : Problem set: 0 solved, 29 unsolved in 519 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 17/17 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 29 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (OVERLAPS) 1/17 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/17 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (OVERLAPS) 25/42 variables, 17/30 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/42 variables, 19/49 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/42 variables, 29/78 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/42 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 8 (OVERLAPS) 1/43 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/43 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 10 (OVERLAPS) 0/43 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Int declared 43/43 variables, and 79 constraints, problems are : Problem set: 0 solved, 29 unsolved in 327 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 17/17 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 11/11 constraints]
After SMT, in 854ms problems are : Problem set: 0 solved, 29 unsolved
Search for dead transitions found 0 dead transitions in 855ms
Starting structural reductions in SI_LTL mode, iteration 1 : 17/20 places, 30/39 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 919 ms. Remains : 17/20 places, 30/39 transitions.
Treatment of property StigmergyElection-PT-03a-LTLFireability-05 finished in 6878 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(G(p0))))'
Support contains 3 out of 42 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 42/42 places, 71/71 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 39 transition count 65
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 39 transition count 65
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 36 transition count 59
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 36 transition count 59
Applied a total of 12 rules in 1 ms. Remains 36 /42 variables (removed 6) and now considering 59/71 (removed 12) transitions.
[2024-06-01 12:30:33] [INFO ] Flow matrix only has 55 transitions (discarded 4 similar events)
// Phase 1: matrix 55 rows 36 cols
[2024-06-01 12:30:33] [INFO ] Computed 2 invariants in 0 ms
[2024-06-01 12:30:33] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-06-01 12:30:33] [INFO ] Flow matrix only has 55 transitions (discarded 4 similar events)
[2024-06-01 12:30:33] [INFO ] Invariant cache hit.
[2024-06-01 12:30:33] [INFO ] State equation strengthened by 28 read => feed constraints.
[2024-06-01 12:30:33] [INFO ] Implicit Places using invariants and state equation in 55 ms returned [35]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 79 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 35/42 places, 59/71 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 29 transition count 53
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 29 transition count 53
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 26 transition count 50
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 26 transition count 50
Applied a total of 18 rules in 1 ms. Remains 26 /35 variables (removed 9) and now considering 50/59 (removed 9) transitions.
[2024-06-01 12:30:33] [INFO ] Flow matrix only has 46 transitions (discarded 4 similar events)
// Phase 1: matrix 46 rows 26 cols
[2024-06-01 12:30:33] [INFO ] Computed 1 invariants in 0 ms
[2024-06-01 12:30:33] [INFO ] Implicit Places using invariants in 14 ms returned []
[2024-06-01 12:30:33] [INFO ] Flow matrix only has 46 transitions (discarded 4 similar events)
[2024-06-01 12:30:33] [INFO ] Invariant cache hit.
[2024-06-01 12:30:33] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-06-01 12:30:33] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 26/42 places, 50/71 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 123 ms. Remains : 26/42 places, 50/71 transitions.
Stuttering acceptance computed with spot in 112 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyElection-PT-03a-LTLFireability-06
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA StigmergyElection-PT-03a-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-03a-LTLFireability-06 finished in 246 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Support contains 5 out of 42 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 42/42 places, 71/71 transitions.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 42 transition count 65
Deduced a syphon composed of 6 places in 4 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 36 transition count 65
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 33 transition count 59
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 33 transition count 59
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 30 transition count 53
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 30 transition count 53
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 26 place count 28 transition count 51
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 28 transition count 51
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 31 place count 28 transition count 48
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 37 place count 25 transition count 45
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 40 place count 25 transition count 42
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 46 place count 22 transition count 39
Applied a total of 46 rules in 21 ms. Remains 22 /42 variables (removed 20) and now considering 39/71 (removed 32) transitions.
[2024-06-01 12:30:33] [INFO ] Flow matrix only has 35 transitions (discarded 4 similar events)
// Phase 1: matrix 35 rows 22 cols
[2024-06-01 12:30:33] [INFO ] Computed 2 invariants in 0 ms
[2024-06-01 12:30:33] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-06-01 12:30:33] [INFO ] Flow matrix only has 35 transitions (discarded 4 similar events)
[2024-06-01 12:30:33] [INFO ] Invariant cache hit.
[2024-06-01 12:30:33] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-06-01 12:30:33] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2024-06-01 12:30:33] [INFO ] Redundant transitions in 0 ms returned []
Running 38 sub problems to find dead transitions.
[2024-06-01 12:30:33] [INFO ] Flow matrix only has 35 transitions (discarded 4 similar events)
[2024-06-01 12:30:33] [INFO ] Invariant cache hit.
[2024-06-01 12:30:33] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (OVERLAPS) 1/22 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-06-01 12:30:33] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 0 ms to minimize.
[2024-06-01 12:30:33] [INFO ] Deduced a trap composed of 6 places in 17 ms of which 0 ms to minimize.
[2024-06-01 12:30:33] [INFO ] Deduced a trap composed of 6 places in 16 ms of which 1 ms to minimize.
[2024-06-01 12:30:33] [INFO ] Deduced a trap composed of 7 places in 18 ms of which 1 ms to minimize.
[2024-06-01 12:30:33] [INFO ] Deduced a trap composed of 7 places in 15 ms of which 0 ms to minimize.
[2024-06-01 12:30:33] [INFO ] Deduced a trap composed of 6 places in 16 ms of which 0 ms to minimize.
[2024-06-01 12:30:33] [INFO ] Deduced a trap composed of 6 places in 14 ms of which 1 ms to minimize.
[2024-06-01 12:30:33] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 1 ms to minimize.
[2024-06-01 12:30:33] [INFO ] Deduced a trap composed of 6 places in 17 ms of which 0 ms to minimize.
[2024-06-01 12:30:33] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-06-01 12:30:33] [INFO ] Deduced a trap composed of 7 places in 15 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/22 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-06-01 12:30:33] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 0 ms to minimize.
[2024-06-01 12:30:33] [INFO ] Deduced a trap composed of 8 places in 18 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/22 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (OVERLAPS) 34/56 variables, 22/37 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/56 variables, 25/62 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/56 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 9 (OVERLAPS) 1/57 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/57 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 11 (OVERLAPS) 0/57 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Real declared 57/57 variables, and 63 constraints, problems are : Problem set: 0 solved, 38 unsolved in 814 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 22/22 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 38 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (OVERLAPS) 1/22 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/22 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (OVERLAPS) 34/56 variables, 22/37 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 25/62 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/56 variables, 38/100 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/56 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 8 (OVERLAPS) 1/57 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/57 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 10 (OVERLAPS) 0/57 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Int declared 57/57 variables, and 101 constraints, problems are : Problem set: 0 solved, 38 unsolved in 516 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 22/22 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 13/13 constraints]
After SMT, in 1343ms problems are : Problem set: 0 solved, 38 unsolved
Search for dead transitions found 0 dead transitions in 1344ms
Starting structural reductions in SI_LTL mode, iteration 1 : 22/42 places, 39/71 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1420 ms. Remains : 22/42 places, 39/71 transitions.
Stuttering acceptance computed with spot in 128 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : StigmergyElection-PT-03a-LTLFireability-08
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA StigmergyElection-PT-03a-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-03a-LTLFireability-08 finished in 1566 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((!p0&&X(G((!p0||X((G(p0)||G(p1))))))))))'
Support contains 1 out of 42 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 42/42 places, 71/71 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 40 transition count 67
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 40 transition count 67
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 38 transition count 63
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 38 transition count 63
Applied a total of 8 rules in 5 ms. Remains 38 /42 variables (removed 4) and now considering 63/71 (removed 8) transitions.
[2024-06-01 12:30:34] [INFO ] Flow matrix only has 58 transitions (discarded 5 similar events)
// Phase 1: matrix 58 rows 38 cols
[2024-06-01 12:30:34] [INFO ] Computed 2 invariants in 1 ms
[2024-06-01 12:30:34] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-06-01 12:30:34] [INFO ] Flow matrix only has 58 transitions (discarded 5 similar events)
[2024-06-01 12:30:34] [INFO ] Invariant cache hit.
[2024-06-01 12:30:35] [INFO ] State equation strengthened by 28 read => feed constraints.
[2024-06-01 12:30:35] [INFO ] Implicit Places using invariants and state equation in 43 ms returned [37]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 70 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 37/42 places, 63/71 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 32 transition count 58
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 32 transition count 58
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 13 place count 29 transition count 55
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 29 transition count 55
Applied a total of 16 rules in 2 ms. Remains 29 /37 variables (removed 8) and now considering 55/63 (removed 8) transitions.
[2024-06-01 12:30:35] [INFO ] Flow matrix only has 50 transitions (discarded 5 similar events)
// Phase 1: matrix 50 rows 29 cols
[2024-06-01 12:30:35] [INFO ] Computed 1 invariants in 0 ms
[2024-06-01 12:30:35] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-06-01 12:30:35] [INFO ] Flow matrix only has 50 transitions (discarded 5 similar events)
[2024-06-01 12:30:35] [INFO ] Invariant cache hit.
[2024-06-01 12:30:35] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-06-01 12:30:35] [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.
Starting structural reductions in LTL mode, iteration 2 : 29/42 places, 55/71 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 126 ms. Remains : 29/42 places, 55/71 transitions.
Stuttering acceptance computed with spot in 91 ms :[true, p0, p0]
Running random walk in product with property : StigmergyElection-PT-03a-LTLFireability-09
Entered a terminal (fully accepting) state of product in 189 steps with 0 reset in 3 ms.
FORMULA StigmergyElection-PT-03a-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-03a-LTLFireability-09 finished in 236 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)||X(p1))) U p2))'
Support contains 6 out of 42 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 42/42 places, 71/71 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 39 transition count 65
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 39 transition count 65
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 36 transition count 59
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 36 transition count 59
Applied a total of 12 rules in 3 ms. Remains 36 /42 variables (removed 6) and now considering 59/71 (removed 12) transitions.
[2024-06-01 12:30:35] [INFO ] Flow matrix only has 55 transitions (discarded 4 similar events)
// Phase 1: matrix 55 rows 36 cols
[2024-06-01 12:30:35] [INFO ] Computed 2 invariants in 1 ms
[2024-06-01 12:30:35] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-06-01 12:30:35] [INFO ] Flow matrix only has 55 transitions (discarded 4 similar events)
[2024-06-01 12:30:35] [INFO ] Invariant cache hit.
[2024-06-01 12:30:35] [INFO ] State equation strengthened by 28 read => feed constraints.
[2024-06-01 12:30:35] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
Running 58 sub problems to find dead transitions.
[2024-06-01 12:30:35] [INFO ] Flow matrix only has 55 transitions (discarded 4 similar events)
[2024-06-01 12:30:35] [INFO ] Invariant cache hit.
[2024-06-01 12:30:35] [INFO ] State equation strengthened by 28 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (OVERLAPS) 1/36 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-06-01 12:30:35] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
[2024-06-01 12:30:35] [INFO ] Deduced a trap composed of 13 places in 20 ms of which 1 ms to minimize.
[2024-06-01 12:30:35] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 1 ms to minimize.
[2024-06-01 12:30:35] [INFO ] Deduced a trap composed of 10 places in 18 ms of which 1 ms to minimize.
[2024-06-01 12:30:35] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 2 ms to minimize.
[2024-06-01 12:30:35] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 1 ms to minimize.
[2024-06-01 12:30:35] [INFO ] Deduced a trap composed of 10 places in 18 ms of which 0 ms to minimize.
[2024-06-01 12:30:35] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 0 ms to minimize.
[2024-06-01 12:30:35] [INFO ] Deduced a trap composed of 13 places in 15 ms of which 0 ms to minimize.
[2024-06-01 12:30:35] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 1 ms to minimize.
[2024-06-01 12:30:35] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2024-06-01 12:30:35] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 1 ms to minimize.
[2024-06-01 12:30:35] [INFO ] Deduced a trap composed of 13 places in 21 ms of which 1 ms to minimize.
[2024-06-01 12:30:35] [INFO ] Deduced a trap composed of 10 places in 18 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/36 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 4 (OVERLAPS) 54/90 variables, 36/52 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/90 variables, 27/79 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/90 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 7 (OVERLAPS) 1/91 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/91 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 9 (OVERLAPS) 0/91 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Real declared 91/91 variables, and 80 constraints, problems are : Problem set: 0 solved, 58 unsolved in 1331 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 36/36 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 58 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (OVERLAPS) 1/36 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-06-01 12:30:36] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/36 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-06-01 12:30:36] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 0 ms to minimize.
[2024-06-01 12:30:36] [INFO ] Deduced a trap composed of 12 places in 16 ms of which 1 ms to minimize.
[2024-06-01 12:30:36] [INFO ] Deduced a trap composed of 12 places in 19 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-06-01 12:30:36] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/36 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 7 (OVERLAPS) 54/90 variables, 36/57 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/90 variables, 27/84 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/90 variables, 58/142 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/90 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 11 (OVERLAPS) 1/91 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/91 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 13 (OVERLAPS) 0/91 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Int declared 91/91 variables, and 143 constraints, problems are : Problem set: 0 solved, 58 unsolved in 1446 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 36/36 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 19/19 constraints]
After SMT, in 2791ms problems are : Problem set: 0 solved, 58 unsolved
Search for dead transitions found 0 dead transitions in 2792ms
Starting structural reductions in LTL mode, iteration 1 : 36/42 places, 59/71 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2872 ms. Remains : 36/42 places, 59/71 transitions.
Stuttering acceptance computed with spot in 194 ms :[(NOT p2), (OR (NOT p2) (NOT p0) p1), p1, (NOT p0), true]
Running random walk in product with property : StigmergyElection-PT-03a-LTLFireability-10
Stuttering criterion allowed to conclude after 86 steps with 19 reset in 1 ms.
FORMULA StigmergyElection-PT-03a-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-03a-LTLFireability-10 finished in 3086 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(!p0)&&F(G(p1)))))'
Support contains 2 out of 42 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 42/42 places, 71/71 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 40 transition count 59
Reduce places removed 11 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 12 rules applied. Total rules applied 24 place count 29 transition count 58
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 25 place count 28 transition count 58
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 25 place count 28 transition count 53
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 35 place count 23 transition count 53
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 38 place count 20 transition count 47
Iterating global reduction 3 with 3 rules applied. Total rules applied 41 place count 20 transition count 47
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 43 place count 18 transition count 43
Iterating global reduction 3 with 2 rules applied. Total rules applied 45 place count 18 transition count 43
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 48 place count 18 transition count 40
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 4 with 4 rules applied. Total rules applied 52 place count 16 transition count 38
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 54 place count 16 transition count 36
Performed 3 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 60 place count 13 transition count 40
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 70 place count 13 transition count 30
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 6 with 7 rules applied. Total rules applied 77 place count 13 transition count 23
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 6 with 3 rules applied. Total rules applied 80 place count 10 transition count 20
Applied a total of 80 rules in 23 ms. Remains 10 /42 variables (removed 32) and now considering 20/71 (removed 51) transitions.
[2024-06-01 12:30:38] [INFO ] Flow matrix only has 17 transitions (discarded 3 similar events)
// Phase 1: matrix 17 rows 10 cols
[2024-06-01 12:30:38] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 12:30:38] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-06-01 12:30:38] [INFO ] Flow matrix only has 17 transitions (discarded 3 similar events)
[2024-06-01 12:30:38] [INFO ] Invariant cache hit.
[2024-06-01 12:30:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 12:30:38] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2024-06-01 12:30:38] [INFO ] Redundant transitions in 0 ms returned []
Running 11 sub problems to find dead transitions.
[2024-06-01 12:30:38] [INFO ] Flow matrix only has 17 transitions (discarded 3 similar events)
[2024-06-01 12:30:38] [INFO ] Invariant cache hit.
[2024-06-01 12:30:38] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 3/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-06-01 12:30:38] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-06-01 12:30:38] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 1 ms to minimize.
[2024-06-01 12:30:38] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-06-01 12:30:38] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-06-01 12:30:38] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-06-01 12:30:38] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
[2024-06-01 12:30:38] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-06-01 12:30:38] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 16/26 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/26 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 1/27 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/27 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (OVERLAPS) 0/27 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 27/27 variables, and 20 constraints, problems are : Problem set: 0 solved, 11 unsolved in 271 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 3/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-06-01 12:30:38] [INFO ] Deduced a trap composed of 6 places in 13 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 16/26 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/26 variables, 11/31 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/26 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 1/27 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/27 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (OVERLAPS) 0/27 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 27/27 variables, and 32 constraints, problems are : Problem set: 0 solved, 11 unsolved in 135 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 9/9 constraints]
After SMT, in 409ms problems are : Problem set: 0 solved, 11 unsolved
Search for dead transitions found 0 dead transitions in 411ms
Starting structural reductions in SI_LTL mode, iteration 1 : 10/42 places, 20/71 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 484 ms. Remains : 10/42 places, 20/71 transitions.
Stuttering acceptance computed with spot in 103 ms :[(OR (NOT p1) p0), p0, (NOT p1)]
Running random walk in product with property : StigmergyElection-PT-03a-LTLFireability-11
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA StigmergyElection-PT-03a-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-03a-LTLFireability-11 finished in 600 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 p1) U X((!p0 U p2))))'
Support contains 4 out of 42 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 42/42 places, 71/71 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 40 transition count 67
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 40 transition count 67
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 39 transition count 65
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 39 transition count 65
Applied a total of 6 rules in 4 ms. Remains 39 /42 variables (removed 3) and now considering 65/71 (removed 6) transitions.
[2024-06-01 12:30:38] [INFO ] Flow matrix only has 60 transitions (discarded 5 similar events)
// Phase 1: matrix 60 rows 39 cols
[2024-06-01 12:30:38] [INFO ] Computed 2 invariants in 1 ms
[2024-06-01 12:30:38] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-06-01 12:30:38] [INFO ] Flow matrix only has 60 transitions (discarded 5 similar events)
[2024-06-01 12:30:38] [INFO ] Invariant cache hit.
[2024-06-01 12:30:38] [INFO ] State equation strengthened by 28 read => feed constraints.
[2024-06-01 12:30:38] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
Running 64 sub problems to find dead transitions.
[2024-06-01 12:30:38] [INFO ] Flow matrix only has 60 transitions (discarded 5 similar events)
[2024-06-01 12:30:38] [INFO ] Invariant cache hit.
[2024-06-01 12:30:38] [INFO ] State equation strengthened by 28 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (OVERLAPS) 1/39 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 64 unsolved
[2024-06-01 12:30:39] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 1 ms to minimize.
[2024-06-01 12:30:39] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 0 ms to minimize.
[2024-06-01 12:30:39] [INFO ] Deduced a trap composed of 11 places in 20 ms of which 0 ms to minimize.
[2024-06-01 12:30:39] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 0 ms to minimize.
[2024-06-01 12:30:39] [INFO ] Deduced a trap composed of 13 places in 18 ms of which 0 ms to minimize.
[2024-06-01 12:30:39] [INFO ] Deduced a trap composed of 14 places in 19 ms of which 0 ms to minimize.
[2024-06-01 12:30:39] [INFO ] Deduced a trap composed of 13 places in 21 ms of which 0 ms to minimize.
[2024-06-01 12:30:39] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 0 ms to minimize.
[2024-06-01 12:30:39] [INFO ] Deduced a trap composed of 15 places in 19 ms of which 1 ms to minimize.
[2024-06-01 12:30:39] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 0 ms to minimize.
[2024-06-01 12:30:39] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
[2024-06-01 12:30:39] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 1 ms to minimize.
[2024-06-01 12:30:39] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 1 ms to minimize.
[2024-06-01 12:30:39] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 1 ms to minimize.
[2024-06-01 12:30:39] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 15/17 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 59/98 variables, 39/56 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 27/83 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/98 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (OVERLAPS) 1/99 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/99 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 9 (OVERLAPS) 0/99 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Real declared 99/99 variables, and 84 constraints, problems are : Problem set: 0 solved, 64 unsolved in 1514 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 39/39 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 64 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (OVERLAPS) 1/39 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 15/17 constraints. Problems are: Problem set: 0 solved, 64 unsolved
[2024-06-01 12:30:40] [INFO ] Deduced a trap composed of 12 places in 19 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 64 unsolved
[2024-06-01 12:30:40] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (OVERLAPS) 59/98 variables, 39/58 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/98 variables, 27/85 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/98 variables, 64/149 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/98 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 10 (OVERLAPS) 1/99 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/99 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 12 (OVERLAPS) 0/99 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Int declared 99/99 variables, and 150 constraints, problems are : Problem set: 0 solved, 64 unsolved in 1388 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 39/39 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 17/17 constraints]
After SMT, in 2919ms problems are : Problem set: 0 solved, 64 unsolved
Search for dead transitions found 0 dead transitions in 2920ms
Starting structural reductions in LTL mode, iteration 1 : 39/42 places, 65/71 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3002 ms. Remains : 39/42 places, 65/71 transitions.
Stuttering acceptance computed with spot in 171 ms :[(NOT p2), true, (NOT p2), (NOT p2), (NOT p2)]
Running random walk in product with property : StigmergyElection-PT-03a-LTLFireability-12
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA StigmergyElection-PT-03a-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-03a-LTLFireability-12 finished in 3190 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 3 out of 42 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 42/42 places, 71/71 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 39 transition count 65
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 39 transition count 65
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 36 transition count 59
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 36 transition count 59
Applied a total of 12 rules in 3 ms. Remains 36 /42 variables (removed 6) and now considering 59/71 (removed 12) transitions.
[2024-06-01 12:30:42] [INFO ] Flow matrix only has 55 transitions (discarded 4 similar events)
// Phase 1: matrix 55 rows 36 cols
[2024-06-01 12:30:42] [INFO ] Computed 2 invariants in 1 ms
[2024-06-01 12:30:42] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-06-01 12:30:42] [INFO ] Flow matrix only has 55 transitions (discarded 4 similar events)
[2024-06-01 12:30:42] [INFO ] Invariant cache hit.
[2024-06-01 12:30:42] [INFO ] State equation strengthened by 28 read => feed constraints.
[2024-06-01 12:30:42] [INFO ] Implicit Places using invariants and state equation in 46 ms returned [35]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 76 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 35/42 places, 59/71 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 29 transition count 53
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 29 transition count 53
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 26 transition count 50
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 26 transition count 50
Applied a total of 18 rules in 2 ms. Remains 26 /35 variables (removed 9) and now considering 50/59 (removed 9) transitions.
[2024-06-01 12:30:42] [INFO ] Flow matrix only has 46 transitions (discarded 4 similar events)
// Phase 1: matrix 46 rows 26 cols
[2024-06-01 12:30:42] [INFO ] Computed 1 invariants in 0 ms
[2024-06-01 12:30:42] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-06-01 12:30:42] [INFO ] Flow matrix only has 46 transitions (discarded 4 similar events)
[2024-06-01 12:30:42] [INFO ] Invariant cache hit.
[2024-06-01 12:30:42] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-06-01 12:30:42] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 26/42 places, 50/71 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 128 ms. Remains : 26/42 places, 50/71 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyElection-PT-03a-LTLFireability-13
Product exploration explored 100000 steps with 12500 reset in 119 ms.
Product exploration explored 100000 steps with 12500 reset in 108 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 69 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 56 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 28 steps (0 resets) in 4 ms. (5 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 95 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
[2024-06-01 12:30:42] [INFO ] Flow matrix only has 46 transitions (discarded 4 similar events)
[2024-06-01 12:30:42] [INFO ] Invariant cache hit.
[2024-06-01 12:30:42] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-06-01 12:30:42] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-06-01 12:30:42] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-06-01 12:30:42] [INFO ] [Real]Added 16 Read/Feed constraints in 1 ms returned sat
[2024-06-01 12:30:42] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 12:30:42] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-06-01 12:30:42] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-06-01 12:30:42] [INFO ] [Nat]Added 16 Read/Feed constraints in 2 ms returned sat
[2024-06-01 12:30:42] [INFO ] Computed and/alt/rep : 44/204/44 causal constraints (skipped 1 transitions) in 3 ms.
[2024-06-01 12:30:43] [INFO ] Added : 37 causal constraints over 10 iterations in 59 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 3 out of 26 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 26/26 places, 50/50 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 25 transition count 43
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 19 transition count 43
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 13 transition count 37
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 31 place count 13 transition count 30
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 34 place count 13 transition count 27
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 40 place count 10 transition count 24
Applied a total of 40 rules in 3 ms. Remains 10 /26 variables (removed 16) and now considering 24/50 (removed 26) transitions.
[2024-06-01 12:30:43] [INFO ] Flow matrix only has 20 transitions (discarded 4 similar events)
// Phase 1: matrix 20 rows 10 cols
[2024-06-01 12:30:43] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 12:30:43] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-06-01 12:30:43] [INFO ] Flow matrix only has 20 transitions (discarded 4 similar events)
[2024-06-01 12:30:43] [INFO ] Invariant cache hit.
[2024-06-01 12:30:43] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-06-01 12:30:43] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2024-06-01 12:30:43] [INFO ] Redundant transitions in 0 ms returned []
Running 21 sub problems to find dead transitions.
[2024-06-01 12:30:43] [INFO ] Flow matrix only has 20 transitions (discarded 4 similar events)
[2024-06-01 12:30:43] [INFO ] Invariant cache hit.
[2024-06-01 12:30:43] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (OVERLAPS) 3/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-06-01 12:30:43] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-06-01 12:30:43] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 1 ms to minimize.
[2024-06-01 12:30:43] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-06-01 12:30:43] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-06-01 12:30:43] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-06-01 12:30:43] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-06-01 12:30:43] [INFO ] Deduced a trap composed of 4 places in 12 ms of which 0 ms to minimize.
[2024-06-01 12:30:43] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 19/29 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/29 variables, 12/31 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/29 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (OVERLAPS) 1/30 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/30 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 10 (OVERLAPS) 0/30 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Real declared 30/30 variables, and 32 constraints, problems are : Problem set: 0 solved, 21 unsolved in 357 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 21 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (OVERLAPS) 3/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-06-01 12:30:43] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-06-01 12:30:43] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 19/29 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/29 variables, 12/33 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/29 variables, 21/54 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/29 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 9 (OVERLAPS) 1/30 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/30 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 11 (OVERLAPS) 0/30 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Int declared 30/30 variables, and 55 constraints, problems are : Problem set: 0 solved, 21 unsolved in 271 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 10/10 constraints]
After SMT, in 637ms problems are : Problem set: 0 solved, 21 unsolved
Search for dead transitions found 0 dead transitions in 639ms
Starting structural reductions in SI_LTL mode, iteration 1 : 10/26 places, 24/50 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 686 ms. Remains : 10/26 places, 24/50 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 82 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 12 steps (0 resets) in 4 ms. (2 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 110 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
[2024-06-01 12:30:44] [INFO ] Flow matrix only has 20 transitions (discarded 4 similar events)
[2024-06-01 12:30:44] [INFO ] Invariant cache hit.
[2024-06-01 12:30:44] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 12:30:44] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2024-06-01 12:30:44] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-06-01 12:30:44] [INFO ] [Real]Added 13 Read/Feed constraints in 1 ms returned sat
[2024-06-01 12:30:44] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 12:30:44] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 12:30:44] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2024-06-01 12:30:44] [INFO ] [Nat]Added 13 Read/Feed constraints in 1 ms returned sat
[2024-06-01 12:30:44] [INFO ] Computed and/alt/rep : 16/90/16 causal constraints (skipped 1 transitions) in 1 ms.
[2024-06-01 12:30:44] [INFO ] Added : 9 causal constraints over 4 iterations in 10 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 62 ms.
Product exploration explored 100000 steps with 25000 reset in 71 ms.
Support contains 3 out of 10 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10/10 places, 24/24 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 24/24 (removed 0) transitions.
[2024-06-01 12:30:44] [INFO ] Flow matrix only has 20 transitions (discarded 4 similar events)
[2024-06-01 12:30:44] [INFO ] Invariant cache hit.
[2024-06-01 12:30:44] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-06-01 12:30:44] [INFO ] Flow matrix only has 20 transitions (discarded 4 similar events)
[2024-06-01 12:30:44] [INFO ] Invariant cache hit.
[2024-06-01 12:30:44] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-06-01 12:30:44] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2024-06-01 12:30:44] [INFO ] Redundant transitions in 0 ms returned []
Running 21 sub problems to find dead transitions.
[2024-06-01 12:30:44] [INFO ] Flow matrix only has 20 transitions (discarded 4 similar events)
[2024-06-01 12:30:44] [INFO ] Invariant cache hit.
[2024-06-01 12:30:44] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (OVERLAPS) 3/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-06-01 12:30:44] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-06-01 12:30:44] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
[2024-06-01 12:30:44] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-06-01 12:30:44] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-06-01 12:30:44] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-06-01 12:30:44] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-06-01 12:30:44] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-06-01 12:30:44] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 19/29 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/29 variables, 12/31 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/29 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (OVERLAPS) 1/30 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/30 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 10 (OVERLAPS) 0/30 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Real declared 30/30 variables, and 32 constraints, problems are : Problem set: 0 solved, 21 unsolved in 327 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 21 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (OVERLAPS) 3/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-06-01 12:30:44] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-06-01 12:30:44] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 19/29 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/29 variables, 12/33 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/29 variables, 21/54 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/29 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 9 (OVERLAPS) 1/30 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/30 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 11 (OVERLAPS) 0/30 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Int declared 30/30 variables, and 55 constraints, problems are : Problem set: 0 solved, 21 unsolved in 262 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 10/10 constraints]
After SMT, in 597ms problems are : Problem set: 0 solved, 21 unsolved
Search for dead transitions found 0 dead transitions in 598ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 652 ms. Remains : 10/10 places, 24/24 transitions.
Treatment of property StigmergyElection-PT-03a-LTLFireability-13 finished in 3101 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 U (G(p2) U X(p1)))))'
Support contains 5 out of 42 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 42/42 places, 71/71 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 39 transition count 65
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 39 transition count 65
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 36 transition count 59
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 36 transition count 59
Applied a total of 12 rules in 1 ms. Remains 36 /42 variables (removed 6) and now considering 59/71 (removed 12) transitions.
[2024-06-01 12:30:45] [INFO ] Flow matrix only has 55 transitions (discarded 4 similar events)
// Phase 1: matrix 55 rows 36 cols
[2024-06-01 12:30:45] [INFO ] Computed 2 invariants in 1 ms
[2024-06-01 12:30:45] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-06-01 12:30:45] [INFO ] Flow matrix only has 55 transitions (discarded 4 similar events)
[2024-06-01 12:30:45] [INFO ] Invariant cache hit.
[2024-06-01 12:30:45] [INFO ] State equation strengthened by 28 read => feed constraints.
[2024-06-01 12:30:45] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
Running 58 sub problems to find dead transitions.
[2024-06-01 12:30:45] [INFO ] Flow matrix only has 55 transitions (discarded 4 similar events)
[2024-06-01 12:30:45] [INFO ] Invariant cache hit.
[2024-06-01 12:30:45] [INFO ] State equation strengthened by 28 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (OVERLAPS) 1/36 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-06-01 12:30:45] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 1 ms to minimize.
[2024-06-01 12:30:45] [INFO ] Deduced a trap composed of 13 places in 18 ms of which 1 ms to minimize.
[2024-06-01 12:30:45] [INFO ] Deduced a trap composed of 10 places in 18 ms of which 1 ms to minimize.
[2024-06-01 12:30:45] [INFO ] Deduced a trap composed of 10 places in 17 ms of which 0 ms to minimize.
[2024-06-01 12:30:45] [INFO ] Deduced a trap composed of 10 places in 16 ms of which 0 ms to minimize.
[2024-06-01 12:30:45] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
[2024-06-01 12:30:45] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-06-01 12:30:45] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 1 ms to minimize.
[2024-06-01 12:30:45] [INFO ] Deduced a trap composed of 13 places in 15 ms of which 1 ms to minimize.
[2024-06-01 12:30:45] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
[2024-06-01 12:30:45] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
[2024-06-01 12:30:45] [INFO ] Deduced a trap composed of 12 places in 18 ms of which 1 ms to minimize.
[2024-06-01 12:30:45] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 1 ms to minimize.
[2024-06-01 12:30:45] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/36 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 4 (OVERLAPS) 54/90 variables, 36/52 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/90 variables, 27/79 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/90 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 7 (OVERLAPS) 1/91 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/91 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 9 (OVERLAPS) 0/91 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Real declared 91/91 variables, and 80 constraints, problems are : Problem set: 0 solved, 58 unsolved in 1312 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 36/36 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 58 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (OVERLAPS) 1/36 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-06-01 12:30:46] [INFO ] Deduced a trap composed of 10 places in 17 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/36 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-06-01 12:30:46] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 1 ms to minimize.
[2024-06-01 12:30:46] [INFO ] Deduced a trap composed of 12 places in 19 ms of which 1 ms to minimize.
[2024-06-01 12:30:46] [INFO ] Deduced a trap composed of 12 places in 17 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-06-01 12:30:46] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/36 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 7 (OVERLAPS) 54/90 variables, 36/57 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/90 variables, 27/84 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/90 variables, 58/142 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/90 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 11 (OVERLAPS) 1/91 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/91 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 13 (OVERLAPS) 0/91 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Int declared 91/91 variables, and 143 constraints, problems are : Problem set: 0 solved, 58 unsolved in 1446 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 36/36 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 19/19 constraints]
After SMT, in 2775ms problems are : Problem set: 0 solved, 58 unsolved
Search for dead transitions found 0 dead transitions in 2776ms
Starting structural reductions in LTL mode, iteration 1 : 36/42 places, 59/71 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2841 ms. Remains : 36/42 places, 59/71 transitions.
Stuttering acceptance computed with spot in 296 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), (AND (NOT p2) (NOT p1)), true, (NOT p2)]
Running random walk in product with property : StigmergyElection-PT-03a-LTLFireability-14
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA StigmergyElection-PT-03a-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-03a-LTLFireability-14 finished in 3157 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((((G(p0) U p1) U p2)||X(X(G(p3)))))'
Found a Lengthening insensitive property : StigmergyElection-PT-03a-LTLFireability-02
Stuttering acceptance computed with spot in 478 ms :[(AND (NOT p2) (NOT p3)), (NOT p3), (OR (AND (NOT p0) p1 (NOT p3)) (AND (NOT p1) p2 (NOT p3))), (AND (NOT p2) (NOT p3)), (NOT p3), true, (AND (NOT p3) (NOT p0)), (AND (NOT p1) p0 (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p0), (NOT p1), (NOT p2)]
Support contains 6 out of 42 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 42/42 places, 71/71 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 40 transition count 64
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 34 transition count 64
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 13 place count 34 transition count 56
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 29 place count 26 transition count 56
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 33 place count 22 transition count 51
Iterating global reduction 2 with 4 rules applied. Total rules applied 37 place count 22 transition count 51
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 38 place count 21 transition count 49
Iterating global reduction 2 with 1 rules applied. Total rules applied 39 place count 21 transition count 49
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 40 place count 21 transition count 48
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 46 place count 18 transition count 45
Applied a total of 46 rules in 8 ms. Remains 18 /42 variables (removed 24) and now considering 45/71 (removed 26) transitions.
[2024-06-01 12:30:48] [INFO ] Flow matrix only has 39 transitions (discarded 6 similar events)
// Phase 1: matrix 39 rows 18 cols
[2024-06-01 12:30:48] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 12:30:48] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-06-01 12:30:48] [INFO ] Flow matrix only has 39 transitions (discarded 6 similar events)
[2024-06-01 12:30:48] [INFO ] Invariant cache hit.
[2024-06-01 12:30:48] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-06-01 12:30:48] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
Running 42 sub problems to find dead transitions.
[2024-06-01 12:30:48] [INFO ] Flow matrix only has 39 transitions (discarded 6 similar events)
[2024-06-01 12:30:48] [INFO ] Invariant cache hit.
[2024-06-01 12:30:48] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (OVERLAPS) 3/18 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 42 unsolved
[2024-06-01 12:30:49] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 1 ms to minimize.
[2024-06-01 12:30:49] [INFO ] Deduced a trap composed of 5 places in 12 ms of which 0 ms to minimize.
[2024-06-01 12:30:49] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 0 ms to minimize.
[2024-06-01 12:30:49] [INFO ] Deduced a trap composed of 8 places in 15 ms of which 1 ms to minimize.
[2024-06-01 12:30:49] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 1 ms to minimize.
[2024-06-01 12:30:49] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 1 ms to minimize.
[2024-06-01 12:30:49] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 0 ms to minimize.
[2024-06-01 12:30:49] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/18 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 4 (OVERLAPS) 38/56 variables, 18/27 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 17/44 constraints. Problems are: Problem set: 0 solved, 42 unsolved
[2024-06-01 12:30:49] [INFO ] Deduced a trap composed of 7 places in 19 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/56 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/56 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 8 (OVERLAPS) 1/57 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/57 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 10 (OVERLAPS) 0/57 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Real declared 57/57 variables, and 46 constraints, problems are : Problem set: 0 solved, 42 unsolved in 677 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 18/18 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 42 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (OVERLAPS) 3/18 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/18 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 4 (OVERLAPS) 38/56 variables, 18/28 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 17/45 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/56 variables, 42/87 constraints. Problems are: Problem set: 0 solved, 42 unsolved
[2024-06-01 12:30:49] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/56 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/56 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 9 (OVERLAPS) 1/57 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/57 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 11 (OVERLAPS) 0/57 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Int declared 57/57 variables, and 89 constraints, problems are : Problem set: 0 solved, 42 unsolved in 586 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 18/18 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 10/10 constraints]
After SMT, in 1274ms problems are : Problem set: 0 solved, 42 unsolved
Search for dead transitions found 0 dead transitions in 1275ms
Starting structural reductions in LI_LTL mode, iteration 1 : 18/42 places, 45/71 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 1331 ms. Remains : 18/42 places, 45/71 transitions.
Running random walk in product with property : StigmergyElection-PT-03a-LTLFireability-02
Product exploration explored 100000 steps with 25000 reset in 151 ms.
Product exploration explored 100000 steps with 25000 reset in 147 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0) p3), (X (NOT p2)), (X (OR (AND (NOT p2) p1) (AND (NOT p2) p0))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (OR (AND p2 (NOT p0)) (AND p1 (NOT p0)))), (X (NOT (OR (AND p2 p0) (AND p1 p0)))), (X (NOT (AND p2 (NOT p1) p0))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT p0)), (X p1), (X (X (NOT p2))), (X (X p3)), (X (X (AND (NOT p0) p3))), (X (X (NOT (AND (NOT p1) p0 p3)))), (X (X (NOT (OR (AND (NOT p2) p1 (NOT p3)) (AND (NOT p2) p0 (NOT p3)))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0) (NOT p3))))), (X (X (OR (AND (NOT p2) p1 p3) (AND (NOT p2) p0 p3)))), (X (X (NOT (AND (NOT p2) (NOT p1) p0 (NOT p3))))), (X (X (NOT (AND p0 p3)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0) p3)))), (X (X (NOT (AND (NOT p1) p0 (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) (NOT p1) p0 p3)))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 26 factoid took 160 ms. Reduced automaton from 12 states, 37 edges and 4 AP (stutter sensitive) to 10 states, 28 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 400 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p3), true, (AND (NOT p3) (NOT p0)), (AND (NOT p3) p0 (NOT p1)), (AND (NOT p2) (NOT p3)), (NOT p0), (NOT p1), (NOT p2)]
RANDOM walk for 40000 steps (1610 resets) in 289 ms. (137 steps per ms) remains 8/21 properties
BEST_FIRST walk for 40002 steps (231 resets) in 46 ms. (851 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (225 resets) in 71 ms. (555 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (217 resets) in 75 ms. (526 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (198 resets) in 43 ms. (909 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (212 resets) in 46 ms. (851 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (226 resets) in 37 ms. (1052 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (226 resets) in 32 ms. (1212 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (212 resets) in 32 ms. (1212 steps per ms) remains 8/8 properties
[2024-06-01 12:30:51] [INFO ] Flow matrix only has 39 transitions (discarded 6 similar events)
[2024-06-01 12:30:51] [INFO ] Invariant cache hit.
[2024-06-01 12:30:51] [INFO ] State equation strengthened by 18 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 12/18 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 12:30:51] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 1 ms to minimize.
Problem apf7 is UNSAT
Problem apf13 is UNSAT
[2024-06-01 12:30:51] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 0 ms to minimize.
[2024-06-01 12:30:51] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 1 ms to minimize.
Problem apf16 is UNSAT
Problem apf17 is UNSAT
Problem apf20 is UNSAT
Problem apf3 is UNSAT
Problem apf11 is UNSAT
Problem apf14 is UNSAT
After SMT solving in domain Real declared 18/57 variables, and 4 constraints, problems are : Problem set: 8 solved, 0 unsolved in 97 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/18 constraints, ReadFeed: 0/18 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 3/3 constraints]
After SMT, in 105ms problems are : Problem set: 8 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 8 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0) p3), (X (NOT p2)), (X (OR (AND (NOT p2) p1) (AND (NOT p2) p0))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (OR (AND p2 (NOT p0)) (AND p1 (NOT p0)))), (X (NOT (OR (AND p2 p0) (AND p1 p0)))), (X (NOT (AND p2 (NOT p1) p0))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT p0)), (X p1), (X (X (NOT p2))), (X (X p3)), (X (X (AND (NOT p0) p3))), (X (X (NOT (AND (NOT p1) p0 p3)))), (X (X (NOT (OR (AND (NOT p2) p1 (NOT p3)) (AND (NOT p2) p0 (NOT p3)))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0) (NOT p3))))), (X (X (OR (AND (NOT p2) p1 p3) (AND (NOT p2) p0 p3)))), (X (X (NOT (AND (NOT p2) (NOT p1) p0 (NOT p3))))), (X (X (NOT (AND p0 p3)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0) p3)))), (X (X (NOT (AND (NOT p1) p0 (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) (NOT p1) p0 p3)))), (X (X p1)), (G (OR p1 p2 (NOT p0) p3)), (G (OR p1 (NOT p0) (NOT p3))), (G (OR p1 p2 (NOT p0))), (G (OR p1 (NOT p0) p3)), (G (OR p1 p2 (NOT p0) (NOT p3))), (G (OR (NOT p0) p3)), (G (OR p1 p2 p0 p3)), (G (OR p1 (NOT p0)))]
False Knowledge obtained : [(F (NOT (OR (AND p1 (NOT p2) p3) (AND (NOT p2) p0 p3)))), (F (NOT (AND (OR (NOT p1) p2 p3) (OR p2 (NOT p0) p3)))), (F (NOT (OR p0 p3))), (F (NOT (OR p1 p0))), (F (NOT (OR p1 p2 p0))), (F (NOT (OR (AND p1 (NOT p2)) (AND (NOT p2) p0)))), (F (NOT (OR p1 p2 p0 (NOT p3)))), (F (NOT p1)), (F p2), (F p0), (F (NOT (AND (NOT p0) p3))), (F (NOT p3)), (F (NOT (OR (NOT p0) (NOT p3))))]
Knowledge based reduction with 34 factoid took 656 ms. Reduced automaton from 10 states, 28 edges and 4 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 199 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p3), true, (AND (NOT p2) (NOT p3)), (NOT p2)]
Stuttering acceptance computed with spot in 210 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p3), true, (AND (NOT p2) (NOT p3)), (NOT p2)]
Support contains 5 out of 18 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 45/45 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 45/45 (removed 0) transitions.
[2024-06-01 12:30:52] [INFO ] Flow matrix only has 39 transitions (discarded 6 similar events)
[2024-06-01 12:30:52] [INFO ] Invariant cache hit.
[2024-06-01 12:30:52] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-06-01 12:30:52] [INFO ] Flow matrix only has 39 transitions (discarded 6 similar events)
[2024-06-01 12:30:52] [INFO ] Invariant cache hit.
[2024-06-01 12:30:52] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-06-01 12:30:52] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
Running 42 sub problems to find dead transitions.
[2024-06-01 12:30:52] [INFO ] Flow matrix only has 39 transitions (discarded 6 similar events)
[2024-06-01 12:30:52] [INFO ] Invariant cache hit.
[2024-06-01 12:30:52] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (OVERLAPS) 3/18 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 42 unsolved
[2024-06-01 12:30:52] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 0 ms to minimize.
[2024-06-01 12:30:52] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 1 ms to minimize.
[2024-06-01 12:30:52] [INFO ] Deduced a trap composed of 8 places in 17 ms of which 1 ms to minimize.
[2024-06-01 12:30:52] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 1 ms to minimize.
[2024-06-01 12:30:52] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 0 ms to minimize.
[2024-06-01 12:30:52] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 0 ms to minimize.
[2024-06-01 12:30:52] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 1 ms to minimize.
[2024-06-01 12:30:52] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/18 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 4 (OVERLAPS) 38/56 variables, 18/27 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 17/44 constraints. Problems are: Problem set: 0 solved, 42 unsolved
[2024-06-01 12:30:53] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/56 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/56 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 8 (OVERLAPS) 1/57 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/57 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 10 (OVERLAPS) 0/57 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Real declared 57/57 variables, and 46 constraints, problems are : Problem set: 0 solved, 42 unsolved in 666 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 18/18 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 42 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (OVERLAPS) 3/18 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/18 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 4 (OVERLAPS) 38/56 variables, 18/28 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 17/45 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/56 variables, 42/87 constraints. Problems are: Problem set: 0 solved, 42 unsolved
[2024-06-01 12:30:53] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/56 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/56 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 9 (OVERLAPS) 1/57 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/57 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 11 (OVERLAPS) 0/57 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Int declared 57/57 variables, and 89 constraints, problems are : Problem set: 0 solved, 42 unsolved in 596 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 18/18 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 10/10 constraints]
After SMT, in 1279ms problems are : Problem set: 0 solved, 42 unsolved
Search for dead transitions found 0 dead transitions in 1279ms
Finished structural reductions in LTL mode , in 1 iterations and 1328 ms. Remains : 18/18 places, 45/45 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p3 p1 (NOT p2)), (X (X (NOT p2))), (X (X p3)), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p1 (NOT p2) p3))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 113 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 224 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p3), true, (AND (NOT p2) (NOT p3)), (NOT p2)]
RANDOM walk for 111 steps (6 resets) in 6 ms. (15 steps per ms) remains 0/7 properties
Knowledge obtained : [(AND p3 p1 (NOT p2)), (X (X (NOT p2))), (X (X p3)), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p1 (NOT p2) p3))), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p1 p2))), (F (NOT (OR p2 p3))), (F (NOT p1)), (F (NOT (AND p1 (NOT p2) p3))), (F p2), (F (NOT (AND p1 (NOT p2)))), (F (NOT p3))]
Knowledge based reduction with 7 factoid took 294 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 205 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p3), true, (AND (NOT p2) (NOT p3)), (NOT p2)]
Stuttering acceptance computed with spot in 228 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p3), true, (AND (NOT p2) (NOT p3)), (NOT p2)]
Stuttering acceptance computed with spot in 232 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p3), true, (AND (NOT p2) (NOT p3)), (NOT p2)]
Product exploration explored 100000 steps with 25000 reset in 88 ms.
Product exploration explored 100000 steps with 25000 reset in 90 ms.
Applying partial POR strategy [false, false, true, true, false, true]
Stuttering acceptance computed with spot in 216 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p3), true, (AND (NOT p2) (NOT p3)), (NOT p2)]
Support contains 5 out of 18 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 18/18 places, 45/45 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 17 transition count 43
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 17 transition count 43
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 16 transition count 41
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 16 transition count 41
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 6 place count 16 transition count 39
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 9 place count 16 transition count 36
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 12 place count 16 transition count 36
Deduced a syphon composed of 3 places in 0 ms
Applied a total of 12 rules in 6 ms. Remains 16 /18 variables (removed 2) and now considering 36/45 (removed 9) transitions.
[2024-06-01 12:30:55] [INFO ] Redundant transitions in 1 ms returned []
Running 33 sub problems to find dead transitions.
[2024-06-01 12:30:55] [INFO ] Flow matrix only has 31 transitions (discarded 5 similar events)
// Phase 1: matrix 31 rows 16 cols
[2024-06-01 12:30:55] [INFO ] Computed 1 invariants in 0 ms
[2024-06-01 12:30:55] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (OVERLAPS) 3/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 33 unsolved
[2024-06-01 12:30:55] [INFO ] Deduced a trap composed of 7 places in 15 ms of which 0 ms to minimize.
[2024-06-01 12:30:55] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-06-01 12:30:55] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-06-01 12:30:55] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 33 unsolved
[2024-06-01 12:30:55] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-06-01 12:30:55] [INFO ] Deduced a trap composed of 7 places in 16 ms of which 1 ms to minimize.
[2024-06-01 12:30:55] [INFO ] Deduced a trap composed of 7 places in 14 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 33 unsolved
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
At refinement iteration 5 (OVERLAPS) 30/46 variables, 16/24 constraints. Problems are: Problem set: 3 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/46 variables, 15/39 constraints. Problems are: Problem set: 3 solved, 30 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/46 variables, 0/39 constraints. Problems are: Problem set: 3 solved, 30 unsolved
At refinement iteration 8 (OVERLAPS) 1/47 variables, 1/40 constraints. Problems are: Problem set: 3 solved, 30 unsolved
[2024-06-01 12:30:56] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/47 variables, 1/41 constraints. Problems are: Problem set: 3 solved, 30 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/47 variables, 0/41 constraints. Problems are: Problem set: 3 solved, 30 unsolved
At refinement iteration 11 (OVERLAPS) 0/47 variables, 0/41 constraints. Problems are: Problem set: 3 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Real declared 47/47 variables, and 41 constraints, problems are : Problem set: 3 solved, 30 unsolved in 522 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 16/16 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 3 solved, 30 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 6/16 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 8/9 constraints. Problems are: Problem set: 3 solved, 30 unsolved
[2024-06-01 12:30:56] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 1/10 constraints. Problems are: Problem set: 3 solved, 30 unsolved
[2024-06-01 12:30:56] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 1/11 constraints. Problems are: Problem set: 3 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/16 variables, 0/11 constraints. Problems are: Problem set: 3 solved, 30 unsolved
At refinement iteration 6 (OVERLAPS) 30/46 variables, 16/27 constraints. Problems are: Problem set: 3 solved, 30 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/46 variables, 15/42 constraints. Problems are: Problem set: 3 solved, 30 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/46 variables, 30/72 constraints. Problems are: Problem set: 3 solved, 30 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/46 variables, 0/72 constraints. Problems are: Problem set: 3 solved, 30 unsolved
At refinement iteration 10 (OVERLAPS) 1/47 variables, 1/73 constraints. Problems are: Problem set: 3 solved, 30 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/47 variables, 0/73 constraints. Problems are: Problem set: 3 solved, 30 unsolved
At refinement iteration 12 (OVERLAPS) 0/47 variables, 0/73 constraints. Problems are: Problem set: 3 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Int declared 47/47 variables, and 73 constraints, problems are : Problem set: 3 solved, 30 unsolved in 416 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 16/16 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 30/33 constraints, Known Traps: 10/10 constraints]
After SMT, in 954ms problems are : Problem set: 3 solved, 30 unsolved
Search for dead transitions found 3 dead transitions in 954ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 16/18 places, 33/45 transitions.
Graph (complete) has 48 edges and 16 vertex of which 13 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 3 ms. Remains 13 /16 variables (removed 3) and now considering 33/33 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 13/18 places, 33/45 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 980 ms. Remains : 13/18 places, 33/45 transitions.
Support contains 5 out of 18 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 45/45 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 17 transition count 43
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 17 transition count 43
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 16 transition count 41
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 16 transition count 41
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 6 place count 16 transition count 39
Applied a total of 6 rules in 1 ms. Remains 16 /18 variables (removed 2) and now considering 39/45 (removed 6) transitions.
[2024-06-01 12:30:56] [INFO ] Flow matrix only has 34 transitions (discarded 5 similar events)
// Phase 1: matrix 34 rows 16 cols
[2024-06-01 12:30:56] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 12:30:56] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-06-01 12:30:56] [INFO ] Flow matrix only has 34 transitions (discarded 5 similar events)
[2024-06-01 12:30:56] [INFO ] Invariant cache hit.
[2024-06-01 12:30:56] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-06-01 12:30:56] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
Running 36 sub problems to find dead transitions.
[2024-06-01 12:30:56] [INFO ] Flow matrix only has 34 transitions (discarded 5 similar events)
[2024-06-01 12:30:56] [INFO ] Invariant cache hit.
[2024-06-01 12:30:56] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (OVERLAPS) 3/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 36 unsolved
[2024-06-01 12:30:56] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 ms to minimize.
[2024-06-01 12:30:56] [INFO ] Deduced a trap composed of 5 places in 14 ms of which 0 ms to minimize.
[2024-06-01 12:30:56] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 0 ms to minimize.
[2024-06-01 12:30:56] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 0 ms to minimize.
[2024-06-01 12:30:56] [INFO ] Deduced a trap composed of 5 places in 14 ms of which 1 ms to minimize.
[2024-06-01 12:30:56] [INFO ] Deduced a trap composed of 8 places in 17 ms of which 0 ms to minimize.
[2024-06-01 12:30:56] [INFO ] Deduced a trap composed of 8 places in 13 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 4 (OVERLAPS) 33/49 variables, 16/24 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/49 variables, 15/39 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/49 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 7 (OVERLAPS) 1/50 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/50 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 9 (OVERLAPS) 0/50 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 36 unsolved
No progress, stopping.
After SMT solving in domain Real declared 50/50 variables, and 40 constraints, problems are : Problem set: 0 solved, 36 unsolved in 472 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 16/16 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 36 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (OVERLAPS) 3/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 4 (OVERLAPS) 33/49 variables, 16/24 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/49 variables, 15/39 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/49 variables, 36/75 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/49 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 8 (OVERLAPS) 1/50 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/50 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 10 (OVERLAPS) 0/50 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 36 unsolved
No progress, stopping.
After SMT solving in domain Int declared 50/50 variables, and 76 constraints, problems are : Problem set: 0 solved, 36 unsolved in 366 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 16/16 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 7/7 constraints]
After SMT, in 847ms problems are : Problem set: 0 solved, 36 unsolved
Search for dead transitions found 0 dead transitions in 848ms
Starting structural reductions in LTL mode, iteration 1 : 16/18 places, 39/45 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 893 ms. Remains : 16/18 places, 39/45 transitions.
Treatment of property StigmergyElection-PT-03a-LTLFireability-02 finished in 9302 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))||G(p1)))'
Found a Shortening insensitive property : StigmergyElection-PT-03a-LTLFireability-05
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 42 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 42/42 places, 71/71 transitions.
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 5 Pre rules applied. Total rules applied 0 place count 42 transition count 66
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 37 transition count 66
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 35 transition count 62
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 35 transition count 62
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 33 transition count 58
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 33 transition count 58
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 31 transition count 56
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 31 transition count 56
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 25 place count 31 transition count 53
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 5 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 1 with 18 rules applied. Total rules applied 43 place count 22 transition count 44
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 45 place count 20 transition count 42
Iterating global reduction 1 with 2 rules applied. Total rules applied 47 place count 20 transition count 42
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 48 place count 20 transition count 42
Applied a total of 48 rules in 16 ms. Remains 20 /42 variables (removed 22) and now considering 42/71 (removed 29) transitions.
[2024-06-01 12:30:57] [INFO ] Flow matrix only has 37 transitions (discarded 5 similar events)
// Phase 1: matrix 37 rows 20 cols
[2024-06-01 12:30:57] [INFO ] Computed 2 invariants in 0 ms
[2024-06-01 12:30:57] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-06-01 12:30:57] [INFO ] Flow matrix only has 37 transitions (discarded 5 similar events)
[2024-06-01 12:30:57] [INFO ] Invariant cache hit.
[2024-06-01 12:30:57] [INFO ] State equation strengthened by 28 read => feed constraints.
[2024-06-01 12:30:57] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
Running 41 sub problems to find dead transitions.
[2024-06-01 12:30:57] [INFO ] Flow matrix only has 37 transitions (discarded 5 similar events)
[2024-06-01 12:30:57] [INFO ] Invariant cache hit.
[2024-06-01 12:30:57] [INFO ] State equation strengthened by 28 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 1 (OVERLAPS) 1/20 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 41 unsolved
[2024-06-01 12:30:57] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
[2024-06-01 12:30:58] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 1 ms to minimize.
[2024-06-01 12:30:58] [INFO ] Deduced a trap composed of 6 places in 15 ms of which 1 ms to minimize.
[2024-06-01 12:30:58] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 0 ms to minimize.
[2024-06-01 12:30:58] [INFO ] Deduced a trap composed of 6 places in 17 ms of which 0 ms to minimize.
[2024-06-01 12:30:58] [INFO ] Deduced a trap composed of 6 places in 15 ms of which 0 ms to minimize.
[2024-06-01 12:30:58] [INFO ] Deduced a trap composed of 9 places in 18 ms of which 0 ms to minimize.
[2024-06-01 12:30:58] [INFO ] Deduced a trap composed of 9 places in 16 ms of which 0 ms to minimize.
[2024-06-01 12:30:58] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 1 ms to minimize.
[2024-06-01 12:30:58] [INFO ] Deduced a trap composed of 7 places in 18 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 4 (OVERLAPS) 36/56 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 27/59 constraints. Problems are: Problem set: 0 solved, 41 unsolved
[2024-06-01 12:30:58] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/56 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/56 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 8 (OVERLAPS) 1/57 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/57 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 10 (OVERLAPS) 0/57 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 41 unsolved
No progress, stopping.
After SMT solving in domain Real declared 57/57 variables, and 61 constraints, problems are : Problem set: 0 solved, 41 unsolved in 744 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 20/20 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 41/41 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 41 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 1 (OVERLAPS) 1/20 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 41 unsolved
[2024-06-01 12:30:58] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 5 (OVERLAPS) 36/56 variables, 20/34 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/56 variables, 27/61 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/56 variables, 41/102 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/56 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 9 (OVERLAPS) 1/57 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/57 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 11 (OVERLAPS) 0/57 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 41 unsolved
No progress, stopping.
After SMT solving in domain Int declared 57/57 variables, and 103 constraints, problems are : Problem set: 0 solved, 41 unsolved in 546 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 20/20 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 41/41 constraints, Known Traps: 12/12 constraints]
After SMT, in 1301ms problems are : Problem set: 0 solved, 41 unsolved
Search for dead transitions found 0 dead transitions in 1301ms
Starting structural reductions in LI_LTL mode, iteration 1 : 20/42 places, 42/71 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 1370 ms. Remains : 20/42 places, 42/71 transitions.
Running random walk in product with property : StigmergyElection-PT-03a-LTLFireability-05
Product exploration explored 100000 steps with 24966 reset in 65 ms.
Product exploration explored 100000 steps with 25016 reset in 68 ms.
Computed a total of 4 stabilizing places and 3 stable transitions
Computed a total of 4 stabilizing places and 3 stable transitions
Detected a total of 4/20 stabilizing places and 3/42 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 249 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 12 steps (0 resets) in 4 ms. (2 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F p0)]
Knowledge based reduction with 8 factoid took 248 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
[2024-06-01 12:31:00] [INFO ] Flow matrix only has 37 transitions (discarded 5 similar events)
[2024-06-01 12:31:00] [INFO ] Invariant cache hit.
[2024-06-01 12:31:00] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 12:31:00] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-06-01 12:31:00] [INFO ] State equation strengthened by 28 read => feed constraints.
[2024-06-01 12:31:00] [INFO ] [Real]Added 28 Read/Feed constraints in 2 ms returned sat
[2024-06-01 12:31:00] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 12:31:00] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 12:31:00] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-06-01 12:31:00] [INFO ] [Nat]Added 28 Read/Feed constraints in 2 ms returned sat
[2024-06-01 12:31:00] [INFO ] Computed and/alt/rep : 18/64/18 causal constraints (skipped 18 transitions) in 2 ms.
[2024-06-01 12:31:00] [INFO ] Added : 3 causal constraints over 1 iterations in 7 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 20 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 20/20 places, 42/42 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 20 transition count 39
Applied a total of 3 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 39/42 (removed 3) transitions.
[2024-06-01 12:31:00] [INFO ] Flow matrix only has 34 transitions (discarded 5 similar events)
// Phase 1: matrix 34 rows 20 cols
[2024-06-01 12:31:00] [INFO ] Computed 2 invariants in 1 ms
[2024-06-01 12:31:00] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-06-01 12:31:00] [INFO ] Flow matrix only has 34 transitions (discarded 5 similar events)
[2024-06-01 12:31:00] [INFO ] Invariant cache hit.
[2024-06-01 12:31:00] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-06-01 12:31:00] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2024-06-01 12:31:00] [INFO ] Redundant transitions in 0 ms returned []
Running 38 sub problems to find dead transitions.
[2024-06-01 12:31:00] [INFO ] Flow matrix only has 34 transitions (discarded 5 similar events)
[2024-06-01 12:31:00] [INFO ] Invariant cache hit.
[2024-06-01 12:31:00] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (OVERLAPS) 1/20 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-06-01 12:31:00] [INFO ] Deduced a trap composed of 6 places in 16 ms of which 0 ms to minimize.
[2024-06-01 12:31:00] [INFO ] Deduced a trap composed of 6 places in 17 ms of which 0 ms to minimize.
[2024-06-01 12:31:00] [INFO ] Deduced a trap composed of 9 places in 17 ms of which 0 ms to minimize.
[2024-06-01 12:31:00] [INFO ] Deduced a trap composed of 6 places in 14 ms of which 0 ms to minimize.
[2024-06-01 12:31:00] [INFO ] Deduced a trap composed of 8 places in 17 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-06-01 12:31:00] [INFO ] Deduced a trap composed of 7 places in 17 ms of which 0 ms to minimize.
[2024-06-01 12:31:00] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 0 ms to minimize.
[2024-06-01 12:31:00] [INFO ] Deduced a trap composed of 10 places in 14 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (OVERLAPS) 33/53 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/53 variables, 24/54 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/53 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 8 (OVERLAPS) 1/54 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/54 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 10 (OVERLAPS) 0/54 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Real declared 54/54 variables, and 55 constraints, problems are : Problem set: 0 solved, 38 unsolved in 605 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 20/20 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 38 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (OVERLAPS) 1/20 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (OVERLAPS) 33/53 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 24/54 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/53 variables, 38/92 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/53 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 8 (OVERLAPS) 1/54 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/54 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 10 (OVERLAPS) 0/54 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Int declared 54/54 variables, and 93 constraints, problems are : Problem set: 0 solved, 38 unsolved in 460 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 20/20 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 8/8 constraints]
After SMT, in 1078ms problems are : Problem set: 0 solved, 38 unsolved
Search for dead transitions found 0 dead transitions in 1078ms
Starting structural reductions in SI_LTL mode, iteration 1 : 20/20 places, 39/42 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1137 ms. Remains : 20/20 places, 39/42 transitions.
Computed a total of 4 stabilizing places and 3 stable transitions
Computed a total of 4 stabilizing places and 3 stable transitions
Detected a total of 4/20 stabilizing places and 3/39 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 143 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 13 steps (0 resets) in 4 ms. (2 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 3 factoid took 146 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
[2024-06-01 12:31:01] [INFO ] Flow matrix only has 34 transitions (discarded 5 similar events)
[2024-06-01 12:31:01] [INFO ] Invariant cache hit.
[2024-06-01 12:31:01] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-06-01 12:31:01] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-06-01 12:31:01] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-06-01 12:31:01] [INFO ] [Real]Added 25 Read/Feed constraints in 2 ms returned sat
[2024-06-01 12:31:01] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 12:31:01] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 12:31:01] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2024-06-01 12:31:01] [INFO ] [Nat]Added 25 Read/Feed constraints in 1 ms returned sat
[2024-06-01 12:31:01] [INFO ] Computed and/alt/rep : 32/198/32 causal constraints (skipped 1 transitions) in 2 ms.
[2024-06-01 12:31:01] [INFO ] Added : 25 causal constraints over 5 iterations in 24 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25003 reset in 64 ms.
Product exploration explored 100000 steps with 25024 reset in 66 ms.
Support contains 2 out of 20 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 20/20 places, 39/39 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 19 transition count 37
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 19 transition count 37
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 18 transition count 36
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 18 transition count 35
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 6 place count 17 transition count 34
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 17 transition count 34
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 11 place count 17 transition count 30
Applied a total of 11 rules in 6 ms. Remains 17 /20 variables (removed 3) and now considering 30/39 (removed 9) transitions.
[2024-06-01 12:31:02] [INFO ] Flow matrix only has 26 transitions (discarded 4 similar events)
// Phase 1: matrix 26 rows 17 cols
[2024-06-01 12:31:02] [INFO ] Computed 2 invariants in 1 ms
[2024-06-01 12:31:02] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-06-01 12:31:02] [INFO ] Flow matrix only has 26 transitions (discarded 4 similar events)
[2024-06-01 12:31:02] [INFO ] Invariant cache hit.
[2024-06-01 12:31:02] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-01 12:31:02] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2024-06-01 12:31:02] [INFO ] Redundant transitions in 0 ms returned []
Running 29 sub problems to find dead transitions.
[2024-06-01 12:31:02] [INFO ] Flow matrix only has 26 transitions (discarded 4 similar events)
[2024-06-01 12:31:02] [INFO ] Invariant cache hit.
[2024-06-01 12:31:02] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (OVERLAPS) 1/17 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 29 unsolved
[2024-06-01 12:31:02] [INFO ] Deduced a trap composed of 6 places in 16 ms of which 0 ms to minimize.
[2024-06-01 12:31:02] [INFO ] Deduced a trap composed of 6 places in 16 ms of which 1 ms to minimize.
[2024-06-01 12:31:02] [INFO ] Deduced a trap composed of 6 places in 14 ms of which 0 ms to minimize.
[2024-06-01 12:31:02] [INFO ] Deduced a trap composed of 6 places in 15 ms of which 1 ms to minimize.
[2024-06-01 12:31:02] [INFO ] Deduced a trap composed of 6 places in 13 ms of which 0 ms to minimize.
[2024-06-01 12:31:02] [INFO ] Deduced a trap composed of 6 places in 13 ms of which 0 ms to minimize.
[2024-06-01 12:31:02] [INFO ] Deduced a trap composed of 8 places in 15 ms of which 0 ms to minimize.
[2024-06-01 12:31:02] [INFO ] Deduced a trap composed of 6 places in 15 ms of which 0 ms to minimize.
[2024-06-01 12:31:02] [INFO ] Deduced a trap composed of 7 places in 14 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/17 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (OVERLAPS) 25/42 variables, 17/28 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/42 variables, 19/47 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/42 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 7 (OVERLAPS) 1/43 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/43 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 9 (OVERLAPS) 0/43 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Real declared 43/43 variables, and 48 constraints, problems are : Problem set: 0 solved, 29 unsolved in 456 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 17/17 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 29 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (OVERLAPS) 1/17 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 29 unsolved
[2024-06-01 12:31:02] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/17 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (OVERLAPS) 25/42 variables, 17/29 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/42 variables, 19/48 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/42 variables, 29/77 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/42 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 9 (OVERLAPS) 1/43 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/43 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 11 (OVERLAPS) 0/43 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Int declared 43/43 variables, and 78 constraints, problems are : Problem set: 0 solved, 29 unsolved in 369 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 17/17 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 10/10 constraints]
After SMT, in 833ms problems are : Problem set: 0 solved, 29 unsolved
Search for dead transitions found 0 dead transitions in 833ms
Starting structural reductions in SI_LTL mode, iteration 1 : 17/20 places, 30/39 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 893 ms. Remains : 17/20 places, 30/39 transitions.
Treatment of property StigmergyElection-PT-03a-LTLFireability-05 finished in 5408 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)))'
Found a Shortening insensitive property : StigmergyElection-PT-03a-LTLFireability-13
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Support contains 3 out of 42 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 42/42 places, 71/71 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 40 transition count 64
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 34 transition count 64
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 13 place count 34 transition count 55
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 31 place count 25 transition count 55
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 37 place count 19 transition count 46
Iterating global reduction 2 with 6 rules applied. Total rules applied 43 place count 19 transition count 46
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 46 place count 16 transition count 40
Iterating global reduction 2 with 3 rules applied. Total rules applied 49 place count 16 transition count 40
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 56 place count 16 transition count 33
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 62 place count 13 transition count 30
Applied a total of 62 rules in 6 ms. Remains 13 /42 variables (removed 29) and now considering 30/71 (removed 41) transitions.
[2024-06-01 12:31:03] [INFO ] Flow matrix only has 26 transitions (discarded 4 similar events)
// Phase 1: matrix 26 rows 13 cols
[2024-06-01 12:31:03] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 12:31:03] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-06-01 12:31:03] [INFO ] Flow matrix only has 26 transitions (discarded 4 similar events)
[2024-06-01 12:31:03] [INFO ] Invariant cache hit.
[2024-06-01 12:31:03] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-06-01 12:31:03] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
Running 27 sub problems to find dead transitions.
[2024-06-01 12:31:03] [INFO ] Flow matrix only has 26 transitions (discarded 4 similar events)
[2024-06-01 12:31:03] [INFO ] Invariant cache hit.
[2024-06-01 12:31:03] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (OVERLAPS) 3/13 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 27 unsolved
[2024-06-01 12:31:03] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 0 ms to minimize.
[2024-06-01 12:31:03] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 0 ms to minimize.
[2024-06-01 12:31:03] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 1 ms to minimize.
[2024-06-01 12:31:03] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 1 ms to minimize.
[2024-06-01 12:31:03] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 1 ms to minimize.
[2024-06-01 12:31:03] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 27 unsolved
[2024-06-01 12:31:03] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 5 (OVERLAPS) 25/38 variables, 13/21 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 12/33 constraints. Problems are: Problem set: 0 solved, 27 unsolved
[2024-06-01 12:31:03] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/38 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/38 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 9 (OVERLAPS) 1/39 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/39 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 11 (OVERLAPS) 0/39 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Real declared 39/39 variables, and 35 constraints, problems are : Problem set: 0 solved, 27 unsolved in 460 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 13/13 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 27 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (OVERLAPS) 3/13 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 27 unsolved
[2024-06-01 12:31:03] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/13 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 5 (OVERLAPS) 25/38 variables, 13/23 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 12/35 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/38 variables, 27/62 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/38 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 9 (OVERLAPS) 1/39 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/39 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 11 (OVERLAPS) 0/39 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Int declared 39/39 variables, and 63 constraints, problems are : Problem set: 0 solved, 27 unsolved in 293 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 13/13 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 9/9 constraints]
After SMT, in 764ms problems are : Problem set: 0 solved, 27 unsolved
Search for dead transitions found 0 dead transitions in 765ms
Starting structural reductions in LI_LTL mode, iteration 1 : 13/42 places, 30/71 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 822 ms. Remains : 13/42 places, 30/71 transitions.
Running random walk in product with property : StigmergyElection-PT-03a-LTLFireability-13
Product exploration explored 100000 steps with 25000 reset in 65 ms.
Product exploration explored 100000 steps with 25000 reset in 68 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 220 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 12 steps (0 resets) in 4 ms. (2 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 120 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
[2024-06-01 12:31:04] [INFO ] Flow matrix only has 26 transitions (discarded 4 similar events)
[2024-06-01 12:31:04] [INFO ] Invariant cache hit.
[2024-06-01 12:31:04] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-06-01 12:31:04] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-06-01 12:31:04] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-06-01 12:31:04] [INFO ] [Real]Added 13 Read/Feed constraints in 1 ms returned sat
[2024-06-01 12:31:04] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 12:31:04] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 12:31:04] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2024-06-01 12:31:04] [INFO ] [Nat]Added 13 Read/Feed constraints in 1 ms returned sat
[2024-06-01 12:31:04] [INFO ] Computed and/alt/rep : 22/144/22 causal constraints (skipped 1 transitions) in 1 ms.
[2024-06-01 12:31:04] [INFO ] Added : 9 causal constraints over 2 iterations in 10 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 3 out of 13 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 13/13 places, 30/30 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 13 transition count 27
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 9 place count 10 transition count 24
Applied a total of 9 rules in 2 ms. Remains 10 /13 variables (removed 3) and now considering 24/30 (removed 6) transitions.
[2024-06-01 12:31:04] [INFO ] Flow matrix only has 20 transitions (discarded 4 similar events)
// Phase 1: matrix 20 rows 10 cols
[2024-06-01 12:31:04] [INFO ] Computed 1 invariants in 0 ms
[2024-06-01 12:31:04] [INFO ] Implicit Places using invariants in 14 ms returned []
[2024-06-01 12:31:04] [INFO ] Flow matrix only has 20 transitions (discarded 4 similar events)
[2024-06-01 12:31:04] [INFO ] Invariant cache hit.
[2024-06-01 12:31:04] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-06-01 12:31:04] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
[2024-06-01 12:31:04] [INFO ] Redundant transitions in 0 ms returned []
Running 21 sub problems to find dead transitions.
[2024-06-01 12:31:04] [INFO ] Flow matrix only has 20 transitions (discarded 4 similar events)
[2024-06-01 12:31:04] [INFO ] Invariant cache hit.
[2024-06-01 12:31:04] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (OVERLAPS) 3/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-06-01 12:31:04] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-06-01 12:31:04] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-06-01 12:31:04] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-06-01 12:31:04] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-06-01 12:31:04] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-06-01 12:31:05] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-06-01 12:31:05] [INFO ] Deduced a trap composed of 4 places in 12 ms of which 0 ms to minimize.
[2024-06-01 12:31:05] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 19/29 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/29 variables, 12/31 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/29 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (OVERLAPS) 1/30 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/30 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 10 (OVERLAPS) 0/30 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Real declared 30/30 variables, and 32 constraints, problems are : Problem set: 0 solved, 21 unsolved in 332 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 21 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (OVERLAPS) 3/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-06-01 12:31:05] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-06-01 12:31:05] [INFO ] Deduced a trap composed of 4 places in 12 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 19/29 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/29 variables, 12/33 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/29 variables, 21/54 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/29 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 9 (OVERLAPS) 1/30 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/30 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 11 (OVERLAPS) 0/30 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Int declared 30/30 variables, and 55 constraints, problems are : Problem set: 0 solved, 21 unsolved in 253 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 10/10 constraints]
After SMT, in 596ms problems are : Problem set: 0 solved, 21 unsolved
Search for dead transitions found 0 dead transitions in 596ms
Starting structural reductions in SI_LTL mode, iteration 1 : 10/13 places, 24/30 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 644 ms. Remains : 10/13 places, 24/30 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 88 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 12 steps (0 resets) in 4 ms. (2 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 111 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
[2024-06-01 12:31:05] [INFO ] Flow matrix only has 20 transitions (discarded 4 similar events)
[2024-06-01 12:31:05] [INFO ] Invariant cache hit.
[2024-06-01 12:31:05] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 12:31:05] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-06-01 12:31:05] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-06-01 12:31:05] [INFO ] [Real]Added 13 Read/Feed constraints in 1 ms returned sat
[2024-06-01 12:31:05] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 12:31:05] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-06-01 12:31:05] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2024-06-01 12:31:05] [INFO ] [Nat]Added 13 Read/Feed constraints in 2 ms returned sat
[2024-06-01 12:31:05] [INFO ] Computed and/alt/rep : 16/90/16 causal constraints (skipped 1 transitions) in 2 ms.
[2024-06-01 12:31:05] [INFO ] Added : 8 causal constraints over 4 iterations in 13 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 65 ms.
Product exploration explored 100000 steps with 25000 reset in 73 ms.
Support contains 3 out of 10 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10/10 places, 24/24 transitions.
Applied a total of 0 rules in 0 ms. Remains 10 /10 variables (removed 0) and now considering 24/24 (removed 0) transitions.
[2024-06-01 12:31:06] [INFO ] Flow matrix only has 20 transitions (discarded 4 similar events)
[2024-06-01 12:31:06] [INFO ] Invariant cache hit.
[2024-06-01 12:31:06] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-06-01 12:31:06] [INFO ] Flow matrix only has 20 transitions (discarded 4 similar events)
[2024-06-01 12:31:06] [INFO ] Invariant cache hit.
[2024-06-01 12:31:06] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-06-01 12:31:06] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
[2024-06-01 12:31:06] [INFO ] Redundant transitions in 0 ms returned []
Running 21 sub problems to find dead transitions.
[2024-06-01 12:31:06] [INFO ] Flow matrix only has 20 transitions (discarded 4 similar events)
[2024-06-01 12:31:06] [INFO ] Invariant cache hit.
[2024-06-01 12:31:06] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (OVERLAPS) 3/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-06-01 12:31:06] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-06-01 12:31:06] [INFO ] Deduced a trap composed of 4 places in 12 ms of which 1 ms to minimize.
[2024-06-01 12:31:06] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-06-01 12:31:06] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 1 ms to minimize.
[2024-06-01 12:31:06] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-06-01 12:31:06] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-06-01 12:31:06] [INFO ] Deduced a trap composed of 4 places in 12 ms of which 1 ms to minimize.
[2024-06-01 12:31:06] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 19/29 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/29 variables, 12/31 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/29 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (OVERLAPS) 1/30 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/30 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 10 (OVERLAPS) 0/30 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Real declared 30/30 variables, and 32 constraints, problems are : Problem set: 0 solved, 21 unsolved in 365 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 21 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (OVERLAPS) 3/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-06-01 12:31:06] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-06-01 12:31:06] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 19/29 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/29 variables, 12/33 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/29 variables, 21/54 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/29 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 9 (OVERLAPS) 1/30 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/30 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 11 (OVERLAPS) 0/30 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Int declared 30/30 variables, and 55 constraints, problems are : Problem set: 0 solved, 21 unsolved in 255 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 10/10 constraints]
After SMT, in 626ms problems are : Problem set: 0 solved, 21 unsolved
Search for dead transitions found 0 dead transitions in 626ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 674 ms. Remains : 10/10 places, 24/24 transitions.
Treatment of property StigmergyElection-PT-03a-LTLFireability-13 finished in 3848 ms.
[2024-06-01 12:31:06] [INFO ] Flatten gal took : 6 ms
[2024-06-01 12:31:06] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-06-01 12:31:06] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 42 places, 71 transitions and 241 arcs took 3 ms.
Total runtime 62570 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA StigmergyElection-PT-03a-LTLFireability-02 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA StigmergyElection-PT-03a-LTLFireability-05 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA StigmergyElection-PT-03a-LTLFireability-13 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717245067159

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2024
ltl formula name StigmergyElection-PT-03a-LTLFireability-02
ltl formula formula --ltl=/tmp/3265/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 42 places, 71 transitions and 241 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3265/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3265/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3265/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3265/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 16 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 44 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 43, there are 487 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 28
pnml2lts-mc( 0/ 4): unique states count: 28
pnml2lts-mc( 0/ 4): unique transitions count: 129
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 137
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 59
pnml2lts-mc( 0/ 4): - cum. max stack depth: 30
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 59 states 306 transitions, fanout: 5.186
pnml2lts-mc( 0/ 4): Total exploration time 0.000 sec (0.000 sec minimum, 0.000 sec on average)
pnml2lts-mc( 0/ 4): States per second: inf, Transitions per second: inf
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 20.3 B/state, compr.: 11.7%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 71 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name StigmergyElection-PT-03a-LTLFireability-05
ltl formula formula --ltl=/tmp/3265/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 42 places, 71 transitions and 241 arcs
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3265/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3265/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3265/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3265/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 44 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 43, there are 90 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 19
pnml2lts-mc( 0/ 4): unique states count: 19
pnml2lts-mc( 0/ 4): unique transitions count: 22
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 8
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 47
pnml2lts-mc( 0/ 4): - cum. max stack depth: 28
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 47 states 73 transitions, fanout: 1.553
pnml2lts-mc( 0/ 4): Total exploration time 0.000 sec (0.000 sec minimum, 0.000 sec on average)
pnml2lts-mc( 0/ 4): States per second: inf, Transitions per second: inf
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 22.3 B/state, compr.: 12.8%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 71 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name StigmergyElection-PT-03a-LTLFireability-13
ltl formula formula --ltl=/tmp/3265/ltl_2_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 42 places, 71 transitions and 241 arcs
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3265/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3265/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3265/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3265/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 44 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 43, there are 78 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 28
pnml2lts-mc( 0/ 4): unique states count: 28
pnml2lts-mc( 0/ 4): unique transitions count: 127
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 118
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 51
pnml2lts-mc( 0/ 4): - cum. max stack depth: 29
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 51 states 268 transitions, fanout: 5.255
pnml2lts-mc( 0/ 4): Total exploration time 0.000 sec (0.000 sec minimum, 0.000 sec on average)
pnml2lts-mc( 0/ 4): States per second: inf, Transitions per second: inf
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 19.1 B/state, compr.: 11.0%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 71 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)

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-03a"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is StigmergyElection-PT-03a, 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 r536-tall-171690532000268"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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