fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r137-smll-167819418500462
Last Updated
May 14, 2023

About the Execution of LTSMin+red for DoubleExponent-PT-003

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
330.640 23518.00 48520.00 443.10 TTTFFFFTFFTTTFFF normal

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-167819418500462.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 DoubleExponent-PT-003, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r137-smll-167819418500462
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 516K
-rw-r--r-- 1 mcc users 7.4K Feb 26 13:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 26 13:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 26 13:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 26 13:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 16:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 13:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 145K Feb 26 13:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 26 13:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 26 13:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 50K 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 booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678858408345

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=DoubleExponent-PT-003
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-15 05:33:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-15 05:33:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 05:33:30] [INFO ] Load time of PNML (sax parser for PT used): 64 ms
[2023-03-15 05:33:30] [INFO ] Transformed 163 places.
[2023-03-15 05:33:30] [INFO ] Transformed 148 transitions.
[2023-03-15 05:33:30] [INFO ] Parsed PT model containing 163 places and 148 transitions and 417 arcs in 169 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 27 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA DoubleExponent-PT-003-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-003-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-003-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 328 resets, run finished after 827 ms. (steps per millisecond=12 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 286 resets, run finished after 233 ms. (steps per millisecond=42 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 276 resets, run finished after 281 ms. (steps per millisecond=35 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 276 resets, run finished after 255 ms. (steps per millisecond=39 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 285 resets, run finished after 247 ms. (steps per millisecond=40 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 302 resets, run finished after 284 ms. (steps per millisecond=35 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 286 resets, run finished after 295 ms. (steps per millisecond=33 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 287 resets, run finished after 233 ms. (steps per millisecond=42 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 268 resets, run finished after 228 ms. (steps per millisecond=43 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 284 resets, run finished after 228 ms. (steps per millisecond=43 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 287 resets, run finished after 238 ms. (steps per millisecond=42 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 278 resets, run finished after 243 ms. (steps per millisecond=41 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 277 resets, run finished after 287 ms. (steps per millisecond=34 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 281 resets, run finished after 264 ms. (steps per millisecond=37 ) properties (out of 13) seen :0
Interrupted probabilistic random walk after 629437 steps, run timeout after 12001 ms. (steps per millisecond=52 ) properties seen :{6=1, 8=1, 12=1}
Probabilistic random walk after 629437 steps, saw 314770 distinct states, run finished after 12003 ms. (steps per millisecond=52 ) properties seen :3
FORMULA DoubleExponent-PT-003-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA DoubleExponent-PT-003-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA DoubleExponent-PT-003-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 10 properties.
// Phase 1: matrix 148 rows 163 cols
[2023-03-15 05:33:47] [INFO ] Computed 19 place invariants in 18 ms
[2023-03-15 05:33:47] [INFO ] After 363ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-15 05:33:47] [INFO ] [Nat]Absence check using 5 positive place invariants in 11 ms returned sat
[2023-03-15 05:33:47] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 9 ms returned sat
[2023-03-15 05:33:48] [INFO ] After 294ms SMT Verify possible using state equation in natural domain returned unsat :9 sat :1
[2023-03-15 05:33:48] [INFO ] Deduced a trap composed of 68 places in 108 ms of which 8 ms to minimize.
[2023-03-15 05:33:48] [INFO ] Deduced a trap composed of 39 places in 96 ms of which 1 ms to minimize.
[2023-03-15 05:33:48] [INFO ] Deduced a trap composed of 29 places in 85 ms of which 1 ms to minimize.
[2023-03-15 05:33:48] [INFO ] Deduced a trap composed of 35 places in 79 ms of which 2 ms to minimize.
[2023-03-15 05:33:48] [INFO ] Deduced a trap composed of 46 places in 79 ms of which 1 ms to minimize.
[2023-03-15 05:33:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 5 trap constraints in 591 ms
[2023-03-15 05:33:48] [INFO ] After 972ms SMT Verify possible using trap constraints in natural domain returned unsat :10 sat :0
[2023-03-15 05:33:48] [INFO ] After 1168ms SMT Verify possible using all constraints in natural domain returned unsat :10 sat :0
FORMULA DoubleExponent-PT-003-ReachabilityCardinality-11 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DoubleExponent-PT-003-ReachabilityCardinality-10 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DoubleExponent-PT-003-ReachabilityCardinality-09 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DoubleExponent-PT-003-ReachabilityCardinality-07 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DoubleExponent-PT-003-ReachabilityCardinality-05 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DoubleExponent-PT-003-ReachabilityCardinality-04 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DoubleExponent-PT-003-ReachabilityCardinality-03 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DoubleExponent-PT-003-ReachabilityCardinality-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DoubleExponent-PT-003-ReachabilityCardinality-01 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DoubleExponent-PT-003-ReachabilityCardinality-00 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 10 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
All properties solved without resorting to model-checking.
Total runtime 18124 ms.
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --invariant=/tmp/473/inv_0_ --invariant=/tmp/473/inv_1_ --invariant=/tmp/473/inv_2_ --invariant=/tmp/473/inv_3_ --invariant=/tmp/473/inv_4_ --invariant=/tmp/473/inv_5_ --invariant=/tmp/473/inv_6_ --invariant=/tmp/473/inv_7_ --invariant=/tmp/473/inv_8_ --invariant=/tmp/473/inv_9_ --invariant=/tmp/473/inv_10_ --invariant=/tmp/473/inv_11_ --invariant=/tmp/473/inv_12_ --invariant=/tmp/473/inv_13_ --invariant=/tmp/473/inv_14_ --invariant=/tmp/473/inv_15_ --inv-par
FORMULA DoubleExponent-PT-003-ReachabilityCardinality-00 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DoubleExponent-PT-003-ReachabilityCardinality-01 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DoubleExponent-PT-003-ReachabilityCardinality-02 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DoubleExponent-PT-003-ReachabilityCardinality-03 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DoubleExponent-PT-003-ReachabilityCardinality-04 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DoubleExponent-PT-003-ReachabilityCardinality-05 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DoubleExponent-PT-003-ReachabilityCardinality-06 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DoubleExponent-PT-003-ReachabilityCardinality-07 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DoubleExponent-PT-003-ReachabilityCardinality-08 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DoubleExponent-PT-003-ReachabilityCardinality-09 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DoubleExponent-PT-003-ReachabilityCardinality-10 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DoubleExponent-PT-003-ReachabilityCardinality-11 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DoubleExponent-PT-003-ReachabilityCardinality-12 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DoubleExponent-PT-003-ReachabilityCardinality-13 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DoubleExponent-PT-003-ReachabilityCardinality-14 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DoubleExponent-PT-003-ReachabilityCardinality-15 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN

BK_STOP 1678858431863

--------------------
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 ReachabilityCardinality -timeout 360 -rebuildPNML
mcc2023
rfs formula name DoubleExponent-PT-003-ReachabilityCardinality-00
rfs formula type AG
rfs formula formula --invariant=/tmp/473/inv_0_
rfs formula name DoubleExponent-PT-003-ReachabilityCardinality-01
rfs formula type AG
rfs formula formula --invariant=/tmp/473/inv_1_
rfs formula name DoubleExponent-PT-003-ReachabilityCardinality-02
rfs formula type AG
rfs formula formula --invariant=/tmp/473/inv_2_
rfs formula name DoubleExponent-PT-003-ReachabilityCardinality-03
rfs formula type EF
rfs formula formula --invariant=/tmp/473/inv_3_
rfs formula name DoubleExponent-PT-003-ReachabilityCardinality-04
rfs formula type EF
rfs formula formula --invariant=/tmp/473/inv_4_
rfs formula name DoubleExponent-PT-003-ReachabilityCardinality-05
rfs formula type EF
rfs formula formula --invariant=/tmp/473/inv_5_
rfs formula name DoubleExponent-PT-003-ReachabilityCardinality-06
rfs formula type AG
rfs formula formula --invariant=/tmp/473/inv_6_
rfs formula name DoubleExponent-PT-003-ReachabilityCardinality-07
rfs formula type AG
rfs formula formula --invariant=/tmp/473/inv_7_
rfs formula name DoubleExponent-PT-003-ReachabilityCardinality-08
rfs formula type AG
rfs formula formula --invariant=/tmp/473/inv_8_
rfs formula name DoubleExponent-PT-003-ReachabilityCardinality-09
rfs formula type EF
rfs formula formula --invariant=/tmp/473/inv_9_
rfs formula name DoubleExponent-PT-003-ReachabilityCardinality-10
rfs formula type AG
rfs formula formula --invariant=/tmp/473/inv_10_
rfs formula name DoubleExponent-PT-003-ReachabilityCardinality-11
rfs formula type AG
rfs formula formula --invariant=/tmp/473/inv_11_
rfs formula name DoubleExponent-PT-003-ReachabilityCardinality-12
rfs formula type EF
rfs formula formula --invariant=/tmp/473/inv_12_
rfs formula name DoubleExponent-PT-003-ReachabilityCardinality-13
rfs formula type AG
rfs formula formula --invariant=/tmp/473/inv_13_
rfs formula name DoubleExponent-PT-003-ReachabilityCardinality-14
rfs formula type AG
rfs formula formula --invariant=/tmp/473/inv_14_
rfs formula name DoubleExponent-PT-003-ReachabilityCardinality-15
rfs formula type AG
rfs formula formula --invariant=/tmp/473/inv_15_
pnml2lts-sym: Exploration order is bfs-prev
pnml2lts-sym: Saturation strategy is sat
pnml2lts-sym: Guided search strategy is unguided
pnml2lts-sym: Attractor strategy is default
pnml2lts-sym: opening model.pnml
pnml2lts-sym: Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-sym: Petri net has 163 places, 148 transitions and 417 arcs
pnml2lts-sym: Petri net DoubleExponent-PT-003 analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-sym: Initializing regrouping layer
pnml2lts-sym: Regroup specification: bs,w2W,ru,hf
pnml2lts-sym: Regroup Boost's Sloan
pnml2lts-sym: Regroup over-approximate must-write to may-write
pnml2lts-sym: Regroup Row sUbsume
pnml2lts-sym: Reqroup Horizontal Flip
pnml2lts-sym: Regrouping: 148->148 groups
pnml2lts-sym: Regrouping took 0.020 real 0.010 user 0.010 sys
pnml2lts-sym: state vector length is 163; there are 148 groups
pnml2lts-sym: Creating a multi-core ListDD domain.
pnml2lts-sym: Sylvan allocates 15.000 GB virtual memory for nodes table and operation cache.
pnml2lts-sym: Initial nodes table and operation cache requires 60.00 MB.
pnml2lts-sym: Using GBgetTransitionsShortR2W as next-state function
pnml2lts-sym: got initial state
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/473/inv_15_) found at depth 0!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/473/inv_14_) found at depth 0!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/473/inv_13_) found at depth 0!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/473/inv_12_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/473/inv_8_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/473/inv_6_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym: Exploration took 134732 group checks and 0 next state calls
pnml2lts-sym: reachability took 1.570 real 6.090 user 0.180 sys
pnml2lts-sym: counting visited states...
pnml2lts-sym: counting took 0.010 real 0.030 user 0.000 sys
pnml2lts-sym: state space has 2385072 states, 68329 nodes
pnml2lts-sym: group_next: 3312 nodes total
pnml2lts-sym: group_explored: 3141 nodes, 4131 short vectors total
pnml2lts-sym: max token count: 256

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="DoubleExponent-PT-003"
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 DoubleExponent-PT-003, 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 r137-smll-167819418500462"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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