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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 580K
-rw-r--r-- 1 mcc users 5.6K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K 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 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 15K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 169K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K 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 89K 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-16-ReachabilityCardinality-2024-00
FORMULA_NAME MedleyA-PT-16-ReachabilityCardinality-2024-01
FORMULA_NAME MedleyA-PT-16-ReachabilityCardinality-2024-02
FORMULA_NAME MedleyA-PT-16-ReachabilityCardinality-2024-03
FORMULA_NAME MedleyA-PT-16-ReachabilityCardinality-2024-04
FORMULA_NAME MedleyA-PT-16-ReachabilityCardinality-2024-05
FORMULA_NAME MedleyA-PT-16-ReachabilityCardinality-2024-06
FORMULA_NAME MedleyA-PT-16-ReachabilityCardinality-2024-07
FORMULA_NAME MedleyA-PT-16-ReachabilityCardinality-2024-08
FORMULA_NAME MedleyA-PT-16-ReachabilityCardinality-2024-09
FORMULA_NAME MedleyA-PT-16-ReachabilityCardinality-2024-10
FORMULA_NAME MedleyA-PT-16-ReachabilityCardinality-2024-11
FORMULA_NAME MedleyA-PT-16-ReachabilityCardinality-2024-12
FORMULA_NAME MedleyA-PT-16-ReachabilityCardinality-2024-13
FORMULA_NAME MedleyA-PT-16-ReachabilityCardinality-2024-14
FORMULA_NAME MedleyA-PT-16-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717358984282

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-16
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 20:09:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-02 20:09:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 20:09:47] [INFO ] Load time of PNML (sax parser for PT used): 188 ms
[2024-06-02 20:09:47] [INFO ] Transformed 196 places.
[2024-06-02 20:09:47] [INFO ] Transformed 392 transitions.
[2024-06-02 20:09:47] [INFO ] Found NUPN structural information;
[2024-06-02 20:09:47] [INFO ] Parsed PT model containing 196 places and 392 transitions and 1186 arcs in 412 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 56 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 2 transitions
Reduce redundant transitions removed 2 transitions.
FORMULA MedleyA-PT-16-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-16-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8 resets) in 3172 ms. (12 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40000 steps (8 resets) in 644 ms. (62 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (8 resets) in 547 ms. (72 steps per ms) remains 13/14 properties
FORMULA MedleyA-PT-16-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40002 steps (8 resets) in 261 ms. (152 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (8 resets) in 192 ms. (207 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (8 resets) in 663 ms. (60 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 222 ms. (179 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (8 resets) in 196 ms. (203 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (8 resets) in 246 ms. (161 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (8 resets) in 170 ms. (233 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 336 ms. (118 steps per ms) remains 12/13 properties
FORMULA MedleyA-PT-16-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 396 ms. (100 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (8 resets) in 203 ms. (196 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 176 ms. (226 steps per ms) remains 12/12 properties
// Phase 1: matrix 390 rows 196 cols
[2024-06-02 20:09:49] [INFO ] Computed 7 invariants in 21 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 125/125 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Problem MedleyA-PT-16-ReachabilityCardinality-2024-01 is UNSAT
FORMULA MedleyA-PT-16-ReachabilityCardinality-2024-01 FALSE TECHNIQUES SMT_REFINEMENT
Problem MedleyA-PT-16-ReachabilityCardinality-2024-06 is UNSAT
FORMULA MedleyA-PT-16-ReachabilityCardinality-2024-06 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 71/196 variables, 7/132 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 71/203 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 0/203 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 390/586 variables, 196/399 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/586 variables, 0/399 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 0/586 variables, 0/399 constraints. Problems are: Problem set: 2 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 586/586 variables, and 399 constraints, problems are : Problem set: 2 solved, 10 unsolved in 1360 ms.
Refiners :[Domain max(s): 196/196 constraints, Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 196/196 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 106/106 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 0/106 constraints. Problems are: Problem set: 2 solved, 10 unsolved
Problem MedleyA-PT-16-ReachabilityCardinality-2024-14 is UNSAT
FORMULA MedleyA-PT-16-ReachabilityCardinality-2024-14 TRUE TECHNIQUES SMT_REFINEMENT
Problem MedleyA-PT-16-ReachabilityCardinality-2024-15 is UNSAT
FORMULA MedleyA-PT-16-ReachabilityCardinality-2024-15 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 90/196 variables, 7/113 constraints. Problems are: Problem set: 4 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 90/203 constraints. Problems are: Problem set: 4 solved, 8 unsolved
[2024-06-02 20:09:51] [INFO ] Deduced a trap composed of 24 places in 203 ms of which 33 ms to minimize.
[2024-06-02 20:09:52] [INFO ] Deduced a trap composed of 38 places in 190 ms of which 4 ms to minimize.
[2024-06-02 20:09:52] [INFO ] Deduced a trap composed of 43 places in 178 ms of which 3 ms to minimize.
[2024-06-02 20:09:52] [INFO ] Deduced a trap composed of 25 places in 118 ms of which 2 ms to minimize.
[2024-06-02 20:09:52] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 5/208 constraints. Problems are: Problem set: 4 solved, 8 unsolved
[2024-06-02 20:09:52] [INFO ] Deduced a trap composed of 34 places in 142 ms of which 2 ms to minimize.
[2024-06-02 20:09:52] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 2/210 constraints. Problems are: Problem set: 4 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 0/210 constraints. Problems are: Problem set: 4 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 390/586 variables, 196/406 constraints. Problems are: Problem set: 4 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/586 variables, 8/414 constraints. Problems are: Problem set: 4 solved, 8 unsolved
[2024-06-02 20:09:53] [INFO ] Deduced a trap composed of 102 places in 178 ms of which 13 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/586 variables, 1/415 constraints. Problems are: Problem set: 4 solved, 8 unsolved
[2024-06-02 20:09:55] [INFO ] Deduced a trap composed of 47 places in 117 ms of which 2 ms to minimize.
[2024-06-02 20:09:55] [INFO ] Deduced a trap composed of 30 places in 71 ms of which 2 ms to minimize.
[2024-06-02 20:09:55] [INFO ] Deduced a trap composed of 38 places in 175 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/586 variables, 3/418 constraints. Problems are: Problem set: 4 solved, 8 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 586/586 variables, and 418 constraints, problems are : Problem set: 4 solved, 8 unsolved in 5011 ms.
Refiners :[Domain max(s): 196/196 constraints, Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 196/196 constraints, PredecessorRefiner: 8/12 constraints, Known Traps: 11/11 constraints]
After SMT, in 6576ms problems are : Problem set: 4 solved, 8 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 77 out of 196 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 196/196 places, 390/390 transitions.
Graph (trivial) has 91 edges and 196 vertex of which 5 / 196 are part of one of the 1 SCC in 6 ms
Free SCC test removed 4 places
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 192 transition count 376
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 1 with 11 rules applied. Total rules applied 21 place count 183 transition count 374
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 24 place count 182 transition count 372
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 26 place count 180 transition count 372
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 26 place count 180 transition count 370
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 30 place count 178 transition count 370
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 43 place count 165 transition count 348
Iterating global reduction 4 with 13 rules applied. Total rules applied 56 place count 165 transition count 348
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 56 place count 165 transition count 346
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 60 place count 163 transition count 346
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 74 place count 156 transition count 339
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 75 place count 156 transition count 338
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -49
Deduced a syphon composed of 10 places in 2 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 5 with 20 rules applied. Total rules applied 95 place count 146 transition count 387
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 97 place count 146 transition count 385
Drop transitions (Redundant composition of simpler transitions.) removed 39 transitions
Redundant transition composition rules discarded 39 transitions
Iterating global reduction 6 with 39 rules applied. Total rules applied 136 place count 146 transition count 346
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 138 place count 145 transition count 357
Free-agglomeration rule applied 9 times.
Iterating global reduction 6 with 9 rules applied. Total rules applied 147 place count 145 transition count 348
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 6 with 9 rules applied. Total rules applied 156 place count 136 transition count 348
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 157 place count 136 transition count 348
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 158 place count 135 transition count 347
Applied a total of 158 rules in 267 ms. Remains 135 /196 variables (removed 61) and now considering 347/390 (removed 43) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 288 ms. Remains : 135/196 places, 347/390 transitions.
RANDOM walk for 40000 steps (8 resets) in 650 ms. (61 steps per ms) remains 7/8 properties
FORMULA MedleyA-PT-16-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40000 steps (8 resets) in 644 ms. (62 steps per ms) remains 5/7 properties
FORMULA MedleyA-PT-16-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-16-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40001 steps (8 resets) in 307 ms. (129 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40000 steps (8 resets) in 231 ms. (172 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40000 steps (8 resets) in 533 ms. (74 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40000 steps (8 resets) in 207 ms. (192 steps per ms) remains 5/5 properties
[2024-06-02 20:09:57] [INFO ] Flow matrix only has 339 transitions (discarded 8 similar events)
// Phase 1: matrix 339 rows 135 cols
[2024-06-02 20:09:57] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 20:09:57] [INFO ] State equation strengthened by 56 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 73/132 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 3/135 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-02 20:09:57] [INFO ] Deduced a trap composed of 20 places in 164 ms of which 2 ms to minimize.
[2024-06-02 20:09:58] [INFO ] Deduced a trap composed of 8 places in 72 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/135 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 339/474 variables, 135/144 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/474 variables, 56/200 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/474 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 0/474 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 474/474 variables, and 200 constraints, problems are : Problem set: 0 solved, 5 unsolved in 841 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 135/135 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 73/132 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-02 20:09:58] [INFO ] Deduced a trap composed of 14 places in 170 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-02 20:09:58] [INFO ] Deduced a trap composed of 23 places in 131 ms of which 3 ms to minimize.
[2024-06-02 20:09:59] [INFO ] Deduced a trap composed of 24 places in 156 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 3/135 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/135 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 339/474 variables, 135/147 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/474 variables, 56/203 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/474 variables, 5/208 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/474 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 0/474 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 474/474 variables, and 208 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1792 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 135/135 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 5/5 constraints]
After SMT, in 2684ms problems are : Problem set: 0 solved, 5 unsolved
FORMULA MedleyA-PT-16-ReachabilityCardinality-2024-08 TRUE TECHNIQUES PARIKH_WALK
FORMULA MedleyA-PT-16-ReachabilityCardinality-2024-13 TRUE TECHNIQUES PARIKH_WALK
FORMULA MedleyA-PT-16-ReachabilityCardinality-2024-02 FALSE TECHNIQUES PARIKH_WALK
FORMULA MedleyA-PT-16-ReachabilityCardinality-2024-12 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 4 properties in 587 ms.
Support contains 2 out of 135 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 135/135 places, 347/347 transitions.
Graph (trivial) has 140 edges and 135 vertex of which 7 / 135 are part of one of the 2 SCC in 1 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 130 transition count 322
Reduce places removed 18 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 20 rules applied. Total rules applied 39 place count 112 transition count 320
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 41 place count 110 transition count 320
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 41 place count 110 transition count 316
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 49 place count 106 transition count 316
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 65 place count 90 transition count 287
Iterating global reduction 3 with 16 rules applied. Total rules applied 81 place count 90 transition count 287
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 3 with 5 rules applied. Total rules applied 86 place count 90 transition count 282
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 87 place count 89 transition count 282
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 87 place count 89 transition count 280
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 91 place count 87 transition count 280
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 93 place count 85 transition count 273
Iterating global reduction 5 with 2 rules applied. Total rules applied 95 place count 85 transition count 273
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 5 with 30 rules applied. Total rules applied 125 place count 70 transition count 258
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 127 place count 70 transition count 256
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 128 place count 69 transition count 254
Iterating global reduction 6 with 1 rules applied. Total rules applied 129 place count 69 transition count 254
Performed 15 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 6 with 30 rules applied. Total rules applied 159 place count 54 transition count 355
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 6 with 20 rules applied. Total rules applied 179 place count 54 transition count 335
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 180 place count 53 transition count 325
Iterating global reduction 7 with 1 rules applied. Total rules applied 181 place count 53 transition count 325
Drop transitions (Redundant composition of simpler transitions.) removed 35 transitions
Redundant transition composition rules discarded 35 transitions
Iterating global reduction 7 with 35 rules applied. Total rules applied 216 place count 53 transition count 290
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 216 place count 53 transition count 289
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 218 place count 52 transition count 289
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 222 place count 52 transition count 285
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 8 with 2 rules applied. Total rules applied 224 place count 51 transition count 298
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 228 place count 51 transition count 294
Free-agglomeration rule applied 8 times.
Iterating global reduction 8 with 8 rules applied. Total rules applied 236 place count 51 transition count 286
Reduce places removed 8 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 14 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 8 with 24 rules applied. Total rules applied 260 place count 43 transition count 270
Drop transitions (Redundant composition of simpler transitions.) removed 28 transitions
Redundant transition composition rules discarded 28 transitions
Iterating global reduction 9 with 28 rules applied. Total rules applied 288 place count 43 transition count 242
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 289 place count 42 transition count 241
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 29 edges and 40 vertex of which 6 / 40 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 9 with 3 rules applied. Total rules applied 292 place count 37 transition count 241
Drop transitions (Empty/Sink Transition effects.) removed 27 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 10 with 32 rules applied. Total rules applied 324 place count 37 transition count 209
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 325 place count 36 transition count 206
Iterating global reduction 11 with 1 rules applied. Total rules applied 326 place count 36 transition count 206
Drop transitions (Redundant composition of simpler transitions.) removed 49 transitions
Redundant transition composition rules discarded 49 transitions
Iterating global reduction 11 with 49 rules applied. Total rules applied 375 place count 36 transition count 157
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 11 with 1 rules applied. Total rules applied 376 place count 36 transition count 156
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 12 with 2 rules applied. Total rules applied 378 place count 35 transition count 155
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 379 place count 34 transition count 155
Discarding 1 places :
Symmetric choice reduction at 14 with 1 rule applications. Total rules 380 place count 33 transition count 153
Iterating global reduction 14 with 1 rules applied. Total rules applied 381 place count 33 transition count 153
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 383 place count 32 transition count 152
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 385 place count 31 transition count 158
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 14 with 9 rules applied. Total rules applied 394 place count 31 transition count 149
Free-agglomeration rule applied 1 times.
Iterating global reduction 14 with 1 rules applied. Total rules applied 395 place count 31 transition count 148
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 396 place count 30 transition count 148
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 15 with 3 rules applied. Total rules applied 399 place count 30 transition count 145
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 15 with 2 rules applied. Total rules applied 401 place count 30 transition count 145
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 15 with 1 rules applied. Total rules applied 402 place count 30 transition count 144
Applied a total of 402 rules in 204 ms. Remains 30 /135 variables (removed 105) and now considering 144/347 (removed 203) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 204 ms. Remains : 30/135 places, 144/347 transitions.
RANDOM walk for 710 steps (81 resets) in 20 ms. (33 steps per ms) remains 0/1 properties
FORMULA MedleyA-PT-16-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 14334 ms.
ITS solved all properties within timeout

BK_STOP 1717359001191

--------------------
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 ReachabilityCardinality -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-16"
export BK_EXAMINATION="ReachabilityCardinality"
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-16, examination is ReachabilityCardinality"
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-171734921300126"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/MedleyA-PT-16.tgz
mv MedleyA-PT-16 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;