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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 476K
-rw-r--r-- 1 mcc users 4.8K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 46K 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 39K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K 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 16K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 8.0K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 82K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K 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 130K 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-20-ReachabilityFireability-2024-00
FORMULA_NAME MedleyA-PT-20-ReachabilityFireability-2024-01
FORMULA_NAME MedleyA-PT-20-ReachabilityFireability-2024-02
FORMULA_NAME MedleyA-PT-20-ReachabilityFireability-2024-03
FORMULA_NAME MedleyA-PT-20-ReachabilityFireability-2024-04
FORMULA_NAME MedleyA-PT-20-ReachabilityFireability-2024-05
FORMULA_NAME MedleyA-PT-20-ReachabilityFireability-2024-06
FORMULA_NAME MedleyA-PT-20-ReachabilityFireability-2024-07
FORMULA_NAME MedleyA-PT-20-ReachabilityFireability-2024-08
FORMULA_NAME MedleyA-PT-20-ReachabilityFireability-2024-09
FORMULA_NAME MedleyA-PT-20-ReachabilityFireability-2024-10
FORMULA_NAME MedleyA-PT-20-ReachabilityFireability-2024-11
FORMULA_NAME MedleyA-PT-20-ReachabilityFireability-2024-12
FORMULA_NAME MedleyA-PT-20-ReachabilityFireability-2024-13
FORMULA_NAME MedleyA-PT-20-ReachabilityFireability-2024-14
FORMULA_NAME MedleyA-PT-20-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717363814380

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-20
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 21:30:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-02 21:30:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 21:30:17] [INFO ] Load time of PNML (sax parser for PT used): 147 ms
[2024-06-02 21:30:17] [INFO ] Transformed 273 places.
[2024-06-02 21:30:17] [INFO ] Transformed 518 transitions.
[2024-06-02 21:30:17] [INFO ] Found NUPN structural information;
[2024-06-02 21:30:17] [INFO ] Parsed PT model containing 273 places and 518 transitions and 1795 arcs in 307 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 28 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (26 resets) in 3576 ms. (11 steps per ms) remains 12/16 properties
FORMULA MedleyA-PT-20-ReachabilityFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-20-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-20-ReachabilityFireability-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-20-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (45 resets) in 781 ms. (51 steps per ms) remains 9/12 properties
FORMULA MedleyA-PT-20-ReachabilityFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-20-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-20-ReachabilityFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40001 steps (47 resets) in 740 ms. (53 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (33 resets) in 369 ms. (108 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (28 resets) in 205 ms. (194 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (46 resets) in 157 ms. (253 steps per ms) remains 7/9 properties
FORMULA MedleyA-PT-20-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-20-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (19 resets) in 213 ms. (186 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (32 resets) in 217 ms. (183 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (20 resets) in 231 ms. (172 steps per ms) remains 7/7 properties
// Phase 1: matrix 518 rows 273 cols
[2024-06-02 21:30:19] [INFO ] Computed 11 invariants in 25 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 101/101 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem MedleyA-PT-20-ReachabilityFireability-2024-00 is UNSAT
FORMULA MedleyA-PT-20-ReachabilityFireability-2024-00 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 123/224 variables, 9/110 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/224 variables, 123/233 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/224 variables, 0/233 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 49/273 variables, 2/235 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/273 variables, 49/284 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/273 variables, 0/284 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 518/791 variables, 273/557 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/791 variables, 0/557 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 0/791 variables, 0/557 constraints. Problems are: Problem set: 1 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 791/791 variables, and 557 constraints, problems are : Problem set: 1 solved, 6 unsolved in 1491 ms.
Refiners :[Domain max(s): 273/273 constraints, Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 273/273 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 90/90 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/90 constraints. Problems are: Problem set: 1 solved, 6 unsolved
Problem MedleyA-PT-20-ReachabilityFireability-2024-01 is UNSAT
FORMULA MedleyA-PT-20-ReachabilityFireability-2024-01 TRUE TECHNIQUES SMT_REFINEMENT
Problem MedleyA-PT-20-ReachabilityFireability-2024-14 is UNSAT
FORMULA MedleyA-PT-20-ReachabilityFireability-2024-14 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 131/221 variables, 9/99 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/221 variables, 131/230 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/221 variables, 0/230 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 52/273 variables, 2/232 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/273 variables, 52/284 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/273 variables, 0/284 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 518/791 variables, 273/557 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/791 variables, 4/561 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/791 variables, 0/561 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 0/791 variables, 0/561 constraints. Problems are: Problem set: 3 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 791/791 variables, and 561 constraints, problems are : Problem set: 3 solved, 4 unsolved in 1937 ms.
Refiners :[Domain max(s): 273/273 constraints, Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 273/273 constraints, PredecessorRefiner: 4/7 constraints, Known Traps: 0/0 constraints]
After SMT, in 3759ms problems are : Problem set: 3 solved, 4 unsolved
FORMULA MedleyA-PT-20-ReachabilityFireability-2024-03 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 1944 ms.
Support contains 63 out of 273 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 273/273 places, 518/518 transitions.
Graph (trivial) has 93 edges and 273 vertex of which 8 / 273 are part of one of the 1 SCC in 3 ms
Free SCC test removed 7 places
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 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 266 transition count 503
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 261 transition count 502
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 12 place count 261 transition count 500
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 16 place count 259 transition count 500
Discarding 83 places :
Symmetric choice reduction at 2 with 83 rule applications. Total rules 99 place count 176 transition count 417
Iterating global reduction 2 with 83 rules applied. Total rules applied 182 place count 176 transition count 417
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 185 place count 176 transition count 414
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 185 place count 176 transition count 411
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 191 place count 173 transition count 411
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 213 place count 151 transition count 345
Iterating global reduction 3 with 22 rules applied. Total rules applied 235 place count 151 transition count 345
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 239 place count 151 transition count 341
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 240 place count 150 transition count 339
Iterating global reduction 4 with 1 rules applied. Total rules applied 241 place count 150 transition count 339
Performed 13 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 267 place count 137 transition count 325
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 273 place count 134 transition count 331
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 274 place count 134 transition count 330
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 278 place count 134 transition count 326
Free-agglomeration rule applied 7 times.
Iterating global reduction 5 with 7 rules applied. Total rules applied 285 place count 134 transition count 319
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 292 place count 127 transition count 319
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 293 place count 127 transition count 320
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 294 place count 126 transition count 320
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 7 with 4 rules applied. Total rules applied 298 place count 126 transition count 320
Partial Post-agglomeration rule applied 3 times.
Drop transitions (Partial Post agglomeration) removed 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 301 place count 126 transition count 320
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 302 place count 126 transition count 319
Applied a total of 302 rules in 203 ms. Remains 126 /273 variables (removed 147) and now considering 319/518 (removed 199) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 219 ms. Remains : 126/273 places, 319/518 transitions.
RANDOM walk for 40000 steps (16 resets) in 407 ms. (98 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (14 resets) in 300 ms. (132 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (31 resets) in 160 ms. (248 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (10 resets) in 283 ms. (140 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 365495 steps, run timeout after 3001 ms. (steps per millisecond=121 ) properties seen :0 out of 3
Probabilistic random walk after 365495 steps, saw 153903 distinct states, run finished after 3014 ms. (steps per millisecond=121 ) properties seen :0
[2024-06-02 21:30:28] [INFO ] Flow matrix only has 317 transitions (discarded 2 similar events)
// Phase 1: matrix 317 rows 126 cols
[2024-06-02 21:30:29] [INFO ] Computed 11 invariants in 3 ms
[2024-06-02 21:30:29] [INFO ] State equation strengthened by 8 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 45/108 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 18/126 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 317/443 variables, 126/137 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/443 variables, 8/145 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/443 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/443 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 443/443 variables, and 145 constraints, problems are : Problem set: 0 solved, 3 unsolved in 350 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 126/126 constraints, ReadFeed: 8/8 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/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 45/108 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 18/126 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 317/443 variables, 126/137 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/443 variables, 8/145 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/443 variables, 3/148 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/443 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/443 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 443/443 variables, and 148 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1021 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 126/126 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 1476ms problems are : Problem set: 0 solved, 3 unsolved
FORMULA MedleyA-PT-20-ReachabilityFireability-2024-10 FALSE TECHNIQUES PARIKH_WALK
FORMULA MedleyA-PT-20-ReachabilityFireability-2024-15 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 2 properties in 647 ms.
Support contains 35 out of 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 319/319 transitions.
Graph (trivial) has 37 edges and 126 vertex of which 4 / 126 are part of one of the 1 SCC in 1 ms
Free SCC test removed 3 places
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 123 transition count 313
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 122 transition count 313
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 122 transition count 312
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 121 transition count 312
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 11 place count 115 transition count 298
Iterating global reduction 2 with 6 rules applied. Total rules applied 17 place count 115 transition count 298
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 18 place count 115 transition count 297
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 30 place count 109 transition count 291
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 31 place count 108 transition count 288
Iterating global reduction 3 with 1 rules applied. Total rules applied 32 place count 108 transition count 288
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 35 place count 108 transition count 285
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 41 place count 105 transition count 290
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 45 place count 105 transition count 286
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 46 place count 104 transition count 283
Iterating global reduction 4 with 1 rules applied. Total rules applied 47 place count 104 transition count 283
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 48 place count 104 transition count 282
Free-agglomeration rule applied 10 times.
Iterating global reduction 5 with 10 rules applied. Total rules applied 58 place count 104 transition count 272
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 16 rules applied. Total rules applied 74 place count 94 transition count 266
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 77 place count 94 transition count 263
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 78 place count 94 transition count 263
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 79 place count 93 transition count 262
Applied a total of 79 rules in 153 ms. Remains 93 /126 variables (removed 33) and now considering 262/319 (removed 57) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 153 ms. Remains : 93/126 places, 262/319 transitions.
RANDOM walk for 40000 steps (21 resets) in 197 ms. (202 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (517 resets) in 157 ms. (253 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 31202 steps, run visited all 1 properties in 72 ms. (steps per millisecond=433 )
Probabilistic random walk after 31202 steps, saw 22364 distinct states, run finished after 79 ms. (steps per millisecond=394 ) properties seen :1
FORMULA MedleyA-PT-20-ReachabilityFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.
Total runtime 14552 ms.
ITS solved all properties within timeout

BK_STOP 1717363831598

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

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