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.r560-tall-171734905700128.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 greatspnxred
Input is FireWire-PT-05, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r560-tall-171734905700128
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 6.1K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K 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.3K 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 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 9.7K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 107K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K 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 91K 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 1717351645110

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=FireWire-PT-05
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-02 18:07:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2024-06-02 18:07:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:07:26] [INFO ] Load time of PNML (sax parser for PT used): 76 ms
[2024-06-02 18:07:26] [INFO ] Transformed 114 places.
[2024-06-02 18:07:26] [INFO ] Transformed 373 transitions.
[2024-06-02 18:07:26] [INFO ] Found NUPN structural information;
[2024-06-02 18:07:26] [INFO ] Parsed PT model containing 114 places and 373 transitions and 1389 arcs in 173 ms.
Structural test allowed to assert that 10 places are NOT stable. Took 6 ms.
Ensure Unique test removed 57 transitions
Reduce redundant transitions removed 57 transitions.
RANDOM walk for 40000 steps (2268 resets) in 1982 ms. (20 steps per ms) remains 42/104 properties
BEST_FIRST walk for 4003 steps (53 resets) in 35 ms. (111 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (68 resets) in 16 ms. (235 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (61 resets) in 15 ms. (250 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4001 steps (74 resets) in 38 ms. (102 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (52 resets) in 38 ms. (102 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (46 resets) in 42 ms. (93 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (54 resets) in 25 ms. (154 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (68 resets) in 21 ms. (181 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (63 resets) in 20 ms. (190 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (60 resets) in 25 ms. (153 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (55 resets) in 12 ms. (308 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (61 resets) in 12 ms. (307 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (62 resets) in 11 ms. (333 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (59 resets) in 30 ms. (129 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (62 resets) in 19 ms. (200 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (64 resets) in 22 ms. (174 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (61 resets) in 28 ms. (138 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (69 resets) in 30 ms. (129 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (72 resets) in 21 ms. (181 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (61 resets) in 12 ms. (307 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (51 resets) in 10 ms. (363 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (52 resets) in 27 ms. (142 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (67 resets) in 12 ms. (308 steps per ms) remains 40/42 properties
BEST_FIRST walk for 4003 steps (54 resets) in 20 ms. (190 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (55 resets) in 12 ms. (308 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (75 resets) in 13 ms. (285 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (66 resets) in 10 ms. (363 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (58 resets) in 14 ms. (266 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (64 resets) in 13 ms. (285 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (58 resets) in 31 ms. (125 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (68 resets) in 14 ms. (266 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (58 resets) in 13 ms. (285 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (46 resets) in 13 ms. (285 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (49 resets) in 13 ms. (285 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (56 resets) in 15 ms. (250 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (56 resets) in 12 ms. (307 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (70 resets) in 15 ms. (250 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (66 resets) in 13 ms. (285 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 (59 resets) in 16 ms. (235 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (54 resets) in 14 ms. (266 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
[2024-06-02 18:07:27] [INFO ] Flow matrix only has 284 transitions (discarded 32 similar events)
// Phase 1: matrix 284 rows 114 cols
[2024-06-02 18:07:27] [INFO ] Computed 8 invariants in 19 ms
[2024-06-02 18:07:27] [INFO ] State equation strengthened by 40 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 65/105 variables, 5/45 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 65/110 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (OVERLAPS) 8/113 variables, 3/113 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/113 variables, 8/121 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/113 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 8 (OVERLAPS) 283/396 variables, 113/234 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/396 variables, 39/273 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/396 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 11 (OVERLAPS) 1/397 variables, 1/274 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/397 variables, 1/275 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/397 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 14 (OVERLAPS) 1/398 variables, 1/276 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/398 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 16 (OVERLAPS) 0/398 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Real declared 398/398 variables, and 276 constraints, problems are : Problem set: 0 solved, 40 unsolved in 1724 ms.
Refiners :[Domain max(s): 114/114 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 114/114 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 40 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 65/105 variables, 5/45 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 65/110 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-06-02 18:07:29] [INFO ] Deduced a trap composed of 13 places in 94 ms of which 11 ms to minimize.
[2024-06-02 18:07:29] [INFO ] Deduced a trap composed of 71 places in 72 ms of which 2 ms to minimize.
[2024-06-02 18:07:29] [INFO ] Deduced a trap composed of 36 places in 32 ms of which 1 ms to minimize.
[2024-06-02 18:07:29] [INFO ] Deduced a trap composed of 40 places in 41 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 4/114 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (OVERLAPS) 8/113 variables, 3/117 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/113 variables, 8/125 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-06-02 18:07:30] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/113 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/113 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 10 (OVERLAPS) 283/396 variables, 113/239 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/396 variables, 39/278 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/396 variables, 40/318 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-06-02 18:07:30] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/396 variables, 1/319 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/396 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 15 (OVERLAPS) 1/397 variables, 1/320 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/397 variables, 1/321 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/397 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 18 (OVERLAPS) 1/398 variables, 1/322 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/398 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 20 (OVERLAPS) 0/398 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Int declared 398/398 variables, and 322 constraints, problems are : Problem set: 0 solved, 40 unsolved in 3867 ms.
Refiners :[Domain max(s): 114/114 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 114/114 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 6/6 constraints]
After SMT, in 5694ms problems are : Problem set: 0 solved, 40 unsolved
Fused 40 Parikh solutions to 38 different solutions.
Parikh walk visited 35 properties in 2971 ms.
Support contains 5 out of 114 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 114/114 places, 316/316 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 114 transition count 312
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 5 place count 113 transition count 312
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 113 transition count 311
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 112 transition count 311
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 9 place count 110 transition count 307
Iterating global reduction 2 with 2 rules applied. Total rules applied 11 place count 110 transition count 307
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 13 place count 110 transition count 305
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 19 place count 107 transition count 311
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 25 place count 107 transition count 305
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 34 place count 107 transition count 296
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 35 place count 107 transition count 298
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 4 with 3 rules applied. Total rules applied 38 place count 106 transition count 296
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 40 place count 106 transition count 294
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 41 place count 105 transition count 293
Applied a total of 41 rules in 145 ms. Remains 105 /114 variables (removed 9) and now considering 293/316 (removed 23) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 155 ms. Remains : 105/114 places, 293/316 transitions.
RANDOM walk for 4000000 steps (257119 resets) in 10694 ms. (374 steps per ms) remains 3/5 properties
BEST_FIRST walk for 4000003 steps (64713 resets) in 2872 ms. (1392 steps per ms) remains 3/3 properties
BEST_FIRST walk for 4000004 steps (64860 resets) in 3002 ms. (1332 steps per ms) remains 3/3 properties
BEST_FIRST walk for 4000002 steps (65193 resets) in 2951 ms. (1355 steps per ms) remains 3/3 properties
[2024-06-02 18:07:42] [INFO ] Flow matrix only has 264 transitions (discarded 29 similar events)
// Phase 1: matrix 264 rows 105 cols
[2024-06-02 18:07:42] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 18:07:42] [INFO ] State equation strengthened by 40 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 37/40 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 120/160 variables, 40/41 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/160 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 113/273 variables, 15/56 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/273 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/273 variables, 18/76 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/273 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 1/274 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/274 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/274 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 91/365 variables, 45/123 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/365 variables, 2/125 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/365 variables, 22/147 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/365 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 4/369 variables, 4/151 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/369 variables, 2/153 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/369 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 0/369 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 369/369 variables, and 153 constraints, problems are : Problem set: 0 solved, 3 unsolved in 292 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 105/105 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 37/40 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 120/160 variables, 40/41 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/160 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 113/273 variables, 15/56 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/273 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/273 variables, 18/76 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/273 variables, 3/79 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/273 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 1/274 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/274 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/274 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 91/365 variables, 45/126 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/365 variables, 2/128 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/365 variables, 22/150 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/365 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 4/369 variables, 4/154 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/369 variables, 2/156 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/369 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 0/369 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 369/369 variables, and 156 constraints, problems are : Problem set: 0 solved, 3 unsolved in 254 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 105/105 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 564ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 293/293 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 104 transition count 291
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 104 transition count 291
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 104 transition count 290
Applied a total of 3 rules in 16 ms. Remains 104 /105 variables (removed 1) and now considering 290/293 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 104/105 places, 290/293 transitions.
RANDOM walk for 4000000 steps (256559 resets) in 8707 ms. (459 steps per ms) remains 3/3 properties
BEST_FIRST walk for 4000004 steps (64250 resets) in 3214 ms. (1244 steps per ms) remains 3/3 properties
BEST_FIRST walk for 4000002 steps (64719 resets) in 3001 ms. (1332 steps per ms) remains 3/3 properties
BEST_FIRST walk for 4000003 steps (64398 resets) in 2971 ms. (1345 steps per ms) remains 3/3 properties
Finished probabilistic random walk after 1331 steps, run visited all 3 properties in 23 ms. (steps per millisecond=57 )
Probabilistic random walk after 1331 steps, saw 888 distinct states, run finished after 27 ms. (steps per millisecond=49 ) properties seen :3
Able to resolve query StableMarking after proving 105 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PARIKH_WALK PROBABILISTIC_WALK MARKED_SUFFIX_TEST BESTFIRST_WALK TOPOLOGICAL
Total runtime 22178 ms.
ITS solved all properties within timeout

BK_STOP 1717351668617

--------------------
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-05"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is FireWire-PT-05, 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 r560-tall-171734905700128"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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