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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 620K
-rw-r--r-- 1 mcc users 7.2K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 15K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 178K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K 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 101K 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-10-ReachabilityFireability-2024-00
FORMULA_NAME FireWire-PT-10-ReachabilityFireability-2024-01
FORMULA_NAME FireWire-PT-10-ReachabilityFireability-2024-02
FORMULA_NAME FireWire-PT-10-ReachabilityFireability-2024-03
FORMULA_NAME FireWire-PT-10-ReachabilityFireability-2024-04
FORMULA_NAME FireWire-PT-10-ReachabilityFireability-2024-05
FORMULA_NAME FireWire-PT-10-ReachabilityFireability-2024-06
FORMULA_NAME FireWire-PT-10-ReachabilityFireability-2024-07
FORMULA_NAME FireWire-PT-10-ReachabilityFireability-2024-08
FORMULA_NAME FireWire-PT-10-ReachabilityFireability-2024-09
FORMULA_NAME FireWire-PT-10-ReachabilityFireability-2024-10
FORMULA_NAME FireWire-PT-10-ReachabilityFireability-2024-11
FORMULA_NAME FireWire-PT-10-ReachabilityFireability-2024-12
FORMULA_NAME FireWire-PT-10-ReachabilityFireability-2024-13
FORMULA_NAME FireWire-PT-10-ReachabilityFireability-2024-14
FORMULA_NAME FireWire-PT-10-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717355117139

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-10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 19:05:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-02 19:05:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 19:05:18] [INFO ] Load time of PNML (sax parser for PT used): 80 ms
[2024-06-02 19:05:18] [INFO ] Transformed 131 places.
[2024-06-02 19:05:18] [INFO ] Transformed 409 transitions.
[2024-06-02 19:05:18] [INFO ] Found NUPN structural information;
[2024-06-02 19:05:18] [INFO ] Parsed PT model containing 131 places and 409 transitions and 1529 arcs in 175 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 56 transitions
Reduce redundant transitions removed 56 transitions.
RANDOM walk for 40000 steps (2178 resets) in 1881 ms. (21 steps per ms) remains 12/16 properties
FORMULA FireWire-PT-10-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FireWire-PT-10-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FireWire-PT-10-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FireWire-PT-10-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 398 ms. (100 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (600 resets) in 272 ms. (146 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (8 resets) in 170 ms. (233 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (1108 resets) in 988 ms. (40 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (66 resets) in 122 ms. (325 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (1077 resets) in 177 ms. (224 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (561 resets) in 126 ms. (314 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (24 resets) in 87 ms. (454 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (32 resets) in 127 ms. (312 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (82 resets) in 173 ms. (229 steps per ms) remains 9/12 properties
FORMULA FireWire-PT-10-ReachabilityFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-10-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-10-ReachabilityFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 187 ms. (212 steps per ms) remains 9/9 properties
[2024-06-02 19:05:20] [INFO ] Flow matrix only has 321 transitions (discarded 32 similar events)
// Phase 1: matrix 321 rows 131 cols
[2024-06-02 19:05:20] [INFO ] Computed 8 invariants in 13 ms
[2024-06-02 19:05:20] [INFO ] State equation strengthened by 45 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 90/90 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem FireWire-PT-10-ReachabilityFireability-2024-00 is UNSAT
FORMULA FireWire-PT-10-ReachabilityFireability-2024-00 FALSE TECHNIQUES SMT_REFINEMENT
Problem FireWire-PT-10-ReachabilityFireability-2024-05 is UNSAT
FORMULA FireWire-PT-10-ReachabilityFireability-2024-05 FALSE TECHNIQUES SMT_REFINEMENT
Problem FireWire-PT-10-ReachabilityFireability-2024-11 is UNSAT
FORMULA FireWire-PT-10-ReachabilityFireability-2024-11 FALSE TECHNIQUES SMT_REFINEMENT
Problem FireWire-PT-10-ReachabilityFireability-2024-12 is UNSAT
FORMULA FireWire-PT-10-ReachabilityFireability-2024-12 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 37/127 variables, 7/97 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 37/134 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 0/134 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 2/129 variables, 1/135 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 2/137 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/129 variables, 0/137 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 320/449 variables, 129/266 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/449 variables, 44/310 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/449 variables, 0/310 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 2/451 variables, 2/312 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/451 variables, 2/314 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/451 variables, 0/314 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 1/452 variables, 1/315 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/452 variables, 0/315 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 0/452 variables, 0/315 constraints. Problems are: Problem set: 4 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 452/452 variables, and 315 constraints, problems are : Problem set: 4 solved, 5 unsolved in 1130 ms.
Refiners :[Domain max(s): 131/131 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 131/131 constraints, ReadFeed: 45/45 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/64 variables, 64/64 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 0/64 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 61/125 variables, 6/70 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 61/131 constraints. Problems are: Problem set: 4 solved, 5 unsolved
[2024-06-02 19:05:21] [INFO ] Deduced a trap composed of 22 places in 90 ms of which 13 ms to minimize.
[2024-06-02 19:05:21] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 2/133 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/133 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 4/129 variables, 2/135 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/129 variables, 4/139 constraints. Problems are: Problem set: 4 solved, 5 unsolved
[2024-06-02 19:05:21] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/129 variables, 1/140 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/129 variables, 0/140 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 320/449 variables, 129/269 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/449 variables, 44/313 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/449 variables, 4/317 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/449 variables, 0/317 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 2/451 variables, 2/319 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/451 variables, 2/321 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/451 variables, 1/322 constraints. Problems are: Problem set: 4 solved, 5 unsolved
[2024-06-02 19:05:22] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/451 variables, 1/323 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/451 variables, 0/323 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 19 (OVERLAPS) 1/452 variables, 1/324 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/452 variables, 0/324 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 21 (OVERLAPS) 0/452 variables, 0/324 constraints. Problems are: Problem set: 4 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 452/452 variables, and 324 constraints, problems are : Problem set: 4 solved, 5 unsolved in 2249 ms.
Refiners :[Domain max(s): 131/131 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 131/131 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 5/9 constraints, Known Traps: 4/4 constraints]
After SMT, in 3674ms problems are : Problem set: 4 solved, 5 unsolved
Parikh walk visited 0 properties in 4551 ms.
Support contains 64 out of 131 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 131/131 places, 353/353 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 131 transition count 350
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 130 transition count 348
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 130 transition count 348
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 1 with 2 rules applied. Total rules applied 7 place count 129 transition count 347
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 13 place count 129 transition count 341
Applied a total of 13 rules in 67 ms. Remains 129 /131 variables (removed 2) and now considering 341/353 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 76 ms. Remains : 129/131 places, 341/353 transitions.
RANDOM walk for 40000 steps (2223 resets) in 314 ms. (126 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (587 resets) in 257 ms. (155 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 61 ms. (645 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (1038 resets) in 104 ms. (380 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (593 resets) in 72 ms. (548 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (73 resets) in 46 ms. (851 steps per ms) remains 4/5 properties
FORMULA FireWire-PT-10-ReachabilityFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2024-06-02 19:05:28] [INFO ] Flow matrix only has 317 transitions (discarded 24 similar events)
// Phase 1: matrix 317 rows 129 cols
[2024-06-02 19:05:28] [INFO ] Computed 8 invariants in 7 ms
[2024-06-02 19:05:28] [INFO ] State equation strengthened by 44 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 60/123 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 4/127 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 317/444 variables, 127/135 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/444 variables, 44/179 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/444 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 2/446 variables, 2/181 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/446 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 0/446 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 446/446 variables, and 181 constraints, problems are : Problem set: 0 solved, 4 unsolved in 334 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 129/129 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 60/123 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-02 19:05:29] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 1 ms to minimize.
[2024-06-02 19:05:29] [INFO ] Deduced a trap composed of 36 places in 37 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-02 19:05:29] [INFO ] Deduced a trap composed of 22 places in 74 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 4/127 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-02 19:05:29] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/127 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/127 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 317/444 variables, 127/139 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/444 variables, 44/183 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/444 variables, 3/186 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/444 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 2/446 variables, 2/188 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/446 variables, 1/189 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-02 19:05:30] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/446 variables, 1/190 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/446 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 0/446 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 446/446 variables, and 190 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1580 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 129/129 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 5/5 constraints]
After SMT, in 1996ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 837 ms.
Support contains 63 out of 129 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 129/129 places, 341/341 transitions.
Applied a total of 0 rules in 20 ms. Remains 129 /129 variables (removed 0) and now considering 341/341 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 129/129 places, 341/341 transitions.
RANDOM walk for 40000 steps (2230 resets) in 119 ms. (333 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (520 resets) in 201 ms. (198 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (1059 resets) in 60 ms. (655 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (548 resets) in 60 ms. (655 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (80 resets) in 32 ms. (1212 steps per ms) remains 3/4 properties
FORMULA FireWire-PT-10-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2024-06-02 19:05:31] [INFO ] Flow matrix only has 317 transitions (discarded 24 similar events)
[2024-06-02 19:05:31] [INFO ] Invariant cache hit.
[2024-06-02 19:05:31] [INFO ] State equation strengthened by 44 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 60/123 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 4/127 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 317/444 variables, 127/135 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/444 variables, 44/179 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/444 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 2/446 variables, 2/181 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/446 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/446 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 446/446 variables, and 181 constraints, problems are : Problem set: 0 solved, 3 unsolved in 238 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 129/129 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 60/123 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-02 19:05:32] [INFO ] Deduced a trap composed of 25 places in 71 ms of which 1 ms to minimize.
[2024-06-02 19:05:32] [INFO ] Deduced a trap composed of 36 places in 62 ms of which 1 ms to minimize.
[2024-06-02 19:05:32] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 4/127 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-02 19:05:32] [INFO ] Deduced a trap composed of 27 places in 73 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/127 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 317/444 variables, 127/139 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/444 variables, 44/183 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/444 variables, 2/185 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/444 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 2/446 variables, 2/187 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/446 variables, 1/188 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/446 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/446 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 446/446 variables, and 188 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1145 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 129/129 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 4/4 constraints]
After SMT, in 1424ms problems are : Problem set: 0 solved, 3 unsolved
FORMULA FireWire-PT-10-ReachabilityFireability-2024-06 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 511 ms.
Support contains 59 out of 129 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 129/129 places, 341/341 transitions.
Applied a total of 0 rules in 10 ms. Remains 129 /129 variables (removed 0) and now considering 341/341 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 129/129 places, 341/341 transitions.
RANDOM walk for 40000 steps (2163 resets) in 103 ms. (384 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (602 resets) in 202 ms. (197 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (605 resets) in 59 ms. (666 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 98678 steps, run visited all 2 properties in 350 ms. (steps per millisecond=281 )
Probabilistic random walk after 98678 steps, saw 22982 distinct states, run finished after 356 ms. (steps per millisecond=277 ) properties seen :2
FORMULA FireWire-PT-10-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA FireWire-PT-10-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.
Total runtime 15981 ms.
ITS solved all properties within timeout

BK_STOP 1717355134359

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FireWire-PT-10"
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-10, 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-171734901200247"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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