fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r319-tall-165472290100406
Last Updated
Jun 22, 2022

About the Execution of ITS-Tools for RERS2020-PT-pb104

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16216.527 1447673.00 1981746.00 14276.60 [undef] Cannot compute

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.r319-tall-165472290100406.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 RERS2020-PT-pb104, examination is ReachabilityDeadlock
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r319-tall-165472290100406
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 80M
-rw-r--r-- 1 mcc users 7.4K Jun 7 17:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Jun 7 17:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Jun 7 17:42 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Jun 7 17:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Jun 6 15:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Jun 6 15:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Jun 6 15:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Jun 6 15:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 6 12:11 NewModel
-rw-r--r-- 1 mcc users 15K Jun 7 17:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 158K Jun 7 17:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Jun 7 17:45 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Jun 7 17:45 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Jun 6 15:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Jun 6 15:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 equiv_col
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 instance
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 iscolored
-rw-r--r-- 1 mcc users 79M Jun 6 12:11 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 1654725661309

Running Version 202205111006
[2022-06-08 22:01:02] [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-06-08 22:01:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-08 22:01:05] [INFO ] Load time of PNML (sax parser for PT used): 2634 ms
[2022-06-08 22:01:05] [INFO ] Transformed 1353 places.
[2022-06-08 22:01:05] [INFO ] Transformed 143642 transitions.
[2022-06-08 22:01:05] [INFO ] Found NUPN structural information;
[2022-06-08 22:01:05] [INFO ] Parsed PT model containing 1353 places and 143642 transitions in 3175 ms.
Parsed 1 properties from file /home/mcc/execution/ReachabilityDeadlock.xml in 4 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 13930 transitions
Reduce redundant transitions removed 13930 transitions.
Built sparse matrix representations for Structural reductions in 39 ms.337378KB memory used
Starting structural reductions in DEADLOCKS mode, iteration 0 : 1353/1353 places, 129712/129712 transitions.
Computed a total of 397 stabilizing places and 51386 stable transitions
Ensure Unique test removed 8 places
Computed a total of 389 stabilizing places and 51386 stable transitions
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 1345 transition count 129712
Computed a total of 389 stabilizing places and 51386 stable transitions
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 9 Pre rules applied. Total rules applied 8 place count 1345 transition count 129703
Deduced a syphon composed of 9 places in 79 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 1 with 18 rules applied. Total rules applied 26 place count 1336 transition count 129703
Computed a total of 381 stabilizing places and 51378 stable transitions
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 71 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 1 with 44 rules applied. Total rules applied 70 place count 1314 transition count 129681
Computed a total of 369 stabilizing places and 51366 stable transitions
Computed a total of 369 stabilizing places and 51366 stable transitions
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 71 place count 1313 transition count 129680
Computed a total of 368 stabilizing places and 51365 stable transitions
Computed a total of 368 stabilizing places and 51365 stable transitions
Applied a total of 71 rules in 5782 ms. Remains 1313 /1353 variables (removed 40) and now considering 129680/129712 (removed 32) transitions.
Finished structural reductions, in 1 iterations. Remains : 1313/1353 places, 129680/129712 transitions.
Interrupted Random walk after 369938 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=12 )
[2022-06-08 22:01:43] [INFO ] Flow matrix only has 96724 transitions (discarded 32956 similar events)
// Phase 1: matrix 96724 rows 1313 cols
[2022-06-08 22:01:43] [INFO ] Computed 9 place invariants in 677 ms
[2022-06-08 22:01:52] [INFO ] [Real]Absence check using 9 positive place invariants in 48 ms returned sat
[2022-06-08 22:01:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 22:02:17] [INFO ] [Real]Absence check using state equation in 24333 ms returned sat
[2022-06-08 22:02:18] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 22:02:27] [INFO ] [Nat]Absence check using 9 positive place invariants in 65 ms returned sat
[2022-06-08 22:02:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 22:02:52] [INFO ] [Nat]Absence check using state equation in 24463 ms returned sat
[2022-06-08 22:02:53] [INFO ] State equation strengthened by 3453 read => feed constraints.
[2022-06-08 22:03:04] [INFO ] [Nat]Added 3453 Read/Feed constraints in 10889 ms returned sat
[2022-06-08 22:03:17] [INFO ] Deduced a trap composed of 231 places in 11175 ms of which 18 ms to minimize.
[2022-06-08 22:03:30] [INFO ] Deduced a trap composed of 43 places in 12061 ms of which 2 ms to minimize.
[2022-06-08 22:03:43] [INFO ] Deduced a trap composed of 52 places in 11208 ms of which 2 ms to minimize.
[2022-06-08 22:03:55] [INFO ] Deduced a trap composed of 35 places in 11306 ms of which 4 ms to minimize.
[2022-06-08 22:04:07] [INFO ] Deduced a trap composed of 102 places in 10678 ms of which 2 ms to minimize.
[2022-06-08 22:04:19] [INFO ] Deduced a trap composed of 188 places in 10654 ms of which 1 ms to minimize.
[2022-06-08 22:04:31] [INFO ] Deduced a trap composed of 242 places in 10549 ms of which 2 ms to minimize.
[2022-06-08 22:04:43] [INFO ] Deduced a trap composed of 247 places in 10504 ms of which 2 ms to minimize.
[2022-06-08 22:04:54] [INFO ] Deduced a trap composed of 51 places in 9732 ms of which 1 ms to minimize.
[2022-06-08 22:05:05] [INFO ] Deduced a trap composed of 61 places in 10073 ms of which 2 ms to minimize.
[2022-06-08 22:05:16] [INFO ] Deduced a trap composed of 119 places in 10100 ms of which 1 ms to minimize.
[2022-06-08 22:05:28] [INFO ] Deduced a trap composed of 150 places in 10737 ms of which 2 ms to minimize.
[2022-06-08 22:05:40] [INFO ] Deduced a trap composed of 74 places in 10563 ms of which 2 ms to minimize.
[2022-06-08 22:05:52] [INFO ] Deduced a trap composed of 407 places in 10029 ms of which 2 ms to minimize.
[2022-06-08 22:06:01] [INFO ] Deduced a trap composed of 142 places in 7789 ms of which 1 ms to minimize.
[2022-06-08 22:06:10] [INFO ] Deduced a trap composed of 38 places in 8064 ms of which 2 ms to minimize.
[2022-06-08 22:06:20] [INFO ] Deduced a trap composed of 21 places in 9235 ms of which 1 ms to minimize.
[2022-06-08 22:06:31] [INFO ] Deduced a trap composed of 90 places in 9192 ms of which 1 ms to minimize.
[2022-06-08 22:06:39] [INFO ] Deduced a trap composed of 71 places in 7232 ms of which 1 ms to minimize.
[2022-06-08 22:06:48] [INFO ] Deduced a trap composed of 104 places in 7301 ms of which 1 ms to minimize.
[2022-06-08 22:06:58] [INFO ] Deduced a trap composed of 102 places in 8583 ms of which 2 ms to minimize.
[2022-06-08 22:07:06] [INFO ] Deduced a trap composed of 338 places in 6659 ms of which 1 ms to minimize.
[2022-06-08 22:07:14] [INFO ] Deduced a trap composed of 285 places in 6374 ms of which 2 ms to minimize.
[2022-06-08 22:07:21] [INFO ] Deduced a trap composed of 155 places in 6418 ms of which 1 ms to minimize.
[2022-06-08 22:07:21] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking Deadlocks.
Interrupted Random directed walk after 232119 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=7 )
Interrupted Random walk after 386292 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=12 )
Interrupted Random directed walk after 238697 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=7 )
Interrupted Random walk after 385340 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=12 )
Starting structural reductions in DEADLOCKS mode, iteration 0 : 1313/1313 places, 129680/129680 transitions.
Computed a total of 368 stabilizing places and 51365 stable transitions
Computed a total of 368 stabilizing places and 51365 stable transitions
Computed a total of 368 stabilizing places and 51365 stable transitions
Applied a total of 0 rules in 1242 ms. Remains 1313 /1313 variables (removed 0) and now considering 129680/129680 (removed 0) transitions.
[2022-06-08 22:09:23] [INFO ] Flow matrix only has 96724 transitions (discarded 32956 similar events)
// Phase 1: matrix 96724 rows 1313 cols
[2022-06-08 22:09:23] [INFO ] Computed 9 place invariants in 437 ms
[2022-06-08 22:09:27] [INFO ] Implicit Places using invariants in 4803 ms returned []
Implicit Place search using SMT only with invariants took 4811 ms to find 0 implicit places.
[2022-06-08 22:09:27] [INFO ] Flow matrix only has 96724 transitions (discarded 32956 similar events)
// Phase 1: matrix 96724 rows 1313 cols
[2022-06-08 22:09:28] [INFO ] Computed 9 place invariants in 426 ms
[2022-06-08 22:09:58] [INFO ] Performed 81000/129680 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2022-06-08 22:10:15] [INFO ] Dead Transitions using invariants and state equation in 47801 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1313/1313 places, 129680/129680 transitions.
Interrupted Random walk after 403707 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=13 )
[2022-06-08 22:10:45] [INFO ] Flow matrix only has 96724 transitions (discarded 32956 similar events)
// Phase 1: matrix 96724 rows 1313 cols
[2022-06-08 22:10:46] [INFO ] Computed 9 place invariants in 450 ms
[2022-06-08 22:10:54] [INFO ] [Real]Absence check using 9 positive place invariants in 37 ms returned sat
[2022-06-08 22:10:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 22:11:19] [INFO ] [Real]Absence check using state equation in 24836 ms returned sat
[2022-06-08 22:11:20] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 22:11:29] [INFO ] [Nat]Absence check using 9 positive place invariants in 65 ms returned sat
[2022-06-08 22:11:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 22:11:54] [INFO ] [Nat]Absence check using state equation in 24708 ms returned sat
[2022-06-08 22:11:55] [INFO ] State equation strengthened by 3453 read => feed constraints.
[2022-06-08 22:12:05] [INFO ] [Nat]Added 3453 Read/Feed constraints in 10376 ms returned sat
[2022-06-08 22:12:17] [INFO ] Deduced a trap composed of 231 places in 10757 ms of which 2 ms to minimize.
[2022-06-08 22:12:29] [INFO ] Deduced a trap composed of 43 places in 10518 ms of which 2 ms to minimize.
[2022-06-08 22:12:41] [INFO ] Deduced a trap composed of 52 places in 10577 ms of which 1 ms to minimize.
[2022-06-08 22:12:53] [INFO ] Deduced a trap composed of 35 places in 10549 ms of which 2 ms to minimize.
[2022-06-08 22:13:04] [INFO ] Deduced a trap composed of 102 places in 10467 ms of which 1 ms to minimize.
[2022-06-08 22:13:16] [INFO ] Deduced a trap composed of 188 places in 10318 ms of which 2 ms to minimize.
[2022-06-08 22:13:27] [INFO ] Deduced a trap composed of 242 places in 10275 ms of which 2 ms to minimize.
[2022-06-08 22:13:39] [INFO ] Deduced a trap composed of 247 places in 10676 ms of which 2 ms to minimize.
[2022-06-08 22:13:51] [INFO ] Deduced a trap composed of 51 places in 10227 ms of which 2 ms to minimize.
[2022-06-08 22:14:03] [INFO ] Deduced a trap composed of 61 places in 10760 ms of which 2 ms to minimize.
[2022-06-08 22:14:15] [INFO ] Deduced a trap composed of 119 places in 10306 ms of which 3 ms to minimize.
[2022-06-08 22:14:27] [INFO ] Deduced a trap composed of 150 places in 10985 ms of which 2 ms to minimize.
[2022-06-08 22:14:39] [INFO ] Deduced a trap composed of 74 places in 10989 ms of which 2 ms to minimize.
[2022-06-08 22:14:51] [INFO ] Deduced a trap composed of 407 places in 10326 ms of which 2 ms to minimize.
[2022-06-08 22:15:00] [INFO ] Deduced a trap composed of 142 places in 7789 ms of which 1 ms to minimize.
[2022-06-08 22:15:09] [INFO ] Deduced a trap composed of 38 places in 8420 ms of which 2 ms to minimize.
[2022-06-08 22:15:20] [INFO ] Deduced a trap composed of 21 places in 9244 ms of which 1 ms to minimize.
[2022-06-08 22:15:30] [INFO ] Deduced a trap composed of 90 places in 8785 ms of which 2 ms to minimize.
[2022-06-08 22:15:38] [INFO ] Deduced a trap composed of 71 places in 6877 ms of which 1 ms to minimize.
[2022-06-08 22:15:46] [INFO ] Deduced a trap composed of 104 places in 7197 ms of which 1 ms to minimize.
[2022-06-08 22:15:56] [INFO ] Deduced a trap composed of 102 places in 8213 ms of which 1 ms to minimize.
[2022-06-08 22:16:03] [INFO ] Deduced a trap composed of 338 places in 6295 ms of which 1 ms to minimize.
[2022-06-08 22:16:11] [INFO ] Deduced a trap composed of 285 places in 5975 ms of which 1 ms to minimize.
[2022-06-08 22:16:18] [INFO ] Deduced a trap composed of 155 places in 6083 ms of which 0 ms to minimize.
[2022-06-08 22:16:26] [INFO ] Deduced a trap composed of 192 places in 6069 ms of which 0 ms to minimize.
[2022-06-08 22:16:26] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking Deadlocks.
Interrupted Random directed walk after 234176 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=7 )
Interrupted Random walk after 372844 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=12 )
Interrupted Random directed walk after 243772 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=8 )
Interrupted Random walk after 388134 steps, including 0 resets, run timeout after 30003 ms. (steps per millisecond=12 )
[2022-06-08 22:18:31] [INFO ] Flatten gal took : 4381 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin17894155622655318813
[2022-06-08 22:18:33] [INFO ] Too many transitions (129712) to apply POR reductions. Disabling POR matrices.
[2022-06-08 22:18:35] [INFO ] Built C files in 1856ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17894155622655318813
Running compilation step : cd /tmp/ltsmin17894155622655318813;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-06-08 22:18:36] [INFO ] Applying decomposition
[2022-06-08 22:18:40] [INFO ] Flatten gal took : 4115 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph7945542607760377535.txt' '-o' '/tmp/graph7945542607760377535.bin' '-w' '/tmp/graph7945542607760377535.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph7945542607760377535.bin' '-l' '-1' '-v' '-w' '/tmp/graph7945542607760377535.weights' '-q' '0' '-e' '0.001'
[2022-06-08 22:18:47] [INFO ] Decomposing Gal with order
[2022-06-08 22:18:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-08 22:19:19] [INFO ] Removed a total of 284105 redundant transitions.
[2022-06-08 22:19:25] [INFO ] Flatten gal took : 34094 ms
[2022-06-08 22:19:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 9161 labels/synchronizations in 12123 ms.
[2022-06-08 22:19:44] [INFO ] Time to serialize gal into /tmp/ReachabilityDeadlock640722245998720651.gal : 287 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityDeadlock640722245998720651.gal' '-t' 'CGAL' '-ctl' 'DEADLOCK'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/R...224
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 cd /tmp/ltsmin17894155622655318813;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 360 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17894155622655318813;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 360 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)

BK_STOP 1654727108982

--------------------
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
+ [[ 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
+ 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 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=@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="RERS2020-PT-pb104"
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 RERS2020-PT-pb104, 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 r319-tall-165472290100406"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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