About the Execution of Smart+red for Diffusion2D-PT-D20N050
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.r139-smll-167819422100165.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 smartxred
Input is Diffusion2D-PT-D20N050, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r139-smll-167819422100165
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 5.5K Feb 26 04:18 CTLCardinality.txt
-rw-r--r-- 1 mcc users 43K Feb 26 04:18 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 26 04:17 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 26 04:17 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.3K Feb 25 15:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K 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 5.9K Feb 26 04:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 40K Feb 26 04:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Feb 26 04:18 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 26 04:18 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 1.2M 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-D20N050-UpperBounds-00
FORMULA_NAME Diffusion2D-PT-D20N050-UpperBounds-01
FORMULA_NAME Diffusion2D-PT-D20N050-UpperBounds-02
FORMULA_NAME Diffusion2D-PT-D20N050-UpperBounds-03
FORMULA_NAME Diffusion2D-PT-D20N050-UpperBounds-04
FORMULA_NAME Diffusion2D-PT-D20N050-UpperBounds-05
FORMULA_NAME Diffusion2D-PT-D20N050-UpperBounds-06
FORMULA_NAME Diffusion2D-PT-D20N050-UpperBounds-07
FORMULA_NAME Diffusion2D-PT-D20N050-UpperBounds-08
FORMULA_NAME Diffusion2D-PT-D20N050-UpperBounds-09
FORMULA_NAME Diffusion2D-PT-D20N050-UpperBounds-10
FORMULA_NAME Diffusion2D-PT-D20N050-UpperBounds-11
FORMULA_NAME Diffusion2D-PT-D20N050-UpperBounds-12
FORMULA_NAME Diffusion2D-PT-D20N050-UpperBounds-13
FORMULA_NAME Diffusion2D-PT-D20N050-UpperBounds-14
FORMULA_NAME Diffusion2D-PT-D20N050-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1678326985994
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=smartxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Diffusion2D-PT-D20N050
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-09 01:56:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-09 01:56:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 01:56:29] [INFO ] Load time of PNML (sax parser for PT used): 379 ms
[2023-03-09 01:56:29] [INFO ] Transformed 400 places.
[2023-03-09 01:56:30] [INFO ] Transformed 2964 transitions.
[2023-03-09 01:56:30] [INFO ] Parsed PT model containing 400 places and 2964 transitions and 5928 arcs in 552 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 13 ms.
// Phase 1: matrix 2964 rows 400 cols
[2023-03-09 01:56:30] [INFO ] Computed 1 place invariants in 82 ms
Incomplete random walk after 10043 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=627 ) properties (out of 16) seen :250
FORMULA Diffusion2D-PT-D20N050-UpperBounds-15 50 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D20N050-UpperBounds-10 50 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D20N050-UpperBounds-05 50 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D20N050-UpperBounds-02 50 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D20N050-UpperBounds-01 50 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 11) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 11) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 11) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 11) seen :50
FORMULA Diffusion2D-PT-D20N050-UpperBounds-08 50 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 10) 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 10) 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 10) seen :0
[2023-03-09 01:56:30] [INFO ] Invariant cache hit.
[2023-03-09 01:56:30] [INFO ] [Real]Absence check using 1 positive place invariants in 10 ms returned sat
[2023-03-09 01:56:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 01:56:31] [INFO ] [Real]Absence check using state equation in 954 ms returned sat
[2023-03-09 01:56:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 01:56:32] [INFO ] [Nat]Absence check using 1 positive place invariants in 7 ms returned sat
[2023-03-09 01:56:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 01:56:32] [INFO ] [Nat]Absence check using state equation in 787 ms returned sat
[2023-03-09 01:56:33] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 436 ms.
Minimization took 272 ms.
[2023-03-09 01:56:34] [INFO ] [Real]Absence check using 1 positive place invariants in 6 ms returned sat
[2023-03-09 01:56:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 01:56:34] [INFO ] [Real]Absence check using state equation in 821 ms returned sat
[2023-03-09 01:56:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 01:56:35] [INFO ] [Nat]Absence check using 1 positive place invariants in 6 ms returned sat
[2023-03-09 01:56:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 01:56:35] [INFO ] [Nat]Absence check using state equation in 807 ms returned sat
[2023-03-09 01:56:36] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 323 ms.
Minimization took 301 ms.
[2023-03-09 01:56:36] [INFO ] [Real]Absence check using 1 positive place invariants in 6 ms returned sat
[2023-03-09 01:56:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 01:56:37] [INFO ] [Real]Absence check using state equation in 716 ms returned sat
[2023-03-09 01:56:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 01:56:37] [INFO ] [Nat]Absence check using 1 positive place invariants in 5 ms returned sat
[2023-03-09 01:56:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 01:56:38] [INFO ] [Nat]Absence check using state equation in 590 ms returned sat
[2023-03-09 01:56:38] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 219 ms.
Minimization took 271 ms.
[2023-03-09 01:56:39] [INFO ] [Real]Absence check using 1 positive place invariants in 9 ms returned sat
[2023-03-09 01:56:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 01:56:39] [INFO ] [Real]Absence check using state equation in 809 ms returned sat
[2023-03-09 01:56:40] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 220 ms.
Minimization took 517 ms.
[2023-03-09 01:56:41] [INFO ] [Real]Absence check using 1 positive place invariants in 9 ms returned sat
[2023-03-09 01:56:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 01:56:42] [INFO ] [Real]Absence check using state equation in 917 ms returned sat
[2023-03-09 01:56:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 01:56:42] [INFO ] [Nat]Absence check using 1 positive place invariants in 6 ms returned sat
[2023-03-09 01:56:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 01:56:42] [INFO ] [Nat]Absence check using state equation in 818 ms returned sat
[2023-03-09 01:56:43] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 266 ms.
Minimization took 304 ms.
[2023-03-09 01:56:43] [INFO ] [Real]Absence check using 1 positive place invariants in 9 ms returned sat
[2023-03-09 01:56:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 01:56:44] [INFO ] [Real]Absence check using state equation in 782 ms returned sat
[2023-03-09 01:56:45] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 235 ms.
Minimization took 568 ms.
[2023-03-09 01:56:45] [INFO ] [Real]Absence check using 1 positive place invariants in 6 ms returned sat
[2023-03-09 01:56:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 01:56:46] [INFO ] [Real]Absence check using state equation in 727 ms returned sat
[2023-03-09 01:56:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 01:56:46] [INFO ] [Nat]Absence check using 1 positive place invariants in 6 ms returned sat
[2023-03-09 01:56:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 01:56:47] [INFO ] [Nat]Absence check using state equation in 720 ms returned sat
[2023-03-09 01:56:47] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 177 ms.
Minimization took 343 ms.
[2023-03-09 01:56:48] [INFO ] [Real]Absence check using 1 positive place invariants in 7 ms returned sat
[2023-03-09 01:56:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 01:56:48] [INFO ] [Real]Absence check using state equation in 682 ms returned sat
[2023-03-09 01:56:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 01:56:49] [INFO ] [Nat]Absence check using 1 positive place invariants in 6 ms returned sat
[2023-03-09 01:56:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 01:56:49] [INFO ] [Nat]Absence check using state equation in 608 ms returned sat
[2023-03-09 01:56:49] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 206 ms.
Minimization took 301 ms.
[2023-03-09 01:56:50] [INFO ] [Real]Absence check using 1 positive place invariants in 6 ms returned sat
[2023-03-09 01:56:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 01:56:51] [INFO ] [Real]Absence check using state equation in 754 ms returned sat
[2023-03-09 01:56:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 01:56:51] [INFO ] [Nat]Absence check using 1 positive place invariants in 6 ms returned sat
[2023-03-09 01:56:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 01:56:52] [INFO ] [Nat]Absence check using state equation in 646 ms returned sat
[2023-03-09 01:56:52] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 210 ms.
Minimization took 281 ms.
[2023-03-09 01:56:52] [INFO ] [Real]Absence check using 1 positive place invariants in 9 ms returned sat
[2023-03-09 01:56:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 01:56:53] [INFO ] [Real]Absence check using state equation in 646 ms returned sat
[2023-03-09 01:56:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 01:56:53] [INFO ] [Nat]Absence check using 1 positive place invariants in 5 ms returned sat
[2023-03-09 01:56:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 01:56:54] [INFO ] [Nat]Absence check using state equation in 822 ms returned sat
[2023-03-09 01:56:54] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 238 ms.
Minimization took 448 ms.
Current structural bounds on expressions (after SMT) : [50, 50, 50, 50, 50, 50, 50, 50, 50, 50] Max seen :[0, 0, 0, 1, 0, 1, 0, 0, 0, 0]
FORMULA Diffusion2D-PT-D20N050-UpperBounds-14 50 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Diffusion2D-PT-D20N050-UpperBounds-13 50 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Diffusion2D-PT-D20N050-UpperBounds-11 50 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Diffusion2D-PT-D20N050-UpperBounds-06 50 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Diffusion2D-PT-D20N050-UpperBounds-04 50 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Diffusion2D-PT-D20N050-UpperBounds-03 50 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Diffusion2D-PT-D20N050-UpperBounds-00 50 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Diffusion2D-PT-D20N050-UpperBounds-12 50 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Diffusion2D-PT-D20N050-UpperBounds-09 50 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Diffusion2D-PT-D20N050-UpperBounds-07 50 TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.
Total runtime 43255 ms.
ITS solved all properties within timeout
BK_STOP 1678327033773
--------------------
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-D20N050"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="smartxred"
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 smartxred"
echo " Input is Diffusion2D-PT-D20N050, 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 r139-smll-167819422100165"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Diffusion2D-PT-D20N050.tgz
mv Diffusion2D-PT-D20N050 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 ;