MCC'2024- Execution of r528-tall-171683760800319

About the Execution of LTSMin+red for ShieldIIPt-PT-040B

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
867.304	197809.00	286928.00	363.30	T???TT?T?T?FFT??	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.r528-tall-171683760800319.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 ShieldIIPt-PT-040B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r528-tall-171683760800319
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K May 19 07:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 16:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 19:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Apr 12 20:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 184K Apr 12 20:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Apr 12 20:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Apr 12 20:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 686K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717238471120

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-040B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 10:41:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 10:41:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 10:41:12] [INFO ] Load time of PNML (sax parser for PT used): 177 ms
[2024-06-01 10:41:12] [INFO ] Transformed 2803 places.
[2024-06-01 10:41:12] [INFO ] Transformed 2603 transitions.
[2024-06-01 10:41:12] [INFO ] Found NUPN structural information;
[2024-06-01 10:41:12] [INFO ] Parsed PT model containing 2803 places and 2603 transitions and 6486 arcs in 371 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (8 resets) in 1940 ms. (20 steps per ms) remains 9/16 properties
FORMULA ShieldIIPt-PT-040B-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-040B-ReachabilityFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-040B-ReachabilityFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-040B-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-040B-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-040B-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-040B-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 616 ms. (64 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 169 ms. (235 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 251 ms. (158 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 495 ms. (80 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 92 ms. (430 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 93 ms. (425 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 249 ms. (160 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 144 ms. (275 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 126 ms. (314 steps per ms) remains 9/9 properties
// Phase 1: matrix 2603 rows 2803 cols
[2024-06-01 10:41:14] [INFO ] Computed 361 invariants in 34 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/212 variables, 212/212 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/212 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 1903/2115 variables, 247/459 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2115 variables, 1903/2362 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2115 variables, 0/2362 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 688/2803 variables, 114/2476 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2803 variables, 688/3164 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2803 variables, 0/3164 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 2603/5406 variables, 2803/5967 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/5406 variables, 0/5967 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 0/5406 variables, 0/5967 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5406/5406 variables, and 5967 constraints, problems are : Problem set: 0 solved, 9 unsolved in 4008 ms.
Refiners :[Domain max(s): 2803/2803 constraints, Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 2803/2803 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/212 variables, 212/212 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/212 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 1903/2115 variables, 247/459 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2115 variables, 1903/2362 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-01 10:41:19] [INFO ] Deduced a trap composed of 19 places in 433 ms of which 61 ms to minimize.
[2024-06-01 10:41:19] [INFO ] Deduced a trap composed of 21 places in 373 ms of which 7 ms to minimize.
[2024-06-01 10:41:20] [INFO ] Deduced a trap composed of 33 places in 316 ms of which 6 ms to minimize.
[2024-06-01 10:41:20] [INFO ] Deduced a trap composed of 25 places in 311 ms of which 6 ms to minimize.
[2024-06-01 10:41:20] [INFO ] Deduced a trap composed of 26 places in 310 ms of which 6 ms to minimize.
[2024-06-01 10:41:21] [INFO ] Deduced a trap composed of 30 places in 315 ms of which 5 ms to minimize.
[2024-06-01 10:41:21] [INFO ] Deduced a trap composed of 20 places in 276 ms of which 5 ms to minimize.
[2024-06-01 10:41:21] [INFO ] Deduced a trap composed of 34 places in 285 ms of which 6 ms to minimize.
[2024-06-01 10:41:22] [INFO ] Deduced a trap composed of 36 places in 266 ms of which 5 ms to minimize.
[2024-06-01 10:41:22] [INFO ] Deduced a trap composed of 34 places in 245 ms of which 5 ms to minimize.
[2024-06-01 10:41:22] [INFO ] Deduced a trap composed of 50 places in 246 ms of which 5 ms to minimize.
[2024-06-01 10:41:22] [INFO ] Deduced a trap composed of 43 places in 228 ms of which 5 ms to minimize.
[2024-06-01 10:41:23] [INFO ] Deduced a trap composed of 25 places in 229 ms of which 5 ms to minimize.
[2024-06-01 10:41:23] [INFO ] Deduced a trap composed of 25 places in 227 ms of which 4 ms to minimize.
SMT process timed out in 9311ms, After SMT, problems are : Problem set: 0 solved, 9 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 212 out of 2803 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2803/2803 places, 2603/2603 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 513 transitions
Trivial Post-agglo rules discarded 513 transitions
Performed 513 trivial Post agglomeration. Transition count delta: 513
Iterating post reduction 0 with 513 rules applied. Total rules applied 513 place count 2803 transition count 2090
Reduce places removed 513 places and 0 transitions.
Performed 65 Post agglomeration using F-continuation condition.Transition count delta: 65
Iterating post reduction 1 with 578 rules applied. Total rules applied 1091 place count 2290 transition count 2025
Reduce places removed 65 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 66 rules applied. Total rules applied 1157 place count 2225 transition count 2024
Performed 166 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 166 Pre rules applied. Total rules applied 1157 place count 2225 transition count 1858
Deduced a syphon composed of 166 places in 13 ms
Reduce places removed 166 places and 0 transitions.
Iterating global reduction 3 with 332 rules applied. Total rules applied 1489 place count 2059 transition count 1858
Discarding 241 places :
Symmetric choice reduction at 3 with 241 rule applications. Total rules 1730 place count 1818 transition count 1617
Iterating global reduction 3 with 241 rules applied. Total rules applied 1971 place count 1818 transition count 1617
Performed 70 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 70 Pre rules applied. Total rules applied 1971 place count 1818 transition count 1547
Deduced a syphon composed of 70 places in 10 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 3 with 140 rules applied. Total rules applied 2111 place count 1748 transition count 1547
Performed 600 Post agglomeration using F-continuation condition.Transition count delta: 600
Deduced a syphon composed of 600 places in 4 ms
Reduce places removed 600 places and 0 transitions.
Iterating global reduction 3 with 1200 rules applied. Total rules applied 3311 place count 1148 transition count 947
Renaming transitions due to excessive name length > 1024 char.
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: -26
Deduced a syphon composed of 77 places in 5 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 3 with 154 rules applied. Total rules applied 3465 place count 1071 transition count 973
Free-agglomeration rule applied 9 times.
Iterating global reduction 3 with 9 rules applied. Total rules applied 3474 place count 1071 transition count 964
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 3483 place count 1062 transition count 964
Partial Free-agglomeration rule applied 37 times.
Drop transitions (Partial Free agglomeration) removed 37 transitions
Iterating global reduction 4 with 37 rules applied. Total rules applied 3520 place count 1062 transition count 964
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 3521 place count 1062 transition count 964
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 3522 place count 1061 transition count 963
Applied a total of 3522 rules in 1130 ms. Remains 1061 /2803 variables (removed 1742) and now considering 963/2603 (removed 1640) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1142 ms. Remains : 1061/2803 places, 963/2603 transitions.
RANDOM walk for 40000 steps (8 resets) in 639 ms. (62 steps per ms) remains 8/9 properties
FORMULA ShieldIIPt-PT-040B-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 336 ms. (118 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 312 ms. (127 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 180 ms. (221 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 218 ms. (182 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 195 ms. (204 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 304 ms. (131 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (8 resets) in 182 ms. (218 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 218 ms. (182 steps per ms) remains 8/8 properties
// Phase 1: matrix 963 rows 1061 cols
[2024-06-01 10:41:25] [INFO ] Computed 361 invariants in 4 ms
[2024-06-01 10:41:25] [INFO ] State equation strengthened by 106 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/211 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 610/821 variables, 247/247 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/821 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 86/907 variables, 40/287 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/907 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 906/1813 variables, 907/1194 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1813 variables, 102/1296 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1813 variables, 0/1296 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 181/1994 variables, 133/1429 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1994 variables, 62/1491 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1994 variables, 4/1495 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1994 variables, 0/1495 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 2/1996 variables, 3/1498 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1996 variables, 2/1500 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1996 variables, 0/1500 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (OVERLAPS) 2/1998 variables, 1/1501 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1998 variables, 0/1501 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (OVERLAPS) 25/2023 variables, 18/1519 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2023 variables, 6/1525 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2023 variables, 0/1525 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 20 (OVERLAPS) 1/2024 variables, 2/1527 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2024 variables, 1/1528 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2024 variables, 0/1528 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 23 (OVERLAPS) 0/2024 variables, 0/1528 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2024/2024 variables, and 1528 constraints, problems are : Problem set: 0 solved, 8 unsolved in 3231 ms.
Refiners :[Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 1061/1061 constraints, ReadFeed: 106/106 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/211 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 610/821 variables, 247/247 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 10:41:29] [INFO ] Deduced a trap composed of 7 places in 131 ms of which 2 ms to minimize.
[2024-06-01 10:41:29] [INFO ] Deduced a trap composed of 6 places in 98 ms of which 3 ms to minimize.
[2024-06-01 10:41:29] [INFO ] Deduced a trap composed of 5 places in 92 ms of which 2 ms to minimize.
[2024-06-01 10:41:29] [INFO ] Deduced a trap composed of 6 places in 90 ms of which 2 ms to minimize.
[2024-06-01 10:41:29] [INFO ] Deduced a trap composed of 5 places in 95 ms of which 3 ms to minimize.
[2024-06-01 10:41:29] [INFO ] Deduced a trap composed of 6 places in 100 ms of which 2 ms to minimize.
[2024-06-01 10:41:29] [INFO ] Deduced a trap composed of 6 places in 93 ms of which 2 ms to minimize.
[2024-06-01 10:41:29] [INFO ] Deduced a trap composed of 5 places in 105 ms of which 2 ms to minimize.
[2024-06-01 10:41:29] [INFO ] Deduced a trap composed of 5 places in 103 ms of which 2 ms to minimize.
[2024-06-01 10:41:30] [INFO ] Deduced a trap composed of 10 places in 104 ms of which 3 ms to minimize.
[2024-06-01 10:41:30] [INFO ] Deduced a trap composed of 9 places in 99 ms of which 2 ms to minimize.
[2024-06-01 10:41:30] [INFO ] Deduced a trap composed of 7 places in 104 ms of which 2 ms to minimize.
[2024-06-01 10:41:30] [INFO ] Deduced a trap composed of 10 places in 102 ms of which 3 ms to minimize.
[2024-06-01 10:41:30] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 2 ms to minimize.
[2024-06-01 10:41:30] [INFO ] Deduced a trap composed of 7 places in 97 ms of which 2 ms to minimize.
[2024-06-01 10:41:30] [INFO ] Deduced a trap composed of 10 places in 93 ms of which 2 ms to minimize.
[2024-06-01 10:41:30] [INFO ] Deduced a trap composed of 5 places in 88 ms of which 2 ms to minimize.
[2024-06-01 10:41:30] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 2 ms to minimize.
[2024-06-01 10:41:30] [INFO ] Deduced a trap composed of 5 places in 89 ms of which 2 ms to minimize.
[2024-06-01 10:41:31] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/821 variables, 20/267 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 10:41:31] [INFO ] Deduced a trap composed of 5 places in 73 ms of which 2 ms to minimize.
[2024-06-01 10:41:31] [INFO ] Deduced a trap composed of 8 places in 78 ms of which 1 ms to minimize.
[2024-06-01 10:41:31] [INFO ] Deduced a trap composed of 11 places in 78 ms of which 2 ms to minimize.
[2024-06-01 10:41:31] [INFO ] Deduced a trap composed of 8 places in 79 ms of which 1 ms to minimize.
[2024-06-01 10:41:31] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 1 ms to minimize.
[2024-06-01 10:41:31] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 2 ms to minimize.
[2024-06-01 10:41:31] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 2 ms to minimize.
[2024-06-01 10:41:31] [INFO ] Deduced a trap composed of 6 places in 74 ms of which 2 ms to minimize.
[2024-06-01 10:41:31] [INFO ] Deduced a trap composed of 6 places in 75 ms of which 2 ms to minimize.
[2024-06-01 10:41:32] [INFO ] Deduced a trap composed of 10 places in 67 ms of which 1 ms to minimize.
[2024-06-01 10:41:32] [INFO ] Deduced a trap composed of 5 places in 61 ms of which 1 ms to minimize.
[2024-06-01 10:41:32] [INFO ] Deduced a trap composed of 7 places in 161 ms of which 3 ms to minimize.
[2024-06-01 10:41:32] [INFO ] Deduced a trap composed of 7 places in 94 ms of which 2 ms to minimize.
[2024-06-01 10:41:32] [INFO ] Deduced a trap composed of 7 places in 90 ms of which 2 ms to minimize.
[2024-06-01 10:41:32] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 2 ms to minimize.
[2024-06-01 10:41:32] [INFO ] Deduced a trap composed of 5 places in 70 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/821 variables, 16/283 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 10:41:32] [INFO ] Deduced a trap composed of 6 places in 73 ms of which 2 ms to minimize.
[2024-06-01 10:41:32] [INFO ] Deduced a trap composed of 5 places in 60 ms of which 2 ms to minimize.
[2024-06-01 10:41:33] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 1 ms to minimize.
[2024-06-01 10:41:33] [INFO ] Deduced a trap composed of 8 places in 61 ms of which 2 ms to minimize.
[2024-06-01 10:41:33] [INFO ] Deduced a trap composed of 7 places in 66 ms of which 2 ms to minimize.
[2024-06-01 10:41:33] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/821 variables, 6/289 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 10:41:33] [INFO ] Deduced a trap composed of 8 places in 76 ms of which 2 ms to minimize.
[2024-06-01 10:41:33] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/821 variables, 2/291 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 10:41:33] [INFO ] Deduced a trap composed of 12 places in 76 ms of which 1 ms to minimize.
[2024-06-01 10:41:33] [INFO ] Deduced a trap composed of 8 places in 69 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/821 variables, 2/293 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/821 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 86/907 variables, 40/333 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 10:41:34] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 2 ms to minimize.
[2024-06-01 10:41:34] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 2 ms to minimize.
[2024-06-01 10:41:34] [INFO ] Deduced a trap composed of 5 places in 74 ms of which 1 ms to minimize.
[2024-06-01 10:41:34] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 1 ms to minimize.
[2024-06-01 10:41:34] [INFO ] Deduced a trap composed of 5 places in 68 ms of which 2 ms to minimize.
[2024-06-01 10:41:34] [INFO ] Deduced a trap composed of 5 places in 65 ms of which 2 ms to minimize.
[2024-06-01 10:41:34] [INFO ] Deduced a trap composed of 10 places in 67 ms of which 2 ms to minimize.
[2024-06-01 10:41:34] [INFO ] Deduced a trap composed of 10 places in 76 ms of which 1 ms to minimize.
[2024-06-01 10:41:35] [INFO ] Deduced a trap composed of 8 places in 64 ms of which 1 ms to minimize.
[2024-06-01 10:41:35] [INFO ] Deduced a trap composed of 8 places in 61 ms of which 1 ms to minimize.
[2024-06-01 10:41:35] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/907 variables, 11/344 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 10:41:35] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 2 ms to minimize.
[2024-06-01 10:41:35] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 2 ms to minimize.
[2024-06-01 10:41:35] [INFO ] Deduced a trap composed of 8 places in 61 ms of which 1 ms to minimize.
[2024-06-01 10:41:35] [INFO ] Deduced a trap composed of 5 places in 54 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/907 variables, 4/348 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 10:41:35] [INFO ] Deduced a trap composed of 7 places in 68 ms of which 2 ms to minimize.
[2024-06-01 10:41:36] [INFO ] Deduced a trap composed of 8 places in 72 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/907 variables, 2/350 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 10:41:36] [INFO ] Deduced a trap composed of 7 places in 75 ms of which 1 ms to minimize.
[2024-06-01 10:41:36] [INFO ] Deduced a trap composed of 7 places in 68 ms of which 1 ms to minimize.
[2024-06-01 10:41:36] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/907 variables, 3/353 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/907 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (OVERLAPS) 906/1813 variables, 907/1260 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1813 variables, 102/1362 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1813 variables, 2/1364 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 10:41:37] [INFO ] Deduced a trap composed of 5 places in 113 ms of which 2 ms to minimize.
[2024-06-01 10:41:37] [INFO ] Deduced a trap composed of 8 places in 119 ms of which 3 ms to minimize.
[2024-06-01 10:41:37] [INFO ] Deduced a trap composed of 5 places in 109 ms of which 2 ms to minimize.
[2024-06-01 10:41:37] [INFO ] Deduced a trap composed of 8 places in 106 ms of which 2 ms to minimize.
[2024-06-01 10:41:37] [INFO ] Deduced a trap composed of 9 places in 106 ms of which 3 ms to minimize.
[2024-06-01 10:41:37] [INFO ] Deduced a trap composed of 16 places in 96 ms of which 2 ms to minimize.
[2024-06-01 10:41:37] [INFO ] Deduced a trap composed of 8 places in 96 ms of which 3 ms to minimize.
[2024-06-01 10:41:38] [INFO ] Deduced a trap composed of 9 places in 97 ms of which 2 ms to minimize.
[2024-06-01 10:41:38] [INFO ] Deduced a trap composed of 6 places in 99 ms of which 3 ms to minimize.
[2024-06-01 10:41:38] [INFO ] Deduced a trap composed of 7 places in 97 ms of which 2 ms to minimize.
[2024-06-01 10:41:38] [INFO ] Deduced a trap composed of 11 places in 102 ms of which 2 ms to minimize.
[2024-06-01 10:41:38] [INFO ] Deduced a trap composed of 9 places in 115 ms of which 2 ms to minimize.
[2024-06-01 10:41:39] [INFO ] Deduced a trap composed of 5 places in 99 ms of which 2 ms to minimize.
[2024-06-01 10:41:39] [INFO ] Deduced a trap composed of 7 places in 100 ms of which 2 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/1813 variables, 14/1378 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1813 variables, 0/1378 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (OVERLAPS) 181/1994 variables, 133/1511 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1994 variables, 62/1573 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1994 variables, 4/1577 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1994 variables, 6/1583 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 10:41:41] [INFO ] Deduced a trap composed of 6 places in 100 ms of which 2 ms to minimize.
[2024-06-01 10:41:41] [INFO ] Deduced a trap composed of 6 places in 95 ms of which 2 ms to minimize.
[2024-06-01 10:41:41] [INFO ] Deduced a trap composed of 7 places in 95 ms of which 2 ms to minimize.
[2024-06-01 10:41:41] [INFO ] Deduced a trap composed of 7 places in 100 ms of which 2 ms to minimize.
[2024-06-01 10:41:41] [INFO ] Deduced a trap composed of 12 places in 104 ms of which 2 ms to minimize.
[2024-06-01 10:41:42] [INFO ] Deduced a trap composed of 4 places in 100 ms of which 3 ms to minimize.
[2024-06-01 10:41:42] [INFO ] Deduced a trap composed of 10 places in 93 ms of which 2 ms to minimize.
[2024-06-01 10:41:42] [INFO ] Deduced a trap composed of 7 places in 86 ms of which 2 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/1994 variables, 8/1591 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1994 variables, 0/1591 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 25 (OVERLAPS) 2/1996 variables, 3/1594 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1996 variables, 2/1596 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 10:41:44] [INFO ] Deduced a trap composed of 6 places in 92 ms of which 2 ms to minimize.
At refinement iteration 27 (INCLUDED_ONLY) 0/1996 variables, 1/1597 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1996 variables, 0/1597 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 29 (OVERLAPS) 2/1998 variables, 1/1598 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 10:41:46] [INFO ] Deduced a trap composed of 8 places in 78 ms of which 1 ms to minimize.
At refinement iteration 30 (INCLUDED_ONLY) 0/1998 variables, 1/1599 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1998 variables, 0/1599 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 32 (OVERLAPS) 25/2023 variables, 18/1617 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/2023 variables, 6/1623 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/2023 variables, 0/1623 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 35 (OVERLAPS) 1/2024 variables, 2/1625 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/2024 variables, 1/1626 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 10:41:49] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 1 ms to minimize.
At refinement iteration 37 (INCLUDED_ONLY) 0/2024 variables, 1/1627 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/2024 variables, 0/1627 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 39 (OVERLAPS) 0/2024 variables, 0/1627 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2024/2024 variables, and 1627 constraints, problems are : Problem set: 0 solved, 8 unsolved in 23624 ms.
Refiners :[Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 1061/1061 constraints, ReadFeed: 106/106 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 91/91 constraints]
After SMT, in 26913ms problems are : Problem set: 0 solved, 8 unsolved
Fused 8 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 19491 ms.
Support contains 211 out of 1061 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1061/1061 places, 963/963 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1061 transition count 962
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1060 transition count 962
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 1060 transition count 961
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 1059 transition count 961
Applied a total of 4 rules in 43 ms. Remains 1059 /1061 variables (removed 2) and now considering 961/963 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 1059/1061 places, 961/963 transitions.
RANDOM walk for 40000 steps (8 resets) in 559 ms. (71 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 180 ms. (221 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 184 ms. (216 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 149 ms. (266 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 162 ms. (245 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 151 ms. (263 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (8 resets) in 274 ms. (145 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 189 ms. (210 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 198 ms. (201 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 110399 steps, run timeout after 3001 ms. (steps per millisecond=36 ) properties seen :0 out of 8
Probabilistic random walk after 110399 steps, saw 73832 distinct states, run finished after 3008 ms. (steps per millisecond=36 ) properties seen :0
// Phase 1: matrix 961 rows 1059 cols
[2024-06-01 10:42:15] [INFO ] Computed 361 invariants in 8 ms
[2024-06-01 10:42:15] [INFO ] State equation strengthened by 106 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/211 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 608/819 variables, 247/247 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/819 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 86/905 variables, 40/287 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/905 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 904/1809 variables, 905/1192 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1809 variables, 102/1294 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1809 variables, 0/1294 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 181/1990 variables, 133/1427 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1990 variables, 62/1489 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1990 variables, 4/1493 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1990 variables, 0/1493 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 2/1992 variables, 3/1496 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1992 variables, 2/1498 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1992 variables, 0/1498 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (OVERLAPS) 2/1994 variables, 1/1499 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1994 variables, 0/1499 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (OVERLAPS) 25/2019 variables, 18/1517 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2019 variables, 6/1523 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2019 variables, 0/1523 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 20 (OVERLAPS) 1/2020 variables, 2/1525 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2020 variables, 1/1526 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2020 variables, 0/1526 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 23 (OVERLAPS) 0/2020 variables, 0/1526 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2020/2020 variables, and 1526 constraints, problems are : Problem set: 0 solved, 8 unsolved in 3246 ms.
Refiners :[Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 1059/1059 constraints, ReadFeed: 106/106 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/211 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 608/819 variables, 247/247 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 10:42:19] [INFO ] Deduced a trap composed of 5 places in 100 ms of which 2 ms to minimize.
[2024-06-01 10:42:19] [INFO ] Deduced a trap composed of 4 places in 105 ms of which 2 ms to minimize.
[2024-06-01 10:42:19] [INFO ] Deduced a trap composed of 6 places in 91 ms of which 1 ms to minimize.
[2024-06-01 10:42:19] [INFO ] Deduced a trap composed of 7 places in 87 ms of which 2 ms to minimize.
[2024-06-01 10:42:19] [INFO ] Deduced a trap composed of 6 places in 90 ms of which 3 ms to minimize.
[2024-06-01 10:42:19] [INFO ] Deduced a trap composed of 5 places in 98 ms of which 2 ms to minimize.
[2024-06-01 10:42:19] [INFO ] Deduced a trap composed of 7 places in 94 ms of which 2 ms to minimize.
[2024-06-01 10:42:19] [INFO ] Deduced a trap composed of 5 places in 94 ms of which 2 ms to minimize.
[2024-06-01 10:42:19] [INFO ] Deduced a trap composed of 8 places in 97 ms of which 2 ms to minimize.
[2024-06-01 10:42:20] [INFO ] Deduced a trap composed of 7 places in 95 ms of which 2 ms to minimize.
[2024-06-01 10:42:20] [INFO ] Deduced a trap composed of 7 places in 95 ms of which 3 ms to minimize.
[2024-06-01 10:42:20] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 2 ms to minimize.
[2024-06-01 10:42:20] [INFO ] Deduced a trap composed of 5 places in 86 ms of which 2 ms to minimize.
[2024-06-01 10:42:20] [INFO ] Deduced a trap composed of 6 places in 88 ms of which 2 ms to minimize.
[2024-06-01 10:42:20] [INFO ] Deduced a trap composed of 5 places in 89 ms of which 2 ms to minimize.
[2024-06-01 10:42:20] [INFO ] Deduced a trap composed of 5 places in 85 ms of which 1 ms to minimize.
[2024-06-01 10:42:20] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 1 ms to minimize.
[2024-06-01 10:42:20] [INFO ] Deduced a trap composed of 7 places in 85 ms of which 3 ms to minimize.
[2024-06-01 10:42:20] [INFO ] Deduced a trap composed of 9 places in 94 ms of which 2 ms to minimize.
[2024-06-01 10:42:21] [INFO ] Deduced a trap composed of 12 places in 77 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/819 variables, 20/267 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 10:42:21] [INFO ] Deduced a trap composed of 7 places in 76 ms of which 1 ms to minimize.
[2024-06-01 10:42:21] [INFO ] Deduced a trap composed of 5 places in 79 ms of which 1 ms to minimize.
[2024-06-01 10:42:21] [INFO ] Deduced a trap composed of 5 places in 69 ms of which 1 ms to minimize.
[2024-06-01 10:42:21] [INFO ] Deduced a trap composed of 5 places in 63 ms of which 2 ms to minimize.
[2024-06-01 10:42:21] [INFO ] Deduced a trap composed of 8 places in 63 ms of which 1 ms to minimize.
[2024-06-01 10:42:21] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 1 ms to minimize.
[2024-06-01 10:42:21] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 1 ms to minimize.
[2024-06-01 10:42:21] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 1 ms to minimize.
[2024-06-01 10:42:21] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 2 ms to minimize.
[2024-06-01 10:42:21] [INFO ] Deduced a trap composed of 5 places in 61 ms of which 1 ms to minimize.
[2024-06-01 10:42:21] [INFO ] Deduced a trap composed of 5 places in 67 ms of which 1 ms to minimize.
[2024-06-01 10:42:22] [INFO ] Deduced a trap composed of 8 places in 64 ms of which 1 ms to minimize.
[2024-06-01 10:42:22] [INFO ] Deduced a trap composed of 6 places in 65 ms of which 1 ms to minimize.
[2024-06-01 10:42:22] [INFO ] Deduced a trap composed of 8 places in 62 ms of which 1 ms to minimize.
[2024-06-01 10:42:22] [INFO ] Deduced a trap composed of 8 places in 59 ms of which 1 ms to minimize.
[2024-06-01 10:42:22] [INFO ] Deduced a trap composed of 7 places in 57 ms of which 1 ms to minimize.
[2024-06-01 10:42:22] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 2 ms to minimize.
[2024-06-01 10:42:22] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 2 ms to minimize.
[2024-06-01 10:42:22] [INFO ] Deduced a trap composed of 8 places in 68 ms of which 2 ms to minimize.
[2024-06-01 10:42:22] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/819 variables, 20/287 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 10:42:22] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 1 ms to minimize.
[2024-06-01 10:42:22] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 1 ms to minimize.
[2024-06-01 10:42:22] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 1 ms to minimize.
[2024-06-01 10:42:22] [INFO ] Deduced a trap composed of 7 places in 64 ms of which 2 ms to minimize.
[2024-06-01 10:42:23] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 1 ms to minimize.
[2024-06-01 10:42:23] [INFO ] Deduced a trap composed of 6 places in 65 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/819 variables, 6/293 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 10:42:23] [INFO ] Deduced a trap composed of 8 places in 69 ms of which 1 ms to minimize.
[2024-06-01 10:42:23] [INFO ] Deduced a trap composed of 5 places in 68 ms of which 2 ms to minimize.
[2024-06-01 10:42:23] [INFO ] Deduced a trap composed of 8 places in 73 ms of which 2 ms to minimize.
[2024-06-01 10:42:23] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 1 ms to minimize.
[2024-06-01 10:42:23] [INFO ] Deduced a trap composed of 10 places in 67 ms of which 2 ms to minimize.
[2024-06-01 10:42:23] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 2 ms to minimize.
[2024-06-01 10:42:23] [INFO ] Deduced a trap composed of 5 places in 74 ms of which 2 ms to minimize.
[2024-06-01 10:42:24] [INFO ] Deduced a trap composed of 6 places in 69 ms of which 2 ms to minimize.
[2024-06-01 10:42:24] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/819 variables, 9/302 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 10:42:24] [INFO ] Deduced a trap composed of 5 places in 67 ms of which 1 ms to minimize.
[2024-06-01 10:42:24] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 1 ms to minimize.
[2024-06-01 10:42:24] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/819 variables, 3/305 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 10:42:24] [INFO ] Deduced a trap composed of 6 places in 69 ms of which 1 ms to minimize.
[2024-06-01 10:42:24] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/819 variables, 2/307 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 10:42:24] [INFO ] Deduced a trap composed of 8 places in 67 ms of which 2 ms to minimize.
[2024-06-01 10:42:25] [INFO ] Deduced a trap composed of 10 places in 75 ms of which 1 ms to minimize.
[2024-06-01 10:42:25] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 2 ms to minimize.
[2024-06-01 10:42:25] [INFO ] Deduced a trap composed of 8 places in 70 ms of which 1 ms to minimize.
[2024-06-01 10:42:25] [INFO ] Deduced a trap composed of 6 places in 78 ms of which 2 ms to minimize.
[2024-06-01 10:42:25] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 2 ms to minimize.
[2024-06-01 10:42:25] [INFO ] Deduced a trap composed of 11 places in 86 ms of which 1 ms to minimize.
[2024-06-01 10:42:25] [INFO ] Deduced a trap composed of 8 places in 78 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/819 variables, 8/315 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/819 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 86/905 variables, 40/355 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 10:42:25] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 1 ms to minimize.
[2024-06-01 10:42:26] [INFO ] Deduced a trap composed of 5 places in 74 ms of which 2 ms to minimize.
[2024-06-01 10:42:26] [INFO ] Deduced a trap composed of 5 places in 72 ms of which 1 ms to minimize.
[2024-06-01 10:42:26] [INFO ] Deduced a trap composed of 5 places in 72 ms of which 1 ms to minimize.
[2024-06-01 10:42:26] [INFO ] Deduced a trap composed of 11 places in 67 ms of which 1 ms to minimize.
[2024-06-01 10:42:26] [INFO ] Deduced a trap composed of 6 places in 73 ms of which 1 ms to minimize.
[2024-06-01 10:42:26] [INFO ] Deduced a trap composed of 5 places in 56 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/905 variables, 7/362 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/905 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 904/1809 variables, 905/1267 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1809 variables, 102/1369 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1809 variables, 2/1371 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 10:42:27] [INFO ] Deduced a trap composed of 5 places in 104 ms of which 3 ms to minimize.
[2024-06-01 10:42:27] [INFO ] Deduced a trap composed of 5 places in 97 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1809 variables, 2/1373 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 10:42:27] [INFO ] Deduced a trap composed of 4 places in 93 ms of which 2 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/1809 variables, 1/1374 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 10:42:28] [INFO ] Deduced a trap composed of 11 places in 92 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/1809 variables, 1/1375 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1809 variables, 0/1375 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 20 (OVERLAPS) 181/1990 variables, 133/1508 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1990 variables, 62/1570 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1990 variables, 4/1574 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1990 variables, 6/1580 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 10:42:30] [INFO ] Deduced a trap composed of 13 places in 128 ms of which 3 ms to minimize.
[2024-06-01 10:42:30] [INFO ] Deduced a trap composed of 4 places in 129 ms of which 3 ms to minimize.
[2024-06-01 10:42:30] [INFO ] Deduced a trap composed of 7 places in 123 ms of which 3 ms to minimize.
[2024-06-01 10:42:31] [INFO ] Deduced a trap composed of 10 places in 129 ms of which 3 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/1990 variables, 4/1584 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 10:42:32] [INFO ] Deduced a trap composed of 5 places in 107 ms of which 3 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/1990 variables, 1/1585 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1990 variables, 0/1585 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 27 (OVERLAPS) 2/1992 variables, 3/1588 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1992 variables, 2/1590 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1992 variables, 0/1590 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 30 (OVERLAPS) 2/1994 variables, 1/1591 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 10:42:35] [INFO ] Deduced a trap composed of 5 places in 76 ms of which 2 ms to minimize.
[2024-06-01 10:42:35] [INFO ] Deduced a trap composed of 6 places in 75 ms of which 2 ms to minimize.
At refinement iteration 31 (INCLUDED_ONLY) 0/1994 variables, 2/1593 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1994 variables, 0/1593 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 33 (OVERLAPS) 25/2019 variables, 18/1611 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/2019 variables, 6/1617 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/2019 variables, 0/1617 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 36 (OVERLAPS) 1/2020 variables, 2/1619 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/2020 variables, 1/1620 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/2020 variables, 0/1620 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 39 (OVERLAPS) 0/2020 variables, 0/1620 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2020/2020 variables, and 1620 constraints, problems are : Problem set: 0 solved, 8 unsolved in 21823 ms.
Refiners :[Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 1059/1059 constraints, ReadFeed: 106/106 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 86/86 constraints]
After SMT, in 25130ms problems are : Problem set: 0 solved, 8 unsolved
Fused 8 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 12234 ms.
Support contains 211 out of 1059 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1059/1059 places, 961/961 transitions.
Applied a total of 0 rules in 40 ms. Remains 1059 /1059 variables (removed 0) and now considering 961/961 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 1059/1059 places, 961/961 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1059/1059 places, 961/961 transitions.
Applied a total of 0 rules in 28 ms. Remains 1059 /1059 variables (removed 0) and now considering 961/961 (removed 0) transitions.
[2024-06-01 10:42:52] [INFO ] Invariant cache hit.
[2024-06-01 10:42:53] [INFO ] Implicit Places using invariants in 479 ms returned []
[2024-06-01 10:42:53] [INFO ] Invariant cache hit.
[2024-06-01 10:42:53] [INFO ] State equation strengthened by 106 read => feed constraints.
[2024-06-01 10:42:55] [INFO ] Implicit Places using invariants and state equation in 1770 ms returned []
Implicit Place search using SMT with State Equation took 2263 ms to find 0 implicit places.
[2024-06-01 10:42:55] [INFO ] Redundant transitions in 48 ms returned []
Running 926 sub problems to find dead transitions.
[2024-06-01 10:42:55] [INFO ] Invariant cache hit.
[2024-06-01 10:42:55] [INFO ] State equation strengthened by 106 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1024 variables, 113/113 constraints. Problems are: Problem set: 0 solved, 926 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1024 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 926 unsolved
At refinement iteration 2 (OVERLAPS) 35/1059 variables, 248/361 constraints. Problems are: Problem set: 0 solved, 926 unsolved
[2024-06-01 10:43:22] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 1 ms to minimize.
[2024-06-01 10:43:23] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
[2024-06-01 10:43:23] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
[2024-06-01 10:43:23] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 0 ms to minimize.
[2024-06-01 10:43:23] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 1 ms to minimize.
[2024-06-01 10:43:23] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2024-06-01 10:43:23] [INFO ] Deduced a trap composed of 6 places in 39 ms of which 0 ms to minimize.
[2024-06-01 10:43:23] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 1 ms to minimize.
[2024-06-01 10:43:23] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 0 ms to minimize.
[2024-06-01 10:43:23] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 0 ms to minimize.
[2024-06-01 10:43:23] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 1 ms to minimize.
[2024-06-01 10:43:24] [INFO ] Deduced a trap composed of 6 places in 44 ms of which 0 ms to minimize.
[2024-06-01 10:43:24] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 0 ms to minimize.
[2024-06-01 10:43:24] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
[2024-06-01 10:43:24] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 1 ms to minimize.
[2024-06-01 10:43:24] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 0 ms to minimize.
[2024-06-01 10:43:25] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 0 ms to minimize.
[2024-06-01 10:43:25] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 1 ms to minimize.
[2024-06-01 10:43:25] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2024-06-01 10:43:25] [INFO ] Deduced a trap composed of 9 places in 38 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")
At refinement iteration 3 (INCLUDED_ONLY) 0/1059 variables, 20/381 constraints. Problems are: Problem set: 0 solved, 926 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1059/2020 variables, and 381 constraints, problems are : Problem set: 0 solved, 926 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 0/1059 constraints, ReadFeed: 0/106 constraints, PredecessorRefiner: 926/926 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 926 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1024 variables, 113/113 constraints. Problems are: Problem set: 0 solved, 926 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1024 variables, 5/118 constraints. Problems are: Problem set: 0 solved, 926 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1024 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 926 unsolved
At refinement iteration 3 (OVERLAPS) 35/1059 variables, 248/366 constraints. Problems are: Problem set: 0 solved, 926 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1059 variables, 15/381 constraints. Problems are: Problem set: 0 solved, 926 unsolved
[2024-06-01 10:43:40] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 1 ms to minimize.
[2024-06-01 10:43:42] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 1 ms to minimize.
[2024-06-01 10:43:42] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 1 ms to minimize.
[2024-06-01 10:43:42] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 1 ms to minimize.
[2024-06-01 10:43:42] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 1 ms to minimize.
[2024-06-01 10:43:42] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
[2024-06-01 10:43:42] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
[2024-06-01 10:43:42] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 1 ms to minimize.
[2024-06-01 10:43:42] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 1 ms to minimize.
[2024-06-01 10:43:42] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 0 ms to minimize.
[2024-06-01 10:43:42] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
[2024-06-01 10:43:42] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
[2024-06-01 10:43:43] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 0 ms to minimize.
[2024-06-01 10:43:43] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 1 ms to minimize.
[2024-06-01 10:43:43] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 0 ms to minimize.
[2024-06-01 10:43:43] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 0 ms to minimize.
[2024-06-01 10:43:43] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 1 ms to minimize.
[2024-06-01 10:43:43] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 1 ms to minimize.
[2024-06-01 10:43:43] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 0 ms to minimize.
[2024-06-01 10:43:43] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1059 variables, 20/401 constraints. Problems are: Problem set: 0 solved, 926 unsolved
[2024-06-01 10:43:46] [INFO ] Deduced a trap composed of 5 places in 51 ms of which 1 ms to minimize.
[2024-06-01 10:43:46] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 1 ms to minimize.
[2024-06-01 10:43:46] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 0 ms to minimize.
[2024-06-01 10:43:46] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 1 ms to minimize.
[2024-06-01 10:43:47] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 1 ms to minimize.
[2024-06-01 10:43:47] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 1 ms to minimize.
[2024-06-01 10:43:48] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 1 ms to minimize.
[2024-06-01 10:43:48] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 1 ms to minimize.
[2024-06-01 10:43:48] [INFO ] Deduced a trap composed of 6 places in 49 ms of which 1 ms to minimize.
[2024-06-01 10:43:48] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 1 ms to minimize.
[2024-06-01 10:43:48] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 1 ms to minimize.
[2024-06-01 10:43:48] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 1 ms to minimize.
[2024-06-01 10:43:48] [INFO ] Deduced a trap composed of 5 places in 50 ms of which 1 ms to minimize.
[2024-06-01 10:43:48] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
[2024-06-01 10:43:48] [INFO ] Deduced a trap composed of 5 places in 55 ms of which 1 ms to minimize.
[2024-06-01 10:43:49] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
[2024-06-01 10:43:49] [INFO ] Deduced a trap composed of 5 places in 51 ms of which 1 ms to minimize.
[2024-06-01 10:43:49] [INFO ] Deduced a trap composed of 5 places in 62 ms of which 2 ms to minimize.
[2024-06-01 10:43:49] [INFO ] Deduced a trap composed of 7 places in 58 ms of which 1 ms to minimize.
[2024-06-01 10:43:49] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1059 variables, 20/421 constraints. Problems are: Problem set: 0 solved, 926 unsolved
[2024-06-01 10:43:54] [INFO ] Deduced a trap composed of 5 places in 51 ms of which 1 ms to minimize.
[2024-06-01 10:43:54] [INFO ] Deduced a trap composed of 5 places in 51 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1059/2020 variables, and 423 constraints, problems are : Problem set: 0 solved, 926 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 0/1059 constraints, ReadFeed: 0/106 constraints, PredecessorRefiner: 0/926 constraints, Known Traps: 62/62 constraints]
After SMT, in 60293ms problems are : Problem set: 0 solved, 926 unsolved
Search for dead transitions found 0 dead transitions in 60304ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62655 ms. Remains : 1059/1059 places, 961/961 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 70 times.
Drop transitions (Partial Free agglomeration) removed 70 transitions
Iterating global reduction 0 with 70 rules applied. Total rules applied 70 place count 1059 transition count 961
Applied a total of 70 rules in 53 ms. Remains 1059 /1059 variables (removed 0) and now considering 961/961 (removed 0) transitions.
Running SMT prover for 8 properties.
// Phase 1: matrix 961 rows 1059 cols
[2024-06-01 10:43:55] [INFO ] Computed 361 invariants in 3 ms
[2024-06-01 10:43:56] [INFO ] After 388ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2024-06-01 10:43:56] [INFO ] [Nat]Absence check using 361 positive place invariants in 54 ms returned sat
[2024-06-01 10:43:57] [INFO ] After 952ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2024-06-01 10:43:57] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-06-01 10:43:58] [INFO ] After 755ms SMT Verify possible using 61 Read/Feed constraints in natural domain returned unsat :0 sat :8
TRAPS : Iteration 0
[2024-06-01 10:43:58] [INFO ] Deduced a trap composed of 3 places in 153 ms of which 3 ms to minimize.
[2024-06-01 10:43:58] [INFO ] Deduced a trap composed of 8 places in 163 ms of which 4 ms to minimize.
[2024-06-01 10:43:58] [INFO ] Deduced a trap composed of 7 places in 151 ms of which 7 ms to minimize.
[2024-06-01 10:43:58] [INFO ] Deduced a trap composed of 6 places in 153 ms of which 3 ms to minimize.
[2024-06-01 10:43:59] [INFO ] Deduced a trap composed of 7 places in 161 ms of which 2 ms to minimize.
[2024-06-01 10:43:59] [INFO ] Deduced a trap composed of 8 places in 170 ms of which 3 ms to minimize.
[2024-06-01 10:43:59] [INFO ] Deduced a trap composed of 7 places in 136 ms of which 3 ms to minimize.
[2024-06-01 10:43:59] [INFO ] Deduced a trap composed of 5 places in 158 ms of which 2 ms to minimize.
[2024-06-01 10:43:59] [INFO ] Deduced a trap composed of 5 places in 135 ms of which 3 ms to minimize.
[2024-06-01 10:44:00] [INFO ] Deduced a trap composed of 7 places in 124 ms of which 3 ms to minimize.
[2024-06-01 10:44:00] [INFO ] Deduced a trap composed of 5 places in 123 ms of which 2 ms to minimize.
[2024-06-01 10:44:00] [INFO ] Deduced a trap composed of 7 places in 117 ms of which 2 ms to minimize.
[2024-06-01 10:44:00] [INFO ] Deduced a trap composed of 7 places in 118 ms of which 2 ms to minimize.
[2024-06-01 10:44:00] [INFO ] Deduced a trap composed of 9 places in 117 ms of which 2 ms to minimize.
[2024-06-01 10:44:00] [INFO ] Deduced a trap composed of 3 places in 116 ms of which 3 ms to minimize.
[2024-06-01 10:44:01] [INFO ] Deduced a trap composed of 6 places in 118 ms of which 2 ms to minimize.
[2024-06-01 10:44:01] [INFO ] Deduced a trap composed of 8 places in 109 ms of which 2 ms to minimize.
[2024-06-01 10:44:01] [INFO ] Deduced a trap composed of 9 places in 115 ms of which 3 ms to minimize.
[2024-06-01 10:44:01] [INFO ] Deduced a trap composed of 8 places in 117 ms of which 3 ms to minimize.
[2024-06-01 10:44:01] [INFO ] Deduced a trap composed of 7 places in 111 ms of which 2 ms to minimize.
[2024-06-01 10:44:01] [INFO ] Deduced a trap composed of 9 places in 108 ms of which 3 ms to minimize.
[2024-06-01 10:44:01] [INFO ] Deduced a trap composed of 9 places in 114 ms of which 2 ms to minimize.
[2024-06-01 10:44:02] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 3803 ms
[2024-06-01 10:44:02] [INFO ] Deduced a trap composed of 5 places in 144 ms of which 3 ms to minimize.
[2024-06-01 10:44:02] [INFO ] Deduced a trap composed of 6 places in 136 ms of which 3 ms to minimize.
[2024-06-01 10:44:02] [INFO ] Deduced a trap composed of 5 places in 129 ms of which 3 ms to minimize.
[2024-06-01 10:44:02] [INFO ] Deduced a trap composed of 8 places in 132 ms of which 3 ms to minimize.
[2024-06-01 10:44:02] [INFO ] Deduced a trap composed of 5 places in 125 ms of which 3 ms to minimize.
[2024-06-01 10:44:03] [INFO ] Deduced a trap composed of 8 places in 134 ms of which 3 ms to minimize.
[2024-06-01 10:44:03] [INFO ] Deduced a trap composed of 10 places in 140 ms of which 3 ms to minimize.
[2024-06-01 10:44:03] [INFO ] Deduced a trap composed of 13 places in 115 ms of which 2 ms to minimize.
[2024-06-01 10:44:03] [INFO ] Deduced a trap composed of 5 places in 111 ms of which 3 ms to minimize.
[2024-06-01 10:44:03] [INFO ] Deduced a trap composed of 11 places in 107 ms of which 2 ms to minimize.
[2024-06-01 10:44:03] [INFO ] Deduced a trap composed of 9 places in 110 ms of which 3 ms to minimize.
[2024-06-01 10:44:04] [INFO ] Deduced a trap composed of 8 places in 123 ms of which 2 ms to minimize.
[2024-06-01 10:44:04] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1998 ms
[2024-06-01 10:44:04] [INFO ] Deduced a trap composed of 3 places in 101 ms of which 2 ms to minimize.
[2024-06-01 10:44:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 173 ms
[2024-06-01 10:44:04] [INFO ] Deduced a trap composed of 8 places in 100 ms of which 2 ms to minimize.
[2024-06-01 10:44:04] [INFO ] Deduced a trap composed of 7 places in 91 ms of which 2 ms to minimize.
[2024-06-01 10:44:05] [INFO ] Deduced a trap composed of 6 places in 94 ms of which 2 ms to minimize.
[2024-06-01 10:44:05] [INFO ] Deduced a trap composed of 6 places in 90 ms of which 2 ms to minimize.
[2024-06-01 10:44:05] [INFO ] Deduced a trap composed of 7 places in 89 ms of which 2 ms to minimize.
[2024-06-01 10:44:05] [INFO ] Deduced a trap composed of 13 places in 101 ms of which 1 ms to minimize.
[2024-06-01 10:44:05] [INFO ] Deduced a trap composed of 18 places in 86 ms of which 2 ms to minimize.
[2024-06-01 10:44:05] [INFO ] Deduced a trap composed of 13 places in 89 ms of which 2 ms to minimize.
[2024-06-01 10:44:05] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1135 ms
[2024-06-01 10:44:06] [INFO ] Deduced a trap composed of 10 places in 113 ms of which 2 ms to minimize.
[2024-06-01 10:44:06] [INFO ] Deduced a trap composed of 12 places in 95 ms of which 2 ms to minimize.
[2024-06-01 10:44:06] [INFO ] Deduced a trap composed of 5 places in 95 ms of which 2 ms to minimize.
[2024-06-01 10:44:06] [INFO ] Deduced a trap composed of 11 places in 101 ms of which 2 ms to minimize.
[2024-06-01 10:44:06] [INFO ] Deduced a trap composed of 10 places in 91 ms of which 2 ms to minimize.
[2024-06-01 10:44:06] [INFO ] Deduced a trap composed of 9 places in 95 ms of which 2 ms to minimize.
[2024-06-01 10:44:06] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 883 ms
[2024-06-01 10:44:07] [INFO ] Deduced a trap composed of 5 places in 117 ms of which 2 ms to minimize.
[2024-06-01 10:44:07] [INFO ] Deduced a trap composed of 8 places in 96 ms of which 2 ms to minimize.
[2024-06-01 10:44:07] [INFO ] Deduced a trap composed of 4 places in 108 ms of which 2 ms to minimize.
[2024-06-01 10:44:07] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 481 ms
TRAPS : Iteration 1
[2024-06-01 10:44:07] [INFO ] Deduced a trap composed of 6 places in 107 ms of which 3 ms to minimize.
[2024-06-01 10:44:07] [INFO ] Deduced a trap composed of 12 places in 108 ms of which 3 ms to minimize.
[2024-06-01 10:44:07] [INFO ] Deduced a trap composed of 4 places in 108 ms of which 3 ms to minimize.
[2024-06-01 10:44:07] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 480 ms
[2024-06-01 10:44:08] [INFO ] Deduced a trap composed of 5 places in 102 ms of which 2 ms to minimize.
[2024-06-01 10:44:08] [INFO ] Deduced a trap composed of 5 places in 95 ms of which 2 ms to minimize.
[2024-06-01 10:44:08] [INFO ] Deduced a trap composed of 7 places in 93 ms of which 2 ms to minimize.
[2024-06-01 10:44:08] [INFO ] Deduced a trap composed of 8 places in 90 ms of which 2 ms to minimize.
[2024-06-01 10:44:08] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 2 ms to minimize.
[2024-06-01 10:44:08] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 698 ms
[2024-06-01 10:44:09] [INFO ] Deduced a trap composed of 6 places in 207 ms of which 4 ms to minimize.
[2024-06-01 10:44:09] [INFO ] Deduced a trap composed of 10 places in 139 ms of which 3 ms to minimize.
[2024-06-01 10:44:09] [INFO ] Deduced a trap composed of 9 places in 148 ms of which 3 ms to minimize.
[2024-06-01 10:44:09] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 697 ms
[2024-06-01 10:44:09] [INFO ] Deduced a trap composed of 5 places in 160 ms of which 3 ms to minimize.
[2024-06-01 10:44:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 232 ms
[2024-06-01 10:44:10] [INFO ] Deduced a trap composed of 9 places in 187 ms of which 4 ms to minimize.
[2024-06-01 10:44:10] [INFO ] Deduced a trap composed of 10 places in 188 ms of which 3 ms to minimize.
[2024-06-01 10:44:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 491 ms
[2024-06-01 10:44:11] [INFO ] Deduced a trap composed of 11 places in 120 ms of which 2 ms to minimize.
[2024-06-01 10:44:11] [INFO ] Deduced a trap composed of 9 places in 136 ms of which 3 ms to minimize.
[2024-06-01 10:44:11] [INFO ] Deduced a trap composed of 6 places in 130 ms of which 2 ms to minimize.
[2024-06-01 10:44:11] [INFO ] Deduced a trap composed of 8 places in 132 ms of which 2 ms to minimize.
[2024-06-01 10:44:11] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 713 ms
TRAPS : Iteration 2
[2024-06-01 10:44:11] [INFO ] Deduced a trap composed of 6 places in 144 ms of which 3 ms to minimize.
[2024-06-01 10:44:11] [INFO ] Deduced a trap composed of 7 places in 147 ms of which 3 ms to minimize.
[2024-06-01 10:44:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 409 ms
[2024-06-01 10:44:12] [INFO ] Deduced a trap composed of 13 places in 155 ms of which 3 ms to minimize.
[2024-06-01 10:44:12] [INFO ] Deduced a trap composed of 5 places in 141 ms of which 3 ms to minimize.
[2024-06-01 10:44:12] [INFO ] Deduced a trap composed of 7 places in 148 ms of which 3 ms to minimize.
[2024-06-01 10:44:12] [INFO ] Deduced a trap composed of 7 places in 140 ms of which 3 ms to minimize.
[2024-06-01 10:44:13] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 783 ms
[2024-06-01 10:44:13] [INFO ] Deduced a trap composed of 9 places in 135 ms of which 2 ms to minimize.
[2024-06-01 10:44:13] [INFO ] Deduced a trap composed of 7 places in 132 ms of which 2 ms to minimize.
[2024-06-01 10:44:13] [INFO ] Deduced a trap composed of 7 places in 125 ms of which 2 ms to minimize.
[2024-06-01 10:44:13] [INFO ] Deduced a trap composed of 10 places in 124 ms of which 3 ms to minimize.
[2024-06-01 10:44:13] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 718 ms
[2024-06-01 10:44:14] [INFO ] Deduced a trap composed of 4 places in 97 ms of which 2 ms to minimize.
[2024-06-01 10:44:14] [INFO ] Deduced a trap composed of 5 places in 91 ms of which 2 ms to minimize.
[2024-06-01 10:44:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 312 ms
[2024-06-01 10:44:14] [INFO ] Deduced a trap composed of 5 places in 108 ms of which 2 ms to minimize.
[2024-06-01 10:44:15] [INFO ] Deduced a trap composed of 8 places in 111 ms of which 3 ms to minimize.
[2024-06-01 10:44:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 341 ms
TRAPS : Iteration 3
[2024-06-01 10:44:15] [INFO ] Deduced a trap composed of 10 places in 139 ms of which 2 ms to minimize.
[2024-06-01 10:44:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 214 ms
[2024-06-01 10:44:15] [INFO ] Deduced a trap composed of 5 places in 125 ms of which 2 ms to minimize.
[2024-06-01 10:44:15] [INFO ] Deduced a trap composed of 6 places in 115 ms of which 2 ms to minimize.
[2024-06-01 10:44:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 358 ms
[2024-06-01 10:44:16] [INFO ] Deduced a trap composed of 4 places in 109 ms of which 2 ms to minimize.
[2024-06-01 10:44:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 186 ms
[2024-06-01 10:44:16] [INFO ] Deduced a trap composed of 5 places in 104 ms of which 2 ms to minimize.
[2024-06-01 10:44:16] [INFO ] Deduced a trap composed of 6 places in 103 ms of which 2 ms to minimize.
[2024-06-01 10:44:16] [INFO ] Deduced a trap composed of 6 places in 95 ms of which 2 ms to minimize.
[2024-06-01 10:44:16] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 476 ms
TRAPS : Iteration 4
[2024-06-01 10:44:17] [INFO ] Deduced a trap composed of 9 places in 139 ms of which 3 ms to minimize.
[2024-06-01 10:44:18] [INFO ] Deduced a trap composed of 11 places in 163 ms of which 4 ms to minimize.
[2024-06-01 10:44:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 461 ms
[2024-06-01 10:44:19] [INFO ] Deduced a trap composed of 5 places in 149 ms of which 4 ms to minimize.
[2024-06-01 10:44:19] [INFO ] Deduced a trap composed of 7 places in 146 ms of which 3 ms to minimize.
[2024-06-01 10:44:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 423 ms
TRAPS : Iteration 5
[2024-06-01 10:44:19] [INFO ] Deduced a trap composed of 10 places in 137 ms of which 3 ms to minimize.
[2024-06-01 10:44:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 212 ms
[2024-06-01 10:44:20] [INFO ] Deduced a trap composed of 9 places in 119 ms of which 3 ms to minimize.
[2024-06-01 10:44:20] [INFO ] Deduced a trap composed of 7 places in 111 ms of which 2 ms to minimize.
[2024-06-01 10:44:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 356 ms
[2024-06-01 10:44:20] [INFO ] Deduced a trap composed of 6 places in 129 ms of which 3 ms to minimize.
[2024-06-01 10:44:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 211 ms
[2024-06-01 10:44:21] [INFO ] Deduced a trap composed of 9 places in 110 ms of which 2 ms to minimize.
[2024-06-01 10:44:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 197 ms
TRAPS : Iteration 6
[2024-06-01 10:44:21] [INFO ] Deduced a trap composed of 6 places in 100 ms of which 2 ms to minimize.
[2024-06-01 10:44:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 172 ms
TRAPS : Iteration 7
[2024-06-01 10:44:22] [INFO ] Deduced a trap composed of 6 places in 137 ms of which 3 ms to minimize.
[2024-06-01 10:44:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 219 ms
[2024-06-01 10:44:24] [INFO ] Deduced a trap composed of 9 places in 148 ms of which 3 ms to minimize.
[2024-06-01 10:44:24] [INFO ] Deduced a trap composed of 8 places in 132 ms of which 3 ms to minimize.
[2024-06-01 10:44:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 401 ms
TRAPS : Iteration 8
[2024-06-01 10:44:24] [INFO ] Deduced a trap composed of 4 places in 162 ms of which 3 ms to minimize.
[2024-06-01 10:44:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 237 ms
[2024-06-01 10:44:25] [INFO ] Deduced a trap composed of 8 places in 156 ms of which 3 ms to minimize.
[2024-06-01 10:44:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 230 ms
TRAPS : Iteration 9
[2024-06-01 10:44:27] [INFO ] After 29892ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
[2024-06-01 10:44:28] [INFO ] After 32157ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Over-approximation ignoring read arcs solved 0 properties in 32643 ms.
[2024-06-01 10:44:28] [INFO ] Export to MCC of 8 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 10 ms.
[2024-06-01 10:44:28] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1059 places, 961 transitions and 3787 arcs took 9 ms.
[2024-06-01 10:44:28] [INFO ] Flatten gal took : 120 ms
Total runtime 196343 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : ShieldIIPt-PT-040B-ReachabilityFireability-2024-01
Could not compute solution for formula : ShieldIIPt-PT-040B-ReachabilityFireability-2024-02
Could not compute solution for formula : ShieldIIPt-PT-040B-ReachabilityFireability-2024-03
Could not compute solution for formula : ShieldIIPt-PT-040B-ReachabilityFireability-2024-06
Could not compute solution for formula : ShieldIIPt-PT-040B-ReachabilityFireability-2024-08
Could not compute solution for formula : ShieldIIPt-PT-040B-ReachabilityFireability-2024-10
Could not compute solution for formula : ShieldIIPt-PT-040B-ReachabilityFireability-2024-14
Could not compute solution for formula : ShieldIIPt-PT-040B-ReachabilityFireability-2024-15

BK_STOP 1717238668929

--------------------
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 ReachabilityFireability -timeout 360 -rebuildPNML
mcc2024
rfs formula name ShieldIIPt-PT-040B-ReachabilityFireability-2024-01
rfs formula type AG
rfs formula formula --invariant=/tmp/1637/inv_0_
rfs formula name ShieldIIPt-PT-040B-ReachabilityFireability-2024-02
rfs formula type AG
rfs formula formula --invariant=/tmp/1637/inv_1_
rfs formula name ShieldIIPt-PT-040B-ReachabilityFireability-2024-03
rfs formula type EF
rfs formula formula --invariant=/tmp/1637/inv_2_
rfs formula name ShieldIIPt-PT-040B-ReachabilityFireability-2024-06
rfs formula type EF
rfs formula formula --invariant=/tmp/1637/inv_3_
rfs formula name ShieldIIPt-PT-040B-ReachabilityFireability-2024-08
rfs formula type EF
rfs formula formula --invariant=/tmp/1637/inv_4_
rfs formula name ShieldIIPt-PT-040B-ReachabilityFireability-2024-10
rfs formula type AG
rfs formula formula --invariant=/tmp/1637/inv_5_
rfs formula name ShieldIIPt-PT-040B-ReachabilityFireability-2024-14
rfs formula type EF
rfs formula formula --invariant=/tmp/1637/inv_6_
rfs formula name ShieldIIPt-PT-040B-ReachabilityFireability-2024-15
rfs formula type AG
rfs formula formula --invariant=/tmp/1637/inv_7_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

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="ShieldIIPt-PT-040B"
export BK_EXAMINATION="ReachabilityFireability"
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 ShieldIIPt-PT-040B, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r528-tall-171683760800319"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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