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.r528-tall-171683762000871.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 ShieldRVs-PT-100A, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r528-tall-171683762000871
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 4.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 45K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 16:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 19:16 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 21:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 114K Apr 12 21:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Apr 12 20:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K Apr 12 20:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 652K May 18 16:43 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 ShieldRVs-PT-100A-ReachabilityFireability-2024-00
FORMULA_NAME ShieldRVs-PT-100A-ReachabilityFireability-2024-01
FORMULA_NAME ShieldRVs-PT-100A-ReachabilityFireability-2024-02
FORMULA_NAME ShieldRVs-PT-100A-ReachabilityFireability-2024-03
FORMULA_NAME ShieldRVs-PT-100A-ReachabilityFireability-2024-04
FORMULA_NAME ShieldRVs-PT-100A-ReachabilityFireability-2024-05
FORMULA_NAME ShieldRVs-PT-100A-ReachabilityFireability-2024-06
FORMULA_NAME ShieldRVs-PT-100A-ReachabilityFireability-2024-07
FORMULA_NAME ShieldRVs-PT-100A-ReachabilityFireability-2024-08
FORMULA_NAME ShieldRVs-PT-100A-ReachabilityFireability-2024-09
FORMULA_NAME ShieldRVs-PT-100A-ReachabilityFireability-2024-10
FORMULA_NAME ShieldRVs-PT-100A-ReachabilityFireability-2024-11
FORMULA_NAME ShieldRVs-PT-100A-ReachabilityFireability-2024-12
FORMULA_NAME ShieldRVs-PT-100A-ReachabilityFireability-2024-13
FORMULA_NAME ShieldRVs-PT-100A-ReachabilityFireability-2024-14
FORMULA_NAME ShieldRVs-PT-100A-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717273080044

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVs-PT-100A
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 20:18:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 20:18:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 20:18:01] [INFO ] Load time of PNML (sax parser for PT used): 176 ms
[2024-06-01 20:18:01] [INFO ] Transformed 1403 places.
[2024-06-01 20:18:01] [INFO ] Transformed 1903 transitions.
[2024-06-01 20:18:01] [INFO ] Found NUPN structural information;
[2024-06-01 20:18:01] [INFO ] Parsed PT model containing 1403 places and 1903 transitions and 9200 arcs in 296 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (28 resets) in 1591 ms. (25 steps per ms) remains 8/16 properties
FORMULA ShieldRVs-PT-100A-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-100A-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-100A-ReachabilityFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-100A-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-100A-ReachabilityFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-100A-ReachabilityFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-100A-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-100A-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 604 ms. (66 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 881 ms. (45 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 429 ms. (93 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 359 ms. (111 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 441 ms. (90 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 357 ms. (111 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 356 ms. (112 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 340 ms. (117 steps per ms) remains 8/8 properties
// Phase 1: matrix 1903 rows 1403 cols
[2024-06-01 20:18:03] [INFO ] Computed 401 invariants in 24 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/229 variables, 229/229 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/229 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 448/677 variables, 185/414 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/677 variables, 448/862 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/677 variables, 0/862 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 726/1403 variables, 216/1078 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1403 variables, 726/1804 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1403 variables, 0/1804 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 1903/3306 variables, 1403/3207 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3306 variables, 0/3207 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 0/3306 variables, 0/3207 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3306/3306 variables, and 3207 constraints, problems are : Problem set: 0 solved, 8 unsolved in 2352 ms.
Refiners :[Domain max(s): 1403/1403 constraints, Positive P Invariants (semi-flows): 401/401 constraints, State Equation: 1403/1403 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/229 variables, 229/229 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/229 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 448/677 variables, 185/414 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/677 variables, 448/862 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 20:18:06] [INFO ] Deduced a trap composed of 11 places in 84 ms of which 20 ms to minimize.
[2024-06-01 20:18:06] [INFO ] Deduced a trap composed of 7 places in 56 ms of which 1 ms to minimize.
[2024-06-01 20:18:06] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 2 ms to minimize.
[2024-06-01 20:18:06] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/677 variables, 4/866 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 20:18:06] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/677 variables, 1/867 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 20:18:06] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 1 ms to minimize.
[2024-06-01 20:18:06] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 0 ms to minimize.
[2024-06-01 20:18:06] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/677 variables, 3/870 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/677 variables, 0/870 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 726/1403 variables, 216/1086 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1403 variables, 726/1812 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 20:18:07] [INFO ] Deduced a trap composed of 7 places in 127 ms of which 1 ms to minimize.
[2024-06-01 20:18:07] [INFO ] Deduced a trap composed of 12 places in 106 ms of which 2 ms to minimize.
[2024-06-01 20:18:07] [INFO ] Deduced a trap composed of 7 places in 88 ms of which 2 ms to minimize.
[2024-06-01 20:18:07] [INFO ] Deduced a trap composed of 7 places in 91 ms of which 2 ms to minimize.
[2024-06-01 20:18:07] [INFO ] Deduced a trap composed of 7 places in 97 ms of which 4 ms to minimize.
[2024-06-01 20:18:08] [INFO ] Deduced a trap composed of 7 places in 87 ms of which 1 ms to minimize.
[2024-06-01 20:18:08] [INFO ] Deduced a trap composed of 8 places in 102 ms of which 1 ms to minimize.
[2024-06-01 20:18:08] [INFO ] Deduced a trap composed of 8 places in 86 ms of which 1 ms to minimize.
[2024-06-01 20:18:08] [INFO ] Deduced a trap composed of 7 places in 84 ms of which 1 ms to minimize.
[2024-06-01 20:18:08] [INFO ] Deduced a trap composed of 8 places in 77 ms of which 2 ms to minimize.
[2024-06-01 20:18:08] [INFO ] Deduced a trap composed of 11 places in 78 ms of which 1 ms to minimize.
[2024-06-01 20:18:08] [INFO ] Deduced a trap composed of 8 places in 79 ms of which 1 ms to minimize.
[2024-06-01 20:18:08] [INFO ] Deduced a trap composed of 8 places in 75 ms of which 1 ms to minimize.
[2024-06-01 20:18:08] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 1 ms to minimize.
[2024-06-01 20:18:08] [INFO ] Deduced a trap composed of 7 places in 61 ms of which 1 ms to minimize.
[2024-06-01 20:18:09] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 1 ms to minimize.
[2024-06-01 20:18:09] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 1 ms to minimize.
[2024-06-01 20:18:09] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 0 ms to minimize.
[2024-06-01 20:18:09] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 1 ms to minimize.
[2024-06-01 20:18:09] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1403 variables, 20/1832 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 20:18:09] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 1 ms to minimize.
[2024-06-01 20:18:09] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 0 ms to minimize.
[2024-06-01 20:18:09] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 1 ms to minimize.
[2024-06-01 20:18:09] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 0 ms to minimize.
[2024-06-01 20:18:09] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1403 variables, 5/1837 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 20:18:10] [INFO ] Deduced a trap composed of 7 places in 56 ms of which 5 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1403 variables, 1/1838 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 20:18:10] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2024-06-01 20:18:10] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1403 variables, 2/1840 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1403 variables, 0/1840 constraints. Problems are: Problem set: 0 solved, 8 unsolved
SMT process timed out in 7574ms, After SMT, problems are : Problem set: 0 solved, 8 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 229 out of 1403 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1403/1403 places, 1903/1903 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1402 transition count 1902
Partial Free-agglomeration rule applied 157 times.
Drop transitions (Partial Free agglomeration) removed 157 transitions
Iterating global reduction 0 with 157 rules applied. Total rules applied 159 place count 1402 transition count 1902
Applied a total of 159 rules in 614 ms. Remains 1402 /1403 variables (removed 1) and now considering 1902/1903 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 624 ms. Remains : 1402/1403 places, 1902/1903 transitions.
RANDOM walk for 40000 steps (32 resets) in 852 ms. (46 steps per ms) remains 7/8 properties
FORMULA ShieldRVs-PT-100A-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 387 ms. (103 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 350 ms. (113 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 312 ms. (127 steps per ms) remains 6/7 properties
FORMULA ShieldRVs-PT-100A-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 272 ms. (146 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 301 ms. (132 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (8 resets) in 262 ms. (152 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 298 ms. (133 steps per ms) remains 6/6 properties
// Phase 1: matrix 1902 rows 1402 cols
[2024-06-01 20:18:12] [INFO ] Computed 401 invariants in 9 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 181/181 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/181 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 386/567 variables, 155/336 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/567 variables, 386/722 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/567 variables, 0/722 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 835/1402 variables, 246/968 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1402 variables, 835/1803 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1402 variables, 0/1803 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 1902/3304 variables, 1402/3205 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3304 variables, 0/3205 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 0/3304 variables, 0/3205 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3304/3304 variables, and 3205 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1442 ms.
Refiners :[Domain max(s): 1402/1402 constraints, Positive P Invariants (semi-flows): 401/401 constraints, State Equation: 1402/1402 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 181/181 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/181 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 386/567 variables, 155/336 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/567 variables, 386/722 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 20:18:14] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 1 ms to minimize.
[2024-06-01 20:18:14] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/567 variables, 2/724 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/567 variables, 0/724 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 835/1402 variables, 246/970 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1402 variables, 835/1805 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 20:18:14] [INFO ] Deduced a trap composed of 7 places in 145 ms of which 2 ms to minimize.
[2024-06-01 20:18:14] [INFO ] Deduced a trap composed of 10 places in 145 ms of which 3 ms to minimize.
[2024-06-01 20:18:15] [INFO ] Deduced a trap composed of 7 places in 143 ms of which 2 ms to minimize.
[2024-06-01 20:18:15] [INFO ] Deduced a trap composed of 7 places in 164 ms of which 2 ms to minimize.
[2024-06-01 20:18:15] [INFO ] Deduced a trap composed of 7 places in 130 ms of which 2 ms to minimize.
[2024-06-01 20:18:15] [INFO ] Deduced a trap composed of 7 places in 121 ms of which 2 ms to minimize.
[2024-06-01 20:18:15] [INFO ] Deduced a trap composed of 7 places in 95 ms of which 1 ms to minimize.
[2024-06-01 20:18:15] [INFO ] Deduced a trap composed of 7 places in 103 ms of which 1 ms to minimize.
[2024-06-01 20:18:15] [INFO ] Deduced a trap composed of 7 places in 94 ms of which 1 ms to minimize.
[2024-06-01 20:18:16] [INFO ] Deduced a trap composed of 7 places in 87 ms of which 2 ms to minimize.
[2024-06-01 20:18:16] [INFO ] Deduced a trap composed of 7 places in 79 ms of which 2 ms to minimize.
[2024-06-01 20:18:16] [INFO ] Deduced a trap composed of 7 places in 75 ms of which 1 ms to minimize.
[2024-06-01 20:18:16] [INFO ] Deduced a trap composed of 7 places in 101 ms of which 1 ms to minimize.
[2024-06-01 20:18:16] [INFO ] Deduced a trap composed of 7 places in 60 ms of which 1 ms to minimize.
[2024-06-01 20:18:16] [INFO ] Deduced a trap composed of 7 places in 80 ms of which 1 ms to minimize.
[2024-06-01 20:18:16] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 0 ms to minimize.
[2024-06-01 20:18:16] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 0 ms to minimize.
[2024-06-01 20:18:16] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 5 ms to minimize.
[2024-06-01 20:18:16] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1402 variables, 19/1824 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 20:18:16] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1402 variables, 1/1825 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1402 variables, 0/1825 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 1902/3304 variables, 1402/3227 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3304 variables, 6/3233 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 20:18:20] [INFO ] Deduced a trap composed of 12 places in 151 ms of which 2 ms to minimize.
[2024-06-01 20:18:20] [INFO ] Deduced a trap composed of 7 places in 140 ms of which 2 ms to minimize.
[2024-06-01 20:18:21] [INFO ] Deduced a trap composed of 7 places in 136 ms of which 2 ms to minimize.
[2024-06-01 20:18:21] [INFO ] Deduced a trap composed of 11 places in 130 ms of which 2 ms to minimize.
[2024-06-01 20:18:21] [INFO ] Deduced a trap composed of 7 places in 138 ms of which 2 ms to minimize.
[2024-06-01 20:18:21] [INFO ] Deduced a trap composed of 7 places in 131 ms of which 2 ms to minimize.
[2024-06-01 20:18:22] [INFO ] Deduced a trap composed of 11 places in 132 ms of which 2 ms to minimize.
[2024-06-01 20:18:22] [INFO ] Deduced a trap composed of 20 places in 116 ms of which 2 ms to minimize.
[2024-06-01 20:18:22] [INFO ] Deduced a trap composed of 7 places in 122 ms of which 2 ms to minimize.
[2024-06-01 20:18:22] [INFO ] Deduced a trap composed of 11 places in 92 ms of which 1 ms to minimize.
[2024-06-01 20:18:22] [INFO ] Deduced a trap composed of 13 places in 125 ms of which 2 ms to minimize.
[2024-06-01 20:18:23] [INFO ] Deduced a trap composed of 11 places in 121 ms of which 2 ms to minimize.
[2024-06-01 20:18:23] [INFO ] Deduced a trap composed of 15 places in 120 ms of which 2 ms to minimize.
[2024-06-01 20:18:23] [INFO ] Deduced a trap composed of 15 places in 124 ms of which 2 ms to minimize.
[2024-06-01 20:18:23] [INFO ] Deduced a trap composed of 24 places in 107 ms of which 2 ms to minimize.
[2024-06-01 20:18:24] [INFO ] Deduced a trap composed of 28 places in 127 ms of which 2 ms to minimize.
[2024-06-01 20:18:24] [INFO ] Deduced a trap composed of 7 places in 96 ms of which 2 ms to minimize.
[2024-06-01 20:18:24] [INFO ] Deduced a trap composed of 7 places in 95 ms of which 2 ms to minimize.
[2024-06-01 20:18:24] [INFO ] Deduced a trap composed of 11 places in 95 ms of which 1 ms to minimize.
[2024-06-01 20:18:24] [INFO ] Deduced a trap composed of 12 places in 86 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/3304 variables, 20/3253 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 20:18:26] [INFO ] Deduced a trap composed of 11 places in 78 ms of which 1 ms to minimize.
[2024-06-01 20:18:26] [INFO ] Deduced a trap composed of 11 places in 86 ms of which 1 ms to minimize.
[2024-06-01 20:18:26] [INFO ] Deduced a trap composed of 7 places in 77 ms of which 2 ms to minimize.
[2024-06-01 20:18:26] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 1 ms to minimize.
[2024-06-01 20:18:26] [INFO ] Deduced a trap composed of 11 places in 73 ms of which 1 ms to minimize.
[2024-06-01 20:18:27] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 0 ms to minimize.
[2024-06-01 20:18:27] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2024-06-01 20:18:27] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
[2024-06-01 20:18:27] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 0 ms to minimize.
[2024-06-01 20:18:27] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 1 ms to minimize.
[2024-06-01 20:18:27] [INFO ] Deduced a trap composed of 7 places in 86 ms of which 1 ms to minimize.
[2024-06-01 20:18:28] [INFO ] Deduced a trap composed of 11 places in 67 ms of which 1 ms to minimize.
[2024-06-01 20:18:28] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
[2024-06-01 20:18:28] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2024-06-01 20:18:28] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 1 ms to minimize.
[2024-06-01 20:18:28] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2024-06-01 20:18:28] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 1 ms to minimize.
[2024-06-01 20:18:28] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2024-06-01 20:18:29] [INFO ] Deduced a trap composed of 27 places in 57 ms of which 0 ms to minimize.
[2024-06-01 20:18:29] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/3304 variables, 20/3273 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 20:18:30] [INFO ] Deduced a trap composed of 7 places in 63 ms of which 1 ms to minimize.
[2024-06-01 20:18:30] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 1 ms to minimize.
[2024-06-01 20:18:30] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 1 ms to minimize.
[2024-06-01 20:18:30] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 1 ms to minimize.
[2024-06-01 20:18:31] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 1 ms to minimize.
[2024-06-01 20:18:31] [INFO ] Deduced a trap composed of 27 places in 61 ms of which 0 ms to minimize.
[2024-06-01 20:18:31] [INFO ] Deduced a trap composed of 27 places in 60 ms of which 1 ms to minimize.
[2024-06-01 20:18:31] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/3304 variables, 8/3281 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 20:18:32] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/3304 variables, 1/3282 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3304 variables, 0/3282 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 0/3304 variables, 0/3282 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3304/3304 variables, and 3282 constraints, problems are : Problem set: 0 solved, 6 unsolved in 22665 ms.
Refiners :[Domain max(s): 1402/1402 constraints, Positive P Invariants (semi-flows): 401/401 constraints, State Equation: 1402/1402 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 71/71 constraints]
After SMT, in 24189ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 9673 ms.
Support contains 181 out of 1402 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1402/1402 places, 1902/1902 transitions.
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 0 with 5 rules applied. Total rules applied 5 place count 1402 transition count 1902
Applied a total of 5 rules in 103 ms. Remains 1402 /1402 variables (removed 0) and now considering 1902/1902 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 105 ms. Remains : 1402/1402 places, 1902/1902 transitions.
RANDOM walk for 40000 steps (32 resets) in 671 ms. (59 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 314 ms. (126 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 277 ms. (143 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 264 ms. (150 steps per ms) remains 5/6 properties
FORMULA ShieldRVs-PT-100A-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 300 ms. (132 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 270 ms. (147 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 298 ms. (133 steps per ms) remains 5/5 properties
// Phase 1: matrix 1902 rows 1402 cols
[2024-06-01 20:18:47] [INFO ] Computed 401 invariants in 7 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 170/170 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 373/543 variables, 148/318 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/543 variables, 373/691 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/543 variables, 0/691 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 859/1402 variables, 253/944 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1402 variables, 859/1803 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1402 variables, 0/1803 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 1902/3304 variables, 1402/3205 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3304 variables, 0/3205 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 0/3304 variables, 0/3205 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3304/3304 variables, and 3205 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1346 ms.
Refiners :[Domain max(s): 1402/1402 constraints, Positive P Invariants (semi-flows): 401/401 constraints, State Equation: 1402/1402 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 170/170 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 373/543 variables, 148/318 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/543 variables, 373/691 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/543 variables, 0/691 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 859/1402 variables, 253/944 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1402 variables, 859/1803 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 20:18:49] [INFO ] Deduced a trap composed of 7 places in 188 ms of which 2 ms to minimize.
[2024-06-01 20:18:49] [INFO ] Deduced a trap composed of 7 places in 189 ms of which 3 ms to minimize.
[2024-06-01 20:18:49] [INFO ] Deduced a trap composed of 7 places in 155 ms of which 3 ms to minimize.
[2024-06-01 20:18:49] [INFO ] Deduced a trap composed of 7 places in 147 ms of which 2 ms to minimize.
[2024-06-01 20:18:49] [INFO ] Deduced a trap composed of 7 places in 144 ms of which 2 ms to minimize.
[2024-06-01 20:18:50] [INFO ] Deduced a trap composed of 11 places in 146 ms of which 3 ms to minimize.
[2024-06-01 20:18:50] [INFO ] Deduced a trap composed of 7 places in 148 ms of which 2 ms to minimize.
[2024-06-01 20:18:50] [INFO ] Deduced a trap composed of 9 places in 148 ms of which 2 ms to minimize.
[2024-06-01 20:18:50] [INFO ] Deduced a trap composed of 7 places in 146 ms of which 2 ms to minimize.
[2024-06-01 20:18:50] [INFO ] Deduced a trap composed of 7 places in 132 ms of which 3 ms to minimize.
[2024-06-01 20:18:50] [INFO ] Deduced a trap composed of 8 places in 127 ms of which 3 ms to minimize.
[2024-06-01 20:18:50] [INFO ] Deduced a trap composed of 7 places in 132 ms of which 2 ms to minimize.
[2024-06-01 20:18:51] [INFO ] Deduced a trap composed of 7 places in 127 ms of which 2 ms to minimize.
[2024-06-01 20:18:51] [INFO ] Deduced a trap composed of 7 places in 111 ms of which 2 ms to minimize.
[2024-06-01 20:18:51] [INFO ] Deduced a trap composed of 16 places in 109 ms of which 2 ms to minimize.
[2024-06-01 20:18:51] [INFO ] Deduced a trap composed of 7 places in 102 ms of which 2 ms to minimize.
[2024-06-01 20:18:51] [INFO ] Deduced a trap composed of 7 places in 100 ms of which 2 ms to minimize.
[2024-06-01 20:18:51] [INFO ] Deduced a trap composed of 7 places in 94 ms of which 1 ms to minimize.
[2024-06-01 20:18:51] [INFO ] Deduced a trap composed of 7 places in 93 ms of which 2 ms to minimize.
[2024-06-01 20:18:52] [INFO ] Deduced a trap composed of 7 places in 98 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1402 variables, 20/1823 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 20:18:52] [INFO ] Deduced a trap composed of 7 places in 68 ms of which 2 ms to minimize.
[2024-06-01 20:18:52] [INFO ] Deduced a trap composed of 7 places in 75 ms of which 2 ms to minimize.
[2024-06-01 20:18:52] [INFO ] Deduced a trap composed of 8 places in 88 ms of which 1 ms to minimize.
[2024-06-01 20:18:52] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 2 ms to minimize.
[2024-06-01 20:18:52] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 1 ms to minimize.
[2024-06-01 20:18:52] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 1 ms to minimize.
[2024-06-01 20:18:52] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 1 ms to minimize.
[2024-06-01 20:18:52] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 1 ms to minimize.
[2024-06-01 20:18:52] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 1 ms to minimize.
[2024-06-01 20:18:52] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-06-01 20:18:52] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 1 ms to minimize.
[2024-06-01 20:18:53] [INFO ] Deduced a trap composed of 12 places in 89 ms of which 0 ms to minimize.
[2024-06-01 20:18:53] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2024-06-01 20:18:53] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 1 ms to minimize.
[2024-06-01 20:18:53] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 2 ms to minimize.
[2024-06-01 20:18:53] [INFO ] Deduced a trap composed of 7 places in 58 ms of which 0 ms to minimize.
[2024-06-01 20:18:53] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
[2024-06-01 20:18:53] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 0 ms to minimize.
[2024-06-01 20:18:53] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1402 variables, 19/1842 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 20:18:53] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1402 variables, 1/1843 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 20:18:53] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 0 ms to minimize.
[2024-06-01 20:18:54] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1402 variables, 2/1845 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1402 variables, 0/1845 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 1902/3304 variables, 1402/3247 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3304 variables, 5/3252 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 20:18:56] [INFO ] Deduced a trap composed of 7 places in 166 ms of which 3 ms to minimize.
[2024-06-01 20:18:56] [INFO ] Deduced a trap composed of 7 places in 162 ms of which 2 ms to minimize.
[2024-06-01 20:18:57] [INFO ] Deduced a trap composed of 6 places in 172 ms of which 2 ms to minimize.
[2024-06-01 20:18:57] [INFO ] Deduced a trap composed of 7 places in 170 ms of which 2 ms to minimize.
[2024-06-01 20:18:57] [INFO ] Deduced a trap composed of 11 places in 144 ms of which 2 ms to minimize.
[2024-06-01 20:18:57] [INFO ] Deduced a trap composed of 11 places in 143 ms of which 2 ms to minimize.
[2024-06-01 20:18:58] [INFO ] Deduced a trap composed of 7 places in 144 ms of which 2 ms to minimize.
[2024-06-01 20:18:58] [INFO ] Deduced a trap composed of 7 places in 139 ms of which 2 ms to minimize.
[2024-06-01 20:18:58] [INFO ] Deduced a trap composed of 8 places in 145 ms of which 3 ms to minimize.
[2024-06-01 20:18:58] [INFO ] Deduced a trap composed of 15 places in 126 ms of which 2 ms to minimize.
[2024-06-01 20:18:59] [INFO ] Deduced a trap composed of 7 places in 131 ms of which 2 ms to minimize.
[2024-06-01 20:18:59] [INFO ] Deduced a trap composed of 7 places in 130 ms of which 2 ms to minimize.
[2024-06-01 20:18:59] [INFO ] Deduced a trap composed of 7 places in 124 ms of which 2 ms to minimize.
[2024-06-01 20:18:59] [INFO ] Deduced a trap composed of 7 places in 121 ms of which 2 ms to minimize.
[2024-06-01 20:18:59] [INFO ] Deduced a trap composed of 7 places in 120 ms of which 2 ms to minimize.
[2024-06-01 20:19:00] [INFO ] Deduced a trap composed of 11 places in 125 ms of which 2 ms to minimize.
[2024-06-01 20:19:00] [INFO ] Deduced a trap composed of 7 places in 124 ms of which 2 ms to minimize.
[2024-06-01 20:19:00] [INFO ] Deduced a trap composed of 7 places in 110 ms of which 2 ms to minimize.
[2024-06-01 20:19:00] [INFO ] Deduced a trap composed of 7 places in 127 ms of which 2 ms to minimize.
[2024-06-01 20:19:00] [INFO ] Deduced a trap composed of 7 places in 121 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/3304 variables, 20/3272 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 20:19:02] [INFO ] Deduced a trap composed of 11 places in 93 ms of which 1 ms to minimize.
[2024-06-01 20:19:02] [INFO ] Deduced a trap composed of 7 places in 104 ms of which 1 ms to minimize.
[2024-06-01 20:19:02] [INFO ] Deduced a trap composed of 7 places in 99 ms of which 2 ms to minimize.
[2024-06-01 20:19:02] [INFO ] Deduced a trap composed of 7 places in 85 ms of which 1 ms to minimize.
[2024-06-01 20:19:03] [INFO ] Deduced a trap composed of 7 places in 84 ms of which 2 ms to minimize.
[2024-06-01 20:19:03] [INFO ] Deduced a trap composed of 7 places in 72 ms of which 1 ms to minimize.
[2024-06-01 20:19:03] [INFO ] Deduced a trap composed of 12 places in 74 ms of which 1 ms to minimize.
[2024-06-01 20:19:03] [INFO ] Deduced a trap composed of 7 places in 72 ms of which 1 ms to minimize.
[2024-06-01 20:19:03] [INFO ] Deduced a trap composed of 7 places in 60 ms of which 1 ms to minimize.
[2024-06-01 20:19:03] [INFO ] Deduced a trap composed of 7 places in 58 ms of which 1 ms to minimize.
[2024-06-01 20:19:04] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-06-01 20:19:04] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 0 ms to minimize.
[2024-06-01 20:19:04] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 0 ms to minimize.
[2024-06-01 20:19:04] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 0 ms to minimize.
[2024-06-01 20:19:04] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
[2024-06-01 20:19:04] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2024-06-01 20:19:04] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-06-01 20:19:05] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-06-01 20:19:05] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 0 ms to minimize.
[2024-06-01 20:19:05] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/3304 variables, 20/3292 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 20:19:06] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 1 ms to minimize.
[2024-06-01 20:19:06] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-06-01 20:19:06] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 0 ms to minimize.
[2024-06-01 20:19:06] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
[2024-06-01 20:19:06] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 1 ms to minimize.
[2024-06-01 20:19:06] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2024-06-01 20:19:07] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 0 ms to minimize.
[2024-06-01 20:19:07] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/3304 variables, 8/3300 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3304 variables, 0/3300 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 20:19:09] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 0 ms to minimize.
[2024-06-01 20:19:09] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 1 ms to minimize.
At refinement iteration 18 (OVERLAPS) 0/3304 variables, 2/3302 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3304 variables, 0/3302 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 20:19:11] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 1 ms to minimize.
At refinement iteration 20 (OVERLAPS) 0/3304 variables, 1/3303 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3304 variables, 0/3303 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (OVERLAPS) 0/3304 variables, 0/3303 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3304/3304 variables, and 3303 constraints, problems are : Problem set: 0 solved, 5 unsolved in 25458 ms.
Refiners :[Domain max(s): 1402/1402 constraints, Positive P Invariants (semi-flows): 401/401 constraints, State Equation: 1402/1402 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 93/93 constraints]
After SMT, in 26862ms problems are : Problem set: 0 solved, 5 unsolved
FORMULA ShieldRVs-PT-100A-ReachabilityFireability-2024-04 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 17118 ms.
Support contains 151 out of 1402 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1402/1402 places, 1902/1902 transitions.
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 0 with 5 rules applied. Total rules applied 5 place count 1402 transition count 1902
Applied a total of 5 rules in 93 ms. Remains 1402 /1402 variables (removed 0) and now considering 1902/1902 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 93 ms. Remains : 1402/1402 places, 1902/1902 transitions.
RANDOM walk for 40000 steps (32 resets) in 577 ms. (69 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 304 ms. (131 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 296 ms. (134 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 258 ms. (154 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 295 ms. (135 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 93695 steps, run timeout after 3001 ms. (steps per millisecond=31 ) properties seen :0 out of 4
Probabilistic random walk after 93695 steps, saw 41002 distinct states, run finished after 3005 ms. (steps per millisecond=31 ) properties seen :0
// Phase 1: matrix 1902 rows 1402 cols
[2024-06-01 20:19:34] [INFO ] Computed 401 invariants in 12 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/151 variables, 151/151 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/151 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 352/503 variables, 136/287 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/503 variables, 352/639 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/503 variables, 0/639 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 899/1402 variables, 265/904 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1402 variables, 899/1803 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1402 variables, 0/1803 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 1902/3304 variables, 1402/3205 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3304 variables, 0/3205 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 0/3304 variables, 0/3205 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3304/3304 variables, and 3205 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1126 ms.
Refiners :[Domain max(s): 1402/1402 constraints, Positive P Invariants (semi-flows): 401/401 constraints, State Equation: 1402/1402 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/151 variables, 151/151 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/151 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 352/503 variables, 136/287 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/503 variables, 352/639 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/503 variables, 0/639 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 899/1402 variables, 265/904 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1402 variables, 899/1803 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 20:19:36] [INFO ] Deduced a trap composed of 7 places in 177 ms of which 3 ms to minimize.
[2024-06-01 20:19:36] [INFO ] Deduced a trap composed of 7 places in 163 ms of which 2 ms to minimize.
[2024-06-01 20:19:36] [INFO ] Deduced a trap composed of 7 places in 170 ms of which 2 ms to minimize.
[2024-06-01 20:19:37] [INFO ] Deduced a trap composed of 7 places in 164 ms of which 3 ms to minimize.
[2024-06-01 20:19:37] [INFO ] Deduced a trap composed of 7 places in 157 ms of which 3 ms to minimize.
[2024-06-01 20:19:37] [INFO ] Deduced a trap composed of 7 places in 159 ms of which 3 ms to minimize.
[2024-06-01 20:19:37] [INFO ] Deduced a trap composed of 7 places in 156 ms of which 2 ms to minimize.
[2024-06-01 20:19:37] [INFO ] Deduced a trap composed of 7 places in 158 ms of which 3 ms to minimize.
[2024-06-01 20:19:37] [INFO ] Deduced a trap composed of 7 places in 157 ms of which 3 ms to minimize.
[2024-06-01 20:19:38] [INFO ] Deduced a trap composed of 7 places in 159 ms of which 2 ms to minimize.
[2024-06-01 20:19:38] [INFO ] Deduced a trap composed of 11 places in 143 ms of which 3 ms to minimize.
[2024-06-01 20:19:38] [INFO ] Deduced a trap composed of 12 places in 134 ms of which 3 ms to minimize.
[2024-06-01 20:19:38] [INFO ] Deduced a trap composed of 15 places in 134 ms of which 3 ms to minimize.
[2024-06-01 20:19:38] [INFO ] Deduced a trap composed of 11 places in 136 ms of which 2 ms to minimize.
[2024-06-01 20:19:38] [INFO ] Deduced a trap composed of 7 places in 122 ms of which 2 ms to minimize.
[2024-06-01 20:19:39] [INFO ] Deduced a trap composed of 7 places in 124 ms of which 2 ms to minimize.
[2024-06-01 20:19:39] [INFO ] Deduced a trap composed of 7 places in 119 ms of which 2 ms to minimize.
[2024-06-01 20:19:39] [INFO ] Deduced a trap composed of 11 places in 116 ms of which 2 ms to minimize.
[2024-06-01 20:19:39] [INFO ] Deduced a trap composed of 12 places in 112 ms of which 2 ms to minimize.
[2024-06-01 20:19:39] [INFO ] Deduced a trap composed of 7 places in 102 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1402 variables, 20/1823 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 20:19:39] [INFO ] Deduced a trap composed of 11 places in 152 ms of which 2 ms to minimize.
[2024-06-01 20:19:39] [INFO ] Deduced a trap composed of 7 places in 99 ms of which 1 ms to minimize.
[2024-06-01 20:19:40] [INFO ] Deduced a trap composed of 7 places in 91 ms of which 1 ms to minimize.
[2024-06-01 20:19:40] [INFO ] Deduced a trap composed of 7 places in 82 ms of which 1 ms to minimize.
[2024-06-01 20:19:40] [INFO ] Deduced a trap composed of 14 places in 80 ms of which 1 ms to minimize.
[2024-06-01 20:19:40] [INFO ] Deduced a trap composed of 7 places in 77 ms of which 1 ms to minimize.
[2024-06-01 20:19:40] [INFO ] Deduced a trap composed of 7 places in 79 ms of which 1 ms to minimize.
[2024-06-01 20:19:40] [INFO ] Deduced a trap composed of 11 places in 78 ms of which 2 ms to minimize.
[2024-06-01 20:19:40] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 1 ms to minimize.
[2024-06-01 20:19:40] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 1 ms to minimize.
[2024-06-01 20:19:40] [INFO ] Deduced a trap composed of 8 places in 62 ms of which 1 ms to minimize.
[2024-06-01 20:19:40] [INFO ] Deduced a trap composed of 7 places in 57 ms of which 2 ms to minimize.
[2024-06-01 20:19:40] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 0 ms to minimize.
[2024-06-01 20:19:41] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 0 ms to minimize.
[2024-06-01 20:19:41] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 0 ms to minimize.
[2024-06-01 20:19:41] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1402 variables, 16/1839 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 20:19:41] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1402 variables, 1/1840 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1402 variables, 0/1840 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 1902/3304 variables, 1402/3242 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3304 variables, 4/3246 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 20:19:43] [INFO ] Deduced a trap composed of 7 places in 215 ms of which 3 ms to minimize.
[2024-06-01 20:19:44] [INFO ] Deduced a trap composed of 11 places in 222 ms of which 3 ms to minimize.
[2024-06-01 20:19:44] [INFO ] Deduced a trap composed of 7 places in 211 ms of which 3 ms to minimize.
[2024-06-01 20:19:44] [INFO ] Deduced a trap composed of 8 places in 212 ms of which 3 ms to minimize.
[2024-06-01 20:19:45] [INFO ] Deduced a trap composed of 7 places in 191 ms of which 3 ms to minimize.
[2024-06-01 20:19:45] [INFO ] Deduced a trap composed of 12 places in 186 ms of which 2 ms to minimize.
[2024-06-01 20:19:45] [INFO ] Deduced a trap composed of 7 places in 158 ms of which 2 ms to minimize.
[2024-06-01 20:19:45] [INFO ] Deduced a trap composed of 8 places in 164 ms of which 2 ms to minimize.
[2024-06-01 20:19:46] [INFO ] Deduced a trap composed of 7 places in 170 ms of which 3 ms to minimize.
[2024-06-01 20:19:46] [INFO ] Deduced a trap composed of 7 places in 161 ms of which 2 ms to minimize.
[2024-06-01 20:19:46] [INFO ] Deduced a trap composed of 11 places in 156 ms of which 2 ms to minimize.
[2024-06-01 20:19:46] [INFO ] Deduced a trap composed of 7 places in 161 ms of which 3 ms to minimize.
[2024-06-01 20:19:47] [INFO ] Deduced a trap composed of 7 places in 128 ms of which 2 ms to minimize.
[2024-06-01 20:19:47] [INFO ] Deduced a trap composed of 7 places in 132 ms of which 2 ms to minimize.
[2024-06-01 20:19:47] [INFO ] Deduced a trap composed of 7 places in 120 ms of which 2 ms to minimize.
[2024-06-01 20:19:47] [INFO ] Deduced a trap composed of 11 places in 136 ms of which 2 ms to minimize.
[2024-06-01 20:19:48] [INFO ] Deduced a trap composed of 11 places in 131 ms of which 2 ms to minimize.
[2024-06-01 20:19:48] [INFO ] Deduced a trap composed of 7 places in 118 ms of which 3 ms to minimize.
[2024-06-01 20:19:48] [INFO ] Deduced a trap composed of 8 places in 124 ms of which 4 ms to minimize.
[2024-06-01 20:19:48] [INFO ] Deduced a trap composed of 20 places in 123 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/3304 variables, 20/3266 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 20:19:49] [INFO ] Deduced a trap composed of 7 places in 116 ms of which 2 ms to minimize.
[2024-06-01 20:19:50] [INFO ] Deduced a trap composed of 9 places in 113 ms of which 2 ms to minimize.
[2024-06-01 20:19:50] [INFO ] Deduced a trap composed of 11 places in 94 ms of which 1 ms to minimize.
[2024-06-01 20:19:50] [INFO ] Deduced a trap composed of 7 places in 97 ms of which 1 ms to minimize.
[2024-06-01 20:19:50] [INFO ] Deduced a trap composed of 7 places in 94 ms of which 1 ms to minimize.
[2024-06-01 20:19:50] [INFO ] Deduced a trap composed of 11 places in 84 ms of which 1 ms to minimize.
[2024-06-01 20:19:51] [INFO ] Deduced a trap composed of 12 places in 78 ms of which 2 ms to minimize.
[2024-06-01 20:19:51] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 1 ms to minimize.
[2024-06-01 20:19:51] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 1 ms to minimize.
[2024-06-01 20:19:51] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 1 ms to minimize.
[2024-06-01 20:19:51] [INFO ] Deduced a trap composed of 19 places in 76 ms of which 1 ms to minimize.
[2024-06-01 20:19:51] [INFO ] Deduced a trap composed of 7 places in 72 ms of which 1 ms to minimize.
[2024-06-01 20:19:52] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 1 ms to minimize.
[2024-06-01 20:19:52] [INFO ] Deduced a trap composed of 19 places in 76 ms of which 1 ms to minimize.
[2024-06-01 20:19:52] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 2 ms to minimize.
[2024-06-01 20:19:52] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2024-06-01 20:19:52] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 1 ms to minimize.
[2024-06-01 20:19:52] [INFO ] Deduced a trap composed of 7 places in 51 ms of which 1 ms to minimize.
[2024-06-01 20:19:53] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 1 ms to minimize.
[2024-06-01 20:19:53] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/3304 variables, 20/3286 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 20:19:54] [INFO ] Deduced a trap composed of 15 places in 103 ms of which 1 ms to minimize.
[2024-06-01 20:19:54] [INFO ] Deduced a trap composed of 7 places in 102 ms of which 1 ms to minimize.
[2024-06-01 20:19:54] [INFO ] Deduced a trap composed of 20 places in 79 ms of which 1 ms to minimize.
[2024-06-01 20:19:54] [INFO ] Deduced a trap composed of 11 places in 87 ms of which 1 ms to minimize.
[2024-06-01 20:19:54] [INFO ] Deduced a trap composed of 19 places in 86 ms of which 1 ms to minimize.
[2024-06-01 20:19:55] [INFO ] Deduced a trap composed of 16 places in 84 ms of which 1 ms to minimize.
[2024-06-01 20:19:55] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 1 ms to minimize.
[2024-06-01 20:19:55] [INFO ] Deduced a trap composed of 27 places in 57 ms of which 1 ms to minimize.
[2024-06-01 20:19:55] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 0 ms to minimize.
[2024-06-01 20:19:55] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 1 ms to minimize.
[2024-06-01 20:19:55] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 1 ms to minimize.
[2024-06-01 20:19:55] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
[2024-06-01 20:19:56] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 0 ms to minimize.
[2024-06-01 20:19:56] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 1 ms to minimize.
[2024-06-01 20:19:56] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 0 ms to minimize.
[2024-06-01 20:19:56] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2024-06-01 20:19:56] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 0 ms to minimize.
[2024-06-01 20:19:56] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 0 ms to minimize.
[2024-06-01 20:19:57] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/3304 variables, 19/3305 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 20:19:58] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 0 ms to minimize.
[2024-06-01 20:19:58] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
[2024-06-01 20:19:58] [INFO ] Deduced a trap composed of 25 places in 56 ms of which 1 ms to minimize.
[2024-06-01 20:19:58] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 0 ms to minimize.
[2024-06-01 20:19:58] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/3304 variables, 5/3310 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 20:19:59] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 0 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/3304 variables, 1/3311 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 20:20:00] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 1 ms to minimize.
[2024-06-01 20:20:00] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
[2024-06-01 20:20:01] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 0 ms to minimize.
[2024-06-01 20:20:01] [INFO ] Deduced a trap composed of 7 places in 48 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/3304 variables, 4/3315 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3304 variables, 0/3315 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 0/3304 variables, 0/3315 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3304/3304 variables, and 3315 constraints, problems are : Problem set: 0 solved, 4 unsolved in 28111 ms.
Refiners :[Domain max(s): 1402/1402 constraints, Positive P Invariants (semi-flows): 401/401 constraints, State Equation: 1402/1402 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 106/106 constraints]
After SMT, in 29307ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 9256 ms.
Support contains 151 out of 1402 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1402/1402 places, 1902/1902 transitions.
Applied a total of 0 rules in 73 ms. Remains 1402 /1402 variables (removed 0) and now considering 1902/1902 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 1402/1402 places, 1902/1902 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1402/1402 places, 1902/1902 transitions.
Applied a total of 0 rules in 47 ms. Remains 1402 /1402 variables (removed 0) and now considering 1902/1902 (removed 0) transitions.
[2024-06-01 20:20:13] [INFO ] Invariant cache hit.
[2024-06-01 20:20:14] [INFO ] Implicit Places using invariants in 752 ms returned []
[2024-06-01 20:20:14] [INFO ] Invariant cache hit.
[2024-06-01 20:20:15] [INFO ] Implicit Places using invariants and state equation in 1657 ms returned []
Implicit Place search using SMT with State Equation took 2418 ms to find 0 implicit places.
[2024-06-01 20:20:16] [INFO ] Redundant transitions in 685 ms returned []
Running 1901 sub problems to find dead transitions.
[2024-06-01 20:20:16] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/1401 variables, 1401/1401 constraints. Problems are: Problem set: 0 solved, 1901 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1401/3304 variables, and 1401 constraints, problems are : Problem set: 0 solved, 1901 unsolved in 30061 ms.
Refiners :[Domain max(s): 1401/1402 constraints, Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/1402 constraints, PredecessorRefiner: 1901/1901 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1901 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1401 variables, 1401/1401 constraints. Problems are: Problem set: 0 solved, 1901 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1401/3304 variables, and 1401 constraints, problems are : Problem set: 0 solved, 1901 unsolved in 30034 ms.
Refiners :[Domain max(s): 1401/1402 constraints, Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/1402 constraints, PredecessorRefiner: 0/1901 constraints, Known Traps: 0/0 constraints]
After SMT, in 61170ms problems are : Problem set: 0 solved, 1901 unsolved
Search for dead transitions found 0 dead transitions in 61188ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64356 ms. Remains : 1402/1402 places, 1902/1902 transitions.
[2024-06-01 20:21:17] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 5 ms.
[2024-06-01 20:21:17] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1402 places, 1902 transitions and 9532 arcs took 14 ms.
[2024-06-01 20:21:18] [INFO ] Flatten gal took : 264 ms
Total runtime 197038 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 : ShieldRVs-PT-100A-ReachabilityFireability-2024-00
Could not compute solution for formula : ShieldRVs-PT-100A-ReachabilityFireability-2024-10
Could not compute solution for formula : ShieldRVs-PT-100A-ReachabilityFireability-2024-14
Could not compute solution for formula : ShieldRVs-PT-100A-ReachabilityFireability-2024-15

BK_STOP 1717273278515

--------------------
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 ShieldRVs-PT-100A-ReachabilityFireability-2024-00
rfs formula type AG
rfs formula formula --invariant=/tmp/1473/inv_0_
rfs formula name ShieldRVs-PT-100A-ReachabilityFireability-2024-10
rfs formula type AG
rfs formula formula --invariant=/tmp/1473/inv_1_
rfs formula name ShieldRVs-PT-100A-ReachabilityFireability-2024-14
rfs formula type EF
rfs formula formula --invariant=/tmp/1473/inv_2_
rfs formula name ShieldRVs-PT-100A-ReachabilityFireability-2024-15
rfs formula type EF
rfs formula formula --invariant=/tmp/1473/inv_3_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldRVs-PT-100A"
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 ShieldRVs-PT-100A, 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 r528-tall-171683762000871"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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