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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 716K
-rw-r--r-- 1 mcc users 14K Apr 13 03:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 122K Apr 13 03:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Apr 13 03:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 69K Apr 13 03:50 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 7.3K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 41K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.0K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 23K Apr 13 03:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 179K Apr 13 03:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 13 03:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K Apr 13 03:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.9K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 78K 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 1717218089178

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=QuasiCertifProtocol-PT-06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 05:01:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2024-06-01 05:01:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 05:01:30] [INFO ] Load time of PNML (sax parser for PT used): 65 ms
[2024-06-01 05:01:30] [INFO ] Transformed 270 places.
[2024-06-01 05:01:30] [INFO ] Transformed 116 transitions.
[2024-06-01 05:01:30] [INFO ] Parsed PT model containing 270 places and 116 transitions and 659 arcs in 158 ms.
Structural test allowed to assert that 10 places are NOT stable. Took 7 ms.
RANDOM walk for 40000 steps (3928 resets) in 2657 ms. (15 steps per ms) remains 236/260 properties
BEST_FIRST walk for 402 steps (8 resets) in 8 ms. (44 steps per ms) remains 236/236 properties
BEST_FIRST walk for 402 steps (8 resets) in 6 ms. (57 steps per ms) remains 236/236 properties
BEST_FIRST walk for 401 steps (8 resets) in 8 ms. (44 steps per ms) remains 236/236 properties
BEST_FIRST walk for 401 steps (8 resets) in 12 ms. (30 steps per ms) remains 236/236 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 236/236 properties
BEST_FIRST walk for 402 steps (8 resets) in 9 ms. (40 steps per ms) remains 236/236 properties
BEST_FIRST walk for 402 steps (8 resets) in 10 ms. (36 steps per ms) remains 236/236 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 236/236 properties
BEST_FIRST walk for 402 steps (8 resets) in 8 ms. (44 steps per ms) remains 236/236 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 236/236 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 236/236 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 236/236 properties
BEST_FIRST walk for 402 steps (8 resets) in 12 ms. (30 steps per ms) remains 236/236 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 236/236 properties
BEST_FIRST walk for 402 steps (8 resets) in 9 ms. (40 steps per ms) remains 236/236 properties
BEST_FIRST walk for 402 steps (8 resets) in 9 ms. (40 steps per ms) remains 236/236 properties
BEST_FIRST walk for 402 steps (8 resets) in 10 ms. (36 steps per ms) remains 236/236 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 236/236 properties
BEST_FIRST walk for 401 steps (8 resets) in 13 ms. (28 steps per ms) remains 236/236 properties
BEST_FIRST walk for 403 steps (8 resets) in 11 ms. (33 steps per ms) remains 236/236 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 236/236 properties
BEST_FIRST walk for 403 steps (8 resets) in 12 ms. (31 steps per ms) remains 236/236 properties
BEST_FIRST walk for 401 steps (8 resets) in 9 ms. (40 steps per ms) remains 236/236 properties
BEST_FIRST walk for 401 steps (8 resets) in 9 ms. (40 steps per ms) remains 236/236 properties
BEST_FIRST walk for 402 steps (8 resets) in 13 ms. (28 steps per ms) remains 236/236 properties
BEST_FIRST walk for 400 steps (8 resets) in 8 ms. (44 steps per ms) remains 236/236 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 236/236 properties
BEST_FIRST walk for 402 steps (8 resets) in 8 ms. (44 steps per ms) remains 236/236 properties
BEST_FIRST walk for 403 steps (8 resets) in 11 ms. (33 steps per ms) remains 236/236 properties
BEST_FIRST walk for 400 steps (8 resets) in 10 ms. (36 steps per ms) remains 236/236 properties
BEST_FIRST walk for 401 steps (8 resets) in 8 ms. (44 steps per ms) remains 236/236 properties
BEST_FIRST walk for 402 steps (8 resets) in 12 ms. (30 steps per ms) remains 236/236 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 236/236 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 236/236 properties
BEST_FIRST walk for 401 steps (8 resets) in 16 ms. (23 steps per ms) remains 236/236 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 236/236 properties
BEST_FIRST walk for 401 steps (8 resets) in 13 ms. (28 steps per ms) remains 236/236 properties
BEST_FIRST walk for 403 steps (8 resets) in 13 ms. (28 steps per ms) remains 236/236 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 236/236 properties
BEST_FIRST walk for 401 steps (8 resets) in 8 ms. (44 steps per ms) remains 236/236 properties
BEST_FIRST walk for 402 steps (8 resets) in 8 ms. (44 steps per ms) remains 236/236 properties
BEST_FIRST walk for 403 steps (8 resets) in 19 ms. (20 steps per ms) remains 236/236 properties
BEST_FIRST walk for 401 steps (8 resets) in 14 ms. (26 steps per ms) remains 236/236 properties
BEST_FIRST walk for 402 steps (8 resets) in 13 ms. (28 steps per ms) remains 236/236 properties
BEST_FIRST walk for 402 steps (8 resets) in 10 ms. (36 steps per ms) remains 236/236 properties
BEST_FIRST walk for 402 steps (8 resets) in 14 ms. (26 steps per ms) remains 236/236 properties
BEST_FIRST walk for 401 steps (8 resets) in 5 ms. (66 steps per ms) remains 236/236 properties
BEST_FIRST walk for 402 steps (8 resets) in 5 ms. (67 steps per ms) remains 236/236 properties
BEST_FIRST walk for 401 steps (8 resets) in 5 ms. (66 steps per ms) remains 236/236 properties
BEST_FIRST walk for 400 steps (8 resets) in 7 ms. (50 steps per ms) remains 236/236 properties
// Phase 1: matrix 116 rows 270 cols
[2024-06-01 05:01:31] [INFO ] Computed 155 invariants in 27 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 146/146 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/236 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 2 (OVERLAPS) 20/256 variables, 3/149 constraints. Problems are: Problem set: 0 solved, 236 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 256/386 variables, and 149 constraints, problems are : Problem set: 0 solved, 236 unsolved in 5042 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 146/152 constraints, State Equation: 0/270 constraints, PredecessorRefiner: 236/236 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 236 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 146/146 constraints. Problems are: Problem set: 0 solved, 236 unsolved
[2024-06-01 05:01:37] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 9 ms to minimize.
[2024-06-01 05:01:37] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 12 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/236 variables, 2/148 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 3 (OVERLAPS) 20/256 variables, 3/151 constraints. Problems are: Problem set: 0 solved, 236 unsolved
[2024-06-01 05:01:39] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 1 ms to minimize.
[2024-06-01 05:01:39] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 1 ms to minimize.
[2024-06-01 05:01:39] [INFO ] Deduced a trap composed of 4 places in 120 ms of which 15 ms to minimize.
[2024-06-01 05:01:39] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 0 ms to minimize.
[2024-06-01 05:01:39] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
[2024-06-01 05:01:39] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-06-01 05:01:39] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2024-06-01 05:01:40] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 1 ms to minimize.
[2024-06-01 05:01:40] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 1 ms to minimize.
[2024-06-01 05:01:40] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 1 ms to minimize.
[2024-06-01 05:01:40] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 1 ms to minimize.
[2024-06-01 05:01:40] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
[2024-06-01 05:01:40] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/256 variables, 13/164 constraints. Problems are: Problem set: 0 solved, 236 unsolved
[2024-06-01 05:01:41] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 2)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 1)
(s7 1)
(s8 1)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 1)
(s15 0)
(s16 0)
(s17 0)
(s18 timeout
0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 256/386 variables, and 165 constraints, problems are : Problem set: 0 solved, 236 unsolved in 5012 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 146/152 constraints, State Equation: 0/270 constraints, PredecessorRefiner: 0/236 constraints, Known Traps: 16/16 constraints]
After SMT, in 10149ms problems are : Problem set: 0 solved, 236 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 236 out of 270 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 270/270 places, 116/116 transitions.
Graph (complete) has 860 edges and 270 vertex of which 268 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Discarding 7 places :
Implicit places reduction removed 7 places
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 261 transition count 100
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 8 Pre rules applied. Total rules applied 24 place count 261 transition count 92
Deduced a syphon composed of 8 places in 0 ms
Ensure Unique test removed 13 places
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 1 with 29 rules applied. Total rules applied 53 place count 240 transition count 92
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 53 place count 240 transition count 91
Deduced a syphon composed of 1 places in 0 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 56 place count 238 transition count 91
Applied a total of 56 rules in 33 ms. Remains 238 /270 variables (removed 32) and now considering 91/116 (removed 25) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 238/270 places, 91/116 transitions.
RANDOM walk for 4000000 steps (299688 resets) in 41303 ms. (96 steps per ms) remains 135/236 properties
BEST_FIRST walk for 40003 steps (509 resets) in 91 ms. (434 steps per ms) remains 135/135 properties
BEST_FIRST walk for 40004 steps (508 resets) in 72 ms. (548 steps per ms) remains 135/135 properties
BEST_FIRST walk for 40003 steps (507 resets) in 72 ms. (547 steps per ms) remains 135/135 properties
BEST_FIRST walk for 40004 steps (506 resets) in 86 ms. (459 steps per ms) remains 135/135 properties
BEST_FIRST walk for 40004 steps (507 resets) in 84 ms. (470 steps per ms) remains 135/135 properties
BEST_FIRST walk for 40001 steps (502 resets) in 70 ms. (563 steps per ms) remains 135/135 properties
BEST_FIRST walk for 40002 steps (506 resets) in 71 ms. (555 steps per ms) remains 135/135 properties
BEST_FIRST walk for 40002 steps (511 resets) in 72 ms. (547 steps per ms) remains 135/135 properties
BEST_FIRST walk for 40002 steps (505 resets) in 102 ms. (388 steps per ms) remains 135/135 properties
BEST_FIRST walk for 40003 steps (503 resets) in 88 ms. (449 steps per ms) remains 135/135 properties
BEST_FIRST walk for 40004 steps (506 resets) in 70 ms. (563 steps per ms) remains 135/135 properties
BEST_FIRST walk for 40004 steps (503 resets) in 73 ms. (540 steps per ms) remains 135/135 properties
BEST_FIRST walk for 40002 steps (512 resets) in 96 ms. (412 steps per ms) remains 135/135 properties
BEST_FIRST walk for 40003 steps (506 resets) in 82 ms. (481 steps per ms) remains 135/135 properties
BEST_FIRST walk for 40004 steps (506 resets) in 71 ms. (555 steps per ms) remains 135/135 properties
BEST_FIRST walk for 40003 steps (507 resets) in 71 ms. (555 steps per ms) remains 135/135 properties
BEST_FIRST walk for 40003 steps (508 resets) in 71 ms. (555 steps per ms) remains 135/135 properties
BEST_FIRST walk for 40002 steps (505 resets) in 76 ms. (519 steps per ms) remains 135/135 properties
BEST_FIRST walk for 40004 steps (505 resets) in 73 ms. (540 steps per ms) remains 135/135 properties
BEST_FIRST walk for 40003 steps (506 resets) in 70 ms. (563 steps per ms) remains 135/135 properties
BEST_FIRST walk for 40003 steps (507 resets) in 72 ms. (547 steps per ms) remains 135/135 properties
BEST_FIRST walk for 40003 steps (500 resets) in 75 ms. (526 steps per ms) remains 135/135 properties
BEST_FIRST walk for 40004 steps (510 resets) in 76 ms. (519 steps per ms) remains 135/135 properties
BEST_FIRST walk for 40003 steps (509 resets) in 72 ms. (547 steps per ms) remains 135/135 properties
BEST_FIRST walk for 40003 steps (506 resets) in 76 ms. (519 steps per ms) remains 135/135 properties
BEST_FIRST walk for 40002 steps (505 resets) in 76 ms. (519 steps per ms) remains 135/135 properties
BEST_FIRST walk for 40003 steps (510 resets) in 70 ms. (563 steps per ms) remains 135/135 properties
BEST_FIRST walk for 40004 steps (506 resets) in 70 ms. (563 steps per ms) remains 135/135 properties
BEST_FIRST walk for 40003 steps (502 resets) in 71 ms. (555 steps per ms) remains 135/135 properties
BEST_FIRST walk for 40004 steps (504 resets) in 76 ms. (519 steps per ms) remains 135/135 properties
BEST_FIRST walk for 40003 steps (501 resets) in 72 ms. (547 steps per ms) remains 135/135 properties
BEST_FIRST walk for 40002 steps (503 resets) in 76 ms. (519 steps per ms) remains 135/135 properties
BEST_FIRST walk for 40004 steps (507 resets) in 72 ms. (548 steps per ms) remains 135/135 properties
BEST_FIRST walk for 40004 steps (504 resets) in 75 ms. (526 steps per ms) remains 135/135 properties
BEST_FIRST walk for 40004 steps (510 resets) in 73 ms. (540 steps per ms) remains 135/135 properties
BEST_FIRST walk for 40003 steps (503 resets) in 73 ms. (540 steps per ms) remains 135/135 properties
BEST_FIRST walk for 40003 steps (505 resets) in 70 ms. (563 steps per ms) remains 135/135 properties
BEST_FIRST walk for 40004 steps (508 resets) in 79 ms. (500 steps per ms) remains 135/135 properties
BEST_FIRST walk for 40004 steps (507 resets) in 74 ms. (533 steps per ms) remains 135/135 properties
BEST_FIRST walk for 40004 steps (507 resets) in 71 ms. (555 steps per ms) remains 135/135 properties
BEST_FIRST walk for 40001 steps (509 resets) in 69 ms. (571 steps per ms) remains 135/135 properties
BEST_FIRST walk for 40004 steps (506 resets) in 72 ms. (548 steps per ms) remains 135/135 properties
BEST_FIRST walk for 40003 steps (505 resets) in 74 ms. (533 steps per ms) remains 135/135 properties
BEST_FIRST walk for 40003 steps (507 resets) in 71 ms. (555 steps per ms) remains 135/135 properties
BEST_FIRST walk for 40003 steps (509 resets) in 72 ms. (547 steps per ms) remains 135/135 properties
BEST_FIRST walk for 40003 steps (509 resets) in 71 ms. (555 steps per ms) remains 135/135 properties
BEST_FIRST walk for 40004 steps (504 resets) in 74 ms. (533 steps per ms) remains 135/135 properties
BEST_FIRST walk for 40003 steps (506 resets) in 74 ms. (533 steps per ms) remains 135/135 properties
BEST_FIRST walk for 40003 steps (505 resets) in 74 ms. (533 steps per ms) remains 135/135 properties
BEST_FIRST walk for 40002 steps (504 resets) in 68 ms. (579 steps per ms) remains 135/135 properties
// Phase 1: matrix 91 rows 238 cols
[2024-06-01 05:01:54] [INFO ] Computed 147 invariants in 3 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 92/92 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 2 (OVERLAPS) 79/214 variables, 43/135 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/214 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 4 (OVERLAPS) 7/221 variables, 6/141 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/221 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 6 (OVERLAPS) 87/308 variables, 221/362 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/308 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 8 (OVERLAPS) 21/329 variables, 17/379 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/329 variables, 6/385 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/329 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 11 (OVERLAPS) 0/329 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 135 unsolved
No progress, stopping.
After SMT solving in domain Real declared 329/329 variables, and 385 constraints, problems are : Problem set: 0 solved, 135 unsolved in 5891 ms.
Refiners :[Generalized P Invariants (flows): 147/147 constraints, State Equation: 238/238 constraints, PredecessorRefiner: 135/135 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 135 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 92/92 constraints. Problems are: Problem set: 0 solved, 135 unsolved
[2024-06-01 05:02:00] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-06-01 05:02:00] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 2/94 constraints. Problems are: Problem set: 0 solved, 135 unsolved
[2024-06-01 05:02:00] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-06-01 05:02:00] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 2/96 constraints. Problems are: Problem set: 0 solved, 135 unsolved
[2024-06-01 05:02:01] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 5 (OVERLAPS) 79/214 variables, 43/140 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/214 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 7 (OVERLAPS) 7/221 variables, 6/146 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/221 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 9 (OVERLAPS) 87/308 variables, 221/367 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/308 variables, 135/502 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/308 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 12 (OVERLAPS) 21/329 variables, 17/519 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/329 variables, 6/525 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/329 variables, 0/525 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 15 (OVERLAPS) 0/329 variables, 0/525 constraints. Problems are: Problem set: 0 solved, 135 unsolved
No progress, stopping.
After SMT solving in domain Int declared 329/329 variables, and 525 constraints, problems are : Problem set: 0 solved, 135 unsolved in 9005 ms.
Refiners :[Generalized P Invariants (flows): 147/147 constraints, State Equation: 238/238 constraints, PredecessorRefiner: 135/135 constraints, Known Traps: 5/5 constraints]
After SMT, in 14924ms problems are : Problem set: 0 solved, 135 unsolved
Fused 135 Parikh solutions to 48 different solutions.
Finished Parikh walk after 2940 steps, including 63 resets, run visited all 1 properties in 10 ms. (steps per millisecond=294 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 135 properties in 469 ms.
Able to resolve query StableMarking after proving 261 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PARIKH_WALK MARKED_SUFFIX_TEST TOPOLOGICAL
Total runtime 39375 ms.
ITS solved all properties within timeout

BK_STOP 1717218129656

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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-PT-06"
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-PT-06, 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-171662353100043"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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