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

About the Execution of 2022-gold for NoC3x3-PT-4B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
248.216 60772.00 115946.00 269.70 T 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.r288-smll-167863554100177.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 NoC3x3-PT-4B, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r288-smll-167863554100177
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 6.5K Feb 26 10:13 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Feb 26 10:13 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 26 10:12 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 26 10:12 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 14K Feb 25 16:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.2K Feb 26 10:13 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 96K Feb 26 10:13 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Feb 26 10:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Feb 26 10:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 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 608K 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 QuasiLiveness

=== Now, execution of the tool begins

BK_START 1678902242199

Running Version 202205111006
[2023-03-15 17:44:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -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 17:44:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 17:44:05] [INFO ] Load time of PNML (sax parser for PT used): 555 ms
[2023-03-15 17:44:05] [INFO ] Transformed 2328 places.
[2023-03-15 17:44:05] [INFO ] Transformed 2701 transitions.
[2023-03-15 17:44:05] [INFO ] Found NUPN structural information;
[2023-03-15 17:44:05] [INFO ] Parsed PT model containing 2328 places and 2701 transitions in 793 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 2328/2328 places, 2701/2701 transitions.
Graph (trivial) has 2324 edges and 2328 vertex of which 1399 / 2328 are part of one of the 33 SCC in 33 ms
Free SCC test removed 1366 places
Ensure Unique test removed 1620 transitions
Reduce isomorphic transitions removed 1620 transitions.
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 34 place count 962 transition count 1048
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 67 place count 929 transition count 1048
Discarding 327 places :
Symmetric choice reduction at 2 with 327 rule applications. Total rules 394 place count 602 transition count 721
Iterating global reduction 2 with 327 rules applied. Total rules applied 721 place count 602 transition count 721
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 37 Pre rules applied. Total rules applied 721 place count 602 transition count 684
Deduced a syphon composed of 37 places in 6 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 795 place count 565 transition count 684
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 825 place count 535 transition count 654
Iterating global reduction 2 with 30 rules applied. Total rules applied 855 place count 535 transition count 654
Performed 130 Post agglomeration using F-continuation condition.Transition count delta: 130
Deduced a syphon composed of 130 places in 1 ms
Reduce places removed 130 places and 0 transitions.
Iterating global reduction 2 with 260 rules applied. Total rules applied 1115 place count 405 transition count 524
Applied a total of 1115 rules in 417 ms. Remains 405 /2328 variables (removed 1923) and now considering 524/2701 (removed 2177) transitions.
[2023-03-15 17:44:06] [INFO ] Flow matrix only has 458 transitions (discarded 66 similar events)
// Phase 1: matrix 458 rows 405 cols
[2023-03-15 17:44:06] [INFO ] Computed 66 place invariants in 26 ms
[2023-03-15 17:44:06] [INFO ] Implicit Places using invariants in 809 ms returned [13, 52, 95, 136, 197, 259, 302, 342, 385]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 862 ms to find 9 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 396/2328 places, 524/2701 transitions.
Graph (trivial) has 265 edges and 396 vertex of which 48 / 396 are part of one of the 24 SCC in 2 ms
Free SCC test removed 24 places
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Applied a total of 1 rules in 30 ms. Remains 372 /396 variables (removed 24) and now considering 476/524 (removed 48) transitions.
[2023-03-15 17:44:06] [INFO ] Flow matrix only has 410 transitions (discarded 66 similar events)
// Phase 1: matrix 410 rows 372 cols
[2023-03-15 17:44:06] [INFO ] Computed 57 place invariants in 6 ms
[2023-03-15 17:44:07] [INFO ] Implicit Places using invariants in 386 ms returned []
[2023-03-15 17:44:07] [INFO ] Flow matrix only has 410 transitions (discarded 66 similar events)
// Phase 1: matrix 410 rows 372 cols
[2023-03-15 17:44:07] [INFO ] Computed 57 place invariants in 3 ms
[2023-03-15 17:44:07] [INFO ] State equation strengthened by 15 read => feed constraints.
[2023-03-15 17:44:08] [INFO ] Implicit Places using invariants and state equation in 852 ms returned []
Implicit Place search using SMT with State Equation took 1258 ms to find 0 implicit places.
Starting structural reductions in LIVENESS mode, iteration 2 : 372/2328 places, 476/2701 transitions.
Finished structural reductions, in 2 iterations. Remains : 372/2328 places, 476/2701 transitions.
Discarding 184 transitions out of 476. Remains 292
Initial state reduction rules removed 1 formulas.
Incomplete random walk after 10000 steps, including 135 resets, run finished after 1201 ms. (steps per millisecond=8 ) properties (out of 291) seen :260
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 31) 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 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 31) seen :0
Running SMT prover for 31 properties.
[2023-03-15 17:44:09] [INFO ] Flow matrix only has 410 transitions (discarded 66 similar events)
// Phase 1: matrix 410 rows 372 cols
[2023-03-15 17:44:09] [INFO ] Computed 57 place invariants in 5 ms
[2023-03-15 17:44:10] [INFO ] [Real]Absence check using 57 positive place invariants in 21 ms returned sat
[2023-03-15 17:44:11] [INFO ] After 1254ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:30
[2023-03-15 17:44:11] [INFO ] State equation strengthened by 15 read => feed constraints.
[2023-03-15 17:44:11] [INFO ] After 61ms SMT Verify possible using 15 Read/Feed constraints in real domain returned unsat :0 sat :0 real:31
[2023-03-15 17:44:11] [INFO ] After 2267ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:31
[2023-03-15 17:44:12] [INFO ] [Nat]Absence check using 57 positive place invariants in 45 ms returned sat
[2023-03-15 17:44:13] [INFO ] After 900ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :31
[2023-03-15 17:44:14] [INFO ] After 990ms SMT Verify possible using 15 Read/Feed constraints in natural domain returned unsat :0 sat :31
[2023-03-15 17:44:16] [INFO ] After 2706ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :31
Attempting to minimize the solution found.
Minimization took 940 ms.
[2023-03-15 17:44:17] [INFO ] After 5436ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :31
Fused 31 Parikh solutions to 24 different solutions.
Parikh walk visited 0 properties in 25 ms.
Support contains 45 out of 372 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 372/372 places, 476/476 transitions.
Drop transitions removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 372 transition count 443
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 37 place count 368 transition count 435
Iterating global reduction 1 with 4 rules applied. Total rules applied 41 place count 368 transition count 435
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 45 place count 366 transition count 463
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 48 place count 366 transition count 460
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 50 place count 366 transition count 458
Free-agglomeration rule applied 159 times.
Iterating global reduction 2 with 159 rules applied. Total rules applied 209 place count 366 transition count 299
Reduce places removed 159 places and 0 transitions.
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 596 edges and 207 vertex of which 150 are kept as prefixes of interest. Removing 57 places using SCC suffix rule.7 ms
Discarding 57 places :
Also discarding 20 output transitions
Drop transitions removed 20 transitions
Iterating post reduction 2 with 165 rules applied. Total rules applied 374 place count 150 transition count 274
Drop transitions removed 56 transitions
Reduce isomorphic transitions removed 56 transitions.
Iterating post reduction 3 with 56 rules applied. Total rules applied 430 place count 150 transition count 218
Applied a total of 430 rules in 239 ms. Remains 150 /372 variables (removed 222) and now considering 218/476 (removed 258) transitions.
Finished structural reductions, in 1 iterations. Remains : 150/372 places, 218/476 transitions.
Interrupted random walk after 800774 steps, including 2 resets, run timeout after 30001 ms. (steps per millisecond=26 ) properties seen 21
Interrupted Best-First random walk after 713257 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=142 ) properties seen 3
Interrupted Best-First random walk after 842782 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=168 ) properties seen 2
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2319 ms. (steps per millisecond=431 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2343 ms. (steps per millisecond=426 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-15 17:45:02] [INFO ] Flow matrix only has 189 transitions (discarded 29 similar events)
// Phase 1: matrix 189 rows 150 cols
[2023-03-15 17:45:02] [INFO ] Computed 43 place invariants in 4 ms
[2023-03-15 17:45:02] [INFO ] [Real]Absence check using 43 positive place invariants in 15 ms returned sat
[2023-03-15 17:45:02] [INFO ] After 107ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2023-03-15 17:45:02] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-03-15 17:45:02] [INFO ] After 42ms SMT Verify possible using 110 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-15 17:45:02] [INFO ] After 234ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-15 17:45:02] [INFO ] [Nat]Absence check using 43 positive place invariants in 13 ms returned sat
[2023-03-15 17:45:02] [INFO ] After 111ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-15 17:45:02] [INFO ] After 39ms SMT Verify possible using 110 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-15 17:45:02] [INFO ] After 71ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 22 ms.
[2023-03-15 17:45:02] [INFO ] After 273ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 150 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 150/150 places, 218/218 transitions.
Graph (complete) has 430 edges and 150 vertex of which 116 are kept as prefixes of interest. Removing 34 places using SCC suffix rule.9 ms
Discarding 34 places :
Also discarding 34 output transitions
Drop transitions removed 34 transitions
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 116 transition count 178
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 7 place count 116 transition count 176
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 11 place count 114 transition count 176
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 26 place count 99 transition count 139
Iterating global reduction 1 with 15 rules applied. Total rules applied 41 place count 99 transition count 139
Free-agglomeration rule applied 10 times.
Iterating global reduction 1 with 10 rules applied. Total rules applied 51 place count 99 transition count 129
Reduce places removed 10 places and 0 transitions.
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 254 edges and 89 vertex of which 25 are kept as prefixes of interest. Removing 64 places using SCC suffix rule.1 ms
Discarding 64 places :
Also discarding 56 output transitions
Drop transitions removed 56 transitions
Iterating post reduction 1 with 17 rules applied. Total rules applied 68 place count 25 transition count 67
Drop transitions removed 31 transitions
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 2 with 42 rules applied. Total rules applied 110 place count 25 transition count 25
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 111 place count 24 transition count 24
Reduce places removed 7 places and 0 transitions.
Graph (trivial) has 12 edges and 17 vertex of which 9 / 17 are part of one of the 2 SCC in 0 ms
Free SCC test removed 7 places
Iterating post reduction 3 with 8 rules applied. Total rules applied 119 place count 10 transition count 24
Drop transitions removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 131 place count 10 transition count 12
Applied a total of 131 rules in 36 ms. Remains 10 /150 variables (removed 140) and now considering 12/218 (removed 206) transitions.
Finished structural reductions, in 1 iterations. Remains : 10/150 places, 12/218 transitions.
Finished random walk after 88 steps, including 2 resets, run visited all 2 properties in 2 ms. (steps per millisecond=44 )
Able to resolve query QuasiLiveness after proving 292 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK BESTFIRST_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 58098 ms.

BK_STOP 1678902302971

--------------------
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
+ [[ QuasiLiveness = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution QuasiLiveness -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 QuasiLiveness -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="NoC3x3-PT-4B"
export BK_EXAMINATION="QuasiLiveness"
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 NoC3x3-PT-4B, examination is QuasiLiveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r288-smll-167863554100177"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/NoC3x3-PT-4B.tgz
mv NoC3x3-PT-4B execution
cd execution
if [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "UpperBounds" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] || [ "QuasiLiveness" = "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 [ "QuasiLiveness" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "QuasiLiveness" != "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 "QuasiLiveness.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property QuasiLiveness.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "QuasiLiveness.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 '' QuasiLiveness.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] ; then
echo "FORMULA_NAME QuasiLiveness"
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 ;