About the Execution of LTSMin+red for Diffusion2D-PT-D30N010
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r137-smll-167819417600189.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is Diffusion2D-PT-D30N010, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r137-smll-167819417600189
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.5M
-rw-r--r-- 1 mcc users 7.7K Feb 26 04:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Feb 26 04:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Feb 26 04:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 26 04:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.4K Feb 25 15:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Feb 25 15:58 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.1K Feb 26 04:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 75K Feb 26 04:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Feb 26 04:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 93K Feb 26 04:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 15:58 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:58 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 8 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 3.0M Mar 5 18:22 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of positive values
NUM_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME Diffusion2D-PT-D30N010-UpperBounds-00
FORMULA_NAME Diffusion2D-PT-D30N010-UpperBounds-01
FORMULA_NAME Diffusion2D-PT-D30N010-UpperBounds-02
FORMULA_NAME Diffusion2D-PT-D30N010-UpperBounds-03
FORMULA_NAME Diffusion2D-PT-D30N010-UpperBounds-04
FORMULA_NAME Diffusion2D-PT-D30N010-UpperBounds-05
FORMULA_NAME Diffusion2D-PT-D30N010-UpperBounds-06
FORMULA_NAME Diffusion2D-PT-D30N010-UpperBounds-07
FORMULA_NAME Diffusion2D-PT-D30N010-UpperBounds-08
FORMULA_NAME Diffusion2D-PT-D30N010-UpperBounds-09
FORMULA_NAME Diffusion2D-PT-D30N010-UpperBounds-10
FORMULA_NAME Diffusion2D-PT-D30N010-UpperBounds-11
FORMULA_NAME Diffusion2D-PT-D30N010-UpperBounds-12
FORMULA_NAME Diffusion2D-PT-D30N010-UpperBounds-13
FORMULA_NAME Diffusion2D-PT-D30N010-UpperBounds-14
FORMULA_NAME Diffusion2D-PT-D30N010-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1678667893389
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=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Diffusion2D-PT-D30N010
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-13 00:38:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-13 00:38:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 00:38:18] [INFO ] Load time of PNML (sax parser for PT used): 934 ms
[2023-03-13 00:38:18] [INFO ] Transformed 900 places.
[2023-03-13 00:38:18] [INFO ] Transformed 6844 transitions.
[2023-03-13 00:38:18] [INFO ] Parsed PT model containing 900 places and 6844 transitions and 13688 arcs in 1320 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 9 ms.
// Phase 1: matrix 6844 rows 900 cols
[2023-03-13 00:38:18] [INFO ] Computed 1 place invariants in 167 ms
Incomplete random walk after 10003 steps, including 2 resets, run finished after 151 ms. (steps per millisecond=66 ) properties (out of 16) seen :58
FORMULA Diffusion2D-PT-D30N010-UpperBounds-15 10 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N010-UpperBounds-14 10 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 14) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 14) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 14) seen :0
[2023-03-13 00:38:19] [INFO ] Invariant cache hit.
[2023-03-13 00:38:20] [INFO ] [Real]Absence check using 1 positive place invariants in 36 ms returned sat
[2023-03-13 00:38:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 00:38:23] [INFO ] [Real]Absence check using state equation in 2962 ms returned sat
[2023-03-13 00:38:24] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:999)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2618)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
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-13 00:38:24] [INFO ] [Real]Absence check using 1 positive place invariants in 18 ms returned sat
[2023-03-13 00:38:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 00:38:26] [INFO ] [Real]Absence check using state equation in 1895 ms returned sat
[2023-03-13 00:38:28] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 856 ms.
[2023-03-13 00:38:28] [INFO ] [Real]Absence check using 1 positive place invariants in 40 ms returned sat
[2023-03-13 00:38:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 00:38:30] [INFO ] [Real]Absence check using state equation in 2013 ms returned sat
[2023-03-13 00:38:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 00:38:30] [INFO ] [Nat]Absence check using 1 positive place invariants in 13 ms returned sat
[2023-03-13 00:38:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 00:38:32] [INFO ] [Nat]Absence check using state equation in 1824 ms returned sat
[2023-03-13 00:38:34] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 798 ms.
[2023-03-13 00:38:34] [INFO ] [Real]Absence check using 1 positive place invariants in 25 ms returned sat
[2023-03-13 00:38:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 00:38:36] [INFO ] [Real]Absence check using state equation in 1641 ms returned sat
[2023-03-13 00:38:37] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 1058 ms.
[2023-03-13 00:38:37] [INFO ] [Real]Absence check using 1 positive place invariants in 40 ms returned sat
[2023-03-13 00:38:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 00:38:39] [INFO ] [Real]Absence check using state equation in 1599 ms returned sat
[2023-03-13 00:38:40] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 676 ms.
[2023-03-13 00:38:40] [INFO ] [Real]Absence check using 1 positive place invariants in 20 ms returned sat
[2023-03-13 00:38:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 00:38:42] [INFO ] [Real]Absence check using state equation in 1910 ms returned sat
[2023-03-13 00:38:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 00:38:43] [INFO ] [Nat]Absence check using 1 positive place invariants in 21 ms returned sat
[2023-03-13 00:38:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 00:38:45] [INFO ] [Nat]Absence check using state equation in 1992 ms returned sat
[2023-03-13 00:38:46] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 688 ms.
[2023-03-13 00:38:46] [INFO ] [Real]Absence check using 1 positive place invariants in 18 ms returned sat
[2023-03-13 00:38:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 00:38:48] [INFO ] [Real]Absence check using state equation in 1952 ms returned sat
[2023-03-13 00:38:49] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 680 ms.
[2023-03-13 00:38:49] [INFO ] [Real]Absence check using 1 positive place invariants in 11 ms returned sat
[2023-03-13 00:38:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 00:38:50] [INFO ] [Real]Absence check using state equation in 1613 ms returned sat
[2023-03-13 00:38:51] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 610 ms.
[2023-03-13 00:38:52] [INFO ] [Real]Absence check using 1 positive place invariants in 19 ms returned sat
[2023-03-13 00:38:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 00:38:53] [INFO ] [Real]Absence check using state equation in 1757 ms returned sat
[2023-03-13 00:38:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 00:38:54] [INFO ] [Nat]Absence check using 1 positive place invariants in 13 ms returned sat
[2023-03-13 00:38:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 00:38:55] [INFO ] [Nat]Absence check using state equation in 1640 ms returned sat
[2023-03-13 00:38:56] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 460 ms.
[2023-03-13 00:38:56] [INFO ] [Real]Absence check using 1 positive place invariants in 12 ms returned sat
[2023-03-13 00:38:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 00:38:58] [INFO ] [Real]Absence check using state equation in 1631 ms returned sat
[2023-03-13 00:38:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 00:38:58] [INFO ] [Nat]Absence check using 1 positive place invariants in 20 ms returned sat
[2023-03-13 00:38:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 00:39:00] [INFO ] [Nat]Absence check using state equation in 1756 ms returned sat
[2023-03-13 00:39:01] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 499 ms.
[2023-03-13 00:39:01] [INFO ] [Real]Absence check using 1 positive place invariants in 20 ms returned sat
[2023-03-13 00:39:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 00:39:03] [INFO ] [Real]Absence check using state equation in 1919 ms returned sat
[2023-03-13 00:39:04] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 545 ms.
[2023-03-13 00:39:04] [INFO ] [Real]Absence check using 1 positive place invariants in 13 ms returned sat
[2023-03-13 00:39:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 00:39:06] [INFO ] [Real]Absence check using state equation in 1868 ms returned sat
[2023-03-13 00:39:07] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 615 ms.
[2023-03-13 00:39:07] [INFO ] [Real]Absence check using 1 positive place invariants in 11 ms returned sat
[2023-03-13 00:39:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 00:39:08] [INFO ] [Real]Absence check using state equation in 1651 ms returned sat
[2023-03-13 00:39:09] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 555 ms.
[2023-03-13 00:39:09] [INFO ] [Real]Absence check using 1 positive place invariants in 14 ms returned sat
[2023-03-13 00:39:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 00:39:11] [INFO ] [Real]Absence check using state equation in 1767 ms returned sat
[2023-03-13 00:39:12] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 613 ms.
Current structural bounds on expressions (after SMT) : [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10] Max seen :[7, 2, 0, 1, 7, 0, 1, 1, 9, 0, 1, 1, 7, 1]
Support contains 14 out of 900 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 900/900 places, 6844/6844 transitions.
Graph (trivial) has 6630 edges and 900 vertex of which 886 / 900 are part of one of the 1 SCC in 24 ms
Free SCC test removed 885 places
Drop transitions removed 6630 transitions
Ensure Unique test removed 182 transitions
Reduce isomorphic transitions removed 6812 transitions.
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 7 place count 15 transition count 26
Applied a total of 7 rules in 73 ms. Remains 15 /900 variables (removed 885) and now considering 26/6844 (removed 6818) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 15/900 places, 26/6844 transitions.
// Phase 1: matrix 26 rows 15 cols
[2023-03-13 00:39:12] [INFO ] Computed 1 place invariants in 1 ms
Incomplete random walk after 1000003 steps, including 2 resets, run finished after 352 ms. (steps per millisecond=2840 ) properties (out of 14) seen :140
FORMULA Diffusion2D-PT-D30N010-UpperBounds-13 10 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N010-UpperBounds-12 10 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N010-UpperBounds-11 10 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N010-UpperBounds-10 10 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N010-UpperBounds-09 10 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N010-UpperBounds-08 10 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N010-UpperBounds-07 10 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N010-UpperBounds-06 10 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N010-UpperBounds-05 10 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N010-UpperBounds-04 10 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N010-UpperBounds-03 10 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N010-UpperBounds-02 10 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N010-UpperBounds-01 10 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N010-UpperBounds-00 10 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 56096 ms.
ITS solved all properties within timeout
BK_STOP 1678667954358
--------------------
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:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ 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 UpperBounds -timeout 360 -rebuildPNML
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="Diffusion2D-PT-D30N010"
export BK_EXAMINATION="UpperBounds"
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 Diffusion2D-PT-D30N010, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r137-smll-167819417600189"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Diffusion2D-PT-D30N010.tgz
mv Diffusion2D-PT-D30N010 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "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 [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "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 "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.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 [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
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 ;