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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 6.8K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K 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 6.6K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 62K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 108K 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 90K 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-08-ReachabilityFireability-2024-00
FORMULA_NAME MedleyA-PT-08-ReachabilityFireability-2024-01
FORMULA_NAME MedleyA-PT-08-ReachabilityFireability-2024-02
FORMULA_NAME MedleyA-PT-08-ReachabilityFireability-2024-03
FORMULA_NAME MedleyA-PT-08-ReachabilityFireability-2024-04
FORMULA_NAME MedleyA-PT-08-ReachabilityFireability-2024-05
FORMULA_NAME MedleyA-PT-08-ReachabilityFireability-2024-06
FORMULA_NAME MedleyA-PT-08-ReachabilityFireability-2024-07
FORMULA_NAME MedleyA-PT-08-ReachabilityFireability-2024-08
FORMULA_NAME MedleyA-PT-08-ReachabilityFireability-2024-09
FORMULA_NAME MedleyA-PT-08-ReachabilityFireability-2024-10
FORMULA_NAME MedleyA-PT-08-ReachabilityFireability-2024-11
FORMULA_NAME MedleyA-PT-08-ReachabilityFireability-2024-12
FORMULA_NAME MedleyA-PT-08-ReachabilityFireability-2024-13
FORMULA_NAME MedleyA-PT-08-ReachabilityFireability-2024-14
FORMULA_NAME MedleyA-PT-08-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717354375866

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-08
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 18:52:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-02 18:52:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:52:58] [INFO ] Load time of PNML (sax parser for PT used): 189 ms
[2024-06-02 18:52:58] [INFO ] Transformed 147 places.
[2024-06-02 18:52:58] [INFO ] Transformed 312 transitions.
[2024-06-02 18:52:58] [INFO ] Found NUPN structural information;
[2024-06-02 18:52:59] [INFO ] Parsed PT model containing 147 places and 312 transitions and 1378 arcs in 426 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 43 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (1998 resets) in 2804 ms. (14 steps per ms) remains 15/16 properties
FORMULA MedleyA-PT-08-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 4003 steps (57 resets) in 86 ms. (46 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (56 resets) in 253 ms. (15 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (56 resets) in 44 ms. (88 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (52 resets) in 51 ms. (76 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (54 resets) in 32 ms. (121 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (50 resets) in 94 ms. (42 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (52 resets) in 14 ms. (266 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (52 resets) in 56 ms. (70 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (49 resets) in 11 ms. (333 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (61 resets) in 61 ms. (64 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (47 resets) in 28 ms. (138 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (56 resets) in 27 ms. (142 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (75 resets) in 40 ms. (97 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (55 resets) in 41 ms. (95 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (52 resets) in 65 ms. (60 steps per ms) remains 15/15 properties
Interrupted probabilistic random walk after 426490 steps, run timeout after 3001 ms. (steps per millisecond=142 ) properties seen :3 out of 15
Probabilistic random walk after 426490 steps, saw 84320 distinct states, run finished after 3008 ms. (steps per millisecond=141 ) properties seen :3
FORMULA MedleyA-PT-08-ReachabilityFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA MedleyA-PT-08-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA MedleyA-PT-08-ReachabilityFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 312 rows 147 cols
[2024-06-02 18:53:03] [INFO ] Computed 11 invariants in 33 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 110/110 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/110 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Problem MedleyA-PT-08-ReachabilityFireability-2024-11 is UNSAT
FORMULA MedleyA-PT-08-ReachabilityFireability-2024-11 FALSE TECHNIQUES SMT_REFINEMENT
Problem MedleyA-PT-08-ReachabilityFireability-2024-12 is UNSAT
FORMULA MedleyA-PT-08-ReachabilityFireability-2024-12 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 20/130 variables, 6/116 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 20/136 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 0/136 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 17/147 variables, 5/141 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/147 variables, 17/158 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/147 variables, 0/158 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 312/459 variables, 147/305 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/459 variables, 0/305 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 10 (OVERLAPS) 0/459 variables, 0/305 constraints. Problems are: Problem set: 2 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 459/459 variables, and 305 constraints, problems are : Problem set: 2 solved, 10 unsolved in 1556 ms.
Refiners :[Domain max(s): 147/147 constraints, Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 147/147 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/104 variables, 104/104 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/104 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 25/129 variables, 6/110 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 25/135 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/135 constraints. Problems are: Problem set: 2 solved, 10 unsolved
Problem MedleyA-PT-08-ReachabilityFireability-2024-13 is UNSAT
FORMULA MedleyA-PT-08-ReachabilityFireability-2024-13 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 5 (OVERLAPS) 18/147 variables, 5/140 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/147 variables, 18/158 constraints. Problems are: Problem set: 3 solved, 9 unsolved
[2024-06-02 18:53:06] [INFO ] Deduced a trap composed of 58 places in 160 ms of which 28 ms to minimize.
[2024-06-02 18:53:06] [INFO ] Deduced a trap composed of 29 places in 259 ms of which 2 ms to minimize.
Problem MedleyA-PT-08-ReachabilityFireability-2024-02 is UNSAT
FORMULA MedleyA-PT-08-ReachabilityFireability-2024-02 TRUE TECHNIQUES SMT_REFINEMENT
[2024-06-02 18:53:06] [INFO ] Deduced a trap composed of 45 places in 162 ms of which 3 ms to minimize.
[2024-06-02 18:53:07] [INFO ] Deduced a trap composed of 38 places in 177 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/147 variables, 4/162 constraints. Problems are: Problem set: 4 solved, 8 unsolved
[2024-06-02 18:53:07] [INFO ] Deduced a trap composed of 34 places in 201 ms of which 4 ms to minimize.
[2024-06-02 18:53:07] [INFO ] Deduced a trap composed of 41 places in 184 ms of which 3 ms to minimize.
[2024-06-02 18:53:07] [INFO ] Deduced a trap composed of 22 places in 112 ms of which 2 ms to minimize.
[2024-06-02 18:53:07] [INFO ] Deduced a trap composed of 30 places in 132 ms of which 3 ms to minimize.
[2024-06-02 18:53:08] [INFO ] Deduced a trap composed of 25 places in 119 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/147 variables, 5/167 constraints. Problems are: Problem set: 4 solved, 8 unsolved
[2024-06-02 18:53:08] [INFO ] Deduced a trap composed of 26 places in 177 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/147 variables, 1/168 constraints. Problems are: Problem set: 4 solved, 8 unsolved
[2024-06-02 18:53:08] [INFO ] Deduced a trap composed of 36 places in 154 ms of which 14 ms to minimize.
[2024-06-02 18:53:08] [INFO ] Deduced a trap composed of 37 places in 102 ms of which 2 ms to minimize.
[2024-06-02 18:53:08] [INFO ] Deduced a trap composed of 33 places in 180 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/147 variables, 3/171 constraints. Problems are: Problem set: 4 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/147 variables, 0/171 constraints. Problems are: Problem set: 4 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 312/459 variables, 147/318 constraints. Problems are: Problem set: 4 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/459 variables, 8/326 constraints. Problems are: Problem set: 4 solved, 8 unsolved
[2024-06-02 18:53:10] [INFO ] Deduced a trap composed of 27 places in 205 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 459/459 variables, and 327 constraints, problems are : Problem set: 4 solved, 8 unsolved in 5013 ms.
Refiners :[Domain max(s): 147/147 constraints, Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 147/147 constraints, PredecessorRefiner: 8/12 constraints, Known Traps: 14/14 constraints]
After SMT, in 7157ms problems are : Problem set: 4 solved, 8 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 101 out of 147 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 147/147 places, 312/312 transitions.
Graph (complete) has 508 edges and 147 vertex of which 142 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.4 ms
Discarding 5 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 142 transition count 309
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 141 transition count 309
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 16 place count 128 transition count 294
Iterating global reduction 0 with 13 rules applied. Total rules applied 29 place count 128 transition count 294
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 31 place count 128 transition count 292
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 1 with 8 rules applied. Total rules applied 39 place count 128 transition count 284
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 39 place count 128 transition count 283
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 41 place count 127 transition count 283
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 42 place count 127 transition count 282
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 43 place count 126 transition count 282
Applied a total of 43 rules in 179 ms. Remains 126 /147 variables (removed 21) and now considering 282/312 (removed 30) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 204 ms. Remains : 126/147 places, 282/312 transitions.
RANDOM walk for 40000 steps (1949 resets) in 1287 ms. (31 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (563 resets) in 253 ms. (157 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (483 resets) in 371 ms. (107 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (514 resets) in 168 ms. (236 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (488 resets) in 245 ms. (162 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (487 resets) in 155 ms. (256 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (634 resets) in 457 ms. (87 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (490 resets) in 303 ms. (131 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (492 resets) in 270 ms. (147 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 414046 steps, run timeout after 3001 ms. (steps per millisecond=137 ) properties seen :0 out of 8
Probabilistic random walk after 414046 steps, saw 81183 distinct states, run finished after 3001 ms. (steps per millisecond=137 ) properties seen :0
// Phase 1: matrix 282 rows 126 cols
[2024-06-02 18:53:15] [INFO ] Computed 9 invariants in 5 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 13/113 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 11/124 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 282/406 variables, 124/133 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/406 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 2/408 variables, 2/135 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/408 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 0/408 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 408/408 variables, and 135 constraints, problems are : Problem set: 0 solved, 8 unsolved in 719 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 126/126 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 13/113 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 11/124 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-02 18:53:16] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 2 ms to minimize.
[2024-06-02 18:53:16] [INFO ] Deduced a trap composed of 19 places in 96 ms of which 2 ms to minimize.
[2024-06-02 18:53:16] [INFO ] Deduced a trap composed of 35 places in 140 ms of which 2 ms to minimize.
[2024-06-02 18:53:16] [INFO ] Deduced a trap composed of 30 places in 152 ms of which 3 ms to minimize.
[2024-06-02 18:53:17] [INFO ] Deduced a trap composed of 34 places in 124 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-02 18:53:17] [INFO ] Deduced a trap composed of 30 places in 157 ms of which 2 ms to minimize.
[2024-06-02 18:53:17] [INFO ] Deduced a trap composed of 33 places in 157 ms of which 3 ms to minimize.
[2024-06-02 18:53:17] [INFO ] Deduced a trap composed of 34 places in 165 ms of which 2 ms to minimize.
[2024-06-02 18:53:17] [INFO ] Deduced a trap composed of 39 places in 147 ms of which 2 ms to minimize.
[2024-06-02 18:53:17] [INFO ] Deduced a trap composed of 21 places in 141 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 5/19 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-02 18:53:18] [INFO ] Deduced a trap composed of 37 places in 142 ms of which 2 ms to minimize.
[2024-06-02 18:53:18] [INFO ] Deduced a trap composed of 32 places in 147 ms of which 2 ms to minimize.
[2024-06-02 18:53:18] [INFO ] Deduced a trap composed of 40 places in 159 ms of which 2 ms to minimize.
[2024-06-02 18:53:18] [INFO ] Deduced a trap composed of 23 places in 164 ms of which 3 ms to minimize.
[2024-06-02 18:53:18] [INFO ] Deduced a trap composed of 36 places in 167 ms of which 3 ms to minimize.
[2024-06-02 18:53:18] [INFO ] Deduced a trap composed of 37 places in 149 ms of which 2 ms to minimize.
[2024-06-02 18:53:19] [INFO ] Deduced a trap composed of 38 places in 157 ms of which 2 ms to minimize.
[2024-06-02 18:53:19] [INFO ] Deduced a trap composed of 27 places in 149 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/124 variables, 8/27 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-02 18:53:19] [INFO ] Deduced a trap composed of 23 places in 146 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/124 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-02 18:53:19] [INFO ] Deduced a trap composed of 33 places in 63 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/124 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/124 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 282/406 variables, 124/153 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/406 variables, 4/157 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/406 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (OVERLAPS) 2/408 variables, 2/159 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/408 variables, 4/163 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/408 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (OVERLAPS) 0/408 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 408/408 variables, and 163 constraints, problems are : Problem set: 0 solved, 8 unsolved in 8439 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 126/126 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 20/20 constraints]
After SMT, in 9344ms problems are : Problem set: 0 solved, 8 unsolved
FORMULA MedleyA-PT-08-ReachabilityFireability-2024-15 FALSE TECHNIQUES PARIKH_WALK
FORMULA MedleyA-PT-08-ReachabilityFireability-2024-09 FALSE TECHNIQUES PARIKH_WALK
FORMULA MedleyA-PT-08-ReachabilityFireability-2024-07 TRUE TECHNIQUES PARIKH_WALK
FORMULA MedleyA-PT-08-ReachabilityFireability-2024-05 TRUE TECHNIQUES PARIKH_WALK
FORMULA MedleyA-PT-08-ReachabilityFireability-2024-04 FALSE TECHNIQUES PARIKH_WALK
FORMULA MedleyA-PT-08-ReachabilityFireability-2024-01 FALSE TECHNIQUES PARIKH_WALK
FORMULA MedleyA-PT-08-ReachabilityFireability-2024-00 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 7 properties in 879 ms.
Support contains 26 out of 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 282/282 transitions.
Graph (complete) has 464 edges and 126 vertex of which 124 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 124 transition count 271
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 16 place count 120 transition count 270
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 17 place count 119 transition count 270
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 17 place count 119 transition count 266
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 25 place count 115 transition count 266
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 48 place count 92 transition count 238
Iterating global reduction 3 with 23 rules applied. Total rules applied 71 place count 92 transition count 238
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 72 place count 92 transition count 237
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 81 place count 83 transition count 218
Iterating global reduction 4 with 9 rules applied. Total rules applied 90 place count 83 transition count 218
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 91 place count 82 transition count 215
Iterating global reduction 4 with 1 rules applied. Total rules applied 92 place count 82 transition count 215
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 104 place count 76 transition count 209
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 108 place count 74 transition count 220
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 4 with 12 rules applied. Total rules applied 120 place count 74 transition count 208
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 121 place count 74 transition count 207
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 122 place count 73 transition count 207
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 5 with 3 rules applied. Total rules applied 125 place count 73 transition count 208
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 128 place count 70 transition count 208
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 131 place count 70 transition count 208
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 132 place count 70 transition count 207
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 133 place count 69 transition count 206
Applied a total of 133 rules in 133 ms. Remains 69 /126 variables (removed 57) and now considering 206/282 (removed 76) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 134 ms. Remains : 69/126 places, 206/282 transitions.
RANDOM walk for 27954 steps (2222 resets) in 291 ms. (95 steps per ms) remains 0/1 properties
FORMULA MedleyA-PT-08-ReachabilityFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 27238 ms.
ITS solved all properties within timeout

BK_STOP 1717354405807

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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-08"
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-08, 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-171734921200063"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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