fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r480-tall-171624189900731
Last Updated
July 7, 2024

About the Execution of LTSMin+red for DES-PT-50a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1135.483 1149887.00 1270897.00 2528.20 FTTFFFTTFFFTFTTT normal

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-171624189900731.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-50a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r480-tall-171624189900731
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 32K 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.8K Apr 22 14:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 22 14:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 08:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K Apr 12 08:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Apr 12 08:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 48K Apr 12 08:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Apr 22 14:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:37 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 97K 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-50a-LTLCardinality-00
FORMULA_NAME DES-PT-50a-LTLCardinality-01
FORMULA_NAME DES-PT-50a-LTLCardinality-02
FORMULA_NAME DES-PT-50a-LTLCardinality-03
FORMULA_NAME DES-PT-50a-LTLCardinality-04
FORMULA_NAME DES-PT-50a-LTLCardinality-05
FORMULA_NAME DES-PT-50a-LTLCardinality-06
FORMULA_NAME DES-PT-50a-LTLCardinality-07
FORMULA_NAME DES-PT-50a-LTLCardinality-08
FORMULA_NAME DES-PT-50a-LTLCardinality-09
FORMULA_NAME DES-PT-50a-LTLCardinality-10
FORMULA_NAME DES-PT-50a-LTLCardinality-11
FORMULA_NAME DES-PT-50a-LTLCardinality-12
FORMULA_NAME DES-PT-50a-LTLCardinality-13
FORMULA_NAME DES-PT-50a-LTLCardinality-14
FORMULA_NAME DES-PT-50a-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717196835864

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-50a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 23:07:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-31 23:07:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 23:07:17] [INFO ] Load time of PNML (sax parser for PT used): 91 ms
[2024-05-31 23:07:17] [INFO ] Transformed 314 places.
[2024-05-31 23:07:17] [INFO ] Transformed 271 transitions.
[2024-05-31 23:07:17] [INFO ] Found NUPN structural information;
[2024-05-31 23:07:17] [INFO ] Parsed PT model containing 314 places and 271 transitions and 1306 arcs in 204 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 22 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
FORMULA DES-PT-50a-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-50a-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-50a-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-50a-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-50a-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-50a-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 29 out of 314 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 314/314 places, 257/257 transitions.
Applied a total of 0 rules in 51 ms. Remains 314 /314 variables (removed 0) and now considering 257/257 (removed 0) transitions.
// Phase 1: matrix 257 rows 314 cols
[2024-05-31 23:07:17] [INFO ] Computed 59 invariants in 32 ms
[2024-05-31 23:07:18] [INFO ] Implicit Places using invariants in 593 ms returned [211]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 630 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 313/314 places, 257/257 transitions.
Applied a total of 0 rules in 18 ms. Remains 313 /313 variables (removed 0) and now considering 257/257 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 715 ms. Remains : 313/314 places, 257/257 transitions.
Support contains 29 out of 313 places after structural reductions.
[2024-05-31 23:07:18] [INFO ] Flatten gal took : 62 ms
[2024-05-31 23:07:18] [INFO ] Flatten gal took : 28 ms
[2024-05-31 23:07:18] [INFO ] Input system was already deterministic with 257 transitions.
Reduction of identical properties reduced properties to check from 18 to 17
RANDOM walk for 40000 steps (893 resets) in 2371 ms. (16 steps per ms) remains 11/17 properties
BEST_FIRST walk for 40002 steps (187 resets) in 354 ms. (112 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (187 resets) in 334 ms. (119 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (189 resets) in 174 ms. (228 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (175 resets) in 144 ms. (275 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (171 resets) in 152 ms. (261 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (191 resets) in 155 ms. (256 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (198 resets) in 105 ms. (377 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (181 resets) in 188 ms. (211 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40001 steps (194 resets) in 167 ms. (238 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (195 resets) in 153 ms. (259 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (187 resets) in 191 ms. (208 steps per ms) remains 11/11 properties
// Phase 1: matrix 257 rows 313 cols
[2024-05-31 23:07:20] [INFO ] Computed 58 invariants in 14 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 14/33 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 14/36 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 62/95 variables, 30/66 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/95 variables, 62/128 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/95 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 163/258 variables, 23/151 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/258 variables, 163/314 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/258 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (OVERLAPS) 6/264 variables, 2/316 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/264 variables, 6/322 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/264 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 14 (OVERLAPS) 256/520 variables, 264/586 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-31 23:07:22] [INFO ] Deduced a trap composed of 9 places in 131 ms of which 28 ms to minimize.
[2024-05-31 23:07:22] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/520 variables, 2/588 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/520 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 17 (OVERLAPS) 50/570 variables, 49/637 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/570 variables, 49/686 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-31 23:07:24] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/570 variables, 1/687 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-31 23:07:25] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 570/570 variables, and 688 constraints, problems are : Problem set: 0 solved, 11 unsolved in 5010 ms.
Refiners :[Domain max(s): 313/313 constraints, Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 14/33 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 14/36 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 62/95 variables, 30/66 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/95 variables, 62/128 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/95 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 163/258 variables, 23/151 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/258 variables, 163/314 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/258 variables, 4/318 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/258 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (OVERLAPS) 6/264 variables, 2/320 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/264 variables, 6/326 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/264 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 15 (OVERLAPS) 256/520 variables, 264/590 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/520 variables, 5/595 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/520 variables, 0/595 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 18 (OVERLAPS) 50/570 variables, 49/644 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/570 variables, 49/693 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 570/570 variables, and 699 constraints, problems are : Problem set: 0 solved, 11 unsolved in 5012 ms.
Refiners :[Domain max(s): 313/313 constraints, Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 4/4 constraints]
After SMT, in 10091ms problems are : Problem set: 0 solved, 11 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 19 out of 313 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 313/313 places, 257/257 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 313 transition count 255
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 312 transition count 254
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 312 transition count 254
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 10 place count 312 transition count 254
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 311 transition count 253
Applied a total of 11 rules in 63 ms. Remains 311 /313 variables (removed 2) and now considering 253/257 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 311/313 places, 253/257 transitions.
RANDOM walk for 40000 steps (548 resets) in 499 ms. (80 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (86 resets) in 115 ms. (344 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (92 resets) in 126 ms. (314 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (93 resets) in 119 ms. (333 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (88 resets) in 69 ms. (571 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (87 resets) in 67 ms. (588 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (89 resets) in 58 ms. (678 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (85 resets) in 63 ms. (625 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (99 resets) in 64 ms. (615 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (86 resets) in 92 ms. (430 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (94 resets) in 83 ms. (476 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (100 resets) in 87 ms. (454 steps per ms) remains 11/11 properties
Interrupted probabilistic random walk after 601718 steps, run timeout after 3001 ms. (steps per millisecond=200 ) properties seen :0 out of 11
Probabilistic random walk after 601718 steps, saw 86575 distinct states, run finished after 3006 ms. (steps per millisecond=200 ) properties seen :0
// Phase 1: matrix 253 rows 311 cols
[2024-05-31 23:07:34] [INFO ] Computed 60 invariants in 19 ms
[2024-05-31 23:07:34] [INFO ] State equation strengthened by 2 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 12/31 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 14/45 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 185/230 variables, 24/34 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/230 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 22/252 variables, 20/54 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/252 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (OVERLAPS) 2/254 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/254 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (OVERLAPS) 208/462 variables, 254/309 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/462 variables, 2/311 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/462 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 14 (OVERLAPS) 63/525 variables, 18/329 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/525 variables, 4/333 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/525 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 17 (OVERLAPS) 1/526 variables, 1/334 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/526 variables, 1/335 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/526 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 20 (OVERLAPS) 38/564 variables, 38/373 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-31 23:07:35] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/564 variables, 1/374 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/564 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 23 (OVERLAPS) 0/564 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 564/564 variables, and 374 constraints, problems are : Problem set: 0 solved, 11 unsolved in 2427 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 311/311 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 12/31 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 14/45 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 185/230 variables, 24/34 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/230 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 22/252 variables, 20/54 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/252 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (OVERLAPS) 2/254 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/254 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (OVERLAPS) 208/462 variables, 254/309 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/462 variables, 2/311 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/462 variables, 5/316 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-31 23:07:37] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/462 variables, 1/317 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/462 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 16 (OVERLAPS) 63/525 variables, 18/335 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/525 variables, 4/339 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/525 variables, 6/345 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/525 variables, 1/346 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/525 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 21 (OVERLAPS) 1/526 variables, 1/347 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/526 variables, 1/348 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/526 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 24 (OVERLAPS) 38/564 variables, 38/386 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/564 variables, 0/386 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-31 23:07:40] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2024-05-31 23:07:40] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 1 ms to minimize.
[2024-05-31 23:07:41] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 1 ms to minimize.
At refinement iteration 26 (OVERLAPS) 0/564 variables, 3/389 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/564 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 28 (OVERLAPS) 0/564 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 564/564 variables, and 389 constraints, problems are : Problem set: 0 solved, 11 unsolved in 5775 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 311/311 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 5/5 constraints]
After SMT, in 8240ms problems are : Problem set: 0 solved, 11 unsolved
Fused 11 Parikh solutions to 10 different solutions.
Parikh walk visited 0 properties in 29051 ms.
Support contains 19 out of 311 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 311/311 places, 253/253 transitions.
Applied a total of 0 rules in 22 ms. Remains 311 /311 variables (removed 0) and now considering 253/253 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 311/311 places, 253/253 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 311/311 places, 253/253 transitions.
Applied a total of 0 rules in 11 ms. Remains 311 /311 variables (removed 0) and now considering 253/253 (removed 0) transitions.
[2024-05-31 23:08:11] [INFO ] Invariant cache hit.
[2024-05-31 23:08:11] [INFO ] Implicit Places using invariants in 190 ms returned []
[2024-05-31 23:08:11] [INFO ] Invariant cache hit.
[2024-05-31 23:08:11] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 23:08:12] [INFO ] Implicit Places using invariants and state equation in 400 ms returned []
Implicit Place search using SMT with State Equation took 593 ms to find 0 implicit places.
[2024-05-31 23:08:12] [INFO ] Redundant transitions in 12 ms returned []
Running 250 sub problems to find dead transitions.
[2024-05-31 23:08:12] [INFO ] Invariant cache hit.
[2024-05-31 23:08:12] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 250 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/310 variables, 8/60 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/310 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 5 (OVERLAPS) 253/563 variables, 310/370 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/563 variables, 2/372 constraints. Problems are: Problem set: 0 solved, 250 unsolved
[2024-05-31 23:08:17] [INFO ] Deduced a trap composed of 11 places in 67 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/563 variables, 1/373 constraints. Problems are: Problem set: 0 solved, 250 unsolved
[2024-05-31 23:08:21] [INFO ] Deduced a trap composed of 15 places in 91 ms of which 1 ms to minimize.
[2024-05-31 23:08:21] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 2 ms to minimize.
[2024-05-31 23:08:21] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2024-05-31 23:08:22] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 1 ms to minimize.
[2024-05-31 23:08:22] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 2 ms to minimize.
[2024-05-31 23:08:22] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-05-31 23:08:22] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 1 ms to minimize.
[2024-05-31 23:08:23] [INFO ] Deduced a trap composed of 7 places in 68 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/563 variables, 8/381 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/563 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 10 (OVERLAPS) 1/564 variables, 1/382 constraints. Problems are: Problem set: 0 solved, 250 unsolved
[2024-05-31 23:08:27] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/564 variables, 1/383 constraints. Problems are: Problem set: 0 solved, 250 unsolved
[2024-05-31 23:08:30] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/564 variables, 1/384 constraints. Problems are: Problem set: 0 solved, 250 unsolved
[2024-05-31 23:08:34] [INFO ] Deduced a trap composed of 50 places in 39 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/564 variables, 1/385 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/564 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 15 (OVERLAPS) 0/564 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 250 unsolved
No progress, stopping.
After SMT solving in domain Real declared 564/564 variables, and 385 constraints, problems are : Problem set: 0 solved, 250 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 311/311 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 250/250 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 250 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 6/58 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/308 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 4 (OVERLAPS) 2/310 variables, 8/66 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/310 variables, 5/71 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/310 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 7 (OVERLAPS) 253/563 variables, 310/381 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/563 variables, 2/383 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/563 variables, 250/633 constraints. Problems are: Problem set: 0 solved, 250 unsolved
[2024-05-31 23:09:06] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 2 ms to minimize.
[2024-05-31 23:09:11] [INFO ] Deduced a trap composed of 5 places in 52 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 563/564 variables, and 635 constraints, problems are : Problem set: 0 solved, 250 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 310/311 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 250/250 constraints, Known Traps: 13/14 constraints]
After SMT, in 60281ms problems are : Problem set: 0 solved, 250 unsolved
Search for dead transitions found 0 dead transitions in 60286ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60916 ms. Remains : 311/311 places, 253/253 transitions.
Computed a total of 216 stabilizing places and 211 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(G((p1||G(p2))))&&p0))))'
Support contains 3 out of 313 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 313/313 places, 257/257 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 312 transition count 256
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 312 transition count 256
Applied a total of 2 rules in 9 ms. Remains 312 /313 variables (removed 1) and now considering 256/257 (removed 1) transitions.
// Phase 1: matrix 256 rows 312 cols
[2024-05-31 23:09:12] [INFO ] Computed 58 invariants in 5 ms
[2024-05-31 23:09:12] [INFO ] Implicit Places using invariants in 212 ms returned []
[2024-05-31 23:09:12] [INFO ] Invariant cache hit.
[2024-05-31 23:09:13] [INFO ] Implicit Places using invariants and state equation in 364 ms returned []
Implicit Place search using SMT with State Equation took 579 ms to find 0 implicit places.
Running 255 sub problems to find dead transitions.
[2024-05-31 23:09:13] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 2 (OVERLAPS) 1/312 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/312 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-31 23:09:16] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 6 (OVERLAPS) 256/568 variables, 312/371 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-31 23:09:20] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 0 ms to minimize.
[2024-05-31 23:09:20] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/568 variables, 2/373 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-31 23:09:23] [INFO ] Deduced a trap composed of 11 places in 74 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/568 variables, 1/374 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-31 23:09:25] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 1 ms to minimize.
[2024-05-31 23:09:26] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/568 variables, 2/376 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/568 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 11 (OVERLAPS) 0/568 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 255 unsolved
No progress, stopping.
After SMT solving in domain Real declared 568/568 variables, and 376 constraints, problems are : Problem set: 0 solved, 255 unsolved in 19897 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 255/255 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 255 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 2 (OVERLAPS) 1/312 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/312 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 6/64 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-31 23:09:36] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 7 (OVERLAPS) 256/568 variables, 312/377 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/568 variables, 255/632 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-31 23:10:00] [INFO ] Deduced a trap composed of 16 places in 85 ms of which 1 ms to minimize.
[2024-05-31 23:10:01] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 568/568 variables, and 634 constraints, problems are : Problem set: 0 solved, 255 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 255/255 constraints, Known Traps: 9/9 constraints]
After SMT, in 50132ms problems are : Problem set: 0 solved, 255 unsolved
Search for dead transitions found 0 dead transitions in 50136ms
Starting structural reductions in LTL mode, iteration 1 : 312/313 places, 256/257 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50727 ms. Remains : 312/313 places, 256/257 transitions.
Stuttering acceptance computed with spot in 335 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p2), (AND (NOT p2) (NOT p1)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : DES-PT-50a-LTLCardinality-00
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA DES-PT-50a-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-50a-LTLCardinality-00 finished in 51131 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(F(p0))))))'
Support contains 4 out of 313 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 313/313 places, 257/257 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 312 transition count 256
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 312 transition count 256
Applied a total of 2 rules in 10 ms. Remains 312 /313 variables (removed 1) and now considering 256/257 (removed 1) transitions.
[2024-05-31 23:10:03] [INFO ] Invariant cache hit.
[2024-05-31 23:10:03] [INFO ] Implicit Places using invariants in 212 ms returned []
[2024-05-31 23:10:03] [INFO ] Invariant cache hit.
[2024-05-31 23:10:04] [INFO ] Implicit Places using invariants and state equation in 347 ms returned []
Implicit Place search using SMT with State Equation took 561 ms to find 0 implicit places.
Running 255 sub problems to find dead transitions.
[2024-05-31 23:10:04] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 2 (OVERLAPS) 1/312 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/312 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-31 23:10:07] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 6 (OVERLAPS) 256/568 variables, 312/371 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-31 23:10:11] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 1 ms to minimize.
[2024-05-31 23:10:11] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/568 variables, 2/373 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-31 23:10:14] [INFO ] Deduced a trap composed of 11 places in 71 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/568 variables, 1/374 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-31 23:10:16] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 2 ms to minimize.
[2024-05-31 23:10:17] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/568 variables, 2/376 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/568 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 11 (OVERLAPS) 0/568 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 255 unsolved
No progress, stopping.
After SMT solving in domain Real declared 568/568 variables, and 376 constraints, problems are : Problem set: 0 solved, 255 unsolved in 20064 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 255/255 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 255 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 2 (OVERLAPS) 1/312 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/312 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 6/64 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-31 23:10:27] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 7 (OVERLAPS) 256/568 variables, 312/377 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/568 variables, 255/632 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-31 23:10:52] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 2 ms to minimize.
[2024-05-31 23:10:52] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 568/568 variables, and 634 constraints, problems are : Problem set: 0 solved, 255 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 255/255 constraints, Known Traps: 9/9 constraints]
After SMT, in 50271ms problems are : Problem set: 0 solved, 255 unsolved
Search for dead transitions found 0 dead transitions in 50273ms
Starting structural reductions in LTL mode, iteration 1 : 312/313 places, 256/257 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50845 ms. Remains : 312/313 places, 256/257 transitions.
Stuttering acceptance computed with spot in 169 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-50a-LTLCardinality-01
Product exploration explored 100000 steps with 20000 reset in 359 ms.
Product exploration explored 100000 steps with 20000 reset in 306 ms.
Computed a total of 215 stabilizing places and 210 stable transitions
Computed a total of 215 stabilizing places and 210 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 82 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 179 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (878 resets) in 239 ms. (166 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (191 resets) in 240 ms. (165 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1469702 steps, run timeout after 3001 ms. (steps per millisecond=489 ) properties seen :0 out of 1
Probabilistic random walk after 1469702 steps, saw 205563 distinct states, run finished after 3001 ms. (steps per millisecond=489 ) properties seen :0
[2024-05-31 23:10:58] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 73/81 variables, 32/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 173/254 variables, 23/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/254 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 6/260 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/260 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 255/515 variables, 260/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/515 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 53/568 variables, 52/370 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/568 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/568 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 568/568 variables, and 370 constraints, problems are : Problem set: 0 solved, 1 unsolved in 275 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 73/81 variables, 32/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 173/254 variables, 23/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/254 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 6/260 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/260 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 255/515 variables, 260/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/515 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 53/568 variables, 52/370 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/568 variables, 1/371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/568 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 23:10:59] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 1 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/568 variables, 1/372 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/568 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/568 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 568/568 variables, and 372 constraints, problems are : Problem set: 0 solved, 1 unsolved in 550 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 832ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 637 ms.
Support contains 4 out of 312 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 256/256 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 312 transition count 254
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 312 transition count 254
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 311 transition count 253
Applied a total of 9 rules in 32 ms. Remains 311 /312 variables (removed 1) and now considering 253/256 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 311/312 places, 253/256 transitions.
RANDOM walk for 40000 steps (543 resets) in 154 ms. (258 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (96 resets) in 55 ms. (714 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1446721 steps, run timeout after 3001 ms. (steps per millisecond=482 ) properties seen :0 out of 1
Probabilistic random walk after 1446721 steps, saw 201809 distinct states, run finished after 3001 ms. (steps per millisecond=482 ) properties seen :0
// Phase 1: matrix 253 rows 311 cols
[2024-05-31 23:11:03] [INFO ] Computed 60 invariants in 4 ms
[2024-05-31 23:11:03] [INFO ] State equation strengthened by 2 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 14/21 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 202/223 variables, 23/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/223 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 25/248 variables, 22/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/248 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 3/251 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/251 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 202/453 variables, 251/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/453 variables, 2/308 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/453 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 63/516 variables, 12/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/516 variables, 4/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/516 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1/517 variables, 1/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/517 variables, 1/326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/517 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 47/564 variables, 47/373 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/564 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/564 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 564/564 variables, and 373 constraints, problems are : Problem set: 0 solved, 1 unsolved in 277 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 311/311 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 14/21 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 202/223 variables, 23/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/223 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 25/248 variables, 22/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/248 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 3/251 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/251 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 202/453 variables, 251/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/453 variables, 2/308 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/453 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 63/516 variables, 12/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/516 variables, 4/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/516 variables, 1/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 23:11:04] [INFO ] Deduced a trap composed of 12 places in 75 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/516 variables, 1/326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/516 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 1/517 variables, 1/327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/517 variables, 1/328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/517 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 47/564 variables, 47/375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/564 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/564 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 564/564 variables, and 375 constraints, problems are : Problem set: 0 solved, 1 unsolved in 483 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 311/311 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 777ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 1294 steps, including 1 resets, run visited all 1 properties in 7 ms. (steps per millisecond=184 )
Parikh walk visited 1 properties in 13 ms.
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 95 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 198 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 176 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 4 out of 312 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 312/312 places, 256/256 transitions.
Applied a total of 0 rules in 4 ms. Remains 312 /312 variables (removed 0) and now considering 256/256 (removed 0) transitions.
// Phase 1: matrix 256 rows 312 cols
[2024-05-31 23:11:04] [INFO ] Computed 58 invariants in 5 ms
[2024-05-31 23:11:04] [INFO ] Implicit Places using invariants in 186 ms returned []
[2024-05-31 23:11:04] [INFO ] Invariant cache hit.
[2024-05-31 23:11:05] [INFO ] Implicit Places using invariants and state equation in 356 ms returned []
Implicit Place search using SMT with State Equation took 544 ms to find 0 implicit places.
Running 255 sub problems to find dead transitions.
[2024-05-31 23:11:05] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 2 (OVERLAPS) 1/312 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/312 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-31 23:11:08] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 6 (OVERLAPS) 256/568 variables, 312/371 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-31 23:11:12] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 1 ms to minimize.
[2024-05-31 23:11:12] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/568 variables, 2/373 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-31 23:11:15] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/568 variables, 1/374 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-31 23:11:17] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 1 ms to minimize.
[2024-05-31 23:11:18] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/568 variables, 2/376 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/568 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 11 (OVERLAPS) 0/568 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 255 unsolved
No progress, stopping.
After SMT solving in domain Real declared 568/568 variables, and 376 constraints, problems are : Problem set: 0 solved, 255 unsolved in 20353 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 255/255 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 255 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 2 (OVERLAPS) 1/312 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/312 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 6/64 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-31 23:11:28] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 7 (OVERLAPS) 256/568 variables, 312/377 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/568 variables, 255/632 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-31 23:11:53] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 2 ms to minimize.
[2024-05-31 23:11:53] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 568/568 variables, and 634 constraints, problems are : Problem set: 0 solved, 255 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 255/255 constraints, Known Traps: 9/9 constraints]
After SMT, in 50544ms problems are : Problem set: 0 solved, 255 unsolved
Search for dead transitions found 0 dead transitions in 50546ms
Finished structural reductions in LTL mode , in 1 iterations and 51096 ms. Remains : 312/312 places, 256/256 transitions.
Computed a total of 215 stabilizing places and 210 stable transitions
Computed a total of 215 stabilizing places and 210 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 65 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 223 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (914 resets) in 285 ms. (139 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (175 resets) in 72 ms. (547 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1426283 steps, run timeout after 3001 ms. (steps per millisecond=475 ) properties seen :0 out of 1
Probabilistic random walk after 1426283 steps, saw 199881 distinct states, run finished after 3001 ms. (steps per millisecond=475 ) properties seen :0
[2024-05-31 23:11:59] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 73/81 variables, 32/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 173/254 variables, 23/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/254 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 6/260 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/260 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 255/515 variables, 260/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/515 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 53/568 variables, 52/370 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/568 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/568 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 568/568 variables, and 370 constraints, problems are : Problem set: 0 solved, 1 unsolved in 312 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 73/81 variables, 32/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 173/254 variables, 23/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/254 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 6/260 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/260 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 255/515 variables, 260/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/515 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 53/568 variables, 52/370 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/568 variables, 1/371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/568 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 23:11:59] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 1 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/568 variables, 1/372 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/568 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/568 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 568/568 variables, and 372 constraints, problems are : Problem set: 0 solved, 1 unsolved in 557 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 875ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 632 ms.
Support contains 4 out of 312 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 256/256 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 312 transition count 254
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 312 transition count 254
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 311 transition count 253
Applied a total of 9 rules in 24 ms. Remains 311 /312 variables (removed 1) and now considering 253/256 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 311/312 places, 253/256 transitions.
RANDOM walk for 40000 steps (552 resets) in 167 ms. (238 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (95 resets) in 62 ms. (634 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1437016 steps, run timeout after 3001 ms. (steps per millisecond=478 ) properties seen :0 out of 1
Probabilistic random walk after 1437016 steps, saw 200626 distinct states, run finished after 3001 ms. (steps per millisecond=478 ) properties seen :0
// Phase 1: matrix 253 rows 311 cols
[2024-05-31 23:12:03] [INFO ] Computed 60 invariants in 5 ms
[2024-05-31 23:12:03] [INFO ] State equation strengthened by 2 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 14/21 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 202/223 variables, 23/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/223 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 25/248 variables, 22/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/248 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 3/251 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/251 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 202/453 variables, 251/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/453 variables, 2/308 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/453 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 63/516 variables, 12/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/516 variables, 4/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/516 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1/517 variables, 1/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/517 variables, 1/326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/517 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 47/564 variables, 47/373 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/564 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/564 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 564/564 variables, and 373 constraints, problems are : Problem set: 0 solved, 1 unsolved in 269 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 311/311 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 14/21 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 202/223 variables, 23/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/223 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 25/248 variables, 22/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/248 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 3/251 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/251 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 202/453 variables, 251/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/453 variables, 2/308 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/453 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 63/516 variables, 12/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/516 variables, 4/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/516 variables, 1/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 23:12:04] [INFO ] Deduced a trap composed of 12 places in 81 ms of which 2 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/516 variables, 1/326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/516 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 1/517 variables, 1/327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/517 variables, 1/328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/517 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 47/564 variables, 47/375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/564 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/564 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 564/564 variables, and 375 constraints, problems are : Problem set: 0 solved, 1 unsolved in 453 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 311/311 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 733ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 1366 steps, including 1 resets, run visited all 1 properties in 8 ms. (steps per millisecond=170 )
Parikh walk visited 1 properties in 8 ms.
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 124 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 171 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 178 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 159 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 20000 reset in 263 ms.
Product exploration explored 100000 steps with 20000 reset in 279 ms.
Applying partial POR strategy [true, false, false, false, false]
Stuttering acceptance computed with spot in 219 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 4 out of 312 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 312/312 places, 256/256 transitions.
Applied a total of 0 rules in 44 ms. Remains 312 /312 variables (removed 0) and now considering 256/256 (removed 0) transitions.
[2024-05-31 23:12:06] [INFO ] Redundant transitions in 13 ms returned []
Running 255 sub problems to find dead transitions.
// Phase 1: matrix 256 rows 312 cols
[2024-05-31 23:12:06] [INFO ] Computed 58 invariants in 4 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 2 (OVERLAPS) 1/312 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/312 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-31 23:12:09] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 6 (OVERLAPS) 256/568 variables, 312/371 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/568 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-31 23:12:17] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 4 ms to minimize.
[2024-05-31 23:12:17] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 5 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/568 variables, 2/373 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-31 23:12:20] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/568 variables, 1/374 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/568 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-31 23:12:24] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/568 variables, 1/375 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-31 23:12:27] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/568 variables, 1/376 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/568 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 14 (OVERLAPS) 0/568 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 255 unsolved
No progress, stopping.
After SMT solving in domain Real declared 568/568 variables, and 376 constraints, problems are : Problem set: 0 solved, 255 unsolved in 29028 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 255/255 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 255 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 2 (OVERLAPS) 1/312 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/312 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 6/64 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 6 (OVERLAPS) 256/568 variables, 312/376 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/568 variables, 255/631 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-31 23:12:50] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 568/568 variables, and 632 constraints, problems are : Problem set: 0 solved, 255 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 255/255 constraints, Known Traps: 7/7 constraints]
After SMT, in 59261ms problems are : Problem set: 0 solved, 255 unsolved
Search for dead transitions found 0 dead transitions in 59264ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 59343 ms. Remains : 312/312 places, 256/256 transitions.
Support contains 4 out of 312 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 312/312 places, 256/256 transitions.
Applied a total of 0 rules in 9 ms. Remains 312 /312 variables (removed 0) and now considering 256/256 (removed 0) transitions.
[2024-05-31 23:13:05] [INFO ] Invariant cache hit.
[2024-05-31 23:13:05] [INFO ] Implicit Places using invariants in 186 ms returned []
[2024-05-31 23:13:05] [INFO ] Invariant cache hit.
[2024-05-31 23:13:06] [INFO ] Implicit Places using invariants and state equation in 371 ms returned []
Implicit Place search using SMT with State Equation took 558 ms to find 0 implicit places.
Running 255 sub problems to find dead transitions.
[2024-05-31 23:13:06] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 2 (OVERLAPS) 1/312 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/312 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-31 23:13:09] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 6 (OVERLAPS) 256/568 variables, 312/371 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-31 23:13:13] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 1 ms to minimize.
[2024-05-31 23:13:13] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/568 variables, 2/373 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-31 23:13:16] [INFO ] Deduced a trap composed of 11 places in 77 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/568 variables, 1/374 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-31 23:13:18] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 2 ms to minimize.
[2024-05-31 23:13:19] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/568 variables, 2/376 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/568 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 11 (OVERLAPS) 0/568 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 255 unsolved
No progress, stopping.
After SMT solving in domain Real declared 568/568 variables, and 376 constraints, problems are : Problem set: 0 solved, 255 unsolved in 20287 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 255/255 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 255 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 2 (OVERLAPS) 1/312 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/312 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 6/64 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-31 23:13:29] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 7 (OVERLAPS) 256/568 variables, 312/377 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/568 variables, 255/632 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-31 23:13:54] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 1 ms to minimize.
[2024-05-31 23:13:54] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 568/568 variables, and 634 constraints, problems are : Problem set: 0 solved, 255 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 255/255 constraints, Known Traps: 9/9 constraints]
After SMT, in 50499ms problems are : Problem set: 0 solved, 255 unsolved
Search for dead transitions found 0 dead transitions in 50503ms
Finished structural reductions in LTL mode , in 1 iterations and 51072 ms. Remains : 312/312 places, 256/256 transitions.
Treatment of property DES-PT-50a-LTLCardinality-01 finished in 233027 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&(F(p1)||G(p2))))'
Support contains 5 out of 313 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 313/313 places, 257/257 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 311 transition count 255
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 311 transition count 255
Applied a total of 2 rules in 21 ms. Remains 311 /313 variables (removed 2) and now considering 255/257 (removed 2) transitions.
// Phase 1: matrix 255 rows 311 cols
[2024-05-31 23:13:56] [INFO ] Computed 58 invariants in 3 ms
[2024-05-31 23:13:57] [INFO ] Implicit Places using invariants in 345 ms returned []
[2024-05-31 23:13:57] [INFO ] Invariant cache hit.
[2024-05-31 23:13:57] [INFO ] Implicit Places using invariants and state equation in 322 ms returned []
Implicit Place search using SMT with State Equation took 668 ms to find 0 implicit places.
[2024-05-31 23:13:57] [INFO ] Redundant transitions in 2 ms returned []
Running 252 sub problems to find dead transitions.
[2024-05-31 23:13:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 252 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/310 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/310 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 5 (OVERLAPS) 255/565 variables, 310/368 constraints. Problems are: Problem set: 0 solved, 252 unsolved
[2024-05-31 23:14:03] [INFO ] Deduced a trap composed of 10 places in 78 ms of which 1 ms to minimize.
[2024-05-31 23:14:03] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 1 ms to minimize.
[2024-05-31 23:14:03] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 1 ms to minimize.
[2024-05-31 23:14:04] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/565 variables, 4/372 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/565 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 8 (OVERLAPS) 1/566 variables, 1/373 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/566 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 10 (OVERLAPS) 0/566 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 252 unsolved
No progress, stopping.
After SMT solving in domain Real declared 566/566 variables, and 373 constraints, problems are : Problem set: 0 solved, 252 unsolved in 16111 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 252/252 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 252 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 4/55 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/308 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 4 (OVERLAPS) 2/310 variables, 7/62 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/310 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 6 (OVERLAPS) 255/565 variables, 310/372 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/565 variables, 252/624 constraints. Problems are: Problem set: 0 solved, 252 unsolved
[2024-05-31 23:14:36] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/565 variables, 1/625 constraints. Problems are: Problem set: 0 solved, 252 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 565/566 variables, and 625 constraints, problems are : Problem set: 0 solved, 252 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 310/311 constraints, PredecessorRefiner: 252/252 constraints, Known Traps: 5/5 constraints]
After SMT, in 46325ms problems are : Problem set: 0 solved, 252 unsolved
Search for dead transitions found 0 dead transitions in 46329ms
Starting structural reductions in SI_LTL mode, iteration 1 : 311/313 places, 255/257 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 47026 ms. Remains : 311/313 places, 255/257 transitions.
Stuttering acceptance computed with spot in 173 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : DES-PT-50a-LTLCardinality-03
Stuttering criterion allowed to conclude after 36 steps with 0 reset in 0 ms.
FORMULA DES-PT-50a-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-50a-LTLCardinality-03 finished in 47218 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(((p0 U X(G(p1)))&&F(p0))))'
Support contains 2 out of 313 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 313/313 places, 257/257 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 312 transition count 256
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 312 transition count 256
Applied a total of 2 rules in 17 ms. Remains 312 /313 variables (removed 1) and now considering 256/257 (removed 1) transitions.
// Phase 1: matrix 256 rows 312 cols
[2024-05-31 23:14:43] [INFO ] Computed 58 invariants in 5 ms
[2024-05-31 23:14:44] [INFO ] Implicit Places using invariants in 176 ms returned []
[2024-05-31 23:14:44] [INFO ] Invariant cache hit.
[2024-05-31 23:14:44] [INFO ] Implicit Places using invariants and state equation in 350 ms returned []
Implicit Place search using SMT with State Equation took 526 ms to find 0 implicit places.
Running 255 sub problems to find dead transitions.
[2024-05-31 23:14:44] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 2 (OVERLAPS) 1/312 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/312 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-31 23:14:47] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 6 (OVERLAPS) 256/568 variables, 312/371 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-31 23:14:51] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 1 ms to minimize.
[2024-05-31 23:14:51] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/568 variables, 2/373 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-31 23:14:54] [INFO ] Deduced a trap composed of 11 places in 77 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/568 variables, 1/374 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-31 23:14:56] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 1 ms to minimize.
[2024-05-31 23:14:57] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/568 variables, 2/376 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/568 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 11 (OVERLAPS) 0/568 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 255 unsolved
No progress, stopping.
After SMT solving in domain Real declared 568/568 variables, and 376 constraints, problems are : Problem set: 0 solved, 255 unsolved in 19700 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 255/255 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 255 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 2 (OVERLAPS) 1/312 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/312 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 6/64 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-31 23:15:07] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 7 (OVERLAPS) 256/568 variables, 312/377 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/568 variables, 255/632 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-31 23:15:32] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 1 ms to minimize.
[2024-05-31 23:15:32] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 568/568 variables, and 634 constraints, problems are : Problem set: 0 solved, 255 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 255/255 constraints, Known Traps: 9/9 constraints]
After SMT, in 49896ms problems are : Problem set: 0 solved, 255 unsolved
Search for dead transitions found 0 dead transitions in 49898ms
Starting structural reductions in LTL mode, iteration 1 : 312/313 places, 256/257 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50443 ms. Remains : 312/313 places, 256/257 transitions.
Stuttering acceptance computed with spot in 171 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0), (NOT p1), true]
Running random walk in product with property : DES-PT-50a-LTLCardinality-04
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA DES-PT-50a-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-50a-LTLCardinality-04 finished in 50635 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 313 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 313/313 places, 257/257 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 311 transition count 255
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 311 transition count 255
Applied a total of 2 rules in 15 ms. Remains 311 /313 variables (removed 2) and now considering 255/257 (removed 2) transitions.
// Phase 1: matrix 255 rows 311 cols
[2024-05-31 23:15:34] [INFO ] Computed 58 invariants in 2 ms
[2024-05-31 23:15:34] [INFO ] Implicit Places using invariants in 175 ms returned []
[2024-05-31 23:15:34] [INFO ] Invariant cache hit.
[2024-05-31 23:15:35] [INFO ] Implicit Places using invariants and state equation in 316 ms returned []
Implicit Place search using SMT with State Equation took 492 ms to find 0 implicit places.
[2024-05-31 23:15:35] [INFO ] Redundant transitions in 1 ms returned []
Running 252 sub problems to find dead transitions.
[2024-05-31 23:15:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 252 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/310 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/310 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 5 (OVERLAPS) 255/565 variables, 310/368 constraints. Problems are: Problem set: 0 solved, 252 unsolved
[2024-05-31 23:15:41] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 2 ms to minimize.
[2024-05-31 23:15:41] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 1 ms to minimize.
[2024-05-31 23:15:41] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 1 ms to minimize.
[2024-05-31 23:15:42] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/565 variables, 4/372 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/565 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 8 (OVERLAPS) 1/566 variables, 1/373 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/566 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 10 (OVERLAPS) 0/566 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 252 unsolved
No progress, stopping.
After SMT solving in domain Real declared 566/566 variables, and 373 constraints, problems are : Problem set: 0 solved, 252 unsolved in 16262 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 252/252 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 252 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 4/55 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/308 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 4 (OVERLAPS) 2/310 variables, 7/62 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/310 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 6 (OVERLAPS) 255/565 variables, 310/372 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/565 variables, 252/624 constraints. Problems are: Problem set: 0 solved, 252 unsolved
[2024-05-31 23:16:13] [INFO ] Deduced a trap composed of 18 places in 66 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/565 variables, 1/625 constraints. Problems are: Problem set: 0 solved, 252 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 565/566 variables, and 625 constraints, problems are : Problem set: 0 solved, 252 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 310/311 constraints, PredecessorRefiner: 252/252 constraints, Known Traps: 5/5 constraints]
After SMT, in 46456ms problems are : Problem set: 0 solved, 252 unsolved
Search for dead transitions found 0 dead transitions in 46460ms
Starting structural reductions in SI_LTL mode, iteration 1 : 311/313 places, 255/257 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 46973 ms. Remains : 311/313 places, 255/257 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-50a-LTLCardinality-08
Stuttering criterion allowed to conclude after 37 steps with 0 reset in 0 ms.
FORMULA DES-PT-50a-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-50a-LTLCardinality-08 finished in 47022 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 313 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 313/313 places, 257/257 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 312 transition count 256
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 312 transition count 256
Applied a total of 2 rules in 8 ms. Remains 312 /313 variables (removed 1) and now considering 256/257 (removed 1) transitions.
// Phase 1: matrix 256 rows 312 cols
[2024-05-31 23:16:21] [INFO ] Computed 58 invariants in 5 ms
[2024-05-31 23:16:21] [INFO ] Implicit Places using invariants in 209 ms returned []
[2024-05-31 23:16:21] [INFO ] Invariant cache hit.
[2024-05-31 23:16:22] [INFO ] Implicit Places using invariants and state equation in 357 ms returned []
Implicit Place search using SMT with State Equation took 568 ms to find 0 implicit places.
Running 255 sub problems to find dead transitions.
[2024-05-31 23:16:22] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 2 (OVERLAPS) 1/312 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/312 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-31 23:16:25] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 6 (OVERLAPS) 256/568 variables, 312/371 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-31 23:16:29] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 0 ms to minimize.
[2024-05-31 23:16:29] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/568 variables, 2/373 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-31 23:16:32] [INFO ] Deduced a trap composed of 11 places in 78 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/568 variables, 1/374 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-31 23:16:34] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 1 ms to minimize.
[2024-05-31 23:16:35] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/568 variables, 2/376 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/568 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 11 (OVERLAPS) 0/568 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 255 unsolved
No progress, stopping.
After SMT solving in domain Real declared 568/568 variables, and 376 constraints, problems are : Problem set: 0 solved, 255 unsolved in 20680 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 255/255 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 255 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 2 (OVERLAPS) 1/312 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/312 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 6/64 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-31 23:16:45] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 7 (OVERLAPS) 256/568 variables, 312/377 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/568 variables, 255/632 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-31 23:17:10] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 2 ms to minimize.
[2024-05-31 23:17:10] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 568/568 variables, and 634 constraints, problems are : Problem set: 0 solved, 255 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 255/255 constraints, Known Traps: 9/9 constraints]
After SMT, in 50878ms problems are : Problem set: 0 solved, 255 unsolved
Search for dead transitions found 0 dead transitions in 50882ms
Starting structural reductions in LTL mode, iteration 1 : 312/313 places, 256/257 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51459 ms. Remains : 312/313 places, 256/257 transitions.
Stuttering acceptance computed with spot in 116 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-50a-LTLCardinality-09
Entered a terminal (fully accepting) state of product in 9 steps with 0 reset in 0 ms.
FORMULA DES-PT-50a-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-50a-LTLCardinality-09 finished in 51594 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 313 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 313/313 places, 257/257 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 312 transition count 256
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 312 transition count 256
Applied a total of 2 rules in 13 ms. Remains 312 /313 variables (removed 1) and now considering 256/257 (removed 1) transitions.
[2024-05-31 23:17:13] [INFO ] Invariant cache hit.
[2024-05-31 23:17:13] [INFO ] Implicit Places using invariants in 188 ms returned []
[2024-05-31 23:17:13] [INFO ] Invariant cache hit.
[2024-05-31 23:17:13] [INFO ] Implicit Places using invariants and state equation in 365 ms returned []
Implicit Place search using SMT with State Equation took 555 ms to find 0 implicit places.
Running 255 sub problems to find dead transitions.
[2024-05-31 23:17:13] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 2 (OVERLAPS) 1/312 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/312 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-31 23:17:16] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 6 (OVERLAPS) 256/568 variables, 312/371 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-31 23:17:21] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 0 ms to minimize.
[2024-05-31 23:17:21] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/568 variables, 2/373 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-31 23:17:24] [INFO ] Deduced a trap composed of 11 places in 75 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/568 variables, 1/374 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-31 23:17:25] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 1 ms to minimize.
[2024-05-31 23:17:27] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/568 variables, 2/376 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/568 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 11 (OVERLAPS) 0/568 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 255 unsolved
No progress, stopping.
After SMT solving in domain Real declared 568/568 variables, and 376 constraints, problems are : Problem set: 0 solved, 255 unsolved in 19925 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 255/255 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 255 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 2 (OVERLAPS) 1/312 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/312 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 6/64 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-31 23:17:36] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 7 (OVERLAPS) 256/568 variables, 312/377 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/568 variables, 255/632 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-31 23:18:01] [INFO ] Deduced a trap composed of 16 places in 86 ms of which 2 ms to minimize.
[2024-05-31 23:18:01] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 568/568 variables, and 634 constraints, problems are : Problem set: 0 solved, 255 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 255/255 constraints, Known Traps: 9/9 constraints]
After SMT, in 50153ms problems are : Problem set: 0 solved, 255 unsolved
Search for dead transitions found 0 dead transitions in 50157ms
Starting structural reductions in LTL mode, iteration 1 : 312/313 places, 256/257 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50727 ms. Remains : 312/313 places, 256/257 transitions.
Stuttering acceptance computed with spot in 87 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-50a-LTLCardinality-10
Entered a terminal (fully accepting) state of product in 10 steps with 0 reset in 0 ms.
FORMULA DES-PT-50a-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-50a-LTLCardinality-10 finished in 50829 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X(p1)))'
Support contains 3 out of 313 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 313/313 places, 257/257 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 312 transition count 256
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 312 transition count 256
Applied a total of 2 rules in 10 ms. Remains 312 /313 variables (removed 1) and now considering 256/257 (removed 1) transitions.
[2024-05-31 23:18:04] [INFO ] Invariant cache hit.
[2024-05-31 23:18:04] [INFO ] Implicit Places using invariants in 191 ms returned []
[2024-05-31 23:18:04] [INFO ] Invariant cache hit.
[2024-05-31 23:18:04] [INFO ] Implicit Places using invariants and state equation in 351 ms returned []
Implicit Place search using SMT with State Equation took 543 ms to find 0 implicit places.
Running 255 sub problems to find dead transitions.
[2024-05-31 23:18:04] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 2 (OVERLAPS) 1/312 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/312 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-31 23:18:07] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 6 (OVERLAPS) 256/568 variables, 312/371 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-31 23:18:12] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 1 ms to minimize.
[2024-05-31 23:18:12] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/568 variables, 2/373 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-31 23:18:15] [INFO ] Deduced a trap composed of 11 places in 76 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/568 variables, 1/374 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-31 23:18:17] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 1 ms to minimize.
[2024-05-31 23:18:18] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/568 variables, 2/376 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/568 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 11 (OVERLAPS) 0/568 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 255 unsolved
No progress, stopping.
After SMT solving in domain Real declared 568/568 variables, and 376 constraints, problems are : Problem set: 0 solved, 255 unsolved in 20630 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 255/255 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 255 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 2 (OVERLAPS) 1/312 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/312 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 6/64 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-31 23:18:28] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 7 (OVERLAPS) 256/568 variables, 312/377 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/568 variables, 255/632 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-31 23:18:53] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 2 ms to minimize.
[2024-05-31 23:18:53] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 568/568 variables, and 634 constraints, problems are : Problem set: 0 solved, 255 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 255/255 constraints, Known Traps: 9/9 constraints]
After SMT, in 50835ms problems are : Problem set: 0 solved, 255 unsolved
Search for dead transitions found 0 dead transitions in 50838ms
Starting structural reductions in LTL mode, iteration 1 : 312/313 places, 256/257 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51394 ms. Remains : 312/313 places, 256/257 transitions.
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : DES-PT-50a-LTLCardinality-12
Stuttering criterion allowed to conclude after 71 steps with 0 reset in 1 ms.
FORMULA DES-PT-50a-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-50a-LTLCardinality-12 finished in 51522 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 313 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 313/313 places, 257/257 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 312 transition count 256
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 312 transition count 256
Applied a total of 2 rules in 6 ms. Remains 312 /313 variables (removed 1) and now considering 256/257 (removed 1) transitions.
[2024-05-31 23:18:55] [INFO ] Invariant cache hit.
[2024-05-31 23:18:55] [INFO ] Implicit Places using invariants in 176 ms returned []
[2024-05-31 23:18:55] [INFO ] Invariant cache hit.
[2024-05-31 23:18:56] [INFO ] Implicit Places using invariants and state equation in 376 ms returned []
Implicit Place search using SMT with State Equation took 553 ms to find 0 implicit places.
Running 255 sub problems to find dead transitions.
[2024-05-31 23:18:56] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 2 (OVERLAPS) 1/312 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/312 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-31 23:18:59] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 6 (OVERLAPS) 256/568 variables, 312/371 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-31 23:19:03] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 1 ms to minimize.
[2024-05-31 23:19:03] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/568 variables, 2/373 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-31 23:19:07] [INFO ] Deduced a trap composed of 11 places in 77 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/568 variables, 1/374 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-31 23:19:08] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 1 ms to minimize.
[2024-05-31 23:19:10] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/568 variables, 2/376 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/568 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 11 (OVERLAPS) 0/568 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 255 unsolved
No progress, stopping.
After SMT solving in domain Real declared 568/568 variables, and 376 constraints, problems are : Problem set: 0 solved, 255 unsolved in 20974 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 255/255 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 255 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 2 (OVERLAPS) 1/312 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/312 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 6/64 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-31 23:19:20] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 7 (OVERLAPS) 256/568 variables, 312/377 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/568 variables, 255/632 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-31 23:19:44] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 1 ms to minimize.
[2024-05-31 23:19:44] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 568/568 variables, and 634 constraints, problems are : Problem set: 0 solved, 255 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 255/255 constraints, Known Traps: 9/9 constraints]
After SMT, in 51172ms problems are : Problem set: 0 solved, 255 unsolved
Search for dead transitions found 0 dead transitions in 51176ms
Starting structural reductions in LTL mode, iteration 1 : 312/313 places, 256/257 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51735 ms. Remains : 312/313 places, 256/257 transitions.
Stuttering acceptance computed with spot in 54 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-50a-LTLCardinality-13
Product exploration explored 100000 steps with 50000 reset in 365 ms.
Product exploration explored 100000 steps with 50000 reset in 386 ms.
Computed a total of 215 stabilizing places and 210 stable transitions
Computed a total of 215 stabilizing places and 210 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 9 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DES-PT-50a-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-50a-LTLCardinality-13 finished in 52578 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((!p1&&X(!p1)))||(!p1&&X(!p1)&&F(!p2))||p0)))'
Support contains 7 out of 313 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 313/313 places, 257/257 transitions.
Applied a total of 0 rules in 5 ms. Remains 313 /313 variables (removed 0) and now considering 257/257 (removed 0) transitions.
// Phase 1: matrix 257 rows 313 cols
[2024-05-31 23:19:48] [INFO ] Computed 58 invariants in 3 ms
[2024-05-31 23:19:48] [INFO ] Implicit Places using invariants in 303 ms returned []
[2024-05-31 23:19:48] [INFO ] Invariant cache hit.
[2024-05-31 23:19:49] [INFO ] Implicit Places using invariants and state equation in 569 ms returned []
Implicit Place search using SMT with State Equation took 874 ms to find 0 implicit places.
Running 256 sub problems to find dead transitions.
[2024-05-31 23:19:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 312/312 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 12/324 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/312 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 256 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 1/313 variables, 33/357 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 1/358 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/313 variables, 13/371 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 7 (OVERLAPS) 257/570 variables, 313/684 constraints. Problems are: Problem set: 0 solved, 256 unsolved
[2024-05-31 23:19:57] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 1 ms to minimize.
[2024-05-31 23:19:57] [INFO ] Deduced a trap composed of 11 places in 80 ms of which 1 ms to minimize.
[2024-05-31 23:19:57] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 1 ms to minimize.
[2024-05-31 23:19:58] [INFO ] Deduced a trap composed of 12 places in 72 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/570 variables, 4/688 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/570 variables, 0/688 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 10 (OVERLAPS) 0/570 variables, 0/688 constraints. Problems are: Problem set: 0 solved, 256 unsolved
No progress, stopping.
After SMT solving in domain Real declared 570/570 variables, and 688 constraints, problems are : Problem set: 0 solved, 256 unsolved in 20404 ms.
Refiners :[Domain max(s): 313/313 constraints, Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 256 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 312/312 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 12/324 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/312 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (OVERLAPS) 1/313 variables, 33/357 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 1/358 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/313 variables, 13/371 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 4/375 constraints. Problems are: Problem set: 0 solved, 256 unsolved
[2024-05-31 23:20:12] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 0 ms to minimize.
[2024-05-31 23:20:12] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/313 variables, 2/377 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/313 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 9 (OVERLAPS) 257/570 variables, 313/690 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/570 variables, 256/946 constraints. Problems are: Problem set: 0 solved, 256 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 570/570 variables, and 946 constraints, problems are : Problem set: 0 solved, 256 unsolved in 30020 ms.
Refiners :[Domain max(s): 313/313 constraints, Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 6/6 constraints]
After SMT, in 50595ms problems are : Problem set: 0 solved, 256 unsolved
Search for dead transitions found 0 dead transitions in 50599ms
Finished structural reductions in LTL mode , in 1 iterations and 51480 ms. Remains : 313/313 places, 257/257 transitions.
Stuttering acceptance computed with spot in 224 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), true, p1, (AND p2 p1), p2]
Running random walk in product with property : DES-PT-50a-LTLCardinality-15
Product exploration explored 100000 steps with 50000 reset in 381 ms.
Product exploration explored 100000 steps with 50000 reset in 399 ms.
Computed a total of 216 stabilizing places and 211 stable transitions
Computed a total of 216 stabilizing places and 211 stable transitions
Detected a total of 216/313 stabilizing places and 211/257 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X p2), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND p1 p2))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 13 factoid took 21 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DES-PT-50a-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-50a-LTLCardinality-15 finished in 52534 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(F(p0))))))'
Found a Shortening insensitive property : DES-PT-50a-LTLCardinality-01
Stuttering acceptance computed with spot in 186 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 4 out of 313 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 313/313 places, 257/257 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 311 transition count 255
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 311 transition count 255
Applied a total of 2 rules in 16 ms. Remains 311 /313 variables (removed 2) and now considering 255/257 (removed 2) transitions.
// Phase 1: matrix 255 rows 311 cols
[2024-05-31 23:20:40] [INFO ] Computed 58 invariants in 3 ms
[2024-05-31 23:20:41] [INFO ] Implicit Places using invariants in 190 ms returned []
[2024-05-31 23:20:41] [INFO ] Invariant cache hit.
[2024-05-31 23:20:41] [INFO ] Implicit Places using invariants and state equation in 318 ms returned []
Implicit Place search using SMT with State Equation took 512 ms to find 0 implicit places.
Running 252 sub problems to find dead transitions.
[2024-05-31 23:20:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 252 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/310 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/310 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 5 (OVERLAPS) 255/565 variables, 310/368 constraints. Problems are: Problem set: 0 solved, 252 unsolved
[2024-05-31 23:20:47] [INFO ] Deduced a trap composed of 10 places in 63 ms of which 2 ms to minimize.
[2024-05-31 23:20:47] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 1 ms to minimize.
[2024-05-31 23:20:47] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 1 ms to minimize.
[2024-05-31 23:20:48] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/565 variables, 4/372 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/565 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 8 (OVERLAPS) 1/566 variables, 1/373 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/566 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 10 (OVERLAPS) 0/566 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 252 unsolved
No progress, stopping.
After SMT solving in domain Real declared 566/566 variables, and 373 constraints, problems are : Problem set: 0 solved, 252 unsolved in 16208 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 252/252 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 252 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 4/55 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/308 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 4 (OVERLAPS) 2/310 variables, 7/62 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/310 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 6 (OVERLAPS) 255/565 variables, 310/372 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/565 variables, 252/624 constraints. Problems are: Problem set: 0 solved, 252 unsolved
[2024-05-31 23:21:19] [INFO ] Deduced a trap composed of 18 places in 71 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/565 variables, 1/625 constraints. Problems are: Problem set: 0 solved, 252 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 565/566 variables, and 625 constraints, problems are : Problem set: 0 solved, 252 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 310/311 constraints, PredecessorRefiner: 252/252 constraints, Known Traps: 5/5 constraints]
After SMT, in 46389ms problems are : Problem set: 0 solved, 252 unsolved
Search for dead transitions found 0 dead transitions in 46392ms
Starting structural reductions in LI_LTL mode, iteration 1 : 311/313 places, 255/257 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 46922 ms. Remains : 311/313 places, 255/257 transitions.
Running random walk in product with property : DES-PT-50a-LTLCardinality-01
Product exploration explored 100000 steps with 20000 reset in 180 ms.
Product exploration explored 100000 steps with 20000 reset in 216 ms.
Computed a total of 214 stabilizing places and 209 stable transitions
Computed a total of 214 stabilizing places and 209 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 84 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 198 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (906 resets) in 224 ms. (177 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (180 resets) in 75 ms. (526 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1407637 steps, run timeout after 3001 ms. (steps per millisecond=469 ) properties seen :0 out of 1
Probabilistic random walk after 1407637 steps, saw 197342 distinct states, run finished after 3003 ms. (steps per millisecond=468 ) properties seen :0
[2024-05-31 23:21:31] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 14/21 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 200/221 variables, 22/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/221 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 23/244 variables, 21/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/244 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 7/251 variables, 3/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/251 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 201/452 variables, 251/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/452 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 66/518 variables, 12/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/518 variables, 4/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/518 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 48/566 variables, 48/369 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/566 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/566 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 566/566 variables, and 369 constraints, problems are : Problem set: 0 solved, 1 unsolved in 297 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 14/21 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 200/221 variables, 22/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/221 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 23/244 variables, 21/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 23:21:32] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/244 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/244 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 7/251 variables, 3/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/251 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 201/452 variables, 251/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/452 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 66/518 variables, 12/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/518 variables, 4/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/518 variables, 1/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/518 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 48/566 variables, 48/371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/566 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/566 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 566/566 variables, and 371 constraints, problems are : Problem set: 0 solved, 1 unsolved in 411 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 716ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 774 ms.
Support contains 4 out of 311 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 311/311 places, 255/255 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 311 transition count 253
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 4 place count 311 transition count 253
Applied a total of 4 rules in 16 ms. Remains 311 /311 variables (removed 0) and now considering 253/255 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 311/311 places, 253/255 transitions.
RANDOM walk for 40000 steps (659 resets) in 164 ms. (242 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (125 resets) in 57 ms. (689 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1418205 steps, run timeout after 3001 ms. (steps per millisecond=472 ) properties seen :0 out of 1
Probabilistic random walk after 1418205 steps, saw 199260 distinct states, run finished after 3001 ms. (steps per millisecond=472 ) properties seen :0
// Phase 1: matrix 253 rows 311 cols
[2024-05-31 23:21:36] [INFO ] Computed 60 invariants in 8 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 14/21 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 203/224 variables, 23/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/224 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 25/249 variables, 22/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/249 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/251 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/251 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 200/451 variables, 251/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/451 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 65/516 variables, 12/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/516 variables, 4/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/516 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1/517 variables, 1/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/517 variables, 1/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/517 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 47/564 variables, 47/371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/564 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/564 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 564/564 variables, and 371 constraints, problems are : Problem set: 0 solved, 1 unsolved in 295 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 14/21 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 203/224 variables, 23/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/224 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 25/249 variables, 22/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 23:21:36] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/249 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/249 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/251 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/251 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 200/451 variables, 251/307 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 23:21:36] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/451 variables, 1/308 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/451 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 65/516 variables, 12/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/516 variables, 4/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/516 variables, 1/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/516 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 1/517 variables, 1/326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/517 variables, 1/327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/517 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 47/564 variables, 47/374 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/564 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/564 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 564/564 variables, and 374 constraints, problems are : Problem set: 0 solved, 1 unsolved in 483 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 790ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 738 ms.
Support contains 4 out of 311 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 311/311 places, 253/253 transitions.
Applied a total of 0 rules in 5 ms. Remains 311 /311 variables (removed 0) and now considering 253/253 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 311/311 places, 253/253 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 311/311 places, 253/253 transitions.
Applied a total of 0 rules in 6 ms. Remains 311 /311 variables (removed 0) and now considering 253/253 (removed 0) transitions.
[2024-05-31 23:21:37] [INFO ] Invariant cache hit.
[2024-05-31 23:21:37] [INFO ] Implicit Places using invariants in 199 ms returned []
[2024-05-31 23:21:37] [INFO ] Invariant cache hit.
[2024-05-31 23:21:38] [INFO ] Implicit Places using invariants and state equation in 335 ms returned []
Implicit Place search using SMT with State Equation took 535 ms to find 0 implicit places.
[2024-05-31 23:21:38] [INFO ] Redundant transitions in 1 ms returned []
Running 250 sub problems to find dead transitions.
[2024-05-31 23:21:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 250 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/310 variables, 8/60 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/310 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 5 (OVERLAPS) 253/563 variables, 310/370 constraints. Problems are: Problem set: 0 solved, 250 unsolved
[2024-05-31 23:21:45] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 1 ms to minimize.
[2024-05-31 23:21:45] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 1 ms to minimize.
[2024-05-31 23:21:45] [INFO ] Deduced a trap composed of 8 places in 57 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/563 variables, 3/373 constraints. Problems are: Problem set: 0 solved, 250 unsolved
[2024-05-31 23:21:46] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 1 ms to minimize.
[2024-05-31 23:21:48] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/563 variables, 2/375 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/563 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 9 (OVERLAPS) 1/564 variables, 1/376 constraints. Problems are: Problem set: 0 solved, 250 unsolved
[2024-05-31 23:21:52] [INFO ] Deduced a trap composed of 57 places in 81 ms of which 2 ms to minimize.
[2024-05-31 23:21:54] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/564 variables, 2/378 constraints. Problems are: Problem set: 0 solved, 250 unsolved
[2024-05-31 23:21:56] [INFO ] Deduced a trap composed of 12 places in 82 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/564 variables, 1/379 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/564 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 250 unsolved
[2024-05-31 23:22:01] [INFO ] Deduced a trap composed of 55 places in 80 ms of which 2 ms to minimize.
[2024-05-31 23:22:01] [INFO ] Deduced a trap composed of 65 places in 62 ms of which 1 ms to minimize.
[2024-05-31 23:22:02] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 1 ms to minimize.
[2024-05-31 23:22:02] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 2 ms to minimize.
[2024-05-31 23:22:02] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 1 ms to minimize.
[2024-05-31 23:22:02] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 1 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/564 variables, 6/385 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/564 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 250 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 564/564 variables, and 385 constraints, problems are : Problem set: 0 solved, 250 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 250/250 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 250 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 13/65 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/308 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 4 (OVERLAPS) 2/310 variables, 8/73 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/310 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/310 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 7 (OVERLAPS) 253/563 variables, 310/384 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/563 variables, 250/634 constraints. Problems are: Problem set: 0 solved, 250 unsolved
[2024-05-31 23:22:24] [INFO ] Deduced a trap composed of 14 places in 83 ms of which 2 ms to minimize.
[2024-05-31 23:22:26] [INFO ] Deduced a trap composed of 11 places in 75 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 563/564 variables, and 636 constraints, problems are : Problem set: 0 solved, 250 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 310/311 constraints, PredecessorRefiner: 250/250 constraints, Known Traps: 16/16 constraints]
After SMT, in 60191ms problems are : Problem set: 0 solved, 250 unsolved
Search for dead transitions found 0 dead transitions in 60194ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60741 ms. Remains : 311/311 places, 253/253 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 311 transition count 253
Applied a total of 1 rules in 15 ms. Remains 311 /311 variables (removed 0) and now considering 253/253 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 253 rows 311 cols
[2024-05-31 23:22:38] [INFO ] Computed 60 invariants in 8 ms
[2024-05-31 23:22:38] [INFO ] After 61ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 23:22:38] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2024-05-31 23:22:38] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 18 ms returned sat
[2024-05-31 23:22:38] [INFO ] After 148ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-31 23:22:38] [INFO ] Deduced a trap composed of 11 places in 75 ms of which 1 ms to minimize.
[2024-05-31 23:22:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 106 ms
TRAPS : Iteration 1
[2024-05-31 23:22:39] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 0 ms to minimize.
[2024-05-31 23:22:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 53 ms
TRAPS : Iteration 2
[2024-05-31 23:22:39] [INFO ] After 367ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-31 23:22:39] [INFO ] After 483ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 582 ms.
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 100 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 190 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 193 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 4 out of 311 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 311/311 places, 255/255 transitions.
Applied a total of 0 rules in 8 ms. Remains 311 /311 variables (removed 0) and now considering 255/255 (removed 0) transitions.
// Phase 1: matrix 255 rows 311 cols
[2024-05-31 23:22:39] [INFO ] Computed 58 invariants in 4 ms
[2024-05-31 23:22:39] [INFO ] Implicit Places using invariants in 180 ms returned []
[2024-05-31 23:22:39] [INFO ] Invariant cache hit.
[2024-05-31 23:22:40] [INFO ] Implicit Places using invariants and state equation in 319 ms returned []
Implicit Place search using SMT with State Equation took 503 ms to find 0 implicit places.
Running 252 sub problems to find dead transitions.
[2024-05-31 23:22:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 252 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/310 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/310 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 5 (OVERLAPS) 255/565 variables, 310/368 constraints. Problems are: Problem set: 0 solved, 252 unsolved
[2024-05-31 23:22:46] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 2 ms to minimize.
[2024-05-31 23:22:46] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 1 ms to minimize.
[2024-05-31 23:22:46] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 1 ms to minimize.
[2024-05-31 23:22:47] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/565 variables, 4/372 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/565 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 8 (OVERLAPS) 1/566 variables, 1/373 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/566 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 10 (OVERLAPS) 0/566 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 252 unsolved
No progress, stopping.
After SMT solving in domain Real declared 566/566 variables, and 373 constraints, problems are : Problem set: 0 solved, 252 unsolved in 16419 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 252/252 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 252 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 4/55 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/308 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 4 (OVERLAPS) 2/310 variables, 7/62 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/310 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 6 (OVERLAPS) 255/565 variables, 310/372 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/565 variables, 252/624 constraints. Problems are: Problem set: 0 solved, 252 unsolved
[2024-05-31 23:23:19] [INFO ] Deduced a trap composed of 18 places in 82 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 565/566 variables, and 625 constraints, problems are : Problem set: 0 solved, 252 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 310/311 constraints, PredecessorRefiner: 252/252 constraints, Known Traps: 5/5 constraints]
After SMT, in 46606ms problems are : Problem set: 0 solved, 252 unsolved
Search for dead transitions found 0 dead transitions in 46610ms
Finished structural reductions in LTL mode , in 1 iterations and 47123 ms. Remains : 311/311 places, 255/255 transitions.
Computed a total of 214 stabilizing places and 209 stable transitions
Computed a total of 214 stabilizing places and 209 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 77 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 212 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (902 resets) in 153 ms. (259 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (191 resets) in 55 ms. (714 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1329914 steps, run timeout after 3001 ms. (steps per millisecond=443 ) properties seen :0 out of 1
Probabilistic random walk after 1329914 steps, saw 187644 distinct states, run finished after 3001 ms. (steps per millisecond=443 ) properties seen :0
[2024-05-31 23:23:30] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 14/21 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 200/221 variables, 22/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/221 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 23/244 variables, 21/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/244 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 7/251 variables, 3/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/251 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 201/452 variables, 251/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/452 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 66/518 variables, 12/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/518 variables, 4/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/518 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 48/566 variables, 48/369 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/566 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/566 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 566/566 variables, and 369 constraints, problems are : Problem set: 0 solved, 1 unsolved in 298 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 14/21 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 200/221 variables, 22/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/221 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 23/244 variables, 21/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 23:23:30] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/244 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/244 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 7/251 variables, 3/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/251 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 201/452 variables, 251/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/452 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 66/518 variables, 12/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/518 variables, 4/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/518 variables, 1/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/518 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 48/566 variables, 48/371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/566 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/566 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 566/566 variables, and 371 constraints, problems are : Problem set: 0 solved, 1 unsolved in 407 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 711ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 769 ms.
Support contains 4 out of 311 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 311/311 places, 255/255 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 311 transition count 253
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 4 place count 311 transition count 253
Applied a total of 4 rules in 13 ms. Remains 311 /311 variables (removed 0) and now considering 253/255 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 311/311 places, 253/255 transitions.
RANDOM walk for 40000 steps (650 resets) in 180 ms. (220 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (120 resets) in 67 ms. (588 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1373250 steps, run timeout after 3001 ms. (steps per millisecond=457 ) properties seen :0 out of 1
Probabilistic random walk after 1373250 steps, saw 192263 distinct states, run finished after 3001 ms. (steps per millisecond=457 ) properties seen :0
// Phase 1: matrix 253 rows 311 cols
[2024-05-31 23:23:34] [INFO ] Computed 60 invariants in 8 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 14/21 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 203/224 variables, 23/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/224 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 25/249 variables, 22/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/249 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/251 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/251 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 200/451 variables, 251/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/451 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 65/516 variables, 12/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/516 variables, 4/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/516 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1/517 variables, 1/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/517 variables, 1/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/517 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 47/564 variables, 47/371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/564 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/564 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 564/564 variables, and 371 constraints, problems are : Problem set: 0 solved, 1 unsolved in 306 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 14/21 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 203/224 variables, 23/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/224 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 25/249 variables, 22/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 23:23:35] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/249 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/249 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/251 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/251 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 200/451 variables, 251/307 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 23:23:35] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/451 variables, 1/308 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/451 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 65/516 variables, 12/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/516 variables, 4/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/516 variables, 1/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/516 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 1/517 variables, 1/326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/517 variables, 1/327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/517 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 47/564 variables, 47/374 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/564 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/564 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 564/564 variables, and 374 constraints, problems are : Problem set: 0 solved, 1 unsolved in 523 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 850ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 752 ms.
Support contains 4 out of 311 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 311/311 places, 253/253 transitions.
Applied a total of 0 rules in 6 ms. Remains 311 /311 variables (removed 0) and now considering 253/253 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 311/311 places, 253/253 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 311/311 places, 253/253 transitions.
Applied a total of 0 rules in 14 ms. Remains 311 /311 variables (removed 0) and now considering 253/253 (removed 0) transitions.
[2024-05-31 23:23:36] [INFO ] Invariant cache hit.
[2024-05-31 23:23:36] [INFO ] Implicit Places using invariants in 180 ms returned []
[2024-05-31 23:23:36] [INFO ] Invariant cache hit.
[2024-05-31 23:23:36] [INFO ] Implicit Places using invariants and state equation in 315 ms returned []
Implicit Place search using SMT with State Equation took 506 ms to find 0 implicit places.
[2024-05-31 23:23:36] [INFO ] Redundant transitions in 0 ms returned []
Running 250 sub problems to find dead transitions.
[2024-05-31 23:23:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 250 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/310 variables, 8/60 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/310 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 5 (OVERLAPS) 253/563 variables, 310/370 constraints. Problems are: Problem set: 0 solved, 250 unsolved
[2024-05-31 23:23:43] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 1 ms to minimize.
[2024-05-31 23:23:43] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 1 ms to minimize.
[2024-05-31 23:23:43] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/563 variables, 3/373 constraints. Problems are: Problem set: 0 solved, 250 unsolved
[2024-05-31 23:23:44] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 1 ms to minimize.
[2024-05-31 23:23:46] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/563 variables, 2/375 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/563 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 9 (OVERLAPS) 1/564 variables, 1/376 constraints. Problems are: Problem set: 0 solved, 250 unsolved
[2024-05-31 23:23:51] [INFO ] Deduced a trap composed of 57 places in 84 ms of which 1 ms to minimize.
[2024-05-31 23:23:52] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/564 variables, 2/378 constraints. Problems are: Problem set: 0 solved, 250 unsolved
[2024-05-31 23:23:54] [INFO ] Deduced a trap composed of 12 places in 81 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/564 variables, 1/379 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/564 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 250 unsolved
[2024-05-31 23:24:00] [INFO ] Deduced a trap composed of 55 places in 78 ms of which 2 ms to minimize.
[2024-05-31 23:24:00] [INFO ] Deduced a trap composed of 65 places in 58 ms of which 1 ms to minimize.
[2024-05-31 23:24:00] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 1 ms to minimize.
[2024-05-31 23:24:00] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 1 ms to minimize.
[2024-05-31 23:24:01] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 2 ms to minimize.
[2024-05-31 23:24:01] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 2 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/564 variables, 6/385 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/564 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 250 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 564/564 variables, and 385 constraints, problems are : Problem set: 0 solved, 250 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 250/250 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 250 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 13/65 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/308 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 4 (OVERLAPS) 2/310 variables, 8/73 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/310 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/310 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 7 (OVERLAPS) 253/563 variables, 310/384 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/563 variables, 250/634 constraints. Problems are: Problem set: 0 solved, 250 unsolved
[2024-05-31 23:24:33] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 563/564 variables, and 635 constraints, problems are : Problem set: 0 solved, 250 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 310/311 constraints, PredecessorRefiner: 250/250 constraints, Known Traps: 15/15 constraints]
After SMT, in 60180ms problems are : Problem set: 0 solved, 250 unsolved
Search for dead transitions found 0 dead transitions in 60182ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60707 ms. Remains : 311/311 places, 253/253 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 311 transition count 253
Applied a total of 1 rules in 12 ms. Remains 311 /311 variables (removed 0) and now considering 253/253 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 253 rows 311 cols
[2024-05-31 23:24:36] [INFO ] Computed 60 invariants in 7 ms
[2024-05-31 23:24:37] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 23:24:37] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-31 23:24:37] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 15 ms returned sat
[2024-05-31 23:24:37] [INFO ] After 149ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-31 23:24:37] [INFO ] Deduced a trap composed of 11 places in 74 ms of which 2 ms to minimize.
[2024-05-31 23:24:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 99 ms
TRAPS : Iteration 1
[2024-05-31 23:24:37] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 1 ms to minimize.
[2024-05-31 23:24:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 55 ms
TRAPS : Iteration 2
[2024-05-31 23:24:37] [INFO ] After 365ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-31 23:24:37] [INFO ] After 457ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 540 ms.
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 62 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 202 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 195 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 241 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 20000 reset in 227 ms.
Product exploration explored 100000 steps with 20000 reset in 253 ms.
Applying partial POR strategy [true, false, false, false, false]
Stuttering acceptance computed with spot in 181 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 4 out of 311 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 311/311 places, 255/255 transitions.
Applied a total of 0 rules in 10 ms. Remains 311 /311 variables (removed 0) and now considering 255/255 (removed 0) transitions.
[2024-05-31 23:24:38] [INFO ] Redundant transitions in 1 ms returned []
Running 252 sub problems to find dead transitions.
// Phase 1: matrix 255 rows 311 cols
[2024-05-31 23:24:39] [INFO ] Computed 58 invariants in 6 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 3 (OVERLAPS) 2/310 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/310 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 5 (OVERLAPS) 255/565 variables, 310/368 constraints. Problems are: Problem set: 0 solved, 252 unsolved
[2024-05-31 23:24:43] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 2 ms to minimize.
[2024-05-31 23:24:45] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 1 ms to minimize.
[2024-05-31 23:24:45] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 1 ms to minimize.
[2024-05-31 23:24:45] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 1 ms to minimize.
[2024-05-31 23:24:45] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/565 variables, 5/373 constraints. Problems are: Problem set: 0 solved, 252 unsolved
[2024-05-31 23:24:50] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 1 ms to minimize.
[2024-05-31 23:24:51] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/565 variables, 2/375 constraints. Problems are: Problem set: 0 solved, 252 unsolved
[2024-05-31 23:24:51] [INFO ] Deduced a trap composed of 11 places in 79 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/565 variables, 1/376 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/565 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 10 (OVERLAPS) 1/566 variables, 1/377 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/566 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 12 (OVERLAPS) 0/566 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 252 unsolved
No progress, stopping.
After SMT solving in domain Real declared 566/566 variables, and 377 constraints, problems are : Problem set: 0 solved, 252 unsolved in 28694 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 252/252 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 252 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 8/59 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/308 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 4 (OVERLAPS) 2/310 variables, 7/66 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/310 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 6 (OVERLAPS) 255/565 variables, 310/376 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/565 variables, 252/628 constraints. Problems are: Problem set: 0 solved, 252 unsolved
[2024-05-31 23:25:23] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 2 ms to minimize.
[2024-05-31 23:25:28] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-05-31 23:25:28] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 0 ms to minimize.
[2024-05-31 23:25:28] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/565 variables, 4/632 constraints. Problems are: Problem set: 0 solved, 252 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 565/566 variables, and 632 constraints, problems are : Problem set: 0 solved, 252 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 310/311 constraints, PredecessorRefiner: 252/252 constraints, Known Traps: 12/12 constraints]
After SMT, in 58867ms problems are : Problem set: 0 solved, 252 unsolved
Search for dead transitions found 0 dead transitions in 58870ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 58886 ms. Remains : 311/311 places, 255/255 transitions.
Support contains 4 out of 311 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 311/311 places, 255/255 transitions.
Applied a total of 0 rules in 3 ms. Remains 311 /311 variables (removed 0) and now considering 255/255 (removed 0) transitions.
[2024-05-31 23:25:37] [INFO ] Invariant cache hit.
[2024-05-31 23:25:38] [INFO ] Implicit Places using invariants in 200 ms returned []
[2024-05-31 23:25:38] [INFO ] Invariant cache hit.
[2024-05-31 23:25:38] [INFO ] Implicit Places using invariants and state equation in 314 ms returned []
Implicit Place search using SMT with State Equation took 516 ms to find 0 implicit places.
Running 252 sub problems to find dead transitions.
[2024-05-31 23:25:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 252 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/310 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/310 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 5 (OVERLAPS) 255/565 variables, 310/368 constraints. Problems are: Problem set: 0 solved, 252 unsolved
[2024-05-31 23:25:44] [INFO ] Deduced a trap composed of 10 places in 75 ms of which 1 ms to minimize.
[2024-05-31 23:25:44] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 2 ms to minimize.
[2024-05-31 23:25:44] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 1 ms to minimize.
[2024-05-31 23:25:45] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/565 variables, 4/372 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/565 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 8 (OVERLAPS) 1/566 variables, 1/373 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/566 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 10 (OVERLAPS) 0/566 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 252 unsolved
No progress, stopping.
After SMT solving in domain Real declared 566/566 variables, and 373 constraints, problems are : Problem set: 0 solved, 252 unsolved in 16785 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 252/252 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 252 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 4/55 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/308 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 4 (OVERLAPS) 2/310 variables, 7/62 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/310 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 6 (OVERLAPS) 255/565 variables, 310/372 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/565 variables, 252/624 constraints. Problems are: Problem set: 0 solved, 252 unsolved
[2024-05-31 23:26:18] [INFO ] Deduced a trap composed of 18 places in 71 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 565/566 variables, and 625 constraints, problems are : Problem set: 0 solved, 252 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 310/311 constraints, PredecessorRefiner: 252/252 constraints, Known Traps: 5/5 constraints]
After SMT, in 46963ms problems are : Problem set: 0 solved, 252 unsolved
Search for dead transitions found 0 dead transitions in 46966ms
Finished structural reductions in LTL mode , in 1 iterations and 47487 ms. Remains : 311/311 places, 255/255 transitions.
Treatment of property DES-PT-50a-LTLCardinality-01 finished in 344731 ms.
[2024-05-31 23:26:25] [INFO ] Flatten gal took : 22 ms
[2024-05-31 23:26:25] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-05-31 23:26:25] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 313 places, 257 transitions and 1239 arcs took 5 ms.
Total runtime 1148210 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA DES-PT-50a-LTLCardinality-01 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717197985751

--------------------
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-50a-LTLCardinality-01
ltl formula formula --ltl=/tmp/2081/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 313 places, 257 transitions and 1239 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2081/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2081/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2081/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.100 real 0.010 user 0.020 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2081/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 315 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 314, there are 277 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 20
pnml2lts-mc( 0/ 4): unique states count: 20
pnml2lts-mc( 0/ 4): unique transitions count: 26
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 12
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 31
pnml2lts-mc( 0/ 4): - cum. max stack depth: 12
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 31 states 50 transitions, fanout: 1.613
pnml2lts-mc( 0/ 4): Total exploration time 0.000 sec (0.000 sec minimum, 0.000 sec on average)
pnml2lts-mc( 0/ 4): States per second: inf, Transitions per second: inf
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 89.2 B/state, compr.: 7.1%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 260 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DES-PT-50a"
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-50a, 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-171624189900731"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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