Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r448-tajo-167905989700178.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
....................
=====================================================================
Generated by BenchKit 2-5348
Executing tool gold2022
Input is ShieldRVt-PT-020B, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r448-tajo-167905989700178
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 636K
-rw-r--r-- 1 mcc users 7.0K Feb 25 23:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Feb 25 23:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Feb 25 23:15 CTLFireability.txt
-rw-r--r-- 1 mcc users 38K Feb 25 23:15 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.3K Feb 25 17:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 17:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.1K Feb 25 23:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 93K Feb 25 23:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Feb 25 23:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Feb 25 23:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:04 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 239K 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 1679476817369

Running Version 202205111006
[2023-03-22 09:20:18] [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-22 09:20:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 09:20:19] [INFO ] Load time of PNML (sax parser for PT used): 123 ms
[2023-03-22 09:20:19] [INFO ] Transformed 1003 places.
[2023-03-22 09:20:19] [INFO ] Transformed 1003 transitions.
[2023-03-22 09:20:19] [INFO ] Found NUPN structural information;
[2023-03-22 09:20:19] [INFO ] Parsed PT model containing 1003 places and 1003 transitions in 234 ms.
Structural test allowed to assert that 401 places are NOT stable. Took 12 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 909 ms. (steps per millisecond=11 ) properties (out of 602) seen :485
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 117) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 117) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 117) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=20 ) properties (out of 117) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 117) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 117) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 117) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 117) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 117) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 117) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 117) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 117) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 117) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 117) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 117) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 117) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 117) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 117) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 117) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 117) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 117) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 117) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 117) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 117) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 117) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 117) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 117) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 117) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 117) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 117) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 117) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 117) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 117) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 117) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 117) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 117) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 117) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 117) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 117) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 117) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 117) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 117) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 117) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 117) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 117) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 117) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 117) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 117) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 117) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 117) seen :0
Running SMT prover for 117 properties.
// Phase 1: matrix 1003 rows 1003 cols
[2023-03-22 09:20:20] [INFO ] Computed 81 place invariants in 29 ms
[2023-03-22 09:20:22] [INFO ] After 1848ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:117
[2023-03-22 09:20:23] [INFO ] [Nat]Absence check using 81 positive place invariants in 78 ms returned sat
[2023-03-22 09:20:29] [INFO ] After 3856ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :117
[2023-03-22 09:20:29] [INFO ] Deduced a trap composed of 26 places in 310 ms of which 9 ms to minimize.
[2023-03-22 09:20:29] [INFO ] Deduced a trap composed of 40 places in 299 ms of which 2 ms to minimize.
[2023-03-22 09:20:30] [INFO ] Deduced a trap composed of 34 places in 231 ms of which 1 ms to minimize.
[2023-03-22 09:20:30] [INFO ] Deduced a trap composed of 35 places in 296 ms of which 1 ms to minimize.
[2023-03-22 09:20:30] [INFO ] Deduced a trap composed of 37 places in 236 ms of which 2 ms to minimize.
[2023-03-22 09:20:30] [INFO ] Deduced a trap composed of 43 places in 177 ms of which 2 ms to minimize.
[2023-03-22 09:20:31] [INFO ] Deduced a trap composed of 20 places in 157 ms of which 1 ms to minimize.
[2023-03-22 09:20:31] [INFO ] Deduced a trap composed of 38 places in 239 ms of which 0 ms to minimize.
[2023-03-22 09:20:31] [INFO ] Deduced a trap composed of 29 places in 133 ms of which 1 ms to minimize.
[2023-03-22 09:20:31] [INFO ] Deduced a trap composed of 49 places in 205 ms of which 1 ms to minimize.
[2023-03-22 09:20:32] [INFO ] Deduced a trap composed of 32 places in 312 ms of which 1 ms to minimize.
[2023-03-22 09:20:32] [INFO ] Deduced a trap composed of 53 places in 273 ms of which 1 ms to minimize.
[2023-03-22 09:20:32] [INFO ] Deduced a trap composed of 38 places in 289 ms of which 0 ms to minimize.
[2023-03-22 09:20:33] [INFO ] Deduced a trap composed of 30 places in 290 ms of which 1 ms to minimize.
[2023-03-22 09:20:33] [INFO ] Deduced a trap composed of 30 places in 296 ms of which 2 ms to minimize.
[2023-03-22 09:20:33] [INFO ] Deduced a trap composed of 46 places in 276 ms of which 1 ms to minimize.
[2023-03-22 09:20:34] [INFO ] Deduced a trap composed of 52 places in 264 ms of which 1 ms to minimize.
[2023-03-22 09:20:34] [INFO ] Deduced a trap composed of 36 places in 216 ms of which 1 ms to minimize.
[2023-03-22 09:20:34] [INFO ] Deduced a trap composed of 30 places in 258 ms of which 1 ms to minimize.
[2023-03-22 09:20:35] [INFO ] Deduced a trap composed of 25 places in 275 ms of which 1 ms to minimize.
[2023-03-22 09:20:35] [INFO ] Deduced a trap composed of 36 places in 205 ms of which 15 ms to minimize.
[2023-03-22 09:20:35] [INFO ] Deduced a trap composed of 38 places in 191 ms of which 1 ms to minimize.
[2023-03-22 09:20:35] [INFO ] Deduced a trap composed of 29 places in 332 ms of which 2 ms to minimize.
[2023-03-22 09:20:36] [INFO ] Deduced a trap composed of 35 places in 179 ms of which 0 ms to minimize.
[2023-03-22 09:20:36] [INFO ] Deduced a trap composed of 32 places in 166 ms of which 0 ms to minimize.
[2023-03-22 09:20:36] [INFO ] Deduced a trap composed of 32 places in 374 ms of which 2 ms to minimize.
[2023-03-22 09:20:37] [INFO ] Deduced a trap composed of 38 places in 208 ms of which 1 ms to minimize.
[2023-03-22 09:20:37] [INFO ] Trap strengthening (SAT) tested/added 28/27 trap constraints in 7915 ms
[2023-03-22 09:20:37] [INFO ] Deduced a trap composed of 35 places in 318 ms of which 2 ms to minimize.
[2023-03-22 09:20:37] [INFO ] Deduced a trap composed of 40 places in 324 ms of which 0 ms to minimize.
[2023-03-22 09:20:38] [INFO ] Deduced a trap composed of 29 places in 343 ms of which 1 ms to minimize.
[2023-03-22 09:20:38] [INFO ] Deduced a trap composed of 35 places in 278 ms of which 1 ms to minimize.
[2023-03-22 09:20:38] [INFO ] Deduced a trap composed of 51 places in 346 ms of which 2 ms to minimize.
[2023-03-22 09:20:39] [INFO ] Deduced a trap composed of 47 places in 338 ms of which 1 ms to minimize.
[2023-03-22 09:20:39] [INFO ] Deduced a trap composed of 27 places in 301 ms of which 1 ms to minimize.
[2023-03-22 09:20:40] [INFO ] Deduced a trap composed of 34 places in 338 ms of which 5 ms to minimize.
[2023-03-22 09:20:40] [INFO ] Deduced a trap composed of 37 places in 355 ms of which 1 ms to minimize.
[2023-03-22 09:20:40] [INFO ] Deduced a trap composed of 28 places in 360 ms of which 1 ms to minimize.
[2023-03-22 09:20:41] [INFO ] Deduced a trap composed of 37 places in 297 ms of which 1 ms to minimize.
[2023-03-22 09:20:41] [INFO ] Deduced a trap composed of 28 places in 233 ms of which 0 ms to minimize.
[2023-03-22 09:20:41] [INFO ] Deduced a trap composed of 68 places in 240 ms of which 2 ms to minimize.
[2023-03-22 09:20:42] [INFO ] Deduced a trap composed of 63 places in 241 ms of which 1 ms to minimize.
[2023-03-22 09:20:42] [INFO ] Deduced a trap composed of 42 places in 277 ms of which 2 ms to minimize.
[2023-03-22 09:20:42] [INFO ] Deduced a trap composed of 50 places in 247 ms of which 1 ms to minimize.
[2023-03-22 09:20:42] [INFO ] Deduced a trap composed of 49 places in 226 ms of which 1 ms to minimize.
[2023-03-22 09:20:43] [INFO ] Deduced a trap composed of 40 places in 296 ms of which 1 ms to minimize.
[2023-03-22 09:20:43] [INFO ] Deduced a trap composed of 39 places in 364 ms of which 1 ms to minimize.
[2023-03-22 09:20:43] [INFO ] Deduced a trap composed of 70 places in 199 ms of which 1 ms to minimize.
[2023-03-22 09:20:44] [INFO ] Deduced a trap composed of 58 places in 181 ms of which 0 ms to minimize.
[2023-03-22 09:20:44] [INFO ] Deduced a trap composed of 31 places in 202 ms of which 1 ms to minimize.
[2023-03-22 09:20:44] [INFO ] Deduced a trap composed of 47 places in 184 ms of which 0 ms to minimize.
[2023-03-22 09:20:44] [INFO ] Deduced a trap composed of 41 places in 228 ms of which 1 ms to minimize.
[2023-03-22 09:20:45] [INFO ] Deduced a trap composed of 48 places in 198 ms of which 1 ms to minimize.
[2023-03-22 09:20:45] [INFO ] Deduced a trap composed of 34 places in 202 ms of which 1 ms to minimize.
[2023-03-22 09:20:45] [INFO ] Deduced a trap composed of 40 places in 231 ms of which 0 ms to minimize.
[2023-03-22 09:20:46] [INFO ] Deduced a trap composed of 37 places in 231 ms of which 0 ms to minimize.
[2023-03-22 09:20:46] [INFO ] Deduced a trap composed of 31 places in 234 ms of which 0 ms to minimize.
[2023-03-22 09:20:46] [INFO ] Deduced a trap composed of 30 places in 161 ms of which 4 ms to minimize.
[2023-03-22 09:20:46] [INFO ] Deduced a trap composed of 37 places in 256 ms of which 1 ms to minimize.
[2023-03-22 09:20:46] [INFO ] Trap strengthening (SAT) tested/added 32/31 trap constraints in 9797 ms
[2023-03-22 09:20:47] [INFO ] Deduced a trap composed of 30 places in 190 ms of which 0 ms to minimize.
[2023-03-22 09:20:47] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 09:20:47] [INFO ] After 25089ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:117
Fused 117 Parikh solutions to 111 different solutions.
Parikh walk visited 0 properties in 11220 ms.
Support contains 117 out of 1003 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1003/1003 places, 1003/1003 transitions.
Drop transitions removed 285 transitions
Trivial Post-agglo rules discarded 285 transitions
Performed 285 trivial Post agglomeration. Transition count delta: 285
Iterating post reduction 0 with 285 rules applied. Total rules applied 285 place count 1003 transition count 718
Reduce places removed 285 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 287 rules applied. Total rules applied 572 place count 718 transition count 716
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 573 place count 717 transition count 716
Performed 68 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 68 Pre rules applied. Total rules applied 573 place count 717 transition count 648
Deduced a syphon composed of 68 places in 5 ms
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 3 with 136 rules applied. Total rules applied 709 place count 649 transition count 648
Discarding 109 places :
Symmetric choice reduction at 3 with 109 rule applications. Total rules 818 place count 540 transition count 539
Iterating global reduction 3 with 109 rules applied. Total rules applied 927 place count 540 transition count 539
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 45 Pre rules applied. Total rules applied 927 place count 540 transition count 494
Deduced a syphon composed of 45 places in 2 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 3 with 90 rules applied. Total rules applied 1017 place count 495 transition count 494
Performed 180 Post agglomeration using F-continuation condition.Transition count delta: 180
Deduced a syphon composed of 180 places in 1 ms
Reduce places removed 180 places and 0 transitions.
Iterating global reduction 3 with 360 rules applied. Total rules applied 1377 place count 315 transition count 314
Renaming transitions due to excessive name length > 1024 char.
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: -34
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 1457 place count 275 transition count 348
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1458 place count 275 transition count 347
Free-agglomeration rule applied 9 times.
Iterating global reduction 4 with 9 rules applied. Total rules applied 1467 place count 275 transition count 338
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 1476 place count 266 transition count 338
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 1479 place count 266 transition count 335
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1480 place count 265 transition count 334
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1481 place count 264 transition count 334
Applied a total of 1481 rules in 261 ms. Remains 264 /1003 variables (removed 739) and now considering 334/1003 (removed 669) transitions.
Finished structural reductions, in 1 iterations. Remains : 264/1003 places, 334/1003 transitions.
Finished random walk after 138141 steps, including 44 resets, run visited all 117 properties in 3915 ms. (steps per millisecond=35 )
Able to resolve query StableMarking after proving 603 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK MARKED_SUFFIX_TEST TOPOLOGICAL
Total runtime 43861 ms.

BK_STOP 1679476862809

--------------------
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="ShieldRVt-PT-020B"
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 ShieldRVt-PT-020B, 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 r448-tajo-167905989700178"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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