fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r150-smll-165276998500223
Last Updated
Jun 22, 2022

About the Execution of ITS-Tools for NoC3x3-PT-7B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1067.747 77531.00 120012.00 308.20 TTTTTFTFFTFTFTFT normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r150-smll-165276998500223.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is NoC3x3-PT-7B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r150-smll-165276998500223
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.4M
-rw-r--r-- 1 mcc users 8.2K Apr 29 13:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K Apr 29 13:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Apr 29 13:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Apr 29 13:04 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 9 08:22 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 9 08:22 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 9 08:22 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 08:22 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 29 13:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 138K Apr 29 13:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Apr 29 13:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Apr 29 13:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:22 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 9 08:22 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 2.0M May 10 09:34 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME NoC3x3-PT-7B-ReachabilityFireability-00
FORMULA_NAME NoC3x3-PT-7B-ReachabilityFireability-01
FORMULA_NAME NoC3x3-PT-7B-ReachabilityFireability-02
FORMULA_NAME NoC3x3-PT-7B-ReachabilityFireability-03
FORMULA_NAME NoC3x3-PT-7B-ReachabilityFireability-04
FORMULA_NAME NoC3x3-PT-7B-ReachabilityFireability-05
FORMULA_NAME NoC3x3-PT-7B-ReachabilityFireability-06
FORMULA_NAME NoC3x3-PT-7B-ReachabilityFireability-07
FORMULA_NAME NoC3x3-PT-7B-ReachabilityFireability-08
FORMULA_NAME NoC3x3-PT-7B-ReachabilityFireability-09
FORMULA_NAME NoC3x3-PT-7B-ReachabilityFireability-10
FORMULA_NAME NoC3x3-PT-7B-ReachabilityFireability-11
FORMULA_NAME NoC3x3-PT-7B-ReachabilityFireability-12
FORMULA_NAME NoC3x3-PT-7B-ReachabilityFireability-13
FORMULA_NAME NoC3x3-PT-7B-ReachabilityFireability-14
FORMULA_NAME NoC3x3-PT-7B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1654248634063

Running Version 202205111006
[2022-06-03 09:30:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -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, 3600]
[2022-06-03 09:30:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-03 09:30:36] [INFO ] Load time of PNML (sax parser for PT used): 570 ms
[2022-06-03 09:30:36] [INFO ] Transformed 7014 places.
[2022-06-03 09:30:36] [INFO ] Transformed 8833 transitions.
[2022-06-03 09:30:36] [INFO ] Found NUPN structural information;
[2022-06-03 09:30:36] [INFO ] Parsed PT model containing 7014 places and 8833 transitions in 874 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 25 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 3 resets, run finished after 979 ms. (steps per millisecond=10 ) properties (out of 16) seen :5
FORMULA NoC3x3-PT-7B-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7B-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7B-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7B-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7B-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 8833 rows 7014 cols
[2022-06-03 09:30:39] [INFO ] Computed 66 place invariants in 131 ms
[2022-06-03 09:30:43] [INFO ] After 3884ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2022-06-03 09:30:46] [INFO ] [Nat]Absence check using 66 positive place invariants in 118 ms returned sat
[2022-06-03 09:31:03] [INFO ] After 16096ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2022-06-03 09:31:05] [INFO ] Deduced a trap composed of 203 places in 843 ms of which 9 ms to minimize.
[2022-06-03 09:31:06] [INFO ] Deduced a trap composed of 205 places in 895 ms of which 3 ms to minimize.
[2022-06-03 09:31:07] [INFO ] Deduced a trap composed of 224 places in 560 ms of which 2 ms to minimize.
[2022-06-03 09:31:08] [INFO ] Deduced a trap composed of 223 places in 503 ms of which 1 ms to minimize.
[2022-06-03 09:31:08] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-06-03 09:31:08] [INFO ] After 25198ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:11
FORMULA NoC3x3-PT-7B-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA NoC3x3-PT-7B-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA NoC3x3-PT-7B-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA NoC3x3-PT-7B-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA NoC3x3-PT-7B-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA NoC3x3-PT-7B-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA NoC3x3-PT-7B-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA NoC3x3-PT-7B-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA NoC3x3-PT-7B-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA NoC3x3-PT-7B-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 10 properties in 41874 ms.
Support contains 35 out of 7014 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 7014/7014 places, 8833/8833 transitions.
Graph (trivial) has 7746 edges and 7014 vertex of which 4437 / 7014 are part of one of the 31 SCC in 45 ms
Free SCC test removed 4406 places
Drop transitions removed 5391 transitions
Reduce isomorphic transitions removed 5391 transitions.
Drop transitions removed 605 transitions
Trivial Post-agglo rules discarded 605 transitions
Performed 605 trivial Post agglomeration. Transition count delta: 605
Iterating post reduction 0 with 605 rules applied. Total rules applied 606 place count 2608 transition count 2837
Reduce places removed 605 places and 0 transitions.
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 1 with 647 rules applied. Total rules applied 1253 place count 2003 transition count 2795
Reduce places removed 20 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Iterating post reduction 2 with 42 rules applied. Total rules applied 1295 place count 1983 transition count 2773
Reduce places removed 21 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 3 with 29 rules applied. Total rules applied 1324 place count 1962 transition count 2765
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 1327 place count 1959 transition count 2765
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 1327 place count 1959 transition count 2762
Deduced a syphon composed of 3 places in 9 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 1333 place count 1956 transition count 2762
Discarding 740 places :
Symmetric choice reduction at 5 with 740 rule applications. Total rules 2073 place count 1216 transition count 2019
Iterating global reduction 5 with 740 rules applied. Total rules applied 2813 place count 1216 transition count 2019
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 5 with 6 rules applied. Total rules applied 2819 place count 1216 transition count 2013
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 2821 place count 1214 transition count 2013
Performed 53 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 53 Pre rules applied. Total rules applied 2821 place count 1214 transition count 1960
Deduced a syphon composed of 53 places in 6 ms
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 7 with 106 rules applied. Total rules applied 2927 place count 1161 transition count 1960
Discarding 456 places :
Symmetric choice reduction at 7 with 456 rule applications. Total rules 3383 place count 705 transition count 1292
Iterating global reduction 7 with 456 rules applied. Total rules applied 3839 place count 705 transition count 1292
Ensure Unique test removed 382 transitions
Reduce isomorphic transitions removed 382 transitions.
Iterating post reduction 7 with 382 rules applied. Total rules applied 4221 place count 705 transition count 910
Discarding 6 places :
Symmetric choice reduction at 8 with 6 rule applications. Total rules 4227 place count 699 transition count 898
Iterating global reduction 8 with 6 rules applied. Total rules applied 4233 place count 699 transition count 898
Discarding 6 places :
Symmetric choice reduction at 8 with 6 rule applications. Total rules 4239 place count 693 transition count 892
Iterating global reduction 8 with 6 rules applied. Total rules applied 4245 place count 693 transition count 892
Discarding 6 places :
Symmetric choice reduction at 8 with 6 rule applications. Total rules 4251 place count 687 transition count 884
Iterating global reduction 8 with 6 rules applied. Total rules applied 4257 place count 687 transition count 884
Discarding 6 places :
Symmetric choice reduction at 8 with 6 rule applications. Total rules 4263 place count 681 transition count 872
Iterating global reduction 8 with 6 rules applied. Total rules applied 4269 place count 681 transition count 872
Performed 179 Post agglomeration using F-continuation condition with reduction of 7 identical transitions.
Deduced a syphon composed of 179 places in 0 ms
Reduce places removed 179 places and 0 transitions.
Iterating global reduction 8 with 358 rules applied. Total rules applied 4627 place count 502 transition count 686
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 8 with 15 rules applied. Total rules applied 4642 place count 502 transition count 671
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 9 with 18 rules applied. Total rules applied 4660 place count 493 transition count 662
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 4662 place count 493 transition count 660
Performed 39 Post agglomeration using F-continuation condition with reduction of 75 identical transitions.
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 10 with 78 rules applied. Total rules applied 4740 place count 454 transition count 719
Ensure Unique test removed 44 transitions
Reduce isomorphic transitions removed 44 transitions.
Iterating post reduction 10 with 44 rules applied. Total rules applied 4784 place count 454 transition count 675
Performed 3 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 11 with 6 rules applied. Total rules applied 4790 place count 451 transition count 713
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 11 with 27 rules applied. Total rules applied 4817 place count 451 transition count 686
Performed 3 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 12 with 6 rules applied. Total rules applied 4823 place count 448 transition count 722
Drop transitions removed 1 transitions
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 12 with 13 rules applied. Total rules applied 4836 place count 448 transition count 709
Drop transitions removed 23 transitions
Redundant transition composition rules discarded 23 transitions
Iterating global reduction 13 with 23 rules applied. Total rules applied 4859 place count 448 transition count 686
Discarding 5 places :
Symmetric choice reduction at 13 with 5 rule applications. Total rules 4864 place count 443 transition count 679
Iterating global reduction 13 with 5 rules applied. Total rules applied 4869 place count 443 transition count 679
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 4871 place count 442 transition count 693
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 13 with 8 rules applied. Total rules applied 4879 place count 442 transition count 685
Discarding 2 places :
Symmetric choice reduction at 13 with 2 rule applications. Total rules 4881 place count 440 transition count 683
Iterating global reduction 13 with 2 rules applied. Total rules applied 4883 place count 440 transition count 683
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 13 with 3 rules applied. Total rules applied 4886 place count 440 transition count 680
Discarding 1 places :
Symmetric choice reduction at 13 with 1 rule applications. Total rules 4887 place count 439 transition count 679
Iterating global reduction 13 with 1 rules applied. Total rules applied 4888 place count 439 transition count 679
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 4889 place count 439 transition count 678
Free-agglomeration rule applied 189 times.
Iterating global reduction 13 with 189 rules applied. Total rules applied 5078 place count 439 transition count 489
Reduce places removed 189 places and 0 transitions.
Drop transitions removed 37 transitions
Reduce isomorphic transitions removed 37 transitions.
Graph (complete) has 842 edges and 250 vertex of which 184 are kept as prefixes of interest. Removing 66 places using SCC suffix rule.6 ms
Discarding 66 places :
Also discarding 9 output transitions
Drop transitions removed 9 transitions
Iterating post reduction 13 with 227 rules applied. Total rules applied 5305 place count 184 transition count 443
Drop transitions removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Iterating post reduction 14 with 72 rules applied. Total rules applied 5377 place count 184 transition count 371
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 15 with 8 rules applied. Total rules applied 5385 place count 184 transition count 363
Free-agglomeration rule applied 2 times.
Iterating global reduction 15 with 2 rules applied. Total rules applied 5387 place count 184 transition count 361
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 15 with 2 rules applied. Total rules applied 5389 place count 182 transition count 361
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 16 with 2 rules applied. Total rules applied 5391 place count 182 transition count 359
Free-agglomeration rule applied 2 times.
Iterating global reduction 16 with 2 rules applied. Total rules applied 5393 place count 182 transition count 357
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 16 with 2 rules applied. Total rules applied 5395 place count 180 transition count 357
Applied a total of 5395 rules in 1266 ms. Remains 180 /7014 variables (removed 6834) and now considering 357/8833 (removed 8476) transitions.
Finished structural reductions, in 1 iterations. Remains : 180/7014 places, 357/8833 transitions.
Finished random walk after 115 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=28 )
FORMULA NoC3x3-PT-7B-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 75598 ms.

BK_STOP 1654248711594

--------------------
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
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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 ReachabilityFireability -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 3600 -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-7B"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
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-4028"
echo " Executing tool itstools"
echo " Input is NoC3x3-PT-7B, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r150-smll-165276998500223"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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