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.r047-tajo-171620398100380.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 greatspnxred
Input is BugTracking-PT-q3m256, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r047-tajo-171620398100380
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 11K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.3K 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 May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 17:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 140K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K 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-q3m256-LTLFireability-00
FORMULA_NAME BugTracking-PT-q3m256-LTLFireability-01
FORMULA_NAME BugTracking-PT-q3m256-LTLFireability-02
FORMULA_NAME BugTracking-PT-q3m256-LTLFireability-03
FORMULA_NAME BugTracking-PT-q3m256-LTLFireability-04
FORMULA_NAME BugTracking-PT-q3m256-LTLFireability-05
FORMULA_NAME BugTracking-PT-q3m256-LTLFireability-06
FORMULA_NAME BugTracking-PT-q3m256-LTLFireability-07
FORMULA_NAME BugTracking-PT-q3m256-LTLFireability-08
FORMULA_NAME BugTracking-PT-q3m256-LTLFireability-09
FORMULA_NAME BugTracking-PT-q3m256-LTLFireability-10
FORMULA_NAME BugTracking-PT-q3m256-LTLFireability-11
FORMULA_NAME BugTracking-PT-q3m256-LTLFireability-12
FORMULA_NAME BugTracking-PT-q3m256-LTLFireability-13
FORMULA_NAME BugTracking-PT-q3m256-LTLFireability-14
FORMULA_NAME BugTracking-PT-q3m256-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716296001187

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BugTracking-PT-q3m256
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 12:53:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-21 12:53:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 12:53:23] [INFO ] Load time of PNML (sax parser for PT used): 913 ms
[2024-05-21 12:53:23] [INFO ] Transformed 754 places.
[2024-05-21 12:53:23] [INFO ] Transformed 27370 transitions.
[2024-05-21 12:53:23] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 1167 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 18 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 514 places in 124 ms
Reduce places removed 514 places and 24601 transitions.
Initial state reduction rules removed 4 formulas.
FORMULA BugTracking-PT-q3m256-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 8 out of 240 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 240/240 places, 2769/2769 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 238 transition count 2769
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 237 transition count 2750
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 237 transition count 2750
Applied a total of 4 rules in 70 ms. Remains 237 /240 variables (removed 3) and now considering 2750/2769 (removed 19) transitions.
[2024-05-21 12:53:24] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
// Phase 1: matrix 2626 rows 237 cols
[2024-05-21 12:53:24] [INFO ] Computed 8 invariants in 48 ms
[2024-05-21 12:53:24] [INFO ] Implicit Places using invariants in 569 ms returned []
[2024-05-21 12:53:24] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
[2024-05-21 12:53:24] [INFO ] Invariant cache hit.
[2024-05-21 12:53:25] [INFO ] State equation strengthened by 240 read => feed constraints.
[2024-05-21 12:53:26] [INFO ] Implicit Places using invariants and state equation in 1635 ms returned []
Implicit Place search using SMT with State Equation took 2235 ms to find 0 implicit places.
Running 2748 sub problems to find dead transitions.
[2024-05-21 12:53:26] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
[2024-05-21 12:53:26] [INFO ] Invariant cache hit.
[2024-05-21 12:53:26] [INFO ] State equation strengthened by 240 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2748 unsolved
[2024-05-21 12:54:03] [INFO ] Deduced a trap composed of 10 places in 171 ms of which 10 ms to minimize.
[2024-05-21 12:54:03] [INFO ] Deduced a trap composed of 7 places in 167 ms of which 2 ms to minimize.
[2024-05-21 12:54:03] [INFO ] Deduced a trap composed of 21 places in 120 ms of which 1 ms to minimize.
[2024-05-21 12:54:10] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 1 ms to minimize.
Problem TDEAD1005 is UNSAT
Problem TDEAD1011 is UNSAT
Problem TDEAD1017 is UNSAT
Problem TDEAD1023 is UNSAT
Problem TDEAD1029 is UNSAT
Problem TDEAD1030 is UNSAT
Problem TDEAD1031 is UNSAT
Problem TDEAD1032 is UNSAT
Problem TDEAD1033 is UNSAT
Problem TDEAD1034 is UNSAT
Problem TDEAD1035 is UNSAT
Problem TDEAD1038 is UNSAT
Problem TDEAD1039 is UNSAT
Problem TDEAD1040 is UNSAT
Problem TDEAD2310 is UNSAT
Problem TDEAD2318 is UNSAT
[2024-05-21 12:54:19] [INFO ] Deduced a trap composed of 21 places in 80 ms of which 1 ms to minimize.
Problem TDEAD2319 is UNSAT
Problem TDEAD2329 is UNSAT
Problem TDEAD2330 is UNSAT
Problem TDEAD2333 is UNSAT
[2024-05-21 12:54:19] [INFO ] Deduced a trap composed of 12 places in 82 ms of which 1 ms to minimize.
Problem TDEAD2334 is UNSAT
Problem TDEAD2335 is UNSAT
Problem TDEAD2336 is UNSAT
Problem TDEAD2337 is UNSAT
Problem TDEAD2338 is UNSAT
Problem TDEAD2339 is UNSAT
Problem TDEAD2340 is UNSAT
Problem TDEAD2341 is UNSAT
[2024-05-21 12:54:19] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 1 ms to minimize.
Problem TDEAD2342 is UNSAT
[2024-05-21 12:54:19] [INFO ] Deduced a trap composed of 9 places in 95 ms of which 1 ms to minimize.
Problem TDEAD2343 is UNSAT
Problem TDEAD2344 is UNSAT
Problem TDEAD2345 is UNSAT
Problem TDEAD2346 is UNSAT
Problem TDEAD2347 is UNSAT
Problem TDEAD2348 is UNSAT
Problem TDEAD2349 is UNSAT
Problem TDEAD2350 is UNSAT
Problem TDEAD2351 is UNSAT
Problem TDEAD2352 is UNSAT
Problem TDEAD2356 is UNSAT
Problem TDEAD2364 is UNSAT
Problem TDEAD2365 is UNSAT
Problem TDEAD2375 is UNSAT
Problem TDEAD2376 is UNSAT
Problem TDEAD2379 is UNSAT
Problem TDEAD2380 is UNSAT
Problem TDEAD2381 is UNSAT
Problem TDEAD2382 is UNSAT
Problem TDEAD2383 is UNSAT
Problem TDEAD2384 is UNSAT
Problem TDEAD2385 is UNSAT
Problem TDEAD2386 is UNSAT
Problem TDEAD2387 is UNSAT
Problem TDEAD2391 is UNSAT
Problem TDEAD2392 is UNSAT
Problem TDEAD2393 is UNSAT
Problem TDEAD2394 is UNSAT
Problem TDEAD2395 is UNSAT
Problem TDEAD2396 is UNSAT
Problem TDEAD2397 is UNSAT
Problem TDEAD2398 is UNSAT
Problem TDEAD2399 is UNSAT
Problem TDEAD2400 is UNSAT
Problem TDEAD2401 is UNSAT
[2024-05-21 12:54:21] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 1 ms to minimize.
[2024-05-21 12:54:21] [INFO ] Deduced a trap composed of 10 places in 80 ms of which 1 ms to minimize.
SMT process timed out in 55481ms, After SMT, problems are : Problem set: 0 solved, 2748 unsolved
Search for dead transitions found 0 dead transitions in 55549ms
Starting structural reductions in LTL mode, iteration 1 : 237/240 places, 2750/2769 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57896 ms. Remains : 237/240 places, 2750/2769 transitions.
Support contains 8 out of 237 places after structural reductions.
[2024-05-21 12:54:22] [INFO ] Flatten gal took : 310 ms
[2024-05-21 12:54:22] [INFO ] Flatten gal took : 172 ms
[2024-05-21 12:54:22] [INFO ] Input system was already deterministic with 2750 transitions.
RANDOM walk for 40024 steps (21 resets) in 1674 ms. (23 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 312 ms. (127 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 144 ms. (275 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 130 ms. (305 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 131 ms. (303 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 124931 steps, run timeout after 3001 ms. (steps per millisecond=41 ) properties seen :0 out of 4
Probabilistic random walk after 124931 steps, saw 60407 distinct states, run finished after 3005 ms. (steps per millisecond=41 ) properties seen :0
[2024-05-21 12:54:26] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
[2024-05-21 12:54:26] [INFO ] Invariant cache hit.
[2024-05-21 12:54:26] [INFO ] State equation strengthened by 240 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 54/62 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1265/1327 variables, 62/65 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1327 variables, 105/170 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1327 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 930/2257 variables, 77/247 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2257 variables, 62/309 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2257 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 552/2809 variables, 58/367 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2809 variables, 2/369 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2809 variables, 64/433 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2809 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 5/2814 variables, 2/435 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2814 variables, 1/436 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2814 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 49/2863 variables, 39/475 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2863 variables, 1/476 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2863 variables, 9/485 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2863 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 0/2863 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2863/2863 variables, and 485 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1332 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 237/237 constraints, ReadFeed: 240/240 constraints, PredecessorRefiner: 4/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 54/62 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1265/1327 variables, 62/65 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1327 variables, 105/170 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1327 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 930/2257 variables, 77/247 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2257 variables, 62/309 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2257 variables, 3/312 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 12:54:29] [INFO ] Deduced a trap composed of 12 places in 110 ms of which 1 ms to minimize.
[2024-05-21 12:54:29] [INFO ] Deduced a trap composed of 21 places in 152 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/2257 variables, 2/314 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2257 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 552/2809 variables, 58/372 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2809 variables, 2/374 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2809 variables, 64/438 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2809 variables, 0/438 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 5/2814 variables, 2/440 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2814 variables, 1/441 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 12:54:31] [INFO ] Deduced a trap composed of 20 places in 270 ms of which 1 ms to minimize.
Problem AtomicPropp0 is UNSAT
[2024-05-21 12:54:31] [INFO ] Deduced a trap composed of 47 places in 267 ms of which 2 ms to minimize.
[2024-05-21 12:54:32] [INFO ] Deduced a trap composed of 51 places in 233 ms of which 2 ms to minimize.
[2024-05-21 12:54:32] [INFO ] Deduced a trap composed of 52 places in 254 ms of which 2 ms to minimize.
[2024-05-21 12:54:32] [INFO ] Deduced a trap composed of 41 places in 288 ms of which 2 ms to minimize.
[2024-05-21 12:54:33] [INFO ] Deduced a trap composed of 42 places in 295 ms of which 1 ms to minimize.
SMT process timed out in 6466ms, After SMT, problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 6 out of 237 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 237/237 places, 2750/2750 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 235 transition count 2753
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 10 place count 235 transition count 2747
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 16 place count 229 transition count 2747
Applied a total of 16 rules in 265 ms. Remains 229 /237 variables (removed 8) and now considering 2747/2750 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 268 ms. Remains : 229/237 places, 2747/2750 transitions.
RANDOM walk for 40489 steps (8 resets) in 51 ms. (778 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 211 ms. (188 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40000 steps (8 resets) in 185 ms. (215 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (8 resets) in 193 ms. (206 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 136128 steps, run timeout after 3001 ms. (steps per millisecond=45 ) properties seen :0 out of 3
Probabilistic random walk after 136128 steps, saw 63774 distinct states, run finished after 3001 ms. (steps per millisecond=45 ) properties seen :0
[2024-05-21 12:54:36] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2024-05-21 12:54:36] [INFO ] Computed 8 invariants in 15 ms
[2024-05-21 12:54:36] [INFO ] State equation strengthened by 241 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 53/59 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1263/1322 variables, 59/62 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1322 variables, 105/167 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1322 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 930/2252 variables, 78/245 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2252 variables, 62/307 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 12:54:37] [INFO ] Deduced a trap composed of 53 places in 170 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/2252 variables, 1/308 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/2252 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 560/2812 variables, 57/365 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2812 variables, 3/368 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2812 variables, 74/442 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2812 variables, 0/442 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 2/2814 variables, 1/443 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2814 variables, 2/445 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2814 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 33/2847 variables, 33/478 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2847 variables, 1/479 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2847 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 0/2847 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2847/2847 variables, and 479 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1637 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 229/229 constraints, ReadFeed: 241/241 constraints, PredecessorRefiner: 3/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 53/59 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1263/1322 variables, 59/62 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1322 variables, 105/167 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1322 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 930/2252 variables, 78/245 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2252 variables, 62/307 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2252 variables, 2/309 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2252 variables, 1/310 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2252 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 560/2812 variables, 57/367 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2812 variables, 3/370 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2812 variables, 74/444 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2812 variables, 0/444 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 2/2814 variables, 1/445 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2814 variables, 2/447 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2814 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 33/2847 variables, 33/480 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2847 variables, 1/481 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2847 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 0/2847 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2847/2847 variables, and 481 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2909 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 229/229 constraints, ReadFeed: 241/241 constraints, PredecessorRefiner: 3/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 4629ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 256 ms.
Support contains 6 out of 229 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 57 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 229/229 places, 2747/2747 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 54 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
[2024-05-21 12:54:41] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2024-05-21 12:54:41] [INFO ] Invariant cache hit.
[2024-05-21 12:54:41] [INFO ] Implicit Places using invariants in 344 ms returned []
[2024-05-21 12:54:41] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2024-05-21 12:54:41] [INFO ] Invariant cache hit.
[2024-05-21 12:54:42] [INFO ] State equation strengthened by 241 read => feed constraints.
[2024-05-21 12:54:43] [INFO ] Implicit Places using invariants and state equation in 1412 ms returned []
Implicit Place search using SMT with State Equation took 1770 ms to find 0 implicit places.
[2024-05-21 12:54:43] [INFO ] Redundant transitions in 204 ms returned []
Running 2746 sub problems to find dead transitions.
[2024-05-21 12:54:43] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2024-05-21 12:54:43] [INFO ] Invariant cache hit.
[2024-05-21 12:54:43] [INFO ] State equation strengthened by 241 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/229 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2746 unsolved
[2024-05-21 12:55:28] [INFO ] Deduced a trap composed of 6 places in 82 ms of which 2 ms to minimize.
[2024-05-21 12:55:31] [INFO ] Deduced a trap composed of 12 places in 80 ms of which 1 ms to minimize.
Problem TDEAD1480 is UNSAT
Problem TDEAD1481 is UNSAT
Problem TDEAD1482 is UNSAT
Problem TDEAD1483 is UNSAT
Problem TDEAD1485 is UNSAT
Problem TDEAD1486 is UNSAT
Problem TDEAD1489 is UNSAT
Problem TDEAD1490 is UNSAT
Problem TDEAD1491 is UNSAT
Problem TDEAD1492 is UNSAT
Problem TDEAD1495 is UNSAT
Problem TDEAD1496 is UNSAT
Problem TDEAD1497 is UNSAT
Problem TDEAD1498 is UNSAT
Problem TDEAD1501 is UNSAT
Problem TDEAD1502 is UNSAT
Problem TDEAD1503 is UNSAT
Problem TDEAD1504 is UNSAT
Problem TDEAD1506 is UNSAT
Problem TDEAD1507 is UNSAT
Problem TDEAD1510 is UNSAT
Problem TDEAD1511 is UNSAT
Problem TDEAD1512 is UNSAT
Problem TDEAD1513 is UNSAT
Problem TDEAD1516 is UNSAT
Problem TDEAD1517 is UNSAT
Problem TDEAD1518 is UNSAT
Problem TDEAD1519 is UNSAT
[2024-05-21 12:55:31] [INFO ] Deduced a trap composed of 8 places in 75 ms of which 1 ms to minimize.
Problem TDEAD1562 is UNSAT
Problem TDEAD1563 is UNSAT
Problem TDEAD1564 is UNSAT
Problem TDEAD1565 is UNSAT
Problem TDEAD1566 is UNSAT
Problem TDEAD1567 is UNSAT
Problem TDEAD1568 is UNSAT
Problem TDEAD1569 is UNSAT
Problem TDEAD1570 is UNSAT
Problem TDEAD1571 is UNSAT
Problem TDEAD1572 is UNSAT
Problem TDEAD1573 is UNSAT
Problem TDEAD1574 is UNSAT
Problem TDEAD1575 is UNSAT
Problem TDEAD1576 is UNSAT
Problem TDEAD1577 is UNSAT
Problem TDEAD1578 is UNSAT
Problem TDEAD1579 is UNSAT
Problem TDEAD1580 is UNSAT
Problem TDEAD1581 is UNSAT
Problem TDEAD1582 is UNSAT
Problem TDEAD1583 is UNSAT
Problem TDEAD1584 is UNSAT
Problem TDEAD1585 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
[2024-05-21 12:55:32] [INFO ] Deduced a trap composed of 11 places in 82 ms of which 0 ms to minimize.
Problem TDEAD1716 is UNSAT
Problem TDEAD1717 is UNSAT
Problem TDEAD1718 is UNSAT
Problem TDEAD1719 is UNSAT
Problem TDEAD1720 is UNSAT
Problem TDEAD1721 is UNSAT
Problem TDEAD1722 is UNSAT
Problem TDEAD1723 is UNSAT
Problem TDEAD1724 is UNSAT
Problem TDEAD1725 is UNSAT
Problem TDEAD1726 is UNSAT
Problem TDEAD1727 is UNSAT
Problem TDEAD1728 is UNSAT
Problem TDEAD1729 is UNSAT
Problem TDEAD1730 is UNSAT
Problem TDEAD1731 is UNSAT
Problem TDEAD1732 is UNSAT
Problem TDEAD1733 is UNSAT
Problem TDEAD1734 is UNSAT
Problem TDEAD1735 is UNSAT
Problem TDEAD1736 is UNSAT
Problem TDEAD1737 is UNSAT
Problem TDEAD1738 is UNSAT
Problem TDEAD1739 is UNSAT
Problem TDEAD1740 is UNSAT
Problem TDEAD1741 is UNSAT
Problem TDEAD1742 is UNSAT
Problem TDEAD1743 is UNSAT
Problem TDEAD1747 is UNSAT
Problem TDEAD1748 is UNSAT
[2024-05-21 12:55:32] [INFO ] Deduced a trap composed of 8 places in 106 ms of which 1 ms to minimize.
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 TDEAD1763 is UNSAT
Problem TDEAD1764 is UNSAT
Problem TDEAD1766 is UNSAT
Problem TDEAD1767 is UNSAT
[2024-05-21 12:55:32] [INFO ] Deduced a trap composed of 9 places in 107 ms of which 1 ms to minimize.
Problem TDEAD1768 is UNSAT
Problem TDEAD1769 is UNSAT
Problem TDEAD1770 is UNSAT
Problem TDEAD1771 is UNSAT
Problem TDEAD1772 is UNSAT
Problem TDEAD1773 is UNSAT
Problem TDEAD1774 is UNSAT
Problem TDEAD1775 is UNSAT
Problem TDEAD1776 is UNSAT
Problem TDEAD1780 is UNSAT
Problem TDEAD1781 is UNSAT
Problem TDEAD1782 is UNSAT
Problem TDEAD1783 is UNSAT
Problem TDEAD1785 is UNSAT
Problem TDEAD1786 is UNSAT
Problem TDEAD1790 is UNSAT
Problem TDEAD1791 is UNSAT
Problem TDEAD1792 is UNSAT
Problem TDEAD1793 is UNSAT
Problem TDEAD1794 is UNSAT
Problem TDEAD1795 is UNSAT
[2024-05-21 12:55:32] [INFO ] Deduced a trap composed of 10 places in 106 ms of which 1 ms to minimize.
Problem TDEAD1796 is UNSAT
Problem TDEAD1797 is UNSAT
Problem TDEAD1798 is UNSAT
Problem TDEAD1801 is UNSAT
Problem TDEAD1802 is UNSAT
Problem TDEAD1804 is UNSAT
Problem TDEAD1805 is UNSAT
[2024-05-21 12:55:32] [INFO ] Deduced a trap composed of 8 places in 98 ms of which 1 ms to minimize.
Problem TDEAD1806 is UNSAT
Problem TDEAD1807 is UNSAT
Problem TDEAD1808 is UNSAT
Problem TDEAD1809 is UNSAT
Problem TDEAD1810 is UNSAT
Problem TDEAD1811 is UNSAT
Problem TDEAD1812 is UNSAT
Problem TDEAD1813 is UNSAT
Problem TDEAD1814 is UNSAT
Problem TDEAD1815 is UNSAT
Problem TDEAD1816 is UNSAT
Problem TDEAD1817 is UNSAT
Problem TDEAD1818 is UNSAT
Problem TDEAD1819 is UNSAT
[2024-05-21 12:55:38] [INFO ] Deduced a trap composed of 13 places in 94 ms of which 1 ms to minimize.
Problem TDEAD2683 is UNSAT
Problem TDEAD2695 is UNSAT
[2024-05-21 12:55:38] [INFO ] Deduced a trap composed of 22 places in 74 ms of which 0 ms to minimize.
Problem TDEAD2709 is UNSAT
Problem TDEAD2710 is UNSAT
Problem TDEAD2720 is UNSAT
Problem TDEAD2721 is UNSAT
Problem TDEAD2732 is UNSAT
Problem TDEAD2733 is UNSAT
Problem TDEAD2743 is UNSAT
Problem TDEAD2744 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 TDEAD1456 is UNSAT
Problem TDEAD1457 is UNSAT
Problem TDEAD1458 is UNSAT
Problem TDEAD1459 is UNSAT
Problem TDEAD1460 is UNSAT
Problem TDEAD1461 is UNSAT
Problem TDEAD1462 is UNSAT
Problem TDEAD1467 is UNSAT
Problem TDEAD1468 is UNSAT
Problem TDEAD1469 is UNSAT
Problem TDEAD1470 is UNSAT
Problem TDEAD1471 is UNSAT
Problem TDEAD1472 is UNSAT
Problem TDEAD1473 is UNSAT
Problem TDEAD1474 is UNSAT
Problem TDEAD1475 is UNSAT
Problem TDEAD1476 is UNSAT
Problem TDEAD1477 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/229 variables, 10/18 constraints. Problems are: Problem set: 236 solved, 2510 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 229/2847 variables, and 18 constraints, problems are : Problem set: 236 solved, 2510 unsolved in 30058 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/229 constraints, ReadFeed: 0/241 constraints, PredecessorRefiner: 2746/2746 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 236 solved, 2510 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/221 variables, 7/7 constraints. Problems are: Problem set: 236 solved, 2510 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/221 variables, 10/17 constraints. Problems are: Problem set: 236 solved, 2510 unsolved
[2024-05-21 12:55:51] [INFO ] Deduced a trap composed of 10 places in 96 ms of which 1 ms to minimize.
Problem TDEAD1433 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
[2024-05-21 12:55:51] [INFO ] Deduced a trap composed of 8 places in 70 ms of which 1 ms to minimize.
Problem TDEAD1440 is UNSAT
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 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
At refinement iteration 2 (INCLUDED_ONLY) 0/221 variables, 2/19 constraints. Problems are: Problem set: 506 solved, 2240 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/221 variables, 0/19 constraints. Problems are: Problem set: 506 solved, 2240 unsolved
At refinement iteration 4 (OVERLAPS) 8/229 variables, 1/20 constraints. Problems are: Problem set: 506 solved, 2240 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 229/2847 variables, and 20 constraints, problems are : Problem set: 506 solved, 2240 unsolved in 30050 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/229 constraints, ReadFeed: 0/241 constraints, PredecessorRefiner: 0/2746 constraints, Known Traps: 12/12 constraints]
After SMT, in 88248ms problems are : Problem set: 506 solved, 2240 unsolved
Search for dead transitions found 506 dead transitions in 88286ms
Found 506 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 506 transitions
Dead transitions reduction (with SMT) removed 506 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 229/229 places, 2241/2747 transitions.
Graph (complete) has 2782 edges and 229 vertex of which 221 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.4 ms
Discarding 8 places :
Also discarding 0 output transitions
Reduce places removed 29 places and 650 transitions.
Iterating post reduction 0 with 29 rules applied. Total rules applied 30 place count 192 transition count 1591
Reduce places removed 15 places and 271 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 45 place count 177 transition count 1320
Reduce places removed 10 places and 132 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 55 place count 167 transition count 1188
Reduce places removed 8 places and 89 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 63 place count 159 transition count 1099
Reduce places removed 1 places and 17 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 64 place count 158 transition count 1082
Discarding 12 places :
Symmetric choice reduction at 5 with 12 rule applications. Total rules 76 place count 146 transition count 1022
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 16 places and 231 transitions.
Iterating global reduction 5 with 28 rules applied. Total rules applied 104 place count 130 transition count 791
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 111 place count 123 transition count 728
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 5 with 7 rules applied. Total rules applied 118 place count 123 transition count 728
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 118 rules in 71 ms. Remains 123 /229 variables (removed 106) and now considering 728/2241 (removed 1513) transitions.
[2024-05-21 12:56:11] [INFO ] Flow matrix only has 666 transitions (discarded 62 similar events)
// Phase 1: matrix 666 rows 123 cols
[2024-05-21 12:56:11] [INFO ] Computed 8 invariants in 3 ms
[2024-05-21 12:56:12] [INFO ] Implicit Places using invariants in 173 ms returned []
[2024-05-21 12:56:12] [INFO ] Flow matrix only has 666 transitions (discarded 62 similar events)
[2024-05-21 12:56:12] [INFO ] Invariant cache hit.
[2024-05-21 12:56:12] [INFO ] State equation strengthened by 87 read => feed constraints.
[2024-05-21 12:56:12] [INFO ] Implicit Places using invariants and state equation in 301 ms returned []
Implicit Place search using SMT with State Equation took 475 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 123/229 places, 728/2747 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 90880 ms. Remains : 123/229 places, 728/2747 transitions.
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Successfully simplified 3 atomic propositions for a total of 2 simplifications.
FORMULA BugTracking-PT-q3m256-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 6 stabilizing places and 111 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 237 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 237/237 places, 2750/2750 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 235 transition count 2753
Applied a total of 4 rules in 71 ms. Remains 235 /237 variables (removed 2) and now considering 2753/2750 (removed -3) transitions.
[2024-05-21 12:56:12] [INFO ] Flow matrix only has 2624 transitions (discarded 129 similar events)
// Phase 1: matrix 2624 rows 235 cols
[2024-05-21 12:56:12] [INFO ] Computed 8 invariants in 9 ms
[2024-05-21 12:56:13] [INFO ] Implicit Places using invariants in 407 ms returned []
[2024-05-21 12:56:13] [INFO ] Flow matrix only has 2624 transitions (discarded 129 similar events)
[2024-05-21 12:56:13] [INFO ] Invariant cache hit.
[2024-05-21 12:56:13] [INFO ] State equation strengthened by 241 read => feed constraints.
[2024-05-21 12:56:14] [INFO ] Implicit Places using invariants and state equation in 1302 ms returned []
Implicit Place search using SMT with State Equation took 1710 ms to find 0 implicit places.
[2024-05-21 12:56:14] [INFO ] Redundant transitions in 132 ms returned []
Running 2751 sub problems to find dead transitions.
[2024-05-21 12:56:14] [INFO ] Flow matrix only has 2624 transitions (discarded 129 similar events)
[2024-05-21 12:56:14] [INFO ] Invariant cache hit.
[2024-05-21 12:56:14] [INFO ] State equation strengthened by 241 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2751 unsolved
[2024-05-21 12:56:53] [INFO ] Deduced a trap composed of 10 places in 121 ms of which 1 ms to minimize.
[2024-05-21 12:56:53] [INFO ] Deduced a trap composed of 7 places in 114 ms of which 1 ms to minimize.
[2024-05-21 12:56:53] [INFO ] Deduced a trap composed of 21 places in 96 ms of which 1 ms to minimize.
[2024-05-21 12:57:01] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 5 ms to minimize.
Problem TDEAD1005 is UNSAT
Problem TDEAD1011 is UNSAT
Problem TDEAD1017 is UNSAT
Problem TDEAD1023 is UNSAT
Problem TDEAD1029 is UNSAT
Problem TDEAD1030 is UNSAT
Problem TDEAD1031 is UNSAT
Problem TDEAD1032 is UNSAT
Problem TDEAD1033 is UNSAT
Problem TDEAD1034 is UNSAT
Problem TDEAD1035 is UNSAT
Problem TDEAD1038 is UNSAT
Problem TDEAD1039 is UNSAT
Problem TDEAD1040 is UNSAT
Problem TDEAD2303 is UNSAT
Problem TDEAD2311 is UNSAT
[2024-05-21 12:57:11] [INFO ] Deduced a trap composed of 21 places in 75 ms of which 1 ms to minimize.
Problem TDEAD2312 is UNSAT
Problem TDEAD2322 is UNSAT
Problem TDEAD2323 is UNSAT
Problem TDEAD2326 is UNSAT
[2024-05-21 12:57:11] [INFO ] Deduced a trap composed of 12 places in 78 ms of which 0 ms to minimize.
Problem TDEAD2327 is UNSAT
Problem TDEAD2328 is UNSAT
Problem TDEAD2329 is UNSAT
Problem TDEAD2330 is UNSAT
Problem TDEAD2331 is UNSAT
Problem TDEAD2332 is UNSAT
Problem TDEAD2333 is UNSAT
Problem TDEAD2334 is UNSAT
[2024-05-21 12:57:12] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 1 ms to minimize.
Problem TDEAD2335 is UNSAT
[2024-05-21 12:57:12] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 0 ms to minimize.
Problem TDEAD2336 is UNSAT
Problem TDEAD2337 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 TDEAD2349 is UNSAT
Problem TDEAD2357 is UNSAT
Problem TDEAD2358 is UNSAT
Problem TDEAD2368 is UNSAT
Problem TDEAD2369 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
Problem TDEAD2384 is UNSAT
Problem TDEAD2385 is UNSAT
Problem TDEAD2386 is UNSAT
Problem TDEAD2387 is UNSAT
Problem TDEAD2388 is UNSAT
Problem TDEAD2389 is UNSAT
Problem TDEAD2390 is UNSAT
Problem TDEAD2391 is UNSAT
Problem TDEAD2392 is UNSAT
Problem TDEAD2393 is UNSAT
Problem TDEAD2394 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 234/2859 variables, and 16 constraints, problems are : Problem set: 64 solved, 2687 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/235 constraints, ReadFeed: 0/241 constraints, PredecessorRefiner: 2751/2751 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 64 solved, 2687 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 8/8 constraints. Problems are: Problem set: 64 solved, 2687 unsolved
Problem TDEAD1890 is UNSAT
Problem TDEAD1891 is UNSAT
Problem TDEAD1892 is UNSAT
Problem TDEAD1893 is UNSAT
Problem TDEAD1894 is UNSAT
Problem TDEAD1895 is UNSAT
Problem TDEAD1896 is UNSAT
Problem TDEAD1897 is UNSAT
Problem TDEAD1898 is UNSAT
Problem TDEAD1900 is UNSAT
Problem TDEAD1901 is UNSAT
Problem TDEAD1902 is UNSAT
Problem TDEAD1906 is UNSAT
Problem TDEAD1907 is UNSAT
Problem TDEAD1908 is UNSAT
Problem TDEAD1909 is UNSAT
Problem TDEAD1910 is UNSAT
Problem TDEAD1911 is UNSAT
Problem TDEAD1912 is UNSAT
Problem TDEAD1913 is UNSAT
Problem TDEAD1914 is UNSAT
Problem TDEAD1917 is UNSAT
Problem TDEAD1918 is UNSAT
Problem TDEAD1919 is UNSAT
Problem TDEAD1920 is UNSAT
Problem TDEAD1921 is UNSAT
Problem TDEAD1922 is UNSAT
Problem TDEAD1926 is UNSAT
Problem TDEAD1927 is UNSAT
Problem TDEAD1928 is UNSAT
Problem TDEAD1929 is UNSAT
Problem TDEAD1930 is UNSAT
Problem TDEAD1931 is UNSAT
Problem TDEAD1932 is UNSAT
Problem TDEAD1933 is UNSAT
Problem TDEAD1934 is UNSAT
Problem TDEAD1936 is UNSAT
Problem TDEAD1937 is UNSAT
Problem TDEAD1938 is UNSAT
Problem TDEAD1942 is UNSAT
Problem TDEAD1943 is UNSAT
Problem TDEAD1944 is UNSAT
Problem TDEAD1945 is UNSAT
Problem TDEAD1946 is UNSAT
Problem TDEAD1947 is UNSAT
Problem TDEAD1948 is UNSAT
Problem TDEAD1949 is UNSAT
Problem TDEAD1950 is UNSAT
Problem TDEAD1953 is UNSAT
Problem TDEAD1954 is UNSAT
Problem TDEAD1955 is UNSAT
Problem TDEAD1956 is UNSAT
Problem TDEAD1957 is UNSAT
Problem TDEAD1958 is UNSAT
Problem TDEAD1959 is UNSAT
Problem TDEAD1960 is UNSAT
Problem TDEAD1961 is UNSAT
Problem TDEAD1962 is UNSAT
Problem TDEAD1963 is UNSAT
Problem TDEAD1964 is UNSAT
Problem TDEAD1965 is UNSAT
Problem TDEAD1966 is UNSAT
Problem TDEAD1967 is UNSAT
Problem TDEAD1968 is UNSAT
Problem TDEAD1969 is UNSAT
Problem TDEAD1970 is UNSAT
Problem TDEAD1971 is UNSAT
Problem TDEAD1972 is UNSAT
Problem TDEAD1973 is UNSAT
Problem TDEAD1974 is UNSAT
Problem TDEAD1975 is UNSAT
Problem TDEAD1976 is UNSAT
Problem TDEAD1977 is UNSAT
Problem TDEAD1978 is UNSAT
Problem TDEAD1979 is UNSAT
Problem TDEAD1980 is UNSAT
Problem TDEAD1981 is UNSAT
Problem TDEAD1982 is UNSAT
Problem TDEAD1983 is UNSAT
Problem TDEAD1984 is UNSAT
Problem TDEAD1985 is UNSAT
Problem TDEAD1986 is UNSAT
Problem TDEAD1987 is UNSAT
Problem TDEAD1988 is UNSAT
Problem TDEAD1989 is UNSAT
Problem TDEAD1990 is UNSAT
Problem TDEAD1991 is UNSAT
Problem TDEAD1992 is UNSAT
Problem TDEAD1993 is UNSAT
Problem TDEAD1994 is UNSAT
Problem TDEAD1995 is UNSAT
Problem TDEAD1996 is UNSAT
Problem TDEAD1997 is UNSAT
Problem TDEAD1998 is UNSAT
Problem TDEAD1999 is UNSAT
Problem TDEAD2000 is UNSAT
Problem TDEAD2001 is UNSAT
Problem TDEAD2002 is UNSAT
Problem TDEAD2003 is UNSAT
Problem TDEAD2004 is UNSAT
Problem TDEAD2005 is UNSAT
Problem TDEAD2006 is UNSAT
Problem TDEAD2007 is UNSAT
Problem TDEAD2008 is UNSAT
Problem TDEAD2009 is UNSAT
Problem TDEAD2010 is UNSAT
Problem TDEAD2011 is UNSAT
Problem TDEAD2012 is UNSAT
Problem TDEAD2013 is UNSAT
Problem TDEAD2014 is UNSAT
Problem TDEAD2015 is UNSAT
Problem TDEAD2016 is UNSAT
Problem TDEAD2017 is UNSAT
Problem TDEAD2018 is UNSAT
Problem TDEAD2019 is UNSAT
Problem TDEAD2020 is UNSAT
Problem TDEAD2021 is UNSAT
Problem TDEAD2022 is UNSAT
Problem TDEAD2023 is UNSAT
Problem TDEAD2024 is UNSAT
Problem TDEAD2025 is UNSAT
Problem TDEAD2026 is UNSAT
Problem TDEAD2027 is UNSAT
Problem TDEAD2028 is UNSAT
Problem TDEAD2029 is UNSAT
Problem TDEAD2030 is UNSAT
Problem TDEAD2103 is UNSAT
Problem TDEAD2104 is UNSAT
Problem TDEAD2105 is UNSAT
Problem TDEAD2106 is UNSAT
Problem TDEAD2107 is UNSAT
Problem TDEAD2108 is UNSAT
Problem TDEAD2109 is UNSAT
Problem TDEAD2110 is UNSAT
Problem TDEAD2111 is UNSAT
Problem TDEAD2112 is UNSAT
Problem TDEAD2113 is UNSAT
Problem TDEAD2114 is UNSAT
Problem TDEAD2115 is UNSAT
Problem TDEAD2116 is UNSAT
Problem TDEAD2117 is UNSAT
Problem TDEAD2118 is UNSAT
Problem TDEAD2119 is UNSAT
Problem TDEAD2120 is UNSAT
Problem TDEAD2121 is UNSAT
Problem TDEAD2122 is UNSAT
Problem TDEAD2123 is UNSAT
Problem TDEAD2124 is UNSAT
Problem TDEAD2125 is UNSAT
Problem TDEAD2126 is UNSAT
Problem TDEAD2127 is UNSAT
Problem TDEAD2128 is UNSAT
Problem TDEAD2129 is UNSAT
Problem TDEAD2130 is UNSAT
Problem TDEAD2131 is UNSAT
Problem TDEAD2132 is UNSAT
Problem TDEAD2133 is UNSAT
Problem TDEAD2134 is UNSAT
Problem TDEAD2135 is UNSAT
Problem TDEAD2136 is UNSAT
Problem TDEAD2137 is UNSAT
Problem TDEAD2138 is UNSAT
Problem TDEAD2139 is UNSAT
Problem TDEAD2140 is UNSAT
Problem TDEAD2141 is UNSAT
Problem TDEAD2142 is UNSAT
Problem TDEAD2143 is UNSAT
Problem TDEAD2144 is UNSAT
Problem TDEAD2145 is UNSAT
Problem TDEAD2146 is UNSAT
Problem TDEAD2147 is UNSAT
Problem TDEAD2148 is UNSAT
Problem TDEAD2149 is UNSAT
Problem TDEAD2150 is UNSAT
Problem TDEAD2151 is UNSAT
Problem TDEAD2152 is UNSAT
Problem TDEAD2153 is UNSAT
Problem TDEAD2154 is UNSAT
Problem TDEAD2155 is UNSAT
Problem TDEAD2156 is UNSAT
Problem TDEAD2157 is UNSAT
Problem TDEAD2158 is UNSAT
Problem TDEAD2159 is UNSAT
Problem TDEAD2160 is UNSAT
Problem TDEAD2161 is UNSAT
Problem TDEAD2162 is UNSAT
Problem TDEAD2163 is UNSAT
Problem TDEAD2164 is UNSAT
Problem TDEAD2165 is UNSAT
Problem TDEAD2166 is UNSAT
Problem TDEAD2167 is UNSAT
Problem TDEAD2168 is UNSAT
Problem TDEAD2169 is UNSAT
Problem TDEAD2170 is UNSAT
Problem TDEAD2171 is UNSAT
Problem TDEAD2172 is UNSAT
Problem TDEAD2173 is UNSAT
Problem TDEAD2174 is UNSAT
Problem TDEAD2175 is UNSAT
Problem TDEAD2176 is UNSAT
Problem TDEAD2177 is UNSAT
Problem TDEAD2178 is UNSAT
Problem TDEAD2179 is UNSAT
Problem TDEAD2180 is UNSAT
Problem TDEAD2181 is UNSAT
Problem TDEAD2182 is UNSAT
Problem TDEAD2183 is UNSAT
Problem TDEAD2184 is UNSAT
Problem TDEAD2185 is UNSAT
Problem TDEAD2186 is UNSAT
Problem TDEAD2187 is UNSAT
Problem TDEAD2188 is UNSAT
Problem TDEAD2189 is UNSAT
Problem TDEAD2190 is UNSAT
Problem TDEAD2191 is UNSAT
Problem TDEAD2192 is UNSAT
Problem TDEAD2193 is UNSAT
Problem TDEAD2194 is UNSAT
Problem TDEAD2195 is UNSAT
Problem TDEAD2196 is UNSAT
Problem TDEAD2197 is UNSAT
Problem TDEAD2198 is UNSAT
Problem TDEAD2199 is UNSAT
Problem TDEAD2200 is UNSAT
Problem TDEAD2201 is UNSAT
Problem TDEAD2202 is UNSAT
Problem TDEAD2203 is UNSAT
Problem TDEAD2204 is UNSAT
Problem TDEAD2205 is UNSAT
Problem TDEAD2206 is UNSAT
Problem TDEAD2207 is UNSAT
Problem TDEAD2208 is UNSAT
Problem TDEAD2209 is UNSAT
Problem TDEAD2210 is UNSAT
Problem TDEAD2211 is UNSAT
Problem TDEAD2212 is UNSAT
Problem TDEAD2213 is UNSAT
Problem TDEAD2214 is UNSAT
Problem TDEAD2215 is UNSAT
Problem TDEAD2216 is UNSAT
Problem TDEAD2217 is UNSAT
Problem TDEAD2218 is UNSAT
Problem TDEAD2219 is UNSAT
Problem TDEAD2220 is UNSAT
Problem TDEAD2221 is UNSAT
Problem TDEAD2222 is UNSAT
Problem TDEAD2223 is UNSAT
Problem TDEAD2224 is UNSAT
Problem TDEAD2225 is UNSAT
Problem TDEAD2226 is UNSAT
Problem TDEAD2227 is UNSAT
Problem TDEAD2228 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/234 variables, 8/16 constraints. Problems are: Problem set: 316 solved, 2435 unsolved
[2024-05-21 12:57:29] [INFO ] Deduced a trap composed of 12 places in 71 ms of which 1 ms to minimize.
Problem TDEAD2663 is UNSAT
Problem TDEAD2664 is UNSAT
Problem TDEAD2665 is UNSAT
[2024-05-21 12:57:29] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 1 ms to minimize.
Problem TDEAD2666 is UNSAT
[2024-05-21 12:57:29] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 0 ms to minimize.
Problem TDEAD2667 is UNSAT
[2024-05-21 12:57:29] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 0 ms to minimize.
Problem TDEAD2668 is UNSAT
Problem TDEAD2669 is UNSAT
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
[2024-05-21 12:57:29] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 0 ms to minimize.
Problem TDEAD2680 is UNSAT
Problem TDEAD2681 is UNSAT
[2024-05-21 12:57:29] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 0 ms to minimize.
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
Problem TDEAD2691 is UNSAT
Problem TDEAD2692 is UNSAT
Problem TDEAD2693 is UNSAT
[2024-05-21 12:57:29] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
Problem TDEAD2694 is UNSAT
[2024-05-21 12:57:30] [INFO ] Deduced a trap composed of 8 places in 62 ms of which 1 ms to minimize.
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 TDEAD2707 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 TDEAD2718 is UNSAT
Problem TDEAD2719 is UNSAT
Problem TDEAD2720 is UNSAT
Problem TDEAD2721 is UNSAT
Problem TDEAD2722 is UNSAT
Problem TDEAD2723 is UNSAT
Problem TDEAD2724 is UNSAT
Problem TDEAD2725 is UNSAT
Problem TDEAD2726 is UNSAT
Problem TDEAD2727 is UNSAT
Problem TDEAD2728 is UNSAT
Problem TDEAD2729 is UNSAT
Problem TDEAD2730 is UNSAT
Problem TDEAD2731 is UNSAT
Problem TDEAD2732 is UNSAT
Problem TDEAD2733 is UNSAT
Problem TDEAD2734 is UNSAT
[2024-05-21 12:57:30] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 0 ms to minimize.
Problem TDEAD2735 is UNSAT
Problem TDEAD2736 is UNSAT
Problem TDEAD2397 is UNSAT
Problem TDEAD2398 is UNSAT
Problem TDEAD2399 is UNSAT
Problem TDEAD2400 is UNSAT
Problem TDEAD2402 is UNSAT
Problem TDEAD2403 is UNSAT
Problem TDEAD2406 is UNSAT
Problem TDEAD2407 is UNSAT
Problem TDEAD2408 is UNSAT
Problem TDEAD2409 is UNSAT
Problem TDEAD2412 is UNSAT
Problem TDEAD2413 is UNSAT
Problem TDEAD2414 is UNSAT
Problem TDEAD2415 is UNSAT
Problem TDEAD2418 is UNSAT
Problem TDEAD2419 is UNSAT
Problem TDEAD2420 is UNSAT
Problem TDEAD2421 is UNSAT
Problem TDEAD2423 is UNSAT
Problem TDEAD2424 is UNSAT
Problem TDEAD2427 is UNSAT
Problem TDEAD2428 is UNSAT
Problem TDEAD2429 is UNSAT
Problem TDEAD2430 is UNSAT
Problem TDEAD2433 is UNSAT
Problem TDEAD2434 is UNSAT
Problem TDEAD2435 is UNSAT
Problem TDEAD2436 is UNSAT
Problem TDEAD2479 is UNSAT
Problem TDEAD2480 is UNSAT
Problem TDEAD2481 is UNSAT
Problem TDEAD2482 is UNSAT
Problem TDEAD2483 is UNSAT
Problem TDEAD2484 is UNSAT
Problem TDEAD2485 is UNSAT
Problem TDEAD2486 is UNSAT
Problem TDEAD2487 is UNSAT
Problem TDEAD2488 is UNSAT
Problem TDEAD2489 is UNSAT
Problem TDEAD2490 is UNSAT
Problem TDEAD2491 is UNSAT
Problem TDEAD2492 is UNSAT
Problem TDEAD2493 is UNSAT
Problem TDEAD2494 is UNSAT
Problem TDEAD2495 is UNSAT
Problem TDEAD2496 is UNSAT
Problem TDEAD2497 is UNSAT
Problem TDEAD2498 is UNSAT
Problem TDEAD2499 is UNSAT
Problem TDEAD2500 is UNSAT
Problem TDEAD2501 is UNSAT
Problem TDEAD2502 is UNSAT
Problem TDEAD2503 is UNSAT
Problem TDEAD2504 is UNSAT
Problem TDEAD2505 is UNSAT
Problem TDEAD2506 is UNSAT
Problem TDEAD2507 is UNSAT
Problem TDEAD2508 is UNSAT
Problem TDEAD2509 is UNSAT
Problem TDEAD2510 is UNSAT
Problem TDEAD2511 is UNSAT
Problem TDEAD2512 is UNSAT
Problem TDEAD2513 is UNSAT
Problem TDEAD2514 is UNSAT
Problem TDEAD2515 is UNSAT
Problem TDEAD2516 is UNSAT
Problem TDEAD2517 is UNSAT
Problem TDEAD2518 is UNSAT
Problem TDEAD2519 is UNSAT
Problem TDEAD2520 is UNSAT
Problem TDEAD2521 is UNSAT
Problem TDEAD2522 is UNSAT
Problem TDEAD2523 is UNSAT
Problem TDEAD2524 is UNSAT
Problem TDEAD2525 is UNSAT
Problem TDEAD2526 is UNSAT
Problem TDEAD2527 is UNSAT
Problem TDEAD2528 is UNSAT
Problem TDEAD2529 is UNSAT
Problem TDEAD2530 is UNSAT
Problem TDEAD2531 is UNSAT
Problem TDEAD2532 is UNSAT
Problem TDEAD2533 is UNSAT
Problem TDEAD2534 is UNSAT
Problem TDEAD2535 is UNSAT
Problem TDEAD2536 is UNSAT
Problem TDEAD2537 is UNSAT
Problem TDEAD2538 is UNSAT
Problem TDEAD2539 is UNSAT
Problem TDEAD2540 is UNSAT
Problem TDEAD2541 is UNSAT
Problem TDEAD2542 is UNSAT
Problem TDEAD2543 is UNSAT
Problem TDEAD2544 is UNSAT
Problem TDEAD2545 is UNSAT
Problem TDEAD2546 is UNSAT
Problem TDEAD2547 is UNSAT
Problem TDEAD2548 is UNSAT
Problem TDEAD2549 is UNSAT
Problem TDEAD2550 is UNSAT
Problem TDEAD2551 is UNSAT
Problem TDEAD2552 is UNSAT
Problem TDEAD2553 is UNSAT
Problem TDEAD2554 is UNSAT
Problem TDEAD2555 is UNSAT
Problem TDEAD2556 is UNSAT
Problem TDEAD2557 is UNSAT
Problem TDEAD2558 is UNSAT
Problem TDEAD2559 is UNSAT
Problem TDEAD2560 is UNSAT
Problem TDEAD2561 is UNSAT
Problem TDEAD2562 is UNSAT
Problem TDEAD2633 is UNSAT
Problem TDEAD2634 is UNSAT
Problem TDEAD2635 is UNSAT
Problem TDEAD2636 is UNSAT
Problem TDEAD2637 is UNSAT
Problem TDEAD2638 is UNSAT
Problem TDEAD2639 is UNSAT
Problem TDEAD2640 is UNSAT
Problem TDEAD2641 is UNSAT
Problem TDEAD2642 is UNSAT
Problem TDEAD2643 is UNSAT
Problem TDEAD2644 is UNSAT
Problem TDEAD2645 is UNSAT
Problem TDEAD2646 is UNSAT
Problem TDEAD2647 is UNSAT
Problem TDEAD2648 is UNSAT
Problem TDEAD2649 is UNSAT
Problem TDEAD2650 is UNSAT
Problem TDEAD2651 is UNSAT
Problem TDEAD2652 is UNSAT
Problem TDEAD2653 is UNSAT
Problem TDEAD2654 is UNSAT
Problem TDEAD2655 is UNSAT
Problem TDEAD2656 is UNSAT
Problem TDEAD2657 is UNSAT
Problem TDEAD2658 is UNSAT
Problem TDEAD2659 is UNSAT
Problem TDEAD2660 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 9/25 constraints. Problems are: Problem set: 522 solved, 2229 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 234/2859 variables, and 25 constraints, problems are : Problem set: 522 solved, 2229 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/235 constraints, ReadFeed: 0/241 constraints, PredecessorRefiner: 0/2751 constraints, Known Traps: 17/17 constraints]
After SMT, in 88105ms problems are : Problem set: 522 solved, 2229 unsolved
Search for dead transitions found 522 dead transitions in 88136ms
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 SI_LTL mode, iteration 1 : 235/237 places, 2231/2750 transitions.
Graph (complete) has 3002 edges and 235 vertex of which 227 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.4 ms
Discarding 8 places :
Also discarding 0 output transitions
Reduce places removed 36 places and 709 transitions.
Reduce places removed 15 places and 269 transitions.
Graph (complete) has 1870 edges and 176 vertex of which 175 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 175 transition count 1253
Reduce places removed 10 places and 123 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 27 place count 165 transition count 1130
Reduce places removed 6 places and 84 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 33 place count 159 transition count 1046
Reduce places removed 1 places and 17 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 34 place count 158 transition count 1029
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 45 place count 147 transition count 973
Deduced a syphon composed of 16 places in 2 ms
Reduce places removed 16 places and 225 transitions.
Iterating global reduction 4 with 27 rules applied. Total rules applied 72 place count 131 transition count 748
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 79 place count 124 transition count 699
Iterating global reduction 4 with 7 rules applied. Total rules applied 86 place count 124 transition count 699
Applied a total of 86 rules in 98 ms. Remains 124 /235 variables (removed 111) and now considering 699/2231 (removed 1532) transitions.
[2024-05-21 12:57:42] [INFO ] Flow matrix only has 641 transitions (discarded 58 similar events)
// Phase 1: matrix 641 rows 124 cols
[2024-05-21 12:57:42] [INFO ] Computed 9 invariants in 3 ms
[2024-05-21 12:57:42] [INFO ] Implicit Places using invariants in 288 ms returned []
[2024-05-21 12:57:42] [INFO ] Flow matrix only has 641 transitions (discarded 58 similar events)
[2024-05-21 12:57:42] [INFO ] Invariant cache hit.
[2024-05-21 12:57:43] [INFO ] State equation strengthened by 88 read => feed constraints.
[2024-05-21 12:57:43] [INFO ] Implicit Places using invariants and state equation in 310 ms returned []
Implicit Place search using SMT with State Equation took 601 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 124/237 places, 699/2750 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 90769 ms. Remains : 124/237 places, 699/2750 transitions.
Stuttering acceptance computed with spot in 160 ms :[(NOT p0)]
Running random walk in product with property : BugTracking-PT-q3m256-LTLFireability-07
Product exploration explored 100000 steps with 22 reset in 583 ms.
Product exploration explored 100000 steps with 23 reset in 428 ms.
Computed a total of 4 stabilizing places and 27 stable transitions
Computed a total of 4 stabilizing places and 27 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 112 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
RANDOM walk for 40319 steps (12 resets) in 162 ms. (247 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 142 ms. (279 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 684463 steps, run timeout after 3001 ms. (steps per millisecond=228 ) properties seen :0 out of 1
Probabilistic random walk after 684463 steps, saw 334812 distinct states, run finished after 3001 ms. (steps per millisecond=228 ) properties seen :0
[2024-05-21 12:57:47] [INFO ] Flow matrix only has 641 transitions (discarded 58 similar events)
[2024-05-21 12:57:47] [INFO ] Invariant cache hit.
[2024-05-21 12:57:47] [INFO ] State equation strengthened by 88 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 14/17 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 62/79 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 8/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/79 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 200/279 variables, 12/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/279 variables, 25/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/279 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 371/650 variables, 48/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/650 variables, 2/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/650 variables, 35/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/650 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 4/654 variables, 2/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/654 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/654 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1/655 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/655 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/655 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 105/760 variables, 42/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/760 variables, 2/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/760 variables, 20/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/760 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 5/765 variables, 3/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/765 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/765 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 765/765 variables, and 221 constraints, problems are : Problem set: 0 solved, 1 unsolved in 279 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 124/124 constraints, ReadFeed: 88/88 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 14/17 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 62/79 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 8/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/79 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 200/279 variables, 12/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/279 variables, 25/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/279 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 371/650 variables, 48/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/650 variables, 2/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/650 variables, 35/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/650 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/650 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 4/654 variables, 2/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/654 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/654 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1/655 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/655 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/655 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 105/760 variables, 42/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/760 variables, 2/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/760 variables, 20/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 12:57:48] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 0 ms to minimize.
Problem apf0 is UNSAT
After SMT solving in domain Int declared 760/765 variables, and 220 constraints, problems are : Problem set: 1 solved, 0 unsolved in 318 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 121/124 constraints, ReadFeed: 88/88 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 604ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [p0, (X p0), (X (X p0)), (G p0)]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 13 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BugTracking-PT-q3m256-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BugTracking-PT-q3m256-LTLFireability-07 finished in 95895 ms.
All properties solved by simple procedures.
Total runtime 265947 ms.
ITS solved all properties within timeout

BK_STOP 1716296268473

--------------------
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 LTLFireability -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-q3m256"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is BugTracking-PT-q3m256, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r047-tajo-171620398100380"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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