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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 6.7K Feb 26 13:31 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Feb 26 13:31 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 26 13:30 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 26 13:30 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.4K Feb 25 16:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:00 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:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 136K Feb 26 13:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Feb 26 13:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 117K Feb 26 13:32 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 33K 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-002-ReachabilityCardinality-00
FORMULA_NAME DoubleExponent-PT-002-ReachabilityCardinality-01
FORMULA_NAME DoubleExponent-PT-002-ReachabilityCardinality-02
FORMULA_NAME DoubleExponent-PT-002-ReachabilityCardinality-03
FORMULA_NAME DoubleExponent-PT-002-ReachabilityCardinality-04
FORMULA_NAME DoubleExponent-PT-002-ReachabilityCardinality-05
FORMULA_NAME DoubleExponent-PT-002-ReachabilityCardinality-06
FORMULA_NAME DoubleExponent-PT-002-ReachabilityCardinality-07
FORMULA_NAME DoubleExponent-PT-002-ReachabilityCardinality-08
FORMULA_NAME DoubleExponent-PT-002-ReachabilityCardinality-09
FORMULA_NAME DoubleExponent-PT-002-ReachabilityCardinality-10
FORMULA_NAME DoubleExponent-PT-002-ReachabilityCardinality-11
FORMULA_NAME DoubleExponent-PT-002-ReachabilityCardinality-12
FORMULA_NAME DoubleExponent-PT-002-ReachabilityCardinality-13
FORMULA_NAME DoubleExponent-PT-002-ReachabilityCardinality-14
FORMULA_NAME DoubleExponent-PT-002-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678856589156

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-002
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-15 05:03:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-15 05:03:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 05:03:12] [INFO ] Load time of PNML (sax parser for PT used): 56 ms
[2023-03-15 05:03:12] [INFO ] Transformed 110 places.
[2023-03-15 05:03:12] [INFO ] Transformed 98 transitions.
[2023-03-15 05:03:12] [INFO ] Parsed PT model containing 110 places and 98 transitions and 276 arcs in 154 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 29 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA DoubleExponent-PT-002-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-002-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 332 resets, run finished after 815 ms. (steps per millisecond=12 ) properties (out of 14) seen :2
FORMULA DoubleExponent-PT-002-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleExponent-PT-002-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 274 resets, run finished after 308 ms. (steps per millisecond=32 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 303 resets, run finished after 351 ms. (steps per millisecond=28 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 277 resets, run finished after 304 ms. (steps per millisecond=32 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 282 resets, run finished after 297 ms. (steps per millisecond=33 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 290 resets, run finished after 322 ms. (steps per millisecond=31 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 281 resets, run finished after 279 ms. (steps per millisecond=35 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 298 resets, run finished after 241 ms. (steps per millisecond=41 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 303 resets, run finished after 249 ms. (steps per millisecond=40 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 303 resets, run finished after 335 ms. (steps per millisecond=29 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 291 resets, run finished after 236 ms. (steps per millisecond=42 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 285 resets, run finished after 236 ms. (steps per millisecond=42 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 283 resets, run finished after 240 ms. (steps per millisecond=41 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
// Phase 1: matrix 98 rows 110 cols
[2023-03-15 05:03:16] [INFO ] Computed 14 place invariants in 22 ms
[2023-03-15 05:03:16] [INFO ] After 345ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-15 05:03:17] [INFO ] [Nat]Absence check using 5 positive place invariants in 9 ms returned sat
[2023-03-15 05:03:17] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 11 ms returned sat
[2023-03-15 05:03:17] [INFO ] After 199ms SMT Verify possible using state equation in natural domain returned unsat :10 sat :2
[2023-03-15 05:03:17] [INFO ] Deduced a trap composed of 18 places in 82 ms of which 5 ms to minimize.
[2023-03-15 05:03:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 92 ms
[2023-03-15 05:03:17] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
[2023-03-15 05:03:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 77 ms
[2023-03-15 05:03:17] [INFO ] After 462ms SMT Verify possible using trap constraints in natural domain returned unsat :11 sat :1
Attempting to minimize the solution found.
Minimization took 41 ms.
[2023-03-15 05:03:17] [INFO ] After 719ms SMT Verify possible using all constraints in natural domain returned unsat :11 sat :1
FORMULA DoubleExponent-PT-002-ReachabilityCardinality-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DoubleExponent-PT-002-ReachabilityCardinality-09 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DoubleExponent-PT-002-ReachabilityCardinality-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DoubleExponent-PT-002-ReachabilityCardinality-07 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DoubleExponent-PT-002-ReachabilityCardinality-06 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DoubleExponent-PT-002-ReachabilityCardinality-05 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DoubleExponent-PT-002-ReachabilityCardinality-04 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DoubleExponent-PT-002-ReachabilityCardinality-03 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DoubleExponent-PT-002-ReachabilityCardinality-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DoubleExponent-PT-002-ReachabilityCardinality-01 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DoubleExponent-PT-002-ReachabilityCardinality-00 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 12 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 4 ms.
Support contains 24 out of 110 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 110/110 places, 98/98 transitions.
Graph (complete) has 178 edges and 110 vertex of which 104 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 103 transition count 88
Reduce places removed 8 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 14 rules applied. Total rules applied 26 place count 95 transition count 82
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 32 place count 89 transition count 82
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 32 place count 89 transition count 79
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 38 place count 86 transition count 79
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 52 place count 79 transition count 72
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 53 place count 79 transition count 71
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 54 place count 78 transition count 71
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 4 with 7 rules applied. Total rules applied 61 place count 78 transition count 64
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 68 place count 71 transition count 64
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 74 place count 71 transition count 64
Applied a total of 74 rules in 64 ms. Remains 71 /110 variables (removed 39) and now considering 64/98 (removed 34) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65 ms. Remains : 71/110 places, 64/98 transitions.
Incomplete random walk after 10000 steps, including 405 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 347 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Finished probabilistic random walk after 362 steps, run visited all 1 properties in 17 ms. (steps per millisecond=21 )
Probabilistic random walk after 362 steps, saw 189 distinct states, run finished after 18 ms. (steps per millisecond=20 ) properties seen :1
FORMULA DoubleExponent-PT-002-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.
Total runtime 5866 ms.
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --invariant=/tmp/459/inv_0_ --invariant=/tmp/459/inv_1_ --invariant=/tmp/459/inv_2_ --invariant=/tmp/459/inv_3_ --invariant=/tmp/459/inv_4_ --invariant=/tmp/459/inv_5_ --invariant=/tmp/459/inv_6_ --invariant=/tmp/459/inv_7_ --invariant=/tmp/459/inv_8_ --invariant=/tmp/459/inv_9_ --invariant=/tmp/459/inv_10_ --invariant=/tmp/459/inv_11_ --invariant=/tmp/459/inv_12_ --invariant=/tmp/459/inv_13_ --invariant=/tmp/459/inv_14_ --invariant=/tmp/459/inv_15_ --inv-par
FORMULA DoubleExponent-PT-002-ReachabilityCardinality-00 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DoubleExponent-PT-002-ReachabilityCardinality-01 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DoubleExponent-PT-002-ReachabilityCardinality-02 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DoubleExponent-PT-002-ReachabilityCardinality-03 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DoubleExponent-PT-002-ReachabilityCardinality-04 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DoubleExponent-PT-002-ReachabilityCardinality-05 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DoubleExponent-PT-002-ReachabilityCardinality-06 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DoubleExponent-PT-002-ReachabilityCardinality-07 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DoubleExponent-PT-002-ReachabilityCardinality-08 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DoubleExponent-PT-002-ReachabilityCardinality-09 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DoubleExponent-PT-002-ReachabilityCardinality-10 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DoubleExponent-PT-002-ReachabilityCardinality-11 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DoubleExponent-PT-002-ReachabilityCardinality-12 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DoubleExponent-PT-002-ReachabilityCardinality-13 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DoubleExponent-PT-002-ReachabilityCardinality-14 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DoubleExponent-PT-002-ReachabilityCardinality-15 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN

BK_STOP 1678856599331

--------------------
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-002-ReachabilityCardinality-00
rfs formula type EF
rfs formula formula --invariant=/tmp/459/inv_0_
rfs formula name DoubleExponent-PT-002-ReachabilityCardinality-01
rfs formula type AG
rfs formula formula --invariant=/tmp/459/inv_1_
rfs formula name DoubleExponent-PT-002-ReachabilityCardinality-02
rfs formula type AG
rfs formula formula --invariant=/tmp/459/inv_2_
rfs formula name DoubleExponent-PT-002-ReachabilityCardinality-03
rfs formula type AG
rfs formula formula --invariant=/tmp/459/inv_3_
rfs formula name DoubleExponent-PT-002-ReachabilityCardinality-04
rfs formula type EF
rfs formula formula --invariant=/tmp/459/inv_4_
rfs formula name DoubleExponent-PT-002-ReachabilityCardinality-05
rfs formula type EF
rfs formula formula --invariant=/tmp/459/inv_5_
rfs formula name DoubleExponent-PT-002-ReachabilityCardinality-06
rfs formula type EF
rfs formula formula --invariant=/tmp/459/inv_6_
rfs formula name DoubleExponent-PT-002-ReachabilityCardinality-07
rfs formula type AG
rfs formula formula --invariant=/tmp/459/inv_7_
rfs formula name DoubleExponent-PT-002-ReachabilityCardinality-08
rfs formula type EF
rfs formula formula --invariant=/tmp/459/inv_8_
rfs formula name DoubleExponent-PT-002-ReachabilityCardinality-09
rfs formula type AG
rfs formula formula --invariant=/tmp/459/inv_9_
rfs formula name DoubleExponent-PT-002-ReachabilityCardinality-10
rfs formula type EF
rfs formula formula --invariant=/tmp/459/inv_10_
rfs formula name DoubleExponent-PT-002-ReachabilityCardinality-11
rfs formula type EF
rfs formula formula --invariant=/tmp/459/inv_11_
rfs formula name DoubleExponent-PT-002-ReachabilityCardinality-12
rfs formula type EF
rfs formula formula --invariant=/tmp/459/inv_12_
rfs formula name DoubleExponent-PT-002-ReachabilityCardinality-13
rfs formula type AG
rfs formula formula --invariant=/tmp/459/inv_13_
rfs formula name DoubleExponent-PT-002-ReachabilityCardinality-14
rfs formula type EF
rfs formula formula --invariant=/tmp/459/inv_14_
rfs formula name DoubleExponent-PT-002-ReachabilityCardinality-15
rfs formula type EF
rfs formula formula --invariant=/tmp/459/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 110 places, 98 transitions and 276 arcs
pnml2lts-sym: Petri net DoubleExponent-PT-002 analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.000 real 0.010 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: 98->98 groups
pnml2lts-sym: Regrouping took 0.010 real 0.010 user 0.000 sys
pnml2lts-sym: state vector length is 110; there are 98 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/459/inv_15_) found at depth 0!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/459/inv_11_) found at depth 0!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/459/inv_14_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/459/inv_13_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/459/inv_12_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym: Exploration took 8177 group checks and 0 next state calls
pnml2lts-sym: reachability took 0.060 real 0.250 user 0.000 sys
pnml2lts-sym: counting visited states...
pnml2lts-sym: counting took 0.000 real 0.010 user 0.000 sys
pnml2lts-sym: state space has 3708 states, 4575 nodes
pnml2lts-sym: group_next: 894 nodes total
pnml2lts-sym: group_explored: 978 nodes, 786 short vectors total
pnml2lts-sym: max token count: 16

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-002"
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-002, 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-167819418500454"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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