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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 564K
-rw-r--r-- 1 mcc users 6.0K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K 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.2K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 9.4K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 97K 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 100K 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 110K 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-15-ReachabilityFireability-2024-00
FORMULA_NAME MedleyA-PT-15-ReachabilityFireability-2024-01
FORMULA_NAME MedleyA-PT-15-ReachabilityFireability-2024-02
FORMULA_NAME MedleyA-PT-15-ReachabilityFireability-2024-03
FORMULA_NAME MedleyA-PT-15-ReachabilityFireability-2024-04
FORMULA_NAME MedleyA-PT-15-ReachabilityFireability-2024-05
FORMULA_NAME MedleyA-PT-15-ReachabilityFireability-2024-06
FORMULA_NAME MedleyA-PT-15-ReachabilityFireability-2024-07
FORMULA_NAME MedleyA-PT-15-ReachabilityFireability-2024-08
FORMULA_NAME MedleyA-PT-15-ReachabilityFireability-2024-09
FORMULA_NAME MedleyA-PT-15-ReachabilityFireability-2024-10
FORMULA_NAME MedleyA-PT-15-ReachabilityFireability-2024-11
FORMULA_NAME MedleyA-PT-15-ReachabilityFireability-2024-12
FORMULA_NAME MedleyA-PT-15-ReachabilityFireability-2024-13
FORMULA_NAME MedleyA-PT-15-ReachabilityFireability-2024-14
FORMULA_NAME MedleyA-PT-15-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717358079795

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-15
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 19:54:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-02 19:54:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 19:54:42] [INFO ] Load time of PNML (sax parser for PT used): 388 ms
[2024-06-02 19:54:42] [INFO ] Transformed 192 places.
[2024-06-02 19:54:42] [INFO ] Transformed 475 transitions.
[2024-06-02 19:54:42] [INFO ] Found NUPN structural information;
[2024-06-02 19:54:42] [INFO ] Parsed PT model containing 192 places and 475 transitions and 1522 arcs in 563 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 27 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 2 transitions
Reduce redundant transitions removed 2 transitions.
RANDOM walk for 40000 steps (8 resets) in 2369 ms. (16 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (8 resets) in 112 ms. (35 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (8 resets) in 81 ms. (48 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 89 ms. (44 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 68 ms. (58 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (8 resets) in 34 ms. (114 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (8 resets) in 24 ms. (160 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (8 resets) in 39 ms. (100 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (8 resets) in 39 ms. (100 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 57 ms. (69 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (8 resets) in 106 ms. (37 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (8 resets) in 45 ms. (87 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (8 resets) in 31 ms. (125 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (8 resets) in 33 ms. (117 steps per ms) remains 16/16 properties
Interrupted probabilistic random walk after 331959 steps, run timeout after 3001 ms. (steps per millisecond=110 ) properties seen :1 out of 16
Probabilistic random walk after 331959 steps, saw 63568 distinct states, run finished after 3024 ms. (steps per millisecond=109 ) properties seen :1
FORMULA MedleyA-PT-15-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 473 rows 192 cols
[2024-06-02 19:54:46] [INFO ] Computed 7 invariants in 39 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/145 variables, 145/145 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/145 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 15 unsolved
Problem MedleyA-PT-15-ReachabilityFireability-2024-01 is UNSAT
FORMULA MedleyA-PT-15-ReachabilityFireability-2024-01 FALSE TECHNIQUES SMT_REFINEMENT
Problem MedleyA-PT-15-ReachabilityFireability-2024-09 is UNSAT
FORMULA MedleyA-PT-15-ReachabilityFireability-2024-09 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 47/192 variables, 7/152 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/192 variables, 47/199 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 0/199 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 473/665 variables, 192/391 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/665 variables, 0/391 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 0/665 variables, 0/391 constraints. Problems are: Problem set: 2 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 665/665 variables, and 391 constraints, problems are : Problem set: 2 solved, 13 unsolved in 1851 ms.
Refiners :[Domain max(s): 192/192 constraints, Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 192/192 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 130/130 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/130 constraints. Problems are: Problem set: 2 solved, 13 unsolved
Problem MedleyA-PT-15-ReachabilityFireability-2024-07 is UNSAT
FORMULA MedleyA-PT-15-ReachabilityFireability-2024-07 TRUE TECHNIQUES SMT_REFINEMENT
Problem MedleyA-PT-15-ReachabilityFireability-2024-08 is UNSAT
FORMULA MedleyA-PT-15-ReachabilityFireability-2024-08 TRUE TECHNIQUES SMT_REFINEMENT
Problem MedleyA-PT-15-ReachabilityFireability-2024-11 is UNSAT
FORMULA MedleyA-PT-15-ReachabilityFireability-2024-11 TRUE TECHNIQUES SMT_REFINEMENT
Problem MedleyA-PT-15-ReachabilityFireability-2024-14 is UNSAT
FORMULA MedleyA-PT-15-ReachabilityFireability-2024-14 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 62/192 variables, 7/137 constraints. Problems are: Problem set: 6 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/192 variables, 62/199 constraints. Problems are: Problem set: 6 solved, 9 unsolved
[2024-06-02 19:54:49] [INFO ] Deduced a trap composed of 19 places in 274 ms of which 39 ms to minimize.
[2024-06-02 19:54:50] [INFO ] Deduced a trap composed of 34 places in 259 ms of which 4 ms to minimize.
[2024-06-02 19:54:50] [INFO ] Deduced a trap composed of 30 places in 254 ms of which 4 ms to minimize.
[2024-06-02 19:54:50] [INFO ] Deduced a trap composed of 46 places in 214 ms of which 3 ms to minimize.
[2024-06-02 19:54:50] [INFO ] Deduced a trap composed of 99 places in 163 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 5/204 constraints. Problems are: Problem set: 6 solved, 9 unsolved
[2024-06-02 19:54:50] [INFO ] Deduced a trap composed of 41 places in 135 ms of which 3 ms to minimize.
[2024-06-02 19:54:51] [INFO ] Deduced a trap composed of 41 places in 183 ms of which 3 ms to minimize.
[2024-06-02 19:54:51] [INFO ] Deduced a trap composed of 46 places in 127 ms of which 3 ms to minimize.
[2024-06-02 19:54:51] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/192 variables, 4/208 constraints. Problems are: Problem set: 6 solved, 9 unsolved
[2024-06-02 19:54:51] [INFO ] Deduced a trap composed of 48 places in 185 ms of which 3 ms to minimize.
[2024-06-02 19:54:51] [INFO ] Deduced a trap composed of 46 places in 155 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 2/210 constraints. Problems are: Problem set: 6 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 0/210 constraints. Problems are: Problem set: 6 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 473/665 variables, 192/402 constraints. Problems are: Problem set: 6 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/665 variables, 9/411 constraints. Problems are: Problem set: 6 solved, 9 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 665/665 variables, and 411 constraints, problems are : Problem set: 6 solved, 9 unsolved in 5012 ms.
Refiners :[Domain max(s): 192/192 constraints, Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 192/192 constraints, PredecessorRefiner: 9/15 constraints, Known Traps: 11/11 constraints]
After SMT, in 7550ms problems are : Problem set: 6 solved, 9 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 103 out of 192 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 192/192 places, 473/473 transitions.
Graph (trivial) has 41 edges and 192 vertex of which 3 / 192 are part of one of the 1 SCC in 5 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 190 transition count 465
Reduce places removed 5 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 8 rules applied. Total rules applied 14 place count 185 transition count 462
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 17 place count 182 transition count 462
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 17 place count 182 transition count 459
Deduced a syphon composed of 3 places in 8 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 23 place count 179 transition count 459
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 40 place count 162 transition count 434
Iterating global reduction 3 with 17 rules applied. Total rules applied 57 place count 162 transition count 434
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 60 place count 162 transition count 431
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 60 place count 162 transition count 430
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 62 place count 161 transition count 430
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 2 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 80 place count 152 transition count 421
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 84 place count 150 transition count 426
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 91 place count 150 transition count 419
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 93 place count 149 transition count 418
Free-agglomeration rule applied 6 times.
Iterating global reduction 4 with 6 rules applied. Total rules applied 99 place count 149 transition count 412
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 105 place count 143 transition count 412
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 106 place count 143 transition count 411
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 107 place count 143 transition count 411
Applied a total of 107 rules in 259 ms. Remains 143 /192 variables (removed 49) and now considering 411/473 (removed 62) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 282 ms. Remains : 143/192 places, 411/473 transitions.
RANDOM walk for 40000 steps (8 resets) in 641 ms. (62 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40001 steps (8 resets) in 243 ms. (163 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 235 ms. (169 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 253 ms. (157 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40001 steps (8 resets) in 181 ms. (219 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (8 resets) in 178 ms. (223 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 134 ms. (296 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 392 ms. (101 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (8 resets) in 227 ms. (175 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40001 steps (8 resets) in 122 ms. (325 steps per ms) remains 9/9 properties
Interrupted probabilistic random walk after 663071 steps, run timeout after 3001 ms. (steps per millisecond=220 ) properties seen :7 out of 9
Probabilistic random walk after 663071 steps, saw 148192 distinct states, run finished after 3005 ms. (steps per millisecond=220 ) properties seen :7
FORMULA MedleyA-PT-15-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA MedleyA-PT-15-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA MedleyA-PT-15-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA MedleyA-PT-15-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA MedleyA-PT-15-ReachabilityFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA MedleyA-PT-15-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA MedleyA-PT-15-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 411 rows 143 cols
[2024-06-02 19:54:58] [INFO ] Computed 7 invariants in 4 ms
[2024-06-02 19:54:58] [INFO ] State equation strengthened by 5 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 67/143 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 411/554 variables, 143/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/554 variables, 5/155 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/554 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/554 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 554/554 variables, and 155 constraints, problems are : Problem set: 0 solved, 2 unsolved in 345 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 143/143 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 67/143 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-02 19:54:58] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-02 19:54:58] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 1 ms to minimize.
[2024-06-02 19:54:59] [INFO ] Deduced a trap composed of 32 places in 88 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/143 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 411/554 variables, 143/153 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/554 variables, 5/158 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/554 variables, 2/160 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/554 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/554 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 554/554 variables, and 160 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1283 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 143/143 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints]
After SMT, in 1719ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 703 ms.
Support contains 76 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 411/411 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 143 transition count 408
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 140 transition count 408
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 6 place count 140 transition count 405
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 12 place count 137 transition count 405
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 21 place count 128 transition count 386
Iterating global reduction 2 with 9 rules applied. Total rules applied 30 place count 128 transition count 386
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 34 place count 128 transition count 382
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
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 38 place count 126 transition count 380
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 42 place count 124 transition count 383
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 45 place count 124 transition count 380
Free-agglomeration rule applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 49 place count 124 transition count 376
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 53 place count 120 transition count 376
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 54 place count 120 transition count 376
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 55 place count 120 transition count 376
Applied a total of 55 rules in 65 ms. Remains 120 /143 variables (removed 23) and now considering 376/411 (removed 35) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69 ms. Remains : 120/143 places, 376/411 transitions.
RANDOM walk for 40000 steps (8 resets) in 80 ms. (493 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40000 steps (8 resets) in 181 ms. (219 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 193 ms. (206 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 1076462 steps, run visited all 2 properties in 2501 ms. (steps per millisecond=430 )
Probabilistic random walk after 1076462 steps, saw 195734 distinct states, run finished after 2518 ms. (steps per millisecond=427 ) properties seen :2
FORMULA MedleyA-PT-15-ReachabilityFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA MedleyA-PT-15-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.
Total runtime 22028 ms.
ITS solved all properties within timeout

BK_STOP 1717358103565

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

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