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.r466-smll-171620124700213.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 Anderson-PT-07, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r466-smll-171620124700213
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 920K
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 19 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 19 17:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 15:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 131K Apr 12 15:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 12 15:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K Apr 12 15:40 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:27 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 461K May 18 16:42 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 1717201044825

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=Anderson-PT-07
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 00:17:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2024-06-01 00:17:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 00:17:28] [INFO ] Load time of PNML (sax parser for PT used): 328 ms
[2024-06-01 00:17:28] [INFO ] Transformed 309 places.
[2024-06-01 00:17:28] [INFO ] Transformed 917 transitions.
[2024-06-01 00:17:28] [INFO ] Found NUPN structural information;
[2024-06-01 00:17:28] [INFO ] Parsed PT model containing 309 places and 917 transitions and 3500 arcs in 592 ms.
RANDOM walk for 40000 steps (8 resets) in 4472 ms. (8 steps per ms) remains 25/309 properties
BEST_FIRST walk for 4004 steps (8 resets) in 92 ms. (43 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 74 ms. (53 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (8 resets) in 40 ms. (97 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (8 resets) in 68 ms. (58 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 76 ms. (51 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (8 resets) in 21 ms. (181 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 47 ms. (83 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (8 resets) in 41 ms. (95 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (8 resets) in 18 ms. (210 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 37 ms. (105 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (8 resets) in 20 ms. (190 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 33 ms. (117 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (8 resets) in 21 ms. (181 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (8 resets) in 22 ms. (174 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (8 resets) in 21 ms. (181 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (8 resets) in 47 ms. (83 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (8 resets) in 20 ms. (190 steps per ms) remains 25/25 properties
// Phase 1: matrix 917 rows 309 cols
[2024-06-01 00:17:30] [INFO ] Computed 17 invariants in 57 ms
[2024-06-01 00:17:30] [INFO ] State equation strengthened by 42 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 2 (OVERLAPS) 264/289 variables, 7/32 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/289 variables, 264/296 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/289 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 5 (OVERLAPS) 7/296 variables, 1/297 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/296 variables, 7/304 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/296 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 8 (OVERLAPS) 13/309 variables, 9/313 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/309 variables, 13/326 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/309 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 11 (OVERLAPS) 917/1226 variables, 309/635 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1226 variables, 42/677 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1226 variables, 0/677 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 14 (OVERLAPS) 0/1226 variables, 0/677 constraints. Problems are: Problem set: 0 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1226/1226 variables, and 677 constraints, problems are : Problem set: 0 solved, 25 unsolved in 3805 ms.
Refiners :[Domain max(s): 309/309 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 309/309 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 25 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 2 (OVERLAPS) 264/289 variables, 7/32 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/289 variables, 264/296 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/289 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 5 (OVERLAPS) 7/296 variables, 1/297 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/296 variables, 7/304 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/296 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 8 (OVERLAPS) 13/309 variables, 9/313 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/309 variables, 13/326 constraints. Problems are: Problem set: 0 solved, 25 unsolved
[2024-06-01 00:17:35] [INFO ] Deduced a trap composed of 161 places in 448 ms of which 49 ms to minimize.
[2024-06-01 00:17:36] [INFO ] Deduced a trap composed of 119 places in 364 ms of which 5 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/309 variables, 2/328 constraints. Problems are: Problem set: 0 solved, 25 unsolved
[2024-06-01 00:17:37] [INFO ] Deduced a trap composed of 100 places in 308 ms of which 4 ms to minimize.
[2024-06-01 00:17:37] [INFO ] Deduced a trap composed of 128 places in 291 ms of which 4 ms to minimize.
[2024-06-01 00:17:37] [INFO ] Deduced a trap composed of 133 places in 378 ms of which 5 ms to minimize.
[2024-06-01 00:17:38] [INFO ] Deduced a trap composed of 109 places in 275 ms of which 4 ms to minimize.
[2024-06-01 00:17:38] [INFO ] Deduced a trap composed of 66 places in 253 ms of which 3 ms to minimize.
[2024-06-01 00:17:38] [INFO ] Deduced a trap composed of 159 places in 294 ms of which 5 ms to minimize.
[2024-06-01 00:17:38] [INFO ] Deduced a trap composed of 164 places in 343 ms of which 5 ms to minimize.
[2024-06-01 00:17:39] [INFO ] Deduced a trap composed of 93 places in 469 ms of which 5 ms to minimize.
SMT process timed out in 9122ms, After SMT, problems are : Problem set: 0 solved, 25 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 25 out of 309 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 309/309 places, 917/917 transitions.
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 19 Pre rules applied. Total rules applied 0 place count 309 transition count 898
Deduced a syphon composed of 19 places in 6 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 0 with 38 rules applied. Total rules applied 38 place count 290 transition count 898
Discarding 61 places :
Symmetric choice reduction at 0 with 61 rule applications. Total rules 99 place count 229 transition count 333
Iterating global reduction 0 with 61 rules applied. Total rules applied 160 place count 229 transition count 333
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 1 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 0 with 46 rules applied. Total rules applied 206 place count 206 transition count 310
Applied a total of 206 rules in 218 ms. Remains 206 /309 variables (removed 103) and now considering 310/917 (removed 607) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 241 ms. Remains : 206/309 places, 310/917 transitions.
RANDOM walk for 4000000 steps (8 resets) in 23318 ms. (171 steps per ms) remains 12/25 properties
BEST_FIRST walk for 4000002 steps (8 resets) in 8264 ms. (483 steps per ms) remains 8/12 properties
BEST_FIRST walk for 4000003 steps (8 resets) in 6674 ms. (599 steps per ms) remains 6/8 properties
BEST_FIRST walk for 4000001 steps (8 resets) in 5674 ms. (704 steps per ms) remains 5/6 properties
BEST_FIRST walk for 4000001 steps (8 resets) in 5765 ms. (693 steps per ms) remains 5/5 properties
BEST_FIRST walk for 4000003 steps (8 resets) in 5163 ms. (774 steps per ms) remains 5/5 properties
BEST_FIRST walk for 4000002 steps (8 resets) in 5226 ms. (765 steps per ms) remains 4/5 properties
BEST_FIRST walk for 4000003 steps (8 resets) in 4558 ms. (877 steps per ms) remains 4/4 properties
// Phase 1: matrix 310 rows 206 cols
[2024-06-01 00:17:59] [INFO ] Computed 17 invariants in 10 ms
[2024-06-01 00:17:59] [INFO ] State equation strengthened by 42 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 184/188 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/188 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 10/198 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/198 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 8/206 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/206 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 310/516 variables, 206/223 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/516 variables, 42/265 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/516 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 0/516 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 516/516 variables, and 265 constraints, problems are : Problem set: 0 solved, 4 unsolved in 426 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 206/206 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 184/188 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/188 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 10/198 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/198 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 8/206 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/206 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 310/516 variables, 206/223 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/516 variables, 42/265 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/516 variables, 4/269 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/516 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 0/516 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 516/516 variables, and 269 constraints, problems are : Problem set: 0 solved, 4 unsolved in 807 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 206/206 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 1261ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 499 ms.
Support contains 4 out of 206 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 310/310 transitions.
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 0 with 38 rules applied. Total rules applied 38 place count 187 transition count 291
Applied a total of 38 rules in 47 ms. Remains 187 /206 variables (removed 19) and now considering 291/310 (removed 19) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 187/206 places, 291/310 transitions.
RANDOM walk for 4000000 steps (8 resets) in 10564 ms. (378 steps per ms) remains 2/4 properties
BEST_FIRST walk for 4000002 steps (8 resets) in 3872 ms. (1032 steps per ms) remains 2/2 properties
BEST_FIRST walk for 4000002 steps (8 resets) in 4017 ms. (995 steps per ms) remains 2/2 properties
// Phase 1: matrix 291 rows 187 cols
[2024-06-01 00:18:07] [INFO ] Computed 17 invariants in 3 ms
[2024-06-01 00:18:07] [INFO ] State equation strengthened by 42 read => feed constraints.
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) 165/167 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/167 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 12/179 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 8/187 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/187 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 291/478 variables, 187/204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/478 variables, 42/246 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/478 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/478 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 478/478 variables, and 246 constraints, problems are : Problem set: 0 solved, 2 unsolved in 347 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 187/187 constraints, ReadFeed: 42/42 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) 165/167 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/167 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 12/179 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 8/187 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/187 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 291/478 variables, 187/204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/478 variables, 42/246 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/478 variables, 2/248 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/478 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/478 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 478/478 variables, and 248 constraints, problems are : Problem set: 0 solved, 2 unsolved in 561 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 187/187 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 932ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 110 ms.
Support contains 2 out of 187 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 187/187 places, 291/291 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 185 transition count 289
Applied a total of 4 rules in 34 ms. Remains 185 /187 variables (removed 2) and now considering 289/291 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 185/187 places, 289/291 transitions.
RANDOM walk for 4000000 steps (8 resets) in 9173 ms. (436 steps per ms) remains 2/2 properties
BEST_FIRST walk for 4000003 steps (8 resets) in 3838 ms. (1041 steps per ms) remains 2/2 properties
BEST_FIRST walk for 4000001 steps (8 resets) in 3800 ms. (1052 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 14054 steps, run visited all 2 properties in 81 ms. (steps per millisecond=173 )
Probabilistic random walk after 14054 steps, saw 8551 distinct states, run finished after 88 ms. (steps per millisecond=159 ) properties seen :2
Able to resolve query StableMarking after proving 309 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PROBABILISTIC_WALK BESTFIRST_WALK TOPOLOGICAL
Total runtime 45609 ms.
ITS solved all properties within timeout

BK_STOP 1717201093086

--------------------
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="Anderson-PT-07"
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 Anderson-PT-07, 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 r466-smll-171620124700213"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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