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.r553-tall-171734900900111.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 CO4-PT-14, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r553-tall-171734900900111
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 600K
-rw-r--r-- 1 mcc users 5.9K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K 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.8K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K 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 18K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 12K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K 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 174K 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 CO4-PT-14-ReachabilityFireability-2024-00
FORMULA_NAME CO4-PT-14-ReachabilityFireability-2024-01
FORMULA_NAME CO4-PT-14-ReachabilityFireability-2024-02
FORMULA_NAME CO4-PT-14-ReachabilityFireability-2024-03
FORMULA_NAME CO4-PT-14-ReachabilityFireability-2024-04
FORMULA_NAME CO4-PT-14-ReachabilityFireability-2024-05
FORMULA_NAME CO4-PT-14-ReachabilityFireability-2024-06
FORMULA_NAME CO4-PT-14-ReachabilityFireability-2024-07
FORMULA_NAME CO4-PT-14-ReachabilityFireability-2024-08
FORMULA_NAME CO4-PT-14-ReachabilityFireability-2024-09
FORMULA_NAME CO4-PT-14-ReachabilityFireability-2024-10
FORMULA_NAME CO4-PT-14-ReachabilityFireability-2024-11
FORMULA_NAME CO4-PT-14-ReachabilityFireability-2024-12
FORMULA_NAME CO4-PT-14-ReachabilityFireability-2024-13
FORMULA_NAME CO4-PT-14-ReachabilityFireability-2024-14
FORMULA_NAME CO4-PT-14-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717351793081

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CO4-PT-14
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 18:09:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-02 18:09:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:09:54] [INFO ] Load time of PNML (sax parser for PT used): 93 ms
[2024-06-02 18:09:54] [INFO ] Transformed 680 places.
[2024-06-02 18:09:54] [INFO ] Transformed 812 transitions.
[2024-06-02 18:09:54] [INFO ] Found NUPN structural information;
[2024-06-02 18:09:54] [INFO ] Parsed PT model containing 680 places and 812 transitions and 1822 arcs in 187 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 100 places in 8 ms
Reduce places removed 100 places and 120 transitions.
FORMULA CO4-PT-14-ReachabilityFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-14-ReachabilityFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (111 resets) in 1593 ms. (25 steps per ms) remains 12/14 properties
FORMULA CO4-PT-14-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CO4-PT-14-ReachabilityFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40000 steps (109 resets) in 497 ms. (80 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40000 steps (56 resets) in 543 ms. (73 steps per ms) remains 11/12 properties
FORMULA CO4-PT-14-ReachabilityFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40000 steps (39 resets) in 226 ms. (176 steps per ms) remains 9/11 properties
FORMULA CO4-PT-14-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-14-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40002 steps (114 resets) in 119 ms. (333 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40000 steps (121 resets) in 209 ms. (190 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40001 steps (122 resets) in 117 ms. (338 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40000 steps (43 resets) in 139 ms. (285 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40000 steps (140 resets) in 195 ms. (204 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (300 resets) in 148 ms. (268 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40000 steps (88 resets) in 118 ms. (336 steps per ms) remains 9/9 properties
// Phase 1: matrix 692 rows 580 cols
[2024-06-02 18:09:55] [INFO ] Computed 8 invariants in 21 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 96/96 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem CO4-PT-14-ReachabilityFireability-2024-02 is UNSAT
FORMULA CO4-PT-14-ReachabilityFireability-2024-02 FALSE TECHNIQUES SMT_REFINEMENT
Problem CO4-PT-14-ReachabilityFireability-2024-09 is UNSAT
FORMULA CO4-PT-14-ReachabilityFireability-2024-09 FALSE TECHNIQUES SMT_REFINEMENT
Problem CO4-PT-14-ReachabilityFireability-2024-10 is UNSAT
FORMULA CO4-PT-14-ReachabilityFireability-2024-10 FALSE TECHNIQUES SMT_REFINEMENT
Problem CO4-PT-14-ReachabilityFireability-2024-13 is UNSAT
FORMULA CO4-PT-14-ReachabilityFireability-2024-13 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 484/580 variables, 8/104 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/580 variables, 484/588 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/580 variables, 0/588 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 692/1272 variables, 580/1168 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1272 variables, 0/1168 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/1272 variables, 0/1168 constraints. Problems are: Problem set: 4 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1272/1272 variables, and 1168 constraints, problems are : Problem set: 4 solved, 5 unsolved in 1024 ms.
Refiners :[Domain max(s): 580/580 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 580/580 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 33/33 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 0/33 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 529/562 variables, 4/37 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/562 variables, 529/566 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/562 variables, 0/566 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 18/580 variables, 4/570 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/580 variables, 18/588 constraints. Problems are: Problem set: 4 solved, 5 unsolved
[2024-06-02 18:09:57] [INFO ] Deduced a trap composed of 351 places in 191 ms of which 40 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/580 variables, 1/589 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/580 variables, 0/589 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 692/1272 variables, 580/1169 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1272 variables, 5/1174 constraints. Problems are: Problem set: 4 solved, 5 unsolved
[2024-06-02 18:09:58] [INFO ] Deduced a trap composed of 18 places in 78 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1272 variables, 1/1175 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1272 variables, 0/1175 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 0/1272 variables, 0/1175 constraints. Problems are: Problem set: 4 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1272/1272 variables, and 1175 constraints, problems are : Problem set: 4 solved, 5 unsolved in 1926 ms.
Refiners :[Domain max(s): 580/580 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 580/580 constraints, PredecessorRefiner: 5/9 constraints, Known Traps: 2/2 constraints]
After SMT, in 3090ms problems are : Problem set: 4 solved, 5 unsolved
FORMULA CO4-PT-14-ReachabilityFireability-2024-08 TRUE TECHNIQUES PARIKH_WALK
FORMULA CO4-PT-14-ReachabilityFireability-2024-05 FALSE TECHNIQUES PARIKH_WALK
FORMULA CO4-PT-14-ReachabilityFireability-2024-01 TRUE TECHNIQUES PARIKH_WALK
FORMULA CO4-PT-14-ReachabilityFireability-2024-04 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 4 properties in 759 ms.
Support contains 4 out of 580 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 692/692 transitions.
Graph (trivial) has 591 edges and 580 vertex of which 2 / 580 are part of one of the 1 SCC in 6 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 877 edges and 579 vertex of which 544 are kept as prefixes of interest. Removing 35 places using SCC suffix rule.3 ms
Discarding 35 places :
Also discarding 19 output transitions
Drop transitions (Output transitions of discarded places.) removed 19 transitions
Drop transitions (Empty/Sink Transition effects.) removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 280 transitions
Trivial Post-agglo rules discarded 280 transitions
Performed 280 trivial Post agglomeration. Transition count delta: 280
Iterating post reduction 0 with 300 rules applied. Total rules applied 302 place count 544 transition count 371
Reduce places removed 280 places and 0 transitions.
Ensure Unique test 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 1 with 290 rules applied. Total rules applied 592 place count 264 transition count 361
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 11 rules applied. Total rules applied 603 place count 260 transition count 354
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 607 place count 257 transition count 353
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 607 place count 257 transition count 352
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 609 place count 256 transition count 352
Discarding 35 places :
Symmetric choice reduction at 4 with 35 rule applications. Total rules 644 place count 221 transition count 317
Iterating global reduction 4 with 35 rules applied. Total rules applied 679 place count 221 transition count 317
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 12 Pre rules applied. Total rules applied 679 place count 221 transition count 305
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 703 place count 209 transition count 305
Discarding 23 places :
Symmetric choice reduction at 4 with 23 rule applications. Total rules 726 place count 186 transition count 282
Iterating global reduction 4 with 23 rules applied. Total rules applied 749 place count 186 transition count 282
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 4 with 5 rules applied. Total rules applied 754 place count 186 transition count 277
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 755 place count 185 transition count 277
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 757 place count 183 transition count 274
Iterating global reduction 6 with 2 rules applied. Total rules applied 759 place count 183 transition count 274
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 761 place count 183 transition count 272
Performed 78 Post agglomeration using F-continuation condition with reduction of 10 identical transitions.
Deduced a syphon composed of 78 places in 0 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 7 with 156 rules applied. Total rules applied 917 place count 105 transition count 184
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 921 place count 105 transition count 180
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 8 with 62 rules applied. Total rules applied 983 place count 74 transition count 182
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 8 with 18 rules applied. Total rules applied 1001 place count 74 transition count 164
Discarding 27 places :
Symmetric choice reduction at 9 with 27 rule applications. Total rules 1028 place count 47 transition count 110
Iterating global reduction 9 with 27 rules applied. Total rules applied 1055 place count 47 transition count 110
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 9 with 16 rules applied. Total rules applied 1071 place count 47 transition count 94
Discarding 7 places :
Symmetric choice reduction at 10 with 7 rule applications. Total rules 1078 place count 40 transition count 74
Iterating global reduction 10 with 7 rules applied. Total rules applied 1085 place count 40 transition count 74
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 10 with 3 rules applied. Total rules applied 1088 place count 40 transition count 71
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -25
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 11 with 4 rules applied. Total rules applied 1092 place count 38 transition count 96
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 11 with 6 rules applied. Total rules applied 1098 place count 38 transition count 90
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 12 with 13 rules applied. Total rules applied 1111 place count 38 transition count 77
Free-agglomeration rule applied 5 times.
Iterating global reduction 12 with 5 rules applied. Total rules applied 1116 place count 38 transition count 72
Reduce places removed 5 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 6 rules applied. Total rules applied 1122 place count 33 transition count 71
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 1123 place count 33 transition count 71
Graph (complete) has 104 edges and 33 vertex of which 32 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 13 with 1 rules applied. Total rules applied 1124 place count 32 transition count 71
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 1125 place count 32 transition count 70
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 15 with 1 rules applied. Total rules applied 1126 place count 32 transition count 70
Graph (complete) has 101 edges and 32 vertex of which 31 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 15 with 1 rules applied. Total rules applied 1127 place count 31 transition count 70
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 16 with 1 rules applied. Total rules applied 1128 place count 31 transition count 69
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 17 with 1 rules applied. Total rules applied 1129 place count 31 transition count 69
Graph (complete) has 98 edges and 31 vertex of which 30 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 17 with 1 rules applied. Total rules applied 1130 place count 30 transition count 69
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 18 with 1 rules applied. Total rules applied 1131 place count 30 transition count 68
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 19 with 1 rules applied. Total rules applied 1132 place count 29 transition count 67
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t87.t679.t15.t16 and 1 places that fell out of Prefix Of Interest.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 16 edges and 25 vertex of which 2 / 25 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Iterating post reduction 19 with 3 rules applied. Total rules applied 1135 place count 24 transition count 65
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 20 with 4 rules applied. Total rules applied 1139 place count 24 transition count 61
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 21 with 2 rules applied. Total rules applied 1141 place count 23 transition count 60
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 21 with 1 rules applied. Total rules applied 1142 place count 23 transition count 59
Discarding 1 places :
Symmetric choice reduction at 22 with 1 rule applications. Total rules 1143 place count 22 transition count 56
Iterating global reduction 22 with 1 rules applied. Total rules applied 1144 place count 22 transition count 56
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 22 with 1 rules applied. Total rules applied 1145 place count 22 transition count 55
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 23 with 19 rules applied. Total rules applied 1164 place count 22 transition count 36
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 23 with 2 rules applied. Total rules applied 1166 place count 21 transition count 35
Discarding 2 places :
Symmetric choice reduction at 24 with 2 rule applications. Total rules 1168 place count 19 transition count 32
Iterating global reduction 24 with 2 rules applied. Total rules applied 1170 place count 19 transition count 32
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 24 with 2 rules applied. Total rules applied 1172 place count 19 transition count 30
Discarding 1 places :
Symmetric choice reduction at 25 with 1 rule applications. Total rules 1173 place count 18 transition count 29
Iterating global reduction 25 with 1 rules applied. Total rules applied 1174 place count 18 transition count 29
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 25 with 1 rules applied. Total rules applied 1175 place count 18 transition count 28
Free-agglomeration rule applied 4 times.
Iterating global reduction 26 with 4 rules applied. Total rules applied 1179 place count 18 transition count 24
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 26 with 4 rules applied. Total rules applied 1183 place count 14 transition count 24
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 27 with 1 rules applied. Total rules applied 1184 place count 14 transition count 23
Free-agglomeration rule applied 1 times.
Iterating global reduction 27 with 1 rules applied. Total rules applied 1185 place count 14 transition count 22
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 27 with 1 rules applied. Total rules applied 1186 place count 13 transition count 22
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 28 with 1 rules applied. Total rules applied 1187 place count 13 transition count 21
Free-agglomeration rule applied 1 times.
Iterating global reduction 28 with 1 rules applied. Total rules applied 1188 place count 13 transition count 20
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 28 with 2 rules applied. Total rules applied 1190 place count 12 transition count 19
Applied a total of 1190 rules in 167 ms. Remains 12 /580 variables (removed 568) and now considering 19/692 (removed 673) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 185 ms. Remains : 12/580 places, 19/692 transitions.
RANDOM walk for 604 steps (0 resets) in 8 ms. (67 steps per ms) remains 0/1 properties
FORMULA CO4-PT-14-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 5796 ms.
ITS solved all properties within timeout

BK_STOP 1717351800043

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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="CO4-PT-14"
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 CO4-PT-14, 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 r553-tall-171734900900111"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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