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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 8.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 11 19:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 141K Apr 11 19:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Apr 11 19:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K Apr 11 19:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 22 14:34 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:34 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 660K 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 1717178363169

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=CloudReconfiguration-PT-302
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 17:59:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2024-05-31 17:59:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 17:59:24] [INFO ] Load time of PNML (sax parser for PT used): 150 ms
[2024-05-31 17:59:24] [INFO ] Transformed 2585 places.
[2024-05-31 17:59:24] [INFO ] Transformed 3095 transitions.
[2024-05-31 17:59:24] [INFO ] Found NUPN structural information;
[2024-05-31 17:59:24] [INFO ] Parsed PT model containing 2585 places and 3095 transitions and 6463 arcs in 258 ms.
Graph (trivial) has 2956 edges and 2585 vertex of which 882 / 2585 are part of one of the 63 SCC in 11 ms
Free SCC test removed 819 places
Structural test allowed to assert that 867 places are NOT stable. Took 47 ms.
Ensure Unique test removed 936 transitions
Reduce redundant transitions removed 936 transitions.
RANDOM walk for 40000 steps (638 resets) in 3959 ms. (10 steps per ms) remains 1249/1718 properties
BEST_FIRST walk for 120 steps (8 resets) in 17 ms. (6 steps per ms) remains 1249/1249 properties
BEST_FIRST walk for 120 steps (8 resets) in 25 ms. (4 steps per ms) remains 1249/1249 properties
BEST_FIRST walk for 120 steps (8 resets) in 17 ms. (6 steps per ms) remains 1249/1249 properties
BEST_FIRST walk for 120 steps (8 resets) in 85 ms. (1 steps per ms) remains 1249/1249 properties
BEST_FIRST walk for 120 steps (8 resets) in 20 ms. (5 steps per ms) remains 1249/1249 properties
BEST_FIRST walk for 120 steps (8 resets) in 19 ms. (6 steps per ms) remains 1249/1249 properties
BEST_FIRST walk for 120 steps (8 resets) in 22 ms. (5 steps per ms) remains 1249/1249 properties
BEST_FIRST walk for 120 steps (8 resets) in 16 ms. (7 steps per ms) remains 1249/1249 properties
BEST_FIRST walk for 120 steps (8 resets) in 14 ms. (8 steps per ms) remains 1249/1249 properties
BEST_FIRST walk for 120 steps (8 resets) in 12 ms. (9 steps per ms) remains 1249/1249 properties
BEST_FIRST walk for 120 steps (8 resets) in 15 ms. (7 steps per ms) remains 1249/1249 properties
BEST_FIRST walk for 120 steps (8 resets) in 12 ms. (9 steps per ms) remains 1249/1249 properties
BEST_FIRST walk for 120 steps (8 resets) in 15 ms. (7 steps per ms) remains 1249/1249 properties
BEST_FIRST walk for 120 steps (8 resets) in 12 ms. (9 steps per ms) remains 1249/1249 properties
BEST_FIRST walk for 120 steps (8 resets) in 13 ms. (8 steps per ms) remains 1249/1249 properties
BEST_FIRST walk for 120 steps (8 resets) in 13 ms. (8 steps per ms) remains 1249/1249 properties
BEST_FIRST walk for 120 steps (8 resets) in 17 ms. (6 steps per ms) remains 1249/1249 properties
BEST_FIRST walk for 120 steps (8 resets) in 13 ms. (8 steps per ms) remains 1249/1249 properties
BEST_FIRST walk for 120 steps (8 resets) in 14 ms. (8 steps per ms) remains 1249/1249 properties
BEST_FIRST walk for 120 steps (8 resets) in 12 ms. (9 steps per ms) remains 1249/1249 properties
BEST_FIRST walk for 120 steps (8 resets) in 11 ms. (10 steps per ms) remains 1249/1249 properties
BEST_FIRST walk for 120 steps (8 resets) in 26 ms. (4 steps per ms) remains 1249/1249 properties
BEST_FIRST walk for 120 steps (8 resets) in 13 ms. (8 steps per ms) remains 1249/1249 properties
BEST_FIRST walk for 120 steps (8 resets) in 13 ms. (8 steps per ms) remains 1249/1249 properties
BEST_FIRST walk for 120 steps (8 resets) in 11 ms. (10 steps per ms) remains 1249/1249 properties
BEST_FIRST walk for 120 steps (8 resets) in 17 ms. (6 steps per ms) remains 1249/1249 properties
BEST_FIRST walk for 120 steps (8 resets) in 16 ms. (7 steps per ms) remains 1249/1249 properties
BEST_FIRST walk for 120 steps (8 resets) in 12 ms. (9 steps per ms) remains 1249/1249 properties
BEST_FIRST walk for 120 steps (8 resets) in 14 ms. (8 steps per ms) remains 1249/1249 properties
BEST_FIRST walk for 120 steps (8 resets) in 11 ms. (10 steps per ms) remains 1249/1249 properties
BEST_FIRST walk for 120 steps (8 resets) in 11 ms. (10 steps per ms) remains 1249/1249 properties
BEST_FIRST walk for 120 steps (8 resets) in 24 ms. (4 steps per ms) remains 1249/1249 properties
BEST_FIRST walk for 120 steps (8 resets) in 13 ms. (8 steps per ms) remains 1249/1249 properties
BEST_FIRST walk for 120 steps (8 resets) in 14 ms. (8 steps per ms) remains 1249/1249 properties
BEST_FIRST walk for 120 steps (8 resets) in 15 ms. (7 steps per ms) remains 1249/1249 properties
BEST_FIRST walk for 120 steps (8 resets) in 12 ms. (9 steps per ms) remains 1249/1249 properties
BEST_FIRST walk for 120 steps (8 resets) in 14 ms. (8 steps per ms) remains 1249/1249 properties
BEST_FIRST walk for 120 steps (8 resets) in 13 ms. (8 steps per ms) remains 1249/1249 properties
BEST_FIRST walk for 120 steps (8 resets) in 13 ms. (8 steps per ms) remains 1249/1249 properties
BEST_FIRST walk for 120 steps (8 resets) in 10 ms. (10 steps per ms) remains 1249/1249 properties
BEST_FIRST walk for 120 steps (8 resets) in 26 ms. (4 steps per ms) remains 1249/1249 properties
BEST_FIRST walk for 120 steps (8 resets) in 17 ms. (6 steps per ms) remains 1249/1249 properties
BEST_FIRST walk for 120 steps (8 resets) in 15 ms. (7 steps per ms) remains 1249/1249 properties
BEST_FIRST walk for 120 steps (8 resets) in 13 ms. (8 steps per ms) remains 1249/1249 properties
BEST_FIRST walk for 120 steps (8 resets) in 15 ms. (7 steps per ms) remains 1249/1249 properties
BEST_FIRST walk for 120 steps (8 resets) in 15 ms. (7 steps per ms) remains 1249/1249 properties
BEST_FIRST walk for 120 steps (8 resets) in 14 ms. (8 steps per ms) remains 1249/1249 properties
BEST_FIRST walk for 120 steps (8 resets) in 12 ms. (9 steps per ms) remains 1249/1249 properties
BEST_FIRST walk for 120 steps (8 resets) in 13 ms. (8 steps per ms) remains 1249/1249 properties
BEST_FIRST walk for 120 steps (8 resets) in 12 ms. (9 steps per ms) remains 1249/1249 properties
[2024-05-31 17:59:26] [INFO ] Flow matrix only has 2097 transitions (discarded 62 similar events)
// Phase 1: matrix 2097 rows 1766 cols
[2024-05-31 17:59:26] [INFO ] Computed 4 invariants in 29 ms
[2024-05-31 17:59:26] [INFO ] State equation strengthened by 1 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s34 (/ 1.0 2.0))
(s35 (/ 1.0 2.0))
(s36 (/ 1.0 2.0))
(s37 (/ 1.0 2.0))
(s38 (/ 1.0 2.0))
(s39 (/ 1.0 2.0))
(s40 (/ 1.0 2.0))
(s41 (/ 1.0 2.0))
(s42 (/ 1.0 2.0))
(s56 (/ 1.0 2.0))
(s59 (/ 1.0 2.0))
(s60 (/ 1.0 2.0))
(s61 (/ 1.0 2.0))
(s62 (/ 1.0 2.0))
(s63 (/ 1.0 2.0))
(s64 (/ 1.0 2.0))
(s65 (/ 1.0 2.0))
(s66 (/ 1.0 2.0))
(s67 (/ 1.0 2.0))
(s68 (/ 1.0 2.0))
(s69 (/ 1.0 2.0))
(s70 (/ 1.0 2.0))
(s71 (/ 1.0 2.0))
(s72 (/ 1.0 2.0))
(s73 (/ 1.0 2.0))
(s74 (/ 1.0 2.0))
(s75 (/ 1.0 2.0))
(s81 (/ 1.0 2.0))
(s82 (/ 1.0 2.0))
(s83 (/ 1.0 2.0))
(s84 (/ 1.0 2.0))
(s104 (/ 1.0 2.0))
(s105 (/ 1.0 2.0))
(s106 (/ 1.0 2.0))
(s107 (/ 1.0 2.0))
(s126 (/ 1.0 2.0))
(s127 (/ 1.0 2.0))
(s128 (/ 1.0 2.0))
(s129 (/ 1.0 2.0))
(s130 (/ 1.0 2.0))
(s140 (/ 1.0 2.0))
(s141 (/ 1.0 2.0))
(s142 (/ 1.0 2.0))
(s147 (/ 1.0 2.0))
(s148 (/ 1.0 2.0))
(s149 (/ 1.0 2.0))
(s150 (/ 1.0 2.0))
(s151 (/ 1.0 2.0))
(s152 (/ 1.0 2.0))
(s153 (/ 1.0 2.0))
(s154 (/ 1.0 2.0))
(s155 (/ 1.0 2.0))
(s156 (/ 1.0 2.0))
(s157 (/ 1.0 2.0))
(s158 (/ 1.0 2.0))
(s159 (/ 1.0 2.0))
(s160 (/ 1.0 2.0))
(s161 (/ 1.0 2.0))
(s162 (/ 1.0 2.0))
(s163 (/ 1.0 2.0))
(s164 (/ 1.0 2.0))
(s165 (/ 1.0 2.0))
(s166 (/ 1.0 2.0))
(s167 (/ 1.0 2.0))
(s168 (/ 1.0 2.0))
(s169 (/ 1.0 2.0))
(s170 (/ 1.0 2.0))
(s171 (/ 1.0 2.0))
(s172 (/ 1.0 2.0))
(s173 (/ 1.0 2.0))
(s174 (/ 1.0 2.0))
(s175 (/ 1.0 2.0))
(s176 (/ 1.0 2.0))
(s177 (/ 1.0 2.0))
(s178 (/ 1.0 2.0))
(s179 (/ 1.0 2.0))
(s180 (/ 1.0 2.0))
(s181 (/ 1.0 2.0))
(s182 (/ 1.0 2.0))
(s183 (/ 1.0 2.0))
(s184 (/ 1.0 2.0))
(s185 (/ 1.0 2.0))
(s186 (/ 1.0 2.0))
(s187 (/ 1.0 2.0))
(s188 (/ 1.0 2.0))
(s189 (/ 1.0 2.0))
(s190 (/ 1.0 2.0))
(s191 (/ 1.0 2.0))
(s235 (/ 1.0 2.0))
(s236 (/ 1.0 2.0))
(s237 (/ 1.0 2.0))
(s238 (/ 1.0 2.0))
(s239 (/ 1.0 2.0))
(s240 (/ 1.0 2.0))
(s241 (/ 1.0 2.0))
(s242 (/ 1.0 2.0))
(s244 (/ 1.0 2.0))
(s250 (/ 1.0 2.0))
(s251 (/ 1.0 2.0))
(s252 (/ 1.0 2.0))
(s254 (/ 1.0 2.0))
(s255 (/ 1.0 2.0))
(s256 (/ 1.0 2.0))
(s257 (/ 1.0 2.0))
(s258 (/ 1.0 2.0))
(s259 (/ 1.0 2.0))
(s260 (/ 1.0 2.0))
(s261 (/ 1.0 2.0))
(s262 (/ 1.0 2.0))
(s263 (/ 1.0 2.0))
(s264 (/ 1.0 2.0))
(s265 (/ 1.0 2.0))
(s266 (/ 1.0 2.0))
(s267 (/ 1.0 2.0))
(s268 (/ 1.0 2.0))
(s269 (/ 1.0 2.0))
(s270 (/ 1.0 2.0))
(s271 (/ 1.0 2.0))
(s272 (/ 1.0 2.0))
(s273 (/ 1.0 2.0))
(s274 (/ 1.0 2.0))
(s275 (/ 1.0 2.0))
(s276 (/ 1.0 2.0))
(s277 (/ 1.0 2.0))
(s309 (/ 1.0 2.0))
(s310 (/ 1.0 2.0))
(s314 (/ 1.0 2.0))
(s315 (/ 1.0 2.0))
(s328 (/ 1.0 2.0))
(s329 (/ 1.0 2.0))
(s330 (/ 1.0 2.0))
(s331 (/ 1.0 2.0))
(s332 (/ 1.0 2.0))
(s333 (/ 1.0 2.0))
(s334 (/ 1.0 2.0))
(s335 (/ 1.0 2.0))
(s336 (/ 1.0 2.0))
(s337 (/ 1.0 2.0))
(s339 (/ 1.0 2.0))
(s343 (/ 1.0 2.0))
(s344 (/ 1.0 2.0))
(s345 (/ 1.0 2.0))
(s346 (/ 1.0 2.0))
(s347 (/ 1.0 2.0))
(s348 (/ 1.0 2.0))
(s349 (/ 1.0 2.0))
(s350 (/ 1.0 2.0))
(s351 (/ 1.0 2.0))
(s352 (/ 1.0 2.0))
(s353 (/ 1.0 2.0))
(s354 (/ 1.0 2.0))
(s355 (/ 1.0 2.0))
(s356 (/ 1.0 2.0))
(s357 (/ 1.0 2.0))
(s358 (/ 1.0 2.0))
(s359 (/ 1.0 2.0))
(s360 (/ 1.0 2.0))
(s361 (/ 1.0 2.0))
(s366 (/ 1.0 2.0))
(s379 (/ 1.0 2.0))
(s384 (/ 1.0 2.0))
(s385 (/ 1.0 2.0))
(s386 (/ 1.0 2.0))
(s387 (/ 1.0 2.0))
(s388 (/ 1.0 2.0))
(s389 (/ 1.0 2.0))
(s390 (/ 1.0 2.0))
(s391 (/ 1.0 2.0))
(s392 (/ 1.0 2.0))
(s393 (/ 1.0 2.0))
(s394 (/ 1.0 2.0))
(s395 (/ 1.0 2.0))
(s396 (/ 1.0 2.0))
(s397 (/ 1.0 2.0))
(s398 (/ 1.0 2.0))
(s399 (/ 1.0 2.0))
(s400 (/ 1.0 2.0))
(s401 (/ 1.0 2.0))
(s402 (/ 1.0 2.0))
(s403 (/ 1.0 2.0))
(s405 (/ 1.0 2.0))
(s410 (/ 1.0 2.0))
(s411 (/ 1.0 2.0))
(s412 (/ 1.0 2.0))
(s414 (/ 1.0 2.0))
(s415 (/ 1.0 2.0))
(s416 (/ 1.0 2.0))
(s417 (/ 1.0 2.0))
(s418 (/ 1.0 2.0))
(s419 (/ 1.0 2.0))
(s420 (/ 1.0 2.0))
(s421 (/ 1.0 2.0))
(s422 (/ 1.0 2.0))
(s423 (/ 1.0 2.0))
(s424 (/ 1.0 2.0))
(s425 (/ 1.0 2.0))
(s426 (/ 1.0 2.0))
(s428 (/ 1.0 2.0))
(s429 (/ 1.0 2.0))
(s430 (/ 1.0 2.0))
(s431 (/ 1.0 2.0))
(s432 (/ 1.0 2.0))
(s433 (/ 1.0 2.0))
(s434 (/ 1.0 2.0))
(s452 (/ 1.0 2.0))
(s459 (/ 1.0 2.0))
(s460 (/ 1.0 2.0))
(s461 (/ 1.0 2.0))
(s462 (/ 1.0 2.0))
(s463 (/ 1.0 2.0))
(s464 (/ 1.0 2.0))
(s465 (/ 1.0 2.0))
(s466 (/ 1.0 2.0))
(s467 (/ 1.0 2.0))
(s468 (/ 1.0 2.0))
(s469 (/ 1.0 2.0))
(s470 (/ 1.0 2.0))
(s471 (/ 1.0 2.0))
(s472 (/ 1.0 2.0))
(s473 (/ 1.0 2.0))
(s474 (/ 1.0 2.0))
(s475 (/ 1.0 2.0))
(s491 (/ 1.0 2.0))
(s492 (/ 1.0 2.0))
(s493 (/ 1.0 2.0))
(s494 (/ 1.0 2.0))
(s495 (/ 1.0 2.0))
(s496 (/ 1.0 2.0))
(s497 (/ 1.0 2.0))
(s498 (/ 1.0 2.0))
(s505 (/ 1.0 2.0))
(s515 (/ 1.0 2.0))
(s527 (/ 1.0 2.0))
(s528 (/ 1.0 2.0))
(s530 (/ 1.0 2.0))
(s531 (/ 1.0 2.0))
(s535 (/ 1.0 2.0))
(s537 (/ 1.0 2.0))
(s538 (/ 1.0 2.0))
(s545 (/ 1.0 2.0))
(s546 (/ 1.0 2.0))
(s551 (/ 1.0 2.0))
(s552 (/ 1.0 2.0))
(s553 (/ 1.0 2.0))
(s554 (/ 1.0 2.0))
(s555 (/ 1.0 2.0))
(s556 (/ 1.0 2.0))
(s557 (/ 1.0 2.0))
(s558 (/ 1.0 2.0))
(s559 (/ 1.0 2.0))
(s560 (/ 1.0 2.0))
(s561 (/ 1.0 2.0))
(s562 (/ 1.0 2.0))
(s563 (/ 1.0 2.0))
(s564 (/ 1.0 2.0))
(s565 timeout
(/ 1.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1249 variables, 1249/1249 constraints. Problems are: Problem set: 0 solved, 1249 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1249/3863 variables, and 1249 constraints, problems are : Problem set: 0 solved, 1249 unsolved in 5215 ms.
Refiners :[Domain max(s): 1249/1766 constraints, Generalized P Invariants (flows): 0/4 constraints, State Equation: 0/1766 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1249/1249 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1249 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1249 variables, 1249/1249 constraints. Problems are: Problem set: 0 solved, 1249 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1249/3863 variables, and 1249 constraints, problems are : Problem set: 0 solved, 1249 unsolved in 5023 ms.
Refiners :[Domain max(s): 1249/1766 constraints, Generalized P Invariants (flows): 0/4 constraints, State Equation: 0/1766 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1249 constraints, Known Traps: 0/0 constraints]
After SMT, in 10723ms problems are : Problem set: 0 solved, 1249 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1249 out of 1766 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1766/1766 places, 2159/2159 transitions.
Graph (complete) has 2375 edges and 1766 vertex of which 1752 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.7 ms
Discarding 14 places :
Also discarding 10 output transitions
Drop transitions (Output transitions of discarded places.) removed 10 transitions
Drop transitions (Empty/Sink Transition effects.) removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 326 transitions
Trivial Post-agglo rules discarded 326 transitions
Performed 326 trivial Post agglomeration. Transition count delta: 326
Iterating post reduction 0 with 398 rules applied. Total rules applied 399 place count 1752 transition count 1751
Reduce places removed 326 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 350 rules applied. Total rules applied 749 place count 1426 transition count 1727
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 756 place count 1420 transition count 1726
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 756 place count 1420 transition count 1712
Deduced a syphon composed of 14 places in 2 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 784 place count 1406 transition count 1712
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 801 place count 1389 transition count 1695
Iterating global reduction 3 with 17 rules applied. Total rules applied 818 place count 1389 transition count 1695
Performed 34 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 34 places in 4 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 3 with 68 rules applied. Total rules applied 886 place count 1355 transition count 1659
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 887 place count 1355 transition count 1658
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -36
Deduced a syphon composed of 6 places in 4 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 899 place count 1349 transition count 1694
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 4 with 13 rules applied. Total rules applied 912 place count 1349 transition count 1681
Free-agglomeration rule applied 41 times with reduction of 3 identical transitions.
Iterating global reduction 4 with 41 rules applied. Total rules applied 953 place count 1349 transition count 1637
Reduce places removed 41 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 43 rules applied. Total rules applied 996 place count 1308 transition count 1635
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 5 with 5 rules applied. Total rules applied 1001 place count 1308 transition count 1630
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 1004 place count 1308 transition count 1630
Partial Post-agglomeration rule applied 5 times.
Drop transitions (Partial Post agglomeration) removed 5 transitions
Iterating global reduction 5 with 5 rules applied. Total rules applied 1009 place count 1308 transition count 1630
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1010 place count 1308 transition count 1629
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 1011 place count 1307 transition count 1628
Applied a total of 1011 rules in 495 ms. Remains 1307 /1766 variables (removed 459) and now considering 1628/2159 (removed 531) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 524 ms. Remains : 1307/1766 places, 1628/2159 transitions.
RANDOM walk for 3928711 steps (12639 resets) in 98913 ms. (39 steps per ms) remains 18/1249 properties
BEST_FIRST walk for 400003 steps (436 resets) in 1434 ms. (278 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400003 steps (427 resets) in 1275 ms. (313 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (449 resets) in 1068 ms. (374 steps per ms) remains 10/18 properties
BEST_FIRST walk for 400004 steps (442 resets) in 513 ms. (778 steps per ms) remains 10/10 properties
BEST_FIRST walk for 400002 steps (446 resets) in 543 ms. (735 steps per ms) remains 10/10 properties
BEST_FIRST walk for 400004 steps (441 resets) in 523 ms. (763 steps per ms) remains 10/10 properties
BEST_FIRST walk for 400002 steps (453 resets) in 564 ms. (707 steps per ms) remains 10/10 properties
BEST_FIRST walk for 400001 steps (450 resets) in 507 ms. (787 steps per ms) remains 10/10 properties
BEST_FIRST walk for 400003 steps (447 resets) in 529 ms. (754 steps per ms) remains 10/10 properties
BEST_FIRST walk for 400003 steps (446 resets) in 515 ms. (775 steps per ms) remains 10/10 properties
BEST_FIRST walk for 400004 steps (467 resets) in 524 ms. (761 steps per ms) remains 8/10 properties
BEST_FIRST walk for 400004 steps (442 resets) in 471 ms. (847 steps per ms) remains 8/8 properties
[2024-05-31 18:00:10] [INFO ] Flow matrix only has 1626 transitions (discarded 2 similar events)
// Phase 1: matrix 1626 rows 1307 cols
[2024-05-31 18:00:10] [INFO ] Computed 4 invariants in 16 ms
[2024-05-31 18:00:10] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 810/818 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/818 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 1022/1840 variables, 818/820 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1840 variables, 0/820 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 87/1927 variables, 8/828 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1927 variables, 0/828 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 127/2054 variables, 1/829 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2054 variables, 1/830 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2054 variables, 0/830 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 336/2390 variables, 206/1036 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2390 variables, 1/1037 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2390 variables, 0/1037 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 274/2664 variables, 1/1038 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2664 variables, 3/1041 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2664 variables, 0/1041 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (OVERLAPS) 269/2933 variables, 271/1312 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2933 variables, 0/1312 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (OVERLAPS) 0/2933 variables, 0/1312 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2933/2933 variables, and 1312 constraints, problems are : Problem set: 0 solved, 8 unsolved in 2267 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 1307/1307 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 810/818 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/818 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 1022/1840 variables, 818/820 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1840 variables, 4/824 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1840 variables, 0/824 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 87/1927 variables, 8/832 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1927 variables, 4/836 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1927 variables, 0/836 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 127/2054 variables, 1/837 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2054 variables, 1/838 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2054 variables, 0/838 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 336/2390 variables, 206/1044 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2390 variables, 1/1045 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2390 variables, 0/1045 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (OVERLAPS) 274/2664 variables, 1/1046 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2664 variables, 3/1049 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2664 variables, 0/1049 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (OVERLAPS) 269/2933 variables, 271/1320 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2933 variables, 0/1320 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 20 (OVERLAPS) 0/2933 variables, 0/1320 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2933/2933 variables, and 1320 constraints, problems are : Problem set: 0 solved, 8 unsolved in 3492 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 1307/1307 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 5794ms problems are : Problem set: 0 solved, 8 unsolved
Fused 8 Parikh solutions to 7 different solutions.
Finished Parikh walk after 224 steps, including 0 resets, run visited all 8 properties in 7 ms. (steps per millisecond=32 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 2 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 8 properties in 18 ms.
Able to resolve query StableMarking after proving 1720 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PARIKH_WALK MARKED_SUFFIX_TEST TRIVIAL_UNMARKED_SCC_TEST BESTFIRST_WALK TOPOLOGICAL
Total runtime 52113 ms.
ITS solved all properties within timeout

BK_STOP 1717178416449

--------------------
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="CloudReconfiguration-PT-302"
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 CloudReconfiguration-PT-302, 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 r482-tall-171624201200078"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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