Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2022-input.r198-tajo-165281579200021.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2022-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.....................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2021
Input is RERS17pb113-PT-5, examination is ReachabilityDeadlock
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r198-tajo-165281579200021
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 15M
-rw-r--r-- 1 mcc users 7.4K Apr 30 05:31 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K Apr 30 05:31 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Apr 30 05:29 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Apr 30 05:29 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K May 9 08:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 08:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 9 08:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 9 08:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 9 08:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 2 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 15M 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

FORMULA_NAME ReachabilityDeadlock

=== Now, execution of the tool begins

BK_START 1653290564147

Running Version 0
[2022-05-23 07:22:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityDeadlock, -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]
[2022-05-23 07:22:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-23 07:22:46] [INFO ] Load time of PNML (sax parser for PT used): 672 ms
[2022-05-23 07:22:46] [INFO ] Transformed 639 places.
[2022-05-23 07:22:46] [INFO ] Transformed 31353 transitions.
[2022-05-23 07:22:46] [INFO ] Parsed PT model containing 639 places and 31353 transitions in 841 ms.
Parsed 1 properties from file /home/mcc/execution/ReachabilityDeadlock.xml in 5 ms.
Working with output stream class java.io.PrintStream
Built sparse matrix representations for Structural reductions in 20 ms.72024KB memory used
Starting structural reductions, iteration 0 : 639/639 places, 31353/31353 transitions.
Ensure Unique test removed 12 places
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 627 transition count 31353
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 626 transition count 31352
Applied a total of 13 rules in 837 ms. Remains 626 /639 variables (removed 13) and now considering 31352/31353 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 626/639 places, 31352/31353 transitions.
Interrupted Random walk after 839795 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=27 )
[2022-05-23 07:23:17] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
// Phase 1: matrix 18325 rows 626 cols
[2022-05-23 07:23:18] [INFO ] Computed 13 place invariants in 281 ms
[2022-05-23 07:23:21] [INFO ] [Real]Absence check using 13 positive place invariants in 19 ms returned sat
[2022-05-23 07:23:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-23 07:23:35] [INFO ] [Real]Absence check using state equation in 13830 ms returned sat
[2022-05-23 07:23:36] [INFO ] Solution in real domain found non-integer solution.
[2022-05-23 07:23:40] [INFO ] [Nat]Absence check using 13 positive place invariants in 22 ms returned sat
[2022-05-23 07:23:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-23 07:23:54] [INFO ] [Nat]Absence check using state equation in 14512 ms returned sat
[2022-05-23 07:23:54] [INFO ] State equation strengthened by 829 read => feed constraints.
[2022-05-23 07:23:59] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-23 07:24:00] [INFO ] [Nat]Added 829 Read/Feed constraints in 5777 ms returned sat
[2022-05-23 07:24:02] [INFO ] Deduced a trap composed of 40 places in 1553 ms of which 9 ms to minimize.
[2022-05-23 07:24:05] [INFO ] Deduced a trap composed of 40 places in 1367 ms of which 2 ms to minimize.
[2022-05-23 07:24:07] [INFO ] Deduced a trap composed of 64 places in 1493 ms of which 1 ms to minimize.
[2022-05-23 07:24:09] [INFO ] Deduced a trap composed of 24 places in 1511 ms of which 2 ms to minimize.
[2022-05-23 07:24:11] [INFO ] Deduced a trap composed of 64 places in 1367 ms of which 1 ms to minimize.
[2022-05-23 07:24:14] [INFO ] Deduced a trap composed of 48 places in 1692 ms of which 1 ms to minimize.
[2022-05-23 07:24:16] [INFO ] Deduced a trap composed of 64 places in 1172 ms of which 0 ms to minimize.
[2022-05-23 07:24:17] [INFO ] Deduced a trap composed of 40 places in 960 ms of which 2 ms to minimize.
[2022-05-23 07:24:19] [INFO ] Deduced a trap composed of 65 places in 1135 ms of which 1 ms to minimize.
[2022-05-23 07:24:21] [INFO ] Deduced a trap composed of 64 places in 850 ms of which 1 ms to minimize.
[2022-05-23 07:24:23] [INFO ] Deduced a trap composed of 40 places in 1185 ms of which 0 ms to minimize.
[2022-05-23 07:24:24] [INFO ] Deduced a trap composed of 40 places in 869 ms of which 0 ms to minimize.
[2022-05-23 07:24:26] [INFO ] Deduced a trap composed of 112 places in 1131 ms of which 0 ms to minimize.
[2022-05-23 07:24:27] [INFO ] Deduced a trap composed of 48 places in 1048 ms of which 2 ms to minimize.
[2022-05-23 07:24:29] [INFO ] Deduced a trap composed of 48 places in 947 ms of which 1 ms to minimize.
[2022-05-23 07:24:30] [INFO ] Deduced a trap composed of 40 places in 795 ms of which 0 ms to minimize.
[2022-05-23 07:24:32] [INFO ] Deduced a trap composed of 48 places in 942 ms of which 1 ms to minimize.
[2022-05-23 07:24:34] [INFO ] Deduced a trap composed of 64 places in 1285 ms of which 0 ms to minimize.
[2022-05-23 07:24:36] [INFO ] Deduced a trap composed of 64 places in 958 ms of which 1 ms to minimize.
[2022-05-23 07:24:37] [INFO ] Deduced a trap composed of 64 places in 850 ms of which 1 ms to minimize.
[2022-05-23 07:24:39] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 38677 ms
[2022-05-23 07:24:42] [INFO ] Computed and/alt/rep : 1/9/1 causal constraints (skipped 18323 transitions) in 2847 ms.
[2022-05-23 07:24:45] [INFO ] Added : 1 causal constraints over 1 iterations in 5785 ms. Result :sat
Interrupted Parikh directed walk after 901722 steps, including 1000 resets, run timeout after 30001 ms. (steps per millisecond=30 )
Parikh directed walk for 901722 steps, including 1000 resets, run took 30001 ms. (steps per millisecond=30 )
Random directed walk for 500001 steps, including 0 resets, run took 24681 ms (no deadlock found). (steps per millisecond=20 )
Random walk for 500000 steps, including 0 resets, run took 14017 ms (no deadlock found). (steps per millisecond=35 )
Random directed walk for 500005 steps, including 0 resets, run took 25571 ms (no deadlock found). (steps per millisecond=19 )
Random walk for 500000 steps, including 0 resets, run took 14689 ms (no deadlock found). (steps per millisecond=34 )
Starting structural reductions, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 204 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
[2022-05-23 07:26:34] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
// Phase 1: matrix 18325 rows 626 cols
[2022-05-23 07:26:34] [INFO ] Computed 13 place invariants in 102 ms
[2022-05-23 07:26:36] [INFO ] Implicit Places using invariants in 1797 ms returned []
Implicit Place search using SMT only with invariants took 1811 ms to find 0 implicit places.
[2022-05-23 07:26:36] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
// Phase 1: matrix 18325 rows 626 cols
[2022-05-23 07:26:36] [INFO ] Computed 13 place invariants in 42 ms
[2022-05-23 07:26:44] [INFO ] Dead Transitions using invariants and state equation in 7667 ms returned []
Finished structural reductions, in 1 iterations. Remains : 626/626 places, 31352/31352 transitions.
Interrupted Random walk after 943883 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=31 )
[2022-05-23 07:27:14] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
// Phase 1: matrix 18325 rows 626 cols
[2022-05-23 07:27:14] [INFO ] Computed 13 place invariants in 78 ms
[2022-05-23 07:27:17] [INFO ] [Real]Absence check using 13 positive place invariants in 15 ms returned sat
[2022-05-23 07:27:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-23 07:27:32] [INFO ] [Real]Absence check using state equation in 14772 ms returned sat
[2022-05-23 07:27:32] [INFO ] Solution in real domain found non-integer solution.
[2022-05-23 07:27:36] [INFO ] [Nat]Absence check using 13 positive place invariants in 19 ms returned sat
[2022-05-23 07:27:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-23 07:27:50] [INFO ] [Nat]Absence check using state equation in 14162 ms returned sat
[2022-05-23 07:27:50] [INFO ] State equation strengthened by 829 read => feed constraints.
[2022-05-23 07:27:56] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-23 07:27:56] [INFO ] [Nat]Added 829 Read/Feed constraints in 5920 ms returned sat
[2022-05-23 07:27:58] [INFO ] Deduced a trap composed of 40 places in 1478 ms of which 0 ms to minimize.
[2022-05-23 07:28:00] [INFO ] Deduced a trap composed of 40 places in 1439 ms of which 0 ms to minimize.
[2022-05-23 07:28:02] [INFO ] Deduced a trap composed of 48 places in 1509 ms of which 0 ms to minimize.
[2022-05-23 07:28:04] [INFO ] Deduced a trap composed of 24 places in 1043 ms of which 1 ms to minimize.
[2022-05-23 07:28:06] [INFO ] Deduced a trap composed of 48 places in 1203 ms of which 0 ms to minimize.
[2022-05-23 07:28:07] [INFO ] Deduced a trap composed of 40 places in 746 ms of which 1 ms to minimize.
[2022-05-23 07:28:09] [INFO ] Deduced a trap composed of 64 places in 781 ms of which 1 ms to minimize.
[2022-05-23 07:28:11] [INFO ] Deduced a trap composed of 64 places in 1069 ms of which 1 ms to minimize.
[2022-05-23 07:28:12] [INFO ] Deduced a trap composed of 64 places in 1394 ms of which 1 ms to minimize.
[2022-05-23 07:28:15] [INFO ] Deduced a trap composed of 48 places in 1798 ms of which 0 ms to minimize.
[2022-05-23 07:28:17] [INFO ] Deduced a trap composed of 40 places in 1519 ms of which 0 ms to minimize.
[2022-05-23 07:28:19] [INFO ] Deduced a trap composed of 64 places in 1430 ms of which 0 ms to minimize.
[2022-05-23 07:28:20] [INFO ] Deduced a trap composed of 65 places in 1137 ms of which 0 ms to minimize.
[2022-05-23 07:28:22] [INFO ] Deduced a trap composed of 48 places in 1038 ms of which 2 ms to minimize.
[2022-05-23 07:28:24] [INFO ] Deduced a trap composed of 40 places in 1104 ms of which 12 ms to minimize.
[2022-05-23 07:28:26] [INFO ] Deduced a trap composed of 64 places in 823 ms of which 1 ms to minimize.
[2022-05-23 07:28:27] [INFO ] Deduced a trap composed of 64 places in 1269 ms of which 0 ms to minimize.
[2022-05-23 07:28:29] [INFO ] Deduced a trap composed of 40 places in 947 ms of which 1 ms to minimize.
[2022-05-23 07:28:31] [INFO ] Deduced a trap composed of 64 places in 1121 ms of which 0 ms to minimize.
[2022-05-23 07:28:32] [INFO ] Deduced a trap composed of 64 places in 721 ms of which 1 ms to minimize.
[2022-05-23 07:28:34] [INFO ] Deduced a trap composed of 48 places in 561 ms of which 0 ms to minimize.
[2022-05-23 07:28:35] [INFO ] Deduced a trap composed of 48 places in 515 ms of which 0 ms to minimize.
[2022-05-23 07:28:36] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 39813 ms
[2022-05-23 07:28:39] [INFO ] Computed and/alt/rep : 1/9/1 causal constraints (skipped 18323 transitions) in 2649 ms.
[2022-05-23 07:28:42] [INFO ] Added : 1 causal constraints over 1 iterations in 5528 ms. Result :sat
Interrupted Parikh directed walk after 913100 steps, including 1000 resets, run timeout after 30001 ms. (steps per millisecond=30 )
Parikh directed walk for 913100 steps, including 1000 resets, run took 30001 ms. (steps per millisecond=30 )
Random directed walk for 500025 steps, including 0 resets, run took 24828 ms (no deadlock found). (steps per millisecond=20 )
Random walk for 500000 steps, including 0 resets, run took 13342 ms (no deadlock found). (steps per millisecond=37 )
Random directed walk for 500005 steps, including 0 resets, run took 24774 ms (no deadlock found). (steps per millisecond=20 )
Random walk for 500000 steps, including 0 resets, run took 13927 ms (no deadlock found). (steps per millisecond=35 )
[2022-05-23 07:30:31] [INFO ] Flatten gal took : 1194 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin17965132831903610264
[2022-05-23 07:30:32] [INFO ] Too many transitions (31353) to apply POR reductions. Disabling POR matrices.
[2022-05-23 07:30:32] [INFO ] Built C files in 591ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17965132831903610264
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin17965132831903610264]
[2022-05-23 07:30:32] [INFO ] Applying decomposition
[2022-05-23 07:30:33] [INFO ] Flatten gal took : 964 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph1883761423001029133.txt, -o, /tmp/graph1883761423001029133.bin, -w, /tmp/graph1883761423001029133.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph1883761423001029133.bin, -l, -1, -v, -w, /tmp/graph1883761423001029133.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-05-23 07:30:36] [INFO ] Decomposing Gal with order
[2022-05-23 07:30:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-23 07:30:39] [INFO ] Removed a total of 91910 redundant transitions.
[2022-05-23 07:30:39] [INFO ] Flatten gal took : 1889 ms
[2022-05-23 07:30:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 1556 labels/synchronizations in 1477 ms.
[2022-05-23 07:30:42] [INFO ] Time to serialize gal into /tmp/ReachabilityDeadlock2495220692905914170.gal : 429 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityDeadlock2495220692905914170.gal, -t, CGAL, -ctl, DEADLOCK], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityDeadlock2495220692905914170.gal -t CGAL -ctl DEADLOCK
No direction supplied, using forward translation only.
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin17965132831903610264] killed by timeout after 180 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin17965132831903610264] killed by timeout after 180 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
ITS-tools command line returned an error code 137
[2022-05-23 07:38:59] [INFO ] Flatten gal took : 1029 ms
[2022-05-23 07:39:00] [INFO ] Time to serialize gal into /tmp/ReachabilityDeadlock16239297398432430491.gal : 149 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityDeadlock16239297398432430491.gal, -t, CGAL, -ctl, DEADLOCK, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityDeadlock16239297398432430491.gal -t CGAL -ctl DEADLOCK --gen-order FOLLOW
No direction supplied, using forward translation only.
ITS-tools command line returned an error code 137
[2022-05-23 07:50:06] [INFO ] Flatten gal took : 854 ms
[2022-05-23 07:50:09] [INFO ] Input system was already deterministic with 31353 transitions.
[2022-05-23 07:50:09] [INFO ] Transformed 639 places.
[2022-05-23 07:50:09] [INFO ] Transformed 31353 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-05-23 07:50:12] [INFO ] Time to serialize gal into /tmp/ReachabilityDeadlock16052150753950492274.gal : 95 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityDeadlock16052150753950492274.gal, -t, CGAL, -ctl, DEADLOCK, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityDeadlock16052150753950492274.gal -t CGAL -ctl DEADLOCK --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityDeadlock = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityDeadlock -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination ReachabilityDeadlock -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=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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="RERS17pb113-PT-5"
export BK_EXAMINATION="ReachabilityDeadlock"
export BK_TOOL="gold2021"
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-4028"
echo " Executing tool gold2021"
echo " Input is RERS17pb113-PT-5, examination is ReachabilityDeadlock"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r198-tajo-165281579200021"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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