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.r508-tall-171654350800046.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 MultiCrashLeafsetExtension-PT-S16C07, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r508-tall-171654350800046
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.2M
-rw-r--r-- 1 mcc users 12K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 14K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 75K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.7K Apr 22 14:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Apr 22 14:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K Apr 22 14:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 24K Apr 12 06:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 145K Apr 12 06:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 16K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K Apr 22 14:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 5.7M 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 MultiCrashLeafsetExtension-PT-S16C07-ReachabilityCardinality-2024-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-ReachabilityCardinality-2024-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-ReachabilityCardinality-2024-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-ReachabilityCardinality-2024-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-ReachabilityCardinality-2024-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-ReachabilityCardinality-2024-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-ReachabilityCardinality-2024-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-ReachabilityCardinality-2024-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-ReachabilityCardinality-2024-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-ReachabilityCardinality-2024-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-ReachabilityCardinality-2024-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-ReachabilityCardinality-2024-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-ReachabilityCardinality-2024-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-ReachabilityCardinality-2024-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-ReachabilityCardinality-2024-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717196610989

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MultiCrashLeafsetExtension-PT-S16C07
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 23:03:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-31 23:03:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 23:03:32] [INFO ] Load time of PNML (sax parser for PT used): 392 ms
[2024-05-31 23:03:32] [INFO ] Transformed 6222 places.
[2024-05-31 23:03:32] [INFO ] Transformed 8685 transitions.
[2024-05-31 23:03:32] [INFO ] Parsed PT model containing 6222 places and 8685 transitions and 32582 arcs in 551 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 27 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (548 resets) in 2465 ms. (16 steps per ms) remains 13/16 properties
FORMULA MultiCrashLeafsetExtension-PT-S16C07-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C07-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C07-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (152 resets) in 372 ms. (107 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (152 resets) in 324 ms. (123 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (152 resets) in 286 ms. (139 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (152 resets) in 620 ms. (64 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (152 resets) in 806 ms. (49 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (152 resets) in 579 ms. (68 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (152 resets) in 241 ms. (165 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (152 resets) in 230 ms. (173 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (152 resets) in 208 ms. (191 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (152 resets) in 208 ms. (191 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (152 resets) in 171 ms. (232 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (152 resets) in 172 ms. (231 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (152 resets) in 197 ms. (202 steps per ms) remains 13/13 properties
[2024-05-31 23:03:35] [INFO ] Flow matrix only has 8413 transitions (discarded 272 similar events)
// Phase 1: matrix 8413 rows 6222 cols
[2024-05-31 23:03:35] [INFO ] Computed 611 invariants in 544 ms
[2024-05-31 23:03:35] [INFO ] State equation strengthened by 2450 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/327 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/327 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Problem MultiCrashLeafsetExtension-PT-S16C07-ReachabilityCardinality-2024-00 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S16C07-ReachabilityCardinality-2024-00 FALSE TECHNIQUES SMT_REFINEMENT
Problem MultiCrashLeafsetExtension-PT-S16C07-ReachabilityCardinality-2024-06 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S16C07-ReachabilityCardinality-2024-06 TRUE TECHNIQUES SMT_REFINEMENT
Problem MultiCrashLeafsetExtension-PT-S16C07-ReachabilityCardinality-2024-08 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S16C07-ReachabilityCardinality-2024-08 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 679/1006 variables, 4/5 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1006 variables, 2/7 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1006 variables, 0/7 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 26/1032 variables, 10/17 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1032 variables, 0/17 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 30/1062 variables, 30/47 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1062 variables, 0/47 constraints. Problems are: Problem set: 3 solved, 10 unsolved
Problem MultiCrashLeafsetExtension-PT-S16C07-ReachabilityCardinality-2024-01 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S16C07-ReachabilityCardinality-2024-01 TRUE TECHNIQUES SMT_REFINEMENT
Problem MultiCrashLeafsetExtension-PT-S16C07-ReachabilityCardinality-2024-03 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S16C07-ReachabilityCardinality-2024-03 FALSE TECHNIQUES SMT_REFINEMENT
Problem MultiCrashLeafsetExtension-PT-S16C07-ReachabilityCardinality-2024-05 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S16C07-ReachabilityCardinality-2024-05 FALSE TECHNIQUES SMT_REFINEMENT
Problem MultiCrashLeafsetExtension-PT-S16C07-ReachabilityCardinality-2024-07 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S16C07-ReachabilityCardinality-2024-07 FALSE TECHNIQUES SMT_REFINEMENT
Problem MultiCrashLeafsetExtension-PT-S16C07-ReachabilityCardinality-2024-09 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S16C07-ReachabilityCardinality-2024-09 FALSE TECHNIQUES SMT_REFINEMENT
Problem MultiCrashLeafsetExtension-PT-S16C07-ReachabilityCardinality-2024-10 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S16C07-ReachabilityCardinality-2024-10 FALSE TECHNIQUES SMT_REFINEMENT
Problem MultiCrashLeafsetExtension-PT-S16C07-ReachabilityCardinality-2024-11 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S16C07-ReachabilityCardinality-2024-11 FALSE TECHNIQUES SMT_REFINEMENT
Problem MultiCrashLeafsetExtension-PT-S16C07-ReachabilityCardinality-2024-12 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S16C07-ReachabilityCardinality-2024-12 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 9 (OVERLAPS) 3939/5001 variables, 288/335 constraints. Problems are: Problem set: 11 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/5001 variables, 0/335 constraints. Problems are: Problem set: 11 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 8/5009 variables, 8/343 constraints. Problems are: Problem set: 11 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/5009 variables, 0/343 constraints. Problems are: Problem set: 11 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 1213/6222 variables, 268/611 constraints. Problems are: Problem set: 11 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/6222 variables, 0/611 constraints. Problems are: Problem set: 11 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 14635/14635 variables, and 6833 constraints, problems are : Problem set: 11 solved, 2 unsolved in 5064 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, Generalized P Invariants (flows): 559/559 constraints, State Equation: 6222/6222 constraints, ReadFeed: 0/2450 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 11 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 11 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 3297/3301 variables, 4/4 constraints. Problems are: Problem set: 11 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3301 variables, 0/4 constraints. Problems are: Problem set: 11 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 521/3822 variables, 52/56 constraints. Problems are: Problem set: 11 solved, 2 unsolved
[2024-05-31 23:03:43] [INFO ] Deduced a trap composed of 304 places in 2001 ms of which 133 ms to minimize.
[2024-05-31 23:03:45] [INFO ] Deduced a trap composed of 98 places in 1617 ms of which 19 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/3822 variables, 2/58 constraints. Problems are: Problem set: 11 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3822 variables, 0/58 constraints. Problems are: Problem set: 11 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2315/6137 variables, 470/528 constraints. Problems are: Problem set: 11 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 6137/14635 variables, and 528 constraints, problems are : Problem set: 11 solved, 2 unsolved in 5009 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, Generalized P Invariants (flows): 474/559 constraints, State Equation: 0/6222 constraints, ReadFeed: 0/2450 constraints, PredecessorRefiner: 0/13 constraints, Known Traps: 2/2 constraints]
After SMT, in 10889ms problems are : Problem set: 11 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 6222 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6222/6222 places, 8685/8685 transitions.
Graph (complete) has 19247 edges and 6222 vertex of which 6189 are kept as prefixes of interest. Removing 33 places using SCC suffix rule.19 ms
Discarding 33 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1901 transitions
Trivial Post-agglo rules discarded 1901 transitions
Performed 1901 trivial Post agglomeration. Transition count delta: 1901
Iterating post reduction 0 with 1901 rules applied. Total rules applied 1902 place count 6189 transition count 6784
Reduce places removed 1901 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 1902 rules applied. Total rules applied 3804 place count 4288 transition count 6783
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3805 place count 4287 transition count 6783
Performed 238 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 238 Pre rules applied. Total rules applied 3805 place count 4287 transition count 6545
Deduced a syphon composed of 238 places in 6 ms
Reduce places removed 238 places and 0 transitions.
Iterating global reduction 3 with 476 rules applied. Total rules applied 4281 place count 4049 transition count 6545
Discarding 1663 places :
Symmetric choice reduction at 3 with 1663 rule applications. Total rules 5944 place count 2386 transition count 4882
Iterating global reduction 3 with 1663 rules applied. Total rules applied 7607 place count 2386 transition count 4882
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 7607 place count 2386 transition count 4871
Deduced a syphon composed of 11 places in 3 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 7629 place count 2375 transition count 4871
Discarding 235 places :
Symmetric choice reduction at 3 with 235 rule applications. Total rules 7864 place count 2140 transition count 3226
Iterating global reduction 3 with 235 rules applied. Total rules applied 8099 place count 2140 transition count 3226
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 3 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 8133 place count 2123 transition count 3209
Free-agglomeration rule (complex) applied 163 times.
Iterating global reduction 3 with 163 rules applied. Total rules applied 8296 place count 2123 transition count 4456
Reduce places removed 163 places and 0 transitions.
Iterating post reduction 3 with 163 rules applied. Total rules applied 8459 place count 1960 transition count 4456
Partial Free-agglomeration rule applied 51 times.
Drop transitions (Partial Free agglomeration) removed 51 transitions
Iterating global reduction 4 with 51 rules applied. Total rules applied 8510 place count 1960 transition count 4456
Applied a total of 8510 rules in 1667 ms. Remains 1960 /6222 variables (removed 4262) and now considering 4456/8685 (removed 4229) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1683 ms. Remains : 1960/6222 places, 4456/8685 transitions.
RANDOM walk for 40000 steps (914 resets) in 1204 ms. (33 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (169 resets) in 266 ms. (149 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (170 resets) in 254 ms. (156 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 54933 steps, run timeout after 3001 ms. (steps per millisecond=18 ) properties seen :0 out of 2
Probabilistic random walk after 54933 steps, saw 24497 distinct states, run finished after 3007 ms. (steps per millisecond=18 ) properties seen :0
[2024-05-31 23:03:51] [INFO ] Flow matrix only has 4058 transitions (discarded 398 similar events)
// Phase 1: matrix 4058 rows 1960 cols
[2024-05-31 23:03:51] [INFO ] Computed 578 invariants in 56 ms
[2024-05-31 23:03:51] [INFO ] State equation strengthened by 2450 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1013/1017 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1017 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 239/1256 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1256 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 597/1853 variables, 463/471 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 23:03:53] [INFO ] Deduced a trap composed of 5 places in 1610 ms of which 12 ms to minimize.
[2024-05-31 23:03:54] [INFO ] Deduced a trap composed of 329 places in 1637 ms of which 12 ms to minimize.
[2024-05-31 23:03:56] [INFO ] Deduced a trap composed of 288 places in 1641 ms of which 12 ms to minimize.
[2024-05-31 23:03:58] [INFO ] Deduced a trap composed of 285 places in 1663 ms of which 11 ms to minimize.
[2024-05-31 23:03:59] [INFO ] Deduced a trap composed of 311 places in 1609 ms of which 12 ms to minimize.
[2024-05-31 23:04:01] [INFO ] Deduced a trap composed of 298 places in 1585 ms of which 13 ms to minimize.
[2024-05-31 23:04:03] [INFO ] Deduced a trap composed of 315 places in 1602 ms of which 12 ms to minimize.
[2024-05-31 23:04:04] [INFO ] Deduced a trap composed of 286 places in 1632 ms of which 13 ms to minimize.
[2024-05-31 23:04:06] [INFO ] Deduced a trap composed of 340 places in 1550 ms of which 14 ms to minimize.
[2024-05-31 23:04:08] [INFO ] Deduced a trap composed of 358 places in 1570 ms of which 13 ms to minimize.
[2024-05-31 23:04:09] [INFO ] Deduced a trap composed of 335 places in 1604 ms of which 13 ms to minimize.
[2024-05-31 23:04:11] [INFO ] Deduced a trap composed of 379 places in 1567 ms of which 12 ms to minimize.
[2024-05-31 23:04:12] [INFO ] Deduced a trap composed of 236 places in 1583 ms of which 12 ms to minimize.
[2024-05-31 23:04:14] [INFO ] Deduced a trap composed of 294 places in 1581 ms of which 12 ms to minimize.
[2024-05-31 23:04:16] [INFO ] Deduced a trap composed of 339 places in 1575 ms of which 13 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1853 variables, 15/486 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 23:04:17] [INFO ] Deduced a trap composed of 27 places in 1651 ms of which 12 ms to minimize.
[2024-05-31 23:04:19] [INFO ] Deduced a trap composed of 284 places in 1674 ms of which 13 ms to minimize.
[2024-05-31 23:04:21] [INFO ] Deduced a trap composed of 356 places in 1667 ms of which 12 ms to minimize.
[2024-05-31 23:04:23] [INFO ] Deduced a trap composed of 325 places in 1672 ms of which 12 ms to minimize.
[2024-05-31 23:04:24] [INFO ] Deduced a trap composed of 323 places in 1660 ms of which 14 ms to minimize.
[2024-05-31 23:04:26] [INFO ] Deduced a trap composed of 264 places in 1586 ms of which 12 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1853 variables, 6/492 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1853 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 28/1881 variables, 28/520 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1881 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 79/1960 variables, 79/599 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1960 variables, 0/599 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 4058/6018 variables, 1960/2559 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/6018 variables, 2450/5009 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/6018 variables, 0/5009 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/6018 variables, 0/5009 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 6018/6018 variables, and 5009 constraints, problems are : Problem set: 0 solved, 2 unsolved in 37778 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 542/542 constraints, State Equation: 1960/1960 constraints, ReadFeed: 2450/2450 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1013/1017 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1017 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 239/1256 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1256 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 597/1853 variables, 463/471 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1853 variables, 21/492 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 23:04:30] [INFO ] Deduced a trap composed of 319 places in 1343 ms of which 11 ms to minimize.
[2024-05-31 23:04:32] [INFO ] Deduced a trap composed of 251 places in 1575 ms of which 12 ms to minimize.
[2024-05-31 23:04:34] [INFO ] Deduced a trap composed of 252 places in 1556 ms of which 11 ms to minimize.
[2024-05-31 23:04:35] [INFO ] Deduced a trap composed of 317 places in 1515 ms of which 11 ms to minimize.
[2024-05-31 23:04:37] [INFO ] Deduced a trap composed of 285 places in 1581 ms of which 14 ms to minimize.
[2024-05-31 23:04:38] [INFO ] Deduced a trap composed of 338 places in 1373 ms of which 12 ms to minimize.
[2024-05-31 23:04:40] [INFO ] Deduced a trap composed of 322 places in 1308 ms of which 13 ms to minimize.
[2024-05-31 23:04:41] [INFO ] Deduced a trap composed of 329 places in 1347 ms of which 12 ms to minimize.
[2024-05-31 23:04:43] [INFO ] Deduced a trap composed of 274 places in 1542 ms of which 11 ms to minimize.
[2024-05-31 23:04:44] [INFO ] Deduced a trap composed of 27 places in 1469 ms of which 11 ms to minimize.
[2024-05-31 23:04:46] [INFO ] Deduced a trap composed of 358 places in 1563 ms of which 12 ms to minimize.
[2024-05-31 23:04:47] [INFO ] Deduced a trap composed of 313 places in 1558 ms of which 12 ms to minimize.
[2024-05-31 23:04:49] [INFO ] Deduced a trap composed of 265 places in 1565 ms of which 11 ms to minimize.
[2024-05-31 23:04:50] [INFO ] Deduced a trap composed of 309 places in 1570 ms of which 12 ms to minimize.
[2024-05-31 23:04:52] [INFO ] Deduced a trap composed of 300 places in 1592 ms of which 13 ms to minimize.
[2024-05-31 23:04:54] [INFO ] Deduced a trap composed of 286 places in 1584 ms of which 12 ms to minimize.
[2024-05-31 23:04:55] [INFO ] Deduced a trap composed of 302 places in 1582 ms of which 13 ms to minimize.
[2024-05-31 23:04:57] [INFO ] Deduced a trap composed of 307 places in 1583 ms of which 12 ms to minimize.
[2024-05-31 23:04:59] [INFO ] Deduced a trap composed of 304 places in 1528 ms of which 12 ms to minimize.
[2024-05-31 23:05:00] [INFO ] Deduced a trap composed of 263 places in 1560 ms of which 11 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1853 variables, 20/512 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 23:05:02] [INFO ] Deduced a trap composed of 232 places in 1359 ms of which 12 ms to minimize.
[2024-05-31 23:05:03] [INFO ] Deduced a trap composed of 214 places in 1305 ms of which 12 ms to minimize.
[2024-05-31 23:05:04] [INFO ] Deduced a trap composed of 232 places in 1348 ms of which 15 ms to minimize.
[2024-05-31 23:05:06] [INFO ] Deduced a trap composed of 236 places in 1350 ms of which 13 ms to minimize.
[2024-05-31 23:05:07] [INFO ] Deduced a trap composed of 262 places in 1377 ms of which 14 ms to minimize.
[2024-05-31 23:05:08] [INFO ] Deduced a trap composed of 248 places in 1374 ms of which 12 ms to minimize.
[2024-05-31 23:05:10] [INFO ] Deduced a trap composed of 278 places in 1396 ms of which 11 ms to minimize.
[2024-05-31 23:05:11] [INFO ] Deduced a trap composed of 246 places in 1321 ms of which 11 ms to minimize.
[2024-05-31 23:05:13] [INFO ] Deduced a trap composed of 273 places in 1362 ms of which 12 ms to minimize.
[2024-05-31 23:05:14] [INFO ] Deduced a trap composed of 293 places in 1326 ms of which 11 ms to minimize.
SMT process timed out in 83337ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 1960 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1960/1960 places, 4456/4456 transitions.
Applied a total of 0 rules in 128 ms. Remains 1960 /1960 variables (removed 0) and now considering 4456/4456 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 128 ms. Remains : 1960/1960 places, 4456/4456 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1960/1960 places, 4456/4456 transitions.
Applied a total of 0 rules in 129 ms. Remains 1960 /1960 variables (removed 0) and now considering 4456/4456 (removed 0) transitions.
[2024-05-31 23:05:14] [INFO ] Flow matrix only has 4058 transitions (discarded 398 similar events)
[2024-05-31 23:05:14] [INFO ] Invariant cache hit.
[2024-05-31 23:05:19] [INFO ] Implicit Places using invariants in 4252 ms returned [4, 7, 9, 10, 11, 12, 13, 14, 15, 16, 20, 26, 34, 44, 56, 70, 85, 99, 100, 101, 102, 103, 104, 105, 106, 118, 128, 136, 142, 146, 148, 165, 171, 173, 174, 175, 176, 177, 178, 179, 180, 182, 186, 192, 200, 210, 222, 235, 247, 248, 249, 250, 251, 252, 253, 254, 264, 272, 278, 282, 284, 286, 303, 309, 311, 312, 313, 314, 315, 316, 317, 318, 320, 322, 326, 332, 340, 350, 361, 371, 372, 373, 374, 375, 376, 377, 378, 386, 392, 396, 398, 400, 402, 419, 425, 427, 428, 429, 430, 431, 432, 433, 434, 436, 438, 440, 444, 450, 458, 467, 475, 476, 477, 478, 479, 480, 481, 482, 488, 492, 494, 496, 498, 500, 517, 523, 525, 526, 527, 528, 529, 530, 531, 532, 534, 536, 538, 540, 544, 550, 557, 564, 565, 566, 567, 568, 569, 570, 574, 576, 578, 580, 582, 586, 603, 609, 611, 612, 613, 614, 615, 616, 617, 618, 620, 622, 624, 626, 628, 632, 637, 641, 642, 643, 644, 645, 646, 647, 648, 650, 652, 654, 656, 658, 660, 677, 683, 685, 686, 687, 688, 689, 690, 691, 692, 694, 696, 698, 700, 702, 704, 707, 709, 710, 711, 712, 713, 714, 715, 716, 718, 720, 722, 724, 726, 728, 745, 751, 753, 754, 755, 756, 757, 758, 759, 760, 762, 764, 766, 768, 770, 772, 774, 776, 777, 778, 779, 780, 782, 783, 785, 787, 789, 791, 793, 796, 813, 815, 818, 820, 821, 822, 823, 824, 825, 826, 827, 829, 831, 833, 835, 837, 839, 841, 843, 844, 845, 846, 847, 848, 849, 850, 852, 854, 856, 858, 860, 862, 879, 885, 887, 888, 889, 890, 891, 892, 893, 894, 896, 898, 900, 902, 904, 906, 908, 910, 911, 912, 913, 914, 915, 916, 917, 919, 921, 923, 925, 927, 929, 946, 952, 954, 955, 956, 957, 958, 959, 960, 961, 963, 965, 967, 969, 971, 973, 975, 978, 979, 980, 981, 982, 983, 984, 985, 987, 989, 991, 993, 995, 997, 1014, 1020, 1022, 1023, 1024, 1025, 1026, 1027, 1028, 1029, 1031, 1033, 1035, 1037, 1039, 1041, 1045, 1050, 1051, 1052, 1053, 1054, 1055, 1056, 1057, 1061, 1063, 1065, 1067, 1069, 1071, 1088, 1094, 1096, 1097, 1098, 1099, 1100, 1101, 1102, 1103, 1105, 1107, 1109, 1111, 1113, 1117, 1123, 1130, 1131, 1132, 1133, 1134, 1135, 1136, 1137, 1143, 1147, 1149, 1151, 1153, 1155, 1172, 1178, 1180, 1181, 1182, 1183, 1184, 1185, 1186, 1187, 1189, 1191, 1193, 1195, 1199, 1205, 1213, 1222, 1223, 1224, 1225, 1226, 1227, 1228, 1229, 1237, 1243, 1247, 1249, 1251, 1253, 1270, 1276, 1278, 1279, 1280, 1281, 1282, 1283, 1284, 1285, 1287, 1289, 1291, 1295, 1301, 1309, 1319, 1330, 1331, 1332, 1333, 1334, 1335, 1336, 1337, 1347, 1355, 1361, 1365, 1367, 1369, 1386, 1392, 1394, 1395, 1396, 1397, 1398, 1399, 1400, 1401, 1403, 1405, 1409, 1415, 1423, 1433, 1445, 1458, 1459, 1460, 1461, 1462, 1463, 1464, 1465, 1477, 1487, 1495, 1501, 1505, 1507, 1524, 1526, 1529, 1531, 1532, 1533, 1534, 1535, 1536, 1538, 1540, 1544, 1552, 1560, 1570, 1582, 1596, 1611, 1612, 1613, 1614, 1615, 1616, 1617, 1618, 1632, 1644, 1654, 1662, 1668, 1672, 1689]
[2024-05-31 23:05:19] [INFO ] Actually due to overlaps returned [165, 303, 419, 517, 603, 677, 745, 813, 879, 946, 1014, 1088, 1172, 1270, 1386, 1524, 1689, 4, 9, 10, 11, 12, 13, 14, 15, 99, 100, 101, 102, 103, 104, 105, 173, 174, 175, 176, 177, 178, 179, 247, 248, 249, 250, 251, 252, 253, 311, 312, 313, 314, 315, 316, 317, 371, 372, 373, 374, 375, 376, 377, 427, 428, 429, 430, 431, 432, 433, 475, 476, 477, 478, 479, 480, 481, 525, 526, 527, 528, 529, 530, 531, 564, 565, 566, 567, 568, 569, 611, 612, 613, 614, 615, 616, 617, 641, 642, 643, 644, 645, 646, 647, 685, 686, 687, 688, 689, 690, 691, 709, 710, 711, 712, 713, 714, 715, 753, 754, 755, 756, 757, 758, 759, 776, 777, 778, 779, 780, 782, 815, 820, 821, 822, 823, 824, 825, 826, 843, 844, 845, 846, 847, 848, 849, 887, 888, 889, 890, 891, 892, 893, 910, 911, 912, 913, 914, 915, 916, 954, 955, 956, 957, 958, 959, 960, 978, 979, 980, 981, 982, 983, 984, 1022, 1023, 1024, 1025, 1026, 1027, 1028, 1050, 1051, 1052, 1053, 1054, 1055, 1056, 1096, 1097, 1098, 1099, 1100, 1101, 1102, 1130, 1131, 1132, 1133, 1134, 1135, 1136, 1180, 1181, 1182, 1183, 1184, 1185, 1186, 1222, 1223, 1224, 1225, 1226, 1227, 1228, 1278, 1279, 1280, 1281, 1282, 1283, 1284, 1330, 1331, 1332, 1333, 1334, 1335, 1336, 1394, 1395, 1396, 1397, 1398, 1399, 1400, 1458, 1459, 1460, 1461, 1462, 1463, 1464, 1526, 1531, 1532, 1533, 1534, 1535, 1536, 1611, 1612, 1613, 1614, 1615, 1616, 1617]
Discarding 255 places :
Implicit Place search using SMT only with invariants took 4276 ms to find 255 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1705/1960 places, 4456/4456 transitions.
Discarding 221 places :
Symmetric choice reduction at 0 with 221 rule applications. Total rules 221 place count 1484 transition count 4235
Iterating global reduction 0 with 221 rules applied. Total rules applied 442 place count 1484 transition count 4235
Discarding 221 places :
Symmetric choice reduction at 0 with 221 rule applications. Total rules 663 place count 1263 transition count 4014
Iterating global reduction 0 with 221 rules applied. Total rules applied 884 place count 1263 transition count 4014
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 887 place count 1263 transition count 4011
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 890 place count 1260 transition count 4011
Applied a total of 890 rules in 295 ms. Remains 1260 /1705 variables (removed 445) and now considering 4011/4456 (removed 445) transitions.
[2024-05-31 23:05:19] [INFO ] Flow matrix only has 3613 transitions (discarded 398 similar events)
// Phase 1: matrix 3613 rows 1260 cols
[2024-05-31 23:05:19] [INFO ] Computed 323 invariants in 35 ms
[2024-05-31 23:05:21] [INFO ] Implicit Places using invariants in 2344 ms returned [6, 8, 12, 18, 26, 36, 48, 62, 77, 91, 103, 113, 121, 127, 131, 133, 154, 156, 158, 162, 168, 176, 186, 198, 211, 223, 233, 241, 247, 251, 253, 255, 263, 265, 267, 269, 273, 279, 287, 297, 308, 318, 326, 332, 336, 338, 340, 342, 350, 352, 354, 356, 358, 362, 368, 376, 385, 393, 399, 403, 405, 407, 409, 411, 419, 421, 423, 425, 427, 429, 433, 439, 446, 453, 457, 459, 461, 463, 465, 469, 478, 480, 482, 484, 486, 488, 490, 494, 499, 503, 505, 507, 509, 511, 513, 515, 523, 525, 527, 529, 531, 533, 535, 537, 540, 542, 544, 546, 548, 550, 552, 554, 562, 564, 566, 568, 570, 572, 574, 576, 578, 581, 583, 585, 587, 589, 591, 594, 601, 603, 605, 607, 609, 611, 613, 615, 617, 619, 621, 623, 625, 627, 629, 631, 638, 640, 642, 644, 646, 648, 650, 652, 654, 656, 658, 660, 662, 664, 666, 668, 676, 678, 680, 682, 684, 686, 688, 690, 692, 695, 697, 699, 701, 703, 705, 707, 715, 717, 719, 721, 723, 725, 727, 729, 733, 738, 742, 744, 746, 748, 750, 752, 760, 762, 764, 766, 768, 770, 772, 776, 782, 789, 795, 799, 801, 803, 805, 807, 815, 817, 819, 821, 823, 825, 829, 835, 843, 852, 860, 866, 870, 872, 874, 876, 884, 886, 888, 890, 892, 896, 902, 910, 920, 931, 941, 949, 955, 959, 961, 963, 971, 973, 975, 977, 981, 987, 995, 1005, 1017, 1030, 1042, 1052, 1060, 1066, 1070, 1072, 1078, 1081, 1083, 1087, 1095, 1103, 1113, 1125, 1139, 1154, 1168, 1180, 1190, 1198, 1204, 1208]
Discarding 272 places :
Implicit Place search using SMT only with invariants took 2358 ms to find 272 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 988/1960 places, 4011/4456 transitions.
Applied a total of 0 rules in 102 ms. Remains 988 /988 variables (removed 0) and now considering 4011/4011 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 7162 ms. Remains : 988/1960 places, 4011/4456 transitions.
RANDOM walk for 40000 steps (964 resets) in 1083 ms. (36 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (126 resets) in 151 ms. (263 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (129 resets) in 168 ms. (236 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 68419 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :0 out of 2
Probabilistic random walk after 68419 steps, saw 28691 distinct states, run finished after 3001 ms. (steps per millisecond=22 ) properties seen :0
[2024-05-31 23:05:25] [INFO ] Flow matrix only has 3613 transitions (discarded 398 similar events)
// Phase 1: matrix 3613 rows 988 cols
[2024-05-31 23:05:25] [INFO ] Computed 51 invariants in 42 ms
[2024-05-31 23:05:25] [INFO ] State equation strengthened by 2450 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 888/892 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/892 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 17/909 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/909 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 37/946 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 23:05:25] [INFO ] Deduced a trap composed of 115 places in 437 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/946 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/946 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 28/974 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/974 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 14/988 variables, 14/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 23:05:26] [INFO ] Deduced a trap composed of 135 places in 500 ms of which 6 ms to minimize.
[2024-05-31 23:05:27] [INFO ] Deduced a trap composed of 192 places in 511 ms of which 6 ms to minimize.
[2024-05-31 23:05:27] [INFO ] Deduced a trap composed of 133 places in 493 ms of which 9 ms to minimize.
[2024-05-31 23:05:28] [INFO ] Deduced a trap composed of 27 places in 485 ms of which 6 ms to minimize.
[2024-05-31 23:05:28] [INFO ] Deduced a trap composed of 126 places in 473 ms of which 6 ms to minimize.
[2024-05-31 23:05:29] [INFO ] Deduced a trap composed of 129 places in 472 ms of which 5 ms to minimize.
[2024-05-31 23:05:29] [INFO ] Deduced a trap composed of 133 places in 508 ms of which 6 ms to minimize.
[2024-05-31 23:05:30] [INFO ] Deduced a trap composed of 133 places in 498 ms of which 5 ms to minimize.
[2024-05-31 23:05:30] [INFO ] Deduced a trap composed of 148 places in 488 ms of which 6 ms to minimize.
[2024-05-31 23:05:31] [INFO ] Deduced a trap composed of 125 places in 473 ms of which 6 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/988 variables, 10/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/988 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 3613/4601 variables, 988/1050 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4601 variables, 2450/3500 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/4601 variables, 0/3500 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/4601 variables, 0/3500 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4601/4601 variables, and 3500 constraints, problems are : Problem set: 0 solved, 2 unsolved in 7404 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 988/988 constraints, ReadFeed: 2450/2450 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 888/892 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/892 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 17/909 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/909 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 37/946 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/946 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 23:05:33] [INFO ] Deduced a trap composed of 101 places in 446 ms of which 6 ms to minimize.
[2024-05-31 23:05:33] [INFO ] Deduced a trap composed of 120 places in 446 ms of which 6 ms to minimize.
[2024-05-31 23:05:34] [INFO ] Deduced a trap composed of 139 places in 460 ms of which 6 ms to minimize.
[2024-05-31 23:05:34] [INFO ] Deduced a trap composed of 137 places in 433 ms of which 5 ms to minimize.
[2024-05-31 23:05:35] [INFO ] Deduced a trap composed of 123 places in 437 ms of which 5 ms to minimize.
[2024-05-31 23:05:35] [INFO ] Deduced a trap composed of 119 places in 446 ms of which 5 ms to minimize.
[2024-05-31 23:05:36] [INFO ] Deduced a trap composed of 117 places in 448 ms of which 5 ms to minimize.
[2024-05-31 23:05:36] [INFO ] Deduced a trap composed of 127 places in 437 ms of which 5 ms to minimize.
[2024-05-31 23:05:37] [INFO ] Deduced a trap composed of 117 places in 442 ms of which 6 ms to minimize.
[2024-05-31 23:05:37] [INFO ] Deduced a trap composed of 123 places in 450 ms of which 6 ms to minimize.
[2024-05-31 23:05:38] [INFO ] Deduced a trap composed of 120 places in 439 ms of which 5 ms to minimize.
[2024-05-31 23:05:38] [INFO ] Deduced a trap composed of 117 places in 452 ms of which 6 ms to minimize.
[2024-05-31 23:05:38] [INFO ] Deduced a trap composed of 123 places in 444 ms of which 6 ms to minimize.
[2024-05-31 23:05:39] [INFO ] Deduced a trap composed of 121 places in 454 ms of which 5 ms to minimize.
[2024-05-31 23:05:39] [INFO ] Deduced a trap composed of 125 places in 482 ms of which 6 ms to minimize.
[2024-05-31 23:05:40] [INFO ] Deduced a trap composed of 115 places in 440 ms of which 5 ms to minimize.
[2024-05-31 23:05:40] [INFO ] Deduced a trap composed of 116 places in 446 ms of which 5 ms to minimize.
[2024-05-31 23:05:41] [INFO ] Deduced a trap composed of 116 places in 437 ms of which 5 ms to minimize.
[2024-05-31 23:05:41] [INFO ] Deduced a trap composed of 127 places in 445 ms of which 5 ms to minimize.
[2024-05-31 23:05:42] [INFO ] Deduced a trap composed of 134 places in 435 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/946 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 23:05:42] [INFO ] Deduced a trap composed of 138 places in 420 ms of which 5 ms to minimize.
[2024-05-31 23:05:43] [INFO ] Deduced a trap composed of 120 places in 433 ms of which 5 ms to minimize.
[2024-05-31 23:05:43] [INFO ] Deduced a trap composed of 132 places in 448 ms of which 6 ms to minimize.
[2024-05-31 23:05:44] [INFO ] Deduced a trap composed of 122 places in 438 ms of which 6 ms to minimize.
[2024-05-31 23:05:44] [INFO ] Deduced a trap composed of 134 places in 417 ms of which 6 ms to minimize.
[2024-05-31 23:05:45] [INFO ] Deduced a trap composed of 132 places in 423 ms of which 6 ms to minimize.
[2024-05-31 23:05:45] [INFO ] Deduced a trap composed of 135 places in 417 ms of which 5 ms to minimize.
[2024-05-31 23:05:45] [INFO ] Deduced a trap composed of 133 places in 426 ms of which 5 ms to minimize.
[2024-05-31 23:05:46] [INFO ] Deduced a trap composed of 138 places in 435 ms of which 5 ms to minimize.
[2024-05-31 23:05:46] [INFO ] Deduced a trap composed of 133 places in 430 ms of which 6 ms to minimize.
[2024-05-31 23:05:47] [INFO ] Deduced a trap composed of 130 places in 439 ms of which 5 ms to minimize.
[2024-05-31 23:05:47] [INFO ] Deduced a trap composed of 151 places in 454 ms of which 6 ms to minimize.
[2024-05-31 23:05:48] [INFO ] Deduced a trap composed of 136 places in 438 ms of which 5 ms to minimize.
[2024-05-31 23:05:48] [INFO ] Deduced a trap composed of 152 places in 435 ms of which 5 ms to minimize.
[2024-05-31 23:05:49] [INFO ] Deduced a trap composed of 137 places in 426 ms of which 5 ms to minimize.
[2024-05-31 23:05:49] [INFO ] Deduced a trap composed of 136 places in 424 ms of which 5 ms to minimize.
[2024-05-31 23:05:49] [INFO ] Deduced a trap composed of 134 places in 424 ms of which 6 ms to minimize.
[2024-05-31 23:05:50] [INFO ] Deduced a trap composed of 138 places in 444 ms of which 6 ms to minimize.
[2024-05-31 23:05:50] [INFO ] Deduced a trap composed of 139 places in 432 ms of which 6 ms to minimize.
[2024-05-31 23:05:51] [INFO ] Deduced a trap composed of 144 places in 447 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/946 variables, 20/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 23:05:51] [INFO ] Deduced a trap composed of 119 places in 433 ms of which 6 ms to minimize.
[2024-05-31 23:05:52] [INFO ] Deduced a trap composed of 147 places in 447 ms of which 5 ms to minimize.
[2024-05-31 23:05:52] [INFO ] Deduced a trap composed of 142 places in 433 ms of which 5 ms to minimize.
[2024-05-31 23:05:53] [INFO ] Deduced a trap composed of 143 places in 426 ms of which 5 ms to minimize.
[2024-05-31 23:05:53] [INFO ] Deduced a trap composed of 121 places in 436 ms of which 6 ms to minimize.
[2024-05-31 23:05:54] [INFO ] Deduced a trap composed of 143 places in 418 ms of which 5 ms to minimize.
[2024-05-31 23:05:54] [INFO ] Deduced a trap composed of 142 places in 422 ms of which 5 ms to minimize.
[2024-05-31 23:05:54] [INFO ] Deduced a trap composed of 117 places in 439 ms of which 5 ms to minimize.
[2024-05-31 23:05:55] [INFO ] Deduced a trap composed of 130 places in 455 ms of which 6 ms to minimize.
[2024-05-31 23:05:55] [INFO ] Deduced a trap composed of 134 places in 457 ms of which 6 ms to minimize.
[2024-05-31 23:05:56] [INFO ] Deduced a trap composed of 105 places in 465 ms of which 6 ms to minimize.
[2024-05-31 23:05:56] [INFO ] Deduced a trap composed of 126 places in 445 ms of which 5 ms to minimize.
[2024-05-31 23:05:57] [INFO ] Deduced a trap composed of 118 places in 436 ms of which 5 ms to minimize.
[2024-05-31 23:05:58] [INFO ] Deduced a trap composed of 123 places in 452 ms of which 5 ms to minimize.
[2024-05-31 23:05:58] [INFO ] Deduced a trap composed of 103 places in 472 ms of which 6 ms to minimize.
[2024-05-31 23:05:58] [INFO ] Deduced a trap composed of 130 places in 450 ms of which 6 ms to minimize.
[2024-05-31 23:05:59] [INFO ] Deduced a trap composed of 142 places in 450 ms of which 6 ms to minimize.
[2024-05-31 23:05:59] [INFO ] Deduced a trap composed of 107 places in 468 ms of which 6 ms to minimize.
[2024-05-31 23:06:00] [INFO ] Deduced a trap composed of 137 places in 434 ms of which 6 ms to minimize.
[2024-05-31 23:06:00] [INFO ] Deduced a trap composed of 83 places in 565 ms of which 6 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/946 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 23:06:01] [INFO ] Deduced a trap composed of 132 places in 471 ms of which 5 ms to minimize.
[2024-05-31 23:06:01] [INFO ] Deduced a trap composed of 124 places in 445 ms of which 6 ms to minimize.
[2024-05-31 23:06:02] [INFO ] Deduced a trap composed of 116 places in 455 ms of which 6 ms to minimize.
[2024-05-31 23:06:02] [INFO ] Deduced a trap composed of 130 places in 454 ms of which 5 ms to minimize.
[2024-05-31 23:06:03] [INFO ] Deduced a trap composed of 130 places in 451 ms of which 5 ms to minimize.
[2024-05-31 23:06:03] [INFO ] Deduced a trap composed of 122 places in 457 ms of which 5 ms to minimize.
[2024-05-31 23:06:04] [INFO ] Deduced a trap composed of 118 places in 452 ms of which 6 ms to minimize.
[2024-05-31 23:06:04] [INFO ] Deduced a trap composed of 140 places in 449 ms of which 6 ms to minimize.
[2024-05-31 23:06:05] [INFO ] Deduced a trap composed of 136 places in 439 ms of which 6 ms to minimize.
[2024-05-31 23:06:05] [INFO ] Deduced a trap composed of 137 places in 438 ms of which 6 ms to minimize.
[2024-05-31 23:06:06] [INFO ] Deduced a trap composed of 136 places in 460 ms of which 6 ms to minimize.
[2024-05-31 23:06:06] [INFO ] Deduced a trap composed of 131 places in 433 ms of which 6 ms to minimize.
[2024-05-31 23:06:07] [INFO ] Deduced a trap composed of 142 places in 451 ms of which 5 ms to minimize.
[2024-05-31 23:06:07] [INFO ] Deduced a trap composed of 118 places in 474 ms of which 5 ms to minimize.
[2024-05-31 23:06:08] [INFO ] Deduced a trap composed of 122 places in 441 ms of which 6 ms to minimize.
[2024-05-31 23:06:08] [INFO ] Deduced a trap composed of 109 places in 473 ms of which 6 ms to minimize.
[2024-05-31 23:06:08] [INFO ] Deduced a trap composed of 123 places in 434 ms of which 6 ms to minimize.
[2024-05-31 23:06:09] [INFO ] Deduced a trap composed of 115 places in 452 ms of which 6 ms to minimize.
[2024-05-31 23:06:09] [INFO ] Deduced a trap composed of 105 places in 435 ms of which 6 ms to minimize.
[2024-05-31 23:06:10] [INFO ] Deduced a trap composed of 111 places in 481 ms of which 7 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/946 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 23:06:10] [INFO ] Deduced a trap composed of 104 places in 438 ms of which 5 ms to minimize.
[2024-05-31 23:06:11] [INFO ] Deduced a trap composed of 104 places in 456 ms of which 5 ms to minimize.
[2024-05-31 23:06:11] [INFO ] Deduced a trap composed of 136 places in 444 ms of which 6 ms to minimize.
[2024-05-31 23:06:12] [INFO ] Deduced a trap composed of 117 places in 445 ms of which 6 ms to minimize.
[2024-05-31 23:06:12] [INFO ] Deduced a trap composed of 134 places in 455 ms of which 6 ms to minimize.
[2024-05-31 23:06:13] [INFO ] Deduced a trap composed of 139 places in 442 ms of which 5 ms to minimize.
[2024-05-31 23:06:13] [INFO ] Deduced a trap composed of 117 places in 462 ms of which 6 ms to minimize.
[2024-05-31 23:06:14] [INFO ] Deduced a trap composed of 152 places in 432 ms of which 6 ms to minimize.
[2024-05-31 23:06:14] [INFO ] Deduced a trap composed of 153 places in 437 ms of which 5 ms to minimize.
[2024-05-31 23:06:15] [INFO ] Deduced a trap composed of 135 places in 449 ms of which 5 ms to minimize.
[2024-05-31 23:06:15] [INFO ] Deduced a trap composed of 130 places in 453 ms of which 5 ms to minimize.
[2024-05-31 23:06:16] [INFO ] Deduced a trap composed of 132 places in 463 ms of which 5 ms to minimize.
[2024-05-31 23:06:16] [INFO ] Deduced a trap composed of 115 places in 457 ms of which 6 ms to minimize.
[2024-05-31 23:06:17] [INFO ] Deduced a trap composed of 132 places in 443 ms of which 6 ms to minimize.
[2024-05-31 23:06:17] [INFO ] Deduced a trap composed of 126 places in 430 ms of which 6 ms to minimize.
[2024-05-31 23:06:17] [INFO ] Deduced a trap composed of 131 places in 425 ms of which 6 ms to minimize.
[2024-05-31 23:06:18] [INFO ] Deduced a trap composed of 118 places in 433 ms of which 6 ms to minimize.
[2024-05-31 23:06:18] [INFO ] Deduced a trap composed of 133 places in 438 ms of which 6 ms to minimize.
[2024-05-31 23:06:19] [INFO ] Deduced a trap composed of 138 places in 427 ms of which 6 ms to minimize.
[2024-05-31 23:06:19] [INFO ] Deduced a trap composed of 116 places in 469 ms of which 6 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/946 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 23:06:20] [INFO ] Deduced a trap composed of 122 places in 412 ms of which 5 ms to minimize.
[2024-05-31 23:06:20] [INFO ] Deduced a trap composed of 124 places in 426 ms of which 5 ms to minimize.
[2024-05-31 23:06:21] [INFO ] Deduced a trap composed of 129 places in 469 ms of which 6 ms to minimize.
[2024-05-31 23:06:21] [INFO ] Deduced a trap composed of 147 places in 436 ms of which 5 ms to minimize.
[2024-05-31 23:06:22] [INFO ] Deduced a trap composed of 109 places in 463 ms of which 5 ms to minimize.
[2024-05-31 23:06:22] [INFO ] Deduced a trap composed of 138 places in 421 ms of which 5 ms to minimize.
[2024-05-31 23:06:23] [INFO ] Deduced a trap composed of 119 places in 442 ms of which 6 ms to minimize.
[2024-05-31 23:06:23] [INFO ] Deduced a trap composed of 119 places in 453 ms of which 6 ms to minimize.
[2024-05-31 23:06:24] [INFO ] Deduced a trap composed of 144 places in 466 ms of which 6 ms to minimize.
[2024-05-31 23:06:24] [INFO ] Deduced a trap composed of 125 places in 425 ms of which 6 ms to minimize.
[2024-05-31 23:06:24] [INFO ] Deduced a trap composed of 124 places in 431 ms of which 6 ms to minimize.
[2024-05-31 23:06:25] [INFO ] Deduced a trap composed of 147 places in 431 ms of which 5 ms to minimize.
[2024-05-31 23:06:25] [INFO ] Deduced a trap composed of 136 places in 458 ms of which 5 ms to minimize.
[2024-05-31 23:06:26] [INFO ] Deduced a trap composed of 137 places in 439 ms of which 6 ms to minimize.
[2024-05-31 23:06:26] [INFO ] Deduced a trap composed of 134 places in 433 ms of which 6 ms to minimize.
[2024-05-31 23:06:27] [INFO ] Deduced a trap composed of 142 places in 446 ms of which 6 ms to minimize.
[2024-05-31 23:06:27] [INFO ] Deduced a trap composed of 150 places in 451 ms of which 5 ms to minimize.
[2024-05-31 23:06:28] [INFO ] Deduced a trap composed of 131 places in 431 ms of which 5 ms to minimize.
[2024-05-31 23:06:28] [INFO ] Deduced a trap composed of 153 places in 459 ms of which 6 ms to minimize.
[2024-05-31 23:06:29] [INFO ] Deduced a trap composed of 144 places in 458 ms of which 5 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/946 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 23:06:29] [INFO ] Deduced a trap composed of 136 places in 454 ms of which 5 ms to minimize.
[2024-05-31 23:06:30] [INFO ] Deduced a trap composed of 115 places in 458 ms of which 5 ms to minimize.
[2024-05-31 23:06:30] [INFO ] Deduced a trap composed of 118 places in 436 ms of which 6 ms to minimize.
[2024-05-31 23:06:31] [INFO ] Deduced a trap composed of 132 places in 465 ms of which 6 ms to minimize.
[2024-05-31 23:06:31] [INFO ] Deduced a trap composed of 119 places in 431 ms of which 6 ms to minimize.
[2024-05-31 23:06:31] [INFO ] Deduced a trap composed of 139 places in 475 ms of which 6 ms to minimize.
[2024-05-31 23:06:32] [INFO ] Deduced a trap composed of 123 places in 431 ms of which 6 ms to minimize.
[2024-05-31 23:06:32] [INFO ] Deduced a trap composed of 123 places in 439 ms of which 6 ms to minimize.
[2024-05-31 23:06:33] [INFO ] Deduced a trap composed of 153 places in 457 ms of which 6 ms to minimize.
[2024-05-31 23:06:33] [INFO ] Deduced a trap composed of 140 places in 465 ms of which 6 ms to minimize.
[2024-05-31 23:06:34] [INFO ] Deduced a trap composed of 139 places in 447 ms of which 6 ms to minimize.
[2024-05-31 23:06:34] [INFO ] Deduced a trap composed of 129 places in 461 ms of which 6 ms to minimize.
[2024-05-31 23:06:35] [INFO ] Deduced a trap composed of 135 places in 466 ms of which 6 ms to minimize.
[2024-05-31 23:06:35] [INFO ] Deduced a trap composed of 149 places in 444 ms of which 5 ms to minimize.
[2024-05-31 23:06:36] [INFO ] Deduced a trap composed of 133 places in 462 ms of which 5 ms to minimize.
[2024-05-31 23:06:36] [INFO ] Deduced a trap composed of 134 places in 449 ms of which 5 ms to minimize.
[2024-05-31 23:06:37] [INFO ] Deduced a trap composed of 127 places in 456 ms of which 5 ms to minimize.
[2024-05-31 23:06:37] [INFO ] Deduced a trap composed of 130 places in 443 ms of which 6 ms to minimize.
[2024-05-31 23:06:38] [INFO ] Deduced a trap composed of 126 places in 443 ms of which 6 ms to minimize.
[2024-05-31 23:06:38] [INFO ] Deduced a trap composed of 129 places in 442 ms of which 6 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/946 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 23:06:39] [INFO ] Deduced a trap composed of 135 places in 447 ms of which 5 ms to minimize.
[2024-05-31 23:06:39] [INFO ] Deduced a trap composed of 123 places in 430 ms of which 6 ms to minimize.
[2024-05-31 23:06:39] [INFO ] Deduced a trap composed of 148 places in 441 ms of which 6 ms to minimize.
[2024-05-31 23:06:40] [INFO ] Deduced a trap composed of 121 places in 421 ms of which 5 ms to minimize.
[2024-05-31 23:06:40] [INFO ] Deduced a trap composed of 125 places in 421 ms of which 5 ms to minimize.
[2024-05-31 23:06:41] [INFO ] Deduced a trap composed of 121 places in 415 ms of which 6 ms to minimize.
[2024-05-31 23:06:41] [INFO ] Deduced a trap composed of 147 places in 417 ms of which 5 ms to minimize.
[2024-05-31 23:06:42] [INFO ] Deduced a trap composed of 133 places in 432 ms of which 5 ms to minimize.
[2024-05-31 23:06:42] [INFO ] Deduced a trap composed of 131 places in 437 ms of which 6 ms to minimize.
[2024-05-31 23:06:43] [INFO ] Deduced a trap composed of 119 places in 436 ms of which 6 ms to minimize.
[2024-05-31 23:06:43] [INFO ] Deduced a trap composed of 120 places in 434 ms of which 6 ms to minimize.
[2024-05-31 23:06:43] [INFO ] Deduced a trap composed of 129 places in 439 ms of which 6 ms to minimize.
[2024-05-31 23:06:44] [INFO ] Deduced a trap composed of 119 places in 438 ms of which 5 ms to minimize.
[2024-05-31 23:06:44] [INFO ] Deduced a trap composed of 121 places in 439 ms of which 5 ms to minimize.
[2024-05-31 23:06:45] [INFO ] Deduced a trap composed of 141 places in 434 ms of which 5 ms to minimize.
[2024-05-31 23:06:45] [INFO ] Deduced a trap composed of 79 places in 555 ms of which 5 ms to minimize.
[2024-05-31 23:06:46] [INFO ] Deduced a trap composed of 136 places in 445 ms of which 5 ms to minimize.
[2024-05-31 23:06:46] [INFO ] Deduced a trap composed of 67 places in 531 ms of which 6 ms to minimize.
[2024-05-31 23:06:47] [INFO ] Deduced a trap composed of 87 places in 538 ms of which 5 ms to minimize.
[2024-05-31 23:06:48] [INFO ] Deduced a trap composed of 123 places in 517 ms of which 6 ms to minimize.
SMT process timed out in 82778ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 988 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 988/988 places, 4011/4011 transitions.
Applied a total of 0 rules in 114 ms. Remains 988 /988 variables (removed 0) and now considering 4011/4011 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 115 ms. Remains : 988/988 places, 4011/4011 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 988/988 places, 4011/4011 transitions.
Applied a total of 0 rules in 101 ms. Remains 988 /988 variables (removed 0) and now considering 4011/4011 (removed 0) transitions.
[2024-05-31 23:06:48] [INFO ] Flow matrix only has 3613 transitions (discarded 398 similar events)
[2024-05-31 23:06:48] [INFO ] Invariant cache hit.
[2024-05-31 23:06:49] [INFO ] Implicit Places using invariants in 1183 ms returned []
[2024-05-31 23:06:49] [INFO ] Flow matrix only has 3613 transitions (discarded 398 similar events)
[2024-05-31 23:06:49] [INFO ] Invariant cache hit.
[2024-05-31 23:06:50] [INFO ] State equation strengthened by 2450 read => feed constraints.
[2024-05-31 23:07:20] [INFO ] Performed 727/988 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-31 23:07:30] [INFO ] Implicit Places using invariants and state equation in 41064 ms returned []
Implicit Place search using SMT with State Equation took 42250 ms to find 0 implicit places.
[2024-05-31 23:07:30] [INFO ] Redundant transitions in 270 ms returned []
Running 3949 sub problems to find dead transitions.
[2024-05-31 23:07:30] [INFO ] Flow matrix only has 3613 transitions (discarded 398 similar events)
[2024-05-31 23:07:30] [INFO ] Invariant cache hit.
[2024-05-31 23:07:30] [INFO ] State equation strengthened by 2450 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/985 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 3949 unsolved
SMT process timed out in 55167ms, After SMT, problems are : Problem set: 0 solved, 3949 unsolved
Search for dead transitions found 0 dead transitions in 55205ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 97855 ms. Remains : 988/988 places, 4011/4011 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1054 edges and 988 vertex of which 17 / 988 are part of one of the 1 SCC in 3 ms
Free SCC test removed 16 places
Drop transitions (Empty/Sink Transition effects.) removed 300 transitions
Ensure Unique test removed 370 transitions
Reduce isomorphic transitions removed 670 transitions.
Graph (complete) has 4611 edges and 972 vertex of which 958 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.1 ms
Discarding 14 places :
Also discarding 0 output transitions
Ensure Unique test removed 16 places
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition Node6DetectsThatNode9CanReplaceNode8.Node9IsBecomingTheNewNodeMaster and 1 places that fell out of Prefix Of Interest.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 97 transitions
Trivial Post-agglo rules discarded 97 transitions
Performed 97 trivial Post agglomeration. Transition count delta: 97
Iterating post reduction 0 with 99 rules applied. Total rules applied 101 place count 941 transition count 3242
Reduce places removed 97 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 97 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 1 with 290 rules applied. Total rules applied 391 place count 844 transition count 3049
Reduce places removed 96 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 24 transitions
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 96 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 2 with 264 rules applied. Total rules applied 655 place count 748 transition count 2881
Reduce places removed 72 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 72 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 3 with 214 rules applied. Total rules applied 869 place count 676 transition count 2739
Reduce places removed 70 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 20 transitions
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 70 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 4 with 190 rules applied. Total rules applied 1059 place count 606 transition count 2619
Reduce places removed 50 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 50 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 5 with 148 rules applied. Total rules applied 1207 place count 556 transition count 2521
Reduce places removed 48 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 16 transitions
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 48 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 6 with 128 rules applied. Total rules applied 1335 place count 508 transition count 2441
Reduce places removed 32 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 32 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 7 with 94 rules applied. Total rules applied 1429 place count 476 transition count 2379
Reduce places removed 30 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 30 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 8 with 78 rules applied. Total rules applied 1507 place count 446 transition count 2331
Reduce places removed 18 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 9 with 52 rules applied. Total rules applied 1559 place count 428 transition count 2297
Reduce places removed 16 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 10 with 40 rules applied. Total rules applied 1599 place count 412 transition count 2273
Reduce places removed 8 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 11 with 22 rules applied. Total rules applied 1621 place count 404 transition count 2259
Reduce places removed 6 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 12 with 14 rules applied. Total rules applied 1635 place count 398 transition count 2251
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 13 with 5 rules applied. Total rules applied 1640 place count 395 transition count 2249
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 17 Pre rules applied. Total rules applied 1640 place count 395 transition count 2232
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 14 with 34 rules applied. Total rules applied 1674 place count 378 transition count 2232
Discarding 280 places :
Symmetric choice reduction at 14 with 280 rule applications. Total rules 1954 place count 98 transition count 368
Iterating global reduction 14 with 280 rules applied. Total rules applied 2234 place count 98 transition count 368
Ensure Unique test removed 230 transitions
Reduce isomorphic transitions removed 230 transitions.
Iterating post reduction 14 with 230 rules applied. Total rules applied 2464 place count 98 transition count 138
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 15 with 1 Pre rules applied. Total rules applied 2464 place count 98 transition count 137
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 15 with 2 rules applied. Total rules applied 2466 place count 97 transition count 137
Discarding 10 places :
Symmetric choice reduction at 15 with 10 rule applications. Total rules 2476 place count 87 transition count 112
Iterating global reduction 15 with 10 rules applied. Total rules applied 2486 place count 87 transition count 112
Discarding 10 places :
Symmetric choice reduction at 15 with 10 rule applications. Total rules 2496 place count 77 transition count 102
Iterating global reduction 15 with 10 rules applied. Total rules applied 2506 place count 77 transition count 102
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 15 with 8 rules applied. Total rules applied 2514 place count 73 transition count 98
Discarding 2 places :
Symmetric choice reduction at 15 with 2 rule applications. Total rules 2516 place count 71 transition count 93
Iterating global reduction 15 with 2 rules applied. Total rules applied 2518 place count 71 transition count 93
Free-agglomeration rule (complex) applied 14 times.
Iterating global reduction 15 with 14 rules applied. Total rules applied 2532 place count 71 transition count 79
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 15 with 14 rules applied. Total rules applied 2546 place count 57 transition count 79
Applied a total of 2546 rules in 342 ms. Remains 57 /988 variables (removed 931) and now considering 79/4011 (removed 3932) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 79 rows 57 cols
[2024-05-31 23:08:26] [INFO ] Computed 20 invariants in 2 ms
[2024-05-31 23:08:26] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-05-31 23:08:26] [INFO ] [Real]Absence check using 7 positive and 13 generalized place invariants in 2 ms returned sat
[2024-05-31 23:08:26] [INFO ] After 171ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-31 23:08:26] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-31 23:08:26] [INFO ] [Nat]Absence check using 7 positive and 13 generalized place invariants in 2 ms returned sat
[2024-05-31 23:08:26] [INFO ] After 35ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-31 23:08:26] [INFO ] After 52ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-31 23:08:26] [INFO ] After 88ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 618 ms.
[2024-05-31 23:08:26] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 2 ms.
[2024-05-31 23:08:26] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 988 places, 4011 transitions and 20009 arcs took 22 ms.
[2024-05-31 23:08:27] [INFO ] Flatten gal took : 327 ms
Total runtime 295107 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 : MultiCrashLeafsetExtension-PT-S16C07-ReachabilityCardinality-2024-14
Could not compute solution for formula : MultiCrashLeafsetExtension-PT-S16C07-ReachabilityCardinality-2024-15

BK_STOP 1717196907471

--------------------
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 ReachabilityCardinality -timeout 360 -rebuildPNML
mcc2024
rfs formula name MultiCrashLeafsetExtension-PT-S16C07-ReachabilityCardinality-2024-14
rfs formula type EF
rfs formula formula --invariant=/tmp/1232/inv_0_
rfs formula name MultiCrashLeafsetExtension-PT-S16C07-ReachabilityCardinality-2024-15
rfs formula type AG
rfs formula formula --invariant=/tmp/1232/inv_1_
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="MultiCrashLeafsetExtension-PT-S16C07"
export BK_EXAMINATION="ReachabilityCardinality"
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 MultiCrashLeafsetExtension-PT-S16C07, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r508-tall-171654350800046"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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