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-171620399300334.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-q3m004, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r472-tajo-171620399300334
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 8.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 19 15:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 147K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K 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:23 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-q3m004-ReachabilityCardinality-2024-00
FORMULA_NAME BugTracking-PT-q3m004-ReachabilityCardinality-2024-01
FORMULA_NAME BugTracking-PT-q3m004-ReachabilityCardinality-2023-02
FORMULA_NAME BugTracking-PT-q3m004-ReachabilityCardinality-2024-03
FORMULA_NAME BugTracking-PT-q3m004-ReachabilityCardinality-2024-04
FORMULA_NAME BugTracking-PT-q3m004-ReachabilityCardinality-2024-05
FORMULA_NAME BugTracking-PT-q3m004-ReachabilityCardinality-2024-06
FORMULA_NAME BugTracking-PT-q3m004-ReachabilityCardinality-2024-07
FORMULA_NAME BugTracking-PT-q3m004-ReachabilityCardinality-2024-08
FORMULA_NAME BugTracking-PT-q3m004-ReachabilityCardinality-2024-09
FORMULA_NAME BugTracking-PT-q3m004-ReachabilityCardinality-2024-10
FORMULA_NAME BugTracking-PT-q3m004-ReachabilityCardinality-2024-11
FORMULA_NAME BugTracking-PT-q3m004-ReachabilityCardinality-2024-12
FORMULA_NAME BugTracking-PT-q3m004-ReachabilityCardinality-2024-13
FORMULA_NAME BugTracking-PT-q3m004-ReachabilityCardinality-2024-14
FORMULA_NAME BugTracking-PT-q3m004-ReachabilityCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1717223033297

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-q3m004
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 06:23:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 06:23:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 06:23:56] [INFO ] Load time of PNML (sax parser for PT used): 1627 ms
[2024-06-01 06:23:56] [INFO ] Transformed 754 places.
[2024-06-01 06:23:56] [INFO ] Transformed 27370 transitions.
[2024-06-01 06:23:56] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 2037 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 53 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 514 places in 152 ms
Reduce places removed 514 places and 24601 transitions.
FORMULA BugTracking-PT-q3m004-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m004-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m004-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m004-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m004-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m004-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m004-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m004-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40001 steps (443 resets) in 4320 ms. (9 steps per ms) remains 6/8 properties
FORMULA BugTracking-PT-q3m004-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BugTracking-PT-q3m004-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (123 resets) in 247 ms. (161 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (113 resets) in 270 ms. (147 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (115 resets) in 246 ms. (161 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (110 resets) in 394 ms. (101 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (101 resets) in 205 ms. (194 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (115 resets) in 213 ms. (186 steps per ms) remains 6/6 properties
[2024-06-01 06:23:59] [INFO ] Flow matrix only has 2642 transitions (discarded 127 similar events)
// Phase 1: matrix 2642 rows 240 cols
[2024-06-01 06:23:59] [INFO ] Computed 10 invariants in 49 ms
[2024-06-01 06:23:59] [INFO ] State equation strengthened by 255 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 119/137 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 2501/2638 variables, 137/144 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2638 variables, 126/270 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2638 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 242/2880 variables, 101/371 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2880 variables, 1/372 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2880 variables, 129/501 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2880 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 2/2882 variables, 2/503 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2882 variables, 2/505 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2882 variables, 0/505 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 0/2882 variables, 0/505 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2882/2882 variables, and 505 constraints, problems are : Problem set: 0 solved, 6 unsolved in 2117 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 240/240 constraints, ReadFeed: 255/255 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/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 119/137 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 06:24:01] [INFO ] Deduced a trap composed of 11 places in 187 ms of which 24 ms to minimize.
[2024-06-01 06:24:02] [INFO ] Deduced a trap composed of 9 places in 191 ms of which 32 ms to minimize.
[2024-06-01 06:24:02] [INFO ] Deduced a trap composed of 10 places in 352 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 2501/2638 variables, 137/147 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2638 variables, 126/273 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 06:24:04] [INFO ] Deduced a trap composed of 12 places in 1227 ms of which 27 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/2638 variables, 1/274 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2638 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 242/2880 variables, 101/375 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2880 variables, 1/376 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2880 variables, 129/505 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem BugTracking-PT-q3m004-ReachabilityCardinality-2024-12 is UNSAT
FORMULA BugTracking-PT-q3m004-ReachabilityCardinality-2024-12 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 11 (INCLUDED_ONLY) 0/2880 variables, 6/511 constraints. Problems are: Problem set: 1 solved, 5 unsolved
[2024-06-01 06:24:06] [INFO ] Deduced a trap composed of 40 places in 444 ms of which 2 ms to minimize.
[2024-06-01 06:24:06] [INFO ] Deduced a trap composed of 41 places in 388 ms of which 2 ms to minimize.
SMT process timed out in 7537ms, After SMT, problems are : Problem set: 1 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 17 out of 240 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 240/240 places, 2769/2769 transitions.
Graph (complete) has 3422 edges and 240 vertex of which 238 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.8 ms
Discarding 2 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 237 transition count 2772
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 9 place count 237 transition count 2766
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 15 place count 231 transition count 2766
Applied a total of 15 rules in 223 ms. Remains 231 /240 variables (removed 9) and now considering 2766/2769 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 234 ms. Remains : 231/240 places, 2766/2769 transitions.
RANDOM walk for 40000 steps (11 resets) in 777 ms. (51 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 285 ms. (139 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (11 resets) in 236 ms. (168 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (15 resets) in 220 ms. (181 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (12 resets) in 260 ms. (153 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (14 resets) in 205 ms. (194 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 128197 steps, run timeout after 3001 ms. (steps per millisecond=42 ) properties seen :0 out of 5
Probabilistic random walk after 128197 steps, saw 50980 distinct states, run finished after 3022 ms. (steps per millisecond=42 ) properties seen :0
[2024-06-01 06:24:10] [INFO ] Flow matrix only has 2635 transitions (discarded 131 similar events)
// Phase 1: matrix 2635 rows 231 cols
[2024-06-01 06:24:10] [INFO ] Computed 8 invariants in 12 ms
[2024-06-01 06:24:10] [INFO ] State equation strengthened by 255 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 117/134 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 2498/2632 variables, 134/141 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2632 variables, 125/266 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2632 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 234/2866 variables, 97/363 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2866 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2866 variables, 130/494 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2866 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 0/2866 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2866/2866 variables, and 494 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1103 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 231/231 constraints, ReadFeed: 255/255 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/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 117/134 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 06:24:12] [INFO ] Deduced a trap composed of 12 places in 95 ms of which 0 ms to minimize.
[2024-06-01 06:24:12] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 1 ms to minimize.
[2024-06-01 06:24:12] [INFO ] Deduced a trap composed of 10 places in 77 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/134 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 2498/2632 variables, 134/144 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2632 variables, 125/269 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 06:24:13] [INFO ] Deduced a trap composed of 11 places in 91 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/2632 variables, 1/270 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2632 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 234/2866 variables, 97/367 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2866 variables, 1/368 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2866 variables, 130/498 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2866 variables, 5/503 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 06:24:14] [INFO ] Deduced a trap composed of 13 places in 324 ms of which 1 ms to minimize.
[2024-06-01 06:24:14] [INFO ] Deduced a trap composed of 19 places in 347 ms of which 1 ms to minimize.
[2024-06-01 06:24:14] [INFO ] Deduced a trap composed of 16 places in 299 ms of which 2 ms to minimize.
[2024-06-01 06:24:15] [INFO ] Deduced a trap composed of 15 places in 267 ms of which 1 ms to minimize.
[2024-06-01 06:24:15] [INFO ] Deduced a trap composed of 8 places in 332 ms of which 2 ms to minimize.
[2024-06-01 06:24:15] [INFO ] Deduced a trap composed of 18 places in 170 ms of which 1 ms to minimize.
[2024-06-01 06:24:16] [INFO ] Deduced a trap composed of 49 places in 255 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/2866 variables, 7/510 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 06:24:16] [INFO ] Deduced a trap composed of 21 places in 118 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/2866 variables, 1/511 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 06:24:17] [INFO ] Deduced a trap composed of 17 places in 243 ms of which 1 ms to minimize.
[2024-06-01 06:24:17] [INFO ] Deduced a trap composed of 18 places in 186 ms of which 1 ms to minimize.
[2024-06-01 06:24:18] [INFO ] Deduced a trap composed of 17 places in 198 ms of which 2 ms to minimize.
[2024-06-01 06:24:18] [INFO ] Deduced a trap composed of 17 places in 183 ms of which 1 ms to minimize.
[2024-06-01 06:24:18] [INFO ] Deduced a trap composed of 15 places in 195 ms of which 1 ms to minimize.
[2024-06-01 06:24:18] [INFO ] Deduced a trap composed of 16 places in 214 ms of which 1 ms to minimize.
[2024-06-01 06:24:19] [INFO ] Deduced a trap composed of 16 places in 183 ms of which 1 ms to minimize.
[2024-06-01 06:24:19] [INFO ] Deduced a trap composed of 16 places in 183 ms of which 1 ms to minimize.
[2024-06-01 06:24:19] [INFO ] Deduced a trap composed of 16 places in 200 ms of which 1 ms to minimize.
[2024-06-01 06:24:19] [INFO ] Deduced a trap composed of 14 places in 188 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/2866 variables, 10/521 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2866 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 0/2866 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2866/2866 variables, and 521 constraints, problems are : Problem set: 0 solved, 5 unsolved in 9356 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 231/231 constraints, ReadFeed: 255/255 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 22/22 constraints]
After SMT, in 10565ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 0 properties in 11719 ms.
Support contains 17 out of 231 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 231/231 places, 2766/2766 transitions.
Applied a total of 0 rules in 44 ms. Remains 231 /231 variables (removed 0) and now considering 2766/2766 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 231/231 places, 2766/2766 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 231/231 places, 2766/2766 transitions.
Applied a total of 0 rules in 46 ms. Remains 231 /231 variables (removed 0) and now considering 2766/2766 (removed 0) transitions.
[2024-06-01 06:24:33] [INFO ] Flow matrix only has 2635 transitions (discarded 131 similar events)
[2024-06-01 06:24:33] [INFO ] Invariant cache hit.
[2024-06-01 06:24:33] [INFO ] Implicit Places using invariants in 322 ms returned []
[2024-06-01 06:24:33] [INFO ] Flow matrix only has 2635 transitions (discarded 131 similar events)
[2024-06-01 06:24:33] [INFO ] Invariant cache hit.
[2024-06-01 06:24:33] [INFO ] State equation strengthened by 255 read => feed constraints.
[2024-06-01 06:24:35] [INFO ] Implicit Places using invariants and state equation in 1503 ms returned []
Implicit Place search using SMT with State Equation took 1837 ms to find 0 implicit places.
[2024-06-01 06:24:35] [INFO ] Redundant transitions in 177 ms returned []
Running 2765 sub problems to find dead transitions.
[2024-06-01 06:24:35] [INFO ] Flow matrix only has 2635 transitions (discarded 131 similar events)
[2024-06-01 06:24:35] [INFO ] Invariant cache hit.
[2024-06-01 06:24:35] [INFO ] State equation strengthened by 255 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2765 unsolved
[2024-06-01 06:25:17] [INFO ] Deduced a trap composed of 10 places in 132 ms of which 1 ms to minimize.
[2024-06-01 06:25:24] [INFO ] Deduced a trap composed of 6 places in 68 ms of which 3 ms to minimize.
[2024-06-01 06:25:24] [INFO ] Deduced a trap composed of 11 places in 86 ms of which 1 ms to minimize.
Problem TDEAD1021 is UNSAT
Problem TDEAD1022 is UNSAT
Problem TDEAD1023 is UNSAT
Problem TDEAD1024 is UNSAT
Problem TDEAD1025 is UNSAT
Problem TDEAD1026 is UNSAT
Problem TDEAD1027 is UNSAT
Problem TDEAD1028 is UNSAT
Problem TDEAD1029 is UNSAT
Problem TDEAD1031 is UNSAT
Problem TDEAD1032 is UNSAT
Problem TDEAD1033 is UNSAT
Problem TDEAD1037 is UNSAT
Problem TDEAD1038 is UNSAT
Problem TDEAD1039 is UNSAT
Problem TDEAD1040 is UNSAT
Problem TDEAD1041 is UNSAT
Problem TDEAD1042 is UNSAT
Problem TDEAD1043 is UNSAT
Problem TDEAD1044 is UNSAT
Problem TDEAD1045 is UNSAT
Problem TDEAD1048 is UNSAT
Problem TDEAD1049 is UNSAT
Problem TDEAD1050 is UNSAT
Problem TDEAD1051 is UNSAT
Problem TDEAD1052 is UNSAT
Problem TDEAD1053 is UNSAT
Problem TDEAD1057 is UNSAT
Problem TDEAD1058 is UNSAT
Problem TDEAD1059 is UNSAT
Problem TDEAD1060 is UNSAT
Problem TDEAD1061 is UNSAT
Problem TDEAD1062 is UNSAT
Problem TDEAD1063 is UNSAT
Problem TDEAD1064 is UNSAT
Problem TDEAD1065 is UNSAT
Problem TDEAD1067 is UNSAT
Problem TDEAD1068 is UNSAT
Problem TDEAD1069 is UNSAT
Problem TDEAD1073 is UNSAT
Problem TDEAD1074 is UNSAT
Problem TDEAD1075 is UNSAT
Problem TDEAD1076 is UNSAT
Problem TDEAD1077 is UNSAT
Problem TDEAD1078 is UNSAT
Problem TDEAD1079 is UNSAT
Problem TDEAD1080 is UNSAT
Problem TDEAD1081 is UNSAT
Problem TDEAD1084 is UNSAT
Problem TDEAD1085 is UNSAT
Problem TDEAD1086 is UNSAT
Problem TDEAD1087 is UNSAT
Problem TDEAD1088 is UNSAT
Problem TDEAD1089 is UNSAT
Problem TDEAD1090 is UNSAT
Problem TDEAD1091 is UNSAT
Problem TDEAD1092 is UNSAT
Problem TDEAD1093 is UNSAT
Problem TDEAD1094 is UNSAT
Problem TDEAD1095 is UNSAT
Problem TDEAD1096 is UNSAT
Problem TDEAD1097 is UNSAT
Problem TDEAD1098 is UNSAT
Problem TDEAD1099 is UNSAT
Problem TDEAD1100 is UNSAT
Problem TDEAD1101 is UNSAT
Problem TDEAD1102 is UNSAT
Problem TDEAD1103 is UNSAT
Problem TDEAD1104 is UNSAT
Problem TDEAD1105 is UNSAT
Problem TDEAD1106 is UNSAT
Problem TDEAD1107 is UNSAT
Problem TDEAD1108 is UNSAT
Problem TDEAD1109 is UNSAT
Problem TDEAD1110 is UNSAT
Problem TDEAD1111 is UNSAT
Problem TDEAD1112 is UNSAT
Problem TDEAD1113 is UNSAT
Problem TDEAD1114 is UNSAT
Problem TDEAD1115 is UNSAT
Problem TDEAD1116 is UNSAT
Problem TDEAD1117 is UNSAT
Problem TDEAD1118 is UNSAT
Problem TDEAD1119 is UNSAT
Problem TDEAD1120 is UNSAT
Problem TDEAD1121 is UNSAT
Problem TDEAD1122 is UNSAT
Problem TDEAD1123 is UNSAT
Problem TDEAD1124 is UNSAT
Problem TDEAD1125 is UNSAT
Problem TDEAD1126 is UNSAT
Problem TDEAD1127 is UNSAT
Problem TDEAD1128 is UNSAT
Problem TDEAD1129 is UNSAT
Problem TDEAD1130 is UNSAT
Problem TDEAD1131 is UNSAT
Problem TDEAD1132 is UNSAT
Problem TDEAD1133 is UNSAT
Problem TDEAD1134 is UNSAT
Problem TDEAD1135 is UNSAT
Problem TDEAD1136 is UNSAT
Problem TDEAD1137 is UNSAT
Problem TDEAD1138 is UNSAT
Problem TDEAD1139 is UNSAT
Problem TDEAD1140 is UNSAT
Problem TDEAD1141 is UNSAT
Problem TDEAD1142 is UNSAT
Problem TDEAD1143 is UNSAT
Problem TDEAD1144 is UNSAT
Problem TDEAD1145 is UNSAT
Problem TDEAD1146 is UNSAT
Problem TDEAD1147 is UNSAT
Problem TDEAD1148 is UNSAT
Problem TDEAD1149 is UNSAT
Problem TDEAD1150 is UNSAT
Problem TDEAD1151 is UNSAT
Problem TDEAD1152 is UNSAT
Problem TDEAD1153 is UNSAT
Problem TDEAD1154 is UNSAT
Problem TDEAD1155 is UNSAT
Problem TDEAD1156 is UNSAT
Problem TDEAD1157 is UNSAT
Problem TDEAD1158 is UNSAT
Problem TDEAD1159 is UNSAT
Problem TDEAD1160 is UNSAT
Problem TDEAD1161 is UNSAT
Problem TDEAD1234 is UNSAT
Problem TDEAD1235 is UNSAT
Problem TDEAD1236 is UNSAT
Problem TDEAD1237 is UNSAT
Problem TDEAD1238 is UNSAT
Problem TDEAD1239 is UNSAT
Problem TDEAD1240 is UNSAT
Problem TDEAD1241 is UNSAT
Problem TDEAD1242 is UNSAT
Problem TDEAD1243 is UNSAT
Problem TDEAD1244 is UNSAT
Problem TDEAD1245 is UNSAT
Problem TDEAD1246 is UNSAT
Problem TDEAD1247 is UNSAT
Problem TDEAD1248 is UNSAT
Problem TDEAD1249 is UNSAT
Problem TDEAD1250 is UNSAT
Problem TDEAD1251 is UNSAT
Problem TDEAD1252 is UNSAT
Problem TDEAD1253 is UNSAT
Problem TDEAD1254 is UNSAT
Problem TDEAD1255 is UNSAT
Problem TDEAD1256 is UNSAT
Problem TDEAD1257 is UNSAT
Problem TDEAD1258 is UNSAT
Problem TDEAD1259 is UNSAT
Problem TDEAD1260 is UNSAT
Problem TDEAD1261 is UNSAT
Problem TDEAD1262 is UNSAT
Problem TDEAD1263 is UNSAT
Problem TDEAD1264 is UNSAT
Problem TDEAD1265 is UNSAT
Problem TDEAD1266 is UNSAT
Problem TDEAD1267 is UNSAT
Problem TDEAD1268 is UNSAT
Problem TDEAD1269 is UNSAT
Problem TDEAD1270 is UNSAT
Problem TDEAD1271 is UNSAT
Problem TDEAD1272 is UNSAT
Problem TDEAD1273 is UNSAT
Problem TDEAD1274 is UNSAT
Problem TDEAD1275 is UNSAT
Problem TDEAD1276 is UNSAT
Problem TDEAD1277 is UNSAT
Problem TDEAD1278 is UNSAT
Problem TDEAD1279 is UNSAT
Problem TDEAD1280 is UNSAT
Problem TDEAD1281 is UNSAT
Problem TDEAD1282 is UNSAT
Problem TDEAD1283 is UNSAT
Problem TDEAD1284 is UNSAT
Problem TDEAD1285 is UNSAT
Problem TDEAD1286 is UNSAT
Problem TDEAD1287 is UNSAT
Problem TDEAD1288 is UNSAT
Problem TDEAD1289 is UNSAT
Problem TDEAD1290 is UNSAT
Problem TDEAD1291 is UNSAT
Problem TDEAD1292 is UNSAT
Problem TDEAD1293 is UNSAT
Problem TDEAD1294 is UNSAT
Problem TDEAD1295 is UNSAT
Problem TDEAD1296 is UNSAT
Problem TDEAD1297 is UNSAT
Problem TDEAD1298 is UNSAT
Problem TDEAD1299 is UNSAT
Problem TDEAD1300 is UNSAT
Problem TDEAD1301 is UNSAT
Problem TDEAD1302 is UNSAT
Problem TDEAD1303 is UNSAT
Problem TDEAD1304 is UNSAT
Problem TDEAD1305 is UNSAT
Problem TDEAD1306 is UNSAT
Problem TDEAD1307 is UNSAT
Problem TDEAD1308 is UNSAT
Problem TDEAD1309 is UNSAT
Problem TDEAD1310 is UNSAT
Problem TDEAD1311 is UNSAT
Problem TDEAD1312 is UNSAT
Problem TDEAD1313 is UNSAT
Problem TDEAD1314 is UNSAT
Problem TDEAD1315 is UNSAT
Problem TDEAD1316 is UNSAT
Problem TDEAD1317 is UNSAT
Problem TDEAD1318 is UNSAT
Problem TDEAD1319 is UNSAT
Problem TDEAD1320 is UNSAT
Problem TDEAD1321 is UNSAT
Problem TDEAD1322 is UNSAT
Problem TDEAD1323 is UNSAT
Problem TDEAD1324 is UNSAT
Problem TDEAD1325 is UNSAT
Problem TDEAD1326 is UNSAT
Problem TDEAD1327 is UNSAT
Problem TDEAD1328 is UNSAT
Problem TDEAD1329 is UNSAT
Problem TDEAD1330 is UNSAT
Problem TDEAD1331 is UNSAT
Problem TDEAD1332 is UNSAT
Problem TDEAD1333 is UNSAT
Problem TDEAD1334 is UNSAT
Problem TDEAD1335 is UNSAT
Problem TDEAD1336 is UNSAT
Problem TDEAD1337 is UNSAT
Problem TDEAD1338 is UNSAT
Problem TDEAD1339 is UNSAT
Problem TDEAD1340 is UNSAT
Problem TDEAD1341 is UNSAT
Problem TDEAD1342 is UNSAT
Problem TDEAD1343 is UNSAT
Problem TDEAD1344 is UNSAT
Problem TDEAD1345 is UNSAT
Problem TDEAD1346 is UNSAT
Problem TDEAD1347 is UNSAT
Problem TDEAD1348 is UNSAT
Problem TDEAD1349 is UNSAT
Problem TDEAD1350 is UNSAT
Problem TDEAD1351 is UNSAT
Problem TDEAD1352 is UNSAT
Problem TDEAD1353 is UNSAT
Problem TDEAD1354 is UNSAT
Problem TDEAD1355 is UNSAT
Problem TDEAD1356 is UNSAT
Problem TDEAD1357 is UNSAT
Problem TDEAD1358 is UNSAT
Problem TDEAD1359 is UNSAT
Problem TDEAD1434 is UNSAT
Problem TDEAD1435 is UNSAT
Problem TDEAD1436 is UNSAT
Problem TDEAD1437 is UNSAT
Problem TDEAD1438 is UNSAT
Problem TDEAD1439 is UNSAT
Problem TDEAD1440 is UNSAT
[2024-06-01 06:25:25] [INFO ] Deduced a trap composed of 9 places in 152 ms of which 1 ms to minimize.
Problem TDEAD1441 is UNSAT
Problem TDEAD1442 is UNSAT
Problem TDEAD1443 is UNSAT
Problem TDEAD1444 is UNSAT
Problem TDEAD1445 is UNSAT
Problem TDEAD1446 is UNSAT
Problem TDEAD1447 is UNSAT
Problem TDEAD1448 is UNSAT
Problem TDEAD1449 is UNSAT
Problem TDEAD1450 is UNSAT
Problem TDEAD1451 is UNSAT
[2024-06-01 06:25:25] [INFO ] Deduced a trap composed of 22 places in 154 ms of which 1 ms to minimize.
Problem TDEAD1464 is UNSAT
Problem TDEAD1465 is UNSAT
Problem TDEAD1475 is UNSAT
Problem TDEAD1476 is UNSAT
Problem TDEAD1480 is UNSAT
Problem TDEAD1481 is UNSAT
Problem TDEAD1482 is UNSAT
Problem TDEAD1483 is UNSAT
Problem TDEAD1484 is UNSAT
Problem TDEAD1485 is UNSAT
Problem TDEAD1486 is UNSAT
Problem TDEAD1491 is UNSAT
Problem TDEAD1492 is UNSAT
Problem TDEAD1493 is UNSAT
Problem TDEAD1494 is UNSAT
Problem TDEAD1495 is UNSAT
Problem TDEAD1496 is UNSAT
Problem TDEAD1497 is UNSAT
[2024-06-01 06:25:26] [INFO ] Deduced a trap composed of 9 places in 166 ms of which 0 ms to minimize.
[2024-06-01 06:25:26] [INFO ] Deduced a trap composed of 12 places in 172 ms of which 1 ms to minimize.
Problem TDEAD1504 is UNSAT
Problem TDEAD1505 is UNSAT
Problem TDEAD1506 is UNSAT
Problem TDEAD1507 is UNSAT
Problem TDEAD1509 is UNSAT
Problem TDEAD1510 is UNSAT
Problem TDEAD1513 is UNSAT
Problem TDEAD1514 is UNSAT
Problem TDEAD1515 is UNSAT
Problem TDEAD1516 is UNSAT
Problem TDEAD1519 is UNSAT
Problem TDEAD1520 is UNSAT
Problem TDEAD1521 is UNSAT
Problem TDEAD1522 is UNSAT
Problem TDEAD1525 is UNSAT
Problem TDEAD1526 is UNSAT
Problem TDEAD1527 is UNSAT
Problem TDEAD1528 is UNSAT
Problem TDEAD1530 is UNSAT
Problem TDEAD1531 is UNSAT
Problem TDEAD1534 is UNSAT
Problem TDEAD1535 is UNSAT
Problem TDEAD1536 is UNSAT
Problem TDEAD1537 is UNSAT
Problem TDEAD1540 is UNSAT
Problem TDEAD1541 is UNSAT
Problem TDEAD1542 is UNSAT
Problem TDEAD1543 is UNSAT
Problem TDEAD1586 is UNSAT
Problem TDEAD1587 is UNSAT
Problem TDEAD1588 is UNSAT
Problem TDEAD1589 is UNSAT
Problem TDEAD1590 is UNSAT
Problem TDEAD1591 is UNSAT
Problem TDEAD1592 is UNSAT
Problem TDEAD1593 is UNSAT
Problem TDEAD1594 is UNSAT
Problem TDEAD1595 is UNSAT
Problem TDEAD1596 is UNSAT
Problem TDEAD1597 is UNSAT
Problem TDEAD1598 is UNSAT
Problem TDEAD1599 is UNSAT
Problem TDEAD1600 is UNSAT
Problem TDEAD1601 is UNSAT
Problem TDEAD1602 is UNSAT
Problem TDEAD1603 is UNSAT
Problem TDEAD1604 is UNSAT
Problem TDEAD1605 is UNSAT
Problem TDEAD1606 is UNSAT
Problem TDEAD1607 is UNSAT
Problem TDEAD1608 is UNSAT
Problem TDEAD1609 is UNSAT
Problem TDEAD1610 is UNSAT
Problem TDEAD1611 is UNSAT
Problem TDEAD1612 is UNSAT
Problem TDEAD1613 is UNSAT
Problem TDEAD1614 is UNSAT
Problem TDEAD1615 is UNSAT
Problem TDEAD1616 is UNSAT
Problem TDEAD1617 is UNSAT
Problem TDEAD1618 is UNSAT
Problem TDEAD1619 is UNSAT
Problem TDEAD1620 is UNSAT
Problem TDEAD1621 is UNSAT
Problem TDEAD1622 is UNSAT
Problem TDEAD1623 is UNSAT
Problem TDEAD1624 is UNSAT
Problem TDEAD1625 is UNSAT
Problem TDEAD1626 is UNSAT
Problem TDEAD1627 is UNSAT
Problem TDEAD1628 is UNSAT
Problem TDEAD1629 is UNSAT
Problem TDEAD1630 is UNSAT
Problem TDEAD1631 is UNSAT
Problem TDEAD1632 is UNSAT
Problem TDEAD1633 is UNSAT
Problem TDEAD1634 is UNSAT
Problem TDEAD1635 is UNSAT
Problem TDEAD1636 is UNSAT
Problem TDEAD1637 is UNSAT
Problem TDEAD1638 is UNSAT
Problem TDEAD1639 is UNSAT
Problem TDEAD1640 is UNSAT
Problem TDEAD1641 is UNSAT
Problem TDEAD1642 is UNSAT
Problem TDEAD1643 is UNSAT
Problem TDEAD1644 is UNSAT
Problem TDEAD1645 is UNSAT
Problem TDEAD1646 is UNSAT
Problem TDEAD1647 is UNSAT
Problem TDEAD1648 is UNSAT
Problem TDEAD1649 is UNSAT
Problem TDEAD1650 is UNSAT
Problem TDEAD1651 is UNSAT
Problem TDEAD1652 is UNSAT
Problem TDEAD1653 is UNSAT
Problem TDEAD1654 is UNSAT
Problem TDEAD1655 is UNSAT
Problem TDEAD1656 is UNSAT
Problem TDEAD1657 is UNSAT
Problem TDEAD1658 is UNSAT
Problem TDEAD1659 is UNSAT
Problem TDEAD1660 is UNSAT
Problem TDEAD1661 is UNSAT
Problem TDEAD1662 is UNSAT
Problem TDEAD1663 is UNSAT
Problem TDEAD1664 is UNSAT
Problem TDEAD1665 is UNSAT
Problem TDEAD1666 is UNSAT
Problem TDEAD1667 is UNSAT
Problem TDEAD1668 is UNSAT
Problem TDEAD1669 is UNSAT
[2024-06-01 06:25:27] [INFO ] Deduced a trap composed of 11 places in 133 ms of which 1 ms to minimize.
Problem TDEAD1740 is UNSAT
Problem TDEAD1741 is UNSAT
Problem TDEAD1742 is UNSAT
Problem TDEAD1743 is UNSAT
Problem TDEAD1744 is UNSAT
Problem TDEAD1745 is UNSAT
Problem TDEAD1746 is UNSAT
Problem TDEAD1747 is UNSAT
Problem TDEAD1748 is UNSAT
Problem TDEAD1749 is UNSAT
Problem TDEAD1750 is UNSAT
Problem TDEAD1751 is UNSAT
Problem TDEAD1752 is UNSAT
Problem TDEAD1753 is UNSAT
Problem TDEAD1754 is UNSAT
Problem TDEAD1755 is UNSAT
Problem TDEAD1756 is UNSAT
Problem TDEAD1757 is UNSAT
Problem TDEAD1758 is UNSAT
Problem TDEAD1759 is UNSAT
Problem TDEAD1760 is UNSAT
Problem TDEAD1761 is UNSAT
Problem TDEAD1762 is UNSAT
Problem TDEAD1763 is UNSAT
Problem TDEAD1764 is UNSAT
Problem TDEAD1765 is UNSAT
Problem TDEAD1766 is UNSAT
Problem TDEAD1767 is UNSAT
[2024-06-01 06:25:27] [INFO ] Deduced a trap composed of 8 places in 262 ms of which 1 ms to minimize.
Problem TDEAD1774 is UNSAT
Problem TDEAD1775 is UNSAT
[2024-06-01 06:25:28] [INFO ] Deduced a trap composed of 10 places in 160 ms of which 0 ms to minimize.
Problem TDEAD1776 is UNSAT
Problem TDEAD1777 is UNSAT
Problem TDEAD1778 is UNSAT
Problem TDEAD1779 is UNSAT
Problem TDEAD1780 is UNSAT
Problem TDEAD1781 is UNSAT
Problem TDEAD1782 is UNSAT
Problem TDEAD1783 is UNSAT
Problem TDEAD1784 is UNSAT
[2024-06-01 06:25:28] [INFO ] Deduced a trap composed of 10 places in 132 ms of which 1 ms to minimize.
Problem TDEAD1788 is UNSAT
Problem TDEAD1789 is UNSAT
Problem TDEAD1790 is UNSAT
Problem TDEAD1791 is UNSAT
Problem TDEAD1793 is UNSAT
Problem TDEAD1794 is UNSAT
Problem TDEAD1795 is UNSAT
Problem TDEAD1796 is UNSAT
Problem TDEAD1797 is UNSAT
Problem TDEAD1798 is UNSAT
Problem TDEAD1799 is UNSAT
Problem TDEAD1800 is UNSAT
Problem TDEAD1801 is UNSAT
Problem TDEAD1802 is UNSAT
Problem TDEAD1803 is UNSAT
Problem TDEAD1804 is UNSAT
Problem TDEAD1805 is UNSAT
Problem TDEAD1806 is UNSAT
Problem TDEAD1809 is UNSAT
Problem TDEAD1810 is UNSAT
Problem TDEAD1812 is UNSAT
Problem TDEAD1813 is UNSAT
[2024-06-01 06:25:28] [INFO ] Deduced a trap composed of 9 places in 179 ms of which 1 ms to minimize.
Problem TDEAD1814 is UNSAT
Problem TDEAD1815 is UNSAT
Problem TDEAD1816 is UNSAT
Problem TDEAD1817 is UNSAT
Problem TDEAD1818 is UNSAT
Problem TDEAD1819 is UNSAT
Problem TDEAD1820 is UNSAT
Problem TDEAD1821 is UNSAT
Problem TDEAD1822 is UNSAT
Problem TDEAD1823 is UNSAT
Problem TDEAD1824 is UNSAT
Problem TDEAD1825 is UNSAT
[2024-06-01 06:25:28] [INFO ] Deduced a trap composed of 11 places in 209 ms of which 0 ms to minimize.
Problem TDEAD1826 is UNSAT
Problem TDEAD1827 is UNSAT
Problem TDEAD1831 is UNSAT
Problem TDEAD1832 is UNSAT
Problem TDEAD1836 is UNSAT
Problem TDEAD1837 is UNSAT
Problem TDEAD1838 is UNSAT
Problem TDEAD1839 is UNSAT
Problem TDEAD1840 is UNSAT
Problem TDEAD1841 is UNSAT
Problem TDEAD1842 is UNSAT
Problem TDEAD1843 is UNSAT
Problem TDEAD1844 is UNSAT
Problem TDEAD1845 is UNSAT
Problem TDEAD1846 is UNSAT
Problem TDEAD1847 is UNSAT
Problem TDEAD1848 is UNSAT
Problem TDEAD2732 is UNSAT
Problem TDEAD2733 is UNSAT
Problem TDEAD2743 is UNSAT
Problem TDEAD2744 is UNSAT
Problem TDEAD2748 is UNSAT
Problem TDEAD2749 is UNSAT
Problem TDEAD2750 is UNSAT
Problem TDEAD2751 is UNSAT
Problem TDEAD2752 is UNSAT
Problem TDEAD2753 is UNSAT
Problem TDEAD2754 is UNSAT
Problem TDEAD2755 is UNSAT
Problem TDEAD2756 is UNSAT
Problem TDEAD2757 is UNSAT
Problem TDEAD2758 is UNSAT
Problem TDEAD2759 is UNSAT
Problem TDEAD2760 is UNSAT
Problem TDEAD2761 is UNSAT
Problem TDEAD2764 is UNSAT
Problem TDEAD2765 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD1498 is UNSAT
Problem TDEAD1499 is UNSAT
Problem TDEAD1500 is UNSAT
Problem TDEAD1501 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/231 variables, 13/21 constraints. Problems are: Problem set: 522 solved, 2243 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 231/2866 variables, and 21 constraints, problems are : Problem set: 522 solved, 2243 unsolved in 30108 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/231 constraints, ReadFeed: 0/255 constraints, PredecessorRefiner: 2765/2765 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 522 solved, 2243 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/223 variables, 7/7 constraints. Problems are: Problem set: 522 solved, 2243 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/223 variables, 13/20 constraints. Problems are: Problem set: 522 solved, 2243 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/223 variables, 0/20 constraints. Problems are: Problem set: 522 solved, 2243 unsolved
At refinement iteration 3 (OVERLAPS) 8/231 variables, 1/21 constraints. Problems are: Problem set: 522 solved, 2243 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/231 variables, 0/21 constraints. Problems are: Problem set: 522 solved, 2243 unsolved
At refinement iteration 5 (OVERLAPS) 2635/2866 variables, 231/252 constraints. Problems are: Problem set: 522 solved, 2243 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2866 variables, 255/507 constraints. Problems are: Problem set: 522 solved, 2243 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2866/2866 variables, and 2750 constraints, problems are : Problem set: 522 solved, 2243 unsolved in 35999 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 231/231 constraints, ReadFeed: 255/255 constraints, PredecessorRefiner: 2243/2765 constraints, Known Traps: 13/13 constraints]
After SMT, in 96727ms problems are : Problem set: 522 solved, 2243 unsolved
Search for dead transitions found 522 dead transitions in 96771ms
Found 522 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 522 transitions
Dead transitions reduction (with SMT) removed 522 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 231/231 places, 2244/2766 transitions.
Graph (complete) has 2785 edges and 231 vertex of which 223 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.15 ms
Discarding 8 places :
Also discarding 0 output transitions
Reduce places removed 27 places and 650 transitions.
Iterating post reduction 0 with 27 rules applied. Total rules applied 28 place count 196 transition count 1594
Reduce places removed 15 places and 269 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 43 place count 181 transition count 1325
Reduce places removed 9 places and 133 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 52 place count 172 transition count 1192
Reduce places removed 8 places and 90 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 60 place count 164 transition count 1102
Reduce places removed 1 places and 17 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 61 place count 163 transition count 1085
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 71 place count 153 transition count 1031
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 15 places and 231 transitions.
Iterating global reduction 5 with 25 rules applied. Total rules applied 96 place count 138 transition count 800
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 102 place count 132 transition count 746
Deduced a syphon composed of 6 places in 1 ms
Iterating global reduction 5 with 6 rules applied. Total rules applied 108 place count 132 transition count 746
Deduced a syphon composed of 6 places in 0 ms
Applied a total of 108 rules in 114 ms. Remains 132 /231 variables (removed 99) and now considering 746/2244 (removed 1498) transitions.
[2024-06-01 06:26:12] [INFO ] Flow matrix only has 683 transitions (discarded 63 similar events)
// Phase 1: matrix 683 rows 132 cols
[2024-06-01 06:26:12] [INFO ] Computed 13 invariants in 6 ms
[2024-06-01 06:26:12] [INFO ] Implicit Places using invariants in 318 ms returned []
[2024-06-01 06:26:12] [INFO ] Flow matrix only has 683 transitions (discarded 63 similar events)
[2024-06-01 06:26:12] [INFO ] Invariant cache hit.
[2024-06-01 06:26:12] [INFO ] State equation strengthened by 89 read => feed constraints.
[2024-06-01 06:26:12] [INFO ] Implicit Places using invariants and state equation in 475 ms returned []
Implicit Place search using SMT with State Equation took 798 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 132/231 places, 746/2766 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 99800 ms. Remains : 132/231 places, 746/2766 transitions.
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
FORMULA BugTracking-PT-q3m004-ReachabilityCardinality-2023-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m004-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m004-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40006 steps (15 resets) in 626 ms. (63 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (10 resets) in 136 ms. (291 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (13 resets) in 132 ms. (300 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 213418 steps, run timeout after 3001 ms. (steps per millisecond=71 ) properties seen :0 out of 2
Probabilistic random walk after 213418 steps, saw 105884 distinct states, run finished after 3001 ms. (steps per millisecond=71 ) properties seen :0
[2024-06-01 06:26:16] [INFO ] Flow matrix only has 683 transitions (discarded 63 similar events)
// Phase 1: matrix 683 rows 126 cols
[2024-06-01 06:26:16] [INFO ] Computed 7 invariants in 6 ms
[2024-06-01 06:26:16] [INFO ] State equation strengthened by 89 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 28/34 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 347/381 variables, 34/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/381 variables, 4/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/381 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 379/760 variables, 46/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/760 variables, 3/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/760 variables, 84/173 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/760 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 2/762 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/762 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 47/809 variables, 46/220 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/809 variables, 1/221 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/809 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/809 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/809 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 809/809 variables, and 222 constraints, problems are : Problem set: 0 solved, 2 unsolved in 469 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 126/126 constraints, ReadFeed: 89/89 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/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 28/34 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 347/381 variables, 34/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/381 variables, 4/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/381 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 379/760 variables, 46/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/760 variables, 3/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/760 variables, 84/173 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/760 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 2/762 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/762 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 47/809 variables, 46/220 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/809 variables, 1/221 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/809 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/809 variables, 2/224 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 06:26:17] [INFO ] Deduced a trap composed of 31 places in 103 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/809 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 06:26:17] [INFO ] Deduced a trap composed of 13 places in 169 ms of which 1 ms to minimize.
[2024-06-01 06:26:17] [INFO ] Deduced a trap composed of 7 places in 62 ms of which 0 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/809 variables, 2/227 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/809 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/809 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 809/809 variables, and 227 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1223 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 126/126 constraints, ReadFeed: 89/89 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints]
After SMT, in 1716ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 1072 ms.
Support contains 6 out of 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 746/746 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 125 transition count 742
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 125 transition count 742
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 125 transition count 741
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 124 transition count 741
Applied a total of 4 rules in 57 ms. Remains 124 /126 variables (removed 2) and now considering 741/746 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 124/126 places, 741/746 transitions.
RANDOM walk for 40001 steps (21 resets) in 534 ms. (74 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (12 resets) in 114 ms. (347 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (14 resets) in 139 ms. (285 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 309637 steps, run timeout after 3001 ms. (steps per millisecond=103 ) properties seen :0 out of 2
Probabilistic random walk after 309637 steps, saw 168671 distinct states, run finished after 3002 ms. (steps per millisecond=103 ) properties seen :0
[2024-06-01 06:26:22] [INFO ] Flow matrix only has 679 transitions (discarded 62 similar events)
// Phase 1: matrix 679 rows 124 cols
[2024-06-01 06:26:22] [INFO ] Computed 7 invariants in 6 ms
[2024-06-01 06:26:22] [INFO ] State equation strengthened by 89 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 28/34 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 347/381 variables, 34/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/381 variables, 4/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/381 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 374/755 variables, 45/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/755 variables, 3/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/755 variables, 84/172 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/755 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 2/757 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/757 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 46/803 variables, 45/218 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/803 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/803 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/803 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/803 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 803/803 variables, and 220 constraints, problems are : Problem set: 0 solved, 2 unsolved in 316 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 124/124 constraints, ReadFeed: 89/89 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/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 28/34 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 347/381 variables, 34/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/381 variables, 4/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/381 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 374/755 variables, 45/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/755 variables, 3/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/755 variables, 84/172 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/755 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 2/757 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/757 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 46/803 variables, 45/218 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/803 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/803 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/803 variables, 2/222 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 06:26:23] [INFO ] Deduced a trap composed of 17 places in 111 ms of which 2 ms to minimize.
[2024-06-01 06:26:23] [INFO ] Deduced a trap composed of 6 places in 76 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/803 variables, 2/224 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 06:26:23] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/803 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/803 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/803 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 803/803 variables, and 225 constraints, problems are : Problem set: 0 solved, 2 unsolved in 766 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 124/124 constraints, ReadFeed: 89/89 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints]
After SMT, in 1099ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 1158 ms.
Support contains 6 out of 124 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 124/124 places, 741/741 transitions.
Applied a total of 0 rules in 22 ms. Remains 124 /124 variables (removed 0) and now considering 741/741 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 124/124 places, 741/741 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 124/124 places, 741/741 transitions.
Applied a total of 0 rules in 8 ms. Remains 124 /124 variables (removed 0) and now considering 741/741 (removed 0) transitions.
[2024-06-01 06:26:24] [INFO ] Flow matrix only has 679 transitions (discarded 62 similar events)
[2024-06-01 06:26:24] [INFO ] Invariant cache hit.
[2024-06-01 06:26:24] [INFO ] Implicit Places using invariants in 165 ms returned []
[2024-06-01 06:26:24] [INFO ] Flow matrix only has 679 transitions (discarded 62 similar events)
[2024-06-01 06:26:24] [INFO ] Invariant cache hit.
[2024-06-01 06:26:25] [INFO ] State equation strengthened by 89 read => feed constraints.
[2024-06-01 06:26:25] [INFO ] Implicit Places using invariants and state equation in 316 ms returned []
Implicit Place search using SMT with State Equation took 484 ms to find 0 implicit places.
[2024-06-01 06:26:25] [INFO ] Redundant transitions in 15 ms returned []
Running 740 sub problems to find dead transitions.
[2024-06-01 06:26:25] [INFO ] Flow matrix only has 679 transitions (discarded 62 similar events)
[2024-06-01 06:26:25] [INFO ] Invariant cache hit.
[2024-06-01 06:26:25] [INFO ] State equation strengthened by 89 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 740 unsolved
[2024-06-01 06:26:29] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 0 ms to minimize.
Problem TDEAD730 is UNSAT
Problem TDEAD731 is UNSAT
Problem TDEAD739 is UNSAT
Problem TDEAD740 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 1/8 constraints. Problems are: Problem set: 4 solved, 736 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 124/803 variables, and 8 constraints, problems are : Problem set: 4 solved, 736 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/124 constraints, ReadFeed: 0/89 constraints, PredecessorRefiner: 740/740 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 4 solved, 736 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 7/7 constraints. Problems are: Problem set: 4 solved, 736 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 1/8 constraints. Problems are: Problem set: 4 solved, 736 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/8 constraints. Problems are: Problem set: 4 solved, 736 unsolved
Problem TDEAD419 is UNSAT
At refinement iteration 3 (OVERLAPS) 679/803 variables, 124/132 constraints. Problems are: Problem set: 5 solved, 735 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/803 variables, 89/221 constraints. Problems are: Problem set: 5 solved, 735 unsolved
Problem TDEAD105 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD703 is UNSAT
Problem TDEAD709 is UNSAT
Problem TDEAD713 is UNSAT
Problem TDEAD719 is UNSAT
Problem TDEAD723 is UNSAT
Problem TDEAD732 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/803 variables, 735/956 constraints. Problems are: Problem set: 81 solved, 659 unsolved
[2024-06-01 06:27:11] [INFO ] Deduced a trap composed of 7 places in 106 ms of which 2 ms to minimize.
[2024-06-01 06:27:12] [INFO ] Deduced a trap composed of 13 places in 94 ms of which 1 ms to minimize.
[2024-06-01 06:27:12] [INFO ] Deduced a trap composed of 9 places in 93 ms of which 2 ms to minimize.
[2024-06-01 06:27:12] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 0 ms to minimize.
[2024-06-01 06:27:12] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 0 ms to minimize.
[2024-06-01 06:27:13] [INFO ] Deduced a trap composed of 8 places in 80 ms of which 1 ms to minimize.
[2024-06-01 06:27:14] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
Problem TDEAD106 is UNSAT
[2024-06-01 06:27:14] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD271 is UNSAT
[2024-06-01 06:27:16] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 5 ms to minimize.
Problem TDEAD291 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD331 is UNSAT
[2024-06-01 06:27:17] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 1 ms to minimize.
Problem TDEAD399 is UNSAT
Problem TDEAD404 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/803 variables, 10/966 constraints. Problems are: Problem set: 133 solved, 607 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 803/803 variables, and 966 constraints, problems are : Problem set: 133 solved, 607 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 124/124 constraints, ReadFeed: 89/89 constraints, PredecessorRefiner: 735/740 constraints, Known Traps: 11/11 constraints]
After SMT, in 62325ms problems are : Problem set: 133 solved, 607 unsolved
Search for dead transitions found 133 dead transitions in 62335ms
Found 133 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 133 transitions
Dead transitions reduction (with SMT) removed 133 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 124/124 places, 608/741 transitions.
Graph (complete) has 865 edges and 124 vertex of which 121 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Reduce places removed 15 places and 213 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 106 transition count 395
Reduce places removed 7 places and 75 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 23 place count 99 transition count 320
Reduce places removed 3 places and 29 transitions.
Graph (complete) has 475 edges and 96 vertex of which 6 are kept as prefixes of interest. Removing 90 places using SCC suffix rule.0 ms
Discarding 90 places :
Also discarding 291 output transitions
Drop transitions (Output transitions of discarded places.) removed 291 transitions
Iterating post reduction 2 with 4 rules applied. Total rules applied 27 place count 6 transition count 0
Deduced a syphon composed of 6 places in 0 ms
Applied a total of 27 rules in 13 ms. Remains 6 /124 variables (removed 118) and now considering 0/608 (removed 608) transitions.
[2024-06-01 06:27:27] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 06:27:27] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-06-01 06:27:27] [INFO ] Invariant cache hit.
[2024-06-01 06:27:27] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 6/124 places, 0/741 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 62976 ms. Remains : 6/124 places, 0/741 transitions.
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
FORMULA BugTracking-PT-q3m004-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m004-ReachabilityCardinality-2023-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
All properties solved without resorting to model-checking.
Total runtime 212839 ms.
ITS solved all properties within timeout

BK_STOP 1717223247896

--------------------
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

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-q3m004"
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-q3m004, 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-171620399300334"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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