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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 5.8K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K 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 15K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 10K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K 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 84K 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 FireWire-PT-01-ReachabilityFireability-2024-00
FORMULA_NAME FireWire-PT-01-ReachabilityFireability-2024-01
FORMULA_NAME FireWire-PT-01-ReachabilityFireability-2024-02
FORMULA_NAME FireWire-PT-01-ReachabilityFireability-2024-03
FORMULA_NAME FireWire-PT-01-ReachabilityFireability-2024-04
FORMULA_NAME FireWire-PT-01-ReachabilityFireability-2024-05
FORMULA_NAME FireWire-PT-01-ReachabilityFireability-2024-06
FORMULA_NAME FireWire-PT-01-ReachabilityFireability-2024-07
FORMULA_NAME FireWire-PT-01-ReachabilityFireability-2024-08
FORMULA_NAME FireWire-PT-01-ReachabilityFireability-2024-09
FORMULA_NAME FireWire-PT-01-ReachabilityFireability-2024-10
FORMULA_NAME FireWire-PT-01-ReachabilityFireability-2024-11
FORMULA_NAME FireWire-PT-01-ReachabilityFireability-2024-12
FORMULA_NAME FireWire-PT-01-ReachabilityFireability-2024-13
FORMULA_NAME FireWire-PT-01-ReachabilityFireability-2024-14
FORMULA_NAME FireWire-PT-01-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717353300175

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-01
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 18:35:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-02 18:35:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:35:01] [INFO ] Load time of PNML (sax parser for PT used): 74 ms
[2024-06-02 18:35:01] [INFO ] Transformed 107 places.
[2024-06-02 18:35:01] [INFO ] Transformed 346 transitions.
[2024-06-02 18:35:01] [INFO ] Found NUPN structural information;
[2024-06-02 18:35:01] [INFO ] Parsed PT model containing 107 places and 346 transitions and 1271 arcs in 172 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 53 transitions
Reduce redundant transitions removed 53 transitions.
RANDOM walk for 40000 steps (2237 resets) in 2076 ms. (19 steps per ms) remains 15/16 properties
FORMULA FireWire-PT-01-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 4002 steps (74 resets) in 37 ms. (105 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (144 resets) in 120 ms. (33 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (116 resets) in 325 ms. (12 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4000 steps (8 resets) in 167 ms. (23 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (9 resets) in 14 ms. (266 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (22 resets) in 30 ms. (129 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (17 resets) in 21 ms. (182 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (54 resets) in 21 ms. (182 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (10 resets) in 12 ms. (307 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (18 resets) in 12 ms. (308 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (12 resets) in 13 ms. (285 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (33 resets) in 15 ms. (250 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (26 resets) in 12 ms. (307 steps per ms) remains 15/15 properties
Interrupted probabilistic random walk after 616134 steps, run timeout after 3001 ms. (steps per millisecond=205 ) properties seen :7 out of 15
Probabilistic random walk after 616134 steps, saw 127975 distinct states, run finished after 3008 ms. (steps per millisecond=204 ) properties seen :7
FORMULA FireWire-PT-01-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA FireWire-PT-01-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA FireWire-PT-01-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA FireWire-PT-01-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA FireWire-PT-01-ReachabilityFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA FireWire-PT-01-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA FireWire-PT-01-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
[2024-06-02 18:35:05] [INFO ] Flow matrix only has 261 transitions (discarded 32 similar events)
// Phase 1: matrix 261 rows 107 cols
[2024-06-02 18:35:05] [INFO ] Computed 8 invariants in 15 ms
[2024-06-02 18:35:05] [INFO ] State equation strengthened by 40 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 78/78 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem FireWire-PT-01-ReachabilityFireability-2024-00 is UNSAT
FORMULA FireWire-PT-01-ReachabilityFireability-2024-00 FALSE TECHNIQUES SMT_REFINEMENT
Problem FireWire-PT-01-ReachabilityFireability-2024-01 is UNSAT
FORMULA FireWire-PT-01-ReachabilityFireability-2024-01 FALSE TECHNIQUES SMT_REFINEMENT
Problem FireWire-PT-01-ReachabilityFireability-2024-04 is UNSAT
FORMULA FireWire-PT-01-ReachabilityFireability-2024-04 FALSE TECHNIQUES SMT_REFINEMENT
Problem FireWire-PT-01-ReachabilityFireability-2024-10 is UNSAT
FORMULA FireWire-PT-01-ReachabilityFireability-2024-10 FALSE TECHNIQUES SMT_REFINEMENT
Problem FireWire-PT-01-ReachabilityFireability-2024-14 is UNSAT
FORMULA FireWire-PT-01-ReachabilityFireability-2024-14 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 28/106 variables, 8/86 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 28/114 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 0/114 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 260/366 variables, 106/220 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/366 variables, 39/259 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/366 variables, 0/259 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 1/367 variables, 1/260 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/367 variables, 1/261 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/367 variables, 0/261 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 1/368 variables, 1/262 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/368 variables, 0/262 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/368 variables, 0/262 constraints. Problems are: Problem set: 5 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 368/368 variables, and 262 constraints, problems are : Problem set: 5 solved, 3 unsolved in 497 ms.
Refiners :[Domain max(s): 107/107 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 107/107 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 51/51 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 0/51 constraints. Problems are: Problem set: 5 solved, 3 unsolved
Problem FireWire-PT-01-ReachabilityFireability-2024-02 is UNSAT
FORMULA FireWire-PT-01-ReachabilityFireability-2024-02 TRUE TECHNIQUES SMT_REFINEMENT
Problem FireWire-PT-01-ReachabilityFireability-2024-08 is UNSAT
FORMULA FireWire-PT-01-ReachabilityFireability-2024-08 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 55/106 variables, 8/59 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 55/114 constraints. Problems are: Problem set: 7 solved, 1 unsolved
[2024-06-02 18:35:06] [INFO ] Deduced a trap composed of 44 places in 71 ms of which 10 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 1/115 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/106 variables, 0/115 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 260/366 variables, 106/221 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/366 variables, 39/260 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/366 variables, 1/261 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/366 variables, 0/261 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/367 variables, 1/262 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/367 variables, 1/263 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/367 variables, 0/263 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/368 variables, 1/264 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/368 variables, 0/264 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/368 variables, 0/264 constraints. Problems are: Problem set: 7 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 368/368 variables, and 264 constraints, problems are : Problem set: 7 solved, 1 unsolved in 325 ms.
Refiners :[Domain max(s): 107/107 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 107/107 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 1/8 constraints, Known Traps: 1/1 constraints]
After SMT, in 1013ms problems are : Problem set: 7 solved, 1 unsolved
Parikh walk visited 0 properties in 24 ms.
Support contains 3 out of 107 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 107/107 places, 293/293 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 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 0 with 4 rules applied. Total rules applied 4 place count 107 transition count 289
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 5 place count 106 transition count 289
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 5 place count 106 transition count 288
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 105 transition count 288
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 10 place count 102 transition count 279
Iterating global reduction 2 with 3 rules applied. Total rules applied 13 place count 102 transition count 279
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 16 place count 99 transition count 273
Iterating global reduction 2 with 3 rules applied. Total rules applied 19 place count 99 transition count 273
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 25 place count 96 transition count 279
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 31 place count 96 transition count 273
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 3 with 9 rules applied. Total rules applied 40 place count 96 transition count 264
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 42 place count 96 transition count 265
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 46 place count 94 transition count 263
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 49 place count 94 transition count 260
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 50 place count 93 transition count 259
Applied a total of 50 rules in 113 ms. Remains 93 /107 variables (removed 14) and now considering 259/293 (removed 34) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 124 ms. Remains : 93/107 places, 259/293 transitions.
RANDOM walk for 40000 steps (2599 resets) in 125 ms. (317 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (10 resets) in 57 ms. (689 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2136123 steps, run timeout after 3001 ms. (steps per millisecond=711 ) properties seen :0 out of 1
Probabilistic random walk after 2136123 steps, saw 438438 distinct states, run finished after 3001 ms. (steps per millisecond=711 ) properties seen :0
[2024-06-02 18:35:09] [INFO ] Flow matrix only has 230 transitions (discarded 29 similar events)
// Phase 1: matrix 230 rows 93 cols
[2024-06-02 18:35:09] [INFO ] Computed 8 invariants in 4 ms
[2024-06-02 18:35:09] [INFO ] State equation strengthened by 37 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 63/66 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 204/270 variables, 66/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/270 variables, 26/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/270 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 49/319 variables, 24/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/319 variables, 4/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/319 variables, 11/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/319 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 4/323 variables, 3/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/323 variables, 1/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/323 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/323 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 323/323 variables, and 138 constraints, problems are : Problem set: 0 solved, 1 unsolved in 110 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 93/93 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 63/66 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 204/270 variables, 66/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/270 variables, 26/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/270 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 49/319 variables, 24/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/319 variables, 4/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/319 variables, 11/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/319 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/319 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 4/323 variables, 3/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/323 variables, 1/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/323 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/323 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 323/323 variables, and 139 constraints, problems are : Problem set: 0 solved, 1 unsolved in 125 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 93/93 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 254ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 17 ms.
Support contains 3 out of 93 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 93/93 places, 259/259 transitions.
Applied a total of 0 rules in 6 ms. Remains 93 /93 variables (removed 0) and now considering 259/259 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 93/93 places, 259/259 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 93/93 places, 259/259 transitions.
Applied a total of 0 rules in 5 ms. Remains 93 /93 variables (removed 0) and now considering 259/259 (removed 0) transitions.
[2024-06-02 18:35:10] [INFO ] Flow matrix only has 230 transitions (discarded 29 similar events)
[2024-06-02 18:35:10] [INFO ] Invariant cache hit.
[2024-06-02 18:35:10] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-06-02 18:35:10] [INFO ] Flow matrix only has 230 transitions (discarded 29 similar events)
[2024-06-02 18:35:10] [INFO ] Invariant cache hit.
[2024-06-02 18:35:10] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-02 18:35:10] [INFO ] Implicit Places using invariants and state equation in 183 ms returned [91]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 259 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 92/93 places, 259/259 transitions.
Applied a total of 0 rules in 6 ms. Remains 92 /92 variables (removed 0) and now considering 259/259 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 271 ms. Remains : 92/93 places, 259/259 transitions.
RANDOM walk for 40000 steps (2587 resets) in 115 ms. (344 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (14 resets) in 203 ms. (196 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2355666 steps, run timeout after 3001 ms. (steps per millisecond=784 ) properties seen :0 out of 1
Probabilistic random walk after 2355666 steps, saw 472573 distinct states, run finished after 3001 ms. (steps per millisecond=784 ) properties seen :0
[2024-06-02 18:35:13] [INFO ] Flow matrix only has 230 transitions (discarded 29 similar events)
// Phase 1: matrix 230 rows 92 cols
[2024-06-02 18:35:13] [INFO ] Computed 7 invariants in 5 ms
[2024-06-02 18:35:13] [INFO ] State equation strengthened by 37 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 63/66 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 204/270 variables, 66/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/270 variables, 26/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/270 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 48/318 variables, 23/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/318 variables, 3/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/318 variables, 11/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/318 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 4/322 variables, 3/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/322 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/322 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/322 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 322/322 variables, and 136 constraints, problems are : Problem set: 0 solved, 1 unsolved in 94 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 92/92 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 63/66 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 204/270 variables, 66/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/270 variables, 26/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/270 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 48/318 variables, 23/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/318 variables, 3/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/318 variables, 11/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/318 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 4/322 variables, 3/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/322 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/322 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/322 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 322/322 variables, and 137 constraints, problems are : Problem set: 0 solved, 1 unsolved in 126 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 92/92 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 233ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 13 ms.
Support contains 3 out of 92 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 92/92 places, 259/259 transitions.
Applied a total of 0 rules in 6 ms. Remains 92 /92 variables (removed 0) and now considering 259/259 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 92/92 places, 259/259 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 92/92 places, 259/259 transitions.
Applied a total of 0 rules in 6 ms. Remains 92 /92 variables (removed 0) and now considering 259/259 (removed 0) transitions.
[2024-06-02 18:35:13] [INFO ] Flow matrix only has 230 transitions (discarded 29 similar events)
[2024-06-02 18:35:13] [INFO ] Invariant cache hit.
[2024-06-02 18:35:13] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-06-02 18:35:13] [INFO ] Flow matrix only has 230 transitions (discarded 29 similar events)
[2024-06-02 18:35:13] [INFO ] Invariant cache hit.
[2024-06-02 18:35:13] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-02 18:35:13] [INFO ] Implicit Places using invariants and state equation in 168 ms returned []
Implicit Place search using SMT with State Equation took 238 ms to find 0 implicit places.
[2024-06-02 18:35:13] [INFO ] Redundant transitions in 10 ms returned []
Running 257 sub problems to find dead transitions.
[2024-06-02 18:35:14] [INFO ] Flow matrix only has 230 transitions (discarded 29 similar events)
[2024-06-02 18:35:14] [INFO ] Invariant cache hit.
[2024-06-02 18:35:14] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 257 unsolved
[2024-06-02 18:35:14] [INFO ] Deduced a trap composed of 32 places in 62 ms of which 3 ms to minimize.
[2024-06-02 18:35:14] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 1 ms to minimize.
[2024-06-02 18:35:15] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
[2024-06-02 18:35:15] [INFO ] Deduced a trap composed of 33 places in 47 ms of which 1 ms to minimize.
[2024-06-02 18:35:15] [INFO ] Deduced a trap composed of 15 places in 20 ms of which 1 ms to minimize.
[2024-06-02 18:35:15] [INFO ] Deduced a trap composed of 15 places in 20 ms of which 1 ms to minimize.
[2024-06-02 18:35:15] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 257 unsolved
[2024-06-02 18:35:16] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 4 (OVERLAPS) 230/321 variables, 91/106 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/321 variables, 37/143 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/321 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 7 (OVERLAPS) 1/322 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/322 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 9 (OVERLAPS) 0/322 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 257 unsolved
No progress, stopping.
After SMT solving in domain Real declared 322/322 variables, and 144 constraints, problems are : Problem set: 0 solved, 257 unsolved in 9523 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 92/92 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 257/257 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 257 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 3 (OVERLAPS) 230/321 variables, 91/106 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/321 variables, 37/143 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/321 variables, 257/400 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/321 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 7 (OVERLAPS) 1/322 variables, 1/401 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/322 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 9 (OVERLAPS) 0/322 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 257 unsolved
No progress, stopping.
After SMT solving in domain Int declared 322/322 variables, and 401 constraints, problems are : Problem set: 0 solved, 257 unsolved in 12992 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 92/92 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 257/257 constraints, Known Traps: 8/8 constraints]
After SMT, in 22664ms problems are : Problem set: 0 solved, 257 unsolved
Search for dead transitions found 0 dead transitions in 22668ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22934 ms. Remains : 92/92 places, 259/259 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 99 edges and 92 vertex of which 25 / 92 are part of one of the 4 SCC in 3 ms
Free SCC test removed 21 places
Drop transitions (Empty/Sink Transition effects.) removed 102 transitions
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 114 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 71 transition count 144
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 70 transition count 144
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 0 with 7 rules applied. Total rules applied 10 place count 70 transition count 137
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 11 place count 70 transition count 136
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 12 place count 69 transition count 136
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 14 place count 68 transition count 135
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 16 place count 68 transition count 133
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 18 place count 67 transition count 132
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 19 place count 66 transition count 114
Iterating global reduction 2 with 1 rules applied. Total rules applied 20 place count 66 transition count 114
Free-agglomeration rule applied 3 times with reduction of 2 identical transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 23 place count 66 transition count 109
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 26 place count 63 transition count 109
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 27 place count 63 transition count 108
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 29 place count 63 transition count 108
Applied a total of 29 rules in 44 ms. Remains 63 /92 variables (removed 29) and now considering 108/259 (removed 151) transitions.
Running SMT prover for 1 properties.
[2024-06-02 18:35:36] [INFO ] Flow matrix only has 107 transitions (discarded 1 similar events)
// Phase 1: matrix 107 rows 63 cols
[2024-06-02 18:35:36] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 18:35:36] [INFO ] After 21ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 18:35:36] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-02 18:35:36] [INFO ] After 24ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 18:35:36] [INFO ] After 32ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-02 18:35:36] [INFO ] After 75ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 156 ms.
[2024-06-02 18:35:36] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 3 ms.
[2024-06-02 18:35:36] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 92 places, 259 transitions and 948 arcs took 4 ms.
[2024-06-02 18:35:37] [INFO ] Flatten gal took : 55 ms
Total runtime 35734 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : FireWire-PT-01-ReachabilityFireability-2024-07

BK_STOP 1717353337285

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
mcc2024
rfs formula name FireWire-PT-01-ReachabilityFireability-2024-07
rfs formula type AG
rfs formula formula --invariant=/tmp/572/inv_0_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

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="FireWire-PT-01"
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 FireWire-PT-01, 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-171734901100175"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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