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.r201-smll-167840347600357.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 HealthRecord-PT-16, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r201-smll-167840347600357
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 508K
-rw-r--r-- 1 mcc users 6.5K Feb 26 18:06 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Feb 26 18:06 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Feb 26 18:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 26 18:05 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 16:14 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:14 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.5K Feb 26 18:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 72K Feb 26 18:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Feb 26 18:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K Feb 26 18:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:14 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 125K 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 HealthRecord-PT-16-UpperBounds-00
FORMULA_NAME HealthRecord-PT-16-UpperBounds-01
FORMULA_NAME HealthRecord-PT-16-UpperBounds-02
FORMULA_NAME HealthRecord-PT-16-UpperBounds-03
FORMULA_NAME HealthRecord-PT-16-UpperBounds-04
FORMULA_NAME HealthRecord-PT-16-UpperBounds-05
FORMULA_NAME HealthRecord-PT-16-UpperBounds-06
FORMULA_NAME HealthRecord-PT-16-UpperBounds-07
FORMULA_NAME HealthRecord-PT-16-UpperBounds-08
FORMULA_NAME HealthRecord-PT-16-UpperBounds-09
FORMULA_NAME HealthRecord-PT-16-UpperBounds-10
FORMULA_NAME HealthRecord-PT-16-UpperBounds-11
FORMULA_NAME HealthRecord-PT-16-UpperBounds-12
FORMULA_NAME HealthRecord-PT-16-UpperBounds-13
FORMULA_NAME HealthRecord-PT-16-UpperBounds-14
FORMULA_NAME HealthRecord-PT-16-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678641313233

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=HealthRecord-PT-16
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 17:15:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-12 17:15:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 17:15:16] [INFO ] Load time of PNML (sax parser for PT used): 126 ms
[2023-03-12 17:15:16] [INFO ] Transformed 453 places.
[2023-03-12 17:15:16] [INFO ] Transformed 594 transitions.
[2023-03-12 17:15:16] [INFO ] Found NUPN structural information;
[2023-03-12 17:15:16] [INFO ] Parsed PT model containing 453 places and 594 transitions and 1333 arcs in 251 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
// Phase 1: matrix 594 rows 453 cols
[2023-03-12 17:15:16] [INFO ] Computed 14 place invariants in 37 ms
Incomplete random walk after 10000 steps, including 96 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 16) seen :13
FORMULA HealthRecord-PT-16-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-16-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-16-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-16-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-16-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-16-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-16-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-16-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-16-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-16-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-16-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-16-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-16-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 17 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 18 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 3) seen :0
[2023-03-12 17:15:16] [INFO ] Invariant cache hit.
[2023-03-12 17:15:16] [INFO ] [Real]Absence check using 8 positive place invariants in 23 ms returned sat
[2023-03-12 17:15:16] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 12 ms returned sat
[2023-03-12 17:15:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 17:15:17] [INFO ] [Real]Absence check using state equation in 302 ms returned sat
[2023-03-12 17:15:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 17:15:17] [INFO ] [Nat]Absence check using 8 positive place invariants in 20 ms returned sat
[2023-03-12 17:15:17] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 12 ms returned sat
[2023-03-12 17:15:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 17:15:17] [INFO ] [Nat]Absence check using state equation in 258 ms returned sat
[2023-03-12 17:15:17] [INFO ] Computed and/alt/rep : 551/663/551 causal constraints (skipped 42 transitions) in 70 ms.
[2023-03-12 17:15:19] [INFO ] Added : 200 causal constraints over 41 iterations in 1853 ms. Result :sat
Minimization took 127 ms.
[2023-03-12 17:15:20] [INFO ] [Real]Absence check using 8 positive place invariants in 18 ms returned sat
[2023-03-12 17:15:20] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 10 ms returned sat
[2023-03-12 17:15:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 17:15:20] [INFO ] [Real]Absence check using state equation in 251 ms returned sat
[2023-03-12 17:15:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 17:15:20] [INFO ] [Nat]Absence check using 8 positive place invariants in 18 ms returned sat
[2023-03-12 17:15:20] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 9 ms returned sat
[2023-03-12 17:15:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 17:15:20] [INFO ] [Nat]Absence check using state equation in 267 ms returned sat
[2023-03-12 17:15:21] [INFO ] Deduced a trap composed of 103 places in 239 ms of which 6 ms to minimize.
[2023-03-12 17:15:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 294 ms
[2023-03-12 17:15:21] [INFO ] Computed and/alt/rep : 551/663/551 causal constraints (skipped 42 transitions) in 72 ms.
[2023-03-12 17:15:21] [INFO ] Added : 79 causal constraints over 16 iterations in 664 ms. Result :sat
Minimization took 84 ms.
[2023-03-12 17:15:21] [INFO ] [Real]Absence check using 8 positive place invariants in 17 ms returned sat
[2023-03-12 17:15:21] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 9 ms returned sat
[2023-03-12 17:15:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 17:15:22] [INFO ] [Real]Absence check using state equation in 243 ms returned sat
[2023-03-12 17:15:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 17:15:22] [INFO ] [Nat]Absence check using 8 positive place invariants in 18 ms returned sat
[2023-03-12 17:15:22] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 9 ms returned sat
[2023-03-12 17:15:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 17:15:22] [INFO ] [Nat]Absence check using state equation in 244 ms returned sat
[2023-03-12 17:15:22] [INFO ] Computed and/alt/rep : 551/663/551 causal constraints (skipped 42 transitions) in 45 ms.
[2023-03-12 17:15:23] [INFO ] Added : 65 causal constraints over 13 iterations in 523 ms. Result :sat
Minimization took 73 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1] Max seen :[0, 0, 0]
FORMULA HealthRecord-PT-16-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 2 out of 453 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 453/453 places, 594/594 transitions.
Graph (trivial) has 533 edges and 453 vertex of which 49 / 453 are part of one of the 17 SCC in 5 ms
Free SCC test removed 32 places
Drop transitions removed 52 transitions
Reduce isomorphic transitions removed 52 transitions.
Graph (complete) has 820 edges and 421 vertex of which 380 are kept as prefixes of interest. Removing 41 places using SCC suffix rule.2 ms
Discarding 41 places :
Also discarding 28 output transitions
Drop transitions removed 28 transitions
Drop transitions removed 96 transitions
Reduce isomorphic transitions removed 96 transitions.
Drop transitions removed 221 transitions
Trivial Post-agglo rules discarded 221 transitions
Performed 221 trivial Post agglomeration. Transition count delta: 221
Iterating post reduction 0 with 317 rules applied. Total rules applied 319 place count 380 transition count 197
Reduce places removed 221 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 249 rules applied. Total rules applied 568 place count 159 transition count 169
Reduce places removed 12 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 13 rules applied. Total rules applied 581 place count 147 transition count 168
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 582 place count 146 transition count 168
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 14 Pre rules applied. Total rules applied 582 place count 146 transition count 154
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 610 place count 132 transition count 154
Discarding 58 places :
Symmetric choice reduction at 4 with 58 rule applications. Total rules 668 place count 74 transition count 96
Iterating global reduction 4 with 58 rules applied. Total rules applied 726 place count 74 transition count 96
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 726 place count 74 transition count 90
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 738 place count 68 transition count 90
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 747 place count 59 transition count 81
Iterating global reduction 4 with 9 rules applied. Total rules applied 756 place count 59 transition count 81
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 763 place count 52 transition count 74
Iterating global reduction 4 with 7 rules applied. Total rules applied 770 place count 52 transition count 74
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 773 place count 52 transition count 71
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 780 place count 45 transition count 62
Iterating global reduction 5 with 7 rules applied. Total rules applied 787 place count 45 transition count 62
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 792 place count 45 transition count 57
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 794 place count 43 transition count 55
Iterating global reduction 6 with 2 rules applied. Total rules applied 796 place count 43 transition count 55
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 797 place count 43 transition count 54
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 7 with 20 rules applied. Total rules applied 817 place count 33 transition count 44
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 825 place count 29 transition count 59
Free-agglomeration rule applied 5 times with reduction of 1 identical transitions.
Iterating global reduction 7 with 5 rules applied. Total rules applied 830 place count 29 transition count 53
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 835 place count 24 transition count 53
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 836 place count 24 transition count 53
Applied a total of 836 rules in 97 ms. Remains 24 /453 variables (removed 429) and now considering 53/594 (removed 541) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 99 ms. Remains : 24/453 places, 53/594 transitions.
Normalized transition count is 44 out of 53 initially.
// Phase 1: matrix 44 rows 24 cols
[2023-03-12 17:15:23] [INFO ] Computed 6 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 77853 resets, run finished after 1694 ms. (steps per millisecond=590 ) properties (out of 2) seen :2
FORMULA HealthRecord-PT-16-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-16-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 9189 ms.
ITS solved all properties within timeout

BK_STOP 1678641326181

--------------------
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="HealthRecord-PT-16"
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 HealthRecord-PT-16, 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 r201-smll-167840347600357"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/HealthRecord-PT-16.tgz
mv HealthRecord-PT-16 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 '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;