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.r480-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 ltsminxred
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 r480-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 1717193439951

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-20a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 22:10:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-31 22:10:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 22:10:41] [INFO ] Load time of PNML (sax parser for PT used): 88 ms
[2024-05-31 22:10:41] [INFO ] Transformed 195 places.
[2024-05-31 22:10:41] [INFO ] Transformed 152 transitions.
[2024-05-31 22:10:41] [INFO ] Found NUPN structural information;
[2024-05-31 22:10:41] [INFO ] Parsed PT model containing 195 places and 152 transitions and 742 arcs in 216 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 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 38 ms. Remains 194 /195 variables (removed 1) and now considering 137/138 (removed 1) transitions.
// Phase 1: matrix 137 rows 194 cols
[2024-05-31 22:10:41] [INFO ] Computed 59 invariants in 30 ms
[2024-05-31 22:10:42] [INFO ] Implicit Places using invariants in 564 ms returned [92]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 599 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 6 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 662 ms. Remains : 193/195 places, 137/138 transitions.
Support contains 23 out of 193 places after structural reductions.
[2024-05-31 22:10:42] [INFO ] Flatten gal took : 45 ms
[2024-05-31 22:10:42] [INFO ] Flatten gal took : 26 ms
[2024-05-31 22:10:42] [INFO ] Input system was already deterministic with 137 transitions.
RANDOM walk for 40000 steps (909 resets) in 2069 ms. (19 steps per ms) remains 8/14 properties
BEST_FIRST walk for 40004 steps (194 resets) in 264 ms. (150 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (175 resets) in 161 ms. (246 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (172 resets) in 114 ms. (347 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (174 resets) in 147 ms. (270 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (179 resets) in 119 ms. (333 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (183 resets) in 153 ms. (259 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (174 resets) in 149 ms. (266 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (171 resets) in 147 ms. (270 steps per ms) remains 8/8 properties
// Phase 1: matrix 137 rows 193 cols
[2024-05-31 22:10:43] [INFO ] Computed 58 invariants in 8 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 565 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-31 22:10:44] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 18 ms to minimize.
[2024-05-31 22:10:44] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 2 ms to minimize.
[2024-05-31 22:10:44] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
[2024-05-31 22:10:45] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-05-31 22:10:45] [INFO ] Deduced a trap composed of 12 places in 39 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-31 22:10:45] [INFO ] Deduced a trap composed of 9 places in 59 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 1986 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 2601ms problems are : Problem set: 0 solved, 8 unsolved
Parikh walk visited 1 properties in 7992 ms.
Support contains 10 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 21 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 21 ms. Remains : 193/193 places, 135/137 transitions.
RANDOM walk for 40000 steps (533 resets) in 882 ms. (45 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (87 resets) in 113 ms. (350 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (81 resets) in 122 ms. (325 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (91 resets) in 116 ms. (341 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (86 resets) in 126 ms. (314 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40003 steps (90 resets) in 94 ms. (421 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (94 resets) in 87 ms. (454 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (89 resets) in 82 ms. (481 steps per ms) remains 6/6 properties
// Phase 1: matrix 135 rows 193 cols
[2024-05-31 22:10:54] [INFO ] Computed 60 invariants in 4 ms
[2024-05-31 22:10:54] [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 282 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-31 22:10:55] [INFO ] Deduced a trap composed of 11 places in 40 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-31 22:10:55] [INFO ] Deduced a trap composed of 13 places in 47 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-31 22:10:55] [INFO ] Deduced a trap composed of 8 places in 48 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 1180 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 1476ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 4124 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 29 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 29 ms. Remains : 193/193 places, 135/135 transitions.
RANDOM walk for 40000 steps (533 resets) in 231 ms. (172 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (90 resets) in 83 ms. (476 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (89 resets) in 71 ms. (555 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (97 resets) in 85 ms. (465 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (84 resets) in 73 ms. (540 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (95 resets) in 55 ms. (714 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (86 resets) in 56 ms. (701 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 858470 steps, run timeout after 3001 ms. (steps per millisecond=286 ) properties seen :0 out of 6
Probabilistic random walk after 858470 steps, saw 122280 distinct states, run finished after 3005 ms. (steps per millisecond=285 ) properties seen :0
[2024-05-31 22:11:03] [INFO ] Invariant cache hit.
[2024-05-31 22:11:03] [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 369 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-31 22:11:04] [INFO ] Deduced a trap composed of 13 places in 56 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-31 22:11:04] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/310 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/310 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 18/328 variables, 18/260 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/328 variables, 4/264 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/328 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 0/328 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 328/328 variables, and 264 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1002 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: 2/2 constraints]
After SMT, in 1381ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 5485 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 18 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 18 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 9 ms. Remains 193 /193 variables (removed 0) and now considering 135/135 (removed 0) transitions.
[2024-05-31 22:11:10] [INFO ] Invariant cache hit.
[2024-05-31 22:11:10] [INFO ] Implicit Places using invariants in 144 ms returned []
[2024-05-31 22:11:10] [INFO ] Invariant cache hit.
[2024-05-31 22:11:11] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-31 22:11:11] [INFO ] Implicit Places using invariants and state equation in 257 ms returned []
Implicit Place search using SMT with State Equation took 401 ms to find 0 implicit places.
[2024-05-31 22:11:11] [INFO ] Redundant transitions in 3 ms returned []
Running 134 sub problems to find dead transitions.
[2024-05-31 22:11:11] [INFO ] Invariant cache hit.
[2024-05-31 22:11:11] [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-31 22:11:13] [INFO ] Deduced a trap composed of 17 places in 44 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-31 22:11:16] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 1 ms to minimize.
[2024-05-31 22:11:16] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 1 ms to minimize.
[2024-05-31 22:11:16] [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-31 22:11:17] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-05-31 22:11:17] [INFO ] Deduced a trap composed of 13 places in 39 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 10035 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-31 22:11:21] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 0 ms to minimize.
[2024-05-31 22:11:22] [INFO ] Deduced a trap composed of 9 places in 30 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-31 22:11:22] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 1 ms to minimize.
[2024-05-31 22:11:22] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 2 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-31 22:11:26] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-05-31 22:11:26] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 1 ms to minimize.
[2024-05-31 22:11:26] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 0 ms to minimize.
[2024-05-31 22:11:26] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 1 ms to minimize.
[2024-05-31 22:11:27] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-05-31 22:11:28] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
[2024-05-31 22:11:28] [INFO ] Deduced a trap composed of 17 places in 47 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-31 22:11:35] [INFO ] Deduced a trap composed of 16 places in 62 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 30019 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 40134ms problems are : Problem set: 0 solved, 134 unsolved
Search for dead transitions found 0 dead transitions in 40138ms
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 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-31 22:11:51] [INFO ] Computed 60 invariants in 8 ms
[2024-05-31 22:11:51] [INFO ] [Real]Absence check using 35 positive place invariants in 7 ms returned sat
[2024-05-31 22:11:51] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 15 ms returned sat
[2024-05-31 22:11:51] [INFO ] After 99ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-31 22:11:51] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-31 22:11:51] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 10 ms returned sat
[2024-05-31 22:11:51] [INFO ] After 119ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
TRAPS : Iteration 0
[2024-05-31 22:11:51] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
[2024-05-31 22:11:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 52 ms
TRAPS : Iteration 1
[2024-05-31 22:11:51] [INFO ] After 402ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
[2024-05-31 22:11:52] [INFO ] After 562ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Over-approximation ignoring read arcs solved 0 properties in 711 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-31 22:11:52] [INFO ] Computed 58 invariants in 6 ms
[2024-05-31 22:11:52] [INFO ] Implicit Places using invariants in 126 ms returned []
[2024-05-31 22:11:52] [INFO ] Invariant cache hit.
[2024-05-31 22:11:52] [INFO ] Implicit Places using invariants and state equation in 196 ms returned []
Implicit Place search using SMT with State Equation took 326 ms to find 0 implicit places.
Running 136 sub problems to find dead transitions.
[2024-05-31 22:11:52] [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-31 22:11:53] [INFO ] Deduced a trap composed of 12 places in 39 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-31 22:11:54] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
[2024-05-31 22:11:55] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 0 ms to minimize.
[2024-05-31 22:11:55] [INFO ] Deduced a trap composed of 13 places in 42 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-31 22:11:56] [INFO ] Deduced a trap composed of 9 places in 32 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 6378 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-31 22:12:03] [INFO ] Deduced a trap composed of 17 places in 66 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 29364 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 35789ms problems are : Problem set: 0 solved, 136 unsolved
Search for dead transitions found 0 dead transitions in 35792ms
Finished structural reductions in LTL mode , in 1 iterations and 36123 ms. Remains : 193/193 places, 137/137 transitions.
Stuttering acceptance computed with spot in 309 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 39 steps with 0 reset in 2 ms.
FORMULA DES-PT-20a-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-20a-LTLCardinality-04 finished in 36508 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 24 ms. Remains 192 /193 variables (removed 1) and now considering 136/137 (removed 1) transitions.
// Phase 1: matrix 136 rows 192 cols
[2024-05-31 22:12:28] [INFO ] Computed 58 invariants in 3 ms
[2024-05-31 22:12:28] [INFO ] Implicit Places using invariants in 255 ms returned []
[2024-05-31 22:12:28] [INFO ] Invariant cache hit.
[2024-05-31 22:12:29] [INFO ] Implicit Places using invariants and state equation in 178 ms returned []
Implicit Place search using SMT with State Equation took 435 ms to find 0 implicit places.
[2024-05-31 22:12:29] [INFO ] Redundant transitions in 3 ms returned []
Running 133 sub problems to find dead transitions.
[2024-05-31 22:12:29] [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-31 22:12:30] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 1 ms to minimize.
[2024-05-31 22:12:30] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 2 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 5188 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-31 22:12:45] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 1 ms to minimize.
[2024-05-31 22:12:45] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
[2024-05-31 22:12:45] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
[2024-05-31 22:12:45] [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 26908 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 32141ms problems are : Problem set: 0 solved, 133 unsolved
Search for dead transitions found 0 dead transitions in 32142ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 32610 ms. Remains : 192/193 places, 136/137 transitions.
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-20a-LTLCardinality-05
Product exploration explored 100000 steps with 2470 reset in 369 ms.
Product exploration explored 100000 steps with 2458 reset in 272 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 108 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 104 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 797 steps (16 resets) in 18 ms. (41 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 102 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 55 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 14 ms. Remains 192 /192 variables (removed 0) and now considering 136/136 (removed 0) transitions.
[2024-05-31 22:13:02] [INFO ] Invariant cache hit.
[2024-05-31 22:13:02] [INFO ] Implicit Places using invariants in 119 ms returned []
[2024-05-31 22:13:02] [INFO ] Invariant cache hit.
[2024-05-31 22:13:02] [INFO ] Implicit Places using invariants and state equation in 205 ms returned []
Implicit Place search using SMT with State Equation took 327 ms to find 0 implicit places.
[2024-05-31 22:13:02] [INFO ] Redundant transitions in 3 ms returned []
Running 133 sub problems to find dead transitions.
[2024-05-31 22:13:02] [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-31 22:13:04] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 1 ms to minimize.
[2024-05-31 22:13:04] [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 5125 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-31 22:13:19] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 1 ms to minimize.
[2024-05-31 22:13:19] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 2 ms to minimize.
[2024-05-31 22:13:19] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
[2024-05-31 22:13:19] [INFO ] Deduced a trap composed of 16 places in 51 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 26758 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 31926ms problems are : Problem set: 0 solved, 133 unsolved
Search for dead transitions found 0 dead transitions in 31928ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 32278 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 84 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 407 steps (6 resets) in 11 ms. (33 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 106 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)]
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2463 reset in 203 ms.
Product exploration explored 100000 steps with 2446 reset in 221 ms.
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-31 22:13:35] [INFO ] Invariant cache hit.
[2024-05-31 22:13:35] [INFO ] Implicit Places using invariants in 131 ms returned []
[2024-05-31 22:13:35] [INFO ] Invariant cache hit.
[2024-05-31 22:13:36] [INFO ] Implicit Places using invariants and state equation in 192 ms returned []
Implicit Place search using SMT with State Equation took 325 ms to find 0 implicit places.
[2024-05-31 22:13:36] [INFO ] Redundant transitions in 3 ms returned []
Running 133 sub problems to find dead transitions.
[2024-05-31 22:13:36] [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-31 22:13:37] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 1 ms to minimize.
[2024-05-31 22:13:37] [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 5163 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-31 22:13:52] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 2 ms to minimize.
[2024-05-31 22:13:52] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-05-31 22:13:52] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
[2024-05-31 22:13:52] [INFO ] Deduced a trap composed of 16 places in 51 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 26905 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 32107ms problems are : Problem set: 0 solved, 133 unsolved
Search for dead transitions found 0 dead transitions in 32109ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 32456 ms. Remains : 192/192 places, 136/136 transitions.
Treatment of property DES-PT-20a-LTLCardinality-05 finished in 99622 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-31 22:14:08] [INFO ] Computed 58 invariants in 2 ms
[2024-05-31 22:14:08] [INFO ] Implicit Places using invariants in 117 ms returned []
[2024-05-31 22:14:08] [INFO ] Invariant cache hit.
[2024-05-31 22:14:08] [INFO ] Implicit Places using invariants and state equation in 217 ms returned []
Implicit Place search using SMT with State Equation took 335 ms to find 0 implicit places.
Running 136 sub problems to find dead transitions.
[2024-05-31 22:14: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-31 22:14:09] [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-31 22:14:10] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 1 ms to minimize.
[2024-05-31 22:14:11] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 0 ms to minimize.
[2024-05-31 22:14:11] [INFO ] Deduced a trap composed of 13 places in 34 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-31 22:14:13] [INFO ] Deduced a trap composed of 9 places in 48 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 6587 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-31 22:14:20] [INFO ] Deduced a trap composed of 17 places in 55 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 29810 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 36435ms problems are : Problem set: 0 solved, 136 unsolved
Search for dead transitions found 0 dead transitions in 36437ms
Finished structural reductions in LTL mode , in 1 iterations and 36774 ms. Remains : 193/193 places, 137/137 transitions.
Stuttering acceptance computed with spot in 93 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 246 ms.
Product exploration explored 100000 steps with 33333 reset in 290 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 18 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 37439 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 2 ms. Remains 193 /193 variables (removed 0) and now considering 137/137 (removed 0) transitions.
[2024-05-31 22:14:45] [INFO ] Invariant cache hit.
[2024-05-31 22:14:45] [INFO ] Implicit Places using invariants in 172 ms returned []
[2024-05-31 22:14:45] [INFO ] Invariant cache hit.
[2024-05-31 22:14:46] [INFO ] Implicit Places using invariants and state equation in 236 ms returned []
Implicit Place search using SMT with State Equation took 420 ms to find 0 implicit places.
Running 136 sub problems to find dead transitions.
[2024-05-31 22:14:46] [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-31 22:14:46] [INFO ] Deduced a trap composed of 12 places in 34 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-31 22:14:48] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 1 ms to minimize.
[2024-05-31 22:14:48] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 1 ms to minimize.
[2024-05-31 22:14:48] [INFO ] Deduced a trap composed of 13 places in 51 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-31 22:14:50] [INFO ] Deduced a trap composed of 9 places in 33 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 6530 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-31 22:14:57] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 2 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 30012 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 36593ms problems are : Problem set: 0 solved, 136 unsolved
Search for dead transitions found 0 dead transitions in 36595ms
Finished structural reductions in LTL mode , in 1 iterations and 37018 ms. Remains : 193/193 places, 137/137 transitions.
Stuttering acceptance computed with spot in 83 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 37117 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 8 ms. Remains 192 /193 variables (removed 1) and now considering 136/137 (removed 1) transitions.
// Phase 1: matrix 136 rows 192 cols
[2024-05-31 22:15:22] [INFO ] Computed 58 invariants in 2 ms
[2024-05-31 22:15:23] [INFO ] Implicit Places using invariants in 150 ms returned []
[2024-05-31 22:15:23] [INFO ] Invariant cache hit.
[2024-05-31 22:15:23] [INFO ] Implicit Places using invariants and state equation in 275 ms returned []
Implicit Place search using SMT with State Equation took 450 ms to find 0 implicit places.
[2024-05-31 22:15:23] [INFO ] Redundant transitions in 1 ms returned []
Running 133 sub problems to find dead transitions.
[2024-05-31 22:15:23] [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-31 22:15:25] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 1 ms to minimize.
[2024-05-31 22:15:25] [INFO ] Deduced a trap composed of 12 places in 51 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 5134 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-31 22:15:39] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 2 ms to minimize.
[2024-05-31 22:15:39] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-05-31 22:15:39] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2024-05-31 22:15:40] [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 26704 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 31906ms problems are : Problem set: 0 solved, 133 unsolved
Search for dead transitions found 0 dead transitions in 31912ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 32376 ms. Remains : 192/193 places, 136/137 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-20a-LTLCardinality-09
Stuttering criterion allowed to conclude after 33 steps with 0 reset in 1 ms.
FORMULA DES-PT-20a-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-20a-LTLCardinality-09 finished in 32427 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 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-31 22:15:55] [INFO ] Computed 58 invariants in 3 ms
[2024-05-31 22:15:55] [INFO ] Implicit Places using invariants in 339 ms returned []
[2024-05-31 22:15:55] [INFO ] Invariant cache hit.
[2024-05-31 22:15:55] [INFO ] Implicit Places using invariants and state equation in 220 ms returned []
Implicit Place search using SMT with State Equation took 584 ms to find 0 implicit places.
Running 136 sub problems to find dead transitions.
[2024-05-31 22:15: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-31 22:15:56] [INFO ] Deduced a trap composed of 12 places in 35 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-31 22:15:58] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
[2024-05-31 22:15:58] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 1 ms to minimize.
[2024-05-31 22:15:58] [INFO ] Deduced a trap composed of 13 places in 46 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-31 22:16:00] [INFO ] Deduced a trap composed of 9 places in 44 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 6417 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-31 22:16:07] [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 29675 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 36150ms problems are : Problem set: 0 solved, 136 unsolved
Search for dead transitions found 0 dead transitions in 36151ms
Finished structural reductions in LTL mode , in 1 iterations and 36738 ms. Remains : 193/193 places, 137/137 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-20a-LTLCardinality-10
Stuttering criterion allowed to conclude after 34 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 36822 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 6 ms. Remains 193 /193 variables (removed 0) and now considering 137/137 (removed 0) transitions.
[2024-05-31 22:16:32] [INFO ] Invariant cache hit.
[2024-05-31 22:16:32] [INFO ] Implicit Places using invariants in 133 ms returned []
[2024-05-31 22:16:32] [INFO ] Invariant cache hit.
[2024-05-31 22:16:32] [INFO ] Implicit Places using invariants and state equation in 203 ms returned []
Implicit Place search using SMT with State Equation took 365 ms to find 0 implicit places.
[2024-05-31 22:16:32] [INFO ] Redundant transitions in 0 ms returned []
Running 136 sub problems to find dead transitions.
[2024-05-31 22:16:32] [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-31 22:16:33] [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-31 22:16:34] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 1 ms to minimize.
[2024-05-31 22:16:35] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 0 ms to minimize.
[2024-05-31 22:16:35] [INFO ] Deduced a trap composed of 13 places in 42 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-31 22:16:37] [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 6628 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-31 22:16:44] [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 29335 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 36047ms problems are : Problem set: 0 solved, 136 unsolved
Search for dead transitions found 0 dead transitions in 36049ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 36427 ms. Remains : 193/193 places, 137/137 transitions.
Stuttering acceptance computed with spot in 111 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 2224 reset in 281 ms.
Product exploration explored 100000 steps with 2230 reset in 294 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 480 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 123 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 (895 resets) in 866 ms. (46 steps per ms) remains 8/12 properties
BEST_FIRST walk for 40003 steps (168 resets) in 190 ms. (209 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (188 resets) in 229 ms. (173 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (173 resets) in 276 ms. (144 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (186 resets) in 323 ms. (123 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (203 resets) in 252 ms. (158 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (185 resets) in 168 ms. (236 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (182 resets) in 104 ms. (380 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (179 resets) in 102 ms. (388 steps per ms) remains 8/8 properties
[2024-05-31 22:17:10] [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 451 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-31 22:17:11] [INFO ] Deduced a trap composed of 9 places in 48 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-31 22:17:11] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 1 ms to minimize.
[2024-05-31 22:17:11] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
[2024-05-31 22:17:11] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 0 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 862 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 1353ms problems are : Problem set: 2 solved, 6 unsolved
Fused 6 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 1318 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 13 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 13 ms. Remains : 193/193 places, 135/137 transitions.
RANDOM walk for 40000 steps (539 resets) in 363 ms. (109 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (91 resets) in 93 ms. (425 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (89 resets) in 139 ms. (285 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (87 resets) in 129 ms. (307 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (91 resets) in 100 ms. (396 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (79 resets) in 155 ms. (256 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (96 resets) in 144 ms. (275 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 614625 steps, run timeout after 3001 ms. (steps per millisecond=204 ) properties seen :0 out of 6
Probabilistic random walk after 614625 steps, saw 88345 distinct states, run finished after 3001 ms. (steps per millisecond=204 ) properties seen :0
// Phase 1: matrix 135 rows 193 cols
[2024-05-31 22:17:16] [INFO ] Computed 60 invariants in 2 ms
[2024-05-31 22:17:16] [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 287 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 536 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 829ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 3332 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 17 ms. Remains 193 /193 variables (removed 0) and now considering 135/135 (removed 0) transitions.
[2024-05-31 22:17:21] [INFO ] Invariant cache hit.
[2024-05-31 22:17:21] [INFO ] Implicit Places using invariants in 121 ms returned []
[2024-05-31 22:17:21] [INFO ] Invariant cache hit.
[2024-05-31 22:17:21] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-31 22:17:21] [INFO ] Implicit Places using invariants and state equation in 237 ms returned []
Implicit Place search using SMT with State Equation took 359 ms to find 0 implicit places.
[2024-05-31 22:17:21] [INFO ] Redundant transitions in 1 ms returned []
Running 134 sub problems to find dead transitions.
[2024-05-31 22:17:21] [INFO ] Invariant cache hit.
[2024-05-31 22:17:21] [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-31 22:17:23] [INFO ] Deduced a trap composed of 17 places in 33 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-31 22:17:26] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 1 ms to minimize.
[2024-05-31 22:17:26] [INFO ] Deduced a trap composed of 8 places in 57 ms of which 1 ms to minimize.
[2024-05-31 22:17:26] [INFO ] Deduced a trap composed of 7 places in 82 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-31 22:17:27] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2024-05-31 22:17:27] [INFO ] Deduced a trap composed of 13 places in 38 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 10005 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-31 22:17:32] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 0 ms to minimize.
[2024-05-31 22:17:32] [INFO ] Deduced a trap composed of 9 places in 35 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-31 22:17:32] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 0 ms to minimize.
[2024-05-31 22:17:33] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 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-31 22:17:36] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 0 ms to minimize.
[2024-05-31 22:17:36] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 1 ms to minimize.
[2024-05-31 22:17:36] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
[2024-05-31 22:17:36] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 1 ms to minimize.
[2024-05-31 22:17:38] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 2 ms to minimize.
[2024-05-31 22:17:38] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 1 ms to minimize.
[2024-05-31 22:17:38] [INFO ] Deduced a trap composed of 17 places in 52 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-31 22:17:45] [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
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 40087ms problems are : Problem set: 0 solved, 134 unsolved
Search for dead transitions found 0 dead transitions in 40088ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40471 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 9 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-31 22:18:01] [INFO ] Computed 60 invariants in 1 ms
[2024-05-31 22:18:01] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-31 22:18:01] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 12 ms returned sat
[2024-05-31 22:18:01] [INFO ] After 92ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-31 22:18:01] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2024-05-31 22:18:01] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 10 ms returned sat
[2024-05-31 22:18:01] [INFO ] After 155ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
TRAPS : Iteration 0
[2024-05-31 22:18:02] [INFO ] After 288ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
[2024-05-31 22:18:02] [INFO ] After 526ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Over-approximation ignoring read arcs solved 0 properties in 635 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 444 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 103 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 159 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 6 ms. Remains 193 /193 variables (removed 0) and now considering 137/137 (removed 0) transitions.
// Phase 1: matrix 137 rows 193 cols
[2024-05-31 22:18:02] [INFO ] Computed 58 invariants in 1 ms
[2024-05-31 22:18:03] [INFO ] Implicit Places using invariants in 256 ms returned []
[2024-05-31 22:18:03] [INFO ] Invariant cache hit.
[2024-05-31 22:18:03] [INFO ] Implicit Places using invariants and state equation in 207 ms returned []
Implicit Place search using SMT with State Equation took 487 ms to find 0 implicit places.
[2024-05-31 22:18:03] [INFO ] Redundant transitions in 1 ms returned []
Running 136 sub problems to find dead transitions.
[2024-05-31 22:18:03] [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-31 22:18:04] [INFO ] Deduced a trap composed of 12 places in 33 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-31 22:18:05] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
[2024-05-31 22:18:05] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 0 ms to minimize.
[2024-05-31 22:18:05] [INFO ] Deduced a trap composed of 13 places in 28 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-31 22:18:07] [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 6260 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-31 22:18:14] [INFO ] Deduced a trap composed of 17 places in 63 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 29465 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 35775ms problems are : Problem set: 0 solved, 136 unsolved
Search for dead transitions found 0 dead transitions in 35776ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 36279 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 487 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 107 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0), (AND (NOT p0) (NOT p2))]
RANDOM walk for 40000 steps (894 resets) in 306 ms. (130 steps per ms) remains 6/10 properties
BEST_FIRST walk for 40003 steps (194 resets) in 101 ms. (392 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (180 resets) in 108 ms. (367 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (182 resets) in 153 ms. (259 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (182 resets) in 104 ms. (380 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (194 resets) in 133 ms. (298 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (169 resets) in 140 ms. (283 steps per ms) remains 6/6 properties
[2024-05-31 22:18:40] [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 278 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-31 22:18:40] [INFO ] Deduced a trap composed of 12 places in 43 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-31 22:18:40] [INFO ] Deduced a trap composed of 17 places in 78 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 726 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 1021ms problems are : Problem set: 1 solved, 5 unsolved
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 1613 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 9 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 9 ms. Remains : 193/193 places, 135/137 transitions.
RANDOM walk for 40000 steps (532 resets) in 377 ms. (105 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (88 resets) in 81 ms. (487 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (90 resets) in 70 ms. (563 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (89 resets) in 121 ms. (327 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (91 resets) in 111 ms. (357 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (90 resets) in 93 ms. (425 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 635793 steps, run timeout after 3001 ms. (steps per millisecond=211 ) properties seen :0 out of 5
Probabilistic random walk after 635793 steps, saw 91563 distinct states, run finished after 3002 ms. (steps per millisecond=211 ) properties seen :0
// Phase 1: matrix 135 rows 193 cols
[2024-05-31 22:18:46] [INFO ] Computed 60 invariants in 3 ms
[2024-05-31 22:18:46] [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 251 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-31 22:18:46] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 1 ms to minimize.
[2024-05-31 22:18:46] [INFO ] Deduced a trap composed of 12 places in 28 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, 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-31 22:18:46] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 2 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 697 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 966ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 2 different solutions.
Finished Parikh walk after 53876 steps, including 212 resets, run visited all 5 properties in 1313 ms. (steps per millisecond=41 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 5 properties in 1325 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 692 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 120 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 134 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 125 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 2222 reset in 221 ms.
Product exploration explored 100000 steps with 2215 reset in 247 ms.
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 6 ms. Remains 193 /193 variables (removed 0) and now considering 137/137 (removed 0) transitions.
// Phase 1: matrix 137 rows 193 cols
[2024-05-31 22:18:50] [INFO ] Computed 58 invariants in 3 ms
[2024-05-31 22:18:50] [INFO ] Implicit Places using invariants in 147 ms returned []
[2024-05-31 22:18:50] [INFO ] Invariant cache hit.
[2024-05-31 22:18:50] [INFO ] Implicit Places using invariants and state equation in 208 ms returned []
Implicit Place search using SMT with State Equation took 365 ms to find 0 implicit places.
[2024-05-31 22:18:50] [INFO ] Redundant transitions in 0 ms returned []
Running 136 sub problems to find dead transitions.
[2024-05-31 22:18:50] [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-31 22:18:51] [INFO ] Deduced a trap composed of 12 places in 24 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-31 22:18:52] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 1 ms to minimize.
[2024-05-31 22:18:53] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 1 ms to minimize.
[2024-05-31 22:18:53] [INFO ] Deduced a trap composed of 13 places in 37 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-31 22:18:54] [INFO ] Deduced a trap composed of 9 places in 32 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 6386 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-31 22:19:02] [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 29905 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 36335ms problems are : Problem set: 0 solved, 136 unsolved
Search for dead transitions found 0 dead transitions in 36337ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 36715 ms. Remains : 193/193 places, 137/137 transitions.
Treatment of property DES-PT-20a-LTLCardinality-12 finished in 174835 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 8 ms. Remains 193 /193 variables (removed 0) and now considering 137/137 (removed 0) transitions.
[2024-05-31 22:19:26] [INFO ] Invariant cache hit.
[2024-05-31 22:19:27] [INFO ] Implicit Places using invariants in 118 ms returned []
[2024-05-31 22:19:27] [INFO ] Invariant cache hit.
[2024-05-31 22:19:27] [INFO ] Implicit Places using invariants and state equation in 199 ms returned []
Implicit Place search using SMT with State Equation took 319 ms to find 0 implicit places.
[2024-05-31 22:19:27] [INFO ] Redundant transitions in 0 ms returned []
Running 136 sub problems to find dead transitions.
[2024-05-31 22:19:27] [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-31 22:19:27] [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-31 22:19:29] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-31 22:19:29] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 1 ms to minimize.
[2024-05-31 22:19:29] [INFO ] Deduced a trap composed of 13 places in 38 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-31 22:19:31] [INFO ] Deduced a trap composed of 9 places in 49 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 6451 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-31 22:19:38] [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 29626 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 36120ms problems are : Problem set: 0 solved, 136 unsolved
Search for dead transitions found 0 dead transitions in 36122ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 36456 ms. Remains : 193/193 places, 137/137 transitions.
Stuttering acceptance computed with spot in 54 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-20a-LTLCardinality-13
Stuttering criterion allowed to conclude after 44 steps with 0 reset in 0 ms.
FORMULA DES-PT-20a-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-20a-LTLCardinality-13 finished in 36524 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 2 ms. Remains 193 /193 variables (removed 0) and now considering 137/137 (removed 0) transitions.
[2024-05-31 22:20:03] [INFO ] Invariant cache hit.
[2024-05-31 22:20:03] [INFO ] Implicit Places using invariants in 144 ms returned []
[2024-05-31 22:20:03] [INFO ] Invariant cache hit.
[2024-05-31 22:20:03] [INFO ] Implicit Places using invariants and state equation in 228 ms returned []
Implicit Place search using SMT with State Equation took 374 ms to find 0 implicit places.
Running 136 sub problems to find dead transitions.
[2024-05-31 22:20:03] [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-31 22:20:04] [INFO ] Deduced a trap composed of 12 places in 39 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-31 22:20:06] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 1 ms to minimize.
[2024-05-31 22:20:06] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 1 ms to minimize.
[2024-05-31 22:20:06] [INFO ] Deduced a trap composed of 13 places in 35 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-31 22:20:08] [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 6455 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-31 22:20:15] [INFO ] Deduced a trap composed of 17 places in 44 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 30008 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 36504ms problems are : Problem set: 0 solved, 136 unsolved
Search for dead transitions found 0 dead transitions in 36505ms
Finished structural reductions in LTL mode , in 1 iterations and 36882 ms. Remains : 193/193 places, 137/137 transitions.
Stuttering acceptance computed with spot in 96 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 36995 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-31 22:20:40] [INFO ] Flatten gal took : 17 ms
[2024-05-31 22:20:40] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-05-31 22:20:40] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 193 places, 137 transitions and 671 arcs took 5 ms.
Total runtime 599537 ms.
There are residual formulas that ITS could not solve within timeout
Could not compute solution for formula : DES-PT-20a-LTLCardinality-05
Could not compute solution for formula : DES-PT-20a-LTLCardinality-12

BK_STOP 1717194150700

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2024
ltl formula name DES-PT-20a-LTLCardinality-05
ltl formula formula --ltl=/tmp/1620/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 193 places, 137 transitions and 671 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.020 real 0.010 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1620/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1620/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1620/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1620/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 195 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 194, there are 146 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4): ~59 levels ~10000 states ~44656 transitions
pnml2lts-mc( 3/ 4): ~59 levels ~20000 states ~98968 transitions
pnml2lts-mc( 3/ 4): ~59 levels ~40000 states ~210688 transitions
pnml2lts-mc( 0/ 4): ~59 levels ~80000 states ~260956 transitions
pnml2lts-mc( 0/ 4): ~86 levels ~160000 states ~773084 transitions
pnml2lts-mc( 0/ 4): ~86 levels ~320000 states ~1929580 transitions
pnml2lts-mc( 0/ 4): ~86 levels ~640000 states ~4214816 transitions
pnml2lts-mc( 0/ 4): ~87 levels ~1280000 states ~8561560 transitions
pnml2lts-mc( 3/ 4): ~61 levels ~2560000 states ~18817580 transitions
pnml2lts-mc( 0/ 4): ~98 levels ~5120000 states ~34773560 transitions
pnml2lts-mc( 0/ 4): ~138 levels ~10240000 states ~72732108 transitions
pnml2lts-mc( 1/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 14590046
pnml2lts-mc( 0/ 4): unique states count: 14590572
pnml2lts-mc( 0/ 4): unique transitions count: 112519181
pnml2lts-mc( 0/ 4): - self-loop count: 344
pnml2lts-mc( 0/ 4): - claim dead count: 97926572
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 14590605
pnml2lts-mc( 0/ 4): - cum. max stack depth: 685
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 14590605 states 112519333 transitions, fanout: 7.712
pnml2lts-mc( 0/ 4): Total exploration time 47.040 sec (47.030 sec minimum, 47.033 sec on average)
pnml2lts-mc( 0/ 4): States per second: 310174, Transitions per second: 2391993
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 175.3MB, 12.6 B/state, compr.: 1.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 43.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 137 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 175.3MB (~256.0MB paged-in)
ltl formula name DES-PT-20a-LTLCardinality-12
ltl formula formula --ltl=/tmp/1620/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 193 places, 137 transitions and 671 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.030 real 0.010 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1620/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1620/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1620/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1620/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): There are 194 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 194, there are 197 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4): ~36 levels ~10000 states ~78112 transitions
pnml2lts-mc( 1/ 4): ~46 levels ~20000 states ~160608 transitions
pnml2lts-mc( 1/ 4): ~46 levels ~40000 states ~338040 transitions
pnml2lts-mc( 1/ 4): ~61 levels ~80000 states ~712624 transitions
pnml2lts-mc( 3/ 4): ~1005 levels ~160000 states ~1447644 transitions
pnml2lts-mc( 3/ 4): ~1005 levels ~320000 states ~3134892 transitions
pnml2lts-mc( 3/ 4): ~1005 levels ~640000 states ~6580000 transitions
pnml2lts-mc( 0/ 4): ~112 levels ~1280000 states ~13817356 transitions
pnml2lts-mc( 0/ 4): ~163 levels ~2560000 states ~28087524 transitions
pnml2lts-mc( 0/ 4): ~353 levels ~5120000 states ~57421980 transitions
pnml2lts-mc( 0/ 4): ~608 levels ~10240000 states ~115059240 transitions
pnml2lts-mc( 2/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 14748894
pnml2lts-mc( 0/ 4): unique states count: 15398426
pnml2lts-mc( 0/ 4): unique transitions count: 170233153
pnml2lts-mc( 0/ 4): - self-loop count: 5601
pnml2lts-mc( 0/ 4): - claim dead count: 148086129
pnml2lts-mc( 0/ 4): - claim found count: 6709690
pnml2lts-mc( 0/ 4): - claim success count: 15398451
pnml2lts-mc( 0/ 4): - cum. max stack depth: 6414
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 15398457 states 170233340 transitions, fanout: 11.055
pnml2lts-mc( 0/ 4): Total exploration time 61.560 sec (61.550 sec minimum, 61.555 sec on average)
pnml2lts-mc( 0/ 4): States per second: 250137, Transitions per second: 2765324
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 181.6MB, 12.4 B/state, compr.: 1.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 45.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 137 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 181.6MB (~256.0MB paged-in)

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is 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 r480-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 ;