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

About the Execution of LTSMin+red for HirschbergSinclair-PT-15

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
347.804 14189.00 25922.00 532.20 TTFTFTTTTTTTFFFT 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.r201-smll-167840347800447.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 HirschbergSinclair-PT-15, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r201-smll-167840347800447
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 616K
-rw-r--r-- 1 mcc users 9.1K Feb 26 02:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Feb 26 02:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 10K Feb 26 02:13 CTLFireability.txt
-rw-r--r-- 1 mcc users 68K Feb 26 02:13 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.6K Feb 25 16:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Feb 25 16:15 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 02:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 103K Feb 26 02:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Feb 26 02:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 26 02:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 16:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K Feb 25 16:15 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 173K 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 HirschbergSinclair-PT-15-ReachabilityFireability-00
FORMULA_NAME HirschbergSinclair-PT-15-ReachabilityFireability-01
FORMULA_NAME HirschbergSinclair-PT-15-ReachabilityFireability-02
FORMULA_NAME HirschbergSinclair-PT-15-ReachabilityFireability-03
FORMULA_NAME HirschbergSinclair-PT-15-ReachabilityFireability-04
FORMULA_NAME HirschbergSinclair-PT-15-ReachabilityFireability-05
FORMULA_NAME HirschbergSinclair-PT-15-ReachabilityFireability-06
FORMULA_NAME HirschbergSinclair-PT-15-ReachabilityFireability-07
FORMULA_NAME HirschbergSinclair-PT-15-ReachabilityFireability-08
FORMULA_NAME HirschbergSinclair-PT-15-ReachabilityFireability-09
FORMULA_NAME HirschbergSinclair-PT-15-ReachabilityFireability-10
FORMULA_NAME HirschbergSinclair-PT-15-ReachabilityFireability-11
FORMULA_NAME HirschbergSinclair-PT-15-ReachabilityFireability-12
FORMULA_NAME HirschbergSinclair-PT-15-ReachabilityFireability-13
FORMULA_NAME HirschbergSinclair-PT-15-ReachabilityFireability-14
FORMULA_NAME HirschbergSinclair-PT-15-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678707619247

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=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HirschbergSinclair-PT-15
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-13 11:40:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-13 11:40:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 11:40:22] [INFO ] Load time of PNML (sax parser for PT used): 89 ms
[2023-03-13 11:40:22] [INFO ] Transformed 330 places.
[2023-03-13 11:40:22] [INFO ] Transformed 296 transitions.
[2023-03-13 11:40:22] [INFO ] Parsed PT model containing 330 places and 296 transitions and 906 arcs in 212 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 34 resets, run finished after 580 ms. (steps per millisecond=17 ) properties (out of 16) seen :12
FORMULA HirschbergSinclair-PT-15-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-15-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-15-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-15-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-15-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-15-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-15-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-15-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-15-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-15-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-15-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-15-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 4) seen :1
FORMULA HirschbergSinclair-PT-15-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 4 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 296 rows 330 cols
[2023-03-13 11:40:23] [INFO ] Computed 34 place invariants in 29 ms
[2023-03-13 11:40:23] [INFO ] [Real]Absence check using 30 positive place invariants in 23 ms returned sat
[2023-03-13 11:40:23] [INFO ] [Real]Absence check using 30 positive and 4 generalized place invariants in 2 ms returned sat
[2023-03-13 11:40:23] [INFO ] After 412ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:2
[2023-03-13 11:40:24] [INFO ] [Nat]Absence check using 30 positive place invariants in 21 ms returned sat
[2023-03-13 11:40:24] [INFO ] [Nat]Absence check using 30 positive and 4 generalized place invariants in 3 ms returned sat
[2023-03-13 11:40:24] [INFO ] After 369ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2023-03-13 11:40:24] [INFO ] Deduced a trap composed of 36 places in 178 ms of which 8 ms to minimize.
[2023-03-13 11:40:24] [INFO ] Deduced a trap composed of 17 places in 148 ms of which 1 ms to minimize.
[2023-03-13 11:40:25] [INFO ] Deduced a trap composed of 15 places in 128 ms of which 2 ms to minimize.
[2023-03-13 11:40:25] [INFO ] Deduced a trap composed of 31 places in 146 ms of which 2 ms to minimize.
[2023-03-13 11:40:25] [INFO ] Deduced a trap composed of 51 places in 130 ms of which 0 ms to minimize.
[2023-03-13 11:40:25] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 914 ms
[2023-03-13 11:40:25] [INFO ] After 1490ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 174 ms.
[2023-03-13 11:40:25] [INFO ] After 1869ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
FORMULA HirschbergSinclair-PT-15-ReachabilityFireability-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 25 ms.
Support contains 31 out of 330 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 330/330 places, 296/296 transitions.
Graph (complete) has 628 edges and 330 vertex of which 312 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.2 ms
Discarding 18 places :
Also discarding 0 output transitions
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 67 transitions
Trivial Post-agglo rules discarded 67 transitions
Performed 67 trivial Post agglomeration. Transition count delta: 67
Iterating post reduction 0 with 70 rules applied. Total rules applied 71 place count 312 transition count 226
Reduce places removed 67 places and 0 transitions.
Graph (complete) has 430 edges and 245 vertex of which 228 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.1 ms
Discarding 17 places :
Also discarding 0 output transitions
Iterating post reduction 1 with 68 rules applied. Total rules applied 139 place count 228 transition count 226
Drop transitions removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 2 with 17 rules applied. Total rules applied 156 place count 228 transition count 209
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 163 place count 221 transition count 202
Iterating global reduction 3 with 7 rules applied. Total rules applied 170 place count 221 transition count 202
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 173 place count 218 transition count 199
Iterating global reduction 3 with 3 rules applied. Total rules applied 176 place count 218 transition count 199
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 3 with 9 rules applied. Total rules applied 185 place count 218 transition count 190
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 194 place count 209 transition count 190
Reduce places removed 7 places and 7 transitions.
Iterating global reduction 4 with 7 rules applied. Total rules applied 201 place count 202 transition count 183
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 202 place count 201 transition count 183
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 8 Pre rules applied. Total rules applied 202 place count 201 transition count 175
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 218 place count 193 transition count 175
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 220 place count 192 transition count 174
Applied a total of 220 rules in 148 ms. Remains 192 /330 variables (removed 138) and now considering 174/296 (removed 122) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 149 ms. Remains : 192/330 places, 174/296 transitions.
Incomplete random walk after 10000 steps, including 54 resets, run finished after 213 ms. (steps per millisecond=46 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 581342 steps, run timeout after 3001 ms. (steps per millisecond=193 ) properties seen :{}
Probabilistic random walk after 581342 steps, saw 123464 distinct states, run finished after 3002 ms. (steps per millisecond=193 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 174 rows 192 cols
[2023-03-13 11:40:29] [INFO ] Computed 18 place invariants in 2 ms
[2023-03-13 11:40:29] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-13 11:40:29] [INFO ] [Real]Absence check using 2 positive and 16 generalized place invariants in 26 ms returned sat
[2023-03-13 11:40:29] [INFO ] After 206ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-13 11:40:29] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-13 11:40:29] [INFO ] [Nat]Absence check using 2 positive and 16 generalized place invariants in 29 ms returned sat
[2023-03-13 11:40:29] [INFO ] After 156ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-13 11:40:29] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-13 11:40:29] [INFO ] After 76ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-13 11:40:29] [INFO ] After 196ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 80 ms.
[2023-03-13 11:40:29] [INFO ] After 538ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 9 ms.
Support contains 31 out of 192 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 192/192 places, 174/174 transitions.
Applied a total of 0 rules in 10 ms. Remains 192 /192 variables (removed 0) and now considering 174/174 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 192/192 places, 174/174 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 192/192 places, 174/174 transitions.
Applied a total of 0 rules in 9 ms. Remains 192 /192 variables (removed 0) and now considering 174/174 (removed 0) transitions.
[2023-03-13 11:40:30] [INFO ] Invariant cache hit.
[2023-03-13 11:40:30] [INFO ] Implicit Places using invariants in 137 ms returned []
[2023-03-13 11:40:30] [INFO ] Invariant cache hit.
[2023-03-13 11:40:30] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-13 11:40:30] [INFO ] Implicit Places using invariants and state equation in 448 ms returned []
Implicit Place search using SMT with State Equation took 586 ms to find 0 implicit places.
[2023-03-13 11:40:30] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-13 11:40:30] [INFO ] Invariant cache hit.
[2023-03-13 11:40:30] [INFO ] Dead Transitions using invariants and state equation in 170 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 778 ms. Remains : 192/192 places, 174/174 transitions.
Ensure Unique test removed 1 places
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 191 transition count 161
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 27 place count 178 transition count 161
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 27 place count 178 transition count 136
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 77 place count 153 transition count 136
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 78 place count 152 transition count 136
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 78 place count 152 transition count 135
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 80 place count 151 transition count 135
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 84 place count 149 transition count 133
Applied a total of 84 rules in 29 ms. Remains 149 /192 variables (removed 43) and now considering 133/174 (removed 41) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 133 rows 149 cols
[2023-03-13 11:40:30] [INFO ] Computed 16 place invariants in 2 ms
[2023-03-13 11:40:30] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-13 11:40:30] [INFO ] [Real]Absence check using 2 positive and 14 generalized place invariants in 19 ms returned sat
[2023-03-13 11:40:30] [INFO ] After 81ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-13 11:40:30] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-13 11:40:30] [INFO ] [Nat]Absence check using 2 positive and 14 generalized place invariants in 17 ms returned sat
[2023-03-13 11:40:31] [INFO ] After 121ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-13 11:40:31] [INFO ] After 189ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 60 ms.
[2023-03-13 11:40:31] [INFO ] After 327ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-03-13 11:40:31] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 4 ms.
[2023-03-13 11:40:31] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 192 places, 174 transitions and 565 arcs took 5 ms.
[2023-03-13 11:40:31] [INFO ] Flatten gal took : 64 ms
Total runtime 9528 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --inv-bin-par --invariant=/tmp/506/inv_0_ --invariant=/tmp/506/inv_1_ --inv-par
FORMULA HirschbergSinclair-PT-15-ReachabilityFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA HirschbergSinclair-PT-15-ReachabilityFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN

BK_STOP 1678707633436

--------------------
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 ReachabilityFireability -timeout 360 -rebuildPNML
mcc2023
rfs formula name HirschbergSinclair-PT-15-ReachabilityFireability-04
rfs formula type AG
rfs formula formula --invariant=/tmp/506/inv_0_
rfs formula name HirschbergSinclair-PT-15-ReachabilityFireability-12
rfs formula type AG
rfs formula formula --invariant=/tmp/506/inv_1_
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 192 places, 174 transitions and 565 arcs
pnml2lts-sym: Petri net leader analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.010 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: 174->163 groups
pnml2lts-sym: Regrouping took 0.030 real 0.030 user 0.000 sys
pnml2lts-sym: state vector length is 192; there are 163 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/506/inv_0_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/506/inv_1_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym: all invariants violated
pnml2lts-sym: exiting now
pnml2lts-sym: invariant detection took 0.610 real 2.430 user 0.000 sys
pnml2lts-sym: max token count: 2

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="HirschbergSinclair-PT-15"
export BK_EXAMINATION="ReachabilityFireability"
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 HirschbergSinclair-PT-15, examination is ReachabilityFireability"
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-167840347800447"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/HirschbergSinclair-PT-15.tgz
mv HirschbergSinclair-PT-15 execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;