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-171734921200079.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-10, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r579-smll-171734921200079
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 552K
-rw-r--r-- 1 mcc users 6.8K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K 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.9K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K 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 94K 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 107K 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-10-ReachabilityFireability-2024-00
FORMULA_NAME MedleyA-PT-10-ReachabilityFireability-2024-01
FORMULA_NAME MedleyA-PT-10-ReachabilityFireability-2024-02
FORMULA_NAME MedleyA-PT-10-ReachabilityFireability-2024-03
FORMULA_NAME MedleyA-PT-10-ReachabilityFireability-2024-04
FORMULA_NAME MedleyA-PT-10-ReachabilityFireability-2024-05
FORMULA_NAME MedleyA-PT-10-ReachabilityFireability-2024-06
FORMULA_NAME MedleyA-PT-10-ReachabilityFireability-2024-07
FORMULA_NAME MedleyA-PT-10-ReachabilityFireability-2024-08
FORMULA_NAME MedleyA-PT-10-ReachabilityFireability-2024-09
FORMULA_NAME MedleyA-PT-10-ReachabilityFireability-2024-10
FORMULA_NAME MedleyA-PT-10-ReachabilityFireability-2024-11
FORMULA_NAME MedleyA-PT-10-ReachabilityFireability-2024-12
FORMULA_NAME MedleyA-PT-10-ReachabilityFireability-2024-13
FORMULA_NAME MedleyA-PT-10-ReachabilityFireability-2024-14
FORMULA_NAME MedleyA-PT-10-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717355952051

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-10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 19:19:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-02 19:19:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 19:19:14] [INFO ] Load time of PNML (sax parser for PT used): 217 ms
[2024-06-02 19:19:14] [INFO ] Transformed 149 places.
[2024-06-02 19:19:14] [INFO ] Transformed 340 transitions.
[2024-06-02 19:19:14] [INFO ] Found NUPN structural information;
[2024-06-02 19:19:14] [INFO ] Parsed PT model containing 149 places and 340 transitions and 1721 arcs in 459 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 34 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (1757 resets) in 2679 ms. (14 steps per ms) remains 13/16 properties
FORMULA MedleyA-PT-10-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-10-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-10-ReachabilityFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (424 resets) in 153 ms. (259 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (420 resets) in 711 ms. (56 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (421 resets) in 731 ms. (54 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (451 resets) in 382 ms. (104 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (386 resets) in 356 ms. (112 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (436 resets) in 304 ms. (131 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (354 resets) in 183 ms. (217 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (399 resets) in 244 ms. (163 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (422 resets) in 401 ms. (99 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (461 resets) in 381 ms. (104 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (344 resets) in 182 ms. (218 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (469 resets) in 131 ms. (303 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (436 resets) in 85 ms. (465 steps per ms) remains 13/13 properties
// Phase 1: matrix 340 rows 149 cols
[2024-06-02 19:19:17] [INFO ] Computed 12 invariants in 21 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 96/96 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Problem MedleyA-PT-10-ReachabilityFireability-2024-09 is UNSAT
FORMULA MedleyA-PT-10-ReachabilityFireability-2024-09 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (OVERLAPS) 33/129 variables, 7/104 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 33/137 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 0/137 constraints. Problems are: Problem set: 1 solved, 12 unsolved
Problem MedleyA-PT-10-ReachabilityFireability-2024-03 is UNSAT
FORMULA MedleyA-PT-10-ReachabilityFireability-2024-03 FALSE TECHNIQUES SMT_REFINEMENT
Problem MedleyA-PT-10-ReachabilityFireability-2024-04 is UNSAT
FORMULA MedleyA-PT-10-ReachabilityFireability-2024-04 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 6 (OVERLAPS) 20/149 variables, 4/141 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/149 variables, 20/161 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/149 variables, 0/161 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 340/489 variables, 149/310 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/489 variables, 0/310 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 11 (OVERLAPS) 0/489 variables, 0/310 constraints. Problems are: Problem set: 3 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 489/489 variables, and 310 constraints, problems are : Problem set: 3 solved, 10 unsolved in 2085 ms.
Refiners :[Domain max(s): 149/149 constraints, Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 149/149 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 80/80 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 1/81 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/81 constraints. Problems are: Problem set: 3 solved, 10 unsolved
Problem MedleyA-PT-10-ReachabilityFireability-2024-07 is UNSAT
FORMULA MedleyA-PT-10-ReachabilityFireability-2024-07 TRUE TECHNIQUES SMT_REFINEMENT
Problem MedleyA-PT-10-ReachabilityFireability-2024-12 is UNSAT
FORMULA MedleyA-PT-10-ReachabilityFireability-2024-12 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (OVERLAPS) 43/123 variables, 7/88 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 43/131 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/123 variables, 0/131 constraints. Problems are: Problem set: 5 solved, 8 unsolved
Problem MedleyA-PT-10-ReachabilityFireability-2024-13 is UNSAT
FORMULA MedleyA-PT-10-ReachabilityFireability-2024-13 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 6 (OVERLAPS) 26/149 variables, 4/135 constraints. Problems are: Problem set: 6 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/149 variables, 26/161 constraints. Problems are: Problem set: 6 solved, 7 unsolved
[2024-06-02 19:19:21] [INFO ] Deduced a trap composed of 33 places in 248 ms of which 37 ms to minimize.
[2024-06-02 19:19:21] [INFO ] Deduced a trap composed of 23 places in 170 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/149 variables, 2/163 constraints. Problems are: Problem set: 6 solved, 7 unsolved
[2024-06-02 19:19:21] [INFO ] Deduced a trap composed of 47 places in 209 ms of which 3 ms to minimize.
[2024-06-02 19:19:21] [INFO ] Deduced a trap composed of 35 places in 193 ms of which 3 ms to minimize.
[2024-06-02 19:19:22] [INFO ] Deduced a trap composed of 27 places in 153 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/149 variables, 3/166 constraints. Problems are: Problem set: 6 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/149 variables, 0/166 constraints. Problems are: Problem set: 6 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 340/489 variables, 149/315 constraints. Problems are: Problem set: 6 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/489 variables, 7/322 constraints. Problems are: Problem set: 6 solved, 7 unsolved
[2024-06-02 19:19:23] [INFO ] Deduced a trap composed of 43 places in 170 ms of which 3 ms to minimize.
[2024-06-02 19:19:24] [INFO ] Deduced a trap composed of 19 places in 88 ms of which 2 ms to minimize.
[2024-06-02 19:19:24] [INFO ] Deduced a trap composed of 27 places in 142 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/489 variables, 3/325 constraints. Problems are: Problem set: 6 solved, 7 unsolved
[2024-06-02 19:19:25] [INFO ] Deduced a trap composed of 36 places in 139 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 1)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 1)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 1)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 1)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 1)
(s91timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 489/489 variables, and 326 constraints, problems are : Problem set: 6 solved, 7 unsolved in 5014 ms.
Refiners :[Domain max(s): 149/149 constraints, Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 149/149 constraints, PredecessorRefiner: 7/13 constraints, Known Traps: 9/9 constraints]
After SMT, in 7866ms problems are : Problem set: 6 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 80 out of 149 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 149/149 places, 340/340 transitions.
Graph (complete) has 543 edges and 149 vertex of which 146 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.5 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 146 transition count 336
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 8 place count 143 transition count 336
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 8 place count 143 transition count 335
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 142 transition count 335
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 28 place count 124 transition count 317
Iterating global reduction 2 with 18 rules applied. Total rules applied 46 place count 124 transition count 317
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 48 place count 124 transition count 315
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 49 place count 123 transition count 314
Iterating global reduction 3 with 1 rules applied. Total rules applied 50 place count 123 transition count 314
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 58 place count 119 transition count 310
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 64 place count 119 transition count 304
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 64 place count 119 transition count 302
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 68 place count 117 transition count 302
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 71 place count 117 transition count 299
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 74 place count 114 transition count 299
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 77 place count 114 transition count 299
Applied a total of 77 rules in 210 ms. Remains 114 /149 variables (removed 35) and now considering 299/340 (removed 41) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 233 ms. Remains : 114/149 places, 299/340 transitions.
RANDOM walk for 40000 steps (1965 resets) in 847 ms. (47 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (440 resets) in 94 ms. (421 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (436 resets) in 360 ms. (110 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (330 resets) in 329 ms. (121 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (435 resets) in 164 ms. (242 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (424 resets) in 247 ms. (161 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (492 resets) in 315 ms. (126 steps per ms) remains 6/7 properties
FORMULA MedleyA-PT-10-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (446 resets) in 86 ms. (459 steps per ms) remains 6/6 properties
// Phase 1: matrix 299 rows 114 cols
[2024-06-02 19:19:26] [INFO ] Computed 11 invariants in 6 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/69 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 28/97 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 16/113 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/113 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 299/412 variables, 113/124 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/412 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 1/413 variables, 1/125 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/413 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 0/413 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 413/413 variables, and 125 constraints, problems are : Problem set: 0 solved, 6 unsolved in 696 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 114/114 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/69 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/69 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 28/97 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 16/113 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-02 19:19:27] [INFO ] Deduced a trap composed of 20 places in 102 ms of which 2 ms to minimize.
[2024-06-02 19:19:27] [INFO ] Deduced a trap composed of 22 places in 130 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/113 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/113 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 299/412 variables, 113/126 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/412 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/412 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 1/413 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/413 variables, 5/133 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/413 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-02 19:19:31] [INFO ] Deduced a trap composed of 18 places in 83 ms of which 1 ms to minimize.
[2024-06-02 19:19:32] [INFO ] Deduced a trap composed of 23 places in 105 ms of which 2 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/413 variables, 2/135 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-02 19:19:34] [INFO ] Deduced a trap composed of 25 places in 208 ms of which 3 ms to minimize.
[2024-06-02 19:19:34] [INFO ] Deduced a trap composed of 20 places in 159 ms of which 3 ms to minimize.
[2024-06-02 19:19:34] [INFO ] Deduced a trap composed of 20 places in 152 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/413 variables, 3/138 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-02 19:19:35] [INFO ] Deduced a trap composed of 31 places in 159 ms of which 3 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/413 variables, 1/139 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/413 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-02 19:19:37] [INFO ] Deduced a trap composed of 29 places in 108 ms of which 2 ms to minimize.
At refinement iteration 17 (OVERLAPS) 0/413 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/413 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (OVERLAPS) 0/413 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 413/413 variables, and 140 constraints, problems are : Problem set: 0 solved, 6 unsolved in 11985 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 114/114 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 9/9 constraints]
After SMT, in 12862ms problems are : Problem set: 0 solved, 6 unsolved
Parikh walk visited 0 properties in 1076 ms.
Support contains 69 out of 114 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 114/114 places, 299/299 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 114 transition count 298
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 113 transition count 298
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 113 transition count 296
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 111 transition count 296
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 13 place count 104 transition count 286
Iterating global reduction 2 with 7 rules applied. Total rules applied 20 place count 104 transition count 286
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 23 place count 104 transition count 286
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 24 place count 103 transition count 284
Iterating global reduction 2 with 1 rules applied. Total rules applied 25 place count 103 transition count 284
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 26 place count 103 transition count 283
Applied a total of 26 rules in 40 ms. Remains 103 /114 variables (removed 11) and now considering 283/299 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 103/114 places, 283/299 transitions.
RANDOM walk for 40000 steps (2216 resets) in 391 ms. (102 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (459 resets) in 85 ms. (465 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (473 resets) in 185 ms. (215 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (314 resets) in 206 ms. (193 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (501 resets) in 100 ms. (396 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (459 resets) in 245 ms. (162 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (471 resets) in 94 ms. (421 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 528596 steps, run timeout after 3001 ms. (steps per millisecond=176 ) properties seen :1 out of 6
Probabilistic random walk after 528596 steps, saw 103712 distinct states, run finished after 3017 ms. (steps per millisecond=175 ) properties seen :1
FORMULA MedleyA-PT-10-ReachabilityFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 283 rows 103 cols
[2024-06-02 19:19:44] [INFO ] Computed 11 invariants in 2 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/69 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 17/86 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 16/102 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 283/385 variables, 102/113 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/385 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 1/386 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/386 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 0/386 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 386/386 variables, and 114 constraints, problems are : Problem set: 0 solved, 5 unsolved in 646 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 103/103 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/69 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/69 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 17/86 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 16/102 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-02 19:19:45] [INFO ] Deduced a trap composed of 21 places in 140 ms of which 2 ms to minimize.
[2024-06-02 19:19:45] [INFO ] Deduced a trap composed of 25 places in 114 ms of which 2 ms to minimize.
[2024-06-02 19:19:45] [INFO ] Deduced a trap composed of 22 places in 132 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 283/385 variables, 102/116 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-02 19:19:45] [INFO ] Deduced a trap composed of 21 places in 105 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/385 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-02 19:19:45] [INFO ] Deduced a trap composed of 35 places in 132 ms of which 2 ms to minimize.
[2024-06-02 19:19:46] [INFO ] Deduced a trap composed of 37 places in 152 ms of which 2 ms to minimize.
[2024-06-02 19:19:46] [INFO ] Deduced a trap composed of 33 places in 151 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/385 variables, 3/120 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-02 19:19:46] [INFO ] Deduced a trap composed of 22 places in 142 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/385 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/385 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 1/386 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/386 variables, 5/127 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-02 19:19:47] [INFO ] Deduced a trap composed of 30 places in 138 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/386 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/386 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 0/386 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 386/386 variables, and 128 constraints, problems are : Problem set: 0 solved, 5 unsolved in 4217 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 9/9 constraints]
After SMT, in 4952ms problems are : Problem set: 0 solved, 5 unsolved
FORMULA MedleyA-PT-10-ReachabilityFireability-2024-06 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 2046 ms.
Support contains 64 out of 103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 283/283 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 101 transition count 281
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 101 transition count 281
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 6 place count 101 transition count 281
Applied a total of 6 rules in 29 ms. Remains 101 /103 variables (removed 2) and now considering 281/283 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 101/103 places, 281/283 transitions.
RANDOM walk for 40000 steps (2229 resets) in 197 ms. (202 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (494 resets) in 195 ms. (204 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (313 resets) in 177 ms. (224 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (456 resets) in 191 ms. (208 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (468 resets) in 63 ms. (625 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 617385 steps, run timeout after 3001 ms. (steps per millisecond=205 ) properties seen :0 out of 4
Probabilistic random walk after 617385 steps, saw 117920 distinct states, run finished after 3001 ms. (steps per millisecond=205 ) properties seen :0
// Phase 1: matrix 281 rows 101 cols
[2024-06-02 19:19:54] [INFO ] Computed 11 invariants in 5 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 19/83 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 17/100 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 281/381 variables, 100/111 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/381 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 1/382 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/382 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 0/382 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 382/382 variables, and 112 constraints, problems are : Problem set: 0 solved, 4 unsolved in 565 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 101/101 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/64 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 19/83 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 17/100 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-02 19:19:55] [INFO ] Deduced a trap composed of 20 places in 106 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-02 19:19:55] [INFO ] Deduced a trap composed of 32 places in 114 ms of which 2 ms to minimize.
[2024-06-02 19:19:55] [INFO ] Deduced a trap composed of 23 places in 92 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/100 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 281/381 variables, 100/114 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/381 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 1/382 variables, 1/115 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/382 variables, 4/119 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/382 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-02 19:19:56] [INFO ] Deduced a trap composed of 19 places in 111 ms of which 2 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/382 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/382 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 0/382 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 382/382 variables, and 120 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2498 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 101/101 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 4/4 constraints]
After SMT, in 3153ms problems are : Problem set: 0 solved, 4 unsolved
FORMULA MedleyA-PT-10-ReachabilityFireability-2024-10 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 412 ms.
Support contains 47 out of 101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 281/281 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 101 transition count 278
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 98 transition count 278
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 11 place count 93 transition count 271
Iterating global reduction 0 with 5 rules applied. Total rules applied 16 place count 93 transition count 271
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 17 place count 93 transition count 270
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 18 place count 92 transition count 270
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 23 place count 92 transition count 270
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 91 transition count 268
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 91 transition count 268
Applied a total of 25 rules in 38 ms. Remains 91 /101 variables (removed 10) and now considering 268/281 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 91/101 places, 268/281 transitions.
RANDOM walk for 40000 steps (2337 resets) in 253 ms. (157 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (514 resets) in 289 ms. (137 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (330 resets) in 268 ms. (148 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (492 resets) in 85 ms. (465 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 754404 steps, run timeout after 3001 ms. (steps per millisecond=251 ) properties seen :0 out of 3
Probabilistic random walk after 754404 steps, saw 146374 distinct states, run finished after 3001 ms. (steps per millisecond=251 ) properties seen :0
// Phase 1: matrix 268 rows 91 cols
[2024-06-02 19:20:01] [INFO ] Computed 11 invariants in 3 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 24/71 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 19/90 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 268/358 variables, 90/101 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/358 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 1/359 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/359 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/359 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 359/359 variables, and 102 constraints, problems are : Problem set: 0 solved, 3 unsolved in 382 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 91/91 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 24/71 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 19/90 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 268/358 variables, 90/101 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/358 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 1/359 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/359 variables, 3/105 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/359 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/359 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 359/359 variables, and 105 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1087 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 91/91 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 1555ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 2067 ms.
Support contains 47 out of 91 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 91/91 places, 268/268 transitions.
Applied a total of 0 rules in 9 ms. Remains 91 /91 variables (removed 0) and now considering 268/268 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 91/91 places, 268/268 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 91/91 places, 268/268 transitions.
Applied a total of 0 rules in 6 ms. Remains 91 /91 variables (removed 0) and now considering 268/268 (removed 0) transitions.
[2024-06-02 19:20:04] [INFO ] Invariant cache hit.
[2024-06-02 19:20:04] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-06-02 19:20:04] [INFO ] Invariant cache hit.
[2024-06-02 19:20:05] [INFO ] Implicit Places using invariants and state equation in 215 ms returned []
Implicit Place search using SMT with State Equation took 281 ms to find 0 implicit places.
[2024-06-02 19:20:05] [INFO ] Redundant transitions in 25 ms returned []
Running 267 sub problems to find dead transitions.
[2024-06-02 19:20:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 267 unsolved
Problem TDEAD63 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD205 is UNSAT
At refinement iteration 2 (OVERLAPS) 1/91 variables, 6/11 constraints. Problems are: Problem set: 64 solved, 203 unsolved
[2024-06-02 19:20:08] [INFO ] Deduced a trap composed of 25 places in 110 ms of which 2 ms to minimize.
[2024-06-02 19:20:09] [INFO ] Deduced a trap composed of 31 places in 92 ms of which 1 ms to minimize.
[2024-06-02 19:20:09] [INFO ] Deduced a trap composed of 29 places in 95 ms of which 3 ms to minimize.
[2024-06-02 19:20:09] [INFO ] Deduced a trap composed of 17 places in 94 ms of which 10 ms to minimize.
[2024-06-02 19:20:09] [INFO ] Deduced a trap composed of 11 places in 109 ms of which 1 ms to minimize.
[2024-06-02 19:20:09] [INFO ] Deduced a trap composed of 31 places in 164 ms of which 2 ms to minimize.
[2024-06-02 19:20:10] [INFO ] Deduced a trap composed of 36 places in 108 ms of which 2 ms to minimize.
[2024-06-02 19:20:10] [INFO ] Deduced a trap composed of 37 places in 115 ms of which 2 ms to minimize.
[2024-06-02 19:20:10] [INFO ] Deduced a trap composed of 21 places in 120 ms of which 3 ms to minimize.
[2024-06-02 19:20:10] [INFO ] Deduced a trap composed of 18 places in 140 ms of which 3 ms to minimize.
[2024-06-02 19:20:11] [INFO ] Deduced a trap composed of 29 places in 152 ms of which 2 ms to minimize.
[2024-06-02 19:20:11] [INFO ] Deduced a trap composed of 23 places in 92 ms of which 1 ms to minimize.
[2024-06-02 19:20:11] [INFO ] Deduced a trap composed of 14 places in 106 ms of which 2 ms to minimize.
[2024-06-02 19:20:11] [INFO ] Deduced a trap composed of 18 places in 81 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 14/25 constraints. Problems are: Problem set: 64 solved, 203 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/25 constraints. Problems are: Problem set: 64 solved, 203 unsolved
At refinement iteration 5 (OVERLAPS) 268/359 variables, 91/116 constraints. Problems are: Problem set: 64 solved, 203 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/359 variables, 0/116 constraints. Problems are: Problem set: 64 solved, 203 unsolved
[2024-06-02 19:20:16] [INFO ] Deduced a trap composed of 18 places in 99 ms of which 1 ms to minimize.
[2024-06-02 19:20:17] [INFO ] Deduced a trap composed of 9 places in 108 ms of which 1 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/359 variables, 2/118 constraints. Problems are: Problem set: 64 solved, 203 unsolved
[2024-06-02 19:20:19] [INFO ] Deduced a trap composed of 44 places in 112 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/359 variables, 1/119 constraints. Problems are: Problem set: 64 solved, 203 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/359 variables, 0/119 constraints. Problems are: Problem set: 64 solved, 203 unsolved
[2024-06-02 19:20:24] [INFO ] Deduced a trap composed of 28 places in 120 ms of which 2 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/359 variables, 1/120 constraints. Problems are: Problem set: 64 solved, 203 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/359 variables, 0/120 constraints. Problems are: Problem set: 64 solved, 203 unsolved
At refinement iteration 12 (OVERLAPS) 0/359 variables, 0/120 constraints. Problems are: Problem set: 64 solved, 203 unsolved
No progress, stopping.
After SMT solving in domain Real declared 359/359 variables, and 120 constraints, problems are : Problem set: 64 solved, 203 unsolved in 24568 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 91/91 constraints, PredecessorRefiner: 267/267 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 64 solved, 203 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 5/5 constraints. Problems are: Problem set: 64 solved, 203 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/5 constraints. Problems are: Problem set: 64 solved, 203 unsolved
At refinement iteration 2 (OVERLAPS) 1/91 variables, 6/11 constraints. Problems are: Problem set: 64 solved, 203 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 18/29 constraints. Problems are: Problem set: 64 solved, 203 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/29 constraints. Problems are: Problem set: 64 solved, 203 unsolved
At refinement iteration 5 (OVERLAPS) 268/359 variables, 91/120 constraints. Problems are: Problem set: 64 solved, 203 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/359 variables, 203/323 constraints. Problems are: Problem set: 64 solved, 203 unsolved
[2024-06-02 19:20:36] [INFO ] Deduced a trap composed of 26 places in 135 ms of which 2 ms to minimize.
[2024-06-02 19:20:36] [INFO ] Deduced a trap composed of 17 places in 87 ms of which 2 ms to minimize.
[2024-06-02 19:20:37] [INFO ] Deduced a trap composed of 30 places in 106 ms of which 2 ms to minimize.
[2024-06-02 19:20:37] [INFO ] Deduced a trap composed of 24 places in 173 ms of which 2 ms to minimize.
[2024-06-02 19:20:37] [INFO ] Deduced a trap composed of 27 places in 159 ms of which 2 ms to minimize.
[2024-06-02 19:20:37] [INFO ] Deduced a trap composed of 20 places in 111 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/359 variables, 6/329 constraints. Problems are: Problem set: 64 solved, 203 unsolved
[2024-06-02 19:20:42] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 1 ms to minimize.
[2024-06-02 19:20:42] [INFO ] Deduced a trap composed of 25 places in 71 ms of which 1 ms to minimize.
[2024-06-02 19:20:43] [INFO ] Deduced a trap composed of 26 places in 109 ms of which 2 ms to minimize.
[2024-06-02 19:20:43] [INFO ] Deduced a trap composed of 20 places in 112 ms of which 2 ms to minimize.
[2024-06-02 19:20:43] [INFO ] Deduced a trap composed of 18 places in 106 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/359 variables, 5/334 constraints. Problems are: Problem set: 64 solved, 203 unsolved
[2024-06-02 19:20:48] [INFO ] Deduced a trap composed of 36 places in 138 ms of which 2 ms to minimize.
[2024-06-02 19:20:48] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/359 variables, 2/336 constraints. Problems are: Problem set: 64 solved, 203 unsolved
[2024-06-02 19:20:54] [INFO ] Deduced a trap composed of 26 places in 148 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/359 variables, 1/337 constraints. Problems are: Problem set: 64 solved, 203 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 359/359 variables, and 337 constraints, problems are : Problem set: 64 solved, 203 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 91/91 constraints, PredecessorRefiner: 203/267 constraints, Known Traps: 32/32 constraints]
After SMT, in 55494ms problems are : Problem set: 64 solved, 203 unsolved
Search for dead transitions found 64 dead transitions in 55504ms
Found 64 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 64 transitions
Dead transitions reduction (with SMT) removed 64 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 91/91 places, 204/268 transitions.
Applied a total of 0 rules in 10 ms. Remains 91 /91 variables (removed 0) and now considering 204/204 (removed 0) transitions.
[2024-06-02 19:21:00] [INFO ] Redundant transitions in 3 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 55860 ms. Remains : 91/91 places, 204/268 transitions.
RANDOM walk for 40000 steps (2341 resets) in 180 ms. (220 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (514 resets) in 214 ms. (186 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (323 resets) in 266 ms. (149 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (486 resets) in 66 ms. (597 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 901572 steps, run timeout after 3001 ms. (steps per millisecond=300 ) properties seen :0 out of 3
Probabilistic random walk after 901572 steps, saw 176357 distinct states, run finished after 3001 ms. (steps per millisecond=300 ) properties seen :0
// Phase 1: matrix 204 rows 91 cols
[2024-06-02 19:21:04] [INFO ] Computed 11 invariants in 1 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 24/71 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 19/90 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 204/294 variables, 90/101 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/294 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 1/295 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/295 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/295 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 295/295 variables, and 102 constraints, problems are : Problem set: 0 solved, 3 unsolved in 227 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 91/91 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 24/71 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 19/90 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 204/294 variables, 90/101 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/294 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 1/295 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/295 variables, 3/105 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/295 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/295 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 295/295 variables, and 105 constraints, problems are : Problem set: 0 solved, 3 unsolved in 848 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 91/91 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 1111ms problems are : Problem set: 0 solved, 3 unsolved
FORMULA MedleyA-PT-10-ReachabilityFireability-2024-14 TRUE TECHNIQUES PARIKH_WALK
FORMULA MedleyA-PT-10-ReachabilityFireability-2024-02 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 2 properties in 239 ms.
Support contains 31 out of 91 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 91/91 places, 204/204 transitions.
Graph (complete) has 414 edges and 91 vertex of which 89 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 7 place count 83 transition count 192
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 83 transition count 192
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 14 place count 83 transition count 191
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 82 transition count 190
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 82 transition count 190
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 22 place count 79 transition count 187
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 78 transition count 186
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 78 transition count 186
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 26 place count 77 transition count 199
Free-agglomeration rule applied 3 times.
Iterating global reduction 1 with 3 rules applied. Total rules applied 29 place count 77 transition count 196
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 32 place count 74 transition count 196
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 33 place count 73 transition count 190
Iterating global reduction 2 with 1 rules applied. Total rules applied 34 place count 73 transition count 190
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 35 place count 72 transition count 189
Applied a total of 35 rules in 50 ms. Remains 72 /91 variables (removed 19) and now considering 189/204 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 72/91 places, 189/204 transitions.
RANDOM walk for 40000 steps (2862 resets) in 222 ms. (179 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (298 resets) in 277 ms. (143 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1365146 steps, run visited all 1 properties in 2473 ms. (steps per millisecond=552 )
Probabilistic random walk after 1365146 steps, saw 272952 distinct states, run finished after 2478 ms. (steps per millisecond=550 ) properties seen :1
FORMULA MedleyA-PT-10-ReachabilityFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.
Total runtime 113636 ms.
ITS solved all properties within timeout

BK_STOP 1717356068165

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

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

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