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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 456K
-rw-r--r-- 1 mcc users 7.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 07:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 07:58 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.8K Apr 11 17:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 106K Apr 11 17:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Apr 11 17:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K Apr 11 17:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:58 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:58 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 50K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717227805156

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyCommit-PT-02a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 07:43:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 07:43:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 07:43:26] [INFO ] Load time of PNML (sax parser for PT used): 62 ms
[2024-06-01 07:43:26] [INFO ] Transformed 112 places.
[2024-06-01 07:43:26] [INFO ] Transformed 204 transitions.
[2024-06-01 07:43:26] [INFO ] Found NUPN structural information;
[2024-06-01 07:43:26] [INFO ] Parsed PT model containing 112 places and 204 transitions and 693 arcs in 157 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 45 transitions
Reduce redundant transitions removed 45 transitions.
FORMULA StigmergyCommit-PT-02a-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-02a-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 159/159 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 93 transition count 139
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 93 transition count 139
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 40 place count 93 transition count 137
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 47 place count 86 transition count 129
Iterating global reduction 1 with 7 rules applied. Total rules applied 54 place count 86 transition count 129
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 55 place count 86 transition count 128
Applied a total of 55 rules in 59 ms. Remains 86 /112 variables (removed 26) and now considering 128/159 (removed 31) transitions.
[2024-06-01 07:43:26] [INFO ] Flow matrix only has 122 transitions (discarded 6 similar events)
// Phase 1: matrix 122 rows 86 cols
[2024-06-01 07:43:26] [INFO ] Computed 2 invariants in 10 ms
[2024-06-01 07:43:26] [INFO ] Implicit Places using invariants in 189 ms returned []
[2024-06-01 07:43:26] [INFO ] Flow matrix only has 122 transitions (discarded 6 similar events)
[2024-06-01 07:43:26] [INFO ] Invariant cache hit.
[2024-06-01 07:43:26] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-06-01 07:43:26] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 327 ms to find 0 implicit places.
Running 127 sub problems to find dead transitions.
[2024-06-01 07:43:27] [INFO ] Flow matrix only has 122 transitions (discarded 6 similar events)
[2024-06-01 07:43:27] [INFO ] Invariant cache hit.
[2024-06-01 07:43:27] [INFO ] State equation strengthened by 49 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 1 (OVERLAPS) 1/86 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 127 unsolved
[2024-06-01 07:43:27] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 12 ms to minimize.
[2024-06-01 07:43:27] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 2 ms to minimize.
[2024-06-01 07:43:27] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 0 ms to minimize.
[2024-06-01 07:43:27] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:43:27] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:43:27] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2024-06-01 07:43:28] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 2 ms to minimize.
[2024-06-01 07:43:28] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:43:28] [INFO ] Deduced a trap composed of 14 places in 85 ms of which 1 ms to minimize.
[2024-06-01 07:43:28] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 2 ms to minimize.
[2024-06-01 07:43:28] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:43:28] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-06-01 07:43:28] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
[2024-06-01 07:43:28] [INFO ] Deduced a trap composed of 29 places in 20 ms of which 0 ms to minimize.
[2024-06-01 07:43:28] [INFO ] Deduced a trap composed of 28 places in 21 ms of which 0 ms to minimize.
[2024-06-01 07:43:28] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-06-01 07:43:28] [INFO ] Deduced a trap composed of 32 places in 25 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 4 (OVERLAPS) 121/207 variables, 86/105 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/207 variables, 48/153 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/207 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 7 (OVERLAPS) 1/208 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/208 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 9 (OVERLAPS) 0/208 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 127 unsolved
No progress, stopping.
After SMT solving in domain Real declared 208/208 variables, and 154 constraints, problems are : Problem set: 0 solved, 127 unsolved in 5048 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 86/86 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 127/127 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 127 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 1 (OVERLAPS) 1/86 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 4 (OVERLAPS) 121/207 variables, 86/105 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/207 variables, 48/153 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/207 variables, 127/280 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/207 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 8 (OVERLAPS) 1/208 variables, 1/281 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/208 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 10 (OVERLAPS) 0/208 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 127 unsolved
No progress, stopping.
After SMT solving in domain Int declared 208/208 variables, and 281 constraints, problems are : Problem set: 0 solved, 127 unsolved in 3591 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 86/86 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 127/127 constraints, Known Traps: 17/17 constraints]
After SMT, in 8707ms problems are : Problem set: 0 solved, 127 unsolved
Search for dead transitions found 0 dead transitions in 8722ms
Starting structural reductions in LTL mode, iteration 1 : 86/112 places, 128/159 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9128 ms. Remains : 86/112 places, 128/159 transitions.
Support contains 30 out of 86 places after structural reductions.
[2024-06-01 07:43:35] [INFO ] Flatten gal took : 27 ms
[2024-06-01 07:43:35] [INFO ] Flatten gal took : 11 ms
[2024-06-01 07:43:35] [INFO ] Input system was already deterministic with 128 transitions.
Reduction of identical properties reduced properties to check from 31 to 29
RANDOM walk for 40000 steps (140 resets) in 924 ms. (43 steps per ms) remains 1/29 properties
BEST_FIRST walk for 40003 steps (29 resets) in 164 ms. (242 steps per ms) remains 1/1 properties
[2024-06-01 07:43:36] [INFO ] Flow matrix only has 122 transitions (discarded 6 similar events)
[2024-06-01 07:43:36] [INFO ] Invariant cache hit.
[2024-06-01 07:43:36] [INFO ] State equation strengthened by 49 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 83/86 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 121/207 variables, 86/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/207 variables, 48/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/207 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1/208 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/208 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/208 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 208/208 variables, and 137 constraints, problems are : Problem set: 0 solved, 1 unsolved in 82 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 86/86 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 83/86 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:43:36] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:43:36] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:43:36] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:43:36] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
Problem AtomicPropp21 is UNSAT
After SMT solving in domain Int declared 86/208 variables, and 6 constraints, problems are : Problem set: 1 solved, 0 unsolved in 175 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 0/86 constraints, ReadFeed: 0/49 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 268ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA StigmergyCommit-PT-02a-LTLFireability-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
Computed a total of 21 stabilizing places and 20 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((X(X(p0)) U X(p1)))&&(G(X(p2))||F(p3))))'
Support contains 5 out of 86 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 128/128 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 78 transition count 118
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 78 transition count 118
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 78 transition count 116
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 24 place count 72 transition count 108
Iterating global reduction 1 with 6 rules applied. Total rules applied 30 place count 72 transition count 108
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 31 place count 72 transition count 107
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 33 place count 70 transition count 105
Iterating global reduction 2 with 2 rules applied. Total rules applied 35 place count 70 transition count 105
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 37 place count 68 transition count 103
Iterating global reduction 2 with 2 rules applied. Total rules applied 39 place count 68 transition count 103
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 41 place count 68 transition count 101
Applied a total of 41 rules in 10 ms. Remains 68 /86 variables (removed 18) and now considering 101/128 (removed 27) transitions.
[2024-06-01 07:43:37] [INFO ] Flow matrix only has 97 transitions (discarded 4 similar events)
// Phase 1: matrix 97 rows 68 cols
[2024-06-01 07:43:37] [INFO ] Computed 2 invariants in 2 ms
[2024-06-01 07:43:37] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-06-01 07:43:37] [INFO ] Flow matrix only has 97 transitions (discarded 4 similar events)
[2024-06-01 07:43:37] [INFO ] Invariant cache hit.
[2024-06-01 07:43:37] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-06-01 07:43:37] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
Running 100 sub problems to find dead transitions.
[2024-06-01 07:43:37] [INFO ] Flow matrix only has 97 transitions (discarded 4 similar events)
[2024-06-01 07:43:37] [INFO ] Invariant cache hit.
[2024-06-01 07:43:37] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (OVERLAPS) 1/68 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 100 unsolved
[2024-06-01 07:43:37] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:43:37] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 0 ms to minimize.
[2024-06-01 07:43:37] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 1 ms to minimize.
[2024-06-01 07:43:37] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:43:37] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 0 ms to minimize.
[2024-06-01 07:43:37] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2024-06-01 07:43:37] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-06-01 07:43:37] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-06-01 07:43:37] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:43:37] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:43:37] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2024-06-01 07:43:37] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
[2024-06-01 07:43:38] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 1 ms to minimize.
[2024-06-01 07:43:38] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 100 unsolved
[2024-06-01 07:43:38] [INFO ] Deduced a trap composed of 25 places in 28 ms of which 1 ms to minimize.
[2024-06-01 07:43:38] [INFO ] Deduced a trap composed of 24 places in 25 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (OVERLAPS) 96/164 variables, 68/86 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/164 variables, 41/127 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/164 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 8 (OVERLAPS) 1/165 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 100 unsolved
[2024-06-01 07:43:39] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/165 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/165 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 11 (OVERLAPS) 0/165 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Real declared 165/165 variables, and 129 constraints, problems are : Problem set: 0 solved, 100 unsolved in 3624 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 68/68 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 100 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (OVERLAPS) 1/68 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 100 unsolved
[2024-06-01 07:43:41] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 1 ms to minimize.
[2024-06-01 07:43:41] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (OVERLAPS) 96/164 variables, 68/89 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/164 variables, 41/130 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/164 variables, 100/230 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/164 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 9 (OVERLAPS) 1/165 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/165 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 11 (OVERLAPS) 0/165 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Int declared 165/165 variables, and 231 constraints, problems are : Problem set: 0 solved, 100 unsolved in 2427 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 68/68 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 19/19 constraints]
After SMT, in 6083ms problems are : Problem set: 0 solved, 100 unsolved
Search for dead transitions found 0 dead transitions in 6084ms
Starting structural reductions in LTL mode, iteration 1 : 68/86 places, 101/128 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6204 ms. Remains : 68/86 places, 101/128 transitions.
Stuttering acceptance computed with spot in 358 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), (NOT p1), (AND (NOT p3) (NOT p2)), (NOT p1), (OR (NOT p0) (NOT p1)), true, (NOT p3)]
Running random walk in product with property : StigmergyCommit-PT-02a-LTLFireability-00
Stuttering criterion allowed to conclude after 24 steps with 1 reset in 2 ms.
FORMULA StigmergyCommit-PT-02a-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-02a-LTLFireability-00 finished in 6619 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 1 out of 86 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 128/128 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 77 transition count 117
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 77 transition count 117
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 20 place count 77 transition count 115
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 27 place count 70 transition count 106
Iterating global reduction 1 with 7 rules applied. Total rules applied 34 place count 70 transition count 106
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 35 place count 70 transition count 105
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 38 place count 67 transition count 102
Iterating global reduction 2 with 3 rules applied. Total rules applied 41 place count 67 transition count 102
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 44 place count 64 transition count 99
Iterating global reduction 2 with 3 rules applied. Total rules applied 47 place count 64 transition count 99
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 49 place count 64 transition count 97
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 50 place count 63 transition count 96
Iterating global reduction 3 with 1 rules applied. Total rules applied 51 place count 63 transition count 96
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 52 place count 63 transition count 95
Applied a total of 52 rules in 11 ms. Remains 63 /86 variables (removed 23) and now considering 95/128 (removed 33) transitions.
[2024-06-01 07:43:43] [INFO ] Flow matrix only has 91 transitions (discarded 4 similar events)
// Phase 1: matrix 91 rows 63 cols
[2024-06-01 07:43:43] [INFO ] Computed 2 invariants in 1 ms
[2024-06-01 07:43:43] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-06-01 07:43:43] [INFO ] Flow matrix only has 91 transitions (discarded 4 similar events)
[2024-06-01 07:43:43] [INFO ] Invariant cache hit.
[2024-06-01 07:43:43] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-01 07:43:43] [INFO ] Implicit Places using invariants and state equation in 93 ms returned [62]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 147 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 62/86 places, 95/128 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 54 transition count 87
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 54 transition count 87
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 19 place count 54 transition count 84
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 22 place count 51 transition count 81
Iterating global reduction 1 with 3 rules applied. Total rules applied 25 place count 51 transition count 81
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 28 place count 48 transition count 78
Iterating global reduction 1 with 3 rules applied. Total rules applied 31 place count 48 transition count 78
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 34 place count 45 transition count 75
Iterating global reduction 1 with 3 rules applied. Total rules applied 37 place count 45 transition count 75
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 40 place count 42 transition count 72
Iterating global reduction 1 with 3 rules applied. Total rules applied 43 place count 42 transition count 72
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 45 place count 40 transition count 70
Iterating global reduction 1 with 2 rules applied. Total rules applied 47 place count 40 transition count 70
Applied a total of 47 rules in 8 ms. Remains 40 /62 variables (removed 22) and now considering 70/95 (removed 25) transitions.
[2024-06-01 07:43:43] [INFO ] Flow matrix only has 66 transitions (discarded 4 similar events)
// Phase 1: matrix 66 rows 40 cols
[2024-06-01 07:43:43] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 07:43:43] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-06-01 07:43:43] [INFO ] Flow matrix only has 66 transitions (discarded 4 similar events)
[2024-06-01 07:43:43] [INFO ] Invariant cache hit.
[2024-06-01 07:43:43] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-06-01 07:43:43] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 40/86 places, 70/128 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 248 ms. Remains : 40/86 places, 70/128 transitions.
Stuttering acceptance computed with spot in 106 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-02a-LTLFireability-01
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA StigmergyCommit-PT-02a-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-02a-LTLFireability-01 finished in 368 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((F(p0)||(X(!p1) U ((p2&&X(!p1))||X(G(!p1))))))))'
Support contains 3 out of 86 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 : 86/86 places, 128/128 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 5 rules applied. Total rules applied 5 place count 86 transition count 123
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 13 place count 81 transition count 120
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 13 place count 81 transition count 104
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 45 place count 65 transition count 104
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 51 place count 59 transition count 97
Iterating global reduction 2 with 6 rules applied. Total rules applied 57 place count 59 transition count 97
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 58 place count 59 transition count 96
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 62 place count 55 transition count 91
Iterating global reduction 3 with 4 rules applied. Total rules applied 66 place count 55 transition count 91
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 67 place count 55 transition count 90
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 70 place count 52 transition count 87
Iterating global reduction 4 with 3 rules applied. Total rules applied 73 place count 52 transition count 87
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 76 place count 52 transition count 84
Performed 13 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 5 with 26 rules applied. Total rules applied 102 place count 39 transition count 70
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 105 place count 39 transition count 67
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 109 place count 35 transition count 63
Iterating global reduction 6 with 4 rules applied. Total rules applied 113 place count 35 transition count 63
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 115 place count 35 transition count 61
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 117 place count 33 transition count 59
Iterating global reduction 7 with 2 rules applied. Total rules applied 119 place count 33 transition count 59
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 120 place count 33 transition count 58
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 121 place count 32 transition count 57
Iterating global reduction 8 with 1 rules applied. Total rules applied 122 place count 32 transition count 57
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 8 with 2 rules applied. Total rules applied 124 place count 31 transition count 56
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 127 place count 31 transition count 53
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 128 place count 31 transition count 53
Applied a total of 128 rules in 39 ms. Remains 31 /86 variables (removed 55) and now considering 53/128 (removed 75) transitions.
[2024-06-01 07:43:44] [INFO ] Flow matrix only has 48 transitions (discarded 5 similar events)
// Phase 1: matrix 48 rows 31 cols
[2024-06-01 07:43:44] [INFO ] Computed 2 invariants in 0 ms
[2024-06-01 07:43:44] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-06-01 07:43:44] [INFO ] Flow matrix only has 48 transitions (discarded 5 similar events)
[2024-06-01 07:43:44] [INFO ] Invariant cache hit.
[2024-06-01 07:43:44] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-06-01 07:43:44] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
[2024-06-01 07:43:44] [INFO ] Redundant transitions in 1 ms returned []
Running 52 sub problems to find dead transitions.
[2024-06-01 07:43:44] [INFO ] Flow matrix only has 48 transitions (discarded 5 similar events)
[2024-06-01 07:43:44] [INFO ] Invariant cache hit.
[2024-06-01 07:43:44] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (OVERLAPS) 1/31 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 52 unsolved
[2024-06-01 07:43:44] [INFO ] Deduced a trap composed of 8 places in 17 ms of which 1 ms to minimize.
[2024-06-01 07:43:44] [INFO ] Deduced a trap composed of 8 places in 19 ms of which 0 ms to minimize.
[2024-06-01 07:43:44] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 1 ms to minimize.
[2024-06-01 07:43:44] [INFO ] Deduced a trap composed of 11 places in 19 ms of which 0 ms to minimize.
[2024-06-01 07:43:44] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 0 ms to minimize.
[2024-06-01 07:43:44] [INFO ] Deduced a trap composed of 9 places in 17 ms of which 1 ms to minimize.
[2024-06-01 07:43:44] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 1 ms to minimize.
[2024-06-01 07:43:44] [INFO ] Deduced a trap composed of 15 places in 20 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 52 unsolved
[2024-06-01 07:43:44] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 5 (OVERLAPS) 47/78 variables, 31/42 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 37/79 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/78 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 8 (OVERLAPS) 1/79 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/79 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 10 (OVERLAPS) 0/79 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Real declared 79/79 variables, and 80 constraints, problems are : Problem set: 0 solved, 52 unsolved in 1047 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 31/31 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 52 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (OVERLAPS) 1/31 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 4 (OVERLAPS) 47/78 variables, 31/42 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 37/79 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 52/131 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/78 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 8 (OVERLAPS) 1/79 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/79 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 10 (OVERLAPS) 0/79 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Int declared 79/79 variables, and 132 constraints, problems are : Problem set: 0 solved, 52 unsolved in 817 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 31/31 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 9/9 constraints]
After SMT, in 1911ms problems are : Problem set: 0 solved, 52 unsolved
Search for dead transitions found 0 dead transitions in 1912ms
Starting structural reductions in SI_LTL mode, iteration 1 : 31/86 places, 53/128 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2039 ms. Remains : 31/86 places, 53/128 transitions.
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Running random walk in product with property : StigmergyCommit-PT-02a-LTLFireability-02
Product exploration explored 100000 steps with 0 reset in 185 ms.
Product exploration explored 100000 steps with 0 reset in 95 ms.
Computed a total of 9 stabilizing places and 8 stable transitions
Computed a total of 9 stabilizing places and 8 stable transitions
Detected a total of 9/31 stabilizing places and 8/53 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 207 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 59 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
RANDOM walk for 38 steps (0 resets) in 7 ms. (4 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p1), (F (NOT (OR p0 (NOT p1)))), (F p0), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 11 factoid took 459 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Support contains 3 out of 31 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 : 31/31 places, 53/53 transitions.
Applied a total of 0 rules in 5 ms. Remains 31 /31 variables (removed 0) and now considering 53/53 (removed 0) transitions.
[2024-06-01 07:43:47] [INFO ] Flow matrix only has 48 transitions (discarded 5 similar events)
[2024-06-01 07:43:47] [INFO ] Invariant cache hit.
[2024-06-01 07:43:47] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-06-01 07:43:47] [INFO ] Flow matrix only has 48 transitions (discarded 5 similar events)
[2024-06-01 07:43:47] [INFO ] Invariant cache hit.
[2024-06-01 07:43:47] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-06-01 07:43:47] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
[2024-06-01 07:43:47] [INFO ] Redundant transitions in 0 ms returned []
Running 52 sub problems to find dead transitions.
[2024-06-01 07:43:47] [INFO ] Flow matrix only has 48 transitions (discarded 5 similar events)
[2024-06-01 07:43:47] [INFO ] Invariant cache hit.
[2024-06-01 07:43:47] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (OVERLAPS) 1/31 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 52 unsolved
[2024-06-01 07:43:47] [INFO ] Deduced a trap composed of 8 places in 19 ms of which 1 ms to minimize.
[2024-06-01 07:43:47] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 2 ms to minimize.
[2024-06-01 07:43:47] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 0 ms to minimize.
[2024-06-01 07:43:47] [INFO ] Deduced a trap composed of 11 places in 17 ms of which 0 ms to minimize.
[2024-06-01 07:43:47] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 1 ms to minimize.
[2024-06-01 07:43:47] [INFO ] Deduced a trap composed of 9 places in 15 ms of which 1 ms to minimize.
[2024-06-01 07:43:47] [INFO ] Deduced a trap composed of 11 places in 15 ms of which 1 ms to minimize.
[2024-06-01 07:43:47] [INFO ] Deduced a trap composed of 15 places in 18 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 52 unsolved
[2024-06-01 07:43:47] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 5 (OVERLAPS) 47/78 variables, 31/42 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 37/79 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/78 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 8 (OVERLAPS) 1/79 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/79 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 10 (OVERLAPS) 0/79 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Real declared 79/79 variables, and 80 constraints, problems are : Problem set: 0 solved, 52 unsolved in 992 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 31/31 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 52 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (OVERLAPS) 1/31 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 4 (OVERLAPS) 47/78 variables, 31/42 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 37/79 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 52/131 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/78 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 8 (OVERLAPS) 1/79 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/79 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 10 (OVERLAPS) 0/79 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Int declared 79/79 variables, and 132 constraints, problems are : Problem set: 0 solved, 52 unsolved in 804 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 31/31 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 9/9 constraints]
After SMT, in 1811ms problems are : Problem set: 0 solved, 52 unsolved
Search for dead transitions found 0 dead transitions in 1813ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1893 ms. Remains : 31/31 places, 53/53 transitions.
Computed a total of 9 stabilizing places and 8 stable transitions
Computed a total of 9 stabilizing places and 8 stable transitions
Detected a total of 9/31 stabilizing places and 8/53 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 204 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
RANDOM walk for 61 steps (1 resets) in 20 ms. (2 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p1), (F (NOT (OR p0 (NOT p1)))), (F p0), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 11 factoid took 420 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 3 reset in 52 ms.
Product exploration explored 100000 steps with 0 reset in 103 ms.
Support contains 3 out of 31 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 31/31 places, 53/53 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 30 transition count 51
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 30 transition count 51
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 29 transition count 50
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 29 transition count 49
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 6 place count 28 transition count 48
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 28 transition count 48
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 28 transition count 44
Applied a total of 11 rules in 5 ms. Remains 28 /31 variables (removed 3) and now considering 44/53 (removed 9) transitions.
[2024-06-01 07:43:50] [INFO ] Flow matrix only has 40 transitions (discarded 4 similar events)
// Phase 1: matrix 40 rows 28 cols
[2024-06-01 07:43:50] [INFO ] Computed 2 invariants in 1 ms
[2024-06-01 07:43:50] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-06-01 07:43:50] [INFO ] Flow matrix only has 40 transitions (discarded 4 similar events)
[2024-06-01 07:43:50] [INFO ] Invariant cache hit.
[2024-06-01 07:43:50] [INFO ] State equation strengthened by 33 read => feed constraints.
[2024-06-01 07:43:50] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
[2024-06-01 07:43:50] [INFO ] Redundant transitions in 0 ms returned []
Running 43 sub problems to find dead transitions.
[2024-06-01 07:43:50] [INFO ] Flow matrix only has 40 transitions (discarded 4 similar events)
[2024-06-01 07:43:50] [INFO ] Invariant cache hit.
[2024-06-01 07:43:50] [INFO ] State equation strengthened by 33 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (OVERLAPS) 1/28 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 43 unsolved
[2024-06-01 07:43:50] [INFO ] Deduced a trap composed of 8 places in 16 ms of which 0 ms to minimize.
[2024-06-01 07:43:50] [INFO ] Deduced a trap composed of 9 places in 17 ms of which 0 ms to minimize.
[2024-06-01 07:43:50] [INFO ] Deduced a trap composed of 9 places in 18 ms of which 1 ms to minimize.
[2024-06-01 07:43:50] [INFO ] Deduced a trap composed of 8 places in 16 ms of which 0 ms to minimize.
[2024-06-01 07:43:50] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 1 ms to minimize.
[2024-06-01 07:43:50] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 1 ms to minimize.
[2024-06-01 07:43:50] [INFO ] Deduced a trap composed of 9 places in 18 ms of which 0 ms to minimize.
[2024-06-01 07:43:50] [INFO ] Deduced a trap composed of 8 places in 16 ms of which 0 ms to minimize.
[2024-06-01 07:43:50] [INFO ] Deduced a trap composed of 12 places in 16 ms of which 0 ms to minimize.
[2024-06-01 07:43:50] [INFO ] Deduced a trap composed of 11 places in 14 ms of which 1 ms to minimize.
[2024-06-01 07:43:50] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 4 (OVERLAPS) 39/67 variables, 28/41 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/67 variables, 32/73 constraints. Problems are: Problem set: 0 solved, 43 unsolved
[2024-06-01 07:43:50] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/67 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 8 (OVERLAPS) 1/68 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/68 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 10 (OVERLAPS) 0/68 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Real declared 68/68 variables, and 75 constraints, problems are : Problem set: 0 solved, 43 unsolved in 919 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 28/28 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 43 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (OVERLAPS) 1/28 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 43 unsolved
[2024-06-01 07:43:51] [INFO ] Deduced a trap composed of 9 places in 14 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 5 (OVERLAPS) 39/67 variables, 28/43 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 32/75 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/67 variables, 43/118 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/67 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 9 (OVERLAPS) 1/68 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/68 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 11 (OVERLAPS) 0/68 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Int declared 68/68 variables, and 119 constraints, problems are : Problem set: 0 solved, 43 unsolved in 615 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 28/28 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 13/13 constraints]
After SMT, in 1555ms problems are : Problem set: 0 solved, 43 unsolved
Search for dead transitions found 0 dead transitions in 1555ms
Starting structural reductions in SI_LTL mode, iteration 1 : 28/31 places, 44/53 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1668 ms. Remains : 28/31 places, 44/53 transitions.
Treatment of property StigmergyCommit-PT-02a-LTLFireability-02 finished in 8046 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||G(F(p1))) U X(G(p0))))'
Support contains 2 out of 86 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 86/86 places, 128/128 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 5 rules applied. Total rules applied 5 place count 86 transition count 123
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 13 place count 81 transition count 120
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 13 place count 81 transition count 104
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 45 place count 65 transition count 104
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 52 place count 58 transition count 95
Iterating global reduction 2 with 7 rules applied. Total rules applied 59 place count 58 transition count 95
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 60 place count 58 transition count 94
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 65 place count 53 transition count 87
Iterating global reduction 3 with 5 rules applied. Total rules applied 70 place count 53 transition count 87
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 71 place count 53 transition count 86
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 74 place count 50 transition count 83
Iterating global reduction 4 with 3 rules applied. Total rules applied 77 place count 50 transition count 83
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 81 place count 50 transition count 79
Performed 13 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 5 with 26 rules applied. Total rules applied 107 place count 37 transition count 65
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 110 place count 37 transition count 62
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 115 place count 32 transition count 57
Iterating global reduction 6 with 5 rules applied. Total rules applied 120 place count 32 transition count 57
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 124 place count 32 transition count 53
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 128 place count 28 transition count 49
Iterating global reduction 7 with 4 rules applied. Total rules applied 132 place count 28 transition count 49
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 133 place count 28 transition count 48
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 136 place count 25 transition count 45
Iterating global reduction 8 with 3 rules applied. Total rules applied 139 place count 25 transition count 45
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 8 with 2 rules applied. Total rules applied 141 place count 24 transition count 44
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 144 place count 24 transition count 41
Applied a total of 144 rules in 14 ms. Remains 24 /86 variables (removed 62) and now considering 41/128 (removed 87) transitions.
[2024-06-01 07:43:52] [INFO ] Flow matrix only has 37 transitions (discarded 4 similar events)
// Phase 1: matrix 37 rows 24 cols
[2024-06-01 07:43:52] [INFO ] Computed 2 invariants in 1 ms
[2024-06-01 07:43:52] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-06-01 07:43:52] [INFO ] Flow matrix only has 37 transitions (discarded 4 similar events)
[2024-06-01 07:43:52] [INFO ] Invariant cache hit.
[2024-06-01 07:43:52] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-06-01 07:43:52] [INFO ] Implicit Places using invariants and state equation in 38 ms returned [23]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 69 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 23/86 places, 41/128 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 23 transition count 39
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 21 transition count 39
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 24 place count 11 transition count 29
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 30 place count 11 transition count 23
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 3 with 7 rules applied. Total rules applied 37 place count 11 transition count 16
Applied a total of 37 rules in 4 ms. Remains 11 /23 variables (removed 12) and now considering 16/41 (removed 25) transitions.
[2024-06-01 07:43:52] [INFO ] Flow matrix only has 13 transitions (discarded 3 similar events)
// Phase 1: matrix 13 rows 11 cols
[2024-06-01 07:43:52] [INFO ] Computed 1 invariants in 0 ms
[2024-06-01 07:43:52] [INFO ] Implicit Places using invariants in 15 ms returned []
[2024-06-01 07:43:52] [INFO ] Flow matrix only has 13 transitions (discarded 3 similar events)
[2024-06-01 07:43:52] [INFO ] Invariant cache hit.
[2024-06-01 07:43:52] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-06-01 07:43:52] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 11/86 places, 16/128 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 180 ms. Remains : 11/86 places, 16/128 transitions.
Stuttering acceptance computed with spot in 138 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : StigmergyCommit-PT-02a-LTLFireability-03
Product exploration explored 100000 steps with 1 reset in 136 ms.
Product exploration explored 100000 steps with 2 reset in 90 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/11 stabilizing places and 2/16 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 116 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter insensitive) to 4 states, 8 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 140 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
RANDOM walk for 40000 steps (6259 resets) in 167 ms. (238 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40002 steps (2512 resets) in 77 ms. (512 steps per ms) remains 1/1 properties
[2024-06-01 07:43:52] [INFO ] Flow matrix only has 13 transitions (discarded 3 similar events)
[2024-06-01 07:43:52] [INFO ] Invariant cache hit.
[2024-06-01 07:43:52] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:43:52] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-06-01 07:43:53] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
Problem apf0 is UNSAT
After SMT solving in domain Real declared 11/24 variables, and 3 constraints, problems are : Problem set: 1 solved, 0 unsolved in 65 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/11 constraints, ReadFeed: 0/5 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 68ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 9 factoid took 200 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter insensitive) to 4 states, 8 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 122 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 148 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Support contains 2 out of 11 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 11/11 places, 16/16 transitions.
Applied a total of 0 rules in 3 ms. Remains 11 /11 variables (removed 0) and now considering 16/16 (removed 0) transitions.
[2024-06-01 07:43:53] [INFO ] Flow matrix only has 13 transitions (discarded 3 similar events)
[2024-06-01 07:43:53] [INFO ] Invariant cache hit.
[2024-06-01 07:43:53] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-06-01 07:43:53] [INFO ] Flow matrix only has 13 transitions (discarded 3 similar events)
[2024-06-01 07:43:53] [INFO ] Invariant cache hit.
[2024-06-01 07:43:53] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-06-01 07:43:53] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2024-06-01 07:43:53] [INFO ] Redundant transitions in 0 ms returned []
Running 15 sub problems to find dead transitions.
[2024-06-01 07:43:53] [INFO ] Flow matrix only has 13 transitions (discarded 3 similar events)
[2024-06-01 07:43:53] [INFO ] Invariant cache hit.
[2024-06-01 07:43:53] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 1/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-06-01 07:43:53] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-06-01 07:43:53] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-06-01 07:43:53] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-06-01 07:43:53] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-06-01 07:43:53] [INFO ] Deduced a trap composed of 5 places in 14 ms of which 0 ms to minimize.
[2024-06-01 07:43:53] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-06-01 07:43:53] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-06-01 07:43:53] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-06-01 07:43:53] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-06-01 07:43:53] [INFO ] Deduced a trap composed of 6 places in 18 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/11 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 12/23 variables, 11/22 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/23 variables, 4/26 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/23 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (OVERLAPS) 1/24 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/24 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 11 (OVERLAPS) 0/24 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 24/24 variables, and 27 constraints, problems are : Problem set: 0 solved, 15 unsolved in 337 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 11/11 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 1/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 12/23 variables, 11/22 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 4/26 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/23 variables, 15/41 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/23 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (OVERLAPS) 1/24 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/24 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (OVERLAPS) 0/24 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 24/24 variables, and 42 constraints, problems are : Problem set: 0 solved, 15 unsolved in 134 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 11/11 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 10/10 constraints]
After SMT, in 479ms problems are : Problem set: 0 solved, 15 unsolved
Search for dead transitions found 0 dead transitions in 480ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 530 ms. Remains : 11/11 places, 16/16 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/11 stabilizing places and 2/16 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 225 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter insensitive) to 4 states, 8 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 148 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
RANDOM walk for 40000 steps (6315 resets) in 72 ms. (547 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40002 steps (2460 resets) in 31 ms. (1250 steps per ms) remains 1/1 properties
[2024-06-01 07:43:54] [INFO ] Flow matrix only has 13 transitions (discarded 3 similar events)
[2024-06-01 07:43:54] [INFO ] Invariant cache hit.
[2024-06-01 07:43:54] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:43:54] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 0 ms to minimize.
[2024-06-01 07:43:54] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
Problem apf0 is UNSAT
After SMT solving in domain Real declared 11/24 variables, and 3 constraints, problems are : Problem set: 1 solved, 0 unsolved in 79 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/11 constraints, ReadFeed: 0/5 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 94ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 9 factoid took 185 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter insensitive) to 4 states, 8 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 129 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 144 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 133 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 32 ms.
Product exploration explored 100000 steps with 0 reset in 35 ms.
Support contains 2 out of 11 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 11/11 places, 16/16 transitions.
Applied a total of 0 rules in 2 ms. Remains 11 /11 variables (removed 0) and now considering 16/16 (removed 0) transitions.
[2024-06-01 07:43:55] [INFO ] Flow matrix only has 13 transitions (discarded 3 similar events)
[2024-06-01 07:43:55] [INFO ] Invariant cache hit.
[2024-06-01 07:43:55] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-06-01 07:43:55] [INFO ] Flow matrix only has 13 transitions (discarded 3 similar events)
[2024-06-01 07:43:55] [INFO ] Invariant cache hit.
[2024-06-01 07:43:55] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-06-01 07:43:55] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2024-06-01 07:43:55] [INFO ] Redundant transitions in 0 ms returned []
Running 15 sub problems to find dead transitions.
[2024-06-01 07:43:55] [INFO ] Flow matrix only has 13 transitions (discarded 3 similar events)
[2024-06-01 07:43:55] [INFO ] Invariant cache hit.
[2024-06-01 07:43:55] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 1/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-06-01 07:43:55] [INFO ] Deduced a trap composed of 4 places in 12 ms of which 0 ms to minimize.
[2024-06-01 07:43:55] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-06-01 07:43:55] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 1 ms to minimize.
[2024-06-01 07:43:55] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-06-01 07:43:55] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 0 ms to minimize.
[2024-06-01 07:43:55] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
[2024-06-01 07:43:55] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
[2024-06-01 07:43:55] [INFO ] Deduced a trap composed of 5 places in 14 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-06-01 07:43:55] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-06-01 07:43:55] [INFO ] Deduced a trap composed of 6 places in 15 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/11 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 12/23 variables, 11/22 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/23 variables, 4/26 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/23 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (OVERLAPS) 1/24 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/24 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 11 (OVERLAPS) 0/24 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 24/24 variables, and 27 constraints, problems are : Problem set: 0 solved, 15 unsolved in 339 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 11/11 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 1/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 12/23 variables, 11/22 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 4/26 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/23 variables, 15/41 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/23 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (OVERLAPS) 1/24 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/24 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (OVERLAPS) 0/24 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 24/24 variables, and 42 constraints, problems are : Problem set: 0 solved, 15 unsolved in 147 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 11/11 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 10/10 constraints]
After SMT, in 490ms problems are : Problem set: 0 solved, 15 unsolved
Search for dead transitions found 0 dead transitions in 491ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 555 ms. Remains : 11/11 places, 16/16 transitions.
Treatment of property StigmergyCommit-PT-02a-LTLFireability-03 finished in 3768 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)||F(p1)))'
Support contains 4 out of 86 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 86/86 places, 128/128 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 48 rules applied. Total rules applied 48 place count 84 transition count 80
Reduce places removed 47 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 59 rules applied. Total rules applied 107 place count 37 transition count 68
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 113 place count 34 transition count 65
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 113 place count 34 transition count 59
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 125 place count 28 transition count 59
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 132 place count 21 transition count 50
Iterating global reduction 3 with 7 rules applied. Total rules applied 139 place count 21 transition count 50
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 142 place count 21 transition count 47
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 142 place count 21 transition count 46
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 144 place count 20 transition count 46
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 146 place count 18 transition count 42
Iterating global reduction 4 with 2 rules applied. Total rules applied 148 place count 18 transition count 42
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 154 place count 18 transition count 36
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 5 with 4 rules applied. Total rules applied 158 place count 16 transition count 34
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 161 place count 16 transition count 31
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 5 with 6 rules applied. Total rules applied 167 place count 13 transition count 28
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 169 place count 13 transition count 28
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 170 place count 12 transition count 27
Applied a total of 170 rules in 17 ms. Remains 12 /86 variables (removed 74) and now considering 27/128 (removed 101) transitions.
[2024-06-01 07:43:55] [INFO ] Flow matrix only has 23 transitions (discarded 4 similar events)
// Phase 1: matrix 23 rows 12 cols
[2024-06-01 07:43:55] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 07:43:55] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-06-01 07:43:55] [INFO ] Flow matrix only has 23 transitions (discarded 4 similar events)
[2024-06-01 07:43:55] [INFO ] Invariant cache hit.
[2024-06-01 07:43:55] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-06-01 07:43:55] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
[2024-06-01 07:43:55] [INFO ] Redundant transitions in 0 ms returned []
Running 24 sub problems to find dead transitions.
[2024-06-01 07:43:55] [INFO ] Flow matrix only has 23 transitions (discarded 4 similar events)
[2024-06-01 07:43:55] [INFO ] Invariant cache hit.
[2024-06-01 07:43:55] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 3/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 24 unsolved
[2024-06-01 07:43:56] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-06-01 07:43:56] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-06-01 07:43:56] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-06-01 07:43:56] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-06-01 07:43:56] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-06-01 07:43:56] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-06-01 07:43:56] [INFO ] Deduced a trap composed of 6 places in 17 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 24 unsolved
[2024-06-01 07:43:56] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (OVERLAPS) 22/34 variables, 12/21 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/34 variables, 13/34 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/34 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 8 (OVERLAPS) 1/35 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/35 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 10 (OVERLAPS) 0/35 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Real declared 35/35 variables, and 35 constraints, problems are : Problem set: 0 solved, 24 unsolved in 471 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 12/12 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 24 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 3/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (OVERLAPS) 22/34 variables, 12/21 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/34 variables, 13/34 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/34 variables, 24/58 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/34 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 8 (OVERLAPS) 1/35 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/35 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 10 (OVERLAPS) 0/35 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Int declared 35/35 variables, and 59 constraints, problems are : Problem set: 0 solved, 24 unsolved in 246 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 12/12 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 8/8 constraints]
After SMT, in 730ms problems are : Problem set: 0 solved, 24 unsolved
Search for dead transitions found 0 dead transitions in 731ms
Starting structural reductions in SI_LTL mode, iteration 1 : 12/86 places, 27/128 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 819 ms. Remains : 12/86 places, 27/128 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : StigmergyCommit-PT-02a-LTLFireability-04
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 1 ms.
FORMULA StigmergyCommit-PT-02a-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-02a-LTLFireability-04 finished in 915 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||(p1 U p2))))'
Support contains 3 out of 86 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 : 86/86 places, 128/128 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 86 transition count 124
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 7 rules applied. Total rules applied 11 place count 82 transition count 121
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 13 place count 81 transition count 120
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 17 Pre rules applied. Total rules applied 13 place count 81 transition count 103
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 47 place count 64 transition count 103
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 54 place count 57 transition count 94
Iterating global reduction 3 with 7 rules applied. Total rules applied 61 place count 57 transition count 94
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 62 place count 57 transition count 93
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 67 place count 52 transition count 86
Iterating global reduction 4 with 5 rules applied. Total rules applied 72 place count 52 transition count 86
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 73 place count 52 transition count 85
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 76 place count 49 transition count 82
Iterating global reduction 5 with 3 rules applied. Total rules applied 79 place count 49 transition count 82
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 82 place count 49 transition count 79
Performed 11 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 6 with 22 rules applied. Total rules applied 104 place count 38 transition count 67
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 106 place count 38 transition count 65
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 110 place count 34 transition count 61
Iterating global reduction 7 with 4 rules applied. Total rules applied 114 place count 34 transition count 61
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 116 place count 34 transition count 59
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 119 place count 31 transition count 56
Iterating global reduction 8 with 3 rules applied. Total rules applied 122 place count 31 transition count 56
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 123 place count 31 transition count 55
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 125 place count 29 transition count 53
Iterating global reduction 9 with 2 rules applied. Total rules applied 127 place count 29 transition count 53
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 9 with 2 rules applied. Total rules applied 129 place count 28 transition count 52
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 131 place count 27 transition count 52
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 9 with 4 rules applied. Total rules applied 135 place count 27 transition count 48
Applied a total of 135 rules in 33 ms. Remains 27 /86 variables (removed 59) and now considering 48/128 (removed 80) transitions.
[2024-06-01 07:43:56] [INFO ] Flow matrix only has 44 transitions (discarded 4 similar events)
// Phase 1: matrix 44 rows 27 cols
[2024-06-01 07:43:56] [INFO ] Computed 2 invariants in 1 ms
[2024-06-01 07:43:56] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-06-01 07:43:56] [INFO ] Flow matrix only has 44 transitions (discarded 4 similar events)
[2024-06-01 07:43:56] [INFO ] Invariant cache hit.
[2024-06-01 07:43:56] [INFO ] State equation strengthened by 33 read => feed constraints.
[2024-06-01 07:43:56] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
[2024-06-01 07:43:56] [INFO ] Redundant transitions in 0 ms returned []
Running 47 sub problems to find dead transitions.
[2024-06-01 07:43:56] [INFO ] Flow matrix only has 44 transitions (discarded 4 similar events)
[2024-06-01 07:43:56] [INFO ] Invariant cache hit.
[2024-06-01 07:43:56] [INFO ] State equation strengthened by 33 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (OVERLAPS) 1/27 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 47 unsolved
[2024-06-01 07:43:56] [INFO ] Deduced a trap composed of 8 places in 19 ms of which 0 ms to minimize.
[2024-06-01 07:43:56] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 1 ms to minimize.
[2024-06-01 07:43:57] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 1 ms to minimize.
[2024-06-01 07:43:57] [INFO ] Deduced a trap composed of 9 places in 15 ms of which 1 ms to minimize.
[2024-06-01 07:43:57] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 1 ms to minimize.
[2024-06-01 07:43:57] [INFO ] Deduced a trap composed of 10 places in 18 ms of which 0 ms to minimize.
[2024-06-01 07:43:57] [INFO ] Deduced a trap composed of 9 places in 18 ms of which 0 ms to minimize.
[2024-06-01 07:43:57] [INFO ] Deduced a trap composed of 12 places in 19 ms of which 0 ms to minimize.
[2024-06-01 07:43:57] [INFO ] Deduced a trap composed of 9 places in 17 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 47 unsolved
[2024-06-01 07:43:57] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 0 ms to minimize.
[2024-06-01 07:43:57] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (OVERLAPS) 43/70 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/70 variables, 32/72 constraints. Problems are: Problem set: 0 solved, 47 unsolved
[2024-06-01 07:43:57] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/70 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/70 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 9 (OVERLAPS) 1/71 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/71 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 11 (OVERLAPS) 0/71 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Real declared 71/71 variables, and 74 constraints, problems are : Problem set: 0 solved, 47 unsolved in 1040 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 27/27 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 47 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (OVERLAPS) 1/27 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 4 (OVERLAPS) 43/70 variables, 27/41 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/70 variables, 32/73 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/70 variables, 47/120 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/70 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 8 (OVERLAPS) 1/71 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/71 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 10 (OVERLAPS) 0/71 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Int declared 71/71 variables, and 121 constraints, problems are : Problem set: 0 solved, 47 unsolved in 650 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 27/27 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 12/12 constraints]
After SMT, in 1703ms problems are : Problem set: 0 solved, 47 unsolved
Search for dead transitions found 0 dead transitions in 1705ms
Starting structural reductions in SI_LTL mode, iteration 1 : 27/86 places, 48/128 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1821 ms. Remains : 27/86 places, 48/128 transitions.
Stuttering acceptance computed with spot in 36 ms :[(AND p0 (NOT p2))]
Running random walk in product with property : StigmergyCommit-PT-02a-LTLFireability-06
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 0 ms.
FORMULA StigmergyCommit-PT-02a-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-02a-LTLFireability-06 finished in 1868 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(((p0&&G(p1)) U ((p2&&X(p3)) U p4)))))'
Support contains 8 out of 86 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 128/128 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 78 transition count 118
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 78 transition count 118
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 78 transition count 116
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 23 place count 73 transition count 110
Iterating global reduction 1 with 5 rules applied. Total rules applied 28 place count 73 transition count 110
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 29 place count 73 transition count 109
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 30 place count 72 transition count 108
Iterating global reduction 2 with 1 rules applied. Total rules applied 31 place count 72 transition count 108
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 32 place count 71 transition count 107
Iterating global reduction 2 with 1 rules applied. Total rules applied 33 place count 71 transition count 107
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 34 place count 71 transition count 106
Applied a total of 34 rules in 10 ms. Remains 71 /86 variables (removed 15) and now considering 106/128 (removed 22) transitions.
[2024-06-01 07:43:58] [INFO ] Flow matrix only has 102 transitions (discarded 4 similar events)
// Phase 1: matrix 102 rows 71 cols
[2024-06-01 07:43:58] [INFO ] Computed 2 invariants in 2 ms
[2024-06-01 07:43:58] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-06-01 07:43:58] [INFO ] Flow matrix only has 102 transitions (discarded 4 similar events)
[2024-06-01 07:43:58] [INFO ] Invariant cache hit.
[2024-06-01 07:43:58] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-06-01 07:43:58] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
Running 105 sub problems to find dead transitions.
[2024-06-01 07:43:58] [INFO ] Flow matrix only has 102 transitions (discarded 4 similar events)
[2024-06-01 07:43:58] [INFO ] Invariant cache hit.
[2024-06-01 07:43:58] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (OVERLAPS) 1/71 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-06-01 07:43:59] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 1 ms to minimize.
[2024-06-01 07:43:59] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 0 ms to minimize.
[2024-06-01 07:43:59] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 0 ms to minimize.
[2024-06-01 07:43:59] [INFO ] Deduced a trap composed of 15 places in 21 ms of which 0 ms to minimize.
[2024-06-01 07:43:59] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 1 ms to minimize.
[2024-06-01 07:43:59] [INFO ] Deduced a trap composed of 25 places in 16 ms of which 1 ms to minimize.
[2024-06-01 07:43:59] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 0 ms to minimize.
[2024-06-01 07:43:59] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:43:59] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 0 ms to minimize.
[2024-06-01 07:43:59] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 0 ms to minimize.
[2024-06-01 07:43:59] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 0 ms to minimize.
[2024-06-01 07:43:59] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
[2024-06-01 07:43:59] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-06-01 07:43:59] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 1 ms to minimize.
[2024-06-01 07:43:59] [INFO ] Deduced a trap composed of 26 places in 26 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 15/17 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-06-01 07:43:59] [INFO ] Deduced a trap composed of 23 places in 21 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (OVERLAPS) 101/172 variables, 71/89 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/172 variables, 43/132 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/172 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 8 (OVERLAPS) 1/173 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/173 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-06-01 07:44:01] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 0 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/173 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/173 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 12 (OVERLAPS) 0/173 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Real declared 173/173 variables, and 134 constraints, problems are : Problem set: 0 solved, 105 unsolved in 4530 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 71/71 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 105 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (OVERLAPS) 1/71 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (OVERLAPS) 101/172 variables, 71/90 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/172 variables, 43/133 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/172 variables, 105/238 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/172 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 8 (OVERLAPS) 1/173 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/173 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 10 (OVERLAPS) 0/173 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Int declared 173/173 variables, and 239 constraints, problems are : Problem set: 0 solved, 105 unsolved in 2355 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 71/71 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 17/17 constraints]
After SMT, in 6904ms problems are : Problem set: 0 solved, 105 unsolved
Search for dead transitions found 0 dead transitions in 6905ms
Starting structural reductions in LTL mode, iteration 1 : 71/86 places, 106/128 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7019 ms. Remains : 71/86 places, 106/128 transitions.
Stuttering acceptance computed with spot in 328 ms :[(NOT p4), (NOT p4), (NOT p4), true, (NOT p1), (OR (NOT p4) (NOT p3)), (OR (AND (NOT p1) (NOT p3) p4) (AND (NOT p1) p2 (NOT p3)))]
Running random walk in product with property : StigmergyCommit-PT-02a-LTLFireability-07
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA StigmergyCommit-PT-02a-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-02a-LTLFireability-07 finished in 7370 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 86 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 86/86 places, 128/128 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 53 rules applied. Total rules applied 53 place count 84 transition count 75
Reduce places removed 52 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 65 rules applied. Total rules applied 118 place count 32 transition count 62
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 8 rules applied. Total rules applied 126 place count 29 transition count 57
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 129 place count 27 transition count 56
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 129 place count 27 transition count 52
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 137 place count 23 transition count 52
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 139 place count 21 transition count 49
Iterating global reduction 4 with 2 rules applied. Total rules applied 141 place count 21 transition count 49
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 142 place count 21 transition count 48
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 142 place count 21 transition count 47
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 144 place count 20 transition count 47
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 145 place count 19 transition count 45
Iterating global reduction 5 with 1 rules applied. Total rules applied 146 place count 19 transition count 45
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 148 place count 19 transition count 43
Performed 4 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 156 place count 15 transition count 38
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 159 place count 15 transition count 35
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 7 with 6 rules applied. Total rules applied 165 place count 12 transition count 39
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 7 with 10 rules applied. Total rules applied 175 place count 12 transition count 29
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 8 with 6 rules applied. Total rules applied 181 place count 12 transition count 23
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 8 with 3 rules applied. Total rules applied 184 place count 9 transition count 20
Applied a total of 184 rules in 17 ms. Remains 9 /86 variables (removed 77) and now considering 20/128 (removed 108) transitions.
[2024-06-01 07:44:05] [INFO ] Flow matrix only has 16 transitions (discarded 4 similar events)
// Phase 1: matrix 16 rows 9 cols
[2024-06-01 07:44:05] [INFO ] Computed 1 invariants in 0 ms
[2024-06-01 07:44:06] [INFO ] Implicit Places using invariants in 14 ms returned []
[2024-06-01 07:44:06] [INFO ] Flow matrix only has 16 transitions (discarded 4 similar events)
[2024-06-01 07:44:06] [INFO ] Invariant cache hit.
[2024-06-01 07:44:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 07:44:06] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
[2024-06-01 07:44:06] [INFO ] Redundant transitions in 0 ms returned []
Running 11 sub problems to find dead transitions.
[2024-06-01 07:44:06] [INFO ] Flow matrix only has 16 transitions (discarded 4 similar events)
[2024-06-01 07:44:06] [INFO ] Invariant cache hit.
[2024-06-01 07:44:06] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 3/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-06-01 07:44:06] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-06-01 07:44:06] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-06-01 07:44:06] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-06-01 07:44:06] [INFO ] Deduced a trap composed of 5 places in 14 ms of which 0 ms to minimize.
[2024-06-01 07:44:06] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 15/24 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-06-01 07:44:06] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/24 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/24 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 1/25 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/25 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (OVERLAPS) 0/25 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 25/25 variables, and 17 constraints, problems are : Problem set: 0 solved, 11 unsolved in 218 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 9/9 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 3/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 15/24 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/24 variables, 11/27 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/24 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 1/25 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/25 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (OVERLAPS) 0/25 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 25/25 variables, and 28 constraints, problems are : Problem set: 0 solved, 11 unsolved in 94 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 9/9 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 6/6 constraints]
After SMT, in 315ms problems are : Problem set: 0 solved, 11 unsolved
Search for dead transitions found 0 dead transitions in 315ms
Starting structural reductions in SI_LTL mode, iteration 1 : 9/86 places, 20/128 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 380 ms. Remains : 9/86 places, 20/128 transitions.
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-02a-LTLFireability-08
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA StigmergyCommit-PT-02a-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-02a-LTLFireability-08 finished in 417 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 86 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 86/86 places, 128/128 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 5 rules applied. Total rules applied 5 place count 86 transition count 123
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 13 place count 81 transition count 120
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 13 place count 81 transition count 102
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 49 place count 63 transition count 102
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 55 place count 57 transition count 94
Iterating global reduction 2 with 6 rules applied. Total rules applied 61 place count 57 transition count 94
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 66 place count 52 transition count 87
Iterating global reduction 2 with 5 rules applied. Total rules applied 71 place count 52 transition count 87
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 72 place count 52 transition count 86
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 76 place count 48 transition count 82
Iterating global reduction 3 with 4 rules applied. Total rules applied 80 place count 48 transition count 82
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 85 place count 48 transition count 77
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 109 place count 36 transition count 65
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 112 place count 36 transition count 62
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 117 place count 31 transition count 57
Iterating global reduction 5 with 5 rules applied. Total rules applied 122 place count 31 transition count 57
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 126 place count 31 transition count 53
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 130 place count 27 transition count 49
Iterating global reduction 6 with 4 rules applied. Total rules applied 134 place count 27 transition count 49
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 135 place count 27 transition count 48
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 138 place count 24 transition count 45
Iterating global reduction 7 with 3 rules applied. Total rules applied 141 place count 24 transition count 45
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 7 with 2 rules applied. Total rules applied 143 place count 23 transition count 44
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 7 with 4 rules applied. Total rules applied 147 place count 23 transition count 40
Partial Post-agglomeration rule applied 4 times.
Drop transitions (Partial Post agglomeration) removed 4 transitions
Iterating global reduction 7 with 4 rules applied. Total rules applied 151 place count 23 transition count 40
Applied a total of 151 rules in 14 ms. Remains 23 /86 variables (removed 63) and now considering 40/128 (removed 88) transitions.
[2024-06-01 07:44:06] [INFO ] Flow matrix only has 36 transitions (discarded 4 similar events)
// Phase 1: matrix 36 rows 23 cols
[2024-06-01 07:44:06] [INFO ] Computed 2 invariants in 1 ms
[2024-06-01 07:44:06] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-06-01 07:44:06] [INFO ] Flow matrix only has 36 transitions (discarded 4 similar events)
[2024-06-01 07:44:06] [INFO ] Invariant cache hit.
[2024-06-01 07:44:06] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-06-01 07:44:06] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
[2024-06-01 07:44:06] [INFO ] Redundant transitions in 0 ms returned []
Running 39 sub problems to find dead transitions.
[2024-06-01 07:44:06] [INFO ] Flow matrix only has 36 transitions (discarded 4 similar events)
[2024-06-01 07:44:06] [INFO ] Invariant cache hit.
[2024-06-01 07:44:06] [INFO ] State equation strengthened by 30 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (OVERLAPS) 1/23 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-06-01 07:44:06] [INFO ] Deduced a trap composed of 8 places in 19 ms of which 0 ms to minimize.
[2024-06-01 07:44:06] [INFO ] Deduced a trap composed of 8 places in 13 ms of which 0 ms to minimize.
[2024-06-01 07:44:06] [INFO ] Deduced a trap composed of 8 places in 16 ms of which 0 ms to minimize.
[2024-06-01 07:44:06] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 1 ms to minimize.
[2024-06-01 07:44:06] [INFO ] Deduced a trap composed of 8 places in 18 ms of which 1 ms to minimize.
[2024-06-01 07:44:06] [INFO ] Deduced a trap composed of 8 places in 19 ms of which 1 ms to minimize.
[2024-06-01 07:44:06] [INFO ] Deduced a trap composed of 8 places in 13 ms of which 1 ms to minimize.
[2024-06-01 07:44:06] [INFO ] Deduced a trap composed of 8 places in 16 ms of which 0 ms to minimize.
[2024-06-01 07:44:06] [INFO ] Deduced a trap composed of 10 places in 18 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-06-01 07:44:06] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/23 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (OVERLAPS) 35/58 variables, 23/35 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/58 variables, 29/64 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/58 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 8 (OVERLAPS) 1/59 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/59 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 10 (OVERLAPS) 0/59 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Real declared 59/59 variables, and 65 constraints, problems are : Problem set: 0 solved, 39 unsolved in 702 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 23/23 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 39 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (OVERLAPS) 1/23 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/23 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (OVERLAPS) 35/58 variables, 23/35 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 29/64 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/58 variables, 39/103 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/58 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 8 (OVERLAPS) 1/59 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/59 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 10 (OVERLAPS) 0/59 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Int declared 59/59 variables, and 104 constraints, problems are : Problem set: 0 solved, 39 unsolved in 514 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 23/23 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 10/10 constraints]
After SMT, in 1235ms problems are : Problem set: 0 solved, 39 unsolved
Search for dead transitions found 0 dead transitions in 1237ms
Starting structural reductions in SI_LTL mode, iteration 1 : 23/86 places, 40/128 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1334 ms. Remains : 23/86 places, 40/128 transitions.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-02a-LTLFireability-11
Product exploration explored 100000 steps with 0 reset in 86 ms.
Product exploration explored 100000 steps with 0 reset in 73 ms.
Computed a total of 2 stabilizing places and 1 stable transitions
Computed a total of 2 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 72 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
RANDOM walk for 199 steps (8 resets) in 4 ms. (39 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 95 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Support contains 2 out of 23 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 23/23 places, 40/40 transitions.
Applied a total of 0 rules in 2 ms. Remains 23 /23 variables (removed 0) and now considering 40/40 (removed 0) transitions.
[2024-06-01 07:44:08] [INFO ] Flow matrix only has 36 transitions (discarded 4 similar events)
[2024-06-01 07:44:08] [INFO ] Invariant cache hit.
[2024-06-01 07:44:08] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-06-01 07:44:08] [INFO ] Flow matrix only has 36 transitions (discarded 4 similar events)
[2024-06-01 07:44:08] [INFO ] Invariant cache hit.
[2024-06-01 07:44:08] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-06-01 07:44:08] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
[2024-06-01 07:44:08] [INFO ] Redundant transitions in 0 ms returned []
Running 39 sub problems to find dead transitions.
[2024-06-01 07:44:08] [INFO ] Flow matrix only has 36 transitions (discarded 4 similar events)
[2024-06-01 07:44:08] [INFO ] Invariant cache hit.
[2024-06-01 07:44:08] [INFO ] State equation strengthened by 30 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (OVERLAPS) 1/23 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-06-01 07:44:08] [INFO ] Deduced a trap composed of 8 places in 14 ms of which 1 ms to minimize.
[2024-06-01 07:44:08] [INFO ] Deduced a trap composed of 8 places in 13 ms of which 0 ms to minimize.
[2024-06-01 07:44:08] [INFO ] Deduced a trap composed of 8 places in 17 ms of which 0 ms to minimize.
[2024-06-01 07:44:08] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 1 ms to minimize.
[2024-06-01 07:44:08] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 1 ms to minimize.
[2024-06-01 07:44:08] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 0 ms to minimize.
[2024-06-01 07:44:08] [INFO ] Deduced a trap composed of 8 places in 16 ms of which 0 ms to minimize.
[2024-06-01 07:44:08] [INFO ] Deduced a trap composed of 8 places in 18 ms of which 0 ms to minimize.
[2024-06-01 07:44:08] [INFO ] Deduced a trap composed of 10 places in 14 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-06-01 07:44:08] [INFO ] Deduced a trap composed of 8 places in 16 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/23 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (OVERLAPS) 35/58 variables, 23/35 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/58 variables, 29/64 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/58 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 8 (OVERLAPS) 1/59 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/59 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 10 (OVERLAPS) 0/59 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Real declared 59/59 variables, and 65 constraints, problems are : Problem set: 0 solved, 39 unsolved in 691 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 23/23 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 39 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (OVERLAPS) 1/23 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/23 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (OVERLAPS) 35/58 variables, 23/35 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 29/64 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/58 variables, 39/103 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/58 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 8 (OVERLAPS) 1/59 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/59 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 10 (OVERLAPS) 0/59 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Int declared 59/59 variables, and 104 constraints, problems are : Problem set: 0 solved, 39 unsolved in 530 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 23/23 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 10/10 constraints]
After SMT, in 1232ms problems are : Problem set: 0 solved, 39 unsolved
Search for dead transitions found 0 dead transitions in 1233ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1322 ms. Remains : 23/23 places, 40/40 transitions.
Computed a total of 2 stabilizing places and 1 stable transitions
Computed a total of 2 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 66 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
RANDOM walk for 424 steps (14 resets) in 4 ms. (84 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 74 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 41 ms.
Product exploration explored 100000 steps with 0 reset in 41 ms.
Support contains 2 out of 23 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 23/23 places, 40/40 transitions.
Applied a total of 0 rules in 4 ms. Remains 23 /23 variables (removed 0) and now considering 40/40 (removed 0) transitions.
[2024-06-01 07:44:09] [INFO ] Flow matrix only has 36 transitions (discarded 4 similar events)
[2024-06-01 07:44:09] [INFO ] Invariant cache hit.
[2024-06-01 07:44:09] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-06-01 07:44:09] [INFO ] Flow matrix only has 36 transitions (discarded 4 similar events)
[2024-06-01 07:44:09] [INFO ] Invariant cache hit.
[2024-06-01 07:44:09] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-06-01 07:44:09] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
[2024-06-01 07:44:09] [INFO ] Redundant transitions in 1 ms returned []
Running 39 sub problems to find dead transitions.
[2024-06-01 07:44:09] [INFO ] Flow matrix only has 36 transitions (discarded 4 similar events)
[2024-06-01 07:44:09] [INFO ] Invariant cache hit.
[2024-06-01 07:44:09] [INFO ] State equation strengthened by 30 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (OVERLAPS) 1/23 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-06-01 07:44:10] [INFO ] Deduced a trap composed of 8 places in 14 ms of which 0 ms to minimize.
[2024-06-01 07:44:10] [INFO ] Deduced a trap composed of 8 places in 16 ms of which 1 ms to minimize.
[2024-06-01 07:44:10] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 0 ms to minimize.
[2024-06-01 07:44:10] [INFO ] Deduced a trap composed of 8 places in 18 ms of which 1 ms to minimize.
[2024-06-01 07:44:10] [INFO ] Deduced a trap composed of 8 places in 18 ms of which 0 ms to minimize.
[2024-06-01 07:44:10] [INFO ] Deduced a trap composed of 8 places in 16 ms of which 0 ms to minimize.
[2024-06-01 07:44:10] [INFO ] Deduced a trap composed of 8 places in 16 ms of which 0 ms to minimize.
[2024-06-01 07:44:10] [INFO ] Deduced a trap composed of 8 places in 16 ms of which 1 ms to minimize.
[2024-06-01 07:44:10] [INFO ] Deduced a trap composed of 10 places in 14 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-06-01 07:44:10] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/23 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (OVERLAPS) 35/58 variables, 23/35 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/58 variables, 29/64 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/58 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 8 (OVERLAPS) 1/59 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/59 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 10 (OVERLAPS) 0/59 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Real declared 59/59 variables, and 65 constraints, problems are : Problem set: 0 solved, 39 unsolved in 684 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 23/23 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 39 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (OVERLAPS) 1/23 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/23 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (OVERLAPS) 35/58 variables, 23/35 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 29/64 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/58 variables, 39/103 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/58 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 8 (OVERLAPS) 1/59 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/59 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 10 (OVERLAPS) 0/59 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Int declared 59/59 variables, and 104 constraints, problems are : Problem set: 0 solved, 39 unsolved in 541 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 23/23 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 10/10 constraints]
After SMT, in 1234ms problems are : Problem set: 0 solved, 39 unsolved
Search for dead transitions found 0 dead transitions in 1235ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1316 ms. Remains : 23/23 places, 40/40 transitions.
Treatment of property StigmergyCommit-PT-02a-LTLFireability-11 finished in 4863 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((X((X(G(p2))&&p1))&&p0))))'
Support contains 6 out of 86 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 128/128 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 77 transition count 117
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 77 transition count 117
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 20 place count 77 transition count 115
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 27 place count 70 transition count 106
Iterating global reduction 1 with 7 rules applied. Total rules applied 34 place count 70 transition count 106
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 35 place count 70 transition count 105
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 38 place count 67 transition count 102
Iterating global reduction 2 with 3 rules applied. Total rules applied 41 place count 67 transition count 102
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 44 place count 64 transition count 99
Iterating global reduction 2 with 3 rules applied. Total rules applied 47 place count 64 transition count 99
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 49 place count 64 transition count 97
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 50 place count 63 transition count 96
Iterating global reduction 3 with 1 rules applied. Total rules applied 51 place count 63 transition count 96
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 52 place count 63 transition count 95
Applied a total of 52 rules in 9 ms. Remains 63 /86 variables (removed 23) and now considering 95/128 (removed 33) transitions.
[2024-06-01 07:44:11] [INFO ] Flow matrix only has 91 transitions (discarded 4 similar events)
// Phase 1: matrix 91 rows 63 cols
[2024-06-01 07:44:11] [INFO ] Computed 2 invariants in 1 ms
[2024-06-01 07:44:11] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-06-01 07:44:11] [INFO ] Flow matrix only has 91 transitions (discarded 4 similar events)
[2024-06-01 07:44:11] [INFO ] Invariant cache hit.
[2024-06-01 07:44:11] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-01 07:44:11] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
Running 94 sub problems to find dead transitions.
[2024-06-01 07:44:11] [INFO ] Flow matrix only has 91 transitions (discarded 4 similar events)
[2024-06-01 07:44:11] [INFO ] Invariant cache hit.
[2024-06-01 07:44:11] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-06-01 07:44:11] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:44:11] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 0 ms to minimize.
[2024-06-01 07:44:11] [INFO ] Deduced a trap composed of 14 places in 19 ms of which 1 ms to minimize.
[2024-06-01 07:44:11] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 0 ms to minimize.
[2024-06-01 07:44:11] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:44:11] [INFO ] Deduced a trap composed of 16 places in 21 ms of which 0 ms to minimize.
[2024-06-01 07:44:11] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:44:11] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 1 ms to minimize.
[2024-06-01 07:44:11] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
[2024-06-01 07:44:12] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 1 ms to minimize.
[2024-06-01 07:44:12] [INFO ] Deduced a trap composed of 22 places in 16 ms of which 1 ms to minimize.
[2024-06-01 07:44:12] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 1 ms to minimize.
[2024-06-01 07:44:12] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 1 ms to minimize.
[2024-06-01 07:44:12] [INFO ] Deduced a trap composed of 22 places in 16 ms of which 1 ms to minimize.
[2024-06-01 07:44:12] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 15/17 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 4 (OVERLAPS) 90/153 variables, 63/80 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/153 variables, 39/119 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-06-01 07:44:12] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/153 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/153 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 8 (OVERLAPS) 1/154 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/154 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 10 (OVERLAPS) 0/154 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 94 unsolved
No progress, stopping.
After SMT solving in domain Real declared 154/154 variables, and 121 constraints, problems are : Problem set: 0 solved, 94 unsolved in 2958 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 63/63 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 94/94 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 94 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-06-01 07:44:14] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-06-01 07:44:14] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 6 (OVERLAPS) 90/153 variables, 63/83 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/153 variables, 39/122 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/153 variables, 94/216 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/153 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 10 (OVERLAPS) 1/154 variables, 1/217 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/154 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 12 (OVERLAPS) 0/154 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 94 unsolved
No progress, stopping.
After SMT solving in domain Int declared 154/154 variables, and 217 constraints, problems are : Problem set: 0 solved, 94 unsolved in 2446 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 63/63 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 94/94 constraints, Known Traps: 18/18 constraints]
After SMT, in 5428ms problems are : Problem set: 0 solved, 94 unsolved
Search for dead transitions found 0 dead transitions in 5430ms
Starting structural reductions in LTL mode, iteration 1 : 63/86 places, 95/128 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5537 ms. Remains : 63/86 places, 95/128 transitions.
Stuttering acceptance computed with spot in 223 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p2), (NOT p2)]
Running random walk in product with property : StigmergyCommit-PT-02a-LTLFireability-12
Stuttering criterion allowed to conclude after 21 steps with 0 reset in 0 ms.
FORMULA StigmergyCommit-PT-02a-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-02a-LTLFireability-12 finished in 5791 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(((p1||F(G(p2)))&&p0))))'
Support contains 4 out of 86 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 128/128 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 78 transition count 118
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 78 transition count 118
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 78 transition count 116
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 24 place count 72 transition count 108
Iterating global reduction 1 with 6 rules applied. Total rules applied 30 place count 72 transition count 108
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 33 place count 69 transition count 105
Iterating global reduction 1 with 3 rules applied. Total rules applied 36 place count 69 transition count 105
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 39 place count 66 transition count 102
Iterating global reduction 1 with 3 rules applied. Total rules applied 42 place count 66 transition count 102
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 44 place count 66 transition count 100
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 45 place count 65 transition count 99
Iterating global reduction 2 with 1 rules applied. Total rules applied 46 place count 65 transition count 99
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 47 place count 65 transition count 98
Applied a total of 47 rules in 11 ms. Remains 65 /86 variables (removed 21) and now considering 98/128 (removed 30) transitions.
[2024-06-01 07:44:17] [INFO ] Flow matrix only has 94 transitions (discarded 4 similar events)
// Phase 1: matrix 94 rows 65 cols
[2024-06-01 07:44:17] [INFO ] Computed 2 invariants in 1 ms
[2024-06-01 07:44:17] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-06-01 07:44:17] [INFO ] Flow matrix only has 94 transitions (discarded 4 similar events)
[2024-06-01 07:44:17] [INFO ] Invariant cache hit.
[2024-06-01 07:44:17] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-06-01 07:44:17] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
Running 97 sub problems to find dead transitions.
[2024-06-01 07:44:17] [INFO ] Flow matrix only has 94 transitions (discarded 4 similar events)
[2024-06-01 07:44:17] [INFO ] Invariant cache hit.
[2024-06-01 07:44:17] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (OVERLAPS) 1/65 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-06-01 07:44:17] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 0 ms to minimize.
[2024-06-01 07:44:17] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:44:17] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
[2024-06-01 07:44:17] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 0 ms to minimize.
[2024-06-01 07:44:17] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 1 ms to minimize.
[2024-06-01 07:44:17] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2024-06-01 07:44:17] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 0 ms to minimize.
[2024-06-01 07:44:17] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 0 ms to minimize.
[2024-06-01 07:44:17] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 0 ms to minimize.
[2024-06-01 07:44:17] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 1 ms to minimize.
[2024-06-01 07:44:17] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:44:17] [INFO ] Deduced a trap composed of 22 places in 17 ms of which 1 ms to minimize.
[2024-06-01 07:44:17] [INFO ] Deduced a trap composed of 22 places in 20 ms of which 0 ms to minimize.
[2024-06-01 07:44:17] [INFO ] Deduced a trap composed of 24 places in 23 ms of which 1 ms to minimize.
[2024-06-01 07:44:17] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 15/17 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-06-01 07:44:18] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (OVERLAPS) 93/158 variables, 65/83 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 40/123 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-06-01 07:44:18] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/158 variables, 1/124 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/158 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 9 (OVERLAPS) 1/159 variables, 1/125 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/159 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 11 (OVERLAPS) 0/159 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Real declared 159/159 variables, and 125 constraints, problems are : Problem set: 0 solved, 97 unsolved in 3241 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 65/65 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 97 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (OVERLAPS) 1/65 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-06-01 07:44:20] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-06-01 07:44:20] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-06-01 07:44:21] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (OVERLAPS) 93/158 variables, 65/87 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/158 variables, 40/127 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/158 variables, 97/224 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/158 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 11 (OVERLAPS) 1/159 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/159 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 13 (OVERLAPS) 0/159 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Int declared 159/159 variables, and 225 constraints, problems are : Problem set: 0 solved, 97 unsolved in 2821 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 65/65 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 20/20 constraints]
After SMT, in 6081ms problems are : Problem set: 0 solved, 97 unsolved
Search for dead transitions found 0 dead transitions in 6081ms
Starting structural reductions in LTL mode, iteration 1 : 65/86 places, 98/128 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6205 ms. Remains : 65/86 places, 98/128 transitions.
Stuttering acceptance computed with spot in 127 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (NOT p2)]
Running random walk in product with property : StigmergyCommit-PT-02a-LTLFireability-13
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA StigmergyCommit-PT-02a-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-02a-LTLFireability-13 finished in 6347 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((!(X((F(X(p0)) U p1))||X(p2)) U !p2))))'
Support contains 4 out of 86 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 128/128 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 79 transition count 119
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 79 transition count 119
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 16 place count 79 transition count 117
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 21 place count 74 transition count 110
Iterating global reduction 1 with 5 rules applied. Total rules applied 26 place count 74 transition count 110
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 27 place count 74 transition count 109
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 28 place count 73 transition count 108
Iterating global reduction 2 with 1 rules applied. Total rules applied 29 place count 73 transition count 108
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 30 place count 72 transition count 107
Iterating global reduction 2 with 1 rules applied. Total rules applied 31 place count 72 transition count 107
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 32 place count 72 transition count 106
Applied a total of 32 rules in 5 ms. Remains 72 /86 variables (removed 14) and now considering 106/128 (removed 22) transitions.
[2024-06-01 07:44:23] [INFO ] Flow matrix only has 102 transitions (discarded 4 similar events)
// Phase 1: matrix 102 rows 72 cols
[2024-06-01 07:44:23] [INFO ] Computed 2 invariants in 1 ms
[2024-06-01 07:44:23] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-06-01 07:44:23] [INFO ] Flow matrix only has 102 transitions (discarded 4 similar events)
[2024-06-01 07:44:23] [INFO ] Invariant cache hit.
[2024-06-01 07:44:23] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-06-01 07:44:23] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
Running 105 sub problems to find dead transitions.
[2024-06-01 07:44:23] [INFO ] Flow matrix only has 102 transitions (discarded 4 similar events)
[2024-06-01 07:44:23] [INFO ] Invariant cache hit.
[2024-06-01 07:44:23] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (OVERLAPS) 1/72 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-06-01 07:44:23] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 0 ms to minimize.
[2024-06-01 07:44:23] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 1 ms to minimize.
[2024-06-01 07:44:23] [INFO ] Deduced a trap composed of 26 places in 19 ms of which 0 ms to minimize.
[2024-06-01 07:44:23] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
[2024-06-01 07:44:23] [INFO ] Deduced a trap composed of 27 places in 22 ms of which 1 ms to minimize.
[2024-06-01 07:44:23] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 0 ms to minimize.
[2024-06-01 07:44:24] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 1 ms to minimize.
[2024-06-01 07:44:24] [INFO ] Deduced a trap composed of 22 places in 24 ms of which 0 ms to minimize.
[2024-06-01 07:44:24] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-06-01 07:44:24] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2024-06-01 07:44:24] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
[2024-06-01 07:44:24] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 1 ms to minimize.
[2024-06-01 07:44:24] [INFO ] Deduced a trap composed of 18 places in 19 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-06-01 07:44:24] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:44:24] [INFO ] Deduced a trap composed of 16 places in 20 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (OVERLAPS) 101/173 variables, 72/89 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/173 variables, 44/133 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/173 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 8 (OVERLAPS) 1/174 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/174 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 10 (OVERLAPS) 0/174 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Real declared 174/174 variables, and 134 constraints, problems are : Problem set: 0 solved, 105 unsolved in 3225 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 72/72 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 105 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (OVERLAPS) 1/72 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 15/17 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (OVERLAPS) 101/173 variables, 72/89 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/173 variables, 44/133 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/173 variables, 105/238 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/173 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 8 (OVERLAPS) 1/174 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/174 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 10 (OVERLAPS) 0/174 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Int declared 174/174 variables, and 239 constraints, problems are : Problem set: 0 solved, 105 unsolved in 2523 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 72/72 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 15/15 constraints]
After SMT, in 5763ms problems are : Problem set: 0 solved, 105 unsolved
Search for dead transitions found 0 dead transitions in 5765ms
Starting structural reductions in LTL mode, iteration 1 : 72/86 places, 106/128 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5858 ms. Remains : 72/86 places, 106/128 transitions.
Stuttering acceptance computed with spot in 235 ms :[true, p2, (OR p2 p1), p0, (AND p0 p1), p2, p2]
Running random walk in product with property : StigmergyCommit-PT-02a-LTLFireability-14
Product exploration explored 100000 steps with 33333 reset in 85 ms.
Product exploration explored 100000 steps with 33333 reset in 77 ms.
Computed a total of 20 stabilizing places and 19 stable transitions
Computed a total of 20 stabilizing places and 19 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (X (NOT p2)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 16 ms. Reduced automaton from 7 states, 11 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA StigmergyCommit-PT-02a-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyCommit-PT-02a-LTLFireability-14 finished in 6289 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((p0||G(F(p1))))))'
Support contains 3 out of 86 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 128/128 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 77 transition count 117
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 77 transition count 117
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 20 place count 77 transition count 115
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 26 place count 71 transition count 108
Iterating global reduction 1 with 6 rules applied. Total rules applied 32 place count 71 transition count 108
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 33 place count 71 transition count 107
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 36 place count 68 transition count 104
Iterating global reduction 2 with 3 rules applied. Total rules applied 39 place count 68 transition count 104
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 42 place count 65 transition count 101
Iterating global reduction 2 with 3 rules applied. Total rules applied 45 place count 65 transition count 101
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 47 place count 65 transition count 99
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 48 place count 64 transition count 98
Iterating global reduction 3 with 1 rules applied. Total rules applied 49 place count 64 transition count 98
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 50 place count 64 transition count 97
Applied a total of 50 rules in 8 ms. Remains 64 /86 variables (removed 22) and now considering 97/128 (removed 31) transitions.
[2024-06-01 07:44:29] [INFO ] Flow matrix only has 93 transitions (discarded 4 similar events)
// Phase 1: matrix 93 rows 64 cols
[2024-06-01 07:44:29] [INFO ] Computed 2 invariants in 1 ms
[2024-06-01 07:44:29] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-06-01 07:44:29] [INFO ] Flow matrix only has 93 transitions (discarded 4 similar events)
[2024-06-01 07:44:29] [INFO ] Invariant cache hit.
[2024-06-01 07:44:29] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-01 07:44:29] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
Running 96 sub problems to find dead transitions.
[2024-06-01 07:44:29] [INFO ] Flow matrix only has 93 transitions (discarded 4 similar events)
[2024-06-01 07:44:29] [INFO ] Invariant cache hit.
[2024-06-01 07:44:29] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-06-01 07:44:30] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 0 ms to minimize.
[2024-06-01 07:44:30] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 1 ms to minimize.
[2024-06-01 07:44:30] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 0 ms to minimize.
[2024-06-01 07:44:30] [INFO ] Deduced a trap composed of 14 places in 19 ms of which 1 ms to minimize.
[2024-06-01 07:44:30] [INFO ] Deduced a trap composed of 22 places in 15 ms of which 0 ms to minimize.
[2024-06-01 07:44:30] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 0 ms to minimize.
[2024-06-01 07:44:30] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 1 ms to minimize.
[2024-06-01 07:44:30] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
[2024-06-01 07:44:30] [INFO ] Deduced a trap composed of 23 places in 16 ms of which 1 ms to minimize.
[2024-06-01 07:44:30] [INFO ] Deduced a trap composed of 22 places in 19 ms of which 0 ms to minimize.
[2024-06-01 07:44:30] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
[2024-06-01 07:44:30] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 0 ms to minimize.
[2024-06-01 07:44:30] [INFO ] Deduced a trap composed of 16 places in 21 ms of which 1 ms to minimize.
[2024-06-01 07:44:30] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 1 ms to minimize.
[2024-06-01 07:44:30] [INFO ] Deduced a trap composed of 15 places in 22 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 15/17 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (OVERLAPS) 92/156 variables, 64/81 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 39/120 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-06-01 07:44:31] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/156 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/156 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 8 (OVERLAPS) 1/157 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/157 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 10 (OVERLAPS) 0/157 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Real declared 157/157 variables, and 122 constraints, problems are : Problem set: 0 solved, 96 unsolved in 3011 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 64/64 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 96 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (OVERLAPS) 92/156 variables, 64/82 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 39/121 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/156 variables, 96/217 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/156 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 8 (OVERLAPS) 1/157 variables, 1/218 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/157 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 10 (OVERLAPS) 0/157 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Int declared 157/157 variables, and 218 constraints, problems are : Problem set: 0 solved, 96 unsolved in 2079 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 64/64 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 16/16 constraints]
After SMT, in 5107ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 5109ms
Starting structural reductions in LTL mode, iteration 1 : 64/86 places, 97/128 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5209 ms. Remains : 64/86 places, 97/128 transitions.
Stuttering acceptance computed with spot in 177 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : StigmergyCommit-PT-02a-LTLFireability-15
Stuttering criterion allowed to conclude after 21 steps with 0 reset in 1 ms.
FORMULA StigmergyCommit-PT-02a-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-02a-LTLFireability-15 finished in 5406 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((F(p0)||(X(!p1) U ((p2&&X(!p1))||X(G(!p1))))))))'
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||G(F(p1))) U X(G(p0))))'
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)))'
[2024-06-01 07:44:35] [INFO ] Flatten gal took : 19 ms
[2024-06-01 07:44:35] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-06-01 07:44:35] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 86 places, 128 transitions and 397 arcs took 3 ms.
Total runtime 69369 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA StigmergyCommit-PT-02a-LTLFireability-02 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA StigmergyCommit-PT-02a-LTLFireability-03 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA StigmergyCommit-PT-02a-LTLFireability-11 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717227876111

--------------------
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 StigmergyCommit-PT-02a-LTLFireability-02
ltl formula formula --ltl=/tmp/2114/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 86 places, 128 transitions and 397 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.030 real 0.000 user 0.000 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2114/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2114/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2114/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2114/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): There are 87 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 87, there are 185 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: 1655
pnml2lts-mc( 0/ 4): unique states count: 2109
pnml2lts-mc( 0/ 4): unique transitions count: 9743
pnml2lts-mc( 0/ 4): - self-loop count: 312
pnml2lts-mc( 0/ 4): - claim dead count: 6827
pnml2lts-mc( 0/ 4): - claim found count: 875
pnml2lts-mc( 0/ 4): - claim success count: 2281
pnml2lts-mc( 0/ 4): - cum. max stack depth: 121
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 2301 states 11232 transitions, fanout: 4.881
pnml2lts-mc( 0/ 4): Total exploration time 0.010 sec (0.000 sec minimum, 0.007 sec on average)
pnml2lts-mc( 0/ 4): States per second: 230100, Transitions per second: 1123200
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, 11.0 B/state, compr.: 3.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 128 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 StigmergyCommit-PT-02a-LTLFireability-03
ltl formula formula --ltl=/tmp/2114/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 86 places, 128 transitions and 397 arcs
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
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.040 real 0.000 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2114/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2114/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2114/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2114/ltl_1_
pnml2lts-mc( 0/ 4): There are 87 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 87, there are 139 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: 935
pnml2lts-mc( 0/ 4): unique states count: 1389
pnml2lts-mc( 0/ 4): unique transitions count: 3960
pnml2lts-mc( 0/ 4): - self-loop count: 256
pnml2lts-mc( 0/ 4): - claim dead count: 1497
pnml2lts-mc( 0/ 4): - claim found count: 834
pnml2lts-mc( 0/ 4): - claim success count: 1445
pnml2lts-mc( 0/ 4): - cum. max stack depth: 98
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 1447 states 4153 transitions, fanout: 2.870
pnml2lts-mc( 0/ 4): Total exploration time 0.010 sec (0.000 sec minimum, 0.007 sec on average)
pnml2lts-mc( 0/ 4): States per second: 144700, Transitions per second: 415300
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, 11.1 B/state, compr.: 3.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 128 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 StigmergyCommit-PT-02a-LTLFireability-11
ltl formula formula --ltl=/tmp/2114/ltl_2_
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 86 places, 128 transitions and 397 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2114/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2114/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2114/ltl_2_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.030 real 0.000 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2114/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): There are 87 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 87, there are 140 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( 3/ 4):
pnml2lts-mc( 3/ 4): Accepting cycle FOUND at depth ~25!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 1
pnml2lts-mc( 0/ 4): unique states count: 151
pnml2lts-mc( 0/ 4): unique transitions count: 403
pnml2lts-mc( 0/ 4): - self-loop count: 40
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 86
pnml2lts-mc( 0/ 4): - claim success count: 161
pnml2lts-mc( 0/ 4): - cum. max stack depth: 93
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 161 states 460 transitions, fanout: 2.857
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, 15.6 B/state, compr.: 4.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 128 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="StigmergyCommit-PT-02a"
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 StigmergyCommit-PT-02a, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r536-tall-171690531600092"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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