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.r324-tall-165472293500296.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 gold2021
Input is FunctionPointer-PT-c002, examination is ReachabilityDeadlock
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r324-tall-165472293500296
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.7M
-rw-r--r-- 1 mcc users 8.4K Jun 7 17:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K Jun 7 17:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Jun 7 17:17 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Jun 7 17:17 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Jun 6 15:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Jun 6 15:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Jun 6 15:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Jun 6 15:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 6 12:11 NewModel
-rw-r--r-- 1 mcc users 14K Jun 7 17:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 149K Jun 7 17:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Jun 7 17:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Jun 7 17:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Jun 6 15:27 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Jun 6 15:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 equiv_col
-rw-r--r-- 1 mcc users 5 Jun 6 12:11 instance
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 iscolored
-rw-r--r-- 1 mcc users 4.2M 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 1654753799008

Running Version 0
[2022-06-09 05:50:00] [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-09 05:50:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-09 05:50:00] [INFO ] Load time of PNML (sax parser for PT used): 333 ms
[2022-06-09 05:50:00] [INFO ] Transformed 2826 places.
[2022-06-09 05:50:00] [INFO ] Transformed 8960 transitions.
[2022-06-09 05:50:00] [INFO ] Parsed PT model containing 2826 places and 8960 transitions in 415 ms.
Parsed 1 properties from file /home/mcc/execution/ReachabilityDeadlock.xml in 3 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 1198 places in 29 ms
Reduce places removed 1198 places and 2998 transitions.
Built sparse matrix representations for Structural reductions in 10 ms.29049KB memory used
Starting structural reductions, iteration 0 : 1628/1628 places, 5962/5962 transitions.
Graph (complete) has 9876 edges and 1628 vertex of which 1611 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.24 ms
Discarding 17 places :
Also discarding 0 output transitions
Discarding 302 places :
Symmetric choice reduction at 0 with 302 rule applications. Total rules 303 place count 1309 transition count 3662
Iterating global reduction 0 with 302 rules applied. Total rules applied 605 place count 1309 transition count 3662
Ensure Unique test removed 352 transitions
Reduce isomorphic transitions removed 352 transitions.
Iterating post reduction 0 with 352 rules applied. Total rules applied 957 place count 1309 transition count 3310
Discarding 158 places :
Symmetric choice reduction at 1 with 158 rule applications. Total rules 1115 place count 1151 transition count 2994
Iterating global reduction 1 with 158 rules applied. Total rules applied 1273 place count 1151 transition count 2994
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Iterating post reduction 1 with 64 rules applied. Total rules applied 1337 place count 1151 transition count 2930
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 1351 place count 1137 transition count 2902
Iterating global reduction 2 with 14 rules applied. Total rules applied 1365 place count 1137 transition count 2902
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 1379 place count 1123 transition count 2874
Iterating global reduction 2 with 14 rules applied. Total rules applied 1393 place count 1123 transition count 2874
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 1407 place count 1109 transition count 2846
Iterating global reduction 2 with 14 rules applied. Total rules applied 1421 place count 1109 transition count 2846
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 1435 place count 1095 transition count 2818
Iterating global reduction 2 with 14 rules applied. Total rules applied 1449 place count 1095 transition count 2818
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 1463 place count 1081 transition count 2790
Iterating global reduction 2 with 14 rules applied. Total rules applied 1477 place count 1081 transition count 2790
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 1491 place count 1067 transition count 2762
Iterating global reduction 2 with 14 rules applied. Total rules applied 1505 place count 1067 transition count 2762
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 1519 place count 1053 transition count 2734
Iterating global reduction 2 with 14 rules applied. Total rules applied 1533 place count 1053 transition count 2734
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 1596 place count 990 transition count 2496
Iterating global reduction 2 with 63 rules applied. Total rules applied 1659 place count 990 transition count 2496
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 1722 place count 927 transition count 2244
Iterating global reduction 2 with 63 rules applied. Total rules applied 1785 place count 927 transition count 2244
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 1848 place count 864 transition count 2104
Iterating global reduction 2 with 63 rules applied. Total rules applied 1911 place count 864 transition count 2104
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 1974 place count 801 transition count 1978
Iterating global reduction 2 with 63 rules applied. Total rules applied 2037 place count 801 transition count 1978
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 2100 place count 738 transition count 1852
Iterating global reduction 2 with 63 rules applied. Total rules applied 2163 place count 738 transition count 1852
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 2226 place count 675 transition count 1726
Iterating global reduction 2 with 63 rules applied. Total rules applied 2289 place count 675 transition count 1726
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 2352 place count 612 transition count 1600
Iterating global reduction 2 with 63 rules applied. Total rules applied 2415 place count 612 transition count 1600
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 2422 place count 605 transition count 1586
Iterating global reduction 2 with 7 rules applied. Total rules applied 2429 place count 605 transition count 1586
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 2431 place count 605 transition count 1584
Applied a total of 2431 rules in 1707 ms. Remains 605 /1628 variables (removed 1023) and now considering 1584/5962 (removed 4378) transitions.
Finished structural reductions, in 1 iterations. Remains : 605/1628 places, 1584/5962 transitions.
Random walk for 1250000 steps, including 0 resets, run took 3208 ms (no deadlock found). (steps per millisecond=389 )
Random directed walk for 1250005 steps, including 0 resets, run took 2634 ms (no deadlock found). (steps per millisecond=474 )
[2022-06-09 05:50:08] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
// Phase 1: matrix 1057 rows 605 cols
[2022-06-09 05:50:08] [INFO ] Computed 2 place invariants in 34 ms
[2022-06-09 05:50:09] [INFO ] [Real]Absence check using 1 positive place invariants in 17 ms returned sat
[2022-06-09 05:50:09] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 6 ms returned sat
[2022-06-09 05:50:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 05:50:10] [INFO ] [Real]Absence check using state equation in 1438 ms returned sat
[2022-06-09 05:50:10] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 05:50:11] [INFO ] [Nat]Absence check using 1 positive place invariants in 55 ms returned sat
[2022-06-09 05:50:11] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 3 ms returned sat
[2022-06-09 05:50:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 05:50:11] [INFO ] [Nat]Absence check using state equation in 397 ms returned sat
[2022-06-09 05:50:11] [INFO ] State equation strengthened by 661 read => feed constraints.
[2022-06-09 05:50:11] [INFO ] [Nat]Added 661 Read/Feed constraints in 320 ms returned sat
[2022-06-09 05:50:12] [INFO ] Deduced a trap composed of 131 places in 164 ms of which 3 ms to minimize.
[2022-06-09 05:50:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 303 ms
[2022-06-09 05:50:12] [INFO ] Computed and/alt/rep : 204/290/202 causal constraints (skipped 853 transitions) in 198 ms.
[2022-06-09 05:50:12] [INFO ] Added : 12 causal constraints over 3 iterations in 480 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 12 ms.
Parikh directed walk for 65700 steps, including 65700 resets, run took 2113 ms. (steps per millisecond=31 )
Random directed walk for 500001 steps, including 0 resets, run took 905 ms (no deadlock found). (steps per millisecond=552 )
Random walk for 500001 steps, including 0 resets, run took 989 ms (no deadlock found). (steps per millisecond=505 )
Random directed walk for 500008 steps, including 0 resets, run took 932 ms (no deadlock found). (steps per millisecond=536 )
Random walk for 500000 steps, including 0 resets, run took 1155 ms (no deadlock found). (steps per millisecond=432 )
Starting structural reductions, iteration 0 : 605/605 places, 1584/1584 transitions.
Applied a total of 0 rules in 74 ms. Remains 605 /605 variables (removed 0) and now considering 1584/1584 (removed 0) transitions.
[2022-06-09 05:50:18] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
// Phase 1: matrix 1057 rows 605 cols
[2022-06-09 05:50:18] [INFO ] Computed 2 place invariants in 6 ms
[2022-06-09 05:50:19] [INFO ] Implicit Places using invariants in 669 ms returned []
[2022-06-09 05:50:19] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
// Phase 1: matrix 1057 rows 605 cols
[2022-06-09 05:50:19] [INFO ] Computed 2 place invariants in 6 ms
[2022-06-09 05:50:19] [INFO ] State equation strengthened by 661 read => feed constraints.
[2022-06-09 05:50:20] [INFO ] Implicit Places using invariants and state equation in 655 ms returned []
Implicit Place search using SMT with State Equation took 1330 ms to find 0 implicit places.
[2022-06-09 05:50:20] [INFO ] Redundant transitions in 98 ms returned []
[2022-06-09 05:50:20] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
// Phase 1: matrix 1057 rows 605 cols
[2022-06-09 05:50:20] [INFO ] Computed 2 place invariants in 7 ms
[2022-06-09 05:50:20] [INFO ] Dead Transitions using invariants and state equation in 467 ms returned []
Finished structural reductions, in 1 iterations. Remains : 605/605 places, 1584/1584 transitions.
Random walk for 1250000 steps, including 0 resets, run took 2643 ms (no deadlock found). (steps per millisecond=472 )
Random directed walk for 1250003 steps, including 0 resets, run took 2344 ms (no deadlock found). (steps per millisecond=533 )
[2022-06-09 05:50:25] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
// Phase 1: matrix 1057 rows 605 cols
[2022-06-09 05:50:25] [INFO ] Computed 2 place invariants in 4 ms
[2022-06-09 05:50:26] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2022-06-09 05:50:26] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 05:50:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 05:50:27] [INFO ] [Real]Absence check using state equation in 1408 ms returned sat
[2022-06-09 05:50:27] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 05:50:27] [INFO ] [Nat]Absence check using 1 positive place invariants in 50 ms returned sat
[2022-06-09 05:50:27] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 3 ms returned sat
[2022-06-09 05:50:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 05:50:28] [INFO ] [Nat]Absence check using state equation in 374 ms returned sat
[2022-06-09 05:50:28] [INFO ] State equation strengthened by 661 read => feed constraints.
[2022-06-09 05:50:28] [INFO ] [Nat]Added 661 Read/Feed constraints in 300 ms returned sat
[2022-06-09 05:50:28] [INFO ] Deduced a trap composed of 131 places in 135 ms of which 1 ms to minimize.
[2022-06-09 05:50:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 261 ms
[2022-06-09 05:50:28] [INFO ] Computed and/alt/rep : 204/290/202 causal constraints (skipped 853 transitions) in 105 ms.
[2022-06-09 05:50:29] [INFO ] Added : 12 causal constraints over 3 iterations in 416 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 13 ms.
Parikh directed walk for 65700 steps, including 65700 resets, run took 1797 ms. (steps per millisecond=36 )
Random directed walk for 500000 steps, including 0 resets, run took 936 ms (no deadlock found). (steps per millisecond=534 )
Random walk for 500003 steps, including 0 resets, run took 1209 ms (no deadlock found). (steps per millisecond=413 )
Random directed walk for 500002 steps, including 0 resets, run took 900 ms (no deadlock found). (steps per millisecond=555 )
Random walk for 500000 steps, including 0 resets, run took 1160 ms (no deadlock found). (steps per millisecond=431 )
[2022-06-09 05:50:35] [INFO ] Flatten gal took : 357 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin7507730552699666195
[2022-06-09 05:50:35] [INFO ] Too many transitions (5962) to apply POR reductions. Disabling POR matrices.
[2022-06-09 05:50:36] [INFO ] Applying decomposition
[2022-06-09 05:50:36] [INFO ] Built C files in 103ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7507730552699666195
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/ltsmin7507730552699666195]
[2022-06-09 05:50:36] [INFO ] Flatten gal took : 194 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/graph17033892512096166563.txt, -o, /tmp/graph17033892512096166563.bin, -w, /tmp/graph17033892512096166563.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/graph17033892512096166563.bin, -l, -1, -v, -w, /tmp/graph17033892512096166563.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-09 05:50:37] [INFO ] Decomposing Gal with order
[2022-06-09 05:50:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-09 05:50:39] [INFO ] Removed a total of 7224 redundant transitions.
[2022-06-09 05:50:39] [INFO ] Flatten gal took : 2438 ms
[2022-06-09 05:50:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 5380 labels/synchronizations in 638 ms.
[2022-06-09 05:50:41] [INFO ] Time to serialize gal into /tmp/ReachabilityDeadlock7935439115710619648.gal : 51 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/ReachabilityDeadlock7935439115710619648.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/ReachabilityDeadlock7935439115710619648.gal -t CGAL -ctl DEADLOCK
No direction supplied, using forward translation only.
Compilation finished in 87968 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin7507730552699666195]
Link finished in 79 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, -d], workingDir=/tmp/ltsmin7507730552699666195]
Detected timeout of ITS tools.
[2022-06-09 06:00:53] [INFO ] Flatten gal took : 446 ms
[2022-06-09 06:00:53] [INFO ] Time to serialize gal into /tmp/ReachabilityDeadlock12342269042043704369.gal : 59 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/ReachabilityDeadlock12342269042043704369.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/ReachabilityDeadlock12342269042043704369.gal -t CGAL -ctl DEADLOCK --gen-order FOLLOW
No direction supplied, using forward translation only.
Detected timeout of ITS tools.
[2022-06-09 06:11:05] [INFO ] Flatten gal took : 397 ms
[2022-06-09 06:11:05] [INFO ] Input system was already deterministic with 5962 transitions.
[2022-06-09 06:11:05] [INFO ] Transformed 1628 places.
[2022-06-09 06:11:05] [INFO ] Transformed 5962 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-06-09 06:11:07] [INFO ] Time to serialize gal into /tmp/ReachabilityDeadlock5718108855707407963.gal : 28 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/ReachabilityDeadlock5718108855707407963.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/ReachabilityDeadlock5718108855707407963.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.
LTSmin run took 1577308 ms.
FORMULA ReachabilityDeadlock TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.

BK_STOP 1654755502610

--------------------
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="FunctionPointer-PT-c002"
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 FunctionPointer-PT-c002, 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 r324-tall-165472293500296"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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