About the Execution of ITS-Tools for RERS17pb113-PT-3
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
16248.128 | 1800000.00 | 3233476.00 | 36918.80 | [undef] | Time out reached |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2021-input.r185-tajo-162089425200086.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2021-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 itstools
Input is RERS17pb113-PT-3, examination is ReachabilityDeadlock
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r185-tajo-162089425200086
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 15M
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 123K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 21K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 108K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.3K Mar 28 16:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 28 16:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 28 16:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K Mar 27 10:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K Mar 27 10:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 25 13:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K Mar 25 13:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 08:13 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 22 08:13 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 2 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 15M May 5 16:51 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 1621333848417
Running Version 0
[2021-05-18 10:30:49] [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]
[2021-05-18 10:30:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-18 10:30:50] [INFO ] Load time of PNML (sax parser for PT used): 665 ms
[2021-05-18 10:30:50] [INFO ] Transformed 639 places.
[2021-05-18 10:30:50] [INFO ] Transformed 31353 transitions.
[2021-05-18 10:30:50] [INFO ] Parsed PT model containing 639 places and 31353 transitions in 818 ms.
Parsed 1 properties from file /home/mcc/execution/ReachabilityDeadlock.xml in 4 ms.
Working with output stream class java.io.PrintStream
Built sparse matrix representations for Structural reductions in 20 ms.75412KB 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 658 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 951199 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=31 )
[2021-05-18 10:31:21] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
// Phase 1: matrix 18325 rows 626 cols
[2021-05-18 10:31:21] [INFO ] Computed 13 place invariants in 119 ms
[2021-05-18 10:31:25] [INFO ] [Real]Absence check using 13 positive place invariants in 21 ms returned sat
[2021-05-18 10:31:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 10:31:38] [INFO ] [Real]Absence check using state equation in 12497 ms returned sat
[2021-05-18 10:31:38] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 10:31:42] [INFO ] [Nat]Absence check using 13 positive place invariants in 11 ms returned sat
[2021-05-18 10:31:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 10:31:57] [INFO ] [Nat]Absence check using state equation in 14972 ms returned sat
[2021-05-18 10:31:57] [INFO ] State equation strengthened by 829 read => feed constraints.
[2021-05-18 10:32:02] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-18 10:32:03] [INFO ] [Nat]Added 829 Read/Feed constraints in 5551 ms returned sat
[2021-05-18 10:32:06] [INFO ] Deduced a trap composed of 48 places in 2468 ms of which 4 ms to minimize.
[2021-05-18 10:32:08] [INFO ] Deduced a trap composed of 24 places in 1699 ms of which 1 ms to minimize.
[2021-05-18 10:32:10] [INFO ] Deduced a trap composed of 64 places in 1342 ms of which 1 ms to minimize.
[2021-05-18 10:32:11] [INFO ] Deduced a trap composed of 48 places in 1293 ms of which 15 ms to minimize.
[2021-05-18 10:32:13] [INFO ] Deduced a trap composed of 64 places in 1042 ms of which 0 ms to minimize.
[2021-05-18 10:32:16] [INFO ] Deduced a trap composed of 65 places in 1786 ms of which 0 ms to minimize.
[2021-05-18 10:32:18] [INFO ] Deduced a trap composed of 48 places in 1522 ms of which 1 ms to minimize.
[2021-05-18 10:32:20] [INFO ] Deduced a trap composed of 40 places in 1314 ms of which 1 ms to minimize.
[2021-05-18 10:32:22] [INFO ] Deduced a trap composed of 64 places in 1598 ms of which 0 ms to minimize.
[2021-05-18 10:32:23] [INFO ] Deduced a trap composed of 64 places in 953 ms of which 1 ms to minimize.
[2021-05-18 10:32:25] [INFO ] Deduced a trap composed of 40 places in 1140 ms of which 0 ms to minimize.
[2021-05-18 10:32:27] [INFO ] Deduced a trap composed of 64 places in 975 ms of which 0 ms to minimize.
[2021-05-18 10:32:29] [INFO ] Deduced a trap composed of 48 places in 1286 ms of which 0 ms to minimize.
[2021-05-18 10:32:31] [INFO ] Deduced a trap composed of 40 places in 1292 ms of which 1 ms to minimize.
[2021-05-18 10:32:32] [INFO ] Deduced a trap composed of 40 places in 1307 ms of which 1 ms to minimize.
[2021-05-18 10:32:34] [INFO ] Deduced a trap composed of 64 places in 1137 ms of which 0 ms to minimize.
[2021-05-18 10:32:35] [INFO ] Deduced a trap composed of 64 places in 581 ms of which 0 ms to minimize.
[2021-05-18 10:32:38] [INFO ] Deduced a trap composed of 48 places in 1049 ms of which 0 ms to minimize.
[2021-05-18 10:32:39] [INFO ] Deduced a trap composed of 40 places in 552 ms of which 0 ms to minimize.
[2021-05-18 10:32:40] [INFO ] Deduced a trap composed of 48 places in 614 ms of which 1 ms to minimize.
[2021-05-18 10:32:41] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 38317 ms
[2021-05-18 10:32:44] [INFO ] Computed and/alt/rep : 1/9/1 causal constraints (skipped 18323 transitions) in 2916 ms.
[2021-05-18 10:32:47] [INFO ] Added : 1 causal constraints over 1 iterations in 5953 ms. Result :sat
Interrupted Parikh directed walk after 935031 steps, including 1000 resets, run timeout after 30001 ms. (steps per millisecond=31 )
Parikh directed walk for 935031 steps, including 1000 resets, run took 30001 ms. (steps per millisecond=31 )
Random directed walk for 500000 steps, including 0 resets, run took 20979 ms (no deadlock found). (steps per millisecond=23 )
Random walk for 500000 steps, including 0 resets, run took 14168 ms (no deadlock found). (steps per millisecond=35 )
Random directed walk for 500017 steps, including 0 resets, run took 21114 ms (no deadlock found). (steps per millisecond=23 )
Random walk for 500000 steps, including 0 resets, run took 13122 ms (no deadlock found). (steps per millisecond=38 )
Starting structural reductions, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 161 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
[2021-05-18 10:34:27] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
// Phase 1: matrix 18325 rows 626 cols
[2021-05-18 10:34:27] [INFO ] Computed 13 place invariants in 77 ms
[2021-05-18 10:34:29] [INFO ] Implicit Places using invariants in 2088 ms returned []
Implicit Place search using SMT only with invariants took 2089 ms to find 0 implicit places.
[2021-05-18 10:34:29] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
// Phase 1: matrix 18325 rows 626 cols
[2021-05-18 10:34:29] [INFO ] Computed 13 place invariants in 41 ms
[2021-05-18 10:34:38] [INFO ] Dead Transitions using invariants and state equation in 8387 ms returned []
Finished structural reductions, in 1 iterations. Remains : 626/626 places, 31352/31352 transitions.
Interrupted Random walk after 1083650 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=36 )
[2021-05-18 10:35:08] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
// Phase 1: matrix 18325 rows 626 cols
[2021-05-18 10:35:08] [INFO ] Computed 13 place invariants in 77 ms
[2021-05-18 10:35:11] [INFO ] [Real]Absence check using 13 positive place invariants in 16 ms returned sat
[2021-05-18 10:35:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 10:35:26] [INFO ] [Real]Absence check using state equation in 14414 ms returned sat
[2021-05-18 10:35:26] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 10:35:29] [INFO ] [Nat]Absence check using 13 positive place invariants in 11 ms returned sat
[2021-05-18 10:35:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 10:35:44] [INFO ] [Nat]Absence check using state equation in 14953 ms returned sat
[2021-05-18 10:35:45] [INFO ] State equation strengthened by 829 read => feed constraints.
[2021-05-18 10:35:50] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-18 10:35:51] [INFO ] [Nat]Added 829 Read/Feed constraints in 6333 ms returned sat
[2021-05-18 10:35:54] [INFO ] Deduced a trap composed of 48 places in 2024 ms of which 1 ms to minimize.
[2021-05-18 10:35:56] [INFO ] Deduced a trap composed of 24 places in 1430 ms of which 1 ms to minimize.
[2021-05-18 10:35:58] [INFO ] Deduced a trap composed of 40 places in 1482 ms of which 0 ms to minimize.
[2021-05-18 10:36:00] [INFO ] Deduced a trap composed of 64 places in 1616 ms of which 1 ms to minimize.
[2021-05-18 10:36:02] [INFO ] Deduced a trap composed of 40 places in 1657 ms of which 0 ms to minimize.
[2021-05-18 10:36:04] [INFO ] Deduced a trap composed of 64 places in 1704 ms of which 1 ms to minimize.
[2021-05-18 10:36:06] [INFO ] Deduced a trap composed of 64 places in 1074 ms of which 1 ms to minimize.
[2021-05-18 10:36:07] [INFO ] Deduced a trap composed of 64 places in 1172 ms of which 6 ms to minimize.
[2021-05-18 10:36:10] [INFO ] Deduced a trap composed of 64 places in 1526 ms of which 0 ms to minimize.
[2021-05-18 10:36:12] [INFO ] Deduced a trap composed of 64 places in 1786 ms of which 0 ms to minimize.
[2021-05-18 10:36:14] [INFO ] Deduced a trap composed of 64 places in 1660 ms of which 1 ms to minimize.
[2021-05-18 10:36:16] [INFO ] Deduced a trap composed of 40 places in 1415 ms of which 0 ms to minimize.
[2021-05-18 10:36:18] [INFO ] Deduced a trap composed of 40 places in 1324 ms of which 0 ms to minimize.
[2021-05-18 10:36:20] [INFO ] Deduced a trap composed of 48 places in 991 ms of which 1 ms to minimize.
[2021-05-18 10:36:22] [INFO ] Deduced a trap composed of 65 places in 907 ms of which 4 ms to minimize.
[2021-05-18 10:36:23] [INFO ] Deduced a trap composed of 40 places in 830 ms of which 1 ms to minimize.
[2021-05-18 10:36:25] [INFO ] Deduced a trap composed of 64 places in 844 ms of which 2 ms to minimize.
[2021-05-18 10:36:27] [INFO ] Deduced a trap composed of 48 places in 646 ms of which 1 ms to minimize.
[2021-05-18 10:36:28] [INFO ] Deduced a trap composed of 40 places in 513 ms of which 0 ms to minimize.
[2021-05-18 10:36:29] [INFO ] Deduced a trap composed of 48 places in 601 ms of which 1 ms to minimize.
[2021-05-18 10:36:31] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 39461 ms
[2021-05-18 10:36:33] [INFO ] Computed and/alt/rep : 1/9/1 causal constraints (skipped 18323 transitions) in 2455 ms.
[2021-05-18 10:36:36] [INFO ] Added : 1 causal constraints over 1 iterations in 5126 ms. Result :sat
Interrupted Parikh directed walk after 1046015 steps, including 1000 resets, run timeout after 30001 ms. (steps per millisecond=34 )
Parikh directed walk for 1046015 steps, including 1000 resets, run took 30001 ms. (steps per millisecond=34 )
Random directed walk for 500006 steps, including 0 resets, run took 20532 ms (no deadlock found). (steps per millisecond=24 )
Random walk for 500000 steps, including 0 resets, run took 13529 ms (no deadlock found). (steps per millisecond=36 )
Random directed walk for 500014 steps, including 0 resets, run took 21015 ms (no deadlock found). (steps per millisecond=23 )
Random walk for 500000 steps, including 0 resets, run took 13425 ms (no deadlock found). (steps per millisecond=37 )
[2021-05-18 10:38:17] [INFO ] Flatten gal took : 1105 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin3114638548353670797
[2021-05-18 10:38:17] [INFO ] Too many transitions (31353) to apply POR reductions. Disabling POR matrices.
[2021-05-18 10:38:18] [INFO ] Built C files in 492ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3114638548353670797
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/ltsmin3114638548353670797]
[2021-05-18 10:38:18] [INFO ] Applying decomposition
[2021-05-18 10:38:19] [INFO ] Flatten gal took : 967 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/graph12183168991119635964.txt, -o, /tmp/graph12183168991119635964.bin, -w, /tmp/graph12183168991119635964.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/graph12183168991119635964.bin, -l, -1, -v, -w, /tmp/graph12183168991119635964.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-18 10:38:21] [INFO ] Decomposing Gal with order
[2021-05-18 10:38:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-18 10:38:25] [INFO ] Removed a total of 91910 redundant transitions.
[2021-05-18 10:38:25] [INFO ] Flatten gal took : 1919 ms
[2021-05-18 10:38:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 1485 labels/synchronizations in 1198 ms.
[2021-05-18 10:38:27] [INFO ] Time to serialize gal into /tmp/ReachabilityDeadlock10412125700564971970.gal : 204 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/ReachabilityDeadlock10412125700564971970.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/ReachabilityDeadlock10412125700564971970.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/ltsmin3114638548353670797] 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/ltsmin3114638548353670797] 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
[2021-05-18 10:46:50] [INFO ] Flatten gal took : 2635 ms
[2021-05-18 10:46:51] [INFO ] Time to serialize gal into /tmp/ReachabilityDeadlock14174528532394674006.gal : 119 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/ReachabilityDeadlock14174528532394674006.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/ReachabilityDeadlock14174528532394674006.gal -t CGAL -ctl DEADLOCK --gen-order FOLLOW
No direction supplied, using forward translation only.
Detected timeout of ITS tools.
[2021-05-18 10:59:30] [INFO ] Flatten gal took : 6163 ms
[2021-05-18 10:59:33] [INFO ] Input system was already deterministic with 31353 transitions.
[2021-05-18 10:59:33] [INFO ] Transformed 639 places.
[2021-05-18 10:59:34] [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
[2021-05-18 10:59:37] [INFO ] Time to serialize gal into /tmp/ReachabilityDeadlock9792139530966865285.gal : 90 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/ReachabilityDeadlock9792139530966865285.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/ReachabilityDeadlock9792139530966865285.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-3"
export BK_EXAMINATION="ReachabilityDeadlock"
export BK_TOOL="itstools"
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 itstools"
echo " Input is RERS17pb113-PT-3, 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 r185-tajo-162089425200086"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/RERS17pb113-PT-3.tgz
mv RERS17pb113-PT-3 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 '
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 ;