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.r522-tall-171662353100028.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 QuasiCertifProtocol-COL-28, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r522-tall-171662353100028
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 640K
-rw-r--r-- 1 mcc users 7.5K Apr 13 03:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Apr 13 03:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Apr 13 03:37 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Apr 13 03:37 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.2K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 13 04:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 154K Apr 13 04:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 13 03:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 92K Apr 13 03:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 120K May 18 16:43 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 1717217993164

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=QuasiCertifProtocol-COL-28
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 04:59:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2024-06-01 04:59:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 04:59:54] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-06-01 04:59:54] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 04:59:55] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 612 ms
[2024-06-01 04:59:55] [INFO ] Imported 30 HL places and 26 HL transitions for a total of 2998 PT places and 446.0 transition bindings in 20 ms.
[2024-06-01 04:59:55] [INFO ] Built PT skeleton of HLPN with 30 places and 26 transitions 77 arcs in 4 ms.
[2024-06-01 04:59:55] [INFO ] Skeletonized 0 HLPN properties in 0 ms.
Structural test allowed to assert that 4 places are NOT stable. Took 4 ms.
RANDOM walk for 40034 steps (1019 resets) in 627 ms. (63 steps per ms) remains 2/26 properties
BEST_FIRST walk for 40002 steps (344 resets) in 142 ms. (279 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (345 resets) in 78 ms. (506 steps per ms) remains 2/2 properties
// Phase 1: matrix 26 rows 30 cols
[2024-06-01 04:59:55] [INFO ] Computed 5 invariants in 7 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 12/14 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 8/22 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 26/48 variables, 22/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/48 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 8/56 variables, 8/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/56 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/56 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 56/56 variables, and 35 constraints, problems are : Problem set: 0 solved, 2 unsolved in 164 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 12/14 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 8/22 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 26/48 variables, 22/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/48 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 8/56 variables, 8/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/56 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/56 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 56/56 variables, and 37 constraints, problems are : Problem set: 0 solved, 2 unsolved in 88 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 290ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 173 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=86 )
Parikh walk visited 2 properties in 7 ms.
Able to resolve query StableMarking after proving 27 properties.
[2024-06-01 04:59:55] [INFO ] Unfolded HLPN to a Petri net with 2998 places and 446 transitions 6489 arcs in 29 ms.
[2024-06-01 04:59:55] [INFO ] Unfolded 30 HLPN properties in 0 ms.
RANDOM walk for 40000 steps (1205 resets) in 3384 ms. (11 steps per ms) remains 21/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 100 ms. (39 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 110 ms. (36 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 94 ms. (42 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 21/21 properties
// Phase 1: matrix 446 rows 2998 cols
[2024-06-01 04:59:57] [INFO ] Computed 2553 invariants in 111 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2877 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2877 variables, 2521/2522 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2877 variables, 0/2522 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 63/2940 variables, 3/2525 constraints. Problems are: Problem set: 0 solved, 21 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2940/3444 variables, and 2525 constraints, problems are : Problem set: 0 solved, 21 unsolved in 5024 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 2521/2549 constraints, State Equation: 0/2998 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 21 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2877 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2877 variables, 2521/2522 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-06-01 05:00:05] [INFO ] Deduced a trap composed of 4 places in 829 ms of which 90 ms to minimize.
[2024-06-01 05:00:06] [INFO ] Deduced a trap composed of 4 places in 816 ms of which 13 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2877/3444 variables, and 2524 constraints, problems are : Problem set: 0 solved, 21 unsolved in 5021 ms.
Refiners :[Positive P Invariants (semi-flows): 1/4 constraints, Generalized P Invariants (flows): 2521/2549 constraints, State Equation: 0/2998 constraints, PredecessorRefiner: 0/21 constraints, Known Traps: 2/2 constraints]
After SMT, in 10365ms problems are : Problem set: 0 solved, 21 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2877 out of 2998 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2998/2998 places, 446/446 transitions.
Graph (complete) has 30318 edges and 2998 vertex of which 2996 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.16 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 59 transitions
Reduce isomorphic transitions removed 59 transitions.
Discarding 29 places :
Implicit places reduction removed 29 places
Iterating post reduction 0 with 88 rules applied. Total rules applied 89 place count 2967 transition count 387
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 29 Pre rules applied. Total rules applied 89 place count 2967 transition count 358
Deduced a syphon composed of 29 places in 2 ms
Ensure Unique test removed 57 places
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 1 with 115 rules applied. Total rules applied 204 place count 2881 transition count 358
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 204 place count 2881 transition count 357
Deduced a syphon composed of 1 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 3 rules applied. Total rules applied 207 place count 2879 transition count 357
Applied a total of 207 rules in 227 ms. Remains 2879 /2998 variables (removed 119) and now considering 357/446 (removed 89) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 237 ms. Remains : 2879/2998 places, 357/446 transitions.
RANDOM walk for 4000000 steps (153310 resets) in 107515 ms. (37 steps per ms) remains 9/21 properties
BEST_FIRST walk for 4000003 steps (7783 resets) in 10693 ms. (374 steps per ms) remains 9/9 properties
BEST_FIRST walk for 1497087 steps (2752 resets) in 20004 ms. (74 steps per ms) remains 9/9 properties
BEST_FIRST walk for 1476607 steps (2828 resets) in 20004 ms. (73 steps per ms) remains 9/9 properties
BEST_FIRST walk for 4000003 steps (7416 resets) in 12615 ms. (317 steps per ms) remains 9/9 properties
BEST_FIRST walk for 4000004 steps (7592 resets) in 12077 ms. (331 steps per ms) remains 9/9 properties
BEST_FIRST walk for 4000003 steps (7579 resets) in 12222 ms. (327 steps per ms) remains 9/9 properties
BEST_FIRST walk for 4000003 steps (7520 resets) in 12440 ms. (321 steps per ms) remains 9/9 properties
BEST_FIRST walk for 4000004 steps (7437 resets) in 10715 ms. (373 steps per ms) remains 9/9 properties
BEST_FIRST walk for 4000004 steps (7543 resets) in 12309 ms. (324 steps per ms) remains 9/9 properties
// Phase 1: matrix 357 rows 2879 cols
[2024-06-01 05:01:06] [INFO ] Computed 2522 invariants in 38 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1829 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1829 variables, 1653/1654 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1829 variables, 0/1654 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 841/2670 variables, 812/2466 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2670 variables, 0/2466 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 204/2874 variables, 2670/5136 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2874 variables, 0/5136 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 207/3081 variables, 89/5225 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3081/3236 variables, and 5225 constraints, problems are : Problem set: 0 solved, 9 unsolved in 45035 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 2465/2521 constraints, State Equation: 2759/2879 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1829 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1829 variables, 1653/1654 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-01 05:02:01] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1829 variables, 1/1655 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1829 variables, 0/1655 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 841/2670 variables, 812/2467 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-01 05:02:08] [INFO ] Deduced a trap composed of 4 places in 372 ms of which 6 ms to minimize.
[2024-06-01 05:02:08] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 1 ms to minimize.
[2024-06-01 05:02:09] [INFO ] Deduced a trap composed of 4 places in 286 ms of which 6 ms to minimize.
[2024-06-01 05:02:09] [INFO ] Deduced a trap composed of 4 places in 255 ms of which 4 ms to minimize.
[2024-06-01 05:02:09] [INFO ] Deduced a trap composed of 4 places in 233 ms of which 5 ms to minimize.
[2024-06-01 05:02:10] [INFO ] Deduced a trap composed of 4 places in 225 ms of which 5 ms to minimize.
[2024-06-01 05:02:10] [INFO ] Deduced a trap composed of 4 places in 214 ms of which 4 ms to minimize.
[2024-06-01 05:02:10] [INFO ] Deduced a trap composed of 4 places in 203 ms of which 4 ms to minimize.
[2024-06-01 05:02:10] [INFO ] Deduced a trap composed of 4 places in 203 ms of which 4 ms to minimize.
[2024-06-01 05:02:11] [INFO ] Deduced a trap composed of 4 places in 190 ms of which 4 ms to minimize.
[2024-06-01 05:02:11] [INFO ] Deduced a trap composed of 4 places in 181 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/2670 variables, 11/2478 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2670 variables, 0/2478 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 204/2874 variables, 2670/5148 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2874/3236 variables, and 5157 constraints, problems are : Problem set: 0 solved, 9 unsolved in 45041 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 2465/2521 constraints, State Equation: 2670/2879 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 12/12 constraints]
After SMT, in 90181ms problems are : Problem set: 0 solved, 9 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1829 out of 2879 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2879/2879 places, 357/357 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 91 transitions
Reduce isomorphic transitions removed 91 transitions.
Discarding 29 places :
Implicit places reduction removed 29 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 122 rules applied. Total rules applied 122 place count 2850 transition count 264
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 124 place count 2848 transition count 264
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 29 Pre rules applied. Total rules applied 124 place count 2848 transition count 235
Deduced a syphon composed of 29 places in 7 ms
Ensure Unique test removed 29 places
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 2 with 87 rules applied. Total rules applied 211 place count 2790 transition count 235
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 2 with 1 rules applied. Total rules applied 212 place count 2790 transition count 234
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 213 place count 2789 transition count 234
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 58
Deduced a syphon composed of 58 places in 1 ms
Ensure Unique test removed 841 places
Reduce places removed 899 places and 0 transitions.
Iterating global reduction 4 with 957 rules applied. Total rules applied 1170 place count 1890 transition count 176
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1171 place count 1889 transition count 175
Ensure Unique test removed 29 places
Iterating post reduction 4 with 29 rules applied. Total rules applied 1200 place count 1860 transition count 175
Applied a total of 1200 rules in 310 ms. Remains 1860 /2879 variables (removed 1019) and now considering 175/357 (removed 182) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 310 ms. Remains : 1860/2879 places, 175/357 transitions.
RANDOM walk for 420 steps (0 resets) in 39 ms. (10 steps per ms) remains 0/9 properties
Able to resolve query StableMarking after proving 30 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK TOPOLOGICAL
Total runtime 162520 ms.
ITS solved all properties within timeout

BK_STOP 1717218156863

--------------------
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="QuasiCertifProtocol-COL-28"
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 QuasiCertifProtocol-COL-28, 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 r522-tall-171662353100028"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/QuasiCertifProtocol-COL-28.tgz
mv QuasiCertifProtocol-COL-28 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 ;