Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r472-tajo-171620399500422.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.........................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is BugTracking-PT-q8m032, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r472-tajo-171620399500422
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 9.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 19 15:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 106K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 41K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 19 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K 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 7 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 16M 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 BugTracking-PT-q8m032-ReachabilityCardinality-2024-00
FORMULA_NAME BugTracking-PT-q8m032-ReachabilityCardinality-2024-01
FORMULA_NAME BugTracking-PT-q8m032-ReachabilityCardinality-2024-02
FORMULA_NAME BugTracking-PT-q8m032-ReachabilityCardinality-2024-03
FORMULA_NAME BugTracking-PT-q8m032-ReachabilityCardinality-2024-04
FORMULA_NAME BugTracking-PT-q8m032-ReachabilityCardinality-2024-05
FORMULA_NAME BugTracking-PT-q8m032-ReachabilityCardinality-2023-06
FORMULA_NAME BugTracking-PT-q8m032-ReachabilityCardinality-2024-07
FORMULA_NAME BugTracking-PT-q8m032-ReachabilityCardinality-2024-08
FORMULA_NAME BugTracking-PT-q8m032-ReachabilityCardinality-2023-09
FORMULA_NAME BugTracking-PT-q8m032-ReachabilityCardinality-2023-10
FORMULA_NAME BugTracking-PT-q8m032-ReachabilityCardinality-2024-11
FORMULA_NAME BugTracking-PT-q8m032-ReachabilityCardinality-2024-12
FORMULA_NAME BugTracking-PT-q8m032-ReachabilityCardinality-2024-13
FORMULA_NAME BugTracking-PT-q8m032-ReachabilityCardinality-2024-14
FORMULA_NAME BugTracking-PT-q8m032-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717224422112

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BugTracking-PT-q8m032
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 06:47:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 06:47:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 06:47:05] [INFO ] Load time of PNML (sax parser for PT used): 1444 ms
[2024-06-01 06:47:05] [INFO ] Transformed 754 places.
[2024-06-01 06:47:05] [INFO ] Transformed 27370 transitions.
[2024-06-01 06:47:05] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 1739 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 22 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 474 places in 142 ms
Reduce places removed 474 places and 23466 transitions.
FORMULA BugTracking-PT-q8m032-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m032-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m032-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m032-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m032-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m032-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (61 resets) in 3208 ms. (12 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (12 resets) in 185 ms. (215 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (12 resets) in 296 ms. (134 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (11 resets) in 161 ms. (246 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (12 resets) in 278 ms. (143 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (12 resets) in 350 ms. (113 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (12 resets) in 184 ms. (216 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (11 resets) in 278 ms. (143 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (13 resets) in 305 ms. (130 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (14 resets) in 158 ms. (251 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (16 resets) in 282 ms. (141 steps per ms) remains 10/10 properties
Interrupted probabilistic random walk after 172230 steps, run timeout after 6001 ms. (steps per millisecond=28 ) properties seen :0 out of 10
Probabilistic random walk after 172230 steps, saw 87701 distinct states, run finished after 6006 ms. (steps per millisecond=28 ) properties seen :0
[2024-06-01 06:47:14] [INFO ] Flow matrix only has 3729 transitions (discarded 175 similar events)
// Phase 1: matrix 3729 rows 280 cols
[2024-06-01 06:47:14] [INFO ] Computed 10 invariants in 47 ms
[2024-06-01 06:47:14] [INFO ] State equation strengthened by 303 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem BugTracking-PT-q8m032-ReachabilityCardinality-2024-03 is UNSAT
FORMULA BugTracking-PT-q8m032-ReachabilityCardinality-2024-03 FALSE TECHNIQUES SMT_REFINEMENT
Problem BugTracking-PT-q8m032-ReachabilityCardinality-2024-04 is UNSAT
FORMULA BugTracking-PT-q8m032-ReachabilityCardinality-2024-04 FALSE TECHNIQUES SMT_REFINEMENT
Problem BugTracking-PT-q8m032-ReachabilityCardinality-2024-07 is UNSAT
FORMULA BugTracking-PT-q8m032-ReachabilityCardinality-2024-07 FALSE TECHNIQUES SMT_REFINEMENT
Problem BugTracking-PT-q8m032-ReachabilityCardinality-2024-14 is UNSAT
FORMULA BugTracking-PT-q8m032-ReachabilityCardinality-2024-14 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 123/146 variables, 7/7 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 0/7 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 3482/3628 variables, 146/153 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3628 variables, 71/224 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3628 variables, 0/224 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 379/4007 variables, 132/356 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4007 variables, 1/357 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/4007 variables, 232/589 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4007 variables, 0/589 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 2/4009 variables, 2/591 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4009 variables, 2/593 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4009 variables, 0/593 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 0/4009 variables, 0/593 constraints. Problems are: Problem set: 4 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4009/4009 variables, and 593 constraints, problems are : Problem set: 4 solved, 6 unsolved in 3707 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 280/280 constraints, ReadFeed: 303/303 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 109/121 variables, 6/6 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 0/6 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 2984/3105 variables, 121/127 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3105 variables, 70/197 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3105 variables, 0/197 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 879/3984 variables, 135/332 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3984 variables, 1/333 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3984 variables, 232/565 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3984 variables, 6/571 constraints. Problems are: Problem set: 4 solved, 6 unsolved
[2024-06-01 06:47:21] [INFO ] Deduced a trap composed of 67 places in 909 ms of which 47 ms to minimize.
[2024-06-01 06:47:21] [INFO ] Deduced a trap composed of 67 places in 617 ms of which 2 ms to minimize.
[2024-06-01 06:47:22] [INFO ] Deduced a trap composed of 11 places in 191 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/3984 variables, 3/574 constraints. Problems are: Problem set: 4 solved, 6 unsolved
[2024-06-01 06:47:23] [INFO ] Deduced a trap composed of 37 places in 375 ms of which 3 ms to minimize.
SMT process timed out in 9256ms, After SMT, problems are : Problem set: 4 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 12 out of 280 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 280/280 places, 3904/3904 transitions.
Graph (complete) has 4653 edges and 280 vertex of which 278 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.14 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 277 transition count 3871
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 277 transition count 3871
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 7 place count 275 transition count 3877
Free-agglomeration rule applied 4 times.
Iterating global reduction 0 with 4 rules applied. Total rules applied 11 place count 275 transition count 3873
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 15 place count 271 transition count 3873
Applied a total of 15 rules in 359 ms. Remains 271 /280 variables (removed 9) and now considering 3873/3904 (removed 31) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 372 ms. Remains : 271/280 places, 3873/3904 transitions.
RANDOM walk for 40031 steps (71 resets) in 746 ms. (53 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (12 resets) in 137 ms. (289 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (15 resets) in 219 ms. (181 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (10 resets) in 198 ms. (201 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (14 resets) in 147 ms. (270 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (13 resets) in 137 ms. (289 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (12 resets) in 152 ms. (261 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 105215 steps, run timeout after 3001 ms. (steps per millisecond=35 ) properties seen :0 out of 6
Probabilistic random walk after 105215 steps, saw 53629 distinct states, run finished after 3001 ms. (steps per millisecond=35 ) properties seen :0
[2024-06-01 06:47:27] [INFO ] Flow matrix only has 3701 transitions (discarded 172 similar events)
// Phase 1: matrix 3701 rows 271 cols
[2024-06-01 06:47:27] [INFO ] Computed 8 invariants in 35 ms
[2024-06-01 06:47:27] [INFO ] State equation strengthened by 283 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 102/114 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 2956/3070 variables, 114/119 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3070 variables, 45/164 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3070 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 882/3952 variables, 137/301 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3952 variables, 2/303 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3952 variables, 238/541 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3952 variables, 0/541 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 1/3953 variables, 1/542 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3953 variables, 1/543 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3953 variables, 0/543 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 19/3972 variables, 19/562 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3972 variables, 0/562 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 0/3972 variables, 0/562 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3972/3972 variables, and 562 constraints, problems are : Problem set: 0 solved, 6 unsolved in 2716 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 271/271 constraints, ReadFeed: 283/283 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 102/114 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 2956/3070 variables, 114/119 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3070 variables, 45/164 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3070 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 882/3952 variables, 137/301 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3952 variables, 2/303 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3952 variables, 238/541 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3952 variables, 6/547 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 06:47:32] [INFO ] Deduced a trap composed of 23 places in 420 ms of which 2 ms to minimize.
[2024-06-01 06:47:33] [INFO ] Deduced a trap composed of 61 places in 386 ms of which 1 ms to minimize.
[2024-06-01 06:47:33] [INFO ] Deduced a trap composed of 75 places in 448 ms of which 3 ms to minimize.
[2024-06-01 06:47:34] [INFO ] Deduced a trap composed of 76 places in 421 ms of which 3 ms to minimize.
[2024-06-01 06:47:34] [INFO ] Deduced a trap composed of 76 places in 444 ms of which 2 ms to minimize.
[2024-06-01 06:47:35] [INFO ] Deduced a trap composed of 10 places in 768 ms of which 1 ms to minimize.
[2024-06-01 06:47:36] [INFO ] Deduced a trap composed of 62 places in 460 ms of which 2 ms to minimize.
[2024-06-01 06:47:36] [INFO ] Deduced a trap composed of 14 places in 727 ms of which 1 ms to minimize.
[2024-06-01 06:47:37] [INFO ] Deduced a trap composed of 67 places in 400 ms of which 3 ms to minimize.
[2024-06-01 06:47:38] [INFO ] Deduced a trap composed of 65 places in 562 ms of which 2 ms to minimize.
[2024-06-01 06:47:38] [INFO ] Deduced a trap composed of 67 places in 385 ms of which 1 ms to minimize.
Problem BugTracking-PT-q8m032-ReachabilityCardinality-2023-10 is UNSAT
FORMULA BugTracking-PT-q8m032-ReachabilityCardinality-2023-10 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 10 (INCLUDED_ONLY) 0/3952 variables, 11/558 constraints. Problems are: Problem set: 1 solved, 5 unsolved
[2024-06-01 06:47:39] [INFO ] Deduced a trap composed of 26 places in 151 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/3952 variables, 1/559 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3952 variables, 0/559 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 1/3953 variables, 1/560 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3953 variables, 1/561 constraints. Problems are: Problem set: 1 solved, 5 unsolved
[2024-06-01 06:47:41] [INFO ] Deduced a trap composed of 8 places in 191 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/3953 variables, 1/562 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3953 variables, 0/562 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 19/3972 variables, 19/581 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3972 variables, 0/581 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 19 (OVERLAPS) 0/3972 variables, 0/581 constraints. Problems are: Problem set: 1 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3972/3972 variables, and 581 constraints, problems are : Problem set: 1 solved, 5 unsolved in 13094 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 271/271 constraints, ReadFeed: 283/283 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 13/13 constraints]
After SMT, in 15921ms problems are : Problem set: 1 solved, 5 unsolved
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 14003 ms.
Support contains 11 out of 271 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 271/271 places, 3873/3873 transitions.
Applied a total of 0 rules in 162 ms. Remains 271 /271 variables (removed 0) and now considering 3873/3873 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 162 ms. Remains : 271/271 places, 3873/3873 transitions.
RANDOM walk for 40026 steps (70 resets) in 378 ms. (105 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (12 resets) in 132 ms. (300 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (11 resets) in 197 ms. (202 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (12 resets) in 272 ms. (146 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (13 resets) in 149 ms. (266 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (12 resets) in 167 ms. (238 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 97492 steps, run timeout after 3001 ms. (steps per millisecond=32 ) properties seen :0 out of 5
Probabilistic random walk after 97492 steps, saw 49602 distinct states, run finished after 3004 ms. (steps per millisecond=32 ) properties seen :0
[2024-06-01 06:48:01] [INFO ] Flow matrix only has 3701 transitions (discarded 172 similar events)
[2024-06-01 06:48:01] [INFO ] Invariant cache hit.
[2024-06-01 06:48:01] [INFO ] State equation strengthened by 283 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 103/114 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 2956/3070 variables, 114/119 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3070 variables, 45/164 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3070 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 882/3952 variables, 137/301 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3952 variables, 2/303 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3952 variables, 238/541 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3952 variables, 0/541 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 1/3953 variables, 1/542 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3953 variables, 1/543 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3953 variables, 0/543 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 19/3972 variables, 19/562 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3972 variables, 0/562 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 0/3972 variables, 0/562 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3972/3972 variables, and 562 constraints, problems are : Problem set: 0 solved, 5 unsolved in 2130 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 271/271 constraints, ReadFeed: 283/283 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/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 103/114 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 2956/3070 variables, 114/119 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3070 variables, 45/164 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3070 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 882/3952 variables, 137/301 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3952 variables, 2/303 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3952 variables, 238/541 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3952 variables, 5/546 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 06:48:06] [INFO ] Deduced a trap composed of 10 places in 852 ms of which 2 ms to minimize.
[2024-06-01 06:48:06] [INFO ] Deduced a trap composed of 15 places in 470 ms of which 2 ms to minimize.
[2024-06-01 06:48:06] [INFO ] Deduced a trap composed of 66 places in 368 ms of which 2 ms to minimize.
[2024-06-01 06:48:07] [INFO ] Deduced a trap composed of 24 places in 558 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/3952 variables, 4/550 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3952 variables, 0/550 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 1/3953 variables, 1/551 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3953 variables, 1/552 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 06:48:10] [INFO ] Deduced a trap composed of 16 places in 594 ms of which 2 ms to minimize.
[2024-06-01 06:48:11] [INFO ] Deduced a trap composed of 8 places in 787 ms of which 1 ms to minimize.
[2024-06-01 06:48:11] [INFO ] Deduced a trap composed of 72 places in 392 ms of which 2 ms to minimize.
[2024-06-01 06:48:11] [INFO ] Deduced a trap composed of 61 places in 428 ms of which 2 ms to minimize.
[2024-06-01 06:48:12] [INFO ] Deduced a trap composed of 72 places in 459 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/3953 variables, 5/557 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 06:48:13] [INFO ] Deduced a trap composed of 67 places in 480 ms of which 1 ms to minimize.
[2024-06-01 06:48:13] [INFO ] Deduced a trap composed of 73 places in 393 ms of which 2 ms to minimize.
[2024-06-01 06:48:14] [INFO ] Deduced a trap composed of 23 places in 128 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/3953 variables, 3/560 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3953 variables, 0/560 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 19/3972 variables, 19/579 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3972 variables, 0/579 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 06:48:16] [INFO ] Deduced a trap composed of 70 places in 454 ms of which 2 ms to minimize.
At refinement iteration 19 (OVERLAPS) 0/3972 variables, 1/580 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3972 variables, 0/580 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (OVERLAPS) 0/3972 variables, 0/580 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3972/3972 variables, and 580 constraints, problems are : Problem set: 0 solved, 5 unsolved in 15483 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 271/271 constraints, ReadFeed: 283/283 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 13/13 constraints]
After SMT, in 17683ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 21036 ms.
Support contains 11 out of 271 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 271/271 places, 3873/3873 transitions.
Applied a total of 0 rules in 83 ms. Remains 271 /271 variables (removed 0) and now considering 3873/3873 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 96 ms. Remains : 271/271 places, 3873/3873 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 271/271 places, 3873/3873 transitions.
Applied a total of 0 rules in 68 ms. Remains 271 /271 variables (removed 0) and now considering 3873/3873 (removed 0) transitions.
[2024-06-01 06:48:40] [INFO ] Flow matrix only has 3701 transitions (discarded 172 similar events)
[2024-06-01 06:48:40] [INFO ] Invariant cache hit.
[2024-06-01 06:48:41] [INFO ] Implicit Places using invariants in 1188 ms returned []
[2024-06-01 06:48:41] [INFO ] Flow matrix only has 3701 transitions (discarded 172 similar events)
[2024-06-01 06:48:41] [INFO ] Invariant cache hit.
[2024-06-01 06:48:42] [INFO ] State equation strengthened by 283 read => feed constraints.
[2024-06-01 06:48:45] [INFO ] Implicit Places using invariants and state equation in 3800 ms returned []
Implicit Place search using SMT with State Equation took 5020 ms to find 0 implicit places.
[2024-06-01 06:48:45] [INFO ] Redundant transitions in 294 ms returned []
Running 3871 sub problems to find dead transitions.
[2024-06-01 06:48:45] [INFO ] Flow matrix only has 3701 transitions (discarded 172 similar events)
[2024-06-01 06:48:45] [INFO ] Invariant cache hit.
[2024-06-01 06:48:45] [INFO ] State equation strengthened by 283 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/270 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3871 unsolved
[2024-06-01 06:50:04] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 1 ms to minimize.
Problem TDEAD782 is UNSAT
[2024-06-01 06:50:04] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 0 ms to minimize.
Problem TDEAD783 is UNSAT
Problem TDEAD784 is UNSAT
Problem TDEAD785 is UNSAT
Problem TDEAD786 is UNSAT
Problem TDEAD787 is UNSAT
Problem TDEAD788 is UNSAT
Problem TDEAD791 is UNSAT
Problem TDEAD792 is UNSAT
Problem TDEAD793 is UNSAT
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 0.0)
(s6 0.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 1.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 1.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 1.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 1.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 1.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 1.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 270/3972 variables, and 10 constraints, problems are : Problem set: 10 solved, 3861 unsolved in 30151 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/271 constraints, ReadFeed: 0/283 constraints, PredecessorRefiner: 3871/2668 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 10 solved, 3861 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/270 variables, 8/8 constraints. Problems are: Problem set: 10 solved, 3861 unsolved
Problem TDEAD3799 is UNSAT
Problem TDEAD3805 is UNSAT
Problem TDEAD3811 is UNSAT
Problem TDEAD3817 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/270 variables, 2/10 constraints. Problems are: Problem set: 14 solved, 3857 unsolved
[2024-06-01 06:50:32] [INFO ] Deduced a trap composed of 7 places in 117 ms of which 1 ms to minimize.
Problem TDEAD2670 is UNSAT
Problem TDEAD2671 is UNSAT
Problem TDEAD2672 is UNSAT
Problem TDEAD2673 is UNSAT
Problem TDEAD2674 is UNSAT
Problem TDEAD2675 is UNSAT
Problem TDEAD2676 is UNSAT
Problem TDEAD2677 is UNSAT
Problem TDEAD2678 is UNSAT
Problem TDEAD2679 is UNSAT
Problem TDEAD2680 is UNSAT
Problem TDEAD2681 is UNSAT
Problem TDEAD2682 is UNSAT
Problem TDEAD2683 is UNSAT
Problem TDEAD2684 is UNSAT
Problem TDEAD2685 is UNSAT
Problem TDEAD2686 is UNSAT
Problem TDEAD2687 is UNSAT
Problem TDEAD2688 is UNSAT
Problem TDEAD2689 is UNSAT
Problem TDEAD2690 is UNSAT
[2024-06-01 06:50:32] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 1 ms to minimize.
Problem TDEAD2691 is UNSAT
[2024-06-01 06:50:33] [INFO ] Deduced a trap composed of 23 places in 89 ms of which 5 ms to minimize.
Problem TDEAD2695 is UNSAT
[2024-06-01 06:50:33] [INFO ] Deduced a trap composed of 10 places in 100 ms of which 1 ms to minimize.
Problem TDEAD2696 is UNSAT
Problem TDEAD2697 is UNSAT
Problem TDEAD2698 is UNSAT
Problem TDEAD2699 is UNSAT
Problem TDEAD2700 is UNSAT
Problem TDEAD2701 is UNSAT
Problem TDEAD2702 is UNSAT
Problem TDEAD2703 is UNSAT
Problem TDEAD2704 is UNSAT
Problem TDEAD2708 is UNSAT
Problem TDEAD2709 is UNSAT
Problem TDEAD2710 is UNSAT
Problem TDEAD2711 is UNSAT
Problem TDEAD2712 is UNSAT
Problem TDEAD2713 is UNSAT
Problem TDEAD2714 is UNSAT
Problem TDEAD2715 is UNSAT
Problem TDEAD2716 is UNSAT
Problem TDEAD2717 is UNSAT
[2024-06-01 06:50:33] [INFO ] Deduced a trap composed of 7 places in 95 ms of which 1 ms to minimize.
Problem TDEAD2718 is UNSAT
Problem TDEAD2719 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 270/3972 variables, and 15 constraints, problems are : Problem set: 58 solved, 3813 unsolved in 30058 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/271 constraints, ReadFeed: 0/283 constraints, PredecessorRefiner: 1203/2668 constraints, Known Traps: 7/7 constraints]
After SMT, in 111032ms problems are : Problem set: 58 solved, 3813 unsolved
Search for dead transitions found 58 dead transitions in 111131ms
Found 58 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 58 transitions
Dead transitions reduction (with SMT) removed 58 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 271/271 places, 3815/3873 transitions.
Reduce places removed 15 places and 525 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 256 transition count 3290
Reduce places removed 10 places and 280 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 25 place count 246 transition count 3010
Reduce places removed 12 places and 338 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 37 place count 234 transition count 2672
Reduce places removed 8 places and 185 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 45 place count 226 transition count 2487
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 46 place count 225 transition count 2467
Deduced a syphon composed of 1 places in 2 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 47 place count 225 transition count 2467
Deduced a syphon composed of 1 places in 1 ms
Applied a total of 47 rules in 67 ms. Remains 225 /271 variables (removed 46) and now considering 2467/3815 (removed 1348) transitions.
[2024-06-01 06:50:36] [INFO ] Flow matrix only has 2356 transitions (discarded 111 similar events)
// Phase 1: matrix 2356 rows 225 cols
[2024-06-01 06:50:36] [INFO ] Computed 9 invariants in 9 ms
[2024-06-01 06:50:37] [INFO ] Implicit Places using invariants in 405 ms returned []
[2024-06-01 06:50:37] [INFO ] Flow matrix only has 2356 transitions (discarded 111 similar events)
[2024-06-01 06:50:37] [INFO ] Invariant cache hit.
[2024-06-01 06:50:37] [INFO ] State equation strengthened by 211 read => feed constraints.
[2024-06-01 06:50:38] [INFO ] Implicit Places using invariants and state equation in 1265 ms returned []
Implicit Place search using SMT with State Equation took 1682 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 225/271 places, 2467/3873 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 118339 ms. Remains : 225/271 places, 2467/3873 transitions.
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
RANDOM walk for 40017 steps (82 resets) in 292 ms. (136 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (12 resets) in 51 ms. (769 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (13 resets) in 60 ms. (655 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (13 resets) in 79 ms. (500 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (13 resets) in 60 ms. (655 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (41 resets) in 91 ms. (434 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 141521 steps, run timeout after 3001 ms. (steps per millisecond=47 ) properties seen :0 out of 5
Probabilistic random walk after 141521 steps, saw 72072 distinct states, run finished after 3004 ms. (steps per millisecond=47 ) properties seen :0
[2024-06-01 06:50:41] [INFO ] Flow matrix only has 2356 transitions (discarded 111 similar events)
// Phase 1: matrix 2356 rows 224 cols
[2024-06-01 06:50:41] [INFO ] Computed 8 invariants in 15 ms
[2024-06-01 06:50:41] [INFO ] State equation strengthened by 211 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem BugTracking-PT-q8m032-ReachabilityCardinality-2023-09 is UNSAT
FORMULA BugTracking-PT-q8m032-ReachabilityCardinality-2023-09 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 74/82 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1701/1783 variables, 82/86 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1783 variables, 38/124 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1783 variables, 0/124 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 777/2560 variables, 122/246 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2560 variables, 3/249 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2560 variables, 173/422 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2560 variables, 0/422 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 2/2562 variables, 1/423 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2562 variables, 2/425 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2562 variables, 0/425 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 18/2580 variables, 18/443 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2580 variables, 0/443 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 0/2580 variables, 0/443 constraints. Problems are: Problem set: 1 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2580/2580 variables, and 443 constraints, problems are : Problem set: 1 solved, 4 unsolved in 1180 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 224/224 constraints, ReadFeed: 211/211 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 75/82 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1701/1783 variables, 82/86 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1783 variables, 38/124 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1783 variables, 0/124 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 777/2560 variables, 122/246 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2560 variables, 3/249 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2560 variables, 173/422 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2560 variables, 4/426 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-06-01 06:50:43] [INFO ] Deduced a trap composed of 13 places in 246 ms of which 1 ms to minimize.
[2024-06-01 06:50:44] [INFO ] Deduced a trap composed of 9 places in 282 ms of which 1 ms to minimize.
[2024-06-01 06:50:44] [INFO ] Deduced a trap composed of 56 places in 236 ms of which 3 ms to minimize.
[2024-06-01 06:50:44] [INFO ] Deduced a trap composed of 55 places in 250 ms of which 1 ms to minimize.
[2024-06-01 06:50:45] [INFO ] Deduced a trap composed of 54 places in 212 ms of which 2 ms to minimize.
[2024-06-01 06:50:45] [INFO ] Deduced a trap composed of 44 places in 243 ms of which 1 ms to minimize.
[2024-06-01 06:50:45] [INFO ] Deduced a trap composed of 66 places in 233 ms of which 2 ms to minimize.
[2024-06-01 06:50:45] [INFO ] Deduced a trap composed of 65 places in 216 ms of which 1 ms to minimize.
[2024-06-01 06:50:46] [INFO ] Deduced a trap composed of 67 places in 213 ms of which 1 ms to minimize.
[2024-06-01 06:50:46] [INFO ] Deduced a trap composed of 67 places in 226 ms of which 1 ms to minimize.
[2024-06-01 06:50:46] [INFO ] Deduced a trap composed of 79 places in 224 ms of which 2 ms to minimize.
[2024-06-01 06:50:46] [INFO ] Deduced a trap composed of 77 places in 212 ms of which 2 ms to minimize.
[2024-06-01 06:50:47] [INFO ] Deduced a trap composed of 13 places in 227 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/2560 variables, 13/439 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-06-01 06:50:47] [INFO ] Deduced a trap composed of 27 places in 132 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/2560 variables, 1/440 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2560 variables, 0/440 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 2/2562 variables, 1/441 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2562 variables, 2/443 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2562 variables, 0/443 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 18/2580 variables, 18/461 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2580 variables, 0/461 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 0/2580 variables, 0/461 constraints. Problems are: Problem set: 1 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2580/2580 variables, and 461 constraints, problems are : Problem set: 1 solved, 4 unsolved in 5873 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 224/224 constraints, ReadFeed: 211/211 constraints, PredecessorRefiner: 4/5 constraints, Known Traps: 14/14 constraints]
After SMT, in 7094ms problems are : Problem set: 1 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 3124 ms.
Support contains 7 out of 224 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 224/224 places, 2467/2467 transitions.
Applied a total of 0 rules in 30 ms. Remains 224 /224 variables (removed 0) and now considering 2467/2467 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 224/224 places, 2467/2467 transitions.
RANDOM walk for 40000 steps (72 resets) in 225 ms. (176 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (12 resets) in 71 ms. (555 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (10 resets) in 77 ms. (512 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (12 resets) in 75 ms. (526 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (13 resets) in 50 ms. (784 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 156959 steps, run timeout after 3001 ms. (steps per millisecond=52 ) properties seen :0 out of 4
Probabilistic random walk after 156959 steps, saw 79868 distinct states, run finished after 3001 ms. (steps per millisecond=52 ) properties seen :0
[2024-06-01 06:50:55] [INFO ] Flow matrix only has 2356 transitions (discarded 111 similar events)
[2024-06-01 06:50:55] [INFO ] Invariant cache hit.
[2024-06-01 06:50:55] [INFO ] State equation strengthened by 211 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 75/82 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1701/1783 variables, 82/86 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1783 variables, 38/124 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1783 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 777/2560 variables, 122/246 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2560 variables, 3/249 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2560 variables, 173/422 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2560 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 2/2562 variables, 1/423 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2562 variables, 2/425 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2562 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 18/2580 variables, 18/443 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2580 variables, 0/443 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 0/2580 variables, 0/443 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2580/2580 variables, and 443 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1135 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 224/224 constraints, ReadFeed: 211/211 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/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 75/82 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1701/1783 variables, 82/86 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1783 variables, 38/124 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1783 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 777/2560 variables, 122/246 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2560 variables, 3/249 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2560 variables, 173/422 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2560 variables, 4/426 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 06:50:57] [INFO ] Deduced a trap composed of 4 places in 328 ms of which 2 ms to minimize.
[2024-06-01 06:50:58] [INFO ] Deduced a trap composed of 27 places in 233 ms of which 1 ms to minimize.
[2024-06-01 06:50:58] [INFO ] Deduced a trap composed of 25 places in 220 ms of which 1 ms to minimize.
[2024-06-01 06:50:58] [INFO ] Deduced a trap composed of 57 places in 188 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/2560 variables, 4/430 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2560 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 2/2562 variables, 1/431 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2562 variables, 2/433 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 06:50:59] [INFO ] Deduced a trap composed of 8 places in 109 ms of which 4 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/2562 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2562 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 18/2580 variables, 18/452 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 06:51:00] [INFO ] Deduced a trap composed of 13 places in 290 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/2580 variables, 1/453 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2580 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 0/2580 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2580/2580 variables, and 453 constraints, problems are : Problem set: 0 solved, 4 unsolved in 4882 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 224/224 constraints, ReadFeed: 211/211 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 6/6 constraints]
After SMT, in 6062ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 3840 ms.
Support contains 7 out of 224 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 224/224 places, 2467/2467 transitions.
Applied a total of 0 rules in 73 ms. Remains 224 /224 variables (removed 0) and now considering 2467/2467 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 75 ms. Remains : 224/224 places, 2467/2467 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 224/224 places, 2467/2467 transitions.
Applied a total of 0 rules in 56 ms. Remains 224 /224 variables (removed 0) and now considering 2467/2467 (removed 0) transitions.
[2024-06-01 06:51:05] [INFO ] Flow matrix only has 2356 transitions (discarded 111 similar events)
[2024-06-01 06:51:05] [INFO ] Invariant cache hit.
[2024-06-01 06:51:05] [INFO ] Implicit Places using invariants in 311 ms returned []
[2024-06-01 06:51:05] [INFO ] Flow matrix only has 2356 transitions (discarded 111 similar events)
[2024-06-01 06:51:05] [INFO ] Invariant cache hit.
[2024-06-01 06:51:05] [INFO ] State equation strengthened by 211 read => feed constraints.
[2024-06-01 06:51:06] [INFO ] Implicit Places using invariants and state equation in 1443 ms returned []
Implicit Place search using SMT with State Equation took 1757 ms to find 0 implicit places.
[2024-06-01 06:51:07] [INFO ] Redundant transitions in 56 ms returned []
Running 2465 sub problems to find dead transitions.
[2024-06-01 06:51:07] [INFO ] Flow matrix only has 2356 transitions (discarded 111 similar events)
[2024-06-01 06:51:07] [INFO ] Invariant cache hit.
[2024-06-01 06:51:07] [INFO ] State equation strengthened by 211 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/223 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2465 unsolved
[2024-06-01 06:51:52] [INFO ] Deduced a trap composed of 9 places in 106 ms of which 1 ms to minimize.
Problem TDEAD2275 is UNSAT
Problem TDEAD2276 is UNSAT
Problem TDEAD2277 is UNSAT
Problem TDEAD2278 is UNSAT
Problem TDEAD2279 is UNSAT
Problem TDEAD2280 is UNSAT
Problem TDEAD2281 is UNSAT
Problem TDEAD2282 is UNSAT
Problem TDEAD2283 is UNSAT
Problem TDEAD2284 is UNSAT
Problem TDEAD2285 is UNSAT
Problem TDEAD2286 is UNSAT
Problem TDEAD2287 is UNSAT
Problem TDEAD2288 is UNSAT
Problem TDEAD2289 is UNSAT
Problem TDEAD2290 is UNSAT
Problem TDEAD2291 is UNSAT
Problem TDEAD2292 is UNSAT
Problem TDEAD2293 is UNSAT
Problem TDEAD2294 is UNSAT
Problem TDEAD2295 is UNSAT
Problem TDEAD2296 is UNSAT
[2024-06-01 06:51:52] [INFO ] Deduced a trap composed of 12 places in 85 ms of which 1 ms to minimize.
Problem TDEAD2300 is UNSAT
Problem TDEAD2301 is UNSAT
[2024-06-01 06:51:52] [INFO ] Deduced a trap composed of 12 places in 90 ms of which 1 ms to minimize.
Problem TDEAD2302 is UNSAT
Problem TDEAD2303 is UNSAT
Problem TDEAD2304 is UNSAT
Problem TDEAD2305 is UNSAT
Problem TDEAD2306 is UNSAT
Problem TDEAD2307 is UNSAT
Problem TDEAD2308 is UNSAT
Problem TDEAD2309 is UNSAT
Problem TDEAD2310 is UNSAT
Problem TDEAD2311 is UNSAT
Problem TDEAD2312 is UNSAT
Problem TDEAD2313 is UNSAT
Problem TDEAD2314 is UNSAT
Problem TDEAD2315 is UNSAT
Problem TDEAD2316 is UNSAT
Problem TDEAD2317 is UNSAT
Problem TDEAD2318 is UNSAT
Problem TDEAD2319 is UNSAT
[2024-06-01 06:51:52] [INFO ] Deduced a trap composed of 10 places in 79 ms of which 1 ms to minimize.
Problem TDEAD2322 is UNSAT
[2024-06-01 06:51:52] [INFO ] Deduced a trap composed of 11 places in 99 ms of which 1 ms to minimize.
Problem TDEAD2324 is UNSAT
Problem TDEAD2325 is UNSAT
Problem TDEAD2326 is UNSAT
Problem TDEAD2327 is UNSAT
Problem TDEAD2328 is UNSAT
[2024-06-01 06:51:52] [INFO ] Deduced a trap composed of 15 places in 104 ms of which 0 ms to minimize.
Problem TDEAD2329 is UNSAT
Problem TDEAD2330 is UNSAT
Problem TDEAD2331 is UNSAT
Problem TDEAD2332 is UNSAT
Problem TDEAD2333 is UNSAT
Problem TDEAD2338 is UNSAT
Problem TDEAD2339 is UNSAT
Problem TDEAD2340 is UNSAT
Problem TDEAD2341 is UNSAT
Problem TDEAD2342 is UNSAT
Problem TDEAD2343 is UNSAT
Problem TDEAD2344 is UNSAT
Problem TDEAD2345 is UNSAT
Problem TDEAD2346 is UNSAT
[2024-06-01 06:51:52] [INFO ] Deduced a trap composed of 24 places in 99 ms of which 2 ms to minimize.
Problem TDEAD2347 is UNSAT
[2024-06-01 06:51:52] [INFO ] Deduced a trap composed of 12 places in 104 ms of which 1 ms to minimize.
Problem TDEAD2348 is UNSAT
Problem TDEAD2349 is UNSAT
Problem TDEAD2350 is UNSAT
[2024-06-01 06:51:52] [INFO ] Deduced a trap composed of 14 places in 88 ms of which 0 ms to minimize.
Problem TDEAD2354 is UNSAT
Problem TDEAD2355 is UNSAT
Problem TDEAD2356 is UNSAT
Problem TDEAD2357 is UNSAT
Problem TDEAD2358 is UNSAT
Problem TDEAD2359 is UNSAT
Problem TDEAD2360 is UNSAT
Problem TDEAD2361 is UNSAT
Problem TDEAD2362 is UNSAT
Problem TDEAD2363 is UNSAT
Problem TDEAD2364 is UNSAT
Problem TDEAD2365 is UNSAT
Problem TDEAD2366 is UNSAT
Problem TDEAD2367 is UNSAT
Problem TDEAD2368 is UNSAT
Problem TDEAD2369 is UNSAT
Problem TDEAD2370 is UNSAT
Problem TDEAD2371 is UNSAT
Problem TDEAD2372 is UNSAT
Problem TDEAD2373 is UNSAT
Problem TDEAD2374 is UNSAT
Problem TDEAD2375 is UNSAT
Problem TDEAD2376 is UNSAT
Problem TDEAD2377 is UNSAT
Problem TDEAD2378 is UNSAT
Problem TDEAD2379 is UNSAT
Problem TDEAD2380 is UNSAT
[2024-06-01 06:51:53] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 1 ms to minimize.
Problem TDEAD2417 is UNSAT
Problem TDEAD2426 is UNSAT
[2024-06-01 06:51:53] [INFO ] Deduced a trap composed of 22 places in 70 ms of which 0 ms to minimize.
Problem TDEAD2427 is UNSAT
Problem TDEAD2438 is UNSAT
Problem TDEAD2439 is UNSAT
Problem TDEAD2440 is UNSAT
Problem TDEAD2442 is UNSAT
Problem TDEAD2451 is UNSAT
Problem TDEAD2452 is UNSAT
Problem TDEAD2463 is UNSAT
Problem TDEAD2464 is UNSAT
Problem TDEAD2465 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/223 variables, 11/19 constraints. Problems are: Problem set: 105 solved, 2360 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 223/2580 variables, and 19 constraints, problems are : Problem set: 105 solved, 2360 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/224 constraints, ReadFeed: 0/211 constraints, PredecessorRefiner: 2465/2465 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 105 solved, 2360 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/223 variables, 8/8 constraints. Problems are: Problem set: 105 solved, 2360 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/223 variables, 11/19 constraints. Problems are: Problem set: 105 solved, 2360 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/223 variables, 0/19 constraints. Problems are: Problem set: 105 solved, 2360 unsolved
At refinement iteration 3 (OVERLAPS) 2356/2579 variables, 223/242 constraints. Problems are: Problem set: 105 solved, 2360 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2579 variables, 211/453 constraints. Problems are: Problem set: 105 solved, 2360 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2579/2580 variables, and 2675 constraints, problems are : Problem set: 105 solved, 2360 unsolved in 32797 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 223/224 constraints, ReadFeed: 211/211 constraints, PredecessorRefiner: 2222/2465 constraints, Known Traps: 11/11 constraints]
After SMT, in 83960ms problems are : Problem set: 105 solved, 2360 unsolved
Search for dead transitions found 105 dead transitions in 83984ms
Found 105 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 105 transitions
Dead transitions reduction (with SMT) removed 105 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 224/224 places, 2362/2467 transitions.
Reduce places removed 24 places and 571 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 200 transition count 1791
Reduce places removed 16 places and 198 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 40 place count 184 transition count 1593
Reduce places removed 10 places and 191 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 50 place count 174 transition count 1402
Reduce places removed 9 places and 138 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 59 place count 165 transition count 1264
Reduce places removed 2 places and 46 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 61 place count 163 transition count 1218
Reduce places removed 1 places and 15 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 62 place count 162 transition count 1203
Reduce places removed 1 places and 20 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 63 place count 161 transition count 1183
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 66 place count 158 transition count 1151
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 2 places and 30 transitions.
Iterating global reduction 7 with 5 rules applied. Total rules applied 71 place count 156 transition count 1121
Deduced a syphon composed of 3 places in 1 ms
Applied a total of 71 rules in 35 ms. Remains 156 /224 variables (removed 68) and now considering 1121/2362 (removed 1241) transitions.
[2024-06-01 06:52:31] [INFO ] Flow matrix only has 1074 transitions (discarded 47 similar events)
// Phase 1: matrix 1074 rows 156 cols
[2024-06-01 06:52:31] [INFO ] Computed 11 invariants in 9 ms
[2024-06-01 06:52:31] [INFO ] Implicit Places using invariants in 180 ms returned []
[2024-06-01 06:52:31] [INFO ] Flow matrix only has 1074 transitions (discarded 47 similar events)
[2024-06-01 06:52:31] [INFO ] Invariant cache hit.
[2024-06-01 06:52:31] [INFO ] State equation strengthened by 130 read => feed constraints.
[2024-06-01 06:52:31] [INFO ] Implicit Places using invariants and state equation in 730 ms returned []
Implicit Place search using SMT with State Equation took 912 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 156/224 places, 1121/2467 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 86817 ms. Remains : 156/224 places, 1121/2467 transitions.
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
FORMULA BugTracking-PT-q8m032-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m032-ReachabilityCardinality-2023-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40017 steps (86 resets) in 118 ms. (336 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (11 resets) in 42 ms. (930 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (11 resets) in 43 ms. (909 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 283587 steps, run timeout after 3001 ms. (steps per millisecond=94 ) properties seen :0 out of 2
Probabilistic random walk after 283587 steps, saw 144224 distinct states, run finished after 3001 ms. (steps per millisecond=94 ) properties seen :0
[2024-06-01 06:52:35] [INFO ] Flow matrix only has 1074 transitions (discarded 47 similar events)
// Phase 1: matrix 1074 rows 153 cols
[2024-06-01 06:52:35] [INFO ] Computed 8 invariants in 5 ms
[2024-06-01 06:52:35] [INFO ] State equation strengthened by 130 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 19/21 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 241/262 variables, 21/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/262 variables, 3/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/262 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 405/667 variables, 38/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/667 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/667 variables, 73/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/667 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 2/669 variables, 1/138 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/669 variables, 2/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/669 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 431/1100 variables, 35/175 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1100 variables, 35/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1100 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 5/1105 variables, 2/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1105 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1105 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 98/1203 variables, 43/256 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1203 variables, 2/258 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1203 variables, 16/274 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1203 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 23/1226 variables, 12/286 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1226 variables, 1/287 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1226 variables, 3/290 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1226 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 1/1227 variables, 1/291 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1227 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (OVERLAPS) 0/1227 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1227/1227 variables, and 291 constraints, problems are : Problem set: 0 solved, 2 unsolved in 398 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 153/153 constraints, ReadFeed: 130/130 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 19/21 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 241/262 variables, 21/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/262 variables, 3/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/262 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 405/667 variables, 38/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/667 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/667 variables, 73/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/667 variables, 2/139 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/667 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 2/669 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/669 variables, 2/142 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/669 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 431/1100 variables, 35/177 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1100 variables, 35/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 06:52:35] [INFO ] Deduced a trap composed of 26 places in 93 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1100 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1100 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 5/1105 variables, 2/215 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1105 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1105 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 98/1203 variables, 43/259 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1203 variables, 2/261 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1203 variables, 16/277 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 06:52:36] [INFO ] Deduced a trap composed of 48 places in 145 ms of which 1 ms to minimize.
[2024-06-01 06:52:36] [INFO ] Deduced a trap composed of 20 places in 143 ms of which 1 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/1203 variables, 2/279 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1203 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 23/1226 variables, 12/291 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1226 variables, 1/292 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1226 variables, 3/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 06:52:36] [INFO ] Deduced a trap composed of 38 places in 151 ms of which 1 ms to minimize.
[2024-06-01 06:52:36] [INFO ] Deduced a trap composed of 30 places in 147 ms of which 2 ms to minimize.
[2024-06-01 06:52:36] [INFO ] Deduced a trap composed of 11 places in 101 ms of which 1 ms to minimize.
At refinement iteration 29 (INCLUDED_ONLY) 0/1226 variables, 3/298 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1226 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (OVERLAPS) 1/1227 variables, 1/299 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1227 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 33 (OVERLAPS) 0/1227 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1227/1227 variables, and 299 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1571 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 153/153 constraints, ReadFeed: 130/130 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 6/6 constraints]
After SMT, in 1993ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 272 ms.
Support contains 2 out of 153 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 153/153 places, 1121/1121 transitions.
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 153 transition count 1119
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 151 transition count 1119
Applied a total of 4 rules in 28 ms. Remains 151 /153 variables (removed 2) and now considering 1119/1121 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 151/153 places, 1119/1121 transitions.
RANDOM walk for 40013 steps (8 resets) in 85 ms. (465 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 116 ms. (341 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 48 ms. (816 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 246691 steps, run timeout after 3001 ms. (steps per millisecond=82 ) properties seen :0 out of 2
Probabilistic random walk after 246691 steps, saw 124703 distinct states, run finished after 3002 ms. (steps per millisecond=82 ) properties seen :0
[2024-06-01 06:52:40] [INFO ] Flow matrix only has 1072 transitions (discarded 47 similar events)
// Phase 1: matrix 1072 rows 151 cols
[2024-06-01 06:52:40] [INFO ] Computed 8 invariants in 8 ms
[2024-06-01 06:52:40] [INFO ] State equation strengthened by 130 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 19/21 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 241/262 variables, 21/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/262 variables, 3/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/262 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 405/667 variables, 38/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/667 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/667 variables, 73/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/667 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 2/669 variables, 1/138 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/669 variables, 2/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/669 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 431/1100 variables, 35/175 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1100 variables, 35/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1100 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 5/1105 variables, 2/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1105 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1105 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 98/1203 variables, 43/256 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1203 variables, 2/258 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1203 variables, 16/274 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1203 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 20/1223 variables, 11/285 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1223 variables, 1/286 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1223 variables, 3/289 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1223 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 0/1223 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1223/1223 variables, and 289 constraints, problems are : Problem set: 0 solved, 2 unsolved in 427 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 151/151 constraints, ReadFeed: 130/130 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 19/21 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 241/262 variables, 21/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/262 variables, 3/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/262 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 405/667 variables, 38/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/667 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/667 variables, 73/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/667 variables, 2/139 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/667 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 2/669 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/669 variables, 2/142 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/669 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 431/1100 variables, 35/177 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1100 variables, 35/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 06:52:41] [INFO ] Deduced a trap composed of 27 places in 99 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1100 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1100 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 5/1105 variables, 2/215 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1105 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1105 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 98/1203 variables, 43/259 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1203 variables, 2/261 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1203 variables, 16/277 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 06:52:41] [INFO ] Deduced a trap composed of 20 places in 84 ms of which 1 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/1203 variables, 1/278 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1203 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 20/1223 variables, 11/289 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1223 variables, 1/290 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1223 variables, 3/293 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1223 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (OVERLAPS) 0/1223 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1223/1223 variables, and 293 constraints, problems are : Problem set: 0 solved, 2 unsolved in 880 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 151/151 constraints, ReadFeed: 130/130 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 1325ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 504 ms.
Support contains 2 out of 151 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 151/151 places, 1119/1119 transitions.
Applied a total of 0 rules in 11 ms. Remains 151 /151 variables (removed 0) and now considering 1119/1119 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 151/151 places, 1119/1119 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 151/151 places, 1119/1119 transitions.
Applied a total of 0 rules in 11 ms. Remains 151 /151 variables (removed 0) and now considering 1119/1119 (removed 0) transitions.
[2024-06-01 06:52:42] [INFO ] Flow matrix only has 1072 transitions (discarded 47 similar events)
[2024-06-01 06:52:42] [INFO ] Invariant cache hit.
[2024-06-01 06:52:42] [INFO ] Implicit Places using invariants in 358 ms returned []
[2024-06-01 06:52:42] [INFO ] Flow matrix only has 1072 transitions (discarded 47 similar events)
[2024-06-01 06:52:42] [INFO ] Invariant cache hit.
[2024-06-01 06:52:42] [INFO ] State equation strengthened by 130 read => feed constraints.
[2024-06-01 06:52:43] [INFO ] Implicit Places using invariants and state equation in 720 ms returned []
Implicit Place search using SMT with State Equation took 1093 ms to find 0 implicit places.
[2024-06-01 06:52:43] [INFO ] Redundant transitions in 9 ms returned []
Running 1118 sub problems to find dead transitions.
[2024-06-01 06:52:43] [INFO ] Flow matrix only has 1072 transitions (discarded 47 similar events)
[2024-06-01 06:52:43] [INFO ] Invariant cache hit.
[2024-06-01 06:52:43] [INFO ] State equation strengthened by 130 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/151 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1118 unsolved
[2024-06-01 06:52:52] [INFO ] Deduced a trap composed of 20 places in 385 ms of which 5 ms to minimize.
[2024-06-01 06:52:53] [INFO ] Deduced a trap composed of 7 places in 126 ms of which 7 ms to minimize.
Problem TDEAD364 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD458 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD460 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD463 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD512 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD514 is UNSAT
Problem TDEAD515 is UNSAT
Problem TDEAD516 is UNSAT
Problem TDEAD517 is UNSAT
Problem TDEAD518 is UNSAT
Problem TDEAD519 is UNSAT
Problem TDEAD520 is UNSAT
Problem TDEAD521 is UNSAT
Problem TDEAD522 is UNSAT
Problem TDEAD523 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD525 is UNSAT
Problem TDEAD526 is UNSAT
Problem TDEAD527 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD529 is UNSAT
Problem TDEAD530 is UNSAT
Problem TDEAD531 is UNSAT
Problem TDEAD532 is UNSAT
Problem TDEAD533 is UNSAT
Problem TDEAD534 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD536 is UNSAT
Problem TDEAD537 is UNSAT
Problem TDEAD538 is UNSAT
Problem TDEAD539 is UNSAT
Problem TDEAD540 is UNSAT
Problem TDEAD541 is UNSAT
Problem TDEAD542 is UNSAT
Problem TDEAD543 is UNSAT
Problem TDEAD544 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD546 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD553 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD558 is UNSAT
Problem TDEAD559 is UNSAT
Problem TDEAD560 is UNSAT
Problem TDEAD561 is UNSAT
Problem TDEAD562 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD564 is UNSAT
Problem TDEAD565 is UNSAT
Problem TDEAD566 is UNSAT
Problem TDEAD567 is UNSAT
Problem TDEAD568 is UNSAT
Problem TDEAD569 is UNSAT
Problem TDEAD570 is UNSAT
Problem TDEAD571 is UNSAT
Problem TDEAD572 is UNSAT
Problem TDEAD573 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD575 is UNSAT
Problem TDEAD576 is UNSAT
Problem TDEAD577 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD579 is UNSAT
Problem TDEAD580 is UNSAT
Problem TDEAD581 is UNSAT
Problem TDEAD582 is UNSAT
Problem TDEAD583 is UNSAT
Problem TDEAD584 is UNSAT
Problem TDEAD585 is UNSAT
Problem TDEAD586 is UNSAT
Problem TDEAD587 is UNSAT
Problem TDEAD588 is UNSAT
Problem TDEAD589 is UNSAT
Problem TDEAD590 is UNSAT
Problem TDEAD591 is UNSAT
Problem TDEAD592 is UNSAT
Problem TDEAD593 is UNSAT
Problem TDEAD594 is UNSAT
Problem TDEAD595 is UNSAT
Problem TDEAD596 is UNSAT
Problem TDEAD597 is UNSAT
Problem TDEAD598 is UNSAT
Problem TDEAD599 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD601 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD603 is UNSAT
Problem TDEAD604 is UNSAT
Problem TDEAD605 is UNSAT
Problem TDEAD606 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD608 is UNSAT
Problem TDEAD609 is UNSAT
Problem TDEAD610 is UNSAT
Problem TDEAD611 is UNSAT
Problem TDEAD612 is UNSAT
Problem TDEAD613 is UNSAT
Problem TDEAD614 is UNSAT
Problem TDEAD615 is UNSAT
Problem TDEAD616 is UNSAT
Problem TDEAD1046 is UNSAT
Problem TDEAD1062 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/151 variables, 2/10 constraints. Problems are: Problem set: 197 solved, 921 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 0/10 constraints. Problems are: Problem set: 197 solved, 921 unsolved
At refinement iteration 3 (OVERLAPS) 1072/1223 variables, 151/161 constraints. Problems are: Problem set: 197 solved, 921 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1223 variables, 130/291 constraints. Problems are: Problem set: 197 solved, 921 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1223/1223 variables, and 291 constraints, problems are : Problem set: 197 solved, 921 unsolved in 30076 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 151/151 constraints, ReadFeed: 130/130 constraints, PredecessorRefiner: 1118/1118 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 197 solved, 921 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/151 variables, 8/8 constraints. Problems are: Problem set: 197 solved, 921 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/151 variables, 2/10 constraints. Problems are: Problem set: 197 solved, 921 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 0/10 constraints. Problems are: Problem set: 197 solved, 921 unsolved
At refinement iteration 3 (OVERLAPS) 1072/1223 variables, 151/161 constraints. Problems are: Problem set: 197 solved, 921 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1223 variables, 130/291 constraints. Problems are: Problem set: 197 solved, 921 unsolved
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 : BugTracking-PT-q8m032-ReachabilityCardinality-2024-00
Could not compute solution for formula : BugTracking-PT-q8m032-ReachabilityCardinality-2024-01
Could not compute solution for formula : BugTracking-PT-q8m032-ReachabilityCardinality-2024-02
Could not compute solution for formula : BugTracking-PT-q8m032-ReachabilityCardinality-2024-03
Could not compute solution for formula : BugTracking-PT-q8m032-ReachabilityCardinality-2024-04
Could not compute solution for formula : BugTracking-PT-q8m032-ReachabilityCardinality-2024-05
Could not compute solution for formula : BugTracking-PT-q8m032-ReachabilityCardinality-2023-06
Could not compute solution for formula : BugTracking-PT-q8m032-ReachabilityCardinality-2024-07
Could not compute solution for formula : BugTracking-PT-q8m032-ReachabilityCardinality-2024-08
Could not compute solution for formula : BugTracking-PT-q8m032-ReachabilityCardinality-2023-09
Could not compute solution for formula : BugTracking-PT-q8m032-ReachabilityCardinality-2023-10
Could not compute solution for formula : BugTracking-PT-q8m032-ReachabilityCardinality-2024-11
Could not compute solution for formula : BugTracking-PT-q8m032-ReachabilityCardinality-2024-12
Could not compute solution for formula : BugTracking-PT-q8m032-ReachabilityCardinality-2024-13
Could not compute solution for formula : BugTracking-PT-q8m032-ReachabilityCardinality-2024-14
Could not compute solution for formula : BugTracking-PT-q8m032-ReachabilityCardinality-2024-15

BK_STOP 1717224807850

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
mcc2024
rfs formula name BugTracking-PT-q8m032-ReachabilityCardinality-2024-00
rfs formula type EF
rfs formula formula --invariant=/tmp/882/inv_0_
rfs formula name BugTracking-PT-q8m032-ReachabilityCardinality-2024-01
rfs formula type AG
rfs formula formula --invariant=/tmp/882/inv_1_
rfs formula name BugTracking-PT-q8m032-ReachabilityCardinality-2024-02
rfs formula type AG
rfs formula formula --invariant=/tmp/882/inv_2_
rfs formula name BugTracking-PT-q8m032-ReachabilityCardinality-2024-03
rfs formula type EF
rfs formula formula --invariant=/tmp/882/inv_3_
rfs formula name BugTracking-PT-q8m032-ReachabilityCardinality-2024-04
rfs formula type EF
rfs formula formula --invariant=/tmp/882/inv_4_
rfs formula name BugTracking-PT-q8m032-ReachabilityCardinality-2024-05
rfs formula type EF
rfs formula formula --invariant=/tmp/882/inv_5_
rfs formula name BugTracking-PT-q8m032-ReachabilityCardinality-2023-06
rfs formula type EF
rfs formula formula --invariant=/tmp/882/inv_6_
rfs formula name BugTracking-PT-q8m032-ReachabilityCardinality-2024-07
rfs formula type EF
rfs formula formula --invariant=/tmp/882/inv_7_
rfs formula name BugTracking-PT-q8m032-ReachabilityCardinality-2024-08
rfs formula type AG
rfs formula formula --invariant=/tmp/882/inv_8_
rfs formula name BugTracking-PT-q8m032-ReachabilityCardinality-2023-09
rfs formula type AG
rfs formula formula --invariant=/tmp/882/inv_9_
rfs formula name BugTracking-PT-q8m032-ReachabilityCardinality-2023-10
rfs formula type AG
rfs formula formula --invariant=/tmp/882/inv_10_
rfs formula name BugTracking-PT-q8m032-ReachabilityCardinality-2024-11
rfs formula type AG
rfs formula formula --invariant=/tmp/882/inv_11_
rfs formula name BugTracking-PT-q8m032-ReachabilityCardinality-2024-12
rfs formula type AG
rfs formula formula --invariant=/tmp/882/inv_12_
rfs formula name BugTracking-PT-q8m032-ReachabilityCardinality-2024-13
rfs formula type AG
rfs formula formula --invariant=/tmp/882/inv_13_
rfs formula name BugTracking-PT-q8m032-ReachabilityCardinality-2024-14
rfs formula type AG
rfs formula formula --invariant=/tmp/882/inv_14_
rfs formula name BugTracking-PT-q8m032-ReachabilityCardinality-2024-15
rfs formula type AG
rfs formula formula --invariant=/tmp/882/inv_15_
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="BugTracking-PT-q8m032"
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 BugTracking-PT-q8m032, 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 r472-tajo-171620399500422"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BugTracking-PT-q8m032.tgz
mv BugTracking-PT-q8m032 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;