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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 524K
-rw-r--r-- 1 mcc users 6.2K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K 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.2K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K 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 16K 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 137K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K 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 89K 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 1717361603186

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-04
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 20:53:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2024-06-02 20:53:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 20:53:24] [INFO ] Load time of PNML (sax parser for PT used): 78 ms
[2024-06-02 20:53:24] [INFO ] Transformed 113 places.
[2024-06-02 20:53:24] [INFO ] Transformed 364 transitions.
[2024-06-02 20:53:24] [INFO ] Found NUPN structural information;
[2024-06-02 20:53:24] [INFO ] Parsed PT model containing 113 places and 364 transitions and 1349 arcs in 174 ms.
Structural test allowed to assert that 10 places are NOT stable. Took 7 ms.
Ensure Unique test removed 56 transitions
Reduce redundant transitions removed 56 transitions.
RANDOM walk for 40000 steps (2205 resets) in 1749 ms. (22 steps per ms) remains 40/103 properties
BEST_FIRST walk for 4004 steps (63 resets) in 47 ms. (83 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (55 resets) in 33 ms. (117 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (61 resets) in 15 ms. (250 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (61 resets) in 20 ms. (190 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (57 resets) in 20 ms. (190 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (56 resets) in 22 ms. (174 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (59 resets) in 32 ms. (121 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (50 resets) in 20 ms. (190 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (48 resets) in 15 ms. (250 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (69 resets) in 14 ms. (266 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (56 resets) in 13 ms. (285 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (54 resets) in 14 ms. (266 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (73 resets) in 12 ms. (307 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (46 resets) in 13 ms. (285 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (49 resets) in 28 ms. (138 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (60 resets) in 15 ms. (250 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (71 resets) in 19 ms. (200 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (59 resets) in 12 ms. (307 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (53 resets) in 13 ms. (285 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (61 resets) in 13 ms. (285 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (59 resets) in 13 ms. (285 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (59 resets) in 14 ms. (266 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (69 resets) in 12 ms. (308 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (49 resets) in 15 ms. (250 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (58 resets) in 11 ms. (333 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (56 resets) in 16 ms. (235 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (64 resets) in 10 ms. (364 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (41 resets) in 10 ms. (363 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (57 resets) in 9 ms. (400 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (72 resets) in 17 ms. (222 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (72 resets) in 16 ms. (235 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (52 resets) in 10 ms. (363 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (59 resets) in 13 ms. (285 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (59 resets) in 12 ms. (308 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (60 resets) in 12 ms. (307 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (73 resets) in 13 ms. (286 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (51 resets) in 13 ms. (285 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (64 resets) in 25 ms. (153 steps per ms) remains 37/40 properties
BEST_FIRST walk for 4004 steps (63 resets) in 14 ms. (266 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (50 resets) in 16 ms. (235 steps per ms) remains 37/37 properties
[2024-06-02 20:53:25] [INFO ] Flow matrix only has 276 transitions (discarded 32 similar events)
// Phase 1: matrix 276 rows 113 cols
[2024-06-02 20:53:25] [INFO ] Computed 8 invariants in 18 ms
[2024-06-02 20:53:25] [INFO ] State equation strengthened by 40 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 2 (OVERLAPS) 55/92 variables, 4/41 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 55/96 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 5 (OVERLAPS) 20/112 variables, 4/100 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/112 variables, 20/120 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/112 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 8 (OVERLAPS) 275/387 variables, 112/232 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/387 variables, 39/271 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/387 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 11 (OVERLAPS) 1/388 variables, 1/272 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/388 variables, 1/273 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/388 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 14 (OVERLAPS) 1/389 variables, 1/274 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/389 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 16 (OVERLAPS) 0/389 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 37 unsolved
No progress, stopping.
After SMT solving in domain Real declared 389/389 variables, and 274 constraints, problems are : Problem set: 0 solved, 37 unsolved in 1641 ms.
Refiners :[Domain max(s): 113/113 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 113/113 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 37/37 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 37 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 2 (OVERLAPS) 55/92 variables, 4/41 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 55/96 constraints. Problems are: Problem set: 0 solved, 37 unsolved
[2024-06-02 20:53:27] [INFO ] Deduced a trap composed of 37 places in 69 ms of which 11 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/92 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 6 (OVERLAPS) 20/112 variables, 4/101 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/112 variables, 20/121 constraints. Problems are: Problem set: 0 solved, 37 unsolved
[2024-06-02 20:53:27] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 3 ms to minimize.
[2024-06-02 20:53:27] [INFO ] Deduced a trap composed of 77 places in 56 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/112 variables, 2/123 constraints. Problems are: Problem set: 0 solved, 37 unsolved
[2024-06-02 20:53:27] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
[2024-06-02 20:53:28] [INFO ] Deduced a trap composed of 69 places in 57 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/112 variables, 2/125 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/112 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 11 (OVERLAPS) 275/387 variables, 112/237 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/387 variables, 39/276 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/387 variables, 37/313 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/387 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 15 (OVERLAPS) 1/388 variables, 1/314 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/388 variables, 1/315 constraints. Problems are: Problem set: 0 solved, 37 unsolved
[2024-06-02 20:53:29] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/388 variables, 1/316 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/388 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 19 (OVERLAPS) 1/389 variables, 1/317 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/389 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 21 (OVERLAPS) 0/389 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 37 unsolved
No progress, stopping.
After SMT solving in domain Int declared 389/389 variables, and 317 constraints, problems are : Problem set: 0 solved, 37 unsolved in 3510 ms.
Refiners :[Domain max(s): 113/113 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 113/113 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 37/37 constraints, Known Traps: 6/6 constraints]
After SMT, in 5227ms problems are : Problem set: 0 solved, 37 unsolved
Fused 37 Parikh solutions to 36 different solutions.
Parikh walk visited 0 properties in 2127 ms.
Support contains 37 out of 113 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 113/113 places, 308/308 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 113 transition count 304
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 5 place count 112 transition count 304
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 112 transition count 303
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 7 place count 111 transition count 303
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 11 place count 109 transition count 307
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 15 place count 109 transition count 303
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 3 with 8 rules applied. Total rules applied 23 place count 109 transition count 295
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 25 place count 109 transition count 296
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 29 place count 107 transition count 294
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 32 place count 107 transition count 291
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 33 place count 106 transition count 290
Applied a total of 33 rules in 96 ms. Remains 106 /113 variables (removed 7) and now considering 290/308 (removed 18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 105 ms. Remains : 106/113 places, 290/308 transitions.
RANDOM walk for 4000000 steps (256972 resets) in 18011 ms. (222 steps per ms) remains 14/37 properties
BEST_FIRST walk for 4000004 steps (64418 resets) in 3814 ms. (1048 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000004 steps (64167 resets) in 4056 ms. (985 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000004 steps (64860 resets) in 3759 ms. (1063 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000004 steps (64670 resets) in 3881 ms. (1030 steps per ms) remains 13/14 properties
BEST_FIRST walk for 4000004 steps (64498 resets) in 3745 ms. (1067 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4000003 steps (64737 resets) in 3590 ms. (1113 steps per ms) remains 12/13 properties
BEST_FIRST walk for 4000003 steps (64584 resets) in 3602 ms. (1110 steps per ms) remains 11/12 properties
BEST_FIRST walk for 4000004 steps (64892 resets) in 3384 ms. (1181 steps per ms) remains 11/11 properties
BEST_FIRST walk for 4000004 steps (64977 resets) in 3497 ms. (1143 steps per ms) remains 11/11 properties
BEST_FIRST walk for 4000003 steps (64767 resets) in 3425 ms. (1167 steps per ms) remains 11/11 properties
BEST_FIRST walk for 4000003 steps (64958 resets) in 3308 ms. (1208 steps per ms) remains 11/11 properties
BEST_FIRST walk for 4000003 steps (64982 resets) in 3341 ms. (1196 steps per ms) remains 11/11 properties
BEST_FIRST walk for 4000002 steps (65528 resets) in 3340 ms. (1197 steps per ms) remains 11/11 properties
[2024-06-02 20:53:54] [INFO ] Flow matrix only has 263 transitions (discarded 27 similar events)
// Phase 1: matrix 263 rows 106 cols
[2024-06-02 20:53:54] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 20:53:54] [INFO ] State equation strengthened by 40 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/11 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 52/63 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 52/65 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 186/249 variables, 63/128 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/249 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 71/320 variables, 17/145 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/320 variables, 17/162 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/320 variables, 3/165 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/320 variables, 28/193 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/320 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (OVERLAPS) 1/321 variables, 1/194 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/321 variables, 1/195 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/321 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/321 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 16 (OVERLAPS) 46/367 variables, 23/219 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/367 variables, 23/242 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/367 variables, 1/243 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/367 variables, 12/255 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/367 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 21 (OVERLAPS) 2/369 variables, 2/257 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/369 variables, 2/259 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/369 variables, 1/260 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/369 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 25 (OVERLAPS) 0/369 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 369/369 variables, and 260 constraints, problems are : Problem set: 0 solved, 11 unsolved in 444 ms.
Refiners :[Domain max(s): 106/106 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 106/106 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/11 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 52/63 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 52/65 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 186/249 variables, 63/128 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/249 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 71/320 variables, 17/145 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/320 variables, 17/162 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/320 variables, 3/165 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/320 variables, 28/193 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/320 variables, 11/204 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-06-02 20:53:54] [INFO ] Deduced a trap composed of 34 places in 29 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/320 variables, 1/205 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/320 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 14 (OVERLAPS) 1/321 variables, 1/206 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/321 variables, 1/207 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/321 variables, 1/208 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/321 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 18 (OVERLAPS) 46/367 variables, 23/231 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/367 variables, 23/254 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/367 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/367 variables, 12/267 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/367 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 23 (OVERLAPS) 2/369 variables, 2/269 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/369 variables, 2/271 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/369 variables, 1/272 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/369 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 27 (OVERLAPS) 0/369 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 369/369 variables, and 272 constraints, problems are : Problem set: 0 solved, 11 unsolved in 822 ms.
Refiners :[Domain max(s): 106/106 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 106/106 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 1/1 constraints]
After SMT, in 1291ms problems are : Problem set: 0 solved, 11 unsolved
Parikh walk visited 0 properties in 3 ms.
Support contains 11 out of 106 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 106/106 places, 290/290 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 105 transition count 288
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 105 transition count 288
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 104 transition count 293
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 6 place count 104 transition count 291
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 104 transition count 290
Applied a total of 7 rules in 25 ms. Remains 104 /106 variables (removed 2) and now considering 290/290 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 104/106 places, 290/290 transitions.
RANDOM walk for 4000000 steps (256489 resets) in 11634 ms. (343 steps per ms) remains 10/11 properties
BEST_FIRST walk for 4000002 steps (64816 resets) in 3274 ms. (1221 steps per ms) remains 8/10 properties
BEST_FIRST walk for 4000003 steps (65114 resets) in 2969 ms. (1346 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4000004 steps (64579 resets) in 3077 ms. (1299 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4000003 steps (65351 resets) in 3042 ms. (1314 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4000003 steps (64359 resets) in 2899 ms. (1379 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4000004 steps (64520 resets) in 2919 ms. (1369 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4000004 steps (64966 resets) in 3032 ms. (1318 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4000003 steps (64675 resets) in 2976 ms. (1343 steps per ms) remains 8/8 properties
[2024-06-02 20:54:06] [INFO ] Flow matrix only has 261 transitions (discarded 29 similar events)
// Phase 1: matrix 261 rows 104 cols
[2024-06-02 20:54:06] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 20:54:06] [INFO ] State equation strengthened by 40 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 31/39 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 117/156 variables, 39/40 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 113/269 variables, 15/55 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/269 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/269 variables, 18/75 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/269 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 1/270 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/270 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/270 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 91/361 variables, 45/122 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/361 variables, 2/124 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/361 variables, 22/146 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/361 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (OVERLAPS) 4/365 variables, 4/150 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/365 variables, 2/152 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/365 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (OVERLAPS) 0/365 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 365/365 variables, and 152 constraints, problems are : Problem set: 0 solved, 8 unsolved in 287 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 104/104 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 31/39 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 117/156 variables, 39/40 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 113/269 variables, 15/55 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/269 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/269 variables, 18/75 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/269 variables, 8/83 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/269 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 1/270 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/270 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/270 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 91/361 variables, 45/130 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/361 variables, 2/132 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/361 variables, 22/154 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/361 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (OVERLAPS) 4/365 variables, 4/158 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/365 variables, 2/160 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/365 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 20 (OVERLAPS) 0/365 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 365/365 variables, and 160 constraints, problems are : Problem set: 0 solved, 8 unsolved in 496 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 104/104 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 795ms problems are : Problem set: 0 solved, 8 unsolved
Parikh walk visited 7 properties in 294 ms.
Support contains 1 out of 104 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 290/290 transitions.
Applied a total of 0 rules in 7 ms. Remains 104 /104 variables (removed 0) and now considering 290/290 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 104/104 places, 290/290 transitions.
RANDOM walk for 4000000 steps (256323 resets) in 5343 ms. (748 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4000004 steps (64896 resets) in 1807 ms. (2212 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1758 steps, run visited all 1 properties in 15 ms. (steps per millisecond=117 )
Probabilistic random walk after 1758 steps, saw 1083 distinct states, run finished after 19 ms. (steps per millisecond=92 ) properties seen :1
Able to resolve query StableMarking after proving 104 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PARIKH_WALK PROBABILISTIC_WALK MARKED_SUFFIX_TEST BESTFIRST_WALK TOPOLOGICAL
Total runtime 45362 ms.
ITS solved all properties within timeout

BK_STOP 1717361649721

--------------------
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 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-04"
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-04, 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-171734907600123"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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