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-171734907600108.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is FireWire-PT-01, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r564-tall-171734907600108
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 5.8K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 10K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 84K Jun 2 16:33 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME StableMarking

=== Now, execution of the tool begins

BK_START 1717361547255

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-01
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 20:52:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2024-06-02 20:52:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 20:52:28] [INFO ] Load time of PNML (sax parser for PT used): 75 ms
[2024-06-02 20:52:28] [INFO ] Transformed 107 places.
[2024-06-02 20:52:28] [INFO ] Transformed 346 transitions.
[2024-06-02 20:52:28] [INFO ] Found NUPN structural information;
[2024-06-02 20:52:28] [INFO ] Parsed PT model containing 107 places and 346 transitions and 1271 arcs in 168 ms.
Structural test allowed to assert that 10 places are NOT stable. Took 8 ms.
Ensure Unique test removed 53 transitions
Reduce redundant transitions removed 53 transitions.
RANDOM walk for 40000 steps (2225 resets) in 1971 ms. (20 steps per ms) remains 35/97 properties
BEST_FIRST walk for 4003 steps (47 resets) in 65 ms. (60 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (76 resets) in 47 ms. (83 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (54 resets) in 31 ms. (125 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (57 resets) in 23 ms. (166 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (67 resets) in 32 ms. (121 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (61 resets) in 24 ms. (160 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (51 resets) in 13 ms. (285 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (75 resets) in 20 ms. (190 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (51 resets) in 19 ms. (200 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (53 resets) in 11 ms. (333 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (58 resets) in 27 ms. (142 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (63 resets) in 31 ms. (125 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (54 resets) in 12 ms. (308 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (54 resets) in 12 ms. (308 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4001 steps (74 resets) in 13 ms. (285 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (66 resets) in 32 ms. (121 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (63 resets) in 12 ms. (307 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (57 resets) in 11 ms. (333 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (46 resets) in 11 ms. (333 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (52 resets) in 10 ms. (363 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (49 resets) in 14 ms. (266 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (54 resets) in 21 ms. (181 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (64 resets) in 31 ms. (125 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (67 resets) in 24 ms. (160 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (61 resets) in 18 ms. (210 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4001 steps (57 resets) in 16 ms. (235 steps per ms) remains 34/35 properties
BEST_FIRST walk for 4004 steps (58 resets) in 30 ms. (129 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (51 resets) in 28 ms. (138 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (46 resets) in 31 ms. (125 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (62 resets) in 22 ms. (174 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (61 resets) in 18 ms. (210 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (52 resets) in 38 ms. (102 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (59 resets) in 23 ms. (166 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (52 resets) in 11 ms. (333 steps per ms) remains 34/34 properties
[2024-06-02 20:52:29] [INFO ] Flow matrix only has 261 transitions (discarded 32 similar events)
// Phase 1: matrix 261 rows 107 cols
[2024-06-02 20:52:29] [INFO ] Computed 8 invariants in 12 ms
[2024-06-02 20:52:29] [INFO ] State equation strengthened by 40 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) 64/98 variables, 5/39 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 64/103 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 5 (OVERLAPS) 8/106 variables, 3/106 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 8/114 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/106 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 8 (OVERLAPS) 260/366 variables, 106/220 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/366 variables, 39/259 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/366 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 11 (OVERLAPS) 1/367 variables, 1/260 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/367 variables, 1/261 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/367 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 14 (OVERLAPS) 1/368 variables, 1/262 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/368 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 16 (OVERLAPS) 0/368 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 34 unsolved
No progress, stopping.
After SMT solving in domain Real declared 368/368 variables, and 262 constraints, problems are : Problem set: 0 solved, 34 unsolved in 1423 ms.
Refiners :[Domain max(s): 107/107 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 107/107 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 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) 64/98 variables, 5/39 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 64/103 constraints. Problems are: Problem set: 0 solved, 34 unsolved
[2024-06-02 20:52:31] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 12 ms to minimize.
[2024-06-02 20:52:31] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 2 ms to minimize.
[2024-06-02 20:52:31] [INFO ] Deduced a trap composed of 37 places in 36 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 3/106 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 6 (OVERLAPS) 8/106 variables, 3/109 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/106 variables, 8/117 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/106 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 9 (OVERLAPS) 260/366 variables, 106/223 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/366 variables, 39/262 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/366 variables, 34/296 constraints. Problems are: Problem set: 0 solved, 34 unsolved
[2024-06-02 20:52:32] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/366 variables, 1/297 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/366 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 14 (OVERLAPS) 1/367 variables, 1/298 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/367 variables, 1/299 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/367 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 17 (OVERLAPS) 1/368 variables, 1/300 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/368 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 19 (OVERLAPS) 0/368 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 34 unsolved
No progress, stopping.
After SMT solving in domain Int declared 368/368 variables, and 300 constraints, problems are : Problem set: 0 solved, 34 unsolved in 2605 ms.
Refiners :[Domain max(s): 107/107 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 107/107 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 34/34 constraints, Known Traps: 4/4 constraints]
After SMT, in 4097ms problems are : Problem set: 0 solved, 34 unsolved
Parikh walk visited 0 properties in 1719 ms.
Support contains 34 out of 107 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 107/107 places, 293/293 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 107 transition count 289
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 5 place count 106 transition count 289
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 5 place count 106 transition count 288
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 105 transition count 288
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 11 place count 103 transition count 292
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 103 transition count 288
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 103 transition count 280
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 24 place count 103 transition count 282
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 3 with 3 rules applied. Total rules applied 27 place count 102 transition count 280
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 29 place count 102 transition count 278
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 31 place count 102 transition count 278
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 32 place count 101 transition count 277
Applied a total of 32 rules in 80 ms. Remains 101 /107 variables (removed 6) and now considering 277/293 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 90 ms. Remains : 101/107 places, 277/293 transitions.
RANDOM walk for 4000000 steps (256359 resets) in 15601 ms. (256 steps per ms) remains 14/34 properties
BEST_FIRST walk for 4000003 steps (64770 resets) in 3902 ms. (1024 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000002 steps (64571 resets) in 3813 ms. (1048 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000004 steps (64629 resets) in 3677 ms. (1087 steps per ms) remains 13/14 properties
BEST_FIRST walk for 4000002 steps (64182 resets) in 3646 ms. (1096 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4000003 steps (64101 resets) in 3638 ms. (1099 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4000002 steps (64514 resets) in 3536 ms. (1130 steps per ms) remains 8/13 properties
BEST_FIRST walk for 4000002 steps (64247 resets) in 2813 ms. (1421 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4000003 steps (64795 resets) in 2849 ms. (1403 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4000004 steps (64999 resets) in 2824 ms. (1415 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4000003 steps (65215 resets) in 2839 ms. (1408 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4000004 steps (64777 resets) in 2843 ms. (1406 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4000003 steps (64801 resets) in 2829 ms. (1413 steps per ms) remains 8/8 properties
[2024-06-02 20:52:51] [INFO ] Flow matrix only has 250 transitions (discarded 27 similar events)
// Phase 1: matrix 250 rows 101 cols
[2024-06-02 20:52:51] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 20:52:51] [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, 8/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 32/40 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 32/41 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 115/155 variables, 40/81 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/155 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 102/257 variables, 15/96 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/257 variables, 15/111 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/257 variables, 2/113 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/257 variables, 18/131 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/257 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 1/258 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/258 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/258 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/258 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (OVERLAPS) 87/345 variables, 41/175 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/345 variables, 41/216 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/345 variables, 2/218 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/345 variables, 22/240 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/345 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 21 (OVERLAPS) 6/351 variables, 4/244 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/351 variables, 4/248 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/351 variables, 2/250 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/351 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 25 (OVERLAPS) 0/351 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 351/351 variables, and 250 constraints, problems are : Problem set: 0 solved, 8 unsolved in 307 ms.
Refiners :[Domain max(s): 101/101 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 101/101 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, 8/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 32/40 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 32/41 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 115/155 variables, 40/81 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/155 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 102/257 variables, 15/96 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/257 variables, 15/111 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/257 variables, 2/113 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/257 variables, 18/131 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/257 variables, 8/139 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/257 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 1/258 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/258 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/258 variables, 1/142 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/258 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (OVERLAPS) 87/345 variables, 41/183 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/345 variables, 41/224 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/345 variables, 2/226 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/345 variables, 22/248 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-02 20:52:52] [INFO ] Deduced a trap composed of 32 places in 65 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/345 variables, 1/249 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/345 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 23 (OVERLAPS) 6/351 variables, 4/253 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/351 variables, 4/257 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/351 variables, 2/259 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/351 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 27 (OVERLAPS) 0/351 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 351/351 variables, and 259 constraints, problems are : Problem set: 0 solved, 8 unsolved in 603 ms.
Refiners :[Domain max(s): 101/101 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 101/101 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 1/1 constraints]
After SMT, in 921ms problems are : Problem set: 0 solved, 8 unsolved
Parikh walk visited 0 properties in 1 ms.
Support contains 8 out of 101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 277/277 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 98 transition count 269
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 98 transition count 269
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 96 transition count 265
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 96 transition count 265
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 95 transition count 270
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 14 place count 95 transition count 268
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 15 place count 95 transition count 267
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 95 transition count 266
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 18 place count 94 transition count 265
Applied a total of 18 rules in 40 ms. Remains 94 /101 variables (removed 7) and now considering 265/277 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 94/101 places, 265/277 transitions.
RANDOM walk for 4000000 steps (257086 resets) in 9684 ms. (413 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4000002 steps (64583 resets) in 2827 ms. (1414 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4000002 steps (64534 resets) in 2887 ms. (1385 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4000003 steps (64473 resets) in 2967 ms. (1347 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4000001 steps (65308 resets) in 3011 ms. (1328 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4000003 steps (64750 resets) in 3007 ms. (1329 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4000001 steps (64536 resets) in 2946 ms. (1357 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4000004 steps (65045 resets) in 2831 ms. (1412 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4000004 steps (65301 resets) in 2844 ms. (1405 steps per ms) remains 8/8 properties
Finished probabilistic random walk after 3972 steps, run visited all 8 properties in 35 ms. (steps per millisecond=113 )
Probabilistic random walk after 3972 steps, saw 1971 distinct states, run finished after 39 ms. (steps per millisecond=101 ) properties seen :8
Able to resolve query StableMarking after proving 98 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PROBABILISTIC_WALK MARKED_SUFFIX_TEST BESTFIRST_WALK TOPOLOGICAL
Total runtime 34425 ms.
ITS solved all properties within timeout

BK_STOP 1717361582846

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

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