Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r425-tajo-167905977800126.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.....................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is ShieldRVs-PT-030B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r425-tajo-167905977800126
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 780K
-rw-r--r-- 1 mcc users 5.6K Feb 26 18:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 57K Feb 26 18:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 26 18:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 26 18:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 17:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 17:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 18:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K Feb 26 18:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Feb 26 18:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Feb 26 18:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:02 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:02 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 370K Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679298919127

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVs-PT-030B
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-20 07:55:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-20 07:55:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 07:55:21] [INFO ] Load time of PNML (sax parser for PT used): 175 ms
[2023-03-20 07:55:21] [INFO ] Transformed 1203 places.
[2023-03-20 07:55:21] [INFO ] Transformed 1353 transitions.
[2023-03-20 07:55:21] [INFO ] Found NUPN structural information;
[2023-03-20 07:55:21] [INFO ] Parsed PT model containing 1203 places and 1353 transitions and 4320 arcs in 367 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 26 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldRVs-PT-030B-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 7 resets, run finished after 613 ms. (steps per millisecond=16 ) properties (out of 15) seen :11
FORMULA ShieldRVs-PT-030B-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030B-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030B-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030B-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030B-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030B-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030B-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030B-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030B-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030B-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030B-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 1353 rows 1203 cols
[2023-03-20 07:55:22] [INFO ] Computed 121 place invariants in 28 ms
[2023-03-20 07:55:23] [INFO ] After 465ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-20 07:55:23] [INFO ] [Nat]Absence check using 121 positive place invariants in 40 ms returned sat
[2023-03-20 07:55:24] [INFO ] After 647ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-20 07:55:24] [INFO ] Deduced a trap composed of 26 places in 468 ms of which 8 ms to minimize.
[2023-03-20 07:55:25] [INFO ] Deduced a trap composed of 22 places in 467 ms of which 2 ms to minimize.
[2023-03-20 07:55:25] [INFO ] Deduced a trap composed of 30 places in 413 ms of which 2 ms to minimize.
[2023-03-20 07:55:26] [INFO ] Deduced a trap composed of 24 places in 374 ms of which 3 ms to minimize.
[2023-03-20 07:55:26] [INFO ] Deduced a trap composed of 26 places in 383 ms of which 1 ms to minimize.
[2023-03-20 07:55:27] [INFO ] Deduced a trap composed of 36 places in 403 ms of which 1 ms to minimize.
[2023-03-20 07:55:27] [INFO ] Deduced a trap composed of 27 places in 553 ms of which 1 ms to minimize.
[2023-03-20 07:55:28] [INFO ] Deduced a trap composed of 27 places in 291 ms of which 0 ms to minimize.
[2023-03-20 07:55:28] [INFO ] Deduced a trap composed of 21 places in 314 ms of which 1 ms to minimize.
[2023-03-20 07:55:28] [INFO ] Deduced a trap composed of 28 places in 323 ms of which 1 ms to minimize.
[2023-03-20 07:55:29] [INFO ] Deduced a trap composed of 19 places in 445 ms of which 2 ms to minimize.
[2023-03-20 07:55:29] [INFO ] Deduced a trap composed of 22 places in 323 ms of which 1 ms to minimize.
[2023-03-20 07:55:30] [INFO ] Deduced a trap composed of 20 places in 940 ms of which 1 ms to minimize.
[2023-03-20 07:55:31] [INFO ] Deduced a trap composed of 25 places in 349 ms of which 1 ms to minimize.
[2023-03-20 07:55:31] [INFO ] Deduced a trap composed of 23 places in 343 ms of which 1 ms to minimize.
[2023-03-20 07:55:32] [INFO ] Deduced a trap composed of 21 places in 352 ms of which 1 ms to minimize.
[2023-03-20 07:55:32] [INFO ] Deduced a trap composed of 19 places in 403 ms of which 1 ms to minimize.
[2023-03-20 07:55:32] [INFO ] Deduced a trap composed of 28 places in 349 ms of which 2 ms to minimize.
[2023-03-20 07:55:33] [INFO ] Deduced a trap composed of 37 places in 293 ms of which 1 ms to minimize.
[2023-03-20 07:55:33] [INFO ] Deduced a trap composed of 50 places in 313 ms of which 1 ms to minimize.
[2023-03-20 07:55:33] [INFO ] Deduced a trap composed of 55 places in 260 ms of which 1 ms to minimize.
[2023-03-20 07:55:34] [INFO ] Deduced a trap composed of 22 places in 302 ms of which 1 ms to minimize.
[2023-03-20 07:55:34] [INFO ] Deduced a trap composed of 49 places in 295 ms of which 1 ms to minimize.
[2023-03-20 07:55:35] [INFO ] Deduced a trap composed of 45 places in 259 ms of which 1 ms to minimize.
[2023-03-20 07:55:35] [INFO ] Deduced a trap composed of 62 places in 225 ms of which 0 ms to minimize.
[2023-03-20 07:55:35] [INFO ] Deduced a trap composed of 73 places in 255 ms of which 1 ms to minimize.
[2023-03-20 07:55:35] [INFO ] Deduced a trap composed of 53 places in 247 ms of which 1 ms to minimize.
[2023-03-20 07:55:36] [INFO ] Deduced a trap composed of 67 places in 226 ms of which 1 ms to minimize.
[2023-03-20 07:55:36] [INFO ] Deduced a trap composed of 50 places in 184 ms of which 0 ms to minimize.
[2023-03-20 07:55:36] [INFO ] Deduced a trap composed of 46 places in 170 ms of which 1 ms to minimize.
[2023-03-20 07:55:36] [INFO ] Deduced a trap composed of 47 places in 153 ms of which 0 ms to minimize.
[2023-03-20 07:55:36] [INFO ] Trap strengthening (SAT) tested/added 32/31 trap constraints in 12513 ms
[2023-03-20 07:55:37] [INFO ] Deduced a trap composed of 26 places in 472 ms of which 1 ms to minimize.
[2023-03-20 07:55:38] [INFO ] Deduced a trap composed of 26 places in 461 ms of which 1 ms to minimize.
[2023-03-20 07:55:38] [INFO ] Deduced a trap composed of 24 places in 454 ms of which 4 ms to minimize.
[2023-03-20 07:55:39] [INFO ] Deduced a trap composed of 35 places in 457 ms of which 1 ms to minimize.
[2023-03-20 07:55:39] [INFO ] Deduced a trap composed of 40 places in 447 ms of which 1 ms to minimize.
[2023-03-20 07:55:40] [INFO ] Deduced a trap composed of 24 places in 445 ms of which 1 ms to minimize.
[2023-03-20 07:55:40] [INFO ] Deduced a trap composed of 29 places in 440 ms of which 1 ms to minimize.
[2023-03-20 07:55:40] [INFO ] Deduced a trap composed of 35 places in 432 ms of which 1 ms to minimize.
[2023-03-20 07:55:41] [INFO ] Deduced a trap composed of 28 places in 351 ms of which 2 ms to minimize.
[2023-03-20 07:55:41] [INFO ] Deduced a trap composed of 51 places in 426 ms of which 1 ms to minimize.
[2023-03-20 07:55:42] [INFO ] Deduced a trap composed of 28 places in 391 ms of which 1 ms to minimize.
[2023-03-20 07:55:42] [INFO ] Deduced a trap composed of 32 places in 440 ms of which 1 ms to minimize.
[2023-03-20 07:55:43] [INFO ] Deduced a trap composed of 28 places in 434 ms of which 1 ms to minimize.
[2023-03-20 07:55:43] [INFO ] Deduced a trap composed of 32 places in 417 ms of which 1 ms to minimize.
[2023-03-20 07:55:44] [INFO ] Deduced a trap composed of 38 places in 325 ms of which 1 ms to minimize.
[2023-03-20 07:55:44] [INFO ] Deduced a trap composed of 34 places in 315 ms of which 0 ms to minimize.
[2023-03-20 07:55:44] [INFO ] Deduced a trap composed of 43 places in 329 ms of which 1 ms to minimize.
[2023-03-20 07:55:45] [INFO ] Deduced a trap composed of 41 places in 318 ms of which 0 ms to minimize.
[2023-03-20 07:55:45] [INFO ] Deduced a trap composed of 38 places in 315 ms of which 1 ms to minimize.
[2023-03-20 07:55:46] [INFO ] Deduced a trap composed of 27 places in 319 ms of which 1 ms to minimize.
[2023-03-20 07:55:46] [INFO ] Deduced a trap composed of 28 places in 373 ms of which 1 ms to minimize.
[2023-03-20 07:55:47] [INFO ] Deduced a trap composed of 35 places in 319 ms of which 1 ms to minimize.
[2023-03-20 07:55:47] [INFO ] Deduced a trap composed of 40 places in 292 ms of which 1 ms to minimize.
[2023-03-20 07:55:47] [INFO ] Deduced a trap composed of 36 places in 258 ms of which 1 ms to minimize.
[2023-03-20 07:55:48] [INFO ] Deduced a trap composed of 62 places in 296 ms of which 4 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-20 07:55:48] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 07:55:48] [INFO ] After 25017ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
Parikh walk visited 0 properties in 132 ms.
Support contains 10 out of 1203 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1203/1203 places, 1353/1353 transitions.
Drop transitions removed 116 transitions
Trivial Post-agglo rules discarded 116 transitions
Performed 116 trivial Post agglomeration. Transition count delta: 116
Iterating post reduction 0 with 116 rules applied. Total rules applied 116 place count 1203 transition count 1237
Reduce places removed 116 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 118 rules applied. Total rules applied 234 place count 1087 transition count 1235
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 236 place count 1085 transition count 1235
Performed 151 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 151 Pre rules applied. Total rules applied 236 place count 1085 transition count 1084
Deduced a syphon composed of 151 places in 2 ms
Reduce places removed 151 places and 0 transitions.
Iterating global reduction 3 with 302 rules applied. Total rules applied 538 place count 934 transition count 1084
Discarding 204 places :
Symmetric choice reduction at 3 with 204 rule applications. Total rules 742 place count 730 transition count 880
Iterating global reduction 3 with 204 rules applied. Total rules applied 946 place count 730 transition count 880
Performed 86 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 86 Pre rules applied. Total rules applied 946 place count 730 transition count 794
Deduced a syphon composed of 86 places in 3 ms
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 3 with 172 rules applied. Total rules applied 1118 place count 644 transition count 794
Performed 210 Post agglomeration using F-continuation condition.Transition count delta: 210
Deduced a syphon composed of 210 places in 2 ms
Reduce places removed 210 places and 0 transitions.
Iterating global reduction 3 with 420 rules applied. Total rules applied 1538 place count 434 transition count 584
Partial Free-agglomeration rule applied 61 times.
Drop transitions removed 61 transitions
Iterating global reduction 3 with 61 rules applied. Total rules applied 1599 place count 434 transition count 584
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1600 place count 433 transition count 583
Applied a total of 1600 rules in 326 ms. Remains 433 /1203 variables (removed 770) and now considering 583/1353 (removed 770) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 327 ms. Remains : 433/1203 places, 583/1353 transitions.
Incomplete random walk after 10000 steps, including 26 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 4) seen :2
FORMULA ShieldRVs-PT-030B-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030B-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :1
FORMULA ShieldRVs-PT-030B-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Finished Best-First random walk after 6576 steps, including 1 resets, run visited all 1 properties in 15 ms. (steps per millisecond=438 )
FORMULA ShieldRVs-PT-030B-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
All properties solved without resorting to model-checking.
Total runtime 27619 ms.
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --invariant=/tmp/636/inv_0_ --invariant=/tmp/636/inv_1_ --invariant=/tmp/636/inv_2_ --invariant=/tmp/636/inv_3_ --invariant=/tmp/636/inv_4_ --invariant=/tmp/636/inv_5_ --invariant=/tmp/636/inv_6_ --invariant=/tmp/636/inv_7_ --invariant=/tmp/636/inv_8_ --invariant=/tmp/636/inv_9_ --invariant=/tmp/636/inv_10_ --invariant=/tmp/636/inv_11_ --invariant=/tmp/636/inv_12_ --invariant=/tmp/636/inv_13_ --invariant=/tmp/636/inv_14_ --invariant=/tmp/636/inv_15_ --inv-par
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 13524700 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16098664 kB

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
mcc2023

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="ShieldRVs-PT-030B"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is ShieldRVs-PT-030B, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r425-tajo-167905977800126"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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