Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 7.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 76K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K 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 19K Apr 23 07:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.2K Apr 11 17:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 98K Apr 11 17:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Apr 11 17:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K Apr 11 17:46 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 98K 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-03a-LTLCardinality-00
FORMULA_NAME StigmergyCommit-PT-03a-LTLCardinality-01
FORMULA_NAME StigmergyCommit-PT-03a-LTLCardinality-02
FORMULA_NAME StigmergyCommit-PT-03a-LTLCardinality-03
FORMULA_NAME StigmergyCommit-PT-03a-LTLCardinality-04
FORMULA_NAME StigmergyCommit-PT-03a-LTLCardinality-05
FORMULA_NAME StigmergyCommit-PT-03a-LTLCardinality-06
FORMULA_NAME StigmergyCommit-PT-03a-LTLCardinality-07
FORMULA_NAME StigmergyCommit-PT-03a-LTLCardinality-08
FORMULA_NAME StigmergyCommit-PT-03a-LTLCardinality-09
FORMULA_NAME StigmergyCommit-PT-03a-LTLCardinality-10
FORMULA_NAME StigmergyCommit-PT-03a-LTLCardinality-11
FORMULA_NAME StigmergyCommit-PT-03a-LTLCardinality-12
FORMULA_NAME StigmergyCommit-PT-03a-LTLCardinality-13
FORMULA_NAME StigmergyCommit-PT-03a-LTLCardinality-14
FORMULA_NAME StigmergyCommit-PT-03a-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716984674080

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyCommit-PT-03a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-05-29 12:11:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-29 12:11:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 12:11:15] [INFO ] Load time of PNML (sax parser for PT used): 77 ms
[2024-05-29 12:11:15] [INFO ] Transformed 148 places.
[2024-05-29 12:11:15] [INFO ] Transformed 332 transitions.
[2024-05-29 12:11:15] [INFO ] Found NUPN structural information;
[2024-05-29 12:11:15] [INFO ] Parsed PT model containing 148 places and 332 transitions and 1538 arcs in 175 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 7 formulas.
Ensure Unique test removed 110 transitions
Reduce redundant transitions removed 110 transitions.
FORMULA StigmergyCommit-PT-03a-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-03a-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-03a-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-03a-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-03a-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-03a-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-03a-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-03a-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-03a-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-03a-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 17 out of 148 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 148/148 places, 222/222 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 121 transition count 192
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 121 transition count 192
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 57 place count 121 transition count 189
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 69 place count 109 transition count 174
Iterating global reduction 1 with 12 rules applied. Total rules applied 81 place count 109 transition count 174
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 82 place count 109 transition count 173
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 84 place count 107 transition count 171
Iterating global reduction 2 with 2 rules applied. Total rules applied 86 place count 107 transition count 171
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 88 place count 105 transition count 169
Iterating global reduction 2 with 2 rules applied. Total rules applied 90 place count 105 transition count 169
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 92 place count 103 transition count 167
Iterating global reduction 2 with 2 rules applied. Total rules applied 94 place count 103 transition count 167
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 95 place count 102 transition count 166
Iterating global reduction 2 with 1 rules applied. Total rules applied 96 place count 102 transition count 166
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 97 place count 102 transition count 165
Applied a total of 97 rules in 54 ms. Remains 102 /148 variables (removed 46) and now considering 165/222 (removed 57) transitions.
[2024-05-29 12:11:15] [INFO ] Flow matrix only has 158 transitions (discarded 7 similar events)
// Phase 1: matrix 158 rows 102 cols
[2024-05-29 12:11:15] [INFO ] Computed 3 invariants in 23 ms
[2024-05-29 12:11:15] [INFO ] Implicit Places using invariants in 231 ms returned []
[2024-05-29 12:11:15] [INFO ] Flow matrix only has 158 transitions (discarded 7 similar events)
[2024-05-29 12:11:15] [INFO ] Invariant cache hit.
[2024-05-29 12:11:15] [INFO ] State equation strengthened by 74 read => feed constraints.
[2024-05-29 12:11:16] [INFO ] Implicit Places using invariants and state equation in 164 ms returned [101]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 423 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 101/148 places, 165/222 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 92 transition count 156
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 92 transition count 156
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 22 place count 92 transition count 152
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 24 place count 90 transition count 150
Iterating global reduction 1 with 2 rules applied. Total rules applied 26 place count 90 transition count 150
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 28 place count 88 transition count 148
Iterating global reduction 1 with 2 rules applied. Total rules applied 30 place count 88 transition count 148
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 87 transition count 147
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 87 transition count 147
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 33 place count 86 transition count 146
Iterating global reduction 1 with 1 rules applied. Total rules applied 34 place count 86 transition count 146
Applied a total of 34 rules in 11 ms. Remains 86 /101 variables (removed 15) and now considering 146/165 (removed 19) transitions.
[2024-05-29 12:11:16] [INFO ] Flow matrix only has 139 transitions (discarded 7 similar events)
// Phase 1: matrix 139 rows 86 cols
[2024-05-29 12:11:16] [INFO ] Computed 2 invariants in 2 ms
[2024-05-29 12:11:16] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-29 12:11:16] [INFO ] Flow matrix only has 139 transitions (discarded 7 similar events)
[2024-05-29 12:11:16] [INFO ] Invariant cache hit.
[2024-05-29 12:11:16] [INFO ] State equation strengthened by 33 read => feed constraints.
[2024-05-29 12:11:16] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 86/148 places, 146/222 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 617 ms. Remains : 86/148 places, 146/222 transitions.
Support contains 17 out of 86 places after structural reductions.
[2024-05-29 12:11:16] [INFO ] Flatten gal took : 30 ms
[2024-05-29 12:11:16] [INFO ] Flatten gal took : 12 ms
[2024-05-29 12:11:16] [INFO ] Input system was already deterministic with 146 transitions.
RANDOM walk for 40000 steps (116 resets) in 1318 ms. (30 steps per ms) remains 1/8 properties
BEST_FIRST walk for 40003 steps (12 resets) in 223 ms. (178 steps per ms) remains 1/1 properties
[2024-05-29 12:11:16] [INFO ] Flow matrix only has 139 transitions (discarded 7 similar events)
[2024-05-29 12:11:16] [INFO ] Invariant cache hit.
[2024-05-29 12:11:16] [INFO ] State equation strengthened by 33 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp3 is UNSAT
After SMT solving in domain Real declared 86/225 variables, and 2 constraints, problems are : Problem set: 1 solved, 0 unsolved in 49 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 0/86 constraints, ReadFeed: 0/33 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 68ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA StigmergyCommit-PT-03a-LTLCardinality-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 5 simplifications.
Computed a total of 17 stabilizing places and 17 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(X(F(p0))))))'
Support contains 2 out of 86 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 146/146 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 76 transition count 135
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 76 transition count 135
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 23 place count 76 transition count 132
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 29 place count 70 transition count 125
Iterating global reduction 1 with 6 rules applied. Total rules applied 35 place count 70 transition count 125
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 41 place count 64 transition count 119
Iterating global reduction 1 with 6 rules applied. Total rules applied 47 place count 64 transition count 119
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 51 place count 60 transition count 115
Iterating global reduction 1 with 4 rules applied. Total rules applied 55 place count 60 transition count 115
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 56 place count 60 transition count 114
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 59 place count 57 transition count 111
Iterating global reduction 2 with 3 rules applied. Total rules applied 62 place count 57 transition count 111
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 64 place count 55 transition count 109
Iterating global reduction 2 with 2 rules applied. Total rules applied 66 place count 55 transition count 109
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 67 place count 55 transition count 108
Applied a total of 67 rules in 12 ms. Remains 55 /86 variables (removed 31) and now considering 108/146 (removed 38) transitions.
[2024-05-29 12:11:17] [INFO ] Flow matrix only has 103 transitions (discarded 5 similar events)
// Phase 1: matrix 103 rows 55 cols
[2024-05-29 12:11:17] [INFO ] Computed 1 invariants in 2 ms
[2024-05-29 12:11:17] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-29 12:11:17] [INFO ] Flow matrix only has 103 transitions (discarded 5 similar events)
[2024-05-29 12:11:17] [INFO ] Invariant cache hit.
[2024-05-29 12:11:17] [INFO ] State equation strengthened by 33 read => feed constraints.
[2024-05-29 12:11:17] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
Running 107 sub problems to find dead transitions.
[2024-05-29 12:11:17] [INFO ] Flow matrix only has 103 transitions (discarded 5 similar events)
[2024-05-29 12:11:17] [INFO ] Invariant cache hit.
[2024-05-29 12:11:17] [INFO ] State equation strengthened by 33 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (OVERLAPS) 1/55 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-29 12:11:17] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 8 ms to minimize.
[2024-05-29 12:11:17] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2024-05-29 12:11:17] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2024-05-29 12:11:17] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
[2024-05-29 12:11:17] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2024-05-29 12:11:17] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 0 ms to minimize.
[2024-05-29 12:11:17] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2024-05-29 12:11:17] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 2 ms to minimize.
[2024-05-29 12:11:18] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2024-05-29 12:11:18] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 1 ms to minimize.
[2024-05-29 12:11:18] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 2 ms to minimize.
[2024-05-29 12:11:18] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2024-05-29 12:11:18] [INFO ] Deduced a trap composed of 16 places in 19 ms of which 0 ms to minimize.
[2024-05-29 12:11:18] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 1 ms to minimize.
[2024-05-29 12:11:18] [INFO ] Deduced a trap composed of 13 places in 20 ms of which 1 ms to minimize.
[2024-05-29 12:11:18] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 2 ms to minimize.
[2024-05-29 12:11:18] [INFO ] Deduced a trap composed of 16 places in 16 ms of which 0 ms to minimize.
[2024-05-29 12:11:18] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 0 ms to minimize.
[2024-05-29 12:11:18] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 1 ms to minimize.
[2024-05-29 12:11:18] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-29 12:11:18] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 1 ms to minimize.
[2024-05-29 12:11:18] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (OVERLAPS) 102/157 variables, 55/78 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/157 variables, 32/110 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-29 12:11:19] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/157 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/157 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 9 (OVERLAPS) 1/158 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/158 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 11 (OVERLAPS) 0/158 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Real declared 158/158 variables, and 112 constraints, problems are : Problem set: 0 solved, 107 unsolved in 4433 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 55/55 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 0 solved, 107 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (OVERLAPS) 1/55 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 23/24 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-29 12:11:22] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 1 ms to minimize.
[2024-05-29 12:11:22] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (OVERLAPS) 102/157 variables, 55/81 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/157 variables, 32/113 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/157 variables, 107/220 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/157 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 9 (OVERLAPS) 1/158 variables, 1/221 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/158 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 11 (OVERLAPS) 0/158 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Int declared 158/158 variables, and 221 constraints, problems are : Problem set: 0 solved, 107 unsolved in 4249 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 55/55 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 25/25 constraints]
After SMT, in 8755ms problems are : Problem set: 0 solved, 107 unsolved
Search for dead transitions found 0 dead transitions in 8758ms
Starting structural reductions in LTL mode, iteration 1 : 55/86 places, 108/146 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8859 ms. Remains : 55/86 places, 108/146 transitions.
Stuttering acceptance computed with spot in 303 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-03a-LTLCardinality-02
Product exploration explored 100000 steps with 20000 reset in 237 ms.
Product exploration explored 100000 steps with 20000 reset in 110 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 72 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 178 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 4418 steps (16 resets) in 35 ms. (122 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 76 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 260 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 175 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 55 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 55/55 places, 108/108 transitions.
Applied a total of 0 rules in 3 ms. Remains 55 /55 variables (removed 0) and now considering 108/108 (removed 0) transitions.
[2024-05-29 12:11:27] [INFO ] Flow matrix only has 103 transitions (discarded 5 similar events)
[2024-05-29 12:11:27] [INFO ] Invariant cache hit.
[2024-05-29 12:11:27] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-29 12:11:27] [INFO ] Flow matrix only has 103 transitions (discarded 5 similar events)
[2024-05-29 12:11:27] [INFO ] Invariant cache hit.
[2024-05-29 12:11:27] [INFO ] State equation strengthened by 33 read => feed constraints.
[2024-05-29 12:11:27] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
Running 107 sub problems to find dead transitions.
[2024-05-29 12:11:27] [INFO ] Flow matrix only has 103 transitions (discarded 5 similar events)
[2024-05-29 12:11:27] [INFO ] Invariant cache hit.
[2024-05-29 12:11:27] [INFO ] State equation strengthened by 33 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (OVERLAPS) 1/55 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-29 12:11:28] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 1 ms to minimize.
[2024-05-29 12:11:28] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
[2024-05-29 12:11:28] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2024-05-29 12:11:28] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 2 ms to minimize.
[2024-05-29 12:11:28] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 7 ms to minimize.
[2024-05-29 12:11:28] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 0 ms to minimize.
[2024-05-29 12:11:28] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2024-05-29 12:11:28] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 1 ms to minimize.
[2024-05-29 12:11:28] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 1 ms to minimize.
[2024-05-29 12:11:28] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 3 ms to minimize.
[2024-05-29 12:11:28] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 0 ms to minimize.
[2024-05-29 12:11:28] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
[2024-05-29 12:11:28] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 1 ms to minimize.
[2024-05-29 12:11:28] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 1 ms to minimize.
[2024-05-29 12:11:28] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 1 ms to minimize.
[2024-05-29 12:11:28] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
[2024-05-29 12:11:28] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-05-29 12:11:28] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
[2024-05-29 12:11:28] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 0 ms to minimize.
[2024-05-29 12:11:28] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-29 12:11:28] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 0 ms to minimize.
[2024-05-29 12:11:28] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (OVERLAPS) 102/157 variables, 55/78 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/157 variables, 32/110 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-29 12:11:29] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/157 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/157 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 9 (OVERLAPS) 1/158 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/158 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 11 (OVERLAPS) 0/158 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Real declared 158/158 variables, and 112 constraints, problems are : Problem set: 0 solved, 107 unsolved in 4303 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 55/55 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 0 solved, 107 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (OVERLAPS) 1/55 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 23/24 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-29 12:11:32] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 0 ms to minimize.
[2024-05-29 12:11:32] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (OVERLAPS) 102/157 variables, 55/81 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/157 variables, 32/113 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/157 variables, 107/220 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/157 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 9 (OVERLAPS) 1/158 variables, 1/221 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/158 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 11 (OVERLAPS) 0/158 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Int declared 158/158 variables, and 221 constraints, problems are : Problem set: 0 solved, 107 unsolved in 4118 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 55/55 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 25/25 constraints]
After SMT, in 8482ms problems are : Problem set: 0 solved, 107 unsolved
Search for dead transitions found 0 dead transitions in 8485ms
Finished structural reductions in LTL mode , in 1 iterations and 8594 ms. Remains : 55/55 places, 108/108 transitions.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 95 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 194 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 10586 steps (35 resets) in 66 ms. (158 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 105 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 172 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 208 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 329 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 20000 reset in 62 ms.
Product exploration explored 100000 steps with 20000 reset in 69 ms.
Applying partial POR strategy [true, false, false, false, false]
Stuttering acceptance computed with spot in 184 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 55 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 55/55 places, 108/108 transitions.
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 55 transition count 108
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 4 Pre rules applied. Total rules applied 13 place count 55 transition count 112
Deduced a syphon composed of 17 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 17 place count 55 transition count 112
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 25 place count 47 transition count 104
Deduced a syphon composed of 9 places in 1 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 33 place count 47 transition count 104
Performed 20 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 29 places in 0 ms
Iterating global reduction 1 with 20 rules applied. Total rules applied 53 place count 47 transition count 108
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 79 place count 47 transition count 82
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 93 place count 33 transition count 68
Deduced a syphon composed of 15 places in 0 ms
Iterating global reduction 2 with 14 rules applied. Total rules applied 107 place count 33 transition count 68
Performed 3 Post agglomeration using F-continuation condition with reduction of 20 identical transitions.
Deduced a syphon composed of 18 places in 0 ms
Iterating global reduction 2 with 3 rules applied. Total rules applied 110 place count 33 transition count 85
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 124 place count 33 transition count 71
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 130 place count 27 transition count 59
Deduced a syphon composed of 12 places in 0 ms
Iterating global reduction 3 with 6 rules applied. Total rules applied 136 place count 27 transition count 59
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 13 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 137 place count 27 transition count 68
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 145 place count 27 transition count 60
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 147 place count 25 transition count 56
Deduced a syphon composed of 11 places in 0 ms
Iterating global reduction 4 with 2 rules applied. Total rules applied 149 place count 25 transition count 56
Deduced a syphon composed of 11 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 4 with 13 rules applied. Total rules applied 162 place count 25 transition count 43
Deduced a syphon composed of 11 places in 0 ms
Applied a total of 162 rules in 26 ms. Remains 25 /55 variables (removed 30) and now considering 43/108 (removed 65) transitions.
[2024-05-29 12:11:37] [INFO ] Redundant transitions in 1 ms returned []
Running 42 sub problems to find dead transitions.
[2024-05-29 12:11:37] [INFO ] Flow matrix only has 39 transitions (discarded 4 similar events)
// Phase 1: matrix 39 rows 25 cols
[2024-05-29 12:11:37] [INFO ] Computed 1 invariants in 0 ms
[2024-05-29 12:11:37] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (OVERLAPS) 1/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 42 unsolved
[2024-05-29 12:11:37] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 2 ms to minimize.
[2024-05-29 12:11:37] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 0 ms to minimize.
[2024-05-29 12:11:37] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-05-29 12:11:37] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 0 ms to minimize.
[2024-05-29 12:11:37] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-29 12:11:38] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-29 12:11:38] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-29 12:11:38] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-29 12:11:38] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 0 ms to minimize.
[2024-05-29 12:11:38] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-29 12:11:38] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 1 ms to minimize.
[2024-05-29 12:11:38] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2024-05-29 12:11:38] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-29 12:11:38] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 14/15 constraints. Problems are: Problem set: 0 solved, 42 unsolved
[2024-05-29 12:11:38] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 42 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD33 is UNSAT
At refinement iteration 5 (OVERLAPS) 38/63 variables, 25/41 constraints. Problems are: Problem set: 15 solved, 27 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/63 variables, 11/52 constraints. Problems are: Problem set: 15 solved, 27 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/63 variables, 0/52 constraints. Problems are: Problem set: 15 solved, 27 unsolved
At refinement iteration 8 (OVERLAPS) 1/64 variables, 1/53 constraints. Problems are: Problem set: 15 solved, 27 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/64 variables, 0/53 constraints. Problems are: Problem set: 15 solved, 27 unsolved
At refinement iteration 10 (OVERLAPS) 0/64 variables, 0/53 constraints. Problems are: Problem set: 15 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Real declared 64/64 variables, and 53 constraints, problems are : Problem set: 15 solved, 27 unsolved in 924 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 15 solved, 27 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 15 solved, 27 unsolved
At refinement iteration 1 (OVERLAPS) 12/25 variables, 1/1 constraints. Problems are: Problem set: 15 solved, 27 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 15/16 constraints. Problems are: Problem set: 15 solved, 27 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/16 constraints. Problems are: Problem set: 15 solved, 27 unsolved
At refinement iteration 4 (OVERLAPS) 38/63 variables, 25/41 constraints. Problems are: Problem set: 15 solved, 27 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 11/52 constraints. Problems are: Problem set: 15 solved, 27 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/63 variables, 27/79 constraints. Problems are: Problem set: 15 solved, 27 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/63 variables, 0/79 constraints. Problems are: Problem set: 15 solved, 27 unsolved
At refinement iteration 8 (OVERLAPS) 1/64 variables, 1/80 constraints. Problems are: Problem set: 15 solved, 27 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/64 variables, 0/80 constraints. Problems are: Problem set: 15 solved, 27 unsolved
At refinement iteration 10 (OVERLAPS) 0/64 variables, 0/80 constraints. Problems are: Problem set: 15 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Int declared 64/64 variables, and 80 constraints, problems are : Problem set: 15 solved, 27 unsolved in 515 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 27/42 constraints, Known Traps: 15/15 constraints]
After SMT, in 1452ms problems are : Problem set: 15 solved, 27 unsolved
Search for dead transitions found 15 dead transitions in 1454ms
Found 15 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 15 transitions
Dead transitions reduction (with SMT) removed 15 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 25/55 places, 28/108 transitions.
Graph (complete) has 63 edges and 25 vertex of which 14 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.1 ms
Discarding 11 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 13 ms. Remains 14 /25 variables (removed 11) and now considering 28/28 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 14/55 places, 28/108 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1498 ms. Remains : 14/55 places, 28/108 transitions.
Built C files in :
/tmp/ltsmin7317773569423132451
[2024-05-29 12:11:39] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7317773569423132451
Running compilation step : cd /tmp/ltsmin7317773569423132451;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 371 ms.
Running link step : cd /tmp/ltsmin7317773569423132451;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin7317773569423132451;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased7160700976629162997.hoa' '--buchi-type=spotba'
LTSmin run took 288 ms.
FORMULA StigmergyCommit-PT-03a-LTLCardinality-02 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property StigmergyCommit-PT-03a-LTLCardinality-02 finished in 22895 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 86 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 146/146 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 74 transition count 133
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 74 transition count 133
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 28 place count 74 transition count 129
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 35 place count 67 transition count 121
Iterating global reduction 1 with 7 rules applied. Total rules applied 42 place count 67 transition count 121
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 43 place count 67 transition count 120
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 49 place count 61 transition count 114
Iterating global reduction 2 with 6 rules applied. Total rules applied 55 place count 61 transition count 114
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 59 place count 57 transition count 110
Iterating global reduction 2 with 4 rules applied. Total rules applied 63 place count 57 transition count 110
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 64 place count 57 transition count 109
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 67 place count 54 transition count 106
Iterating global reduction 3 with 3 rules applied. Total rules applied 70 place count 54 transition count 106
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 72 place count 52 transition count 104
Iterating global reduction 3 with 2 rules applied. Total rules applied 74 place count 52 transition count 104
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 75 place count 52 transition count 103
Applied a total of 75 rules in 9 ms. Remains 52 /86 variables (removed 34) and now considering 103/146 (removed 43) transitions.
[2024-05-29 12:11:40] [INFO ] Flow matrix only has 98 transitions (discarded 5 similar events)
// Phase 1: matrix 98 rows 52 cols
[2024-05-29 12:11:40] [INFO ] Computed 1 invariants in 1 ms
[2024-05-29 12:11:40] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-29 12:11:40] [INFO ] Flow matrix only has 98 transitions (discarded 5 similar events)
[2024-05-29 12:11:40] [INFO ] Invariant cache hit.
[2024-05-29 12:11:40] [INFO ] State equation strengthened by 33 read => feed constraints.
[2024-05-29 12:11:40] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
Running 102 sub problems to find dead transitions.
[2024-05-29 12:11:40] [INFO ] Flow matrix only has 98 transitions (discarded 5 similar events)
[2024-05-29 12:11:40] [INFO ] Invariant cache hit.
[2024-05-29 12:11:40] [INFO ] State equation strengthened by 33 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (OVERLAPS) 1/52 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 102 unsolved
[2024-05-29 12:11:40] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 0 ms to minimize.
[2024-05-29 12:11:40] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2024-05-29 12:11:40] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 0 ms to minimize.
[2024-05-29 12:11:40] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 0 ms to minimize.
[2024-05-29 12:11:40] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
[2024-05-29 12:11:40] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
[2024-05-29 12:11:40] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 1 ms to minimize.
[2024-05-29 12:11:40] [INFO ] Deduced a trap composed of 15 places in 19 ms of which 1 ms to minimize.
[2024-05-29 12:11:40] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 0 ms to minimize.
[2024-05-29 12:11:40] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2024-05-29 12:11:40] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 1 ms to minimize.
[2024-05-29 12:11:40] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 1 ms to minimize.
[2024-05-29 12:11:40] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
[2024-05-29 12:11:40] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 0 ms to minimize.
[2024-05-29 12:11:40] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 0 ms to minimize.
[2024-05-29 12:11:40] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 1 ms to minimize.
[2024-05-29 12:11:41] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2024-05-29 12:11:41] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 0 ms to minimize.
[2024-05-29 12:11:41] [INFO ] Deduced a trap composed of 14 places in 18 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 102 unsolved
[2024-05-29 12:11:41] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
[2024-05-29 12:11:41] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
[2024-05-29 12:11:41] [INFO ] Deduced a trap composed of 13 places in 20 ms of which 1 ms to minimize.
[2024-05-29 12:11:41] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 4/24 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (OVERLAPS) 97/149 variables, 52/76 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/149 variables, 32/108 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/149 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 8 (OVERLAPS) 1/150 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/150 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 10 (OVERLAPS) 0/150 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Real declared 150/150 variables, and 109 constraints, problems are : Problem set: 0 solved, 102 unsolved in 3455 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 52/52 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 0 solved, 102 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (OVERLAPS) 1/52 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 23/24 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (OVERLAPS) 97/149 variables, 52/76 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/149 variables, 32/108 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/149 variables, 102/210 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/149 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 8 (OVERLAPS) 1/150 variables, 1/211 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/150 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 10 (OVERLAPS) 0/150 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Int declared 150/150 variables, and 211 constraints, problems are : Problem set: 0 solved, 102 unsolved in 3690 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 52/52 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 23/23 constraints]
After SMT, in 7182ms problems are : Problem set: 0 solved, 102 unsolved
Search for dead transitions found 0 dead transitions in 7184ms
Starting structural reductions in LTL mode, iteration 1 : 52/86 places, 103/146 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7282 ms. Remains : 52/86 places, 103/146 transitions.
Stuttering acceptance computed with spot in 89 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-03a-LTLCardinality-08
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA StigmergyCommit-PT-03a-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-03a-LTLCardinality-08 finished in 7385 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 86 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 146/146 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 75 transition count 134
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 75 transition count 134
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 26 place count 75 transition count 130
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 32 place count 69 transition count 123
Iterating global reduction 1 with 6 rules applied. Total rules applied 38 place count 69 transition count 123
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 39 place count 69 transition count 122
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 43 place count 65 transition count 118
Iterating global reduction 2 with 4 rules applied. Total rules applied 47 place count 65 transition count 118
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 49 place count 63 transition count 116
Iterating global reduction 2 with 2 rules applied. Total rules applied 51 place count 63 transition count 116
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 52 place count 63 transition count 115
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 53 place count 62 transition count 114
Iterating global reduction 3 with 1 rules applied. Total rules applied 54 place count 62 transition count 114
Applied a total of 54 rules in 16 ms. Remains 62 /86 variables (removed 24) and now considering 114/146 (removed 32) transitions.
[2024-05-29 12:11:47] [INFO ] Flow matrix only has 109 transitions (discarded 5 similar events)
// Phase 1: matrix 109 rows 62 cols
[2024-05-29 12:11:47] [INFO ] Computed 1 invariants in 2 ms
[2024-05-29 12:11:47] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-29 12:11:47] [INFO ] Flow matrix only has 109 transitions (discarded 5 similar events)
[2024-05-29 12:11:47] [INFO ] Invariant cache hit.
[2024-05-29 12:11:47] [INFO ] State equation strengthened by 33 read => feed constraints.
[2024-05-29 12:11:47] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
Running 113 sub problems to find dead transitions.
[2024-05-29 12:11:47] [INFO ] Flow matrix only has 109 transitions (discarded 5 similar events)
[2024-05-29 12:11:47] [INFO ] Invariant cache hit.
[2024-05-29 12:11:47] [INFO ] State equation strengthened by 33 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (OVERLAPS) 1/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-29 12:11:47] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 0 ms to minimize.
[2024-05-29 12:11:47] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2024-05-29 12:11:47] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2024-05-29 12:11:48] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2024-05-29 12:11:48] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-05-29 12:11:48] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2024-05-29 12:11:48] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2024-05-29 12:11:48] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
[2024-05-29 12:11:48] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2024-05-29 12:11:48] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
[2024-05-29 12:11:48] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 0 ms to minimize.
[2024-05-29 12:11:48] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2024-05-29 12:11:48] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 0 ms to minimize.
[2024-05-29 12:11:48] [INFO ] Deduced a trap composed of 16 places in 18 ms of which 1 ms to minimize.
[2024-05-29 12:11:48] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 1 ms to minimize.
[2024-05-29 12:11:48] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-05-29 12:11:48] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 1 ms to minimize.
[2024-05-29 12:11:48] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 18/19 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-29 12:11:48] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2024-05-29 12:11:48] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2024-05-29 12:11:48] [INFO ] Deduced a trap composed of 20 places in 22 ms of which 1 ms to minimize.
[2024-05-29 12:11:48] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
[2024-05-29 12:11:48] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2024-05-29 12:11:48] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 6/25 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (OVERLAPS) 108/170 variables, 62/87 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 32/119 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/170 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 8 (OVERLAPS) 1/171 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/171 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 10 (OVERLAPS) 0/171 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Real declared 171/171 variables, and 120 constraints, problems are : Problem set: 0 solved, 113 unsolved in 4540 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 62/62 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 113 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (OVERLAPS) 1/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 24/25 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (OVERLAPS) 108/170 variables, 62/87 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 32/119 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 113/232 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/170 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 8 (OVERLAPS) 1/171 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/171 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 10 (OVERLAPS) 0/171 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Int declared 171/171 variables, and 233 constraints, problems are : Problem set: 0 solved, 113 unsolved in 4331 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 62/62 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 24/24 constraints]
After SMT, in 8912ms problems are : Problem set: 0 solved, 113 unsolved
Search for dead transitions found 0 dead transitions in 8915ms
Starting structural reductions in LTL mode, iteration 1 : 62/86 places, 114/146 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9021 ms. Remains : 62/86 places, 114/146 transitions.
Stuttering acceptance computed with spot in 93 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-03a-LTLCardinality-11
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA StigmergyCommit-PT-03a-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-03a-LTLCardinality-11 finished in 9138 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, 146/146 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 86 transition count 106
Reduce places removed 40 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 46 rules applied. Total rules applied 86 place count 46 transition count 100
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 89 place count 45 transition count 98
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 90 place count 44 transition count 98
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 90 place count 44 transition count 93
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 100 place count 39 transition count 93
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 103 place count 36 transition count 89
Iterating global reduction 4 with 3 rules applied. Total rules applied 106 place count 36 transition count 89
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 107 place count 35 transition count 87
Iterating global reduction 4 with 1 rules applied. Total rules applied 108 place count 35 transition count 87
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 109 place count 35 transition count 86
Performed 18 Post agglomeration using F-continuation condition with reduction of 5 identical transitions.
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 5 with 36 rules applied. Total rules applied 145 place count 17 transition count 63
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 5 with 20 rules applied. Total rules applied 165 place count 17 transition count 43
Performed 4 Post agglomeration using F-continuation condition with reduction of 34 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 173 place count 13 transition count 50
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 6 with 15 rules applied. Total rules applied 188 place count 13 transition count 35
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 7 with 12 rules applied. Total rules applied 200 place count 13 transition count 23
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 202 place count 13 transition count 23
Applied a total of 202 rules in 37 ms. Remains 13 /86 variables (removed 73) and now considering 23/146 (removed 123) transitions.
[2024-05-29 12:11:56] [INFO ] Flow matrix only has 18 transitions (discarded 5 similar events)
// Phase 1: matrix 18 rows 13 cols
[2024-05-29 12:11:56] [INFO ] Computed 1 invariants in 1 ms
[2024-05-29 12:11:56] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-29 12:11:56] [INFO ] Flow matrix only has 18 transitions (discarded 5 similar events)
[2024-05-29 12:11:56] [INFO ] Invariant cache hit.
[2024-05-29 12:11:56] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-29 12:11:56] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2024-05-29 12:11:56] [INFO ] Redundant transitions in 0 ms returned []
Running 22 sub problems to find dead transitions.
[2024-05-29 12:11:56] [INFO ] Flow matrix only has 18 transitions (discarded 5 similar events)
[2024-05-29 12:11:56] [INFO ] Invariant cache hit.
[2024-05-29 12:11:56] [INFO ] State equation strengthened by 9 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 1/13 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 22 unsolved
[2024-05-29 12:11:56] [INFO ] Deduced a trap composed of 5 places in 14 ms of which 0 ms to minimize.
[2024-05-29 12:11:56] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-05-29 12:11:56] [INFO ] Deduced a trap composed of 6 places in 14 ms of which 1 ms to minimize.
[2024-05-29 12:11:56] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-29 12:11:56] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-29 12:11:56] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-29 12:11:56] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (OVERLAPS) 17/30 variables, 13/21 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 8/29 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (OVERLAPS) 1/31 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/31 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 9 (OVERLAPS) 0/31 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Real declared 31/31 variables, and 30 constraints, problems are : Problem set: 0 solved, 22 unsolved in 372 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 13/13 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 22 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 1/13 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 22 unsolved
[2024-05-29 12:11:57] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-29 12:11:57] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-29 12:11:57] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-29 12:11:57] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-29 12:11:57] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-29 12:11:57] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/13 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 22 unsolved
[2024-05-29 12:11:57] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-29 12:11:57] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 22 unsolved
[2024-05-29 12:11:57] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (OVERLAPS) 17/30 variables, 13/30 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/30 variables, 8/38 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/30 variables, 22/60 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/30 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 11 (OVERLAPS) 1/31 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/31 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 13 (OVERLAPS) 0/31 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Int declared 31/31 variables, and 61 constraints, problems are : Problem set: 0 solved, 22 unsolved in 549 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 13/13 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 16/16 constraints]
After SMT, in 929ms problems are : Problem set: 0 solved, 22 unsolved
Search for dead transitions found 0 dead transitions in 930ms
Starting structural reductions in SI_LTL mode, iteration 1 : 13/86 places, 23/146 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1030 ms. Remains : 13/86 places, 23/146 transitions.
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-03a-LTLCardinality-12
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA StigmergyCommit-PT-03a-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-03a-LTLCardinality-12 finished in 1103 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 86 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 146/146 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 76 transition count 135
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 76 transition count 135
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 24 place count 76 transition count 131
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 29 place count 71 transition count 125
Iterating global reduction 1 with 5 rules applied. Total rules applied 34 place count 71 transition count 125
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 71 transition count 124
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 39 place count 67 transition count 120
Iterating global reduction 2 with 4 rules applied. Total rules applied 43 place count 67 transition count 120
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 46 place count 64 transition count 117
Iterating global reduction 2 with 3 rules applied. Total rules applied 49 place count 64 transition count 117
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 50 place count 64 transition count 116
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 52 place count 62 transition count 114
Iterating global reduction 3 with 2 rules applied. Total rules applied 54 place count 62 transition count 114
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 55 place count 61 transition count 113
Iterating global reduction 3 with 1 rules applied. Total rules applied 56 place count 61 transition count 113
Applied a total of 56 rules in 3 ms. Remains 61 /86 variables (removed 25) and now considering 113/146 (removed 33) transitions.
[2024-05-29 12:11:57] [INFO ] Flow matrix only has 108 transitions (discarded 5 similar events)
// Phase 1: matrix 108 rows 61 cols
[2024-05-29 12:11:57] [INFO ] Computed 1 invariants in 1 ms
[2024-05-29 12:11:57] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-29 12:11:57] [INFO ] Flow matrix only has 108 transitions (discarded 5 similar events)
[2024-05-29 12:11:57] [INFO ] Invariant cache hit.
[2024-05-29 12:11:57] [INFO ] State equation strengthened by 33 read => feed constraints.
[2024-05-29 12:11:57] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
Running 112 sub problems to find dead transitions.
[2024-05-29 12:11:57] [INFO ] Flow matrix only has 108 transitions (discarded 5 similar events)
[2024-05-29 12:11:57] [INFO ] Invariant cache hit.
[2024-05-29 12:11:57] [INFO ] State equation strengthened by 33 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (OVERLAPS) 1/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-29 12:11:58] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 1 ms to minimize.
[2024-05-29 12:11:58] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 0 ms to minimize.
[2024-05-29 12:11:58] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
[2024-05-29 12:11:58] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 0 ms to minimize.
[2024-05-29 12:11:58] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 0 ms to minimize.
[2024-05-29 12:11:58] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
[2024-05-29 12:11:58] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 0 ms to minimize.
[2024-05-29 12:11:58] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2024-05-29 12:11:58] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 0 ms to minimize.
[2024-05-29 12:11:58] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2024-05-29 12:11:58] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
[2024-05-29 12:11:58] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 1 ms to minimize.
[2024-05-29 12:11:58] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 0 ms to minimize.
[2024-05-29 12:11:58] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2024-05-29 12:11:58] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 1 ms to minimize.
[2024-05-29 12:11:58] [INFO ] Deduced a trap composed of 13 places in 19 ms of which 1 ms to minimize.
[2024-05-29 12:11:58] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 0 ms to minimize.
[2024-05-29 12:11:58] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2024-05-29 12:11:58] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
[2024-05-29 12:11:58] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-29 12:11:58] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 0 ms to minimize.
[2024-05-29 12:11:59] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2024-05-29 12:11:59] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 3/24 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-29 12:11:59] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-05-29 12:11:59] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 0 ms to minimize.
[2024-05-29 12:11:59] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 3/27 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-29 12:11:59] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/61 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 7 (OVERLAPS) 107/168 variables, 61/89 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/168 variables, 32/121 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/168 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 10 (OVERLAPS) 1/169 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/169 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 12 (OVERLAPS) 0/169 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Real declared 169/169 variables, and 122 constraints, problems are : Problem set: 0 solved, 112 unsolved in 5005 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 61/61 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 0 solved, 112 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (OVERLAPS) 1/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 27/28 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 4 (OVERLAPS) 107/168 variables, 61/89 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/168 variables, 32/121 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/168 variables, 112/233 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/168 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 8 (OVERLAPS) 1/169 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/169 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 10 (OVERLAPS) 0/169 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Int declared 169/169 variables, and 234 constraints, problems are : Problem set: 0 solved, 112 unsolved in 4359 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 61/61 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 27/27 constraints]
After SMT, in 9408ms problems are : Problem set: 0 solved, 112 unsolved
Search for dead transitions found 0 dead transitions in 9410ms
Starting structural reductions in LTL mode, iteration 1 : 61/86 places, 113/146 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9501 ms. Remains : 61/86 places, 113/146 transitions.
Stuttering acceptance computed with spot in 144 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-03a-LTLCardinality-15
Product exploration explored 100000 steps with 0 reset in 116 ms.
Product exploration explored 100000 steps with 0 reset in 69 ms.
Computed a total of 6 stabilizing places and 6 stable transitions
Computed a total of 6 stabilizing places and 6 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 66 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 45 ms :[true, (NOT p0)]
RANDOM walk for 4269 steps (16 resets) in 20 ms. (203 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 3 factoid took 108 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA StigmergyCommit-PT-03a-LTLCardinality-15 FALSE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyCommit-PT-03a-LTLCardinality-15 finished in 10084 ms.
All properties solved by simple procedures.
Total runtime 52471 ms.

BK_STOP 1716984727759

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="StigmergyCommit-PT-03a"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is StigmergyCommit-PT-03a, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r400-tall-171690531600107"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/StigmergyCommit-PT-03a.tgz
mv StigmergyCommit-PT-03a execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;