fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r320-tall-167873970800568
Last Updated
May 14, 2023

About the Execution of 2022-gold for QuasiCertifProtocol-PT-32

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
668.571 539744.00 659377.00 1071.10 F normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r320-tall-167873970800568.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool gold2022
Input is QuasiCertifProtocol-PT-32, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r320-tall-167873970800568
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.7M
-rw-r--r-- 1 mcc users 74K Feb 26 01:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 454K Feb 26 01:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 16K Feb 26 01:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 113K Feb 26 01:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 21K Feb 25 16:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 93K Feb 25 16:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 25 16:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 25 16:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 223K Feb 26 01:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 1.3M Feb 26 01:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 53K Feb 26 01:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 343K Feb 26 01:41 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.5K Feb 25 16:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 942K Mar 5 18:23 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 1678874765508

Running Version 202205111006
[2023-03-15 10:06:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2023-03-15 10:06:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 10:06:07] [INFO ] Load time of PNML (sax parser for PT used): 185 ms
[2023-03-15 10:06:07] [INFO ] Transformed 3806 places.
[2023-03-15 10:06:07] [INFO ] Transformed 506 transitions.
[2023-03-15 10:06:07] [INFO ] Parsed PT model containing 3806 places and 506 transitions in 306 ms.
Structural test allowed to assert that 36 places are NOT stable. Took 15 ms.
Incomplete random walk after 10000 steps, including 267 resets, run finished after 3328 ms. (steps per millisecond=3 ) properties (out of 3770) seen :101
Probabilistic random walk after 30001 steps, saw 5953 distinct states, run finished after 1981 ms. (steps per millisecond=15 ) properties seen :0
Running SMT prover for 3669 properties.
// Phase 1: matrix 506 rows 3806 cols
[2023-03-15 10:06:12] [INFO ] Computed 3301 place invariants in 185 ms
[2023-03-15 10:06:38] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-15 10:06:38] [INFO ] After 25078ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 3669 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 3669 out of 3806 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 3806/3806 places, 506/506 transitions.
Graph (complete) has 43474 edges and 3806 vertex of which 3804 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.28 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 67 transitions
Reduce isomorphic transitions removed 67 transitions.
Discarding 33 places :
Implicit places reduction removed 33 places
Iterating post reduction 0 with 100 rules applied. Total rules applied 101 place count 3771 transition count 439
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 33 Pre rules applied. Total rules applied 101 place count 3771 transition count 406
Deduced a syphon composed of 33 places in 11 ms
Ensure Unique test removed 65 places
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 1 with 131 rules applied. Total rules applied 232 place count 3673 transition count 406
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 232 place count 3673 transition count 405
Deduced a syphon composed of 1 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 3 rules applied. Total rules applied 235 place count 3671 transition count 405
Applied a total of 235 rules in 214 ms. Remains 3671 /3806 variables (removed 135) and now considering 405/506 (removed 101) transitions.
Finished structural reductions, in 1 iterations. Remains : 3671/3806 places, 405/506 transitions.
Interrupted random walk after 104170 steps, including 3595 resets, run timeout after 30001 ms. (steps per millisecond=3 ) properties seen 1000
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 2669) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 2669) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 2669) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 2669) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 2669) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 2669) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 2669) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 2669) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 2669) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 2669) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 2669) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 2669) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 2669) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 2669) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 2669) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 2669) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 2669) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 2669) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 2669) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 2669) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 2669) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 2669) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 2669) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 2669) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 2669) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 2669) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 2669) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 2669) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 2669) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 2669) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 2669) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 2669) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 2669) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 2669) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 2669) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 2669) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 2669) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 2669) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 2669) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 2669) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 2669) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 2669) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 2669) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 2669) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 2669) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 2669) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 2669) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 2669) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 2669) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 2669) seen :0
Running SMT prover for 2669 properties.
// Phase 1: matrix 405 rows 3671 cols
[2023-03-15 10:07:09] [INFO ] Computed 3266 place invariants in 18 ms
[2023-03-15 10:10:17] [INFO ] After 187880ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2669
[2023-03-15 10:12:31] [INFO ] [Nat]Absence check using 0 positive and 3266 generalized place invariants in 811 ms returned sat
[2023-03-15 10:14:02] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-15 10:14:02] [INFO ] After 225039ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2669
Fused 2669 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 2669 out of 3671 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 3671/3671 places, 405/405 transitions.
Drop transitions removed 85 transitions
Reduce isomorphic transitions removed 85 transitions.
Discarding 33 places :
Implicit places reduction removed 33 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 120 rules applied. Total rules applied 120 place count 3638 transition count 318
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 122 place count 3636 transition count 318
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 33 Pre rules applied. Total rules applied 122 place count 3636 transition count 285
Deduced a syphon composed of 33 places in 1 ms
Ensure Unique test removed 33 places
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 2 with 99 rules applied. Total rules applied 221 place count 3570 transition count 285
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 222 place count 3570 transition count 284
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 223 place count 3569 transition count 284
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 0 ms
Ensure Unique test removed 783 places
Reduce places removed 831 places and 0 transitions.
Iterating global reduction 4 with 879 rules applied. Total rules applied 1102 place count 2738 transition count 236
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1103 place count 2737 transition count 235
Ensure Unique test removed 33 places
Iterating post reduction 4 with 33 rules applied. Total rules applied 1136 place count 2704 transition count 235
Applied a total of 1136 rules in 272 ms. Remains 2704 /3671 variables (removed 967) and now considering 235/405 (removed 170) transitions.
Finished structural reductions, in 1 iterations. Remains : 2704/3671 places, 235/405 transitions.
Interrupted random walk after 442881 steps, including 17906 resets, run timeout after 30001 ms. (steps per millisecond=14 ) properties seen 2601
Incomplete Best-First random walk after 100001 steps, including 487 resets, run finished after 645 ms. (steps per millisecond=155 ) properties (out of 68) seen :35
Incomplete Best-First random walk after 100001 steps, including 497 resets, run finished after 589 ms. (steps per millisecond=169 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 100001 steps, including 500 resets, run finished after 559 ms. (steps per millisecond=178 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 100001 steps, including 475 resets, run finished after 556 ms. (steps per millisecond=179 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 100001 steps, including 477 resets, run finished after 566 ms. (steps per millisecond=176 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 100001 steps, including 489 resets, run finished after 560 ms. (steps per millisecond=178 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 100001 steps, including 497 resets, run finished after 563 ms. (steps per millisecond=177 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 100001 steps, including 490 resets, run finished after 567 ms. (steps per millisecond=176 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 100001 steps, including 485 resets, run finished after 553 ms. (steps per millisecond=180 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 100001 steps, including 490 resets, run finished after 558 ms. (steps per millisecond=179 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 100000 steps, including 488 resets, run finished after 559 ms. (steps per millisecond=178 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 100001 steps, including 492 resets, run finished after 560 ms. (steps per millisecond=178 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 100001 steps, including 491 resets, run finished after 558 ms. (steps per millisecond=179 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 100001 steps, including 477 resets, run finished after 572 ms. (steps per millisecond=174 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 100001 steps, including 479 resets, run finished after 570 ms. (steps per millisecond=175 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 100001 steps, including 485 resets, run finished after 555 ms. (steps per millisecond=180 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 100001 steps, including 480 resets, run finished after 568 ms. (steps per millisecond=176 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 100001 steps, including 478 resets, run finished after 573 ms. (steps per millisecond=174 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 100001 steps, including 502 resets, run finished after 588 ms. (steps per millisecond=170 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 100001 steps, including 504 resets, run finished after 594 ms. (steps per millisecond=168 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 100001 steps, including 501 resets, run finished after 592 ms. (steps per millisecond=168 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 100001 steps, including 491 resets, run finished after 614 ms. (steps per millisecond=162 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 100001 steps, including 502 resets, run finished after 595 ms. (steps per millisecond=168 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 100001 steps, including 489 resets, run finished after 623 ms. (steps per millisecond=160 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 100000 steps, including 492 resets, run finished after 622 ms. (steps per millisecond=160 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 100001 steps, including 488 resets, run finished after 605 ms. (steps per millisecond=165 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 100001 steps, including 491 resets, run finished after 607 ms. (steps per millisecond=164 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 100001 steps, including 480 resets, run finished after 623 ms. (steps per millisecond=160 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 100001 steps, including 480 resets, run finished after 630 ms. (steps per millisecond=158 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 100001 steps, including 493 resets, run finished after 608 ms. (steps per millisecond=164 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 100001 steps, including 455 resets, run finished after 657 ms. (steps per millisecond=152 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 100001 steps, including 482 resets, run finished after 582 ms. (steps per millisecond=171 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 100001 steps, including 488 resets, run finished after 525 ms. (steps per millisecond=190 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 100001 steps, including 489 resets, run finished after 532 ms. (steps per millisecond=187 ) properties (out of 33) seen :0
Running SMT prover for 33 properties.
// Phase 1: matrix 235 rows 2704 cols
[2023-03-15 10:14:52] [INFO ] Computed 2469 place invariants in 13 ms
[2023-03-15 10:14:54] [INFO ] After 1549ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:33
[2023-03-15 10:14:55] [INFO ] [Nat]Absence check using 10 positive place invariants in 22 ms returned sat
[2023-03-15 10:14:56] [INFO ] [Nat]Absence check using 10 positive and 2459 generalized place invariants in 440 ms returned sat
[2023-03-15 10:15:00] [INFO ] After 2471ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :33
[2023-03-15 10:15:03] [INFO ] After 5919ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :33
Attempting to minimize the solution found.
Minimization took 1615 ms.
[2023-03-15 10:15:05] [INFO ] After 10835ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :33
Fused 33 Parikh solutions to 1 different solutions.
Finished Parikh walk after 150 steps, including 0 resets, run visited all 33 properties in 22 ms. (steps per millisecond=6 )
Parikh walk visited 33 properties in 22 ms.
Able to resolve query StableMarking after proving 3771 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PARIKH_WALK MARKED_SUFFIX_TEST BESTFIRST_WALK TOPOLOGICAL
Total runtime 538383 ms.

BK_STOP 1678875305252

--------------------
content from stderr:

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ StableMarking = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution StableMarking -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination StableMarking -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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-32"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="gold2022"
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-5348"
echo " Executing tool gold2022"
echo " Input is QuasiCertifProtocol-PT-32, 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 r320-tall-167873970800568"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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