MCC'2024- Execution of r476-tall-171620505000047

About the Execution of LTSMin+red for CANConstruction-PT-050

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
2423.287	403607.00	465423.00	1021.80	TT?TTT?TTTFFTT?T	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.r476-tall-171620505000047.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 CANConstruction-PT-050, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r476-tall-171620505000047
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.2M
-rw-r--r-- 1 mcc users 8.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.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.7K May 19 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 19 15:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 12 19:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K Apr 12 19:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 19:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K Apr 12 19:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 3.8M May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717179406281

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANConstruction-PT-050
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 18:16:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-31 18:16:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 18:16:47] [INFO ] Load time of PNML (sax parser for PT used): 305 ms
[2024-05-31 18:16:47] [INFO ] Transformed 5602 places.
[2024-05-31 18:16:47] [INFO ] Transformed 10400 transitions.
[2024-05-31 18:16:47] [INFO ] Parsed PT model containing 5602 places and 10400 transitions and 31000 arcs in 444 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 32 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (43 resets) in 2144 ms. (18 steps per ms) remains 4/16 properties
FORMULA CANConstruction-PT-050-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-050-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-050-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-050-ReachabilityFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-050-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-050-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-050-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-050-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-050-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-050-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-050-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-050-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 423 ms. (94 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 599 ms. (66 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 112 ms. (354 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1043 ms. (38 steps per ms) remains 4/4 properties
// Phase 1: matrix 10400 rows 5602 cols
[2024-05-31 18:16:49] [INFO ] Computed 101 invariants in 130 ms
[2024-05-31 18:16:49] [INFO ] State equation strengthened by 4950 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 5471/5542 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5542 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5542 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 10/5552 variables, 10/52 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/5552 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 49/5601 variables, 49/101 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/5601 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 10400/16001 variables, 5601/5702 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/16001 variables, 4950/10652 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 16001/16002 variables, and 10652 constraints, problems are : Problem set: 0 solved, 4 unsolved in 5047 ms.
Refiners :[Positive P Invariants (semi-flows): 51/51 constraints, Generalized P Invariants (flows): 50/50 constraints, State Equation: 5601/5602 constraints, ReadFeed: 4950/4950 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 5471/5542 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5542 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-31 18:17:00] [INFO ] Deduced a trap composed of 5 places in 5364 ms of which 214 ms to minimize.
SMT process timed out in 11549ms, After SMT, problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 71 out of 5602 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5602/5602 places, 10400/10400 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 315 transitions
Trivial Post-agglo rules discarded 315 transitions
Performed 315 trivial Post agglomeration. Transition count delta: 315
Iterating post reduction 0 with 315 rules applied. Total rules applied 315 place count 5602 transition count 10085
Reduce places removed 315 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 316 rules applied. Total rules applied 631 place count 5287 transition count 10084
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 632 place count 5286 transition count 10084
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 632 place count 5286 transition count 10073
Deduced a syphon composed of 11 places in 4 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 654 place count 5275 transition count 10073
Discarding 2378 places :
Symmetric choice reduction at 3 with 2378 rule applications. Total rules 3032 place count 2897 transition count 5317
Iterating global reduction 3 with 2378 rules applied. Total rules applied 5410 place count 2897 transition count 5317
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 3 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 3 with 78 rules applied. Total rules applied 5488 place count 2858 transition count 5278
Free-agglomeration rule applied 61 times.
Iterating global reduction 3 with 61 rules applied. Total rules applied 5549 place count 2858 transition count 5217
Reduce places removed 61 places and 0 transitions.
Iterating post reduction 3 with 61 rules applied. Total rules applied 5610 place count 2797 transition count 5217
Free-agglomeration rule (complex) applied 23 times.
Iterating global reduction 4 with 23 rules applied. Total rules applied 5633 place count 2797 transition count 5194
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 4 with 23 rules applied. Total rules applied 5656 place count 2774 transition count 5194
Partial Free-agglomeration rule applied 48 times.
Drop transitions (Partial Free agglomeration) removed 48 transitions
Iterating global reduction 5 with 48 rules applied. Total rules applied 5704 place count 2774 transition count 5194
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 5708 place count 2774 transition count 5194
Applied a total of 5708 rules in 2815 ms. Remains 2774 /5602 variables (removed 2828) and now considering 5194/10400 (removed 5206) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2827 ms. Remains : 2774/5602 places, 5194/10400 transitions.
RANDOM walk for 40000 steps (110 resets) in 1051 ms. (38 steps per ms) remains 3/4 properties
FORMULA CANConstruction-PT-050-ReachabilityFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 128 ms. (310 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 189 ms. (210 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 158 ms. (251 steps per ms) remains 3/3 properties
// Phase 1: matrix 5194 rows 2774 cols
[2024-05-31 18:17:04] [INFO ] Computed 101 invariants in 43 ms
[2024-05-31 18:17:04] [INFO ] State equation strengthened by 5018 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 2643/2714 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2714 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2714 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 10/2724 variables, 10/52 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2724 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 49/2773 variables, 49/101 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2773 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 5194/7967 variables, 2773/2874 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/7967 variables, 5018/7892 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/7967 variables, 0/7892 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 1/7968 variables, 1/7893 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/7968 variables, 0/7893 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/7968 variables, 0/7893 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7968/7968 variables, and 7893 constraints, problems are : Problem set: 0 solved, 3 unsolved in 3859 ms.
Refiners :[Positive P Invariants (semi-flows): 51/51 constraints, Generalized P Invariants (flows): 50/50 constraints, State Equation: 2774/2774 constraints, ReadFeed: 5018/5018 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 2643/2714 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2714 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 18:17:10] [INFO ] Deduced a trap composed of 2 places in 1959 ms of which 17 ms to minimize.
[2024-05-31 18:17:12] [INFO ] Deduced a trap composed of 2 places in 2033 ms of which 15 ms to minimize.
[2024-05-31 18:17:14] [INFO ] Deduced a trap composed of 2 places in 1965 ms of which 15 ms to minimize.
[2024-05-31 18:17:16] [INFO ] Deduced a trap composed of 2 places in 1986 ms of which 19 ms to minimize.
[2024-05-31 18:17:18] [INFO ] Deduced a trap composed of 2 places in 1991 ms of which 15 ms to minimize.
[2024-05-31 18:17:20] [INFO ] Deduced a trap composed of 2 places in 2058 ms of which 16 ms to minimize.
[2024-05-31 18:17:22] [INFO ] Deduced a trap composed of 2 places in 2135 ms of which 16 ms to minimize.
[2024-05-31 18:17:24] [INFO ] Deduced a trap composed of 2 places in 1987 ms of which 16 ms to minimize.
[2024-05-31 18:17:27] [INFO ] Deduced a trap composed of 2 places in 2268 ms of which 15 ms to minimize.
[2024-05-31 18:17:29] [INFO ] Deduced a trap composed of 2 places in 2249 ms of which 15 ms to minimize.
[2024-05-31 18:17:30] [INFO ] Deduced a trap composed of 53 places in 673 ms of which 9 ms to minimize.
[2024-05-31 18:17:31] [INFO ] Deduced a trap composed of 53 places in 681 ms of which 10 ms to minimize.
[2024-05-31 18:17:31] [INFO ] Deduced a trap composed of 54 places in 647 ms of which 9 ms to minimize.
[2024-05-31 18:17:32] [INFO ] Deduced a trap composed of 53 places in 645 ms of which 11 ms to minimize.
[2024-05-31 18:17:33] [INFO ] Deduced a trap composed of 56 places in 610 ms of which 9 ms to minimize.
[2024-05-31 18:17:33] [INFO ] Deduced a trap composed of 57 places in 635 ms of which 9 ms to minimize.
[2024-05-31 18:17:34] [INFO ] Deduced a trap composed of 57 places in 632 ms of which 9 ms to minimize.
[2024-05-31 18:17:35] [INFO ] Deduced a trap composed of 53 places in 596 ms of which 9 ms to minimize.
[2024-05-31 18:17:35] [INFO ] Deduced a trap composed of 56 places in 571 ms of which 9 ms to minimize.
[2024-05-31 18:17:36] [INFO ] Deduced a trap composed of 56 places in 544 ms of which 9 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/2714 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 18:17:36] [INFO ] Deduced a trap composed of 53 places in 546 ms of which 9 ms to minimize.
[2024-05-31 18:17:37] [INFO ] Deduced a trap composed of 56 places in 428 ms of which 7 ms to minimize.
[2024-05-31 18:17:37] [INFO ] Deduced a trap composed of 56 places in 433 ms of which 7 ms to minimize.
[2024-05-31 18:17:38] [INFO ] Deduced a trap composed of 56 places in 437 ms of which 8 ms to minimize.
[2024-05-31 18:17:38] [INFO ] Deduced a trap composed of 53 places in 554 ms of which 9 ms to minimize.
[2024-05-31 18:17:39] [INFO ] Deduced a trap composed of 53 places in 519 ms of which 8 ms to minimize.
[2024-05-31 18:17:39] [INFO ] Deduced a trap composed of 53 places in 506 ms of which 8 ms to minimize.
[2024-05-31 18:17:40] [INFO ] Deduced a trap composed of 53 places in 473 ms of which 8 ms to minimize.
[2024-05-31 18:17:41] [INFO ] Deduced a trap composed of 53 places in 536 ms of which 8 ms to minimize.
[2024-05-31 18:17:41] [INFO ] Deduced a trap composed of 56 places in 537 ms of which 8 ms to minimize.
[2024-05-31 18:17:42] [INFO ] Deduced a trap composed of 53 places in 489 ms of which 8 ms to minimize.
[2024-05-31 18:17:42] [INFO ] Deduced a trap composed of 55 places in 538 ms of which 8 ms to minimize.
[2024-05-31 18:17:43] [INFO ] Deduced a trap composed of 56 places in 520 ms of which 8 ms to minimize.
[2024-05-31 18:17:43] [INFO ] Deduced a trap composed of 53 places in 442 ms of which 7 ms to minimize.
[2024-05-31 18:17:44] [INFO ] Deduced a trap composed of 53 places in 426 ms of which 7 ms to minimize.
[2024-05-31 18:17:44] [INFO ] Deduced a trap composed of 56 places in 405 ms of which 7 ms to minimize.
[2024-05-31 18:17:45] [INFO ] Deduced a trap composed of 56 places in 370 ms of which 7 ms to minimize.
[2024-05-31 18:17:45] [INFO ] Deduced a trap composed of 61 places in 441 ms of which 7 ms to minimize.
[2024-05-31 18:17:46] [INFO ] Deduced a trap composed of 53 places in 383 ms of which 7 ms to minimize.
[2024-05-31 18:17:46] [INFO ] Deduced a trap composed of 57 places in 359 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/2714 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 18:17:46] [INFO ] Deduced a trap composed of 56 places in 376 ms of which 7 ms to minimize.
[2024-05-31 18:17:47] [INFO ] Deduced a trap composed of 57 places in 527 ms of which 8 ms to minimize.
[2024-05-31 18:17:48] [INFO ] Deduced a trap composed of 57 places in 520 ms of which 8 ms to minimize.
[2024-05-31 18:17:48] [INFO ] Deduced a trap composed of 53 places in 494 ms of which 9 ms to minimize.
[2024-05-31 18:17:49] [INFO ] Deduced a trap composed of 53 places in 491 ms of which 8 ms to minimize.
[2024-05-31 18:17:49] [INFO ] Deduced a trap composed of 53 places in 493 ms of which 8 ms to minimize.
[2024-05-31 18:17:50] [INFO ] Deduced a trap composed of 59 places in 510 ms of which 8 ms to minimize.
[2024-05-31 18:17:50] [INFO ] Deduced a trap composed of 53 places in 486 ms of which 8 ms to minimize.
[2024-05-31 18:17:51] [INFO ] Deduced a trap composed of 53 places in 488 ms of which 8 ms to minimize.
[2024-05-31 18:17:51] [INFO ] Deduced a trap composed of 53 places in 480 ms of which 8 ms to minimize.
[2024-05-31 18:17:52] [INFO ] Deduced a trap composed of 53 places in 495 ms of which 8 ms to minimize.
[2024-05-31 18:17:52] [INFO ] Deduced a trap composed of 53 places in 496 ms of which 9 ms to minimize.
[2024-05-31 18:17:53] [INFO ] Deduced a trap composed of 53 places in 478 ms of which 8 ms to minimize.
SMT process timed out in 49123ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 71 out of 2774 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2774/2774 places, 5194/5194 transitions.
Applied a total of 0 rules in 227 ms. Remains 2774 /2774 variables (removed 0) and now considering 5194/5194 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 227 ms. Remains : 2774/2774 places, 5194/5194 transitions.
RANDOM walk for 40000 steps (110 resets) in 818 ms. (48 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 126 ms. (314 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 160 ms. (248 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 100 ms. (396 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 79193 steps, run timeout after 3001 ms. (steps per millisecond=26 ) properties seen :0 out of 3
Probabilistic random walk after 79193 steps, saw 45217 distinct states, run finished after 3006 ms. (steps per millisecond=26 ) properties seen :0
[2024-05-31 18:17:57] [INFO ] Invariant cache hit.
[2024-05-31 18:17:57] [INFO ] State equation strengthened by 5018 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 2643/2714 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2714 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2714 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 10/2724 variables, 10/52 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2724 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 49/2773 variables, 49/101 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2773 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 5194/7967 variables, 2773/2874 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/7967 variables, 5018/7892 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/7967 variables, 0/7892 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 1/7968 variables, 1/7893 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/7968 variables, 0/7893 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/7968 variables, 0/7893 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7968/7968 variables, and 7893 constraints, problems are : Problem set: 0 solved, 3 unsolved in 3647 ms.
Refiners :[Positive P Invariants (semi-flows): 51/51 constraints, Generalized P Invariants (flows): 50/50 constraints, State Equation: 2774/2774 constraints, ReadFeed: 5018/5018 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 2643/2714 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2714 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 18:18:02] [INFO ] Deduced a trap composed of 2 places in 1787 ms of which 14 ms to minimize.
[2024-05-31 18:18:03] [INFO ] Deduced a trap composed of 53 places in 714 ms of which 9 ms to minimize.
[2024-05-31 18:18:04] [INFO ] Deduced a trap composed of 53 places in 684 ms of which 10 ms to minimize.
[2024-05-31 18:18:05] [INFO ] Deduced a trap composed of 53 places in 668 ms of which 9 ms to minimize.
[2024-05-31 18:18:05] [INFO ] Deduced a trap composed of 56 places in 633 ms of which 9 ms to minimize.
[2024-05-31 18:18:06] [INFO ] Deduced a trap composed of 59 places in 639 ms of which 9 ms to minimize.
[2024-05-31 18:18:07] [INFO ] Deduced a trap composed of 53 places in 648 ms of which 9 ms to minimize.
[2024-05-31 18:18:07] [INFO ] Deduced a trap composed of 53 places in 670 ms of which 9 ms to minimize.
[2024-05-31 18:18:08] [INFO ] Deduced a trap composed of 58 places in 641 ms of which 9 ms to minimize.
[2024-05-31 18:18:09] [INFO ] Deduced a trap composed of 53 places in 629 ms of which 9 ms to minimize.
[2024-05-31 18:18:09] [INFO ] Deduced a trap composed of 57 places in 584 ms of which 9 ms to minimize.
[2024-05-31 18:18:10] [INFO ] Deduced a trap composed of 59 places in 556 ms of which 8 ms to minimize.
[2024-05-31 18:18:10] [INFO ] Deduced a trap composed of 53 places in 514 ms of which 8 ms to minimize.
[2024-05-31 18:18:11] [INFO ] Deduced a trap composed of 55 places in 498 ms of which 8 ms to minimize.
[2024-05-31 18:18:12] [INFO ] Deduced a trap composed of 56 places in 483 ms of which 8 ms to minimize.
[2024-05-31 18:18:12] [INFO ] Deduced a trap composed of 53 places in 425 ms of which 7 ms to minimize.
[2024-05-31 18:18:13] [INFO ] Deduced a trap composed of 53 places in 539 ms of which 8 ms to minimize.
[2024-05-31 18:18:13] [INFO ] Deduced a trap composed of 56 places in 534 ms of which 8 ms to minimize.
[2024-05-31 18:18:14] [INFO ] Deduced a trap composed of 59 places in 545 ms of which 8 ms to minimize.
[2024-05-31 18:18:14] [INFO ] Deduced a trap composed of 56 places in 537 ms of which 9 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/2714 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 18:18:15] [INFO ] Deduced a trap composed of 53 places in 576 ms of which 8 ms to minimize.
[2024-05-31 18:18:16] [INFO ] Deduced a trap composed of 53 places in 523 ms of which 8 ms to minimize.
[2024-05-31 18:18:16] [INFO ] Deduced a trap composed of 53 places in 493 ms of which 8 ms to minimize.
[2024-05-31 18:18:17] [INFO ] Deduced a trap composed of 56 places in 521 ms of which 8 ms to minimize.
[2024-05-31 18:18:17] [INFO ] Deduced a trap composed of 54 places in 519 ms of which 8 ms to minimize.
[2024-05-31 18:18:18] [INFO ] Deduced a trap composed of 56 places in 480 ms of which 8 ms to minimize.
[2024-05-31 18:18:18] [INFO ] Deduced a trap composed of 56 places in 454 ms of which 8 ms to minimize.
[2024-05-31 18:18:19] [INFO ] Deduced a trap composed of 57 places in 461 ms of which 7 ms to minimize.
[2024-05-31 18:18:19] [INFO ] Deduced a trap composed of 53 places in 421 ms of which 8 ms to minimize.
[2024-05-31 18:18:20] [INFO ] Deduced a trap composed of 53 places in 607 ms of which 9 ms to minimize.
[2024-05-31 18:18:20] [INFO ] Deduced a trap composed of 53 places in 571 ms of which 8 ms to minimize.
[2024-05-31 18:18:21] [INFO ] Deduced a trap composed of 58 places in 572 ms of which 8 ms to minimize.
[2024-05-31 18:18:22] [INFO ] Deduced a trap composed of 53 places in 558 ms of which 9 ms to minimize.
[2024-05-31 18:18:22] [INFO ] Deduced a trap composed of 53 places in 495 ms of which 8 ms to minimize.
[2024-05-31 18:18:23] [INFO ] Deduced a trap composed of 53 places in 509 ms of which 8 ms to minimize.
[2024-05-31 18:18:23] [INFO ] Deduced a trap composed of 53 places in 464 ms of which 8 ms to minimize.
[2024-05-31 18:18:24] [INFO ] Deduced a trap composed of 53 places in 457 ms of which 8 ms to minimize.
[2024-05-31 18:18:24] [INFO ] Deduced a trap composed of 53 places in 462 ms of which 9 ms to minimize.
[2024-05-31 18:18:25] [INFO ] Deduced a trap composed of 53 places in 462 ms of which 8 ms to minimize.
[2024-05-31 18:18:25] [INFO ] Deduced a trap composed of 54 places in 426 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/2714 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 18:18:26] [INFO ] Deduced a trap composed of 53 places in 531 ms of which 8 ms to minimize.
[2024-05-31 18:18:26] [INFO ] Deduced a trap composed of 53 places in 559 ms of which 8 ms to minimize.
[2024-05-31 18:18:27] [INFO ] Deduced a trap composed of 53 places in 527 ms of which 8 ms to minimize.
[2024-05-31 18:18:28] [INFO ] Deduced a trap composed of 53 places in 519 ms of which 8 ms to minimize.
[2024-05-31 18:18:28] [INFO ] Deduced a trap composed of 53 places in 473 ms of which 8 ms to minimize.
[2024-05-31 18:18:29] [INFO ] Deduced a trap composed of 56 places in 491 ms of which 8 ms to minimize.
[2024-05-31 18:18:29] [INFO ] Deduced a trap composed of 56 places in 473 ms of which 7 ms to minimize.
[2024-05-31 18:18:30] [INFO ] Deduced a trap composed of 56 places in 432 ms of which 7 ms to minimize.
[2024-05-31 18:18:30] [INFO ] Deduced a trap composed of 53 places in 557 ms of which 9 ms to minimize.
[2024-05-31 18:18:31] [INFO ] Deduced a trap composed of 53 places in 555 ms of which 8 ms to minimize.
[2024-05-31 18:18:31] [INFO ] Deduced a trap composed of 53 places in 553 ms of which 8 ms to minimize.
[2024-05-31 18:18:32] [INFO ] Deduced a trap composed of 56 places in 563 ms of which 8 ms to minimize.
[2024-05-31 18:18:32] [INFO ] Deduced a trap composed of 53 places in 511 ms of which 8 ms to minimize.
[2024-05-31 18:18:33] [INFO ] Deduced a trap composed of 53 places in 507 ms of which 8 ms to minimize.
[2024-05-31 18:18:34] [INFO ] Deduced a trap composed of 53 places in 494 ms of which 8 ms to minimize.
[2024-05-31 18:18:34] [INFO ] Deduced a trap composed of 53 places in 438 ms of which 7 ms to minimize.
[2024-05-31 18:18:35] [INFO ] Deduced a trap composed of 53 places in 464 ms of which 7 ms to minimize.
[2024-05-31 18:18:35] [INFO ] Deduced a trap composed of 56 places in 395 ms of which 7 ms to minimize.
[2024-05-31 18:18:35] [INFO ] Deduced a trap composed of 53 places in 486 ms of which 8 ms to minimize.
[2024-05-31 18:18:36] [INFO ] Deduced a trap composed of 53 places in 487 ms of which 8 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/2714 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 18:18:37] [INFO ] Deduced a trap composed of 53 places in 588 ms of which 8 ms to minimize.
[2024-05-31 18:18:37] [INFO ] Deduced a trap composed of 53 places in 578 ms of which 8 ms to minimize.
[2024-05-31 18:18:38] [INFO ] Deduced a trap composed of 53 places in 638 ms of which 8 ms to minimize.
[2024-05-31 18:18:39] [INFO ] Deduced a trap composed of 56 places in 538 ms of which 8 ms to minimize.
[2024-05-31 18:18:39] [INFO ] Deduced a trap composed of 57 places in 647 ms of which 8 ms to minimize.
[2024-05-31 18:18:40] [INFO ] Deduced a trap composed of 53 places in 562 ms of which 8 ms to minimize.
[2024-05-31 18:18:40] [INFO ] Deduced a trap composed of 53 places in 519 ms of which 8 ms to minimize.
[2024-05-31 18:18:41] [INFO ] Deduced a trap composed of 53 places in 466 ms of which 7 ms to minimize.
[2024-05-31 18:18:41] [INFO ] Deduced a trap composed of 55 places in 481 ms of which 8 ms to minimize.
[2024-05-31 18:18:42] [INFO ] Deduced a trap composed of 60 places in 492 ms of which 8 ms to minimize.
[2024-05-31 18:18:42] [INFO ] Deduced a trap composed of 61 places in 490 ms of which 8 ms to minimize.
[2024-05-31 18:18:43] [INFO ] Deduced a trap composed of 61 places in 491 ms of which 8 ms to minimize.
[2024-05-31 18:18:44] [INFO ] Deduced a trap composed of 53 places in 465 ms of which 8 ms to minimize.
[2024-05-31 18:18:44] [INFO ] Deduced a trap composed of 54 places in 468 ms of which 7 ms to minimize.
[2024-05-31 18:18:45] [INFO ] Deduced a trap composed of 54 places in 464 ms of which 8 ms to minimize.
[2024-05-31 18:18:45] [INFO ] Deduced a trap composed of 53 places in 413 ms of which 7 ms to minimize.
[2024-05-31 18:18:45] [INFO ] Deduced a trap composed of 53 places in 411 ms of which 7 ms to minimize.
[2024-05-31 18:18:46] [INFO ] Deduced a trap composed of 54 places in 354 ms of which 7 ms to minimize.
[2024-05-31 18:18:46] [INFO ] Deduced a trap composed of 54 places in 446 ms of which 7 ms to minimize.
[2024-05-31 18:18:47] [INFO ] Deduced a trap composed of 53 places in 477 ms of which 7 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/2714 variables, 20/122 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 18:18:47] [INFO ] Deduced a trap composed of 53 places in 513 ms of which 7 ms to minimize.
[2024-05-31 18:18:48] [INFO ] Deduced a trap composed of 53 places in 521 ms of which 8 ms to minimize.
[2024-05-31 18:18:48] [INFO ] Deduced a trap composed of 53 places in 474 ms of which 7 ms to minimize.
[2024-05-31 18:18:49] [INFO ] Deduced a trap composed of 53 places in 443 ms of which 8 ms to minimize.
[2024-05-31 18:18:49] [INFO ] Deduced a trap composed of 56 places in 408 ms of which 8 ms to minimize.
[2024-05-31 18:18:50] [INFO ] Deduced a trap composed of 54 places in 360 ms of which 7 ms to minimize.
[2024-05-31 18:18:50] [INFO ] Deduced a trap composed of 56 places in 410 ms of which 7 ms to minimize.
[2024-05-31 18:18:51] [INFO ] Deduced a trap composed of 56 places in 412 ms of which 7 ms to minimize.
[2024-05-31 18:18:51] [INFO ] Deduced a trap composed of 54 places in 387 ms of which 9 ms to minimize.
[2024-05-31 18:18:52] [INFO ] Deduced a trap composed of 53 places in 474 ms of which 8 ms to minimize.
[2024-05-31 18:18:52] [INFO ] Deduced a trap composed of 53 places in 428 ms of which 7 ms to minimize.
[2024-05-31 18:18:53] [INFO ] Deduced a trap composed of 53 places in 428 ms of which 8 ms to minimize.
[2024-05-31 18:18:53] [INFO ] Deduced a trap composed of 54 places in 383 ms of which 7 ms to minimize.
[2024-05-31 18:18:53] [INFO ] Deduced a trap composed of 53 places in 411 ms of which 7 ms to minimize.
[2024-05-31 18:18:54] [INFO ] Deduced a trap composed of 53 places in 426 ms of which 8 ms to minimize.
[2024-05-31 18:18:54] [INFO ] Deduced a trap composed of 54 places in 403 ms of which 7 ms to minimize.
[2024-05-31 18:18:55] [INFO ] Deduced a trap composed of 55 places in 466 ms of which 8 ms to minimize.
[2024-05-31 18:18:55] [INFO ] Deduced a trap composed of 56 places in 486 ms of which 8 ms to minimize.
[2024-05-31 18:18:56] [INFO ] Deduced a trap composed of 58 places in 485 ms of which 7 ms to minimize.
[2024-05-31 18:18:56] [INFO ] Deduced a trap composed of 53 places in 490 ms of which 8 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/2714 variables, 20/142 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 18:18:57] [INFO ] Deduced a trap composed of 53 places in 491 ms of which 8 ms to minimize.
[2024-05-31 18:18:57] [INFO ] Deduced a trap composed of 59 places in 448 ms of which 8 ms to minimize.
[2024-05-31 18:18:58] [INFO ] Deduced a trap composed of 53 places in 427 ms of which 7 ms to minimize.
[2024-05-31 18:18:58] [INFO ] Deduced a trap composed of 53 places in 409 ms of which 7 ms to minimize.
[2024-05-31 18:18:59] [INFO ] Deduced a trap composed of 53 places in 414 ms of which 7 ms to minimize.
[2024-05-31 18:18:59] [INFO ] Deduced a trap composed of 56 places in 376 ms of which 7 ms to minimize.
[2024-05-31 18:19:00] [INFO ] Deduced a trap composed of 53 places in 379 ms of which 6 ms to minimize.
[2024-05-31 18:19:00] [INFO ] Deduced a trap composed of 54 places in 322 ms of which 6 ms to minimize.
[2024-05-31 18:19:00] [INFO ] Deduced a trap composed of 56 places in 414 ms of which 7 ms to minimize.
[2024-05-31 18:19:01] [INFO ] Deduced a trap composed of 56 places in 405 ms of which 6 ms to minimize.
[2024-05-31 18:19:01] [INFO ] Deduced a trap composed of 53 places in 383 ms of which 7 ms to minimize.
[2024-05-31 18:19:02] [INFO ] Deduced a trap composed of 53 places in 354 ms of which 7 ms to minimize.
[2024-05-31 18:19:02] [INFO ] Deduced a trap composed of 53 places in 373 ms of which 7 ms to minimize.
[2024-05-31 18:19:02] [INFO ] Deduced a trap composed of 54 places in 322 ms of which 6 ms to minimize.
[2024-05-31 18:19:03] [INFO ] Deduced a trap composed of 53 places in 392 ms of which 6 ms to minimize.
[2024-05-31 18:19:03] [INFO ] Deduced a trap composed of 53 places in 366 ms of which 7 ms to minimize.
[2024-05-31 18:19:04] [INFO ] Deduced a trap composed of 53 places in 369 ms of which 6 ms to minimize.
[2024-05-31 18:19:04] [INFO ] Deduced a trap composed of 53 places in 365 ms of which 7 ms to minimize.
[2024-05-31 18:19:05] [INFO ] Deduced a trap composed of 53 places in 370 ms of which 7 ms to minimize.
[2024-05-31 18:19:05] [INFO ] Deduced a trap composed of 56 places in 341 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/2714 variables, 20/162 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 18:19:05] [INFO ] Deduced a trap composed of 58 places in 517 ms of which 9 ms to minimize.
[2024-05-31 18:19:06] [INFO ] Deduced a trap composed of 53 places in 526 ms of which 8 ms to minimize.
[2024-05-31 18:19:07] [INFO ] Deduced a trap composed of 53 places in 519 ms of which 8 ms to minimize.
[2024-05-31 18:19:07] [INFO ] Deduced a trap composed of 53 places in 489 ms of which 7 ms to minimize.
[2024-05-31 18:19:08] [INFO ] Deduced a trap composed of 53 places in 457 ms of which 8 ms to minimize.
[2024-05-31 18:19:08] [INFO ] Deduced a trap composed of 56 places in 480 ms of which 7 ms to minimize.
[2024-05-31 18:19:09] [INFO ] Deduced a trap composed of 56 places in 473 ms of which 7 ms to minimize.
[2024-05-31 18:19:09] [INFO ] Deduced a trap composed of 56 places in 456 ms of which 8 ms to minimize.
[2024-05-31 18:19:10] [INFO ] Deduced a trap composed of 56 places in 448 ms of which 7 ms to minimize.
[2024-05-31 18:19:10] [INFO ] Deduced a trap composed of 53 places in 419 ms of which 7 ms to minimize.
[2024-05-31 18:19:11] [INFO ] Deduced a trap composed of 57 places in 504 ms of which 7 ms to minimize.
[2024-05-31 18:19:11] [INFO ] Deduced a trap composed of 56 places in 473 ms of which 7 ms to minimize.
[2024-05-31 18:19:12] [INFO ] Deduced a trap composed of 56 places in 443 ms of which 7 ms to minimize.
[2024-05-31 18:19:12] [INFO ] Deduced a trap composed of 56 places in 427 ms of which 7 ms to minimize.
[2024-05-31 18:19:13] [INFO ] Deduced a trap composed of 56 places in 438 ms of which 7 ms to minimize.
[2024-05-31 18:19:13] [INFO ] Deduced a trap composed of 57 places in 420 ms of which 8 ms to minimize.
[2024-05-31 18:19:13] [INFO ] Deduced a trap composed of 53 places in 373 ms of which 7 ms to minimize.
[2024-05-31 18:19:14] [INFO ] Deduced a trap composed of 54 places in 324 ms of which 6 ms to minimize.
[2024-05-31 18:19:14] [INFO ] Deduced a trap composed of 57 places in 359 ms of which 6 ms to minimize.
[2024-05-31 18:19:15] [INFO ] Deduced a trap composed of 54 places in 306 ms of which 6 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/2714 variables, 20/182 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 18:19:15] [INFO ] Deduced a trap composed of 53 places in 501 ms of which 8 ms to minimize.
[2024-05-31 18:19:16] [INFO ] Deduced a trap composed of 56 places in 451 ms of which 7 ms to minimize.
SMT process timed out in 79033ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 71 out of 2774 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2774/2774 places, 5194/5194 transitions.
Applied a total of 0 rules in 232 ms. Remains 2774 /2774 variables (removed 0) and now considering 5194/5194 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 233 ms. Remains : 2774/2774 places, 5194/5194 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2774/2774 places, 5194/5194 transitions.
Applied a total of 0 rules in 221 ms. Remains 2774 /2774 variables (removed 0) and now considering 5194/5194 (removed 0) transitions.
[2024-05-31 18:19:16] [INFO ] Invariant cache hit.
[2024-05-31 18:19:18] [INFO ] Implicit Places using invariants in 1613 ms returned [5, 9, 13, 18, 24, 28, 32, 37, 42, 48, 54, 59, 64, 71, 75, 79, 83, 89, 95, 99, 105, 109, 114, 120, 126, 132, 136, 141, 145, 149, 156, 160, 166, 170, 176, 180, 184, 190, 202, 206, 210, 214, 218, 224, 229, 233, 239, 245, 251]
Discarding 49 places :
Implicit Place search using SMT only with invariants took 1630 ms to find 49 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 2725/2774 places, 5194/5194 transitions.
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 2725 transition count 5173
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 42 place count 2704 transition count 5173
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 46 place count 2700 transition count 5169
Iterating global reduction 2 with 4 rules applied. Total rules applied 50 place count 2700 transition count 5169
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 58 place count 2696 transition count 5165
Applied a total of 58 rules in 559 ms. Remains 2696 /2725 variables (removed 29) and now considering 5165/5194 (removed 29) transitions.
// Phase 1: matrix 5165 rows 2696 cols
[2024-05-31 18:19:18] [INFO ] Computed 52 invariants in 61 ms
[2024-05-31 18:19:20] [INFO ] Implicit Places using invariants in 1482 ms returned []
[2024-05-31 18:19:20] [INFO ] Invariant cache hit.
[2024-05-31 18:19:21] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2024-05-31 18:19:52] [INFO ] Performed 1599/2696 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-31 18:20:15] [INFO ] Implicit Places using invariants and state equation in 55338 ms returned []
Implicit Place search using SMT with State Equation took 56822 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 2696/2774 places, 5165/5194 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 59234 ms. Remains : 2696/2774 places, 5165/5194 transitions.
RANDOM walk for 40000 steps (110 resets) in 592 ms. (67 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 87 ms. (454 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 99 ms. (400 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 89 ms. (444 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 80734 steps, run timeout after 3001 ms. (steps per millisecond=26 ) properties seen :0 out of 3
Probabilistic random walk after 80734 steps, saw 45578 distinct states, run finished after 3001 ms. (steps per millisecond=26 ) properties seen :0
[2024-05-31 18:20:18] [INFO ] Invariant cache hit.
[2024-05-31 18:20:18] [INFO ] State equation strengthened by 4950 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 2614/2685 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2685 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2685 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 10/2695 variables, 10/52 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2695 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 5165/7860 variables, 2695/2747 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/7860 variables, 4950/7697 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/7860 variables, 0/7697 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 1/7861 variables, 1/7698 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/7861 variables, 0/7698 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/7861 variables, 0/7698 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7861/7861 variables, and 7698 constraints, problems are : Problem set: 0 solved, 3 unsolved in 3151 ms.
Refiners :[Positive P Invariants (semi-flows): 51/51 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 2696/2696 constraints, ReadFeed: 4950/4950 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 2614/2685 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2685 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 18:20:24] [INFO ] Deduced a trap composed of 2 places in 1808 ms of which 14 ms to minimize.
[2024-05-31 18:20:24] [INFO ] Deduced a trap composed of 58 places in 657 ms of which 9 ms to minimize.
[2024-05-31 18:20:25] [INFO ] Deduced a trap composed of 54 places in 615 ms of which 9 ms to minimize.
[2024-05-31 18:20:26] [INFO ] Deduced a trap composed of 53 places in 644 ms of which 9 ms to minimize.
[2024-05-31 18:20:26] [INFO ] Deduced a trap composed of 53 places in 592 ms of which 9 ms to minimize.
[2024-05-31 18:20:27] [INFO ] Deduced a trap composed of 54 places in 533 ms of which 9 ms to minimize.
[2024-05-31 18:20:28] [INFO ] Deduced a trap composed of 54 places in 543 ms of which 9 ms to minimize.
[2024-05-31 18:20:28] [INFO ] Deduced a trap composed of 54 places in 535 ms of which 8 ms to minimize.
[2024-05-31 18:20:29] [INFO ] Deduced a trap composed of 59 places in 509 ms of which 9 ms to minimize.
[2024-05-31 18:20:29] [INFO ] Deduced a trap composed of 55 places in 489 ms of which 8 ms to minimize.
[2024-05-31 18:20:30] [INFO ] Deduced a trap composed of 53 places in 440 ms of which 7 ms to minimize.
[2024-05-31 18:20:30] [INFO ] Deduced a trap composed of 57 places in 535 ms of which 8 ms to minimize.
[2024-05-31 18:20:31] [INFO ] Deduced a trap composed of 58 places in 573 ms of which 8 ms to minimize.
[2024-05-31 18:20:31] [INFO ] Deduced a trap composed of 53 places in 561 ms of which 8 ms to minimize.
[2024-05-31 18:20:32] [INFO ] Deduced a trap composed of 56 places in 583 ms of which 9 ms to minimize.
[2024-05-31 18:20:33] [INFO ] Deduced a trap composed of 54 places in 621 ms of which 9 ms to minimize.
[2024-05-31 18:20:33] [INFO ] Deduced a trap composed of 59 places in 592 ms of which 9 ms to minimize.
[2024-05-31 18:20:34] [INFO ] Deduced a trap composed of 59 places in 593 ms of which 9 ms to minimize.
[2024-05-31 18:20:35] [INFO ] Deduced a trap composed of 53 places in 555 ms of which 8 ms to minimize.
[2024-05-31 18:20:35] [INFO ] Deduced a trap composed of 60 places in 493 ms of which 8 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/2685 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 18:20:36] [INFO ] Deduced a trap composed of 54 places in 594 ms of which 9 ms to minimize.
[2024-05-31 18:20:36] [INFO ] Deduced a trap composed of 54 places in 596 ms of which 9 ms to minimize.
[2024-05-31 18:20:37] [INFO ] Deduced a trap composed of 54 places in 561 ms of which 8 ms to minimize.
[2024-05-31 18:20:38] [INFO ] Deduced a trap composed of 53 places in 540 ms of which 8 ms to minimize.
[2024-05-31 18:20:38] [INFO ] Deduced a trap composed of 53 places in 517 ms of which 8 ms to minimize.
[2024-05-31 18:20:39] [INFO ] Deduced a trap composed of 54 places in 470 ms of which 8 ms to minimize.
[2024-05-31 18:20:39] [INFO ] Deduced a trap composed of 54 places in 458 ms of which 7 ms to minimize.
[2024-05-31 18:20:40] [INFO ] Deduced a trap composed of 54 places in 458 ms of which 7 ms to minimize.
[2024-05-31 18:20:40] [INFO ] Deduced a trap composed of 54 places in 494 ms of which 7 ms to minimize.
[2024-05-31 18:20:41] [INFO ] Deduced a trap composed of 54 places in 489 ms of which 8 ms to minimize.
[2024-05-31 18:20:41] [INFO ] Deduced a trap composed of 53 places in 465 ms of which 8 ms to minimize.
[2024-05-31 18:20:42] [INFO ] Deduced a trap composed of 54 places in 471 ms of which 7 ms to minimize.
[2024-05-31 18:20:42] [INFO ] Deduced a trap composed of 54 places in 472 ms of which 8 ms to minimize.
[2024-05-31 18:20:43] [INFO ] Deduced a trap composed of 56 places in 508 ms of which 8 ms to minimize.
[2024-05-31 18:20:43] [INFO ] Deduced a trap composed of 54 places in 470 ms of which 8 ms to minimize.
[2024-05-31 18:20:44] [INFO ] Deduced a trap composed of 54 places in 505 ms of which 11 ms to minimize.
[2024-05-31 18:20:44] [INFO ] Deduced a trap composed of 54 places in 561 ms of which 9 ms to minimize.
[2024-05-31 18:20:45] [INFO ] Deduced a trap composed of 53 places in 501 ms of which 8 ms to minimize.
[2024-05-31 18:20:45] [INFO ] Deduced a trap composed of 53 places in 498 ms of which 8 ms to minimize.
[2024-05-31 18:20:46] [INFO ] Deduced a trap composed of 53 places in 464 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/2685 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 18:20:47] [INFO ] Deduced a trap composed of 54 places in 536 ms of which 8 ms to minimize.
[2024-05-31 18:20:47] [INFO ] Deduced a trap composed of 54 places in 583 ms of which 8 ms to minimize.
[2024-05-31 18:20:48] [INFO ] Deduced a trap composed of 54 places in 566 ms of which 7 ms to minimize.
[2024-05-31 18:20:48] [INFO ] Deduced a trap composed of 54 places in 493 ms of which 8 ms to minimize.
[2024-05-31 18:20:49] [INFO ] Deduced a trap composed of 53 places in 499 ms of which 7 ms to minimize.
[2024-05-31 18:20:49] [INFO ] Deduced a trap composed of 54 places in 497 ms of which 8 ms to minimize.
[2024-05-31 18:20:50] [INFO ] Deduced a trap composed of 54 places in 502 ms of which 8 ms to minimize.
[2024-05-31 18:20:50] [INFO ] Deduced a trap composed of 54 places in 453 ms of which 7 ms to minimize.
[2024-05-31 18:20:51] [INFO ] Deduced a trap composed of 55 places in 457 ms of which 7 ms to minimize.
[2024-05-31 18:20:51] [INFO ] Deduced a trap composed of 55 places in 444 ms of which 8 ms to minimize.
[2024-05-31 18:20:52] [INFO ] Deduced a trap composed of 54 places in 429 ms of which 7 ms to minimize.
[2024-05-31 18:20:52] [INFO ] Deduced a trap composed of 55 places in 395 ms of which 7 ms to minimize.
[2024-05-31 18:20:53] [INFO ] Deduced a trap composed of 55 places in 396 ms of which 7 ms to minimize.
[2024-05-31 18:20:53] [INFO ] Deduced a trap composed of 54 places in 370 ms of which 7 ms to minimize.
[2024-05-31 18:20:54] [INFO ] Deduced a trap composed of 54 places in 462 ms of which 7 ms to minimize.
[2024-05-31 18:20:54] [INFO ] Deduced a trap composed of 57 places in 402 ms of which 7 ms to minimize.
[2024-05-31 18:20:54] [INFO ] Deduced a trap composed of 58 places in 408 ms of which 7 ms to minimize.
[2024-05-31 18:20:55] [INFO ] Deduced a trap composed of 54 places in 363 ms of which 7 ms to minimize.
[2024-05-31 18:20:55] [INFO ] Deduced a trap composed of 53 places in 417 ms of which 7 ms to minimize.
[2024-05-31 18:20:56] [INFO ] Deduced a trap composed of 59 places in 426 ms of which 10 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/2685 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 18:20:56] [INFO ] Deduced a trap composed of 54 places in 506 ms of which 8 ms to minimize.
[2024-05-31 18:20:57] [INFO ] Deduced a trap composed of 55 places in 546 ms of which 8 ms to minimize.
[2024-05-31 18:20:58] [INFO ] Deduced a trap composed of 54 places in 532 ms of which 8 ms to minimize.
[2024-05-31 18:20:58] [INFO ] Deduced a trap composed of 54 places in 456 ms of which 7 ms to minimize.
[2024-05-31 18:20:59] [INFO ] Deduced a trap composed of 54 places in 467 ms of which 7 ms to minimize.
[2024-05-31 18:20:59] [INFO ] Deduced a trap composed of 53 places in 478 ms of which 8 ms to minimize.
[2024-05-31 18:21:00] [INFO ] Deduced a trap composed of 55 places in 465 ms of which 8 ms to minimize.
[2024-05-31 18:21:00] [INFO ] Deduced a trap composed of 55 places in 451 ms of which 8 ms to minimize.
[2024-05-31 18:21:01] [INFO ] Deduced a trap composed of 55 places in 452 ms of which 8 ms to minimize.
[2024-05-31 18:21:01] [INFO ] Deduced a trap composed of 53 places in 398 ms of which 7 ms to minimize.
[2024-05-31 18:21:01] [INFO ] Deduced a trap composed of 53 places in 391 ms of which 7 ms to minimize.
[2024-05-31 18:21:02] [INFO ] Deduced a trap composed of 55 places in 421 ms of which 7 ms to minimize.
[2024-05-31 18:21:02] [INFO ] Deduced a trap composed of 53 places in 366 ms of which 7 ms to minimize.
[2024-05-31 18:21:03] [INFO ] Deduced a trap composed of 53 places in 453 ms of which 7 ms to minimize.
[2024-05-31 18:21:03] [INFO ] Deduced a trap composed of 53 places in 445 ms of which 7 ms to minimize.
[2024-05-31 18:21:04] [INFO ] Deduced a trap composed of 55 places in 421 ms of which 6 ms to minimize.
[2024-05-31 18:21:04] [INFO ] Deduced a trap composed of 53 places in 371 ms of which 7 ms to minimize.
[2024-05-31 18:21:05] [INFO ] Deduced a trap composed of 55 places in 513 ms of which 8 ms to minimize.
[2024-05-31 18:21:05] [INFO ] Deduced a trap composed of 53 places in 457 ms of which 7 ms to minimize.
[2024-05-31 18:21:06] [INFO ] Deduced a trap composed of 54 places in 434 ms of which 7 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/2685 variables, 20/122 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 18:21:06] [INFO ] Deduced a trap composed of 57 places in 460 ms of which 7 ms to minimize.
[2024-05-31 18:21:07] [INFO ] Deduced a trap composed of 54 places in 453 ms of which 8 ms to minimize.
[2024-05-31 18:21:07] [INFO ] Deduced a trap composed of 53 places in 377 ms of which 7 ms to minimize.
[2024-05-31 18:21:08] [INFO ] Deduced a trap composed of 54 places in 359 ms of which 7 ms to minimize.
[2024-05-31 18:21:08] [INFO ] Deduced a trap composed of 54 places in 299 ms of which 6 ms to minimize.
[2024-05-31 18:21:08] [INFO ] Deduced a trap composed of 54 places in 349 ms of which 6 ms to minimize.
[2024-05-31 18:21:09] [INFO ] Deduced a trap composed of 53 places in 411 ms of which 7 ms to minimize.
[2024-05-31 18:21:09] [INFO ] Deduced a trap composed of 53 places in 415 ms of which 7 ms to minimize.
[2024-05-31 18:21:10] [INFO ] Deduced a trap composed of 56 places in 436 ms of which 7 ms to minimize.
[2024-05-31 18:21:10] [INFO ] Deduced a trap composed of 54 places in 400 ms of which 7 ms to minimize.
[2024-05-31 18:21:10] [INFO ] Deduced a trap composed of 55 places in 357 ms of which 6 ms to minimize.
[2024-05-31 18:21:11] [INFO ] Deduced a trap composed of 55 places in 366 ms of which 7 ms to minimize.
[2024-05-31 18:21:11] [INFO ] Deduced a trap composed of 54 places in 339 ms of which 6 ms to minimize.
[2024-05-31 18:21:12] [INFO ] Deduced a trap composed of 55 places in 364 ms of which 7 ms to minimize.
[2024-05-31 18:21:12] [INFO ] Deduced a trap composed of 55 places in 362 ms of which 7 ms to minimize.
[2024-05-31 18:21:12] [INFO ] Deduced a trap composed of 53 places in 332 ms of which 6 ms to minimize.
[2024-05-31 18:21:13] [INFO ] Deduced a trap composed of 53 places in 341 ms of which 6 ms to minimize.
[2024-05-31 18:21:13] [INFO ] Deduced a trap composed of 54 places in 312 ms of which 5 ms to minimize.
[2024-05-31 18:21:14] [INFO ] Deduced a trap composed of 55 places in 315 ms of which 6 ms to minimize.
[2024-05-31 18:21:14] [INFO ] Deduced a trap composed of 54 places in 295 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/2685 variables, 20/142 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 18:21:14] [INFO ] Deduced a trap composed of 53 places in 461 ms of which 8 ms to minimize.
[2024-05-31 18:21:15] [INFO ] Deduced a trap composed of 53 places in 426 ms of which 7 ms to minimize.
[2024-05-31 18:21:15] [INFO ] Deduced a trap composed of 54 places in 432 ms of which 7 ms to minimize.
[2024-05-31 18:21:16] [INFO ] Deduced a trap composed of 53 places in 432 ms of which 7 ms to minimize.
[2024-05-31 18:21:16] [INFO ] Deduced a trap composed of 54 places in 458 ms of which 7 ms to minimize.
[2024-05-31 18:21:17] [INFO ] Deduced a trap composed of 54 places in 457 ms of which 7 ms to minimize.
[2024-05-31 18:21:17] [INFO ] Deduced a trap composed of 54 places in 459 ms of which 7 ms to minimize.
[2024-05-31 18:21:18] [INFO ] Deduced a trap composed of 53 places in 418 ms of which 7 ms to minimize.
[2024-05-31 18:21:18] [INFO ] Deduced a trap composed of 53 places in 375 ms of which 6 ms to minimize.
[2024-05-31 18:21:19] [INFO ] Deduced a trap composed of 53 places in 455 ms of which 7 ms to minimize.
[2024-05-31 18:21:19] [INFO ] Deduced a trap composed of 54 places in 415 ms of which 7 ms to minimize.
[2024-05-31 18:21:20] [INFO ] Deduced a trap composed of 53 places in 398 ms of which 6 ms to minimize.
[2024-05-31 18:21:20] [INFO ] Deduced a trap composed of 54 places in 434 ms of which 8 ms to minimize.
[2024-05-31 18:21:20] [INFO ] Deduced a trap composed of 54 places in 419 ms of which 8 ms to minimize.
[2024-05-31 18:21:21] [INFO ] Deduced a trap composed of 54 places in 417 ms of which 7 ms to minimize.
[2024-05-31 18:21:21] [INFO ] Deduced a trap composed of 54 places in 388 ms of which 7 ms to minimize.
[2024-05-31 18:21:22] [INFO ] Deduced a trap composed of 54 places in 397 ms of which 6 ms to minimize.
[2024-05-31 18:21:22] [INFO ] Deduced a trap composed of 54 places in 353 ms of which 6 ms to minimize.
[2024-05-31 18:21:23] [INFO ] Deduced a trap composed of 53 places in 333 ms of which 6 ms to minimize.
[2024-05-31 18:21:23] [INFO ] Deduced a trap composed of 54 places in 366 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/2685 variables, 20/162 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 18:21:23] [INFO ] Deduced a trap composed of 54 places in 431 ms of which 7 ms to minimize.
[2024-05-31 18:21:24] [INFO ] Deduced a trap composed of 54 places in 448 ms of which 8 ms to minimize.
[2024-05-31 18:21:24] [INFO ] Deduced a trap composed of 54 places in 469 ms of which 8 ms to minimize.
[2024-05-31 18:21:25] [INFO ] Deduced a trap composed of 53 places in 431 ms of which 7 ms to minimize.
[2024-05-31 18:21:25] [INFO ] Deduced a trap composed of 53 places in 395 ms of which 7 ms to minimize.
[2024-05-31 18:21:26] [INFO ] Deduced a trap composed of 53 places in 364 ms of which 7 ms to minimize.
[2024-05-31 18:21:26] [INFO ] Deduced a trap composed of 54 places in 328 ms of which 6 ms to minimize.
[2024-05-31 18:21:26] [INFO ] Deduced a trap composed of 53 places in 279 ms of which 6 ms to minimize.
[2024-05-31 18:21:27] [INFO ] Deduced a trap composed of 54 places in 300 ms of which 6 ms to minimize.
[2024-05-31 18:21:27] [INFO ] Deduced a trap composed of 53 places in 263 ms of which 5 ms to minimize.
[2024-05-31 18:21:27] [INFO ] Deduced a trap composed of 54 places in 373 ms of which 6 ms to minimize.
[2024-05-31 18:21:28] [INFO ] Deduced a trap composed of 56 places in 350 ms of which 6 ms to minimize.
[2024-05-31 18:21:28] [INFO ] Deduced a trap composed of 54 places in 263 ms of which 5 ms to minimize.
[2024-05-31 18:21:29] [INFO ] Deduced a trap composed of 57 places in 420 ms of which 8 ms to minimize.
[2024-05-31 18:21:29] [INFO ] Deduced a trap composed of 58 places in 436 ms of which 7 ms to minimize.
[2024-05-31 18:21:30] [INFO ] Deduced a trap composed of 58 places in 407 ms of which 7 ms to minimize.
[2024-05-31 18:21:30] [INFO ] Deduced a trap composed of 54 places in 380 ms of which 6 ms to minimize.
[2024-05-31 18:21:30] [INFO ] Deduced a trap composed of 55 places in 325 ms of which 6 ms to minimize.
[2024-05-31 18:21:31] [INFO ] Deduced a trap composed of 54 places in 332 ms of which 6 ms to minimize.
[2024-05-31 18:21:31] [INFO ] Deduced a trap composed of 55 places in 328 ms of which 6 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/2685 variables, 20/182 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 18:21:32] [INFO ] Deduced a trap composed of 53 places in 452 ms of which 7 ms to minimize.
[2024-05-31 18:21:32] [INFO ] Deduced a trap composed of 59 places in 422 ms of which 7 ms to minimize.
[2024-05-31 18:21:32] [INFO ] Deduced a trap composed of 53 places in 398 ms of which 7 ms to minimize.
[2024-05-31 18:21:33] [INFO ] Deduced a trap composed of 53 places in 381 ms of which 7 ms to minimize.
[2024-05-31 18:21:33] [INFO ] Deduced a trap composed of 54 places in 330 ms of which 7 ms to minimize.
[2024-05-31 18:21:34] [INFO ] Deduced a trap composed of 53 places in 320 ms of which 6 ms to minimize.
[2024-05-31 18:21:34] [INFO ] Deduced a trap composed of 53 places in 305 ms of which 6 ms to minimize.
[2024-05-31 18:21:34] [INFO ] Deduced a trap composed of 53 places in 305 ms of which 6 ms to minimize.
[2024-05-31 18:21:35] [INFO ] Deduced a trap composed of 53 places in 303 ms of which 6 ms to minimize.
[2024-05-31 18:21:35] [INFO ] Deduced a trap composed of 53 places in 453 ms of which 8 ms to minimize.
[2024-05-31 18:21:36] [INFO ] Deduced a trap composed of 53 places in 458 ms of which 7 ms to minimize.
[2024-05-31 18:21:36] [INFO ] Deduced a trap composed of 53 places in 413 ms of which 7 ms to minimize.
[2024-05-31 18:21:37] [INFO ] Deduced a trap composed of 53 places in 421 ms of which 7 ms to minimize.
[2024-05-31 18:21:37] [INFO ] Deduced a trap composed of 53 places in 406 ms of which 7 ms to minimize.
[2024-05-31 18:21:37] [INFO ] Deduced a trap composed of 54 places in 371 ms of which 7 ms to minimize.
[2024-05-31 18:21:38] [INFO ] Deduced a trap composed of 53 places in 388 ms of which 7 ms to minimize.
[2024-05-31 18:21:38] [INFO ] Deduced a trap composed of 53 places in 406 ms of which 7 ms to minimize.
[2024-05-31 18:21:39] [INFO ] Deduced a trap composed of 55 places in 339 ms of which 6 ms to minimize.
[2024-05-31 18:21:39] [INFO ] Deduced a trap composed of 54 places in 323 ms of which 7 ms to minimize.
[2024-05-31 18:21:40] [INFO ] Deduced a trap composed of 53 places in 485 ms of which 8 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/2685 variables, 20/202 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 18:21:40] [INFO ] Deduced a trap composed of 54 places in 465 ms of which 7 ms to minimize.
[2024-05-31 18:21:41] [INFO ] Deduced a trap composed of 53 places in 407 ms of which 7 ms to minimize.
[2024-05-31 18:21:41] [INFO ] Deduced a trap composed of 53 places in 392 ms of which 6 ms to minimize.
[2024-05-31 18:21:41] [INFO ] Deduced a trap composed of 53 places in 388 ms of which 6 ms to minimize.
[2024-05-31 18:21:42] [INFO ] Deduced a trap composed of 53 places in 360 ms of which 7 ms to minimize.
[2024-05-31 18:21:42] [INFO ] Deduced a trap composed of 53 places in 357 ms of which 6 ms to minimize.
[2024-05-31 18:21:43] [INFO ] Deduced a trap composed of 53 places in 402 ms of which 7 ms to minimize.
[2024-05-31 18:21:43] [INFO ] Deduced a trap composed of 53 places in 336 ms of which 6 ms to minimize.
[2024-05-31 18:21:43] [INFO ] Deduced a trap composed of 53 places in 351 ms of which 6 ms to minimize.
[2024-05-31 18:21:44] [INFO ] Deduced a trap composed of 53 places in 351 ms of which 7 ms to minimize.
[2024-05-31 18:21:44] [INFO ] Deduced a trap composed of 53 places in 343 ms of which 6 ms to minimize.
[2024-05-31 18:21:45] [INFO ] Deduced a trap composed of 53 places in 342 ms of which 6 ms to minimize.
[2024-05-31 18:21:45] [INFO ] Deduced a trap composed of 54 places in 349 ms of which 6 ms to minimize.
[2024-05-31 18:21:45] [INFO ] Deduced a trap composed of 54 places in 345 ms of which 6 ms to minimize.
[2024-05-31 18:21:46] [INFO ] Deduced a trap composed of 53 places in 340 ms of which 6 ms to minimize.
[2024-05-31 18:21:46] [INFO ] Deduced a trap composed of 53 places in 306 ms of which 5 ms to minimize.
[2024-05-31 18:21:47] [INFO ] Deduced a trap composed of 56 places in 398 ms of which 6 ms to minimize.
[2024-05-31 18:21:47] [INFO ] Deduced a trap composed of 53 places in 384 ms of which 7 ms to minimize.
[2024-05-31 18:21:47] [INFO ] Deduced a trap composed of 53 places in 417 ms of which 7 ms to minimize.
[2024-05-31 18:21:48] [INFO ] Deduced a trap composed of 53 places in 363 ms of which 7 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/2685 variables, 20/222 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 18:21:49] [INFO ] Deduced a trap composed of 54 places in 594 ms of which 8 ms to minimize.
[2024-05-31 18:21:49] [INFO ] Deduced a trap composed of 54 places in 607 ms of which 9 ms to minimize.
[2024-05-31 18:21:50] [INFO ] Deduced a trap composed of 54 places in 558 ms of which 8 ms to minimize.
[2024-05-31 18:21:50] [INFO ] Deduced a trap composed of 55 places in 530 ms of which 8 ms to minimize.
[2024-05-31 18:21:51] [INFO ] Deduced a trap composed of 53 places in 477 ms of which 8 ms to minimize.
[2024-05-31 18:21:51] [INFO ] Deduced a trap composed of 53 places in 509 ms of which 8 ms to minimize.
[2024-05-31 18:21:52] [INFO ] Deduced a trap composed of 54 places in 470 ms of which 7 ms to minimize.
SMT process timed out in 93544ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 71 out of 2696 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2696/2696 places, 5165/5165 transitions.
Applied a total of 0 rules in 225 ms. Remains 2696 /2696 variables (removed 0) and now considering 5165/5165 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 226 ms. Remains : 2696/2696 places, 5165/5165 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2696/2696 places, 5165/5165 transitions.
Applied a total of 0 rules in 211 ms. Remains 2696 /2696 variables (removed 0) and now considering 5165/5165 (removed 0) transitions.
[2024-05-31 18:21:52] [INFO ] Invariant cache hit.
[2024-05-31 18:21:54] [INFO ] Implicit Places using invariants in 1523 ms returned []
[2024-05-31 18:21:54] [INFO ] Invariant cache hit.
[2024-05-31 18:21:56] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2024-05-31 18:22:26] [INFO ] Performed 1465/2696 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-31 18:22:53] [INFO ] Implicit Places using invariants and state equation in 59593 ms returned []
Implicit Place search using SMT with State Equation took 61117 ms to find 0 implicit places.
[2024-05-31 18:22:54] [INFO ] Redundant transitions in 390 ms returned []
Running 5115 sub problems to find dead transitions.
[2024-05-31 18:22:54] [INFO ] Invariant cache hit.
[2024-05-31 18:22:54] [INFO ] State equation strengthened by 4950 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/2695 variables, 51/51 constraints. Problems are: Problem set: 0 solved, 5115 unsolved
SMT process timed out in 34536ms, After SMT, problems are : Problem set: 0 solved, 5115 unsolved
Search for dead transitions found 0 dead transitions in 34582ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 96327 ms. Remains : 2696/2696 places, 5165/5165 transitions.
[2024-05-31 18:23:28] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 6 ms.
[2024-05-31 18:23:29] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2696 places, 5165 transitions and 20405 arcs took 27 ms.
[2024-05-31 18:23:29] [INFO ] Flatten gal took : 373 ms
Total runtime 402149 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 : CANConstruction-PT-050-ReachabilityFireability-2024-02
Could not compute solution for formula : CANConstruction-PT-050-ReachabilityFireability-2024-06
Could not compute solution for formula : CANConstruction-PT-050-ReachabilityFireability-2024-14

BK_STOP 1717179809888

--------------------
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 CANConstruction-PT-050-ReachabilityFireability-2024-02
rfs formula type AG
rfs formula formula --invariant=/tmp/1721/inv_0_
rfs formula name CANConstruction-PT-050-ReachabilityFireability-2024-06
rfs formula type AG
rfs formula formula --invariant=/tmp/1721/inv_1_
rfs formula name CANConstruction-PT-050-ReachabilityFireability-2024-14
rfs formula type EF
rfs formula formula --invariant=/tmp/1721/inv_2_
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="CANConstruction-PT-050"
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 CANConstruction-PT-050, 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 r476-tall-171620505000047"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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