About the Execution of LTSMin+red for CANInsertWithFailure-PT-030
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 2205.271 | 161666.00 | 209886.00 | 443.20 | TFTTT????TTTTTTF | 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-171620505200118.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 CANInsertWithFailure-PT-030, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r476-tall-171620505200118
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.0M
-rw-r--r-- 1 mcc users 8.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K May 19 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 19 15:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 17:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 96K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K May 19 15:24 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 5.6M 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 CANInsertWithFailure-PT-030-ReachabilityCardinality-2024-00
FORMULA_NAME CANInsertWithFailure-PT-030-ReachabilityCardinality-2024-01
FORMULA_NAME CANInsertWithFailure-PT-030-ReachabilityCardinality-2024-02
FORMULA_NAME CANInsertWithFailure-PT-030-ReachabilityCardinality-2024-03
FORMULA_NAME CANInsertWithFailure-PT-030-ReachabilityCardinality-2024-04
FORMULA_NAME CANInsertWithFailure-PT-030-ReachabilityCardinality-2023-05
FORMULA_NAME CANInsertWithFailure-PT-030-ReachabilityCardinality-2024-06
FORMULA_NAME CANInsertWithFailure-PT-030-ReachabilityCardinality-2023-07
FORMULA_NAME CANInsertWithFailure-PT-030-ReachabilityCardinality-2023-08
FORMULA_NAME CANInsertWithFailure-PT-030-ReachabilityCardinality-2024-09
FORMULA_NAME CANInsertWithFailure-PT-030-ReachabilityCardinality-2024-10
FORMULA_NAME CANInsertWithFailure-PT-030-ReachabilityCardinality-2024-11
FORMULA_NAME CANInsertWithFailure-PT-030-ReachabilityCardinality-2024-12
FORMULA_NAME CANInsertWithFailure-PT-030-ReachabilityCardinality-2024-13
FORMULA_NAME CANInsertWithFailure-PT-030-ReachabilityCardinality-2024-14
FORMULA_NAME CANInsertWithFailure-PT-030-ReachabilityCardinality-2024-15
=== Now, execution of the tool begins
BK_START 1717187678172
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANInsertWithFailure-PT-030
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 20:34:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-31 20:34:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 20:34:39] [INFO ] Load time of PNML (sax parser for PT used): 276 ms
[2024-05-31 20:34:39] [INFO ] Transformed 2164 places.
[2024-05-31 20:34:39] [INFO ] Transformed 5580 transitions.
[2024-05-31 20:34:39] [INFO ] Parsed PT model containing 2164 places and 5580 transitions and 15000 arcs in 404 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 22 ms.
Working with output stream class java.io.PrintStream
FORMULA CANInsertWithFailure-PT-030-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (54 resets) in 3094 ms. (12 steps per ms) remains 7/15 properties
FORMULA CANInsertWithFailure-PT-030-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-030-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-030-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-030-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-030-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-030-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-030-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-030-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 142 ms. (279 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 515 ms. (77 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 125 ms. (317 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 92 ms. (430 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 78 ms. (506 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 540 ms. (73 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 534 ms. (74 steps per ms) remains 7/7 properties
// Phase 1: matrix 5580 rows 2164 cols
[2024-05-31 20:34:41] [INFO ] Computed 33 invariants in 212 ms
[2024-05-31 20:34:41] [INFO ] State equation strengthened by 1770 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem CANInsertWithFailure-PT-030-ReachabilityCardinality-2024-11 is UNSAT
FORMULA CANInsertWithFailure-PT-030-ReachabilityCardinality-2024-11 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 2030/2115 variables, 8/8 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2115 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 44/2159 variables, 22/30 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2159 variables, 0/30 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 2/2161 variables, 2/32 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2161 variables, 0/32 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 5580/7741 variables, 2161/2193 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/7741 variables, 1770/3963 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/7741 variables, 0/3963 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 3/7744 variables, 3/3966 constraints. Problems are: Problem set: 1 solved, 6 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 7744/7744 variables, and 3967 constraints, problems are : Problem set: 1 solved, 6 unsolved in 5066 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 2164/2164 constraints, ReadFeed: 1770/1770 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 2030/2113 variables, 7/7 constraints. Problems are: Problem set: 1 solved, 6 unsolved
[2024-05-31 20:34:47] [INFO ] Deduced a trap composed of 5 places in 157 ms of which 17 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/2113 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2113 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 46/2159 variables, 23/31 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2159 variables, 0/31 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 2/2161 variables, 2/33 constraints. Problems are: Problem set: 1 solved, 6 unsolved
[2024-05-31 20:34:49] [INFO ] Deduced a trap composed of 52 places in 1335 ms of which 14 ms to minimize.
[2024-05-31 20:34:50] [INFO ] Deduced a trap composed of 56 places in 1107 ms of which 11 ms to minimize.
[2024-05-31 20:34:51] [INFO ] Deduced a trap composed of 56 places in 1060 ms of which 11 ms to minimize.
SMT process timed out in 10579ms, After SMT, problems are : Problem set: 1 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 83 out of 2164 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2164/2164 places, 5580/5580 transitions.
Graph (complete) has 7651 edges and 2164 vertex of which 2163 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.10 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 191 transitions
Trivial Post-agglo rules discarded 191 transitions
Performed 191 trivial Post agglomeration. Transition count delta: 191
Iterating post reduction 0 with 191 rules applied. Total rules applied 192 place count 2163 transition count 5389
Reduce places removed 191 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 197 rules applied. Total rules applied 389 place count 1972 transition count 5383
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 395 place count 1966 transition count 5383
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 395 place count 1966 transition count 5380
Deduced a syphon composed of 3 places in 4 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 401 place count 1963 transition count 5380
Performed 699 Post agglomeration using F-continuation condition.Transition count delta: 699
Deduced a syphon composed of 699 places in 5 ms
Reduce places removed 699 places and 0 transitions.
Iterating global reduction 3 with 1398 rules applied. Total rules applied 1799 place count 1264 transition count 4681
Drop transitions (Redundant composition of simpler transitions.) removed 650 transitions
Redundant transition composition rules discarded 650 transitions
Iterating global reduction 3 with 650 rules applied. Total rules applied 2449 place count 1264 transition count 4031
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 3 with 5 rules applied. Total rules applied 2454 place count 1264 transition count 4026
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 2459 place count 1259 transition count 4026
Partial Free-agglomeration rule applied 1136 times.
Drop transitions (Partial Free agglomeration) removed 1136 transitions
Iterating global reduction 4 with 1136 rules applied. Total rules applied 3595 place count 1259 transition count 4026
Partial Free-agglomeration rule applied 98 times.
Drop transitions (Partial Free agglomeration) removed 98 transitions
Iterating global reduction 4 with 98 rules applied. Total rules applied 3693 place count 1259 transition count 4026
Applied a total of 3693 rules in 1501 ms. Remains 1259 /2164 variables (removed 905) and now considering 4026/5580 (removed 1554) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1525 ms. Remains : 1259/2164 places, 4026/5580 transitions.
RANDOM walk for 40000 steps (218 resets) in 1149 ms. (34 steps per ms) remains 5/6 properties
FORMULA CANInsertWithFailure-PT-030-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 74 ms. (533 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 117 ms. (339 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 53 ms. (740 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 54 ms. (727 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 76 ms. (519 steps per ms) remains 5/5 properties
// Phase 1: matrix 4026 rows 1259 cols
[2024-05-31 20:34:54] [INFO ] Computed 32 invariants in 101 ms
[2024-05-31 20:34:54] [INFO ] State equation strengthened by 3475 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 1151/1205 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1205 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 50/1255 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1255 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 2/1257 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1257 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 4026/5283 variables, 1257/1289 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/5283 variables, 3475/4764 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/5283 variables, 0/4764 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 2/5285 variables, 2/4766 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/5285 variables, 0/4766 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 0/5285 variables, 0/4766 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5285/5285 variables, and 4766 constraints, problems are : Problem set: 0 solved, 5 unsolved in 2853 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1259/1259 constraints, ReadFeed: 3475/3475 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 1151/1205 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 20:34:57] [INFO ] Deduced a trap composed of 2 places in 48 ms of which 1 ms to minimize.
[2024-05-31 20:34:57] [INFO ] Deduced a trap composed of 2 places in 50 ms of which 1 ms to minimize.
[2024-05-31 20:34:57] [INFO ] Deduced a trap composed of 2 places in 53 ms of which 1 ms to minimize.
[2024-05-31 20:34:57] [INFO ] Deduced a trap composed of 2 places in 52 ms of which 1 ms to minimize.
[2024-05-31 20:34:57] [INFO ] Deduced a trap composed of 2 places in 49 ms of which 1 ms to minimize.
[2024-05-31 20:34:57] [INFO ] Deduced a trap composed of 2 places in 47 ms of which 1 ms to minimize.
[2024-05-31 20:34:57] [INFO ] Deduced a trap composed of 2 places in 47 ms of which 1 ms to minimize.
[2024-05-31 20:34:57] [INFO ] Deduced a trap composed of 2 places in 50 ms of which 1 ms to minimize.
[2024-05-31 20:34:57] [INFO ] Deduced a trap composed of 2 places in 47 ms of which 1 ms to minimize.
[2024-05-31 20:34:57] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 1 ms to minimize.
[2024-05-31 20:34:58] [INFO ] Deduced a trap composed of 2 places in 50 ms of which 1 ms to minimize.
[2024-05-31 20:34:58] [INFO ] Deduced a trap composed of 2 places in 48 ms of which 1 ms to minimize.
[2024-05-31 20:34:58] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 1 ms to minimize.
[2024-05-31 20:34:58] [INFO ] Deduced a trap composed of 2 places in 51 ms of which 1 ms to minimize.
[2024-05-31 20:34:58] [INFO ] Deduced a trap composed of 2 places in 51 ms of which 1 ms to minimize.
[2024-05-31 20:34:58] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 1 ms to minimize.
[2024-05-31 20:34:58] [INFO ] Deduced a trap composed of 2 places in 53 ms of which 1 ms to minimize.
[2024-05-31 20:34:58] [INFO ] Deduced a trap composed of 2 places in 46 ms of which 1 ms to minimize.
[2024-05-31 20:34:58] [INFO ] Deduced a trap composed of 2 places in 45 ms of which 0 ms to minimize.
[2024-05-31 20:34:58] [INFO ] Deduced a trap composed of 2 places in 50 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1205 variables, 20/25 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1205 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 50/1255 variables, 25/50 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1255 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 2/1257 variables, 2/52 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 20:34:59] [INFO ] Deduced a trap composed of 45 places in 624 ms of which 7 ms to minimize.
[2024-05-31 20:35:00] [INFO ] Deduced a trap composed of 45 places in 630 ms of which 7 ms to minimize.
[2024-05-31 20:35:00] [INFO ] Deduced a trap composed of 40 places in 608 ms of which 7 ms to minimize.
[2024-05-31 20:35:01] [INFO ] Deduced a trap composed of 46 places in 599 ms of which 6 ms to minimize.
[2024-05-31 20:35:02] [INFO ] Deduced a trap composed of 49 places in 526 ms of which 6 ms to minimize.
[2024-05-31 20:35:02] [INFO ] Deduced a trap composed of 50 places in 519 ms of which 5 ms to minimize.
[2024-05-31 20:35:03] [INFO ] Deduced a trap composed of 48 places in 506 ms of which 6 ms to minimize.
[2024-05-31 20:35:03] [INFO ] Deduced a trap composed of 50 places in 489 ms of which 5 ms to minimize.
[2024-05-31 20:35:04] [INFO ] Deduced a trap composed of 37 places in 510 ms of which 6 ms to minimize.
[2024-05-31 20:35:04] [INFO ] Deduced a trap composed of 37 places in 474 ms of which 6 ms to minimize.
[2024-05-31 20:35:05] [INFO ] Deduced a trap composed of 44 places in 440 ms of which 9 ms to minimize.
[2024-05-31 20:35:05] [INFO ] Deduced a trap composed of 44 places in 440 ms of which 5 ms to minimize.
[2024-05-31 20:35:06] [INFO ] Deduced a trap composed of 38 places in 455 ms of which 4 ms to minimize.
[2024-05-31 20:35:06] [INFO ] Deduced a trap composed of 51 places in 348 ms of which 4 ms to minimize.
[2024-05-31 20:35:06] [INFO ] Deduced a trap composed of 52 places in 379 ms of which 5 ms to minimize.
[2024-05-31 20:35:07] [INFO ] Deduced a trap composed of 53 places in 377 ms of which 5 ms to minimize.
[2024-05-31 20:35:07] [INFO ] Deduced a trap composed of 49 places in 358 ms of which 4 ms to minimize.
[2024-05-31 20:35:08] [INFO ] Deduced a trap composed of 52 places in 369 ms of which 5 ms to minimize.
[2024-05-31 20:35:08] [INFO ] Deduced a trap composed of 39 places in 417 ms of which 5 ms to minimize.
[2024-05-31 20:35:08] [INFO ] Deduced a trap composed of 41 places in 400 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1257 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 20:35:09] [INFO ] Deduced a trap composed of 45 places in 68 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1257 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 20:35:09] [INFO ] Deduced a trap composed of 53 places in 78 ms of which 1 ms to minimize.
[2024-05-31 20:35:09] [INFO ] Deduced a trap composed of 50 places in 77 ms of which 2 ms to minimize.
[2024-05-31 20:35:09] [INFO ] Deduced a trap composed of 49 places in 76 ms of which 1 ms to minimize.
[2024-05-31 20:35:09] [INFO ] Deduced a trap composed of 51 places in 73 ms of which 1 ms to minimize.
[2024-05-31 20:35:09] [INFO ] Deduced a trap composed of 44 places in 67 ms of which 1 ms to minimize.
[2024-05-31 20:35:09] [INFO ] Deduced a trap composed of 42 places in 65 ms of which 1 ms to minimize.
[2024-05-31 20:35:09] [INFO ] Deduced a trap composed of 41 places in 67 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1257 variables, 7/80 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1257 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 4026/5283 variables, 1257/1337 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/5283 variables, 3475/4812 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/5283 variables, 5/4817 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/5283 variables, 0/4817 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 2/5285 variables, 2/4819 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/5285 variables, 0/4819 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 0/5285 variables, 0/4819 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 5285/5285 variables, and 4819 constraints, problems are : Problem set: 0 solved, 5 unsolved in 33746 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1259/1259 constraints, ReadFeed: 3475/3475 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 48/48 constraints]
After SMT, in 36815ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 776 ms.
Support contains 54 out of 1259 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1259/1259 places, 4026/4026 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 0 with 2 rules applied. Total rules applied 2 place count 1259 transition count 4024
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 1257 transition count 4024
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 28 place count 1245 transition count 4012
Partial Free-agglomeration rule applied 17 times.
Drop transitions (Partial Free agglomeration) removed 17 transitions
Iterating global reduction 2 with 17 rules applied. Total rules applied 45 place count 1245 transition count 4012
Applied a total of 45 rules in 233 ms. Remains 1245 /1259 variables (removed 14) and now considering 4012/4026 (removed 14) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 233 ms. Remains : 1245/1259 places, 4012/4026 transitions.
RANDOM walk for 40000 steps (224 resets) in 631 ms. (63 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 63 ms. (625 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 134 ms. (296 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 65 ms. (606 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 62 ms. (634 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 78 ms. (506 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 145041 steps, run timeout after 3001 ms. (steps per millisecond=48 ) properties seen :0 out of 5
Probabilistic random walk after 145041 steps, saw 34320 distinct states, run finished after 3004 ms. (steps per millisecond=48 ) properties seen :0
// Phase 1: matrix 4012 rows 1245 cols
[2024-05-31 20:35:35] [INFO ] Computed 32 invariants in 67 ms
[2024-05-31 20:35:35] [INFO ] State equation strengthened by 3542 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 1137/1191 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1191 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 50/1241 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1241 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 2/1243 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1243 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 4012/5255 variables, 1243/1275 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/5255 variables, 3542/4817 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/5255 variables, 0/4817 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 2/5257 variables, 2/4819 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/5257 variables, 0/4819 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 0/5257 variables, 0/4819 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5257/5257 variables, and 4819 constraints, problems are : Problem set: 0 solved, 5 unsolved in 2988 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1245/1245 constraints, ReadFeed: 3542/3542 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 1137/1191 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 20:35:38] [INFO ] Deduced a trap composed of 2 places in 66 ms of which 1 ms to minimize.
[2024-05-31 20:35:38] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1191 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1191 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 50/1241 variables, 25/32 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1241 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 2/1243 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 20:35:39] [INFO ] Deduced a trap composed of 52 places in 617 ms of which 6 ms to minimize.
[2024-05-31 20:35:40] [INFO ] Deduced a trap composed of 40 places in 571 ms of which 15 ms to minimize.
[2024-05-31 20:35:41] [INFO ] Deduced a trap composed of 39 places in 616 ms of which 7 ms to minimize.
[2024-05-31 20:35:41] [INFO ] Deduced a trap composed of 37 places in 526 ms of which 6 ms to minimize.
[2024-05-31 20:35:42] [INFO ] Deduced a trap composed of 38 places in 568 ms of which 6 ms to minimize.
[2024-05-31 20:35:42] [INFO ] Deduced a trap composed of 36 places in 94 ms of which 1 ms to minimize.
[2024-05-31 20:35:42] [INFO ] Deduced a trap composed of 35 places in 84 ms of which 1 ms to minimize.
[2024-05-31 20:35:42] [INFO ] Deduced a trap composed of 35 places in 64 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1243 variables, 8/42 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 20:35:42] [INFO ] Deduced a trap composed of 35 places in 69 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1243 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1243 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 4012/5255 variables, 1243/1286 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/5255 variables, 3542/4828 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/5255 variables, 5/4833 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/5255 variables, 0/4833 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 2/5257 variables, 2/4835 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/5257 variables, 0/4835 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 0/5257 variables, 0/4835 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 5257/5257 variables, and 4835 constraints, problems are : Problem set: 0 solved, 5 unsolved in 18637 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1245/1245 constraints, ReadFeed: 3542/3542 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 11/11 constraints]
After SMT, in 21790ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 2 different solutions.
FORMULA CANInsertWithFailure-PT-030-ReachabilityCardinality-2024-13 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 835 ms.
Support contains 41 out of 1245 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1245/1245 places, 4012/4012 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1245 transition count 4011
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1244 transition count 4011
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 14 place count 1238 transition count 4005
Partial Free-agglomeration rule applied 90 times.
Drop transitions (Partial Free agglomeration) removed 90 transitions
Iterating global reduction 2 with 90 rules applied. Total rules applied 104 place count 1238 transition count 4005
Applied a total of 104 rules in 190 ms. Remains 1238 /1245 variables (removed 7) and now considering 4005/4012 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 190 ms. Remains : 1238/1245 places, 4005/4012 transitions.
RANDOM walk for 40000 steps (230 resets) in 529 ms. (75 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 54 ms. (727 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 86 ms. (459 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 46 ms. (851 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 45 ms. (869 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 152480 steps, run timeout after 3001 ms. (steps per millisecond=50 ) properties seen :0 out of 4
Probabilistic random walk after 152480 steps, saw 33950 distinct states, run finished after 3001 ms. (steps per millisecond=50 ) properties seen :0
// Phase 1: matrix 4005 rows 1238 cols
[2024-05-31 20:36:01] [INFO ] Computed 32 invariants in 61 ms
[2024-05-31 20:36:01] [INFO ] State equation strengthened by 3675 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1139/1180 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1180 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 54/1234 variables, 27/30 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1234 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 2/1236 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1236 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 4005/5241 variables, 1236/1268 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/5241 variables, 3675/4943 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/5241 variables, 0/4943 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 2/5243 variables, 2/4945 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/5243 variables, 0/4945 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 0/5243 variables, 0/4945 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5243/5243 variables, and 4945 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2748 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1238/1238 constraints, ReadFeed: 3675/3675 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/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1139/1180 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-31 20:36:04] [INFO ] Deduced a trap composed of 2 places in 45 ms of which 2 ms to minimize.
[2024-05-31 20:36:04] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 1 ms to minimize.
[2024-05-31 20:36:04] [INFO ] Deduced a trap composed of 2 places in 40 ms of which 1 ms to minimize.
[2024-05-31 20:36:04] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 1 ms to minimize.
[2024-05-31 20:36:04] [INFO ] Deduced a trap composed of 2 places in 40 ms of which 1 ms to minimize.
[2024-05-31 20:36:04] [INFO ] Deduced a trap composed of 2 places in 54 ms of which 1 ms to minimize.
[2024-05-31 20:36:04] [INFO ] Deduced a trap composed of 2 places in 45 ms of which 1 ms to minimize.
[2024-05-31 20:36:04] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 1 ms to minimize.
[2024-05-31 20:36:04] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 0 ms to minimize.
[2024-05-31 20:36:04] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 0 ms to minimize.
[2024-05-31 20:36:05] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 1 ms to minimize.
[2024-05-31 20:36:05] [INFO ] Deduced a trap composed of 2 places in 39 ms of which 1 ms to minimize.
[2024-05-31 20:36:05] [INFO ] Deduced a trap composed of 2 places in 36 ms of which 1 ms to minimize.
[2024-05-31 20:36:05] [INFO ] Deduced a trap composed of 2 places in 36 ms of which 0 ms to minimize.
[2024-05-31 20:36:05] [INFO ] Deduced a trap composed of 2 places in 35 ms of which 1 ms to minimize.
[2024-05-31 20:36:05] [INFO ] Deduced a trap composed of 2 places in 36 ms of which 0 ms to minimize.
[2024-05-31 20:36:05] [INFO ] Deduced a trap composed of 2 places in 48 ms of which 1 ms to minimize.
[2024-05-31 20:36:05] [INFO ] Deduced a trap composed of 2 places in 35 ms of which 1 ms to minimize.
[2024-05-31 20:36:05] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 1 ms to minimize.
[2024-05-31 20:36:05] [INFO ] Deduced a trap composed of 2 places in 38 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1180 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1180 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 54/1234 variables, 27/50 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1234 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 2/1236 variables, 2/52 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-31 20:36:06] [INFO ] Deduced a trap composed of 35 places in 565 ms of which 6 ms to minimize.
[2024-05-31 20:36:06] [INFO ] Deduced a trap composed of 34 places in 95 ms of which 2 ms to minimize.
[2024-05-31 20:36:06] [INFO ] Deduced a trap composed of 34 places in 84 ms of which 2 ms to minimize.
[2024-05-31 20:36:06] [INFO ] Deduced a trap composed of 35 places in 74 ms of which 2 ms to minimize.
[2024-05-31 20:36:06] [INFO ] Deduced a trap composed of 35 places in 60 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1236 variables, 5/57 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1236 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 4005/5241 variables, 1236/1293 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/5241 variables, 3675/4968 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/5241 variables, 4/4972 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/5241 variables, 0/4972 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 2/5243 variables, 2/4974 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/5243 variables, 0/4974 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 0/5243 variables, 0/4974 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 5243/5243 variables, and 4974 constraints, problems are : Problem set: 0 solved, 4 unsolved in 18813 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1238/1238 constraints, ReadFeed: 3675/3675 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 25/25 constraints]
After SMT, in 21695ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 1553 ms.
Support contains 41 out of 1238 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1238/1238 places, 4005/4005 transitions.
Applied a total of 0 rules in 72 ms. Remains 1238 /1238 variables (removed 0) and now considering 4005/4005 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 1238/1238 places, 4005/4005 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1238/1238 places, 4005/4005 transitions.
Applied a total of 0 rules in 68 ms. Remains 1238 /1238 variables (removed 0) and now considering 4005/4005 (removed 0) transitions.
[2024-05-31 20:36:24] [INFO ] Invariant cache hit.
[2024-05-31 20:36:25] [INFO ] Implicit Places using invariants in 1037 ms returned []
[2024-05-31 20:36:25] [INFO ] Invariant cache hit.
[2024-05-31 20:36:26] [INFO ] State equation strengthened by 3675 read => feed constraints.
[2024-05-31 20:36:45] [INFO ] Implicit Places using invariants and state equation in 19350 ms returned []
Implicit Place search using SMT with State Equation took 20400 ms to find 0 implicit places.
[2024-05-31 20:36:45] [INFO ] Redundant transitions in 272 ms returned []
Running 3975 sub problems to find dead transitions.
[2024-05-31 20:36:45] [INFO ] Invariant cache hit.
[2024-05-31 20:36:45] [INFO ] State equation strengthened by 3675 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/1237 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 3975 unsolved
SMT process timed out in 33256ms, After SMT, problems are : Problem set: 0 solved, 3975 unsolved
Search for dead transitions found 0 dead transitions in 33300ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54072 ms. Remains : 1238/1238 places, 4005/4005 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 3514 edges and 1238 vertex of which 1044 / 1238 are part of one of the 2 SCC in 6 ms
Free SCC test removed 1042 places
Drop transitions (Empty/Sink Transition effects.) removed 2737 transitions
Ensure Unique test removed 883 transitions
Reduce isomorphic transitions removed 3620 transitions.
Graph (complete) has 570 edges and 196 vertex of which 113 are kept as prefixes of interest. Removing 83 places using SCC suffix rule.0 ms
Discarding 83 places :
Also discarding 25 output transitions
Drop transitions (Output transitions of discarded places.) removed 25 transitions
Drop transitions (Empty/Sink Transition effects.) removed 107 transitions
Reduce isomorphic transitions removed 107 transitions.
Iterating post reduction 0 with 107 rules applied. Total rules applied 109 place count 113 transition count 253
Discarding 49 places :
Symmetric choice reduction at 1 with 49 rule applications. Total rules 158 place count 64 transition count 179
Iterating global reduction 1 with 49 rules applied. Total rules applied 207 place count 64 transition count 179
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 230 place count 64 transition count 156
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 232 place count 63 transition count 155
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 233 place count 63 transition count 154
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 3 with 10 rules applied. Total rules applied 243 place count 63 transition count 144
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 244 place count 63 transition count 143
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 245 place count 62 transition count 143
Free-agglomeration rule applied 4 times with reduction of 1 identical transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 249 place count 62 transition count 138
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 254 place count 58 transition count 137
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 256 place count 58 transition count 135
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 260 place count 54 transition count 131
Applied a total of 260 rules in 33 ms. Remains 54 /1238 variables (removed 1184) and now considering 131/4005 (removed 3874) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 131 rows 54 cols
[2024-05-31 20:37:18] [INFO ] Computed 1 invariants in 0 ms
[2024-05-31 20:37:18] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-31 20:37:18] [INFO ] After 60ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-31 20:37:18] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-31 20:37:18] [INFO ] After 45ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
[2024-05-31 20:37:18] [INFO ] After 89ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2024-05-31 20:37:19] [INFO ] After 170ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Over-approximation ignoring read arcs solved 0 properties in 333 ms.
[2024-05-31 20:37:19] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 7 ms.
[2024-05-31 20:37:19] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1238 places, 4005 transitions and 15766 arcs took 21 ms.
[2024-05-31 20:37:19] [INFO ] Flatten gal took : 263 ms
Total runtime 160256 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=
[--mu-opt] [--saturation=
[--sat-granularity=
[--guidance=
[--action=
[--trace=
[--mu=
[--ctl=
[--save-levels=STRING] [--pg-solve] [--attr=
[--saturating-attractor] [--write-strategy=
[--check-strategy] [--interactive-play] [--player]
[--pg-write=
[--edge-label=
[--mucalc=
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por=
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=
[--cw-max-cols=
[--mh-timeout=
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=
[--ldd32-cache=
[--cache-ratio=
[--min-free-nodes=
[--fdd-reorder=
[--vset-cache-diff=
[--next-union] [--peak-nodes] [--maxsum=
[--block-size=
[--debug=
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS]
Could not compute solution for formula : CANInsertWithFailure-PT-030-ReachabilityCardinality-2023-05
Could not compute solution for formula : CANInsertWithFailure-PT-030-ReachabilityCardinality-2024-06
Could not compute solution for formula : CANInsertWithFailure-PT-030-ReachabilityCardinality-2023-07
Could not compute solution for formula : CANInsertWithFailure-PT-030-ReachabilityCardinality-2023-08
BK_STOP 1717187839838
--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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 CANInsertWithFailure-PT-030-ReachabilityCardinality-2023-05
rfs formula type AG
rfs formula formula --invariant=/tmp/826/inv_0_
rfs formula name CANInsertWithFailure-PT-030-ReachabilityCardinality-2024-06
rfs formula type AG
rfs formula formula --invariant=/tmp/826/inv_1_
rfs formula name CANInsertWithFailure-PT-030-ReachabilityCardinality-2023-07
rfs formula type AG
rfs formula formula --invariant=/tmp/826/inv_2_
rfs formula name CANInsertWithFailure-PT-030-ReachabilityCardinality-2023-08
rfs formula type AG
rfs formula formula --invariant=/tmp/826/inv_3_
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="CANInsertWithFailure-PT-030"
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 CANInsertWithFailure-PT-030, 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 r476-tall-171620505200118"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CANInsertWithFailure-PT-030.tgz
mv CANInsertWithFailure-PT-030 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 '
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 ;