Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r579-smll-171734921200087.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is MedleyA-PT-11, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r579-smll-171734921200087
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 612K
-rw-r--r-- 1 mcc users 6.6K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 9.1K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 95K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 160K Jun 2 16:33 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 MedleyA-PT-11-ReachabilityFireability-2024-00
FORMULA_NAME MedleyA-PT-11-ReachabilityFireability-2024-01
FORMULA_NAME MedleyA-PT-11-ReachabilityFireability-2024-02
FORMULA_NAME MedleyA-PT-11-ReachabilityFireability-2024-03
FORMULA_NAME MedleyA-PT-11-ReachabilityFireability-2024-04
FORMULA_NAME MedleyA-PT-11-ReachabilityFireability-2024-05
FORMULA_NAME MedleyA-PT-11-ReachabilityFireability-2024-06
FORMULA_NAME MedleyA-PT-11-ReachabilityFireability-2024-07
FORMULA_NAME MedleyA-PT-11-ReachabilityFireability-2024-08
FORMULA_NAME MedleyA-PT-11-ReachabilityFireability-2024-09
FORMULA_NAME MedleyA-PT-11-ReachabilityFireability-2024-10
FORMULA_NAME MedleyA-PT-11-ReachabilityFireability-2024-11
FORMULA_NAME MedleyA-PT-11-ReachabilityFireability-2024-12
FORMULA_NAME MedleyA-PT-11-ReachabilityFireability-2024-13
FORMULA_NAME MedleyA-PT-11-ReachabilityFireability-2024-14
FORMULA_NAME MedleyA-PT-11-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717356816880

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-11
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 19:33:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-02 19:33:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 19:33:39] [INFO ] Load time of PNML (sax parser for PT used): 197 ms
[2024-06-02 19:33:39] [INFO ] Transformed 150 places.
[2024-06-02 19:33:39] [INFO ] Transformed 478 transitions.
[2024-06-02 19:33:39] [INFO ] Found NUPN structural information;
[2024-06-02 19:33:39] [INFO ] Parsed PT model containing 150 places and 478 transitions and 2705 arcs in 424 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 27 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 9 transitions
Reduce redundant transitions removed 9 transitions.
RANDOM walk for 40000 steps (3141 resets) in 3975 ms. (10 steps per ms) remains 13/16 properties
FORMULA MedleyA-PT-11-ReachabilityFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-11-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-11-ReachabilityFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (533 resets) in 499 ms. (80 steps per ms) remains 12/13 properties
FORMULA MedleyA-PT-11-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (545 resets) in 506 ms. (78 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (430 resets) in 1762 ms. (22 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (546 resets) in 196 ms. (203 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (550 resets) in 115 ms. (344 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (546 resets) in 130 ms. (305 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (543 resets) in 222 ms. (179 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (478 resets) in 179 ms. (222 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (436 resets) in 149 ms. (266 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (545 resets) in 221 ms. (180 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (523 resets) in 108 ms. (367 steps per ms) remains 11/12 properties
FORMULA MedleyA-PT-11-ReachabilityFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40002 steps (421 resets) in 391 ms. (102 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (465 resets) in 300 ms. (132 steps per ms) remains 11/11 properties
[2024-06-02 19:33:42] [INFO ] Flow matrix only has 397 transitions (discarded 72 similar events)
// Phase 1: matrix 397 rows 150 cols
[2024-06-02 19:33:42] [INFO ] Computed 23 invariants in 21 ms
[2024-06-02 19:33:42] [INFO ] State equation strengthened by 171 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 98/98 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 2/100 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Problem MedleyA-PT-11-ReachabilityFireability-2024-14 is UNSAT
FORMULA MedleyA-PT-11-ReachabilityFireability-2024-14 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (OVERLAPS) 19/117 variables, 9/109 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 19/128 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/117 variables, 0/128 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 30/147 variables, 12/140 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/147 variables, 30/170 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/147 variables, 0/170 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 394/541 variables, 147/317 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/541 variables, 171/488 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/541 variables, 0/488 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 12 (OVERLAPS) 6/547 variables, 3/491 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/547 variables, 3/494 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/547 variables, 0/494 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 15 (OVERLAPS) 0/547 variables, 0/494 constraints. Problems are: Problem set: 1 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 547/547 variables, and 494 constraints, problems are : Problem set: 1 solved, 10 unsolved in 2182 ms.
Refiners :[Domain max(s): 150/150 constraints, Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 150/150 constraints, ReadFeed: 171/171 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 94/94 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 1/95 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/95 constraints. Problems are: Problem set: 1 solved, 10 unsolved
Problem MedleyA-PT-11-ReachabilityFireability-2024-01 is UNSAT
FORMULA MedleyA-PT-11-ReachabilityFireability-2024-01 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (OVERLAPS) 21/115 variables, 9/104 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/115 variables, 21/125 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/115 variables, 0/125 constraints. Problems are: Problem set: 2 solved, 9 unsolved
Problem MedleyA-PT-11-ReachabilityFireability-2024-09 is UNSAT
FORMULA MedleyA-PT-11-ReachabilityFireability-2024-09 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 6 (OVERLAPS) 32/147 variables, 13/138 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/147 variables, 32/170 constraints. Problems are: Problem set: 3 solved, 8 unsolved
[2024-06-02 19:33:46] [INFO ] Deduced a trap composed of 21 places in 170 ms of which 25 ms to minimize.
[2024-06-02 19:33:46] [INFO ] Deduced a trap composed of 26 places in 137 ms of which 3 ms to minimize.
[2024-06-02 19:33:46] [INFO ] Deduced a trap composed of 20 places in 111 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/147 variables, 3/173 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/147 variables, 0/173 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 394/541 variables, 147/320 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/541 variables, 171/491 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/541 variables, 1/492 constraints. Problems are: Problem set: 3 solved, 8 unsolved
[2024-06-02 19:33:48] [INFO ] Deduced a trap composed of 15 places in 202 ms of which 4 ms to minimize.
[2024-06-02 19:33:48] [INFO ] Deduced a trap composed of 19 places in 165 ms of which 2 ms to minimize.
[2024-06-02 19:33:48] [INFO ] Deduced a trap composed of 13 places in 168 ms of which 3 ms to minimize.
[2024-06-02 19:33:48] [INFO ] Deduced a trap composed of 23 places in 100 ms of which 2 ms to minimize.
[2024-06-02 19:33:49] [INFO ] Deduced a trap composed of 17 places in 195 ms of which 3 ms to minimize.
[2024-06-02 19:33:49] [INFO ] Deduced a trap composed of 31 places in 107 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/541 variables, 6/498 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/541 variables, 0/498 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 15 (OVERLAPS) 6/547 variables, 3/501 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/547 variables, 3/504 constraints. Problems are: Problem set: 3 solved, 8 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 547/547 variables, and 511 constraints, problems are : Problem set: 3 solved, 8 unsolved in 5012 ms.
Refiners :[Domain max(s): 150/150 constraints, Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 150/150 constraints, ReadFeed: 171/171 constraints, PredecessorRefiner: 8/11 constraints, Known Traps: 9/9 constraints]
After SMT, in 7987ms problems are : Problem set: 3 solved, 8 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 87 out of 150 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 150/150 places, 469/469 transitions.
Graph (complete) has 749 edges and 150 vertex of which 147 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.5 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 22 place count 126 transition count 435
Iterating global reduction 0 with 21 rules applied. Total rules applied 43 place count 126 transition count 435
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 46 place count 126 transition count 432
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 54 place count 126 transition count 432
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 58 place count 122 transition count 426
Iterating global reduction 0 with 4 rules applied. Total rules applied 62 place count 122 transition count 426
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 70 place count 122 transition count 418
Applied a total of 70 rules in 125 ms. Remains 122 /150 variables (removed 28) and now considering 418/469 (removed 51) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 144 ms. Remains : 122/150 places, 418/469 transitions.
RANDOM walk for 40000 steps (3287 resets) in 1370 ms. (29 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (446 resets) in 641 ms. (62 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (558 resets) in 197 ms. (202 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (574 resets) in 90 ms. (439 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (576 resets) in 188 ms. (211 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (573 resets) in 164 ms. (242 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (496 resets) in 124 ms. (320 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (583 resets) in 184 ms. (216 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (451 resets) in 329 ms. (121 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 375129 steps, run timeout after 3001 ms. (steps per millisecond=125 ) properties seen :0 out of 8
Probabilistic random walk after 375129 steps, saw 78357 distinct states, run finished after 3006 ms. (steps per millisecond=124 ) properties seen :0
[2024-06-02 19:33:54] [INFO ] Flow matrix only has 350 transitions (discarded 68 similar events)
// Phase 1: matrix 350 rows 122 cols
[2024-06-02 19:33:54] [INFO ] Computed 23 invariants in 5 ms
[2024-06-02 19:33:55] [INFO ] State equation strengthened by 167 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 13/100 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 22/122 variables, 14/23 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 350/472 variables, 122/145 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/472 variables, 167/312 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/472 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 0/472 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 472/472 variables, and 312 constraints, problems are : Problem set: 0 solved, 8 unsolved in 913 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 122/122 constraints, ReadFeed: 167/167 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 13/100 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-02 19:33:56] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 22/122 variables, 14/24 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-02 19:33:56] [INFO ] Deduced a trap composed of 18 places in 75 ms of which 2 ms to minimize.
[2024-06-02 19:33:56] [INFO ] Deduced a trap composed of 22 places in 89 ms of which 2 ms to minimize.
[2024-06-02 19:33:56] [INFO ] Deduced a trap composed of 22 places in 88 ms of which 1 ms to minimize.
[2024-06-02 19:33:57] [INFO ] Deduced a trap composed of 16 places in 133 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 4/28 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-02 19:33:57] [INFO ] Deduced a trap composed of 10 places in 91 ms of which 2 ms to minimize.
[2024-06-02 19:33:57] [INFO ] Deduced a trap composed of 22 places in 77 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 2/30 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 350/472 variables, 122/152 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/472 variables, 167/319 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/472 variables, 8/327 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-02 19:33:59] [INFO ] Deduced a trap composed of 12 places in 95 ms of which 2 ms to minimize.
[2024-06-02 19:33:59] [INFO ] Deduced a trap composed of 25 places in 97 ms of which 2 ms to minimize.
[2024-06-02 19:33:59] [INFO ] Deduced a trap composed of 11 places in 85 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/472 variables, 3/330 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/472 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 0/472 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 472/472 variables, and 330 constraints, problems are : Problem set: 0 solved, 8 unsolved in 6349 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 122/122 constraints, ReadFeed: 167/167 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 10/10 constraints]
After SMT, in 7469ms problems are : Problem set: 0 solved, 8 unsolved
FORMULA MedleyA-PT-11-ReachabilityFireability-2024-06 FALSE TECHNIQUES PARIKH_WALK
FORMULA MedleyA-PT-11-ReachabilityFireability-2024-05 TRUE TECHNIQUES PARIKH_WALK
FORMULA MedleyA-PT-11-ReachabilityFireability-2024-13 FALSE TECHNIQUES PARIKH_WALK
FORMULA MedleyA-PT-11-ReachabilityFireability-2024-08 TRUE TECHNIQUES PARIKH_WALK
FORMULA MedleyA-PT-11-ReachabilityFireability-2024-04 TRUE TECHNIQUES PARIKH_WALK
FORMULA MedleyA-PT-11-ReachabilityFireability-2024-10 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 6 properties in 1601 ms.
Support contains 66 out of 122 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 122/122 places, 418/418 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 113 transition count 400
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 113 transition count 400
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 112 transition count 394
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 112 transition count 394
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 112 transition count 394
Applied a total of 22 rules in 41 ms. Remains 112 /122 variables (removed 10) and now considering 394/418 (removed 24) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 112/122 places, 394/418 transitions.
RANDOM walk for 40000 steps (3276 resets) in 281 ms. (141 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (435 resets) in 523 ms. (76 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (575 resets) in 109 ms. (363 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 726734 steps, run timeout after 3001 ms. (steps per millisecond=242 ) properties seen :0 out of 2
Probabilistic random walk after 726734 steps, saw 137479 distinct states, run finished after 3001 ms. (steps per millisecond=242 ) properties seen :0
[2024-06-02 19:34:07] [INFO ] Flow matrix only has 326 transitions (discarded 68 similar events)
// Phase 1: matrix 326 rows 112 cols
[2024-06-02 19:34:07] [INFO ] Computed 23 invariants in 5 ms
[2024-06-02 19:34:07] [INFO ] State equation strengthened by 163 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 20/86 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 26/112 variables, 14/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 326/438 variables, 112/135 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/438 variables, 163/298 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/438 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/438 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 438/438 variables, and 298 constraints, problems are : Problem set: 0 solved, 2 unsolved in 274 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 112/112 constraints, ReadFeed: 163/163 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 20/86 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 26/112 variables, 14/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-02 19:34:07] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 326/438 variables, 112/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/438 variables, 163/299 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/438 variables, 2/301 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/438 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/438 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 438/438 variables, and 301 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1112 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 112/112 constraints, ReadFeed: 163/163 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 1463ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 74 ms.
Support contains 66 out of 112 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 112/112 places, 394/394 transitions.
Applied a total of 0 rules in 10 ms. Remains 112 /112 variables (removed 0) and now considering 394/394 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 112/112 places, 394/394 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 112/112 places, 394/394 transitions.
Applied a total of 0 rules in 10 ms. Remains 112 /112 variables (removed 0) and now considering 394/394 (removed 0) transitions.
[2024-06-02 19:34:08] [INFO ] Flow matrix only has 326 transitions (discarded 68 similar events)
[2024-06-02 19:34:08] [INFO ] Invariant cache hit.
[2024-06-02 19:34:09] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-06-02 19:34:09] [INFO ] Flow matrix only has 326 transitions (discarded 68 similar events)
[2024-06-02 19:34:09] [INFO ] Invariant cache hit.
[2024-06-02 19:34:09] [INFO ] State equation strengthened by 163 read => feed constraints.
[2024-06-02 19:34:09] [INFO ] Implicit Places using invariants and state equation in 223 ms returned []
Implicit Place search using SMT with State Equation took 307 ms to find 0 implicit places.
[2024-06-02 19:34:09] [INFO ] Redundant transitions in 27 ms returned []
Running 393 sub problems to find dead transitions.
[2024-06-02 19:34:09] [INFO ] Flow matrix only has 326 transitions (discarded 68 similar events)
[2024-06-02 19:34:09] [INFO ] Invariant cache hit.
[2024-06-02 19:34:09] [INFO ] State equation strengthened by 163 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 393 unsolved
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD338 is UNSAT
At refinement iteration 2 (OVERLAPS) 1/112 variables, 9/23 constraints. Problems are: Problem set: 104 solved, 289 unsolved
[2024-06-02 19:34:13] [INFO ] Deduced a trap composed of 24 places in 73 ms of which 2 ms to minimize.
[2024-06-02 19:34:13] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 1 ms to minimize.
[2024-06-02 19:34:13] [INFO ] Deduced a trap composed of 14 places in 80 ms of which 1 ms to minimize.
[2024-06-02 19:34:13] [INFO ] Deduced a trap composed of 21 places in 75 ms of which 1 ms to minimize.
[2024-06-02 19:34:13] [INFO ] Deduced a trap composed of 22 places in 69 ms of which 1 ms to minimize.
[2024-06-02 19:34:13] [INFO ] Deduced a trap composed of 36 places in 71 ms of which 1 ms to minimize.
[2024-06-02 19:34:13] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 1 ms to minimize.
[2024-06-02 19:34:13] [INFO ] Deduced a trap composed of 35 places in 70 ms of which 1 ms to minimize.
[2024-06-02 19:34:14] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
[2024-06-02 19:34:14] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 2 ms to minimize.
[2024-06-02 19:34:14] [INFO ] Deduced a trap composed of 8 places in 61 ms of which 1 ms to minimize.
[2024-06-02 19:34:14] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 1 ms to minimize.
[2024-06-02 19:34:15] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 1 ms to minimize.
[2024-06-02 19:34:15] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 1 ms to minimize.
[2024-06-02 19:34:15] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 6 ms to minimize.
[2024-06-02 19:34:15] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 1 ms to minimize.
[2024-06-02 19:34:15] [INFO ] Deduced a trap composed of 39 places in 96 ms of which 1 ms to minimize.
[2024-06-02 19:34:15] [INFO ] Deduced a trap composed of 32 places in 96 ms of which 1 ms to minimize.
[2024-06-02 19:34:15] [INFO ] Deduced a trap composed of 34 places in 83 ms of which 2 ms to minimize.
[2024-06-02 19:34:15] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 20/43 constraints. Problems are: Problem set: 104 solved, 289 unsolved
[2024-06-02 19:34:17] [INFO ] Deduced a trap composed of 34 places in 77 ms of which 2 ms to minimize.
[2024-06-02 19:34:17] [INFO ] Deduced a trap composed of 32 places in 73 ms of which 2 ms to minimize.
[2024-06-02 19:34:17] [INFO ] Deduced a trap composed of 34 places in 67 ms of which 1 ms to minimize.
[2024-06-02 19:34:17] [INFO ] Deduced a trap composed of 33 places in 67 ms of which 1 ms to minimize.
[2024-06-02 19:34:17] [INFO ] Deduced a trap composed of 31 places in 67 ms of which 1 ms to minimize.
[2024-06-02 19:34:17] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
[2024-06-02 19:34:17] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
[2024-06-02 19:34:17] [INFO ] Deduced a trap composed of 35 places in 71 ms of which 1 ms to minimize.
[2024-06-02 19:34:17] [INFO ] Deduced a trap composed of 31 places in 55 ms of which 2 ms to minimize.
[2024-06-02 19:34:17] [INFO ] Deduced a trap composed of 33 places in 82 ms of which 2 ms to minimize.
[2024-06-02 19:34:18] [INFO ] Deduced a trap composed of 35 places in 85 ms of which 2 ms to minimize.
[2024-06-02 19:34:18] [INFO ] Deduced a trap composed of 37 places in 72 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 12/55 constraints. Problems are: Problem set: 104 solved, 289 unsolved
[2024-06-02 19:34:19] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 1/56 constraints. Problems are: Problem set: 104 solved, 289 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/112 variables, 0/56 constraints. Problems are: Problem set: 104 solved, 289 unsolved
At refinement iteration 7 (OVERLAPS) 326/438 variables, 112/168 constraints. Problems are: Problem set: 104 solved, 289 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/438 variables, 163/331 constraints. Problems are: Problem set: 104 solved, 289 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/438 variables, 0/331 constraints. Problems are: Problem set: 104 solved, 289 unsolved
At refinement iteration 10 (OVERLAPS) 0/438 variables, 0/331 constraints. Problems are: Problem set: 104 solved, 289 unsolved
No progress, stopping.
After SMT solving in domain Real declared 438/438 variables, and 331 constraints, problems are : Problem set: 104 solved, 289 unsolved in 19437 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 112/112 constraints, ReadFeed: 163/163 constraints, PredecessorRefiner: 393/393 constraints, Known Traps: 33/33 constraints]
Escalating to Integer solving :Problem set: 104 solved, 289 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 14/14 constraints. Problems are: Problem set: 104 solved, 289 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 0/14 constraints. Problems are: Problem set: 104 solved, 289 unsolved
At refinement iteration 2 (OVERLAPS) 1/112 variables, 9/23 constraints. Problems are: Problem set: 104 solved, 289 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 33/56 constraints. Problems are: Problem set: 104 solved, 289 unsolved
[2024-06-02 19:34:31] [INFO ] Deduced a trap composed of 36 places in 89 ms of which 1 ms to minimize.
[2024-06-02 19:34:31] [INFO ] Deduced a trap composed of 37 places in 95 ms of which 2 ms to minimize.
[2024-06-02 19:34:31] [INFO ] Deduced a trap composed of 31 places in 86 ms of which 3 ms to minimize.
[2024-06-02 19:34:31] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 1 ms to minimize.
[2024-06-02 19:34:32] [INFO ] Deduced a trap composed of 31 places in 90 ms of which 2 ms to minimize.
[2024-06-02 19:34:32] [INFO ] Deduced a trap composed of 36 places in 93 ms of which 2 ms to minimize.
[2024-06-02 19:34:32] [INFO ] Deduced a trap composed of 32 places in 86 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 7/63 constraints. Problems are: Problem set: 104 solved, 289 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 0/63 constraints. Problems are: Problem set: 104 solved, 289 unsolved
At refinement iteration 6 (OVERLAPS) 326/438 variables, 112/175 constraints. Problems are: Problem set: 104 solved, 289 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/438 variables, 163/338 constraints. Problems are: Problem set: 104 solved, 289 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/438 variables, 289/627 constraints. Problems are: Problem set: 104 solved, 289 unsolved
[2024-06-02 19:34:40] [INFO ] Deduced a trap composed of 36 places in 69 ms of which 1 ms to minimize.
[2024-06-02 19:34:41] [INFO ] Deduced a trap composed of 25 places in 100 ms of which 1 ms to minimize.
[2024-06-02 19:34:41] [INFO ] Deduced a trap composed of 22 places in 82 ms of which 2 ms to minimize.
[2024-06-02 19:34:45] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/438 variables, 4/631 constraints. Problems are: Problem set: 104 solved, 289 unsolved
[2024-06-02 19:34:48] [INFO ] Deduced a trap composed of 37 places in 62 ms of which 1 ms to minimize.
[2024-06-02 19:34:48] [INFO ] Deduced a trap composed of 38 places in 56 ms of which 1 ms to minimize.
[2024-06-02 19:34:48] [INFO ] Deduced a trap composed of 37 places in 64 ms of which 1 ms to minimize.
[2024-06-02 19:34:50] [INFO ] Deduced a trap composed of 11 places in 119 ms of which 2 ms to minimize.
[2024-06-02 19:34:50] [INFO ] Deduced a trap composed of 10 places in 114 ms of which 2 ms to minimize.
[2024-06-02 19:34:50] [INFO ] Deduced a trap composed of 37 places in 87 ms of which 2 ms to minimize.
[2024-06-02 19:34:53] [INFO ] Deduced a trap composed of 38 places in 63 ms of which 2 ms to minimize.
[2024-06-02 19:34:53] [INFO ] Deduced a trap composed of 37 places in 64 ms of which 1 ms to minimize.
[2024-06-02 19:34:53] [INFO ] Deduced a trap composed of 37 places in 64 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/438 variables, 9/640 constraints. Problems are: Problem set: 104 solved, 289 unsolved
[2024-06-02 19:34:58] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 438/438 variables, and 641 constraints, problems are : Problem set: 104 solved, 289 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 112/112 constraints, ReadFeed: 163/163 constraints, PredecessorRefiner: 289/393 constraints, Known Traps: 54/54 constraints]
After SMT, in 50184ms problems are : Problem set: 104 solved, 289 unsolved
Search for dead transitions found 104 dead transitions in 50193ms
Found 104 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 104 transitions
Dead transitions reduction (with SMT) removed 104 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 112/112 places, 290/394 transitions.
Applied a total of 0 rules in 8 ms. Remains 112 /112 variables (removed 0) and now considering 290/290 (removed 0) transitions.
[2024-06-02 19:34:59] [INFO ] Redundant transitions in 5 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 50570 ms. Remains : 112/112 places, 290/394 transitions.
RANDOM walk for 40000 steps (3278 resets) in 286 ms. (139 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (441 resets) in 671 ms. (59 steps per ms) remains 1/2 properties
FORMULA MedleyA-PT-11-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (566 resets) in 107 ms. (370 steps per ms) remains 1/1 properties
// Phase 1: matrix 290 rows 112 cols
[2024-06-02 19:34:59] [INFO ] Computed 23 invariants in 3 ms
[2024-06-02 19:34:59] [INFO ] State equation strengthened by 127 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 39/62 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/64 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 45/109 variables, 13/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 3/112 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/112 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 290/402 variables, 112/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/402 variables, 127/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/402 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/402 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 402/402 variables, and 262 constraints, problems are : Problem set: 0 solved, 1 unsolved in 229 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 112/112 constraints, ReadFeed: 127/127 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/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 39/62 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/64 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 45/109 variables, 13/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 19:35:00] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 1 ms to minimize.
[2024-06-02 19:35:00] [INFO ] Deduced a trap composed of 8 places in 80 ms of which 1 ms to minimize.
[2024-06-02 19:35:00] [INFO ] Deduced a trap composed of 33 places in 62 ms of which 1 ms to minimize.
[2024-06-02 19:35:00] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 4/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/109 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 3/112 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/112 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 290/402 variables, 112/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/402 variables, 127/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/402 variables, 1/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/402 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/402 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 402/402 variables, and 267 constraints, problems are : Problem set: 0 solved, 1 unsolved in 687 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 112/112 constraints, ReadFeed: 127/127 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 959ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 29 ms.
Support contains 23 out of 112 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 112/112 places, 290/290 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 110 transition count 290
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 14 place count 98 transition count 250
Iterating global reduction 1 with 12 rules applied. Total rules applied 26 place count 98 transition count 250
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 30 place count 94 transition count 232
Iterating global reduction 1 with 4 rules applied. Total rules applied 34 place count 94 transition count 232
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 36 place count 92 transition count 224
Iterating global reduction 1 with 2 rules applied. Total rules applied 38 place count 92 transition count 224
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 42 place count 90 transition count 222
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 46 place count 88 transition count 245
Free-agglomeration rule applied 3 times.
Iterating global reduction 1 with 3 rules applied. Total rules applied 49 place count 88 transition count 242
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 52 place count 85 transition count 242
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 2 with 8 rules applied. Total rules applied 60 place count 85 transition count 362
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 68 place count 77 transition count 362
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 3 with 8 rules applied. Total rules applied 76 place count 77 transition count 362
Applied a total of 76 rules in 96 ms. Remains 77 /112 variables (removed 35) and now considering 362/290 (removed -72) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 97 ms. Remains : 77/112 places, 362/290 transitions.
RANDOM walk for 40000 steps (4436 resets) in 351 ms. (113 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (1026 resets) in 194 ms. (205 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1146565 steps, run timeout after 3001 ms. (steps per millisecond=382 ) properties seen :0 out of 1
Probabilistic random walk after 1146565 steps, saw 214976 distinct states, run finished after 3007 ms. (steps per millisecond=381 ) properties seen :0
// Phase 1: matrix 362 rows 77 cols
[2024-06-02 19:35:04] [INFO ] Computed 21 invariants in 4 ms
[2024-06-02 19:35:04] [INFO ] State equation strengthened by 178 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 36/59 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/61 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 16/77 variables, 8/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/77 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 362/439 variables, 77/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/439 variables, 178/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/439 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/439 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 439/439 variables, and 276 constraints, problems are : Problem set: 0 solved, 1 unsolved in 214 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 77/77 constraints, ReadFeed: 178/178 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/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 36/59 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/61 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 16/77 variables, 8/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 19:35:04] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 1 ms to minimize.
[2024-06-02 19:35:04] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/77 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/77 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 362/439 variables, 77/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/439 variables, 178/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/439 variables, 1/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/439 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/439 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 439/439 variables, and 279 constraints, problems are : Problem set: 0 solved, 1 unsolved in 846 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 77/77 constraints, ReadFeed: 178/178 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 1091ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 32 ms.
Support contains 23 out of 77 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 77/77 places, 362/362 transitions.
Applied a total of 0 rules in 13 ms. Remains 77 /77 variables (removed 0) and now considering 362/362 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 77/77 places, 362/362 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 77/77 places, 362/362 transitions.
Applied a total of 0 rules in 10 ms. Remains 77 /77 variables (removed 0) and now considering 362/362 (removed 0) transitions.
[2024-06-02 19:35:05] [INFO ] Invariant cache hit.
[2024-06-02 19:35:05] [INFO ] Implicit Places using invariants in 105 ms returned []
[2024-06-02 19:35:05] [INFO ] Invariant cache hit.
[2024-06-02 19:35:05] [INFO ] State equation strengthened by 178 read => feed constraints.
[2024-06-02 19:35:05] [INFO ] Implicit Places using invariants and state equation in 372 ms returned []
Implicit Place search using SMT with State Equation took 478 ms to find 0 implicit places.
[2024-06-02 19:35:05] [INFO ] Redundant transitions in 5 ms returned []
Running 358 sub problems to find dead transitions.
[2024-06-02 19:35:05] [INFO ] Invariant cache hit.
[2024-06-02 19:35:05] [INFO ] State equation strengthened by 178 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 2 (OVERLAPS) 1/77 variables, 13/21 constraints. Problems are: Problem set: 0 solved, 358 unsolved
[2024-06-02 19:35:09] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 1 ms to minimize.
[2024-06-02 19:35:09] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 1 ms to minimize.
[2024-06-02 19:35:09] [INFO ] Deduced a trap composed of 27 places in 91 ms of which 1 ms to minimize.
[2024-06-02 19:35:09] [INFO ] Deduced a trap composed of 17 places in 89 ms of which 1 ms to minimize.
[2024-06-02 19:35:10] [INFO ] Deduced a trap composed of 20 places in 85 ms of which 1 ms to minimize.
[2024-06-02 19:35:10] [INFO ] Deduced a trap composed of 13 places in 96 ms of which 1 ms to minimize.
[2024-06-02 19:35:10] [INFO ] Deduced a trap composed of 25 places in 113 ms of which 1 ms to minimize.
[2024-06-02 19:35:10] [INFO ] Deduced a trap composed of 30 places in 117 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 8/29 constraints. Problems are: Problem set: 0 solved, 358 unsolved
[2024-06-02 19:35:12] [INFO ] Deduced a trap composed of 26 places in 148 ms of which 1 ms to minimize.
[2024-06-02 19:35:12] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 1 ms to minimize.
[2024-06-02 19:35:13] [INFO ] Deduced a trap composed of 22 places in 133 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 3/32 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/77 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 6 (OVERLAPS) 362/439 variables, 77/109 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/439 variables, 178/287 constraints. Problems are: Problem set: 0 solved, 358 unsolved
[2024-06-02 19:35:21] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/439 variables, 1/288 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/439 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 10 (OVERLAPS) 0/439 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 358 unsolved
No progress, stopping.
After SMT solving in domain Real declared 439/439 variables, and 288 constraints, problems are : Problem set: 0 solved, 358 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 77/77 constraints, ReadFeed: 178/178 constraints, PredecessorRefiner: 358/358 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 358 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 2 (OVERLAPS) 1/77 variables, 13/21 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 12/33 constraints. Problems are: Problem set: 0 solved, 358 unsolved
[2024-06-02 19:35:39] [INFO ] Deduced a trap composed of 25 places in 158 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/77 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 6 (OVERLAPS) 362/439 variables, 77/111 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/439 variables, 178/289 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/439 variables, 358/647 constraints. Problems are: Problem set: 0 solved, 358 unsolved
[2024-06-02 19:36:06] [INFO ] Deduced a trap composed of 25 places in 155 ms of which 1 ms to minimize.
[2024-06-02 19:36:06] [INFO ] Deduced a trap composed of 25 places in 115 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/439 variables, 2/649 constraints. Problems are: Problem set: 0 solved, 358 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 439/439 variables, and 649 constraints, problems are : Problem set: 0 solved, 358 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 77/77 constraints, ReadFeed: 178/178 constraints, PredecessorRefiner: 358/358 constraints, Known Traps: 15/15 constraints]
After SMT, in 60932ms problems are : Problem set: 0 solved, 358 unsolved
Search for dead transitions found 0 dead transitions in 60940ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61441 ms. Remains : 77/77 places, 362/362 transitions.
Attempting over-approximation, by ignoring read arcs.
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 0 with 5 rules applied. Total rules applied 5 place count 77 transition count 357
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 7 place count 77 transition count 355
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 24 place count 75 transition count 340
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 26 place count 75 transition count 340
Applied a total of 26 rules in 41 ms. Remains 75 /77 variables (removed 2) and now considering 340/362 (removed 22) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 340 rows 75 cols
[2024-06-02 19:36:06] [INFO ] Computed 21 invariants in 3 ms
[2024-06-02 19:36:06] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 19:36:06] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2024-06-02 19:36:06] [INFO ] [Nat]Absence check using 13 positive and 8 generalized place invariants in 4 ms returned sat
[2024-06-02 19:36:07] [INFO ] After 271ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 19:36:07] [INFO ] After 404ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-02 19:36:07] [INFO ] After 583ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 708 ms.
[2024-06-02 19:36:07] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 15 ms.
[2024-06-02 19:36:07] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 77 places, 362 transitions and 2356 arcs took 26 ms.
[2024-06-02 19:36:07] [INFO ] Flatten gal took : 121 ms
Total runtime 148556 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : MedleyA-PT-11-ReachabilityFireability-2024-07

BK_STOP 1717356968284

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
mcc2024
rfs formula name MedleyA-PT-11-ReachabilityFireability-2024-07
rfs formula type EF
rfs formula formula --invariant=/tmp/879/inv_0_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="MedleyA-PT-11"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is MedleyA-PT-11, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r579-smll-171734921200087"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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