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.r564-tall-171734907600118.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-03, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r564-tall-171734907600118
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 564K
-rw-r--r-- 1 mcc users 6.9K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K 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 48K 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 26K 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 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 13K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 141K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K 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 86K 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

FORMULA_NAME StableMarking

=== Now, execution of the tool begins

BK_START 1717361578127

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=FireWire-PT-03
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 20:52:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2024-06-02 20:52:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 20:52:59] [INFO ] Load time of PNML (sax parser for PT used): 79 ms
[2024-06-02 20:52:59] [INFO ] Transformed 112 places.
[2024-06-02 20:52:59] [INFO ] Transformed 356 transitions.
[2024-06-02 20:52:59] [INFO ] Found NUPN structural information;
[2024-06-02 20:52:59] [INFO ] Parsed PT model containing 112 places and 356 transitions and 1308 arcs in 197 ms.
Structural test allowed to assert that 11 places are NOT stable. Took 7 ms.
Ensure Unique test removed 53 transitions
Reduce redundant transitions removed 53 transitions.
RANDOM walk for 40000 steps (2009 resets) in 2334 ms. (17 steps per ms) remains 39/101 properties
BEST_FIRST walk for 4002 steps (54 resets) in 19 ms. (200 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (44 resets) in 30 ms. (129 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (43 resets) in 19 ms. (200 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (46 resets) in 44 ms. (88 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (60 resets) in 27 ms. (142 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (58 resets) in 21 ms. (181 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (46 resets) in 12 ms. (307 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4001 steps (58 resets) in 14 ms. (266 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (54 resets) in 32 ms. (121 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (42 resets) in 21 ms. (181 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (55 resets) in 15 ms. (250 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (50 resets) in 12 ms. (307 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (57 resets) in 21 ms. (182 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (56 resets) in 13 ms. (285 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (61 resets) in 22 ms. (174 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (44 resets) in 12 ms. (307 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (54 resets) in 12 ms. (307 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4001 steps (46 resets) in 12 ms. (307 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (42 resets) in 14 ms. (266 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (42 resets) in 10 ms. (363 steps per ms) remains 36/39 properties
BEST_FIRST walk for 4004 steps (64 resets) in 17 ms. (222 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (49 resets) in 11 ms. (333 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (45 resets) in 11 ms. (333 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (52 resets) in 18 ms. (210 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (56 resets) in 12 ms. (307 steps per ms) remains 34/36 properties
BEST_FIRST walk for 4004 steps (48 resets) in 18 ms. (210 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (61 resets) in 12 ms. (307 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (60 resets) in 20 ms. (190 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (58 resets) in 13 ms. (285 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (43 resets) in 15 ms. (250 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (43 resets) in 25 ms. (153 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (50 resets) in 12 ms. (307 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (43 resets) in 13 ms. (286 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (45 resets) in 14 ms. (266 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (46 resets) in 14 ms. (266 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (44 resets) in 15 ms. (250 steps per ms) remains 34/34 properties
[2024-06-02 20:53:00] [INFO ] Flow matrix only has 271 transitions (discarded 32 similar events)
// Phase 1: matrix 271 rows 112 cols
[2024-06-02 20:53:00] [INFO ] Computed 9 invariants in 12 ms
[2024-06-02 20:53:00] [INFO ] State equation strengthened by 41 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 2 (OVERLAPS) 67/101 variables, 5/39 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 67/106 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 5 (OVERLAPS) 11/112 variables, 4/110 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/112 variables, 11/121 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/112 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 8 (OVERLAPS) 270/382 variables, 112/233 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/382 variables, 40/273 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/382 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 11 (OVERLAPS) 1/383 variables, 1/274 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/383 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 13 (OVERLAPS) 0/383 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 34 unsolved
No progress, stopping.
After SMT solving in domain Real declared 383/383 variables, and 274 constraints, problems are : Problem set: 0 solved, 34 unsolved in 1320 ms.
Refiners :[Domain max(s): 112/112 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 112/112 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 34/34 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 34 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 2 (OVERLAPS) 67/101 variables, 5/39 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 67/106 constraints. Problems are: Problem set: 0 solved, 34 unsolved
[2024-06-02 20:53:02] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 12 ms to minimize.
[2024-06-02 20:53:02] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 1 ms to minimize.
[2024-06-02 20:53:02] [INFO ] Deduced a trap composed of 37 places in 185 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 3/109 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/101 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 6 (OVERLAPS) 11/112 variables, 4/113 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/112 variables, 11/124 constraints. Problems are: Problem set: 0 solved, 34 unsolved
[2024-06-02 20:53:02] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 1 ms to minimize.
[2024-06-02 20:53:03] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/112 variables, 2/126 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/112 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 10 (OVERLAPS) 270/382 variables, 112/238 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/382 variables, 40/278 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/382 variables, 34/312 constraints. Problems are: Problem set: 0 solved, 34 unsolved
[2024-06-02 20:53:03] [INFO ] Deduced a trap composed of 34 places in 113 ms of which 1 ms to minimize.
[2024-06-02 20:53:03] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/382 variables, 2/314 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/382 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 15 (OVERLAPS) 1/383 variables, 1/315 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/383 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 17 (OVERLAPS) 0/383 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 34 unsolved
No progress, stopping.
After SMT solving in domain Int declared 383/383 variables, and 315 constraints, problems are : Problem set: 0 solved, 34 unsolved in 3743 ms.
Refiners :[Domain max(s): 112/112 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 112/112 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 34/34 constraints, Known Traps: 7/7 constraints]
After SMT, in 5138ms problems are : Problem set: 0 solved, 34 unsolved
Fused 34 Parikh solutions to 33 different solutions.
Parikh walk visited 0 properties in 1892 ms.
Support contains 34 out of 112 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 112/112 places, 303/303 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 112 transition count 300
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 3 place count 112 transition count 299
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 111 transition count 299
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 110 transition count 297
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 110 transition count 297
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 11 place count 108 transition count 295
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 17 place count 105 transition count 302
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 23 place count 105 transition count 296
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 2 with 11 rules applied. Total rules applied 34 place count 105 transition count 285
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 35 place count 105 transition count 287
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 38 place count 104 transition count 285
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 40 place count 104 transition count 283
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 41 place count 103 transition count 282
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 42 place count 102 transition count 282
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 42 place count 102 transition count 281
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 44 place count 101 transition count 281
Applied a total of 44 rules in 89 ms. Remains 101 /112 variables (removed 11) and now considering 281/303 (removed 22) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 99 ms. Remains : 101/112 places, 281/303 transitions.
RANDOM walk for 4000000 steps (244018 resets) in 17368 ms. (230 steps per ms) remains 17/34 properties
BEST_FIRST walk for 400003 steps (6094 resets) in 467 ms. (854 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400002 steps (6044 resets) in 424 ms. (941 steps per ms) remains 15/17 properties
BEST_FIRST walk for 400003 steps (6093 resets) in 394 ms. (1012 steps per ms) remains 15/15 properties
BEST_FIRST walk for 400004 steps (6273 resets) in 394 ms. (1012 steps per ms) remains 15/15 properties
BEST_FIRST walk for 400003 steps (6107 resets) in 390 ms. (1023 steps per ms) remains 15/15 properties
BEST_FIRST walk for 400003 steps (5897 resets) in 396 ms. (1007 steps per ms) remains 15/15 properties
BEST_FIRST walk for 400004 steps (6103 resets) in 405 ms. (985 steps per ms) remains 15/15 properties
BEST_FIRST walk for 400004 steps (5985 resets) in 416 ms. (959 steps per ms) remains 15/15 properties
BEST_FIRST walk for 400004 steps (6027 resets) in 411 ms. (970 steps per ms) remains 15/15 properties
BEST_FIRST walk for 400004 steps (6087 resets) in 399 ms. (1000 steps per ms) remains 15/15 properties
BEST_FIRST walk for 400003 steps (5983 resets) in 398 ms. (1002 steps per ms) remains 15/15 properties
BEST_FIRST walk for 400004 steps (6069 resets) in 414 ms. (963 steps per ms) remains 15/15 properties
BEST_FIRST walk for 400004 steps (6104 resets) in 419 ms. (952 steps per ms) remains 15/15 properties
BEST_FIRST walk for 400002 steps (6047 resets) in 408 ms. (978 steps per ms) remains 15/15 properties
BEST_FIRST walk for 400003 steps (6084 resets) in 409 ms. (975 steps per ms) remains 15/15 properties
[2024-06-02 20:53:14] [INFO ] Flow matrix only has 253 transitions (discarded 28 similar events)
// Phase 1: matrix 253 rows 101 cols
[2024-06-02 20:53:14] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 20:53:14] [INFO ] State equation strengthened by 39 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 67/82 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 240/322 variables, 82/86 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/322 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 31/353 variables, 18/104 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/353 variables, 3/107 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/353 variables, 39/146 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/353 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (OVERLAPS) 1/354 variables, 1/147 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/354 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/354 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 12 (OVERLAPS) 0/354 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 354/354 variables, and 148 constraints, problems are : Problem set: 0 solved, 15 unsolved in 420 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 101/101 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 67/82 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-06-02 20:53:15] [INFO ] Deduced a trap composed of 32 places in 29 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 240/322 variables, 82/87 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/322 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 31/353 variables, 18/105 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/353 variables, 3/108 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/353 variables, 39/147 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/353 variables, 15/162 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/353 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 11 (OVERLAPS) 1/354 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/354 variables, 1/164 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/354 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 14 (OVERLAPS) 0/354 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 354/354 variables, and 164 constraints, problems are : Problem set: 0 solved, 15 unsolved in 726 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 101/101 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 1/1 constraints]
After SMT, in 1158ms problems are : Problem set: 0 solved, 15 unsolved
Parikh walk visited 0 properties in 3 ms.
Support contains 15 out of 101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 281/281 transitions.
Applied a total of 0 rules in 10 ms. Remains 101 /101 variables (removed 0) and now considering 281/281 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 101/101 places, 281/281 transitions.
RANDOM walk for 4000000 steps (243121 resets) in 14654 ms. (272 steps per ms) remains 13/15 properties
BEST_FIRST walk for 4000004 steps (60122 resets) in 3677 ms. (1087 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4000004 steps (60193 resets) in 3678 ms. (1087 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4000002 steps (60402 resets) in 4226 ms. (946 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4000002 steps (60341 resets) in 3896 ms. (1026 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4000004 steps (60322 resets) in 3844 ms. (1040 steps per ms) remains 12/13 properties
BEST_FIRST walk for 4000002 steps (60249 resets) in 3977 ms. (1005 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4000004 steps (60774 resets) in 3540 ms. (1129 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4000004 steps (60266 resets) in 3494 ms. (1144 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4000003 steps (60814 resets) in 3513 ms. (1138 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4000003 steps (60397 resets) in 5141 ms. (777 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4000001 steps (60377 resets) in 4770 ms. (838 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4000002 steps (60126 resets) in 5690 ms. (702 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4000004 steps (60098 resets) in 6611 ms. (604 steps per ms) remains 12/12 properties
[2024-06-02 20:53:39] [INFO ] Flow matrix only has 253 transitions (discarded 28 similar events)
[2024-06-02 20:53:39] [INFO ] Invariant cache hit.
[2024-06-02 20:53:39] [INFO ] State equation strengthened by 39 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 50/62 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 179/241 variables, 62/65 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/241 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 66/307 variables, 16/81 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/307 variables, 2/83 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/307 variables, 27/110 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/307 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (OVERLAPS) 1/308 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/308 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/308 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (OVERLAPS) 43/351 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/351 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/351 variables, 12/145 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/351 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 16 (OVERLAPS) 3/354 variables, 2/147 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/354 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/354 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 19 (OVERLAPS) 0/354 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 354/354 variables, and 148 constraints, problems are : Problem set: 0 solved, 12 unsolved in 427 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 101/101 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 50/62 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-06-02 20:53:39] [INFO ] Deduced a trap composed of 32 places in 29 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 179/241 variables, 62/66 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/241 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 66/307 variables, 16/82 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/307 variables, 2/84 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/307 variables, 27/111 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/307 variables, 12/123 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/307 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (OVERLAPS) 1/308 variables, 1/124 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/308 variables, 1/125 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/308 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 14 (OVERLAPS) 43/351 variables, 20/145 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/351 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/351 variables, 12/158 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/351 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 18 (OVERLAPS) 3/354 variables, 2/160 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/354 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/354 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 21 (OVERLAPS) 0/354 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 354/354 variables, and 161 constraints, problems are : Problem set: 0 solved, 12 unsolved in 996 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 101/101 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 1/1 constraints]
After SMT, in 1452ms problems are : Problem set: 0 solved, 12 unsolved
Parikh walk visited 0 properties in 2001 ms.
Support contains 12 out of 101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 281/281 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 100 transition count 278
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 100 transition count 278
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 99 transition count 276
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 99 transition count 276
Applied a total of 4 rules in 17 ms. Remains 99 /101 variables (removed 2) and now considering 276/281 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 99/101 places, 276/281 transitions.
RANDOM walk for 4000000 steps (243719 resets) in 17045 ms. (234 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4000003 steps (60570 resets) in 3649 ms. (1095 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4000002 steps (60400 resets) in 7174 ms. (557 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4000003 steps (60205 resets) in 4356 ms. (918 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4000003 steps (60698 resets) in 4291 ms. (931 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4000001 steps (60572 resets) in 3520 ms. (1136 steps per ms) remains 11/12 properties
BEST_FIRST walk for 4000003 steps (60556 resets) in 3344 ms. (1195 steps per ms) remains 11/11 properties
BEST_FIRST walk for 4000004 steps (60244 resets) in 3622 ms. (1104 steps per ms) remains 11/11 properties
BEST_FIRST walk for 4000004 steps (60323 resets) in 3377 ms. (1184 steps per ms) remains 11/11 properties
BEST_FIRST walk for 4000003 steps (60415 resets) in 3301 ms. (1211 steps per ms) remains 11/11 properties
BEST_FIRST walk for 4000002 steps (60249 resets) in 3349 ms. (1194 steps per ms) remains 11/11 properties
BEST_FIRST walk for 4000003 steps (60225 resets) in 3384 ms. (1181 steps per ms) remains 11/11 properties
BEST_FIRST walk for 4000004 steps (60234 resets) in 7242 ms. (552 steps per ms) remains 11/11 properties
Finished probabilistic random walk after 194756 steps, run visited all 11 properties in 399 ms. (steps per millisecond=488 )
Probabilistic random walk after 194756 steps, saw 41019 distinct states, run finished after 403 ms. (steps per millisecond=483 ) properties seen :11
Able to resolve query StableMarking after proving 102 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PROBABILISTIC_WALK MARKED_SUFFIX_TEST BESTFIRST_WALK TOPOLOGICAL
Total runtime 67205 ms.
ITS solved all properties within timeout

BK_STOP 1717361646558

--------------------
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 StableMarking -timeout 180 -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-03"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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-03, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r564-tall-171734907600118"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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