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.r092-tall-171624189800683.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 DES-PT-20a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r092-tall-171624189800683
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 7.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Apr 22 14:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 22 14:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 12 08:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 169K Apr 12 08:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Apr 12 08:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 47K Apr 12 08:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Apr 22 14:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 57K May 18 16:42 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 DES-PT-20a-LTLCardinality-00
FORMULA_NAME DES-PT-20a-LTLCardinality-01
FORMULA_NAME DES-PT-20a-LTLCardinality-02
FORMULA_NAME DES-PT-20a-LTLCardinality-03
FORMULA_NAME DES-PT-20a-LTLCardinality-04
FORMULA_NAME DES-PT-20a-LTLCardinality-05
FORMULA_NAME DES-PT-20a-LTLCardinality-06
FORMULA_NAME DES-PT-20a-LTLCardinality-07
FORMULA_NAME DES-PT-20a-LTLCardinality-08
FORMULA_NAME DES-PT-20a-LTLCardinality-09
FORMULA_NAME DES-PT-20a-LTLCardinality-10
FORMULA_NAME DES-PT-20a-LTLCardinality-11
FORMULA_NAME DES-PT-20a-LTLCardinality-12
FORMULA_NAME DES-PT-20a-LTLCardinality-13
FORMULA_NAME DES-PT-20a-LTLCardinality-14
FORMULA_NAME DES-PT-20a-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716345314181

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-20a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-05-22 02:35: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-22 02:35:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 02:35:15] [INFO ] Load time of PNML (sax parser for PT used): 71 ms
[2024-05-22 02:35:15] [INFO ] Transformed 195 places.
[2024-05-22 02:35:15] [INFO ] Transformed 152 transitions.
[2024-05-22 02:35:15] [INFO ] Found NUPN structural information;
[2024-05-22 02:35:15] [INFO ] Parsed PT model containing 195 places and 152 transitions and 742 arcs in 177 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 3 formulas.
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
FORMULA DES-PT-20a-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-20a-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-20a-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-20a-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-20a-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-20a-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 23 out of 195 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 195/195 places, 138/138 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 194 transition count 137
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 194 transition count 137
Applied a total of 2 rules in 41 ms. Remains 194 /195 variables (removed 1) and now considering 137/138 (removed 1) transitions.
// Phase 1: matrix 137 rows 194 cols
[2024-05-22 02:35:15] [INFO ] Computed 59 invariants in 37 ms
[2024-05-22 02:35:16] [INFO ] Implicit Places using invariants in 316 ms returned [92]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 345 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 193/195 places, 137/138 transitions.
Applied a total of 0 rules in 5 ms. Remains 193 /193 variables (removed 0) and now considering 137/137 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 410 ms. Remains : 193/195 places, 137/138 transitions.
Support contains 23 out of 193 places after structural reductions.
[2024-05-22 02:35:16] [INFO ] Flatten gal took : 49 ms
[2024-05-22 02:35:16] [INFO ] Flatten gal took : 25 ms
[2024-05-22 02:35:16] [INFO ] Input system was already deterministic with 137 transitions.
RANDOM walk for 40000 steps (897 resets) in 1601 ms. (24 steps per ms) remains 8/14 properties
BEST_FIRST walk for 40003 steps (183 resets) in 175 ms. (227 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (182 resets) in 127 ms. (312 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (170 resets) in 153 ms. (259 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (176 resets) in 134 ms. (296 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (180 resets) in 125 ms. (317 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (181 resets) in 147 ms. (270 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (185 resets) in 149 ms. (266 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (178 resets) in 123 ms. (322 steps per ms) remains 8/8 properties
// Phase 1: matrix 137 rows 193 cols
[2024-05-22 02:35:17] [INFO ] Computed 58 invariants in 10 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 2/14 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 75/89 variables, 32/33 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 77/166 variables, 23/56 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/166 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 6/172 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/172 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 136/308 variables, 172/230 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/308 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 22/330 variables, 21/251 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/330 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 0/330 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 330/330 variables, and 251 constraints, problems are : Problem set: 0 solved, 8 unsolved in 543 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 193/193 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 2/14 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 75/89 variables, 32/33 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 77/166 variables, 23/56 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/166 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 6/172 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/172 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 136/308 variables, 172/230 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/308 variables, 2/232 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-22 02:35:18] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 9 ms to minimize.
[2024-05-22 02:35:18] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 2 ms to minimize.
[2024-05-22 02:35:18] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2024-05-22 02:35:18] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2024-05-22 02:35:18] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/308 variables, 5/237 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-22 02:35:18] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/308 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/308 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (OVERLAPS) 22/330 variables, 21/259 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/330 variables, 6/265 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/330 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (OVERLAPS) 0/330 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 330/330 variables, and 265 constraints, problems are : Problem set: 0 solved, 8 unsolved in 1932 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 193/193 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 6/6 constraints]
After SMT, in 2513ms problems are : Problem set: 0 solved, 8 unsolved
Parikh walk visited 2 properties in 9530 ms.
Support contains 8 out of 193 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 193/193 places, 137/137 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 193 transition count 135
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 8 place count 193 transition count 135
Applied a total of 8 rules in 37 ms. Remains 193 /193 variables (removed 0) and now considering 135/137 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 193/193 places, 135/137 transitions.
RANDOM walk for 40000 steps (542 resets) in 792 ms. (50 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (93 resets) in 73 ms. (540 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (92 resets) in 65 ms. (606 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (89 resets) in 85 ms. (465 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (92 resets) in 100 ms. (396 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (99 resets) in 113 ms. (350 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (91 resets) in 89 ms. (444 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 851318 steps, run timeout after 3001 ms. (steps per millisecond=283 ) properties seen :0 out of 6
Probabilistic random walk after 851318 steps, saw 121324 distinct states, run finished after 3004 ms. (steps per millisecond=283 ) properties seen :0
// Phase 1: matrix 135 rows 193 cols
[2024-05-22 02:35:32] [INFO ] Computed 60 invariants in 3 ms
[2024-05-22 02:35:32] [INFO ] State equation strengthened by 3 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 2/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 81/91 variables, 34/35 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 84/175 variables, 25/60 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/175 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 135/310 variables, 175/235 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/310 variables, 3/238 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/310 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 18/328 variables, 18/256 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/328 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 0/328 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 328/328 variables, and 256 constraints, problems are : Problem set: 0 solved, 6 unsolved in 308 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 193/193 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 2/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 81/91 variables, 34/35 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 84/175 variables, 25/60 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/175 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 135/310 variables, 175/235 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/310 variables, 3/238 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/310 variables, 2/240 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-22 02:35:34] [INFO ] Deduced a trap composed of 11 places in 717 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/310 variables, 1/241 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-22 02:35:34] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/310 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-22 02:35:35] [INFO ] Deduced a trap composed of 8 places in 1113 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/310 variables, 1/243 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/310 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 18/328 variables, 18/261 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/328 variables, 4/265 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/328 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 0/328 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 328/328 variables, and 265 constraints, problems are : Problem set: 0 solved, 6 unsolved in 3153 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 193/193 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 3/3 constraints]
After SMT, in 3478ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 3056 ms.
Support contains 8 out of 193 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 193/193 places, 135/135 transitions.
Applied a total of 0 rules in 8 ms. Remains 193 /193 variables (removed 0) and now considering 135/135 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 193/193 places, 135/135 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 193/193 places, 135/135 transitions.
Applied a total of 0 rules in 6 ms. Remains 193 /193 variables (removed 0) and now considering 135/135 (removed 0) transitions.
[2024-05-22 02:35:39] [INFO ] Invariant cache hit.
[2024-05-22 02:35:39] [INFO ] Implicit Places using invariants in 313 ms returned []
[2024-05-22 02:35:39] [INFO ] Invariant cache hit.
[2024-05-22 02:35:39] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-22 02:35:39] [INFO ] Implicit Places using invariants and state equation in 220 ms returned []
Implicit Place search using SMT with State Equation took 545 ms to find 0 implicit places.
[2024-05-22 02:35:39] [INFO ] Redundant transitions in 3 ms returned []
Running 134 sub problems to find dead transitions.
[2024-05-22 02:35:39] [INFO ] Invariant cache hit.
[2024-05-22 02:35:39] [INFO ] State equation strengthened by 3 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 2 (OVERLAPS) 1/193 variables, 35/46 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 14/60 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 5 (OVERLAPS) 135/328 variables, 193/253 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/328 variables, 3/256 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/328 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 134 unsolved
[2024-05-22 02:35:42] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 0 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/328 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/328 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 134 unsolved
[2024-05-22 02:35:45] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 1 ms to minimize.
[2024-05-22 02:35:45] [INFO ] Deduced a trap composed of 8 places in 61 ms of which 1 ms to minimize.
[2024-05-22 02:35:45] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/328 variables, 3/260 constraints. Problems are: Problem set: 0 solved, 134 unsolved
[2024-05-22 02:35:46] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 1 ms to minimize.
[2024-05-22 02:35:46] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/328 variables, 2/262 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/328 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 13 (OVERLAPS) 0/328 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 134 unsolved
No progress, stopping.
After SMT solving in domain Real declared 328/328 variables, and 262 constraints, problems are : Problem set: 0 solved, 134 unsolved in 10097 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 193/193 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 134/134 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 134 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 2 (OVERLAPS) 1/193 variables, 35/46 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 14/60 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 6/66 constraints. Problems are: Problem set: 0 solved, 134 unsolved
[2024-05-22 02:35:50] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 1 ms to minimize.
[2024-05-22 02:35:51] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 134 unsolved
[2024-05-22 02:35:51] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 0 ms to minimize.
[2024-05-22 02:35:51] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/193 variables, 2/70 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/193 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 8 (OVERLAPS) 135/328 variables, 193/263 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/328 variables, 3/266 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/328 variables, 134/400 constraints. Problems are: Problem set: 0 solved, 134 unsolved
[2024-05-22 02:35:54] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-22 02:35:54] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 0 ms to minimize.
[2024-05-22 02:35:55] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2024-05-22 02:35:55] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 1 ms to minimize.
[2024-05-22 02:35:56] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2024-05-22 02:35:57] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 1 ms to minimize.
[2024-05-22 02:35:57] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/328 variables, 7/407 constraints. Problems are: Problem set: 0 solved, 134 unsolved
[2024-05-22 02:36:04] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/328 variables, 1/408 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/328 variables, 0/408 constraints. Problems are: Problem set: 0 solved, 134 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 328/328 variables, and 408 constraints, problems are : Problem set: 0 solved, 134 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 193/193 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 134/134 constraints, Known Traps: 18/18 constraints]
After SMT, in 40227ms problems are : Problem set: 0 solved, 134 unsolved
Search for dead transitions found 0 dead transitions in 40231ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40803 ms. Remains : 193/193 places, 135/135 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 193 transition count 135
Applied a total of 1 rules in 12 ms. Remains 193 /193 variables (removed 0) and now considering 135/135 (removed 0) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 135 rows 193 cols
[2024-05-22 02:36:20] [INFO ] Computed 60 invariants in 3 ms
[2024-05-22 02:36:20] [INFO ] [Real]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-22 02:36:20] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 11 ms returned sat
[2024-05-22 02:36:20] [INFO ] After 121ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-22 02:36:20] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2024-05-22 02:36:20] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 11 ms returned sat
[2024-05-22 02:36:20] [INFO ] After 120ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
TRAPS : Iteration 0
[2024-05-22 02:36:20] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2024-05-22 02:36:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 44 ms
TRAPS : Iteration 1
[2024-05-22 02:36:20] [INFO ] After 369ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
[2024-05-22 02:36:20] [INFO ] After 564ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Over-approximation ignoring read arcs solved 0 properties in 721 ms.
FORMULA DES-PT-20a-LTLCardinality-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 96 stabilizing places and 91 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(F(p0))&&F((p1&&G(p2)))))'
Support contains 4 out of 193 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 137/137 transitions.
Applied a total of 0 rules in 2 ms. Remains 193 /193 variables (removed 0) and now considering 137/137 (removed 0) transitions.
// Phase 1: matrix 137 rows 193 cols
[2024-05-22 02:36:21] [INFO ] Computed 58 invariants in 3 ms
[2024-05-22 02:36:21] [INFO ] Implicit Places using invariants in 417 ms returned []
[2024-05-22 02:36:21] [INFO ] Invariant cache hit.
[2024-05-22 02:36:21] [INFO ] Implicit Places using invariants and state equation in 206 ms returned []
Implicit Place search using SMT with State Equation took 624 ms to find 0 implicit places.
Running 136 sub problems to find dead transitions.
[2024-05-22 02:36:21] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (OVERLAPS) 1/193 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-22 02:36:22] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (OVERLAPS) 137/330 variables, 193/252 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-22 02:36:23] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
[2024-05-22 02:36:24] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 0 ms to minimize.
[2024-05-22 02:36:24] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/330 variables, 3/255 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/330 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-22 02:36:26] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/330 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/330 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 11 (OVERLAPS) 0/330 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Real declared 330/330 variables, and 256 constraints, problems are : Problem set: 0 solved, 136 unsolved in 6396 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 193/193 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 136 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (OVERLAPS) 1/193 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 5/63 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (OVERLAPS) 137/330 variables, 193/256 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/330 variables, 136/392 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-22 02:36:33] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/330 variables, 1/393 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/330 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 10 (OVERLAPS) 0/330 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Int declared 330/330 variables, and 393 constraints, problems are : Problem set: 0 solved, 136 unsolved in 29845 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 193/193 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 6/6 constraints]
After SMT, in 36286ms problems are : Problem set: 0 solved, 136 unsolved
Search for dead transitions found 0 dead transitions in 36289ms
Finished structural reductions in LTL mode , in 1 iterations and 36916 ms. Remains : 193/193 places, 137/137 transitions.
Stuttering acceptance computed with spot in 293 ms :[(OR (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (OR (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : DES-PT-20a-LTLCardinality-04
Stuttering criterion allowed to conclude after 33 steps with 0 reset in 3 ms.
FORMULA DES-PT-20a-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-20a-LTLCardinality-04 finished in 37270 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 193 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 193/193 places, 137/137 transitions.
Reduce places removed 1 places and 1 transitions.
Applied a total of 0 rules in 13 ms. Remains 192 /193 variables (removed 1) and now considering 136/137 (removed 1) transitions.
// Phase 1: matrix 136 rows 192 cols
[2024-05-22 02:36:58] [INFO ] Computed 58 invariants in 4 ms
[2024-05-22 02:36:58] [INFO ] Implicit Places using invariants in 124 ms returned []
[2024-05-22 02:36:58] [INFO ] Invariant cache hit.
[2024-05-22 02:36:58] [INFO ] Implicit Places using invariants and state equation in 182 ms returned []
Implicit Place search using SMT with State Equation took 310 ms to find 0 implicit places.
[2024-05-22 02:36:58] [INFO ] Redundant transitions in 3 ms returned []
Running 133 sub problems to find dead transitions.
[2024-05-22 02:36:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/189 variables, 18/50 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 133 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/191 variables, 8/58 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 5 (OVERLAPS) 136/327 variables, 191/249 constraints. Problems are: Problem set: 0 solved, 133 unsolved
[2024-05-22 02:37:00] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 4 ms to minimize.
[2024-05-22 02:37:00] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/327 variables, 2/251 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/327 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 8 (OVERLAPS) 1/328 variables, 1/252 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/328 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 10 (OVERLAPS) 0/328 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 133 unsolved
No progress, stopping.
After SMT solving in domain Real declared 328/328 variables, and 252 constraints, problems are : Problem set: 0 solved, 133 unsolved in 5029 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 192/192 constraints, PredecessorRefiner: 133/133 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 133 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/189 variables, 18/50 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 4 (OVERLAPS) 2/191 variables, 8/59 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 7 (OVERLAPS) 136/327 variables, 191/251 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/327 variables, 133/384 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/327 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 10 (OVERLAPS) 1/328 variables, 1/385 constraints. Problems are: Problem set: 0 solved, 133 unsolved
[2024-05-22 02:37:14] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 2 ms to minimize.
[2024-05-22 02:37:15] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2024-05-22 02:37:15] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 0 ms to minimize.
[2024-05-22 02:37:15] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/328 variables, 4/389 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/328 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 13 (OVERLAPS) 0/328 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 133 unsolved
No progress, stopping.
After SMT solving in domain Int declared 328/328 variables, and 389 constraints, problems are : Problem set: 0 solved, 133 unsolved in 26925 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 192/192 constraints, PredecessorRefiner: 133/133 constraints, Known Traps: 6/6 constraints]
After SMT, in 31998ms problems are : Problem set: 0 solved, 133 unsolved
Search for dead transitions found 0 dead transitions in 32000ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 32333 ms. Remains : 192/193 places, 136/137 transitions.
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-20a-LTLCardinality-05
Product exploration explored 100000 steps with 2471 reset in 297 ms.
Product exploration explored 100000 steps with 2446 reset in 270 ms.
Computed a total of 95 stabilizing places and 90 stable transitions
Computed a total of 95 stabilizing places and 90 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 78 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 566 steps (10 resets) in 7 ms. (70 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 99 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 192 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 192/192 places, 136/136 transitions.
Applied a total of 0 rules in 6 ms. Remains 192 /192 variables (removed 0) and now considering 136/136 (removed 0) transitions.
[2024-05-22 02:37:31] [INFO ] Invariant cache hit.
[2024-05-22 02:37:31] [INFO ] Implicit Places using invariants in 124 ms returned []
[2024-05-22 02:37:31] [INFO ] Invariant cache hit.
[2024-05-22 02:37:31] [INFO ] Implicit Places using invariants and state equation in 164 ms returned []
Implicit Place search using SMT with State Equation took 290 ms to find 0 implicit places.
[2024-05-22 02:37:31] [INFO ] Redundant transitions in 3 ms returned []
Running 133 sub problems to find dead transitions.
[2024-05-22 02:37:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/189 variables, 18/50 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 133 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/191 variables, 8/58 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 5 (OVERLAPS) 136/327 variables, 191/249 constraints. Problems are: Problem set: 0 solved, 133 unsolved
[2024-05-22 02:37:33] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 1 ms to minimize.
[2024-05-22 02:37:33] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/327 variables, 2/251 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/327 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 8 (OVERLAPS) 1/328 variables, 1/252 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/328 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 10 (OVERLAPS) 0/328 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 133 unsolved
No progress, stopping.
After SMT solving in domain Real declared 328/328 variables, and 252 constraints, problems are : Problem set: 0 solved, 133 unsolved in 5031 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 192/192 constraints, PredecessorRefiner: 133/133 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 133 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/189 variables, 18/50 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 4 (OVERLAPS) 2/191 variables, 8/59 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 7 (OVERLAPS) 136/327 variables, 191/251 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/327 variables, 133/384 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/327 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 10 (OVERLAPS) 1/328 variables, 1/385 constraints. Problems are: Problem set: 0 solved, 133 unsolved
[2024-05-22 02:37:48] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 2 ms to minimize.
[2024-05-22 02:37:48] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
[2024-05-22 02:37:48] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2024-05-22 02:37:48] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/328 variables, 4/389 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/328 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 13 (OVERLAPS) 0/328 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 133 unsolved
No progress, stopping.
After SMT solving in domain Int declared 328/328 variables, and 389 constraints, problems are : Problem set: 0 solved, 133 unsolved in 26913 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 192/192 constraints, PredecessorRefiner: 133/133 constraints, Known Traps: 6/6 constraints]
After SMT, in 31982ms problems are : Problem set: 0 solved, 133 unsolved
Search for dead transitions found 0 dead transitions in 31985ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 32287 ms. Remains : 192/192 places, 136/136 transitions.
Computed a total of 95 stabilizing places and 90 stable transitions
Computed a total of 95 stabilizing places and 90 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 73 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 544 steps (10 resets) in 8 ms. (60 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 263 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2452 reset in 186 ms.
Product exploration explored 100000 steps with 2468 reset in 206 ms.
Built C files in :
/tmp/ltsmin18331530387196372552
[2024-05-22 02:38:05] [INFO ] Computing symmetric may disable matrix : 136 transitions.
[2024-05-22 02:38:05] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 02:38:05] [INFO ] Computing symmetric may enable matrix : 136 transitions.
[2024-05-22 02:38:05] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 02:38:05] [INFO ] Computing Do-Not-Accords matrix : 136 transitions.
[2024-05-22 02:38:05] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 02:38:05] [INFO ] Built C files in 54ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18331530387196372552
Running compilation step : cd /tmp/ltsmin18331530387196372552;'/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 478 ms.
Running link step : cd /tmp/ltsmin18331530387196372552;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin18331530387196372552;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased9282404051142153649.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 192 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 192/192 places, 136/136 transitions.
Applied a total of 0 rules in 15 ms. Remains 192 /192 variables (removed 0) and now considering 136/136 (removed 0) transitions.
[2024-05-22 02:38:20] [INFO ] Invariant cache hit.
[2024-05-22 02:38:20] [INFO ] Implicit Places using invariants in 115 ms returned []
[2024-05-22 02:38:20] [INFO ] Invariant cache hit.
[2024-05-22 02:38:20] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 284 ms to find 0 implicit places.
[2024-05-22 02:38:20] [INFO ] Redundant transitions in 8 ms returned []
Running 133 sub problems to find dead transitions.
[2024-05-22 02:38:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/189 variables, 18/50 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 133 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/191 variables, 8/58 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 5 (OVERLAPS) 136/327 variables, 191/249 constraints. Problems are: Problem set: 0 solved, 133 unsolved
[2024-05-22 02:38:22] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 1 ms to minimize.
[2024-05-22 02:38:22] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/327 variables, 2/251 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/327 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 8 (OVERLAPS) 1/328 variables, 1/252 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/328 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 10 (OVERLAPS) 0/328 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 133 unsolved
No progress, stopping.
After SMT solving in domain Real declared 328/328 variables, and 252 constraints, problems are : Problem set: 0 solved, 133 unsolved in 5157 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 192/192 constraints, PredecessorRefiner: 133/133 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 133 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/189 variables, 18/50 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 4 (OVERLAPS) 2/191 variables, 8/59 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 7 (OVERLAPS) 136/327 variables, 191/251 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/327 variables, 133/384 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/327 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 10 (OVERLAPS) 1/328 variables, 1/385 constraints. Problems are: Problem set: 0 solved, 133 unsolved
[2024-05-22 02:38:37] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 1 ms to minimize.
[2024-05-22 02:38:37] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
[2024-05-22 02:38:37] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 2 ms to minimize.
[2024-05-22 02:38:37] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/328 variables, 4/389 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/328 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 13 (OVERLAPS) 0/328 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 133 unsolved
No progress, stopping.
After SMT solving in domain Int declared 328/328 variables, and 389 constraints, problems are : Problem set: 0 solved, 133 unsolved in 27220 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 192/192 constraints, PredecessorRefiner: 133/133 constraints, Known Traps: 6/6 constraints]
After SMT, in 32418ms problems are : Problem set: 0 solved, 133 unsolved
Search for dead transitions found 0 dead transitions in 32420ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 32736 ms. Remains : 192/192 places, 136/136 transitions.
Built C files in :
/tmp/ltsmin12724701557244949405
[2024-05-22 02:38:52] [INFO ] Computing symmetric may disable matrix : 136 transitions.
[2024-05-22 02:38:52] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 02:38:52] [INFO ] Computing symmetric may enable matrix : 136 transitions.
[2024-05-22 02:38:52] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 02:38:52] [INFO ] Computing Do-Not-Accords matrix : 136 transitions.
[2024-05-22 02:38:52] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 02:38:52] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12724701557244949405
Running compilation step : cd /tmp/ltsmin12724701557244949405;'/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 358 ms.
Running link step : cd /tmp/ltsmin12724701557244949405;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin12724701557244949405;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12668078304664965658.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-22 02:39:08] [INFO ] Flatten gal took : 13 ms
[2024-05-22 02:39:08] [INFO ] Flatten gal took : 12 ms
[2024-05-22 02:39:08] [INFO ] Time to serialize gal into /tmp/LTL15646441849746105010.gal : 4 ms
[2024-05-22 02:39:08] [INFO ] Time to serialize properties into /tmp/LTL16951631333815791073.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15646441849746105010.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2054711573499468753.hoa' '-atoms' '/tmp/LTL16951631333815791073.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL16951631333815791073.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2054711573499468753.hoa
Detected timeout of ITS tools.
[2024-05-22 02:39:23] [INFO ] Flatten gal took : 11 ms
[2024-05-22 02:39:23] [INFO ] Flatten gal took : 11 ms
[2024-05-22 02:39:23] [INFO ] Time to serialize gal into /tmp/LTL3973371756321525008.gal : 4 ms
[2024-05-22 02:39:23] [INFO ] Time to serialize properties into /tmp/LTL3268698446525166111.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3973371756321525008.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3268698446525166111.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G(F("((p141==0)||(p11==1))"))))
Formula 0 simplified : FG!"((p141==0)||(p11==1))"
Detected timeout of ITS tools.
[2024-05-22 02:39:38] [INFO ] Flatten gal took : 11 ms
[2024-05-22 02:39:38] [INFO ] Applying decomposition
[2024-05-22 02:39:38] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph1827311810846113738.txt' '-o' '/tmp/graph1827311810846113738.bin' '-w' '/tmp/graph1827311810846113738.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1827311810846113738.bin' '-l' '-1' '-v' '-w' '/tmp/graph1827311810846113738.weights' '-q' '0' '-e' '0.001'
[2024-05-22 02:39:38] [INFO ] Decomposing Gal with order
[2024-05-22 02:39:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 02:39:38] [INFO ] Removed a total of 26 redundant transitions.
[2024-05-22 02:39:38] [INFO ] Flatten gal took : 40 ms
[2024-05-22 02:39:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 17 labels/synchronizations in 5 ms.
[2024-05-22 02:39:38] [INFO ] Time to serialize gal into /tmp/LTL6046469668770799782.gal : 4 ms
[2024-05-22 02:39:38] [INFO ] Time to serialize properties into /tmp/LTL9053062297025838566.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6046469668770799782.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9053062297025838566.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((G(F("((i5.u28.p141==0)||(i3.u14.p11==1))"))))
Formula 0 simplified : FG!"((i5.u28.p141==0)||(i3.u14.p11==1))"
Reverse transition relation is NOT exact ! Due to transitions t1, t97, t98, t130, u13.t90, u49.t5, u49.t31, i0.u2.t8, i0.u2.t51, i0.u2.t55, i0.u2.t56, i0.u...514
Computing Next relation with stutter on 850244 deadlock states
Detected timeout of ITS tools.
Treatment of property DES-PT-20a-LTLCardinality-05 finished in 175226 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 193 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 137/137 transitions.
Applied a total of 0 rules in 2 ms. Remains 193 /193 variables (removed 0) and now considering 137/137 (removed 0) transitions.
// Phase 1: matrix 137 rows 193 cols
[2024-05-22 02:39:53] [INFO ] Computed 58 invariants in 1 ms
[2024-05-22 02:39:53] [INFO ] Implicit Places using invariants in 250 ms returned []
[2024-05-22 02:39:53] [INFO ] Invariant cache hit.
[2024-05-22 02:39:53] [INFO ] Implicit Places using invariants and state equation in 245 ms returned []
Implicit Place search using SMT with State Equation took 521 ms to find 0 implicit places.
Running 136 sub problems to find dead transitions.
[2024-05-22 02:39:54] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (OVERLAPS) 1/193 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-22 02:39:54] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 13 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (OVERLAPS) 137/330 variables, 193/252 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-22 02:39:56] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-05-22 02:39:56] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 0 ms to minimize.
[2024-05-22 02:39:56] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/330 variables, 3/255 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/330 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-22 02:39:58] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/330 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/330 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 11 (OVERLAPS) 0/330 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Real declared 330/330 variables, and 256 constraints, problems are : Problem set: 0 solved, 136 unsolved in 6427 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 193/193 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 136 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (OVERLAPS) 1/193 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 5/63 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (OVERLAPS) 137/330 variables, 193/256 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/330 variables, 136/392 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-22 02:40:05] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/330 variables, 1/393 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/330 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 10 (OVERLAPS) 0/330 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Int declared 330/330 variables, and 393 constraints, problems are : Problem set: 0 solved, 136 unsolved in 29633 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 193/193 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 6/6 constraints]
After SMT, in 36109ms problems are : Problem set: 0 solved, 136 unsolved
Search for dead transitions found 0 dead transitions in 36111ms
Finished structural reductions in LTL mode , in 1 iterations and 36635 ms. Remains : 193/193 places, 137/137 transitions.
Stuttering acceptance computed with spot in 141 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-20a-LTLCardinality-06
Product exploration explored 100000 steps with 33333 reset in 217 ms.
Product exploration explored 100000 steps with 33333 reset in 232 ms.
Computed a total of 96 stabilizing places and 91 stable transitions
Computed a total of 96 stabilizing places and 91 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 20 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DES-PT-20a-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-20a-LTLCardinality-06 finished in 37271 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 193 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 137/137 transitions.
Applied a total of 0 rules in 3 ms. Remains 193 /193 variables (removed 0) and now considering 137/137 (removed 0) transitions.
[2024-05-22 02:40:30] [INFO ] Invariant cache hit.
[2024-05-22 02:40:30] [INFO ] Implicit Places using invariants in 116 ms returned []
[2024-05-22 02:40:30] [INFO ] Invariant cache hit.
[2024-05-22 02:40:31] [INFO ] Implicit Places using invariants and state equation in 199 ms returned []
Implicit Place search using SMT with State Equation took 316 ms to find 0 implicit places.
Running 136 sub problems to find dead transitions.
[2024-05-22 02:40:31] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (OVERLAPS) 1/193 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-22 02:40:31] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (OVERLAPS) 137/330 variables, 193/252 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-22 02:40:33] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
[2024-05-22 02:40:33] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 1 ms to minimize.
[2024-05-22 02:40:33] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/330 variables, 3/255 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/330 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-22 02:40:35] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 0 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/330 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/330 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 11 (OVERLAPS) 0/330 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Real declared 330/330 variables, and 256 constraints, problems are : Problem set: 0 solved, 136 unsolved in 6367 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 193/193 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 136 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (OVERLAPS) 1/193 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 5/63 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (OVERLAPS) 137/330 variables, 193/256 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/330 variables, 136/392 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-22 02:40:42] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/330 variables, 1/393 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/330 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 10 (OVERLAPS) 0/330 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Int declared 330/330 variables, and 393 constraints, problems are : Problem set: 0 solved, 136 unsolved in 29552 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 193/193 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 6/6 constraints]
After SMT, in 35956ms problems are : Problem set: 0 solved, 136 unsolved
Search for dead transitions found 0 dead transitions in 35957ms
Finished structural reductions in LTL mode , in 1 iterations and 36277 ms. Remains : 193/193 places, 137/137 transitions.
Stuttering acceptance computed with spot in 117 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-20a-LTLCardinality-07
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DES-PT-20a-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-20a-LTLCardinality-07 finished in 36417 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 193 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 193/193 places, 137/137 transitions.
Reduce places removed 1 places and 1 transitions.
Applied a total of 0 rules in 13 ms. Remains 192 /193 variables (removed 1) and now considering 136/137 (removed 1) transitions.
// Phase 1: matrix 136 rows 192 cols
[2024-05-22 02:41:07] [INFO ] Computed 58 invariants in 3 ms
[2024-05-22 02:41:07] [INFO ] Implicit Places using invariants in 118 ms returned []
[2024-05-22 02:41:07] [INFO ] Invariant cache hit.
[2024-05-22 02:41:07] [INFO ] Implicit Places using invariants and state equation in 184 ms returned []
Implicit Place search using SMT with State Equation took 303 ms to find 0 implicit places.
[2024-05-22 02:41:07] [INFO ] Redundant transitions in 3 ms returned []
Running 133 sub problems to find dead transitions.
[2024-05-22 02:41:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/189 variables, 18/50 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 133 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/191 variables, 8/58 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 5 (OVERLAPS) 136/327 variables, 191/249 constraints. Problems are: Problem set: 0 solved, 133 unsolved
[2024-05-22 02:41:09] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 1 ms to minimize.
[2024-05-22 02:41:09] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/327 variables, 2/251 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/327 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 8 (OVERLAPS) 1/328 variables, 1/252 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/328 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 10 (OVERLAPS) 0/328 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 133 unsolved
No progress, stopping.
After SMT solving in domain Real declared 328/328 variables, and 252 constraints, problems are : Problem set: 0 solved, 133 unsolved in 5093 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 192/192 constraints, PredecessorRefiner: 133/133 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 133 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/189 variables, 18/50 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 4 (OVERLAPS) 2/191 variables, 8/59 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 7 (OVERLAPS) 136/327 variables, 191/251 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/327 variables, 133/384 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/327 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 10 (OVERLAPS) 1/328 variables, 1/385 constraints. Problems are: Problem set: 0 solved, 133 unsolved
[2024-05-22 02:41:23] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 1 ms to minimize.
[2024-05-22 02:41:23] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
[2024-05-22 02:41:23] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-05-22 02:41:24] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/328 variables, 4/389 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/328 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 13 (OVERLAPS) 0/328 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 133 unsolved
No progress, stopping.
After SMT solving in domain Int declared 328/328 variables, and 389 constraints, problems are : Problem set: 0 solved, 133 unsolved in 26701 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 192/192 constraints, PredecessorRefiner: 133/133 constraints, Known Traps: 6/6 constraints]
After SMT, in 31834ms problems are : Problem set: 0 solved, 133 unsolved
Search for dead transitions found 0 dead transitions in 31836ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 32160 ms. Remains : 192/193 places, 136/137 transitions.
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-20a-LTLCardinality-09
Stuttering criterion allowed to conclude after 40 steps with 0 reset in 0 ms.
FORMULA DES-PT-20a-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-20a-LTLCardinality-09 finished in 32239 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 193 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 137/137 transitions.
Applied a total of 0 rules in 1 ms. Remains 193 /193 variables (removed 0) and now considering 137/137 (removed 0) transitions.
// Phase 1: matrix 137 rows 193 cols
[2024-05-22 02:41:39] [INFO ] Computed 58 invariants in 1 ms
[2024-05-22 02:41:39] [INFO ] Implicit Places using invariants in 102 ms returned []
[2024-05-22 02:41:39] [INFO ] Invariant cache hit.
[2024-05-22 02:41:39] [INFO ] Implicit Places using invariants and state equation in 182 ms returned []
Implicit Place search using SMT with State Equation took 293 ms to find 0 implicit places.
Running 136 sub problems to find dead transitions.
[2024-05-22 02:41:39] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (OVERLAPS) 1/193 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-22 02:41:40] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (OVERLAPS) 137/330 variables, 193/252 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-22 02:41:41] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-05-22 02:41:42] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
[2024-05-22 02:41:42] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/330 variables, 3/255 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/330 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-22 02:41:44] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/330 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/330 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 11 (OVERLAPS) 0/330 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Real declared 330/330 variables, and 256 constraints, problems are : Problem set: 0 solved, 136 unsolved in 6347 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 193/193 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 136 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (OVERLAPS) 1/193 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 5/63 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (OVERLAPS) 137/330 variables, 193/256 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/330 variables, 136/392 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-22 02:41:51] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/330 variables, 1/393 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/330 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 10 (OVERLAPS) 0/330 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Int declared 330/330 variables, and 393 constraints, problems are : Problem set: 0 solved, 136 unsolved in 29865 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 193/193 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 6/6 constraints]
After SMT, in 36259ms problems are : Problem set: 0 solved, 136 unsolved
Search for dead transitions found 0 dead transitions in 36260ms
Finished structural reductions in LTL mode , in 1 iterations and 36555 ms. Remains : 193/193 places, 137/137 transitions.
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-20a-LTLCardinality-10
Stuttering criterion allowed to conclude after 43 steps with 0 reset in 1 ms.
FORMULA DES-PT-20a-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-20a-LTLCardinality-10 finished in 36650 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0 U (G(p0)||(G(p2)&&p1))))))'
Support contains 4 out of 193 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 193/193 places, 137/137 transitions.
Applied a total of 0 rules in 9 ms. Remains 193 /193 variables (removed 0) and now considering 137/137 (removed 0) transitions.
[2024-05-22 02:42:16] [INFO ] Invariant cache hit.
[2024-05-22 02:42:16] [INFO ] Implicit Places using invariants in 115 ms returned []
[2024-05-22 02:42:16] [INFO ] Invariant cache hit.
[2024-05-22 02:42:16] [INFO ] Implicit Places using invariants and state equation in 193 ms returned []
Implicit Place search using SMT with State Equation took 310 ms to find 0 implicit places.
[2024-05-22 02:42:16] [INFO ] Redundant transitions in 1 ms returned []
Running 136 sub problems to find dead transitions.
[2024-05-22 02:42:16] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (OVERLAPS) 1/193 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-22 02:42:17] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (OVERLAPS) 137/330 variables, 193/252 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-22 02:42:18] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
[2024-05-22 02:42:18] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 1 ms to minimize.
[2024-05-22 02:42:18] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/330 variables, 3/255 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/330 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-22 02:42:20] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/330 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/330 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 11 (OVERLAPS) 0/330 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Real declared 330/330 variables, and 256 constraints, problems are : Problem set: 0 solved, 136 unsolved in 6363 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 193/193 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 136 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (OVERLAPS) 1/193 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 5/63 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (OVERLAPS) 137/330 variables, 193/256 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/330 variables, 136/392 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-22 02:42:27] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/330 variables, 1/393 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/330 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 10 (OVERLAPS) 0/330 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Int declared 330/330 variables, and 393 constraints, problems are : Problem set: 0 solved, 136 unsolved in 29684 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 193/193 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 6/6 constraints]
After SMT, in 36088ms problems are : Problem set: 0 solved, 136 unsolved
Search for dead transitions found 0 dead transitions in 36090ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 36422 ms. Remains : 193/193 places, 137/137 transitions.
Stuttering acceptance computed with spot in 117 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : DES-PT-20a-LTLCardinality-12
Product exploration explored 100000 steps with 2235 reset in 264 ms.
Product exploration explored 100000 steps with 2203 reset in 304 ms.
Computed a total of 96 stabilizing places and 91 stable transitions
Computed a total of 96 stabilizing places and 91 stable transitions
Detected a total of 96/193 stabilizing places and 91/137 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p1 p2 p0), (X p2), (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0))))), (X (NOT (AND (NOT p2) p0))), (X (AND p1 p2 p0)), (X (AND p2 p0)), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND p1 p2 (NOT p0)))), (X (NOT (AND p2 (NOT p0)))), (X (NOT (OR (AND (NOT p1) p0) (AND (NOT p2) p0)))), (X p0), (X p1), (X (X p2)), (X (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0)))))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND p2 p0))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (NOT (AND p2 (NOT p0))))), (X (X p0)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X (AND p1 p2 p0))), (X (X (NOT (AND p1 p2 p0)))), (X (X (OR (AND (NOT p1) p0) (AND (NOT p2) p0)))), (X (X (NOT (OR (AND (NOT p1) p0) (AND (NOT p2) p0))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 21 factoid took 326 ms. Reduced automaton from 3 states, 11 edges and 3 AP (stutter insensitive) to 3 states, 11 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 134 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2))]
RANDOM walk for 40000 steps (883 resets) in 1029 ms. (38 steps per ms) remains 8/12 properties
BEST_FIRST walk for 40002 steps (176 resets) in 139 ms. (285 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (181 resets) in 235 ms. (169 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (180 resets) in 270 ms. (147 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (180 resets) in 273 ms. (145 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (201 resets) in 259 ms. (153 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (177 resets) in 136 ms. (291 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (168 resets) in 145 ms. (273 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (191 resets) in 69 ms. (571 steps per ms) remains 8/8 properties
[2024-05-22 02:42:54] [INFO ] Invariant cache hit.
Problem apf6 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 2/6 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 75/81 variables, 32/33 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/33 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 83/164 variables, 23/56 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/164 variables, 0/56 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 6/170 variables, 2/58 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/170 variables, 0/58 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 136/306 variables, 170/228 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/306 variables, 0/228 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 24/330 variables, 23/251 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/330 variables, 0/251 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 0/330 variables, 0/251 constraints. Problems are: Problem set: 1 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 330/330 variables, and 251 constraints, problems are : Problem set: 1 solved, 7 unsolved in 297 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 193/193 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 2/6 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 75/81 variables, 32/33 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/33 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 83/164 variables, 23/56 constraints. Problems are: Problem set: 1 solved, 7 unsolved
[2024-05-22 02:42:54] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/164 variables, 1/57 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/164 variables, 0/57 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 6/170 variables, 2/59 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/170 variables, 0/59 constraints. Problems are: Problem set: 1 solved, 7 unsolved
Problem apf1 is UNSAT
At refinement iteration 10 (OVERLAPS) 136/306 variables, 170/229 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/306 variables, 1/230 constraints. Problems are: Problem set: 2 solved, 6 unsolved
[2024-05-22 02:42:55] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 0 ms to minimize.
[2024-05-22 02:42:55] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-05-22 02:42:55] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/306 variables, 3/233 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/306 variables, 0/233 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 24/330 variables, 23/256 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/330 variables, 5/261 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/330 variables, 0/261 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 0/330 variables, 0/261 constraints. Problems are: Problem set: 2 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 330/330 variables, and 261 constraints, problems are : Problem set: 2 solved, 6 unsolved in 774 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 193/193 constraints, PredecessorRefiner: 6/8 constraints, Known Traps: 4/4 constraints]
After SMT, in 1098ms problems are : Problem set: 2 solved, 6 unsolved
Fused 6 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 2286 ms.
Support contains 4 out of 193 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 193/193 places, 137/137 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 193 transition count 135
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 8 place count 193 transition count 135
Applied a total of 8 rules in 14 ms. Remains 193 /193 variables (removed 0) and now considering 135/137 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 193/193 places, 135/137 transitions.
RANDOM walk for 40000 steps (548 resets) in 169 ms. (235 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (90 resets) in 56 ms. (701 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (89 resets) in 63 ms. (625 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (94 resets) in 80 ms. (493 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (93 resets) in 74 ms. (533 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (78 resets) in 64 ms. (615 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (95 resets) in 60 ms. (655 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 722665 steps, run timeout after 3001 ms. (steps per millisecond=240 ) properties seen :0 out of 6
Probabilistic random walk after 722665 steps, saw 103848 distinct states, run finished after 3001 ms. (steps per millisecond=240 ) properties seen :0
// Phase 1: matrix 135 rows 193 cols
[2024-05-22 02:43:01] [INFO ] Computed 60 invariants in 1 ms
[2024-05-22 02:43:01] [INFO ] State equation strengthened by 3 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, 6 unsolved
At refinement iteration 1 (OVERLAPS) 2/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 81/87 variables, 34/35 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 86/173 variables, 25/60 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/173 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 135/308 variables, 173/233 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/308 variables, 3/236 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/308 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 20/328 variables, 20/256 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/328 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 0/328 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 328/328 variables, and 256 constraints, problems are : Problem set: 0 solved, 6 unsolved in 272 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 193/193 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 2/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 81/87 variables, 34/35 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 86/173 variables, 25/60 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/173 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 135/308 variables, 173/233 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/308 variables, 3/236 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/308 variables, 1/237 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/308 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 20/328 variables, 20/257 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/328 variables, 5/262 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/328 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 0/328 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 328/328 variables, and 262 constraints, problems are : Problem set: 0 solved, 6 unsolved in 541 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 193/193 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 820ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 2790 ms.
Support contains 4 out of 193 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 193/193 places, 135/135 transitions.
Applied a total of 0 rules in 5 ms. Remains 193 /193 variables (removed 0) and now considering 135/135 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 193/193 places, 135/135 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 193/193 places, 135/135 transitions.
Applied a total of 0 rules in 4 ms. Remains 193 /193 variables (removed 0) and now considering 135/135 (removed 0) transitions.
[2024-05-22 02:43:04] [INFO ] Invariant cache hit.
[2024-05-22 02:43:04] [INFO ] Implicit Places using invariants in 125 ms returned []
[2024-05-22 02:43:04] [INFO ] Invariant cache hit.
[2024-05-22 02:43:05] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-22 02:43:05] [INFO ] Implicit Places using invariants and state equation in 201 ms returned []
Implicit Place search using SMT with State Equation took 327 ms to find 0 implicit places.
[2024-05-22 02:43:05] [INFO ] Redundant transitions in 1 ms returned []
Running 134 sub problems to find dead transitions.
[2024-05-22 02:43:05] [INFO ] Invariant cache hit.
[2024-05-22 02:43:05] [INFO ] State equation strengthened by 3 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 2 (OVERLAPS) 1/193 variables, 35/46 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 14/60 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 5 (OVERLAPS) 135/328 variables, 193/253 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/328 variables, 3/256 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/328 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 134 unsolved
[2024-05-22 02:43:07] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/328 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/328 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 134 unsolved
[2024-05-22 02:43:10] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 3 ms to minimize.
[2024-05-22 02:43:10] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 0 ms to minimize.
[2024-05-22 02:43:10] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/328 variables, 3/260 constraints. Problems are: Problem set: 0 solved, 134 unsolved
[2024-05-22 02:43:11] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-05-22 02:43:11] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/328 variables, 2/262 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/328 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 13 (OVERLAPS) 0/328 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 134 unsolved
No progress, stopping.
After SMT solving in domain Real declared 328/328 variables, and 262 constraints, problems are : Problem set: 0 solved, 134 unsolved in 10150 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 193/193 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 134/134 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 134 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 2 (OVERLAPS) 1/193 variables, 35/46 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 14/60 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 6/66 constraints. Problems are: Problem set: 0 solved, 134 unsolved
[2024-05-22 02:43:15] [INFO ] Deduced a trap composed of 10 places in 18 ms of which 0 ms to minimize.
[2024-05-22 02:43:16] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 134 unsolved
[2024-05-22 02:43:16] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
[2024-05-22 02:43:16] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/193 variables, 2/70 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/193 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 8 (OVERLAPS) 135/328 variables, 193/263 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/328 variables, 3/266 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/328 variables, 134/400 constraints. Problems are: Problem set: 0 solved, 134 unsolved
[2024-05-22 02:43:19] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
[2024-05-22 02:43:20] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 0 ms to minimize.
[2024-05-22 02:43:20] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-05-22 02:43:20] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
[2024-05-22 02:43:21] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-05-22 02:43:22] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
[2024-05-22 02:43:22] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/328 variables, 7/407 constraints. Problems are: Problem set: 0 solved, 134 unsolved
[2024-05-22 02:43:29] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/328 variables, 1/408 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/328 variables, 0/408 constraints. Problems are: Problem set: 0 solved, 134 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 328/328 variables, and 408 constraints, problems are : Problem set: 0 solved, 134 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 193/193 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 134/134 constraints, Known Traps: 18/18 constraints]
After SMT, in 40213ms problems are : Problem set: 0 solved, 134 unsolved
Search for dead transitions found 0 dead transitions in 40217ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40561 ms. Remains : 193/193 places, 135/135 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 193 transition count 135
Applied a total of 1 rules in 16 ms. Remains 193 /193 variables (removed 0) and now considering 135/135 (removed 0) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 135 rows 193 cols
[2024-05-22 02:43:45] [INFO ] Computed 60 invariants in 2 ms
[2024-05-22 02:43:45] [INFO ] [Real]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-22 02:43:45] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 10 ms returned sat
[2024-05-22 02:43:45] [INFO ] After 89ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-22 02:43:45] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-22 02:43:45] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 9 ms returned sat
[2024-05-22 02:43:45] [INFO ] After 182ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
TRAPS : Iteration 0
[2024-05-22 02:43:45] [INFO ] After 346ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
[2024-05-22 02:43:46] [INFO ] After 582ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Over-approximation ignoring read arcs solved 0 properties in 694 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p1 p2 p0), (X p2), (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0))))), (X (NOT (AND (NOT p2) p0))), (X (AND p1 p2 p0)), (X (AND p2 p0)), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND p1 p2 (NOT p0)))), (X (NOT (AND p2 (NOT p0)))), (X (NOT (OR (AND (NOT p1) p0) (AND (NOT p2) p0)))), (X p0), (X p1), (X (X p2)), (X (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0)))))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND p2 p0))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (NOT (AND p2 (NOT p0))))), (X (X p0)), (F (OR (G p2) (G (NOT p2)))), (G (OR p0 (NOT p2) (NOT p1))), (G (OR p0 p2))]
False Knowledge obtained : [(X (X (AND p1 p2 p0))), (X (X (NOT (AND p1 p2 p0)))), (X (X (OR (AND (NOT p1) p0) (AND (NOT p2) p0)))), (X (X (NOT (OR (AND (NOT p1) p0) (AND (NOT p2) p0))))), (X (X p1)), (X (X (NOT p1))), (F (NOT (AND p2 p1))), (F (NOT (AND (OR (NOT p0) p2) (OR (NOT p0) p1)))), (F (NOT p1)), (F (NOT (AND p0 p2 p1)))]
Knowledge based reduction with 23 factoid took 465 ms. Reduced automaton from 3 states, 11 edges and 3 AP (stutter insensitive) to 3 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 128 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 109 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0), (AND (NOT p0) (NOT p2))]
Support contains 4 out of 193 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 193/193 places, 137/137 transitions.
Applied a total of 0 rules in 11 ms. Remains 193 /193 variables (removed 0) and now considering 137/137 (removed 0) transitions.
// Phase 1: matrix 137 rows 193 cols
[2024-05-22 02:43:46] [INFO ] Computed 58 invariants in 2 ms
[2024-05-22 02:43:46] [INFO ] Implicit Places using invariants in 202 ms returned []
[2024-05-22 02:43:47] [INFO ] Invariant cache hit.
[2024-05-22 02:43:47] [INFO ] Implicit Places using invariants and state equation in 201 ms returned []
Implicit Place search using SMT with State Equation took 426 ms to find 0 implicit places.
[2024-05-22 02:43:47] [INFO ] Redundant transitions in 0 ms returned []
Running 136 sub problems to find dead transitions.
[2024-05-22 02:43:47] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (OVERLAPS) 1/193 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-22 02:43:47] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (OVERLAPS) 137/330 variables, 193/252 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-22 02:43:49] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 1 ms to minimize.
[2024-05-22 02:43:49] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
[2024-05-22 02:43:49] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/330 variables, 3/255 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/330 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-22 02:43:51] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 2 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/330 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/330 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 11 (OVERLAPS) 0/330 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Real declared 330/330 variables, and 256 constraints, problems are : Problem set: 0 solved, 136 unsolved in 6172 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 193/193 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 136 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (OVERLAPS) 1/193 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 5/63 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (OVERLAPS) 137/330 variables, 193/256 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/330 variables, 136/392 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-22 02:43:58] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/330 variables, 1/393 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/330 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 10 (OVERLAPS) 0/330 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Int declared 330/330 variables, and 393 constraints, problems are : Problem set: 0 solved, 136 unsolved in 29569 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 193/193 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 6/6 constraints]
After SMT, in 35797ms problems are : Problem set: 0 solved, 136 unsolved
Search for dead transitions found 0 dead transitions in 35799ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 36242 ms. Remains : 193/193 places, 137/137 transitions.
Computed a total of 96 stabilizing places and 91 stable transitions
Computed a total of 96 stabilizing places and 91 stable transitions
Detected a total of 96/193 stabilizing places and 91/137 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p2 p1 p0), (X p2), (X (NOT (OR (AND p0 (NOT p2)) (AND p0 (NOT p1))))), (X (AND p0 p2 p1)), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X p0)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X (OR (AND p0 (NOT p2)) (AND p0 (NOT p1))))), (X (X (NOT (OR (AND p0 (NOT p2)) (AND p0 (NOT p1)))))), (X (X (AND p0 p2 p1))), (X (X (NOT (AND p0 p2 p1)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 13 factoid took 459 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter insensitive) to 3 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 138 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0), (AND (NOT p0) (NOT p2))]
RANDOM walk for 40000 steps (901 resets) in 145 ms. (273 steps per ms) remains 6/10 properties
BEST_FIRST walk for 40004 steps (187 resets) in 58 ms. (678 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (178 resets) in 88 ms. (449 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (189 resets) in 56 ms. (701 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (185 resets) in 127 ms. (312 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (178 resets) in 113 ms. (350 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (176 resets) in 144 ms. (275 steps per ms) remains 6/6 properties
[2024-05-22 02:44:23] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 2/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 75/80 variables, 32/33 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 84/164 variables, 23/56 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/164 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 6/170 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/170 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 136/306 variables, 170/228 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/306 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 24/330 variables, 23/251 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/330 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 0/330 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 330/330 variables, and 251 constraints, problems are : Problem set: 0 solved, 6 unsolved in 271 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 193/193 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 2/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 75/80 variables, 32/33 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 84/164 variables, 23/56 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-22 02:44:24] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/164 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/164 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 6/170 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/170 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem apf1 is UNSAT
At refinement iteration 10 (OVERLAPS) 136/306 variables, 170/229 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/306 variables, 1/230 constraints. Problems are: Problem set: 1 solved, 5 unsolved
[2024-05-22 02:44:24] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/306 variables, 1/231 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/306 variables, 0/231 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 24/330 variables, 23/254 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/330 variables, 4/258 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/330 variables, 0/258 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 0/330 variables, 0/258 constraints. Problems are: Problem set: 1 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 330/330 variables, and 258 constraints, problems are : Problem set: 1 solved, 5 unsolved in 702 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 193/193 constraints, PredecessorRefiner: 5/6 constraints, Known Traps: 2/2 constraints]
After SMT, in 987ms problems are : Problem set: 1 solved, 5 unsolved
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 2453 ms.
Support contains 3 out of 193 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 193/193 places, 137/137 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 193 transition count 135
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 8 place count 193 transition count 135
Applied a total of 8 rules in 10 ms. Remains 193 /193 variables (removed 0) and now considering 135/137 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 193/193 places, 135/137 transitions.
RANDOM walk for 40000 steps (537 resets) in 327 ms. (121 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (89 resets) in 100 ms. (396 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (90 resets) in 176 ms. (226 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (91 resets) in 105 ms. (377 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (97 resets) in 55 ms. (714 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (92 resets) in 117 ms. (339 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 714101 steps, run timeout after 3001 ms. (steps per millisecond=237 ) properties seen :0 out of 5
Probabilistic random walk after 714101 steps, saw 102654 distinct states, run finished after 3001 ms. (steps per millisecond=237 ) properties seen :0
// Phase 1: matrix 135 rows 193 cols
[2024-05-22 02:44:30] [INFO ] Computed 60 invariants in 2 ms
[2024-05-22 02:44:30] [INFO ] State equation strengthened by 3 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 2/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 81/86 variables, 34/35 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 87/173 variables, 25/60 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/173 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 135/308 variables, 173/233 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/308 variables, 3/236 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/308 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 20/328 variables, 20/256 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/328 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 0/328 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 328/328 variables, and 256 constraints, problems are : Problem set: 0 solved, 5 unsolved in 248 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 193/193 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 2/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 81/86 variables, 34/35 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 87/173 variables, 25/60 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-22 02:44:31] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 1 ms to minimize.
[2024-05-22 02:44:31] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/173 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/173 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 135/308 variables, 173/235 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/308 variables, 3/238 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/308 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-22 02:44:31] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/308 variables, 1/240 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/308 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 20/328 variables, 20/260 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/328 variables, 4/264 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/328 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 0/328 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 328/328 variables, and 264 constraints, problems are : Problem set: 0 solved, 5 unsolved in 682 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 193/193 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 3/3 constraints]
After SMT, in 939ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 3 properties in 1935 ms.
Support contains 3 out of 193 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 193/193 places, 135/135 transitions.
Applied a total of 0 rules in 4 ms. Remains 193 /193 variables (removed 0) and now considering 135/135 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 193/193 places, 135/135 transitions.
RANDOM walk for 40000 steps (534 resets) in 311 ms. (128 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (92 resets) in 74 ms. (533 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (89 resets) in 67 ms. (588 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1152822 steps, run timeout after 3001 ms. (steps per millisecond=384 ) properties seen :0 out of 2
Probabilistic random walk after 1152822 steps, saw 161605 distinct states, run finished after 3002 ms. (steps per millisecond=384 ) properties seen :0
[2024-05-22 02:44:36] [INFO ] Invariant cache hit.
[2024-05-22 02:44:36] [INFO ] State equation strengthened by 3 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 81/86 variables, 34/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 87/173 variables, 25/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/173 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 135/308 variables, 173/233 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/308 variables, 3/236 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/308 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 20/328 variables, 20/256 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/328 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/328 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 328/328 variables, and 256 constraints, problems are : Problem set: 0 solved, 2 unsolved in 165 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 193/193 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 81/86 variables, 34/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 87/173 variables, 25/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 02:44:37] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2024-05-22 02:44:37] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/173 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/173 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 135/308 variables, 173/235 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/308 variables, 3/238 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/308 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 02:44:37] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 1 ms to minimize.
[2024-05-22 02:44:37] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 1 ms to minimize.
[2024-05-22 02:44:37] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/308 variables, 3/242 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/308 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 20/328 variables, 20/262 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/328 variables, 1/263 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/328 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/328 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 328/328 variables, and 263 constraints, problems are : Problem set: 0 solved, 2 unsolved in 527 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 193/193 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 5/5 constraints]
After SMT, in 701ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 47099 steps, including 278 resets, run visited all 2 properties in 368 ms. (steps per millisecond=127 )
Parikh walk visited 2 properties in 374 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p2 p1 p0), (X p2), (X (NOT (OR (AND p0 (NOT p2)) (AND p0 (NOT p1))))), (X (AND p0 p2 p1)), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X p0)), (F (OR (G p2) (G (NOT p2)))), (G (OR p0 p2))]
False Knowledge obtained : [(X (X (OR (AND p0 (NOT p2)) (AND p0 (NOT p1))))), (X (X (NOT (OR (AND p0 (NOT p2)) (AND p0 (NOT p1)))))), (X (X (AND p0 p2 p1))), (X (X (NOT (AND p0 p2 p1)))), (X (X p1)), (X (X (NOT p1))), (F (NOT (AND p2 p1))), (F (NOT (AND (OR (NOT p0) p2) (OR (NOT p0) p1)))), (F (NOT (OR p0 (NOT p2)))), (F (NOT (OR (NOT p0) p2))), (F (NOT p2)), (F (NOT (AND p0 p2))), (F (NOT p0)), (F (NOT (AND p0 p2 p1))), (F (NOT p1))]
Knowledge based reduction with 14 factoid took 760 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter insensitive) to 3 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 125 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 121 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 117 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 2240 reset in 230 ms.
Product exploration explored 100000 steps with 2223 reset in 309 ms.
Built C files in :
/tmp/ltsmin5514924899234714716
[2024-05-22 02:44:39] [INFO ] Computing symmetric may disable matrix : 137 transitions.
[2024-05-22 02:44:39] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 02:44:39] [INFO ] Computing symmetric may enable matrix : 137 transitions.
[2024-05-22 02:44:39] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 02:44:39] [INFO ] Computing Do-Not-Accords matrix : 137 transitions.
[2024-05-22 02:44:39] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 02:44:39] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5514924899234714716
Running compilation step : cd /tmp/ltsmin5514924899234714716;'/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 347 ms.
Running link step : cd /tmp/ltsmin5514924899234714716;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin5514924899234714716;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15613756193287717203.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 193 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 193/193 places, 137/137 transitions.
Applied a total of 0 rules in 17 ms. Remains 193 /193 variables (removed 0) and now considering 137/137 (removed 0) transitions.
// Phase 1: matrix 137 rows 193 cols
[2024-05-22 02:44:54] [INFO ] Computed 58 invariants in 1 ms
[2024-05-22 02:44:54] [INFO ] Implicit Places using invariants in 113 ms returned []
[2024-05-22 02:44:54] [INFO ] Invariant cache hit.
[2024-05-22 02:44:54] [INFO ] Implicit Places using invariants and state equation in 188 ms returned []
Implicit Place search using SMT with State Equation took 305 ms to find 0 implicit places.
[2024-05-22 02:44:54] [INFO ] Redundant transitions in 1 ms returned []
Running 136 sub problems to find dead transitions.
[2024-05-22 02:44:55] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (OVERLAPS) 1/193 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-22 02:44:55] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (OVERLAPS) 137/330 variables, 193/252 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-22 02:44:57] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-05-22 02:44:57] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 0 ms to minimize.
[2024-05-22 02:44:57] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/330 variables, 3/255 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/330 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-22 02:44:59] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/330 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/330 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 11 (OVERLAPS) 0/330 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Real declared 330/330 variables, and 256 constraints, problems are : Problem set: 0 solved, 136 unsolved in 6301 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 193/193 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 136 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (OVERLAPS) 1/193 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 5/63 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (OVERLAPS) 137/330 variables, 193/256 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/330 variables, 136/392 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-22 02:45:06] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/330 variables, 1/393 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/330 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 10 (OVERLAPS) 0/330 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Int declared 330/330 variables, and 393 constraints, problems are : Problem set: 0 solved, 136 unsolved in 29896 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 193/193 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 6/6 constraints]
After SMT, in 36246ms problems are : Problem set: 0 solved, 136 unsolved
Search for dead transitions found 0 dead transitions in 36247ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 36575 ms. Remains : 193/193 places, 137/137 transitions.
Built C files in :
/tmp/ltsmin8917751127509440160
[2024-05-22 02:45:31] [INFO ] Computing symmetric may disable matrix : 137 transitions.
[2024-05-22 02:45:31] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 02:45:31] [INFO ] Computing symmetric may enable matrix : 137 transitions.
[2024-05-22 02:45:31] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 02:45:31] [INFO ] Computing Do-Not-Accords matrix : 137 transitions.
[2024-05-22 02:45:31] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 02:45:31] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8917751127509440160
Running compilation step : cd /tmp/ltsmin8917751127509440160;'/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 353 ms.
Running link step : cd /tmp/ltsmin8917751127509440160;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 25 ms.
Running LTSmin : cd /tmp/ltsmin8917751127509440160;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased3561147321629458689.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-22 02:45:46] [INFO ] Flatten gal took : 15 ms
[2024-05-22 02:45:46] [INFO ] Flatten gal took : 12 ms
[2024-05-22 02:45:46] [INFO ] Time to serialize gal into /tmp/LTL2263177446466844703.gal : 9 ms
[2024-05-22 02:45:46] [INFO ] Time to serialize properties into /tmp/LTL9189597974947783250.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2263177446466844703.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10873090165189078721.hoa' '-atoms' '/tmp/LTL9189597974947783250.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL9189597974947783250.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10873090165189078721.hoa
Detected timeout of ITS tools.
[2024-05-22 02:46:01] [INFO ] Flatten gal took : 18 ms
[2024-05-22 02:46:01] [INFO ] Flatten gal took : 10 ms
[2024-05-22 02:46:01] [INFO ] Time to serialize gal into /tmp/LTL3338268513650498489.gal : 2 ms
[2024-05-22 02:46:01] [INFO ] Time to serialize properties into /tmp/LTL7852621735889923841.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3338268513650498489.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7852621735889923841.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G(F(("((p25==0)||(p148==1))")U((G("((p25==0)||(p148==1))"))||((("(p40!=1)")&&(G("(p4!=1)")))&&("((p25==0)||(p148==1))")))))))
Formula 0 simplified : FG((!"(p40!=1)" | F!"(p4!=1)") U !"((p25==0)||(p148==1))")
Detected timeout of ITS tools.
[2024-05-22 02:46:16] [INFO ] Flatten gal took : 8 ms
[2024-05-22 02:46:16] [INFO ] Applying decomposition
[2024-05-22 02:46:16] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph12117309370675359252.txt' '-o' '/tmp/graph12117309370675359252.bin' '-w' '/tmp/graph12117309370675359252.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12117309370675359252.bin' '-l' '-1' '-v' '-w' '/tmp/graph12117309370675359252.weights' '-q' '0' '-e' '0.001'
[2024-05-22 02:46:16] [INFO ] Decomposing Gal with order
[2024-05-22 02:46:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 02:46:16] [INFO ] Removed a total of 14 redundant transitions.
[2024-05-22 02:46:16] [INFO ] Flatten gal took : 15 ms
[2024-05-22 02:46:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-22 02:46:16] [INFO ] Time to serialize gal into /tmp/LTL5300776707924112470.gal : 3 ms
[2024-05-22 02:46:16] [INFO ] Time to serialize properties into /tmp/LTL5385920798002095756.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5300776707924112470.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5385920798002095756.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((G(F(("((u47.p25==0)||(i8.u30.p148==1))")U((G("((u47.p25==0)||(i8.u30.p148==1))"))||((("(u47.p40!=1)")&&(G("(u13.p4!=1)")))&&("((u47...190
Formula 0 simplified : FG((!"(u47.p40!=1)" | F!"(u13.p4!=1)") U !"((u47.p25==0)||(i8.u30.p148==1))")
Reverse transition relation is NOT exact ! Due to transitions t1, t97, t98, t130, u12.t90, u13.t11, u47.t5, u47.t31, i0.u2.t8, i0.u2.t51, i0.u2.t55, i0.u2....516
Computing Next relation with stutter on 850244 deadlock states
Detected timeout of ITS tools.
Treatment of property DES-PT-20a-LTLCardinality-12 finished in 255609 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 193 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 193/193 places, 137/137 transitions.
Applied a total of 0 rules in 13 ms. Remains 193 /193 variables (removed 0) and now considering 137/137 (removed 0) transitions.
[2024-05-22 02:46:31] [INFO ] Invariant cache hit.
[2024-05-22 02:46:31] [INFO ] Implicit Places using invariants in 111 ms returned []
[2024-05-22 02:46:31] [INFO ] Invariant cache hit.
[2024-05-22 02:46:31] [INFO ] Implicit Places using invariants and state equation in 185 ms returned []
Implicit Place search using SMT with State Equation took 297 ms to find 0 implicit places.
[2024-05-22 02:46:31] [INFO ] Redundant transitions in 1 ms returned []
Running 136 sub problems to find dead transitions.
[2024-05-22 02:46:31] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (OVERLAPS) 1/193 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-22 02:46:32] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (OVERLAPS) 137/330 variables, 193/252 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-22 02:46:34] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-05-22 02:46:34] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 1 ms to minimize.
[2024-05-22 02:46:34] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/330 variables, 3/255 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/330 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-22 02:46:36] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/330 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/330 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 11 (OVERLAPS) 0/330 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Real declared 330/330 variables, and 256 constraints, problems are : Problem set: 0 solved, 136 unsolved in 6396 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 193/193 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 136 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (OVERLAPS) 1/193 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 5/63 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (OVERLAPS) 137/330 variables, 193/256 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/330 variables, 136/392 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-22 02:46:43] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/330 variables, 1/393 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/330 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 10 (OVERLAPS) 0/330 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Int declared 330/330 variables, and 393 constraints, problems are : Problem set: 0 solved, 136 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 193/193 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 6/6 constraints]
After SMT, in 36454ms problems are : Problem set: 0 solved, 136 unsolved
Search for dead transitions found 0 dead transitions in 36456ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 36776 ms. Remains : 193/193 places, 137/137 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-20a-LTLCardinality-13
Stuttering criterion allowed to conclude after 73 steps with 1 reset in 1 ms.
FORMULA DES-PT-20a-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-20a-LTLCardinality-13 finished in 36835 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 193 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 137/137 transitions.
Applied a total of 0 rules in 4 ms. Remains 193 /193 variables (removed 0) and now considering 137/137 (removed 0) transitions.
[2024-05-22 02:47:08] [INFO ] Invariant cache hit.
[2024-05-22 02:47:08] [INFO ] Implicit Places using invariants in 116 ms returned []
[2024-05-22 02:47:08] [INFO ] Invariant cache hit.
[2024-05-22 02:47:08] [INFO ] Implicit Places using invariants and state equation in 202 ms returned []
Implicit Place search using SMT with State Equation took 319 ms to find 0 implicit places.
Running 136 sub problems to find dead transitions.
[2024-05-22 02:47:08] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (OVERLAPS) 1/193 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-22 02:47:09] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (OVERLAPS) 137/330 variables, 193/252 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-22 02:47:10] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
[2024-05-22 02:47:11] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
[2024-05-22 02:47:11] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/330 variables, 3/255 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/330 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-22 02:47:13] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/330 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/330 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 11 (OVERLAPS) 0/330 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Real declared 330/330 variables, and 256 constraints, problems are : Problem set: 0 solved, 136 unsolved in 6397 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 193/193 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 136 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (OVERLAPS) 1/193 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 5/63 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (OVERLAPS) 137/330 variables, 193/256 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/330 variables, 136/392 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-22 02:47:20] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/330 variables, 1/393 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/330 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 10 (OVERLAPS) 0/330 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Int declared 330/330 variables, and 393 constraints, problems are : Problem set: 0 solved, 136 unsolved in 29910 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 193/193 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 6/6 constraints]
After SMT, in 36351ms problems are : Problem set: 0 solved, 136 unsolved
Search for dead transitions found 0 dead transitions in 36352ms
Finished structural reductions in LTL mode , in 1 iterations and 36675 ms. Remains : 193/193 places, 137/137 transitions.
Stuttering acceptance computed with spot in 117 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-20a-LTLCardinality-15
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DES-PT-20a-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-20a-LTLCardinality-15 finished in 36815 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0 U (G(p0)||(G(p2)&&p1))))))'
[2024-05-22 02:47:45] [INFO ] Flatten gal took : 13 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin3318266098062299827
[2024-05-22 02:47:45] [INFO ] Applying decomposition
[2024-05-22 02:47:45] [INFO ] Computing symmetric may disable matrix : 137 transitions.
[2024-05-22 02:47:45] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 02:47:45] [INFO ] Computing symmetric may enable matrix : 137 transitions.
[2024-05-22 02:47:45] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 02:47:45] [INFO ] Flatten gal took : 7 ms
[2024-05-22 02:47:45] [INFO ] Computing Do-Not-Accords matrix : 137 transitions.
[2024-05-22 02:47:45] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 02:47:45] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3318266098062299827
Running compilation step : cd /tmp/ltsmin3318266098062299827;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '360' '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'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph13659765410299048500.txt' '-o' '/tmp/graph13659765410299048500.bin' '-w' '/tmp/graph13659765410299048500.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13659765410299048500.bin' '-l' '-1' '-v' '-w' '/tmp/graph13659765410299048500.weights' '-q' '0' '-e' '0.001'
[2024-05-22 02:47:45] [INFO ] Decomposing Gal with order
[2024-05-22 02:47:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 02:47:45] [INFO ] Removed a total of 31 redundant transitions.
[2024-05-22 02:47:45] [INFO ] Flatten gal took : 12 ms
[2024-05-22 02:47:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 17 labels/synchronizations in 3 ms.
[2024-05-22 02:47:45] [INFO ] Time to serialize gal into /tmp/LTLCardinality839130644042487965.gal : 3 ms
[2024-05-22 02:47:45] [INFO ] Time to serialize properties into /tmp/LTLCardinality4459696794326220989.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality839130644042487965.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality4459696794326220989.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 2 LTL properties
Checking formula 0 : !((G(F("((i7.u28.p141==0)||(i3.u14.p11==1))"))))
Formula 0 simplified : FG!"((i7.u28.p141==0)||(i3.u14.p11==1))"
Compilation finished in 350 ms.
Running link step : cd /tmp/ltsmin3318266098062299827;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin3318266098062299827;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t1, t97, t98, t130, u13.t90, u49.t5, u49.t31, i0.u2.t8, i0.u2.t51, i0.u2.t55, i0.u2.t56, i0.u...517
Computing Next relation with stutter on 850244 deadlock states
97 unique states visited
0 strongly connected components in search stack
118 transitions explored
60 items max in DFS search stack
9813 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,98.1617,1562564,1,0,4.50027e+06,31121,2135,4.00448e+06,1963,169747,4692289
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA DES-PT-20a-LTLCardinality-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((G(F(("((u49.p25==0)||(i10.u32.p148==1))")U((G("((u49.p25==0)||(i10.u32.p148==1))"))||(("((u49.p40!=1)&&((u49.p25==0)||(i10.u32.p148...192
Formula 1 simplified : FG(!"((u49.p25==0)||(i10.u32.p148==1))" M (!"((u49.p40!=1)&&((u49.p25==0)||(i10.u32.p148==1)))" | F!"(i3.u15.p4!=1)"))
Computing Next relation with stutter on 850244 deadlock states
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.003: Loading model from ./gal.so
pins2lts-mc-linux64( 1/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.008: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.008: Initializing POR dependencies: labels 141, guards 137
pins2lts-mc-linux64( 3/ 8), 0.008: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.013: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.013: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.013: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.013: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.015: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.022: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.022: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.037: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.037: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.038: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.108: LTL layer: formula: [](<>((LTLAPp0==true)))
pins2lts-mc-linux64( 5/ 8), 0.119: "[](<>((LTLAPp0==true)))" is not a file, parsing as formula...
pins2lts-mc-linux64( 5/ 8), 0.119: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.207: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.212: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 0.227: There are 143 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.227: State length is 194, there are 140 groups
pins2lts-mc-linux64( 0/ 8), 0.227: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.227: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.227: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.227: Visible groups: 0 / 140, labels: 1 / 143
pins2lts-mc-linux64( 0/ 8), 0.227: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 0.227: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 1/ 8), 0.242: [Blue] ~60 levels ~960 states ~1408 transitions
pins2lts-mc-linux64( 1/ 8), 0.261: [Blue] ~61 levels ~1920 states ~2624 transitions
pins2lts-mc-linux64( 1/ 8), 0.285: [Blue] ~61 levels ~3840 states ~5616 transitions
pins2lts-mc-linux64( 6/ 8), 0.330: [Blue] ~70 levels ~7680 states ~11960 transitions
pins2lts-mc-linux64( 6/ 8), 0.413: [Blue] ~865 levels ~15360 states ~23288 transitions
pins2lts-mc-linux64( 6/ 8), 0.550: [Blue] ~1738 levels ~30720 states ~44472 transitions
pins2lts-mc-linux64( 4/ 8), 0.829: [Blue] ~1411 levels ~61440 states ~86608 transitions
pins2lts-mc-linux64( 4/ 8), 1.322: [Blue] ~1717 levels ~122880 states ~179072 transitions
pins2lts-mc-linux64( 6/ 8), 2.279: [Blue] ~2511 levels ~245760 states ~345416 transitions
pins2lts-mc-linux64( 6/ 8), 3.809: [Blue] ~2511 levels ~491520 states ~684504 transitions
pins2lts-mc-linux64( 4/ 8), 6.178: [Blue] ~1753 levels ~983040 states ~1477544 transitions
pins2lts-mc-linux64( 6/ 8), 10.484: [Blue] ~4321 levels ~1966080 states ~2999624 transitions
pins2lts-mc-linux64( 6/ 8), 18.599: [Blue] ~4321 levels ~3932160 states ~6104936 transitions
pins2lts-mc-linux64( 4/ 8), 37.151: [Blue] ~3850 levels ~7864320 states ~11826264 transitions
pins2lts-mc-linux64( 4/ 8), 74.006: [Blue] ~5525 levels ~15728640 states ~23715400 transitions
pins2lts-mc-linux64( 4/ 8), 145.763: [Blue] ~5525 levels ~31457280 states ~48844104 transitions
pins2lts-mc-linux64( 7/ 8), 297.471: [Blue] ~6376 levels ~62914560 states ~115842008 transitions
pins2lts-mc-linux64( 7/ 8), 599.445: [Blue] ~7651 levels ~125829120 states ~203833672 transitions
pins2lts-mc-linux64( 0/ 8), 662.913: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 663.030:
pins2lts-mc-linux64( 0/ 8), 663.030: Explored 123897429 states 170077151 transitions, fanout: 1.373
pins2lts-mc-linux64( 0/ 8), 663.030: Total exploration time 662.780 sec (662.670 sec minimum, 662.711 sec on average)
pins2lts-mc-linux64( 0/ 8), 663.030: States per second: 186936, Transitions per second: 256612
pins2lts-mc-linux64( 0/ 8), 663.030:
pins2lts-mc-linux64( 0/ 8), 663.030: State space has 120216069 states, 21930667 are accepting
pins2lts-mc-linux64( 0/ 8), 663.030: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 663.030: blue states: 123897429 (103.06%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 663.030: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 663.030: all-red states: 21930667 (18.24%), bogus 13506 (0.01%)
pins2lts-mc-linux64( 0/ 8), 663.030:
pins2lts-mc-linux64( 0/ 8), 663.030: Total memory used for local state coloring: 9.7MB
pins2lts-mc-linux64( 0/ 8), 663.030:
pins2lts-mc-linux64( 0/ 8), 663.030: Queue width: 8B, total height: 633841, memory: 4.84MB
pins2lts-mc-linux64( 0/ 8), 663.030: Tree memory: 1173.2MB, 10.2 B/state, compr.: 1.3%
pins2lts-mc-linux64( 0/ 8), 663.030: Tree fill ratio (roots/leafs): 89.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 663.030: Stored 137 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 663.030: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 663.030: Est. total memory use: 1178.0MB (~1028.8MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin3318266098062299827;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin3318266098062299827;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:241)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:176)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:114)
at java.base/java.lang.Thread.run(Thread.java:840)
Detected timeout of ITS tools.
[2024-05-22 03:11:56] [INFO ] Applying decomposition
[2024-05-22 03:11:56] [INFO ] Flatten gal took : 7 ms
[2024-05-22 03:11:56] [INFO ] Decomposing Gal with order
[2024-05-22 03:11:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 03:11:56] [INFO ] Removed a total of 153 redundant transitions.
[2024-05-22 03:11:56] [INFO ] Flatten gal took : 31 ms
[2024-05-22 03:11:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 84 labels/synchronizations in 6 ms.
[2024-05-22 03:11:56] [INFO ] Time to serialize gal into /tmp/LTLCardinality83106222014402902.gal : 2 ms
[2024-05-22 03:11:56] [INFO ] Time to serialize properties into /tmp/LTLCardinality3112583944408264350.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality83106222014402902.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality3112583944408264350.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...274
Read 1 LTL properties
Checking formula 0 : !((G(F(("((u2.p25==0)||(u38.p148==1))")U((G("((u2.p25==0)||(u38.p148==1))"))||(("((u2.p40!=1)&&((u2.p25==0)||(u38.p148==1)))")&&(G("(u...172
Formula 0 simplified : FG(!"((u2.p25==0)||(u38.p148==1))" M (!"((u2.p40!=1)&&((u2.p25==0)||(u38.p148==1)))" | F!"(u1.p4!=1)"))
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t30, t50, t70, t77, t97, t98, t106, t128, t130, t134, u5.t10, u6.t9, u7.t8, u12.t135,...278
Computing Next relation with stutter on 850244 deadlock states

BK_TIME_CONFINEMENT_REACHED

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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="DES-PT-20a"
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 DES-PT-20a, 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 r092-tall-171624189800683"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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