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

About the Execution of LTSMin+red for BusinessProcesses-PT-07

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
2318.504 3584972.00 14303571.00 117.90 TTTTTFTFFFFFFTTT normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r041-tajo-167813694800502.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is BusinessProcesses-PT-07, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r041-tajo-167813694800502
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 8.4K Feb 25 16:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K Feb 25 16:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K Feb 25 16:42 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K Feb 25 16:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:38 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:38 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:38 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.9K Feb 25 16:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 106K Feb 25 16:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Feb 25 16:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 25 16:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:38 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:38 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 100K 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 BusinessProcesses-PT-07-ReachabilityCardinality-00
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityCardinality-01
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityCardinality-02
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityCardinality-03
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityCardinality-04
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityCardinality-05
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityCardinality-06
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityCardinality-07
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityCardinality-08
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityCardinality-09
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityCardinality-10
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityCardinality-11
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityCardinality-12
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityCardinality-13
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityCardinality-14
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678640563948

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=BusinessProcesses-PT-07
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 17:02:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-12 17:02:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 17:02:46] [INFO ] Load time of PNML (sax parser for PT used): 71 ms
[2023-03-12 17:02:46] [INFO ] Transformed 386 places.
[2023-03-12 17:02:46] [INFO ] Transformed 360 transitions.
[2023-03-12 17:02:46] [INFO ] Found NUPN structural information;
[2023-03-12 17:02:46] [INFO ] Parsed PT model containing 386 places and 360 transitions and 1110 arcs in 156 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
FORMULA BusinessProcesses-PT-07-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-07-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 106 resets, run finished after 473 ms. (steps per millisecond=21 ) properties (out of 14) seen :8
FORMULA BusinessProcesses-PT-07-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-07-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-07-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-07-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-07-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-07-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-07-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-07-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 18 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 360 rows 386 cols
[2023-03-12 17:02:47] [INFO ] Computed 62 place invariants in 18 ms
[2023-03-12 17:02:47] [INFO ] After 315ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-12 17:02:48] [INFO ] [Nat]Absence check using 33 positive place invariants in 14 ms returned sat
[2023-03-12 17:02:48] [INFO ] [Nat]Absence check using 33 positive and 29 generalized place invariants in 12 ms returned sat
[2023-03-12 17:02:48] [INFO ] After 323ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :5
[2023-03-12 17:02:48] [INFO ] Deduced a trap composed of 11 places in 222 ms of which 8 ms to minimize.
[2023-03-12 17:02:48] [INFO ] Deduced a trap composed of 92 places in 134 ms of which 1 ms to minimize.
[2023-03-12 17:02:49] [INFO ] Deduced a trap composed of 19 places in 146 ms of which 1 ms to minimize.
[2023-03-12 17:02:49] [INFO ] Deduced a trap composed of 20 places in 156 ms of which 1 ms to minimize.
[2023-03-12 17:02:49] [INFO ] Deduced a trap composed of 8 places in 145 ms of which 1 ms to minimize.
[2023-03-12 17:02:49] [INFO ] Deduced a trap composed of 8 places in 113 ms of which 0 ms to minimize.
[2023-03-12 17:02:49] [INFO ] Deduced a trap composed of 24 places in 132 ms of which 0 ms to minimize.
[2023-03-12 17:02:49] [INFO ] Deduced a trap composed of 14 places in 106 ms of which 2 ms to minimize.
[2023-03-12 17:02:49] [INFO ] Deduced a trap composed of 99 places in 99 ms of which 0 ms to minimize.
[2023-03-12 17:02:50] [INFO ] Deduced a trap composed of 16 places in 148 ms of which 0 ms to minimize.
[2023-03-12 17:02:50] [INFO ] Deduced a trap composed of 109 places in 131 ms of which 1 ms to minimize.
[2023-03-12 17:02:50] [INFO ] Deduced a trap composed of 91 places in 136 ms of which 0 ms to minimize.
[2023-03-12 17:02:50] [INFO ] Deduced a trap composed of 23 places in 139 ms of which 0 ms to minimize.
[2023-03-12 17:02:50] [INFO ] Deduced a trap composed of 25 places in 104 ms of which 1 ms to minimize.
[2023-03-12 17:02:51] [INFO ] Deduced a trap composed of 21 places in 102 ms of which 0 ms to minimize.
[2023-03-12 17:02:51] [INFO ] Deduced a trap composed of 100 places in 119 ms of which 1 ms to minimize.
[2023-03-12 17:02:51] [INFO ] Deduced a trap composed of 109 places in 168 ms of which 1 ms to minimize.
[2023-03-12 17:02:51] [INFO ] Deduced a trap composed of 111 places in 194 ms of which 1 ms to minimize.
[2023-03-12 17:02:51] [INFO ] Deduced a trap composed of 109 places in 170 ms of which 1 ms to minimize.
[2023-03-12 17:02:52] [INFO ] Deduced a trap composed of 118 places in 230 ms of which 1 ms to minimize.
[2023-03-12 17:02:52] [INFO ] Deduced a trap composed of 88 places in 236 ms of which 1 ms to minimize.
[2023-03-12 17:02:52] [INFO ] Deduced a trap composed of 105 places in 184 ms of which 1 ms to minimize.
[2023-03-12 17:02:52] [INFO ] Deduced a trap composed of 14 places in 181 ms of which 1 ms to minimize.
[2023-03-12 17:02:53] [INFO ] Deduced a trap composed of 99 places in 239 ms of which 1 ms to minimize.
[2023-03-12 17:02:53] [INFO ] Deduced a trap composed of 35 places in 234 ms of which 1 ms to minimize.
[2023-03-12 17:02:53] [INFO ] Deduced a trap composed of 23 places in 228 ms of which 3 ms to minimize.
[2023-03-12 17:02:54] [INFO ] Deduced a trap composed of 60 places in 209 ms of which 1 ms to minimize.
[2023-03-12 17:02:54] [INFO ] Deduced a trap composed of 103 places in 210 ms of which 1 ms to minimize.
[2023-03-12 17:02:54] [INFO ] Deduced a trap composed of 88 places in 232 ms of which 1 ms to minimize.
[2023-03-12 17:02:54] [INFO ] Deduced a trap composed of 25 places in 185 ms of which 0 ms to minimize.
[2023-03-12 17:02:55] [INFO ] Deduced a trap composed of 26 places in 163 ms of which 0 ms to minimize.
[2023-03-12 17:02:55] [INFO ] Deduced a trap composed of 102 places in 141 ms of which 1 ms to minimize.
[2023-03-12 17:02:55] [INFO ] Deduced a trap composed of 26 places in 126 ms of which 0 ms to minimize.
[2023-03-12 17:02:55] [INFO ] Trap strengthening (SAT) tested/added 34/33 trap constraints in 7100 ms
[2023-03-12 17:02:55] [INFO ] Deduced a trap composed of 82 places in 164 ms of which 2 ms to minimize.
[2023-03-12 17:02:56] [INFO ] Deduced a trap composed of 104 places in 125 ms of which 1 ms to minimize.
[2023-03-12 17:02:56] [INFO ] Deduced a trap composed of 86 places in 107 ms of which 1 ms to minimize.
[2023-03-12 17:02:56] [INFO ] Deduced a trap composed of 99 places in 151 ms of which 1 ms to minimize.
[2023-03-12 17:02:56] [INFO ] Deduced a trap composed of 20 places in 124 ms of which 0 ms to minimize.
[2023-03-12 17:02:56] [INFO ] Deduced a trap composed of 100 places in 113 ms of which 0 ms to minimize.
[2023-03-12 17:02:56] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 964 ms
[2023-03-12 17:02:56] [INFO ] After 8670ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :4
Attempting to minimize the solution found.
Minimization took 276 ms.
[2023-03-12 17:02:57] [INFO ] After 9181ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :4
FORMULA BusinessProcesses-PT-07-ReachabilityCardinality-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-07-ReachabilityCardinality-05 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 49 ms.
Support contains 53 out of 386 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 386/386 places, 360/360 transitions.
Graph (trivial) has 164 edges and 386 vertex of which 7 / 386 are part of one of the 1 SCC in 6 ms
Free SCC test removed 6 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 805 edges and 380 vertex of which 378 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 47 rules applied. Total rules applied 49 place count 378 transition count 304
Reduce places removed 47 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 55 rules applied. Total rules applied 104 place count 331 transition count 296
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 112 place count 323 transition count 296
Performed 57 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 57 Pre rules applied. Total rules applied 112 place count 323 transition count 239
Deduced a syphon composed of 57 places in 3 ms
Ensure Unique test removed 5 places
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 3 with 119 rules applied. Total rules applied 231 place count 261 transition count 239
Discarding 32 places :
Symmetric choice reduction at 3 with 32 rule applications. Total rules 263 place count 229 transition count 207
Iterating global reduction 3 with 32 rules applied. Total rules applied 295 place count 229 transition count 207
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 295 place count 229 transition count 204
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 301 place count 226 transition count 204
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: 43
Deduced a syphon composed of 43 places in 0 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 3 with 86 rules applied. Total rules applied 387 place count 183 transition count 161
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 389 place count 183 transition count 159
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 391 place count 181 transition count 159
Applied a total of 391 rules in 127 ms. Remains 181 /386 variables (removed 205) and now considering 159/360 (removed 201) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 128 ms. Remains : 181/386 places, 159/360 transitions.
Incomplete random walk after 10000 steps, including 182 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 4) seen :3
FORMULA BusinessProcesses-PT-07-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-07-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-07-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Finished Best-First random walk after 3033 steps, including 14 resets, run visited all 1 properties in 9 ms. (steps per millisecond=337 )
FORMULA BusinessProcesses-PT-07-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
All properties solved without resorting to model-checking.
Total runtime 11032 ms.
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --invariant=/tmp/587/inv_0_ --invariant=/tmp/587/inv_1_ --invariant=/tmp/587/inv_2_ --invariant=/tmp/587/inv_3_ --invariant=/tmp/587/inv_4_ --invariant=/tmp/587/inv_5_ --invariant=/tmp/587/inv_6_ --invariant=/tmp/587/inv_7_ --invariant=/tmp/587/inv_8_ --invariant=/tmp/587/inv_9_ --invariant=/tmp/587/inv_10_ --invariant=/tmp/587/inv_11_ --invariant=/tmp/587/inv_12_ --invariant=/tmp/587/inv_13_ --invariant=/tmp/587/inv_14_ --invariant=/tmp/587/inv_15_ --inv-par
TIME LIMIT: Killed by timeout after 3570 seconds
MemTotal: 16393340 kB
MemFree: 13829312 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16098252 kB
Could not compute solution for formula : BusinessProcesses-PT-07-ReachabilityCardinality-00
Could not compute solution for formula : BusinessProcesses-PT-07-ReachabilityCardinality-01
Could not compute solution for formula : BusinessProcesses-PT-07-ReachabilityCardinality-02
Could not compute solution for formula : BusinessProcesses-PT-07-ReachabilityCardinality-03
Could not compute solution for formula : BusinessProcesses-PT-07-ReachabilityCardinality-04
Could not compute solution for formula : BusinessProcesses-PT-07-ReachabilityCardinality-05
Could not compute solution for formula : BusinessProcesses-PT-07-ReachabilityCardinality-06
Could not compute solution for formula : BusinessProcesses-PT-07-ReachabilityCardinality-07
Could not compute solution for formula : BusinessProcesses-PT-07-ReachabilityCardinality-08
Could not compute solution for formula : BusinessProcesses-PT-07-ReachabilityCardinality-09
Could not compute solution for formula : BusinessProcesses-PT-07-ReachabilityCardinality-10
Could not compute solution for formula : BusinessProcesses-PT-07-ReachabilityCardinality-11
Could not compute solution for formula : BusinessProcesses-PT-07-ReachabilityCardinality-12
Could not compute solution for formula : BusinessProcesses-PT-07-ReachabilityCardinality-13
Could not compute solution for formula : BusinessProcesses-PT-07-ReachabilityCardinality-14
Could not compute solution for formula : BusinessProcesses-PT-07-ReachabilityCardinality-15

BK_STOP 1678644148920

--------------------
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 BusinessProcesses-PT-07-ReachabilityCardinality-00
rfs formula type EF
rfs formula formula --invariant=/tmp/587/inv_0_
rfs formula name BusinessProcesses-PT-07-ReachabilityCardinality-01
rfs formula type AG
rfs formula formula --invariant=/tmp/587/inv_1_
rfs formula name BusinessProcesses-PT-07-ReachabilityCardinality-02
rfs formula type EF
rfs formula formula --invariant=/tmp/587/inv_2_
rfs formula name BusinessProcesses-PT-07-ReachabilityCardinality-03
rfs formula type EF
rfs formula formula --invariant=/tmp/587/inv_3_
rfs formula name BusinessProcesses-PT-07-ReachabilityCardinality-04
rfs formula type EF
rfs formula formula --invariant=/tmp/587/inv_4_
rfs formula name BusinessProcesses-PT-07-ReachabilityCardinality-05
rfs formula type EF
rfs formula formula --invariant=/tmp/587/inv_5_
rfs formula name BusinessProcesses-PT-07-ReachabilityCardinality-06
rfs formula type EF
rfs formula formula --invariant=/tmp/587/inv_6_
rfs formula name BusinessProcesses-PT-07-ReachabilityCardinality-07
rfs formula type AG
rfs formula formula --invariant=/tmp/587/inv_7_
rfs formula name BusinessProcesses-PT-07-ReachabilityCardinality-08
rfs formula type AG
rfs formula formula --invariant=/tmp/587/inv_8_
rfs formula name BusinessProcesses-PT-07-ReachabilityCardinality-09
rfs formula type AG
rfs formula formula --invariant=/tmp/587/inv_9_
rfs formula name BusinessProcesses-PT-07-ReachabilityCardinality-10
rfs formula type EF
rfs formula formula --invariant=/tmp/587/inv_10_
rfs formula name BusinessProcesses-PT-07-ReachabilityCardinality-11
rfs formula type AG
rfs formula formula --invariant=/tmp/587/inv_11_
rfs formula name BusinessProcesses-PT-07-ReachabilityCardinality-12
rfs formula type AG
rfs formula formula --invariant=/tmp/587/inv_12_
rfs formula name BusinessProcesses-PT-07-ReachabilityCardinality-13
rfs formula type EF
rfs formula formula --invariant=/tmp/587/inv_13_
rfs formula name BusinessProcesses-PT-07-ReachabilityCardinality-14
rfs formula type EF
rfs formula formula --invariant=/tmp/587/inv_14_
rfs formula name BusinessProcesses-PT-07-ReachabilityCardinality-15
rfs formula type AG
rfs formula formula --invariant=/tmp/587/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 386 places, 360 transitions and 1110 arcs
pnml2lts-sym: Petri net BusinessProcesses-PT-07 analyzed
pnml2lts-sym: There are 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: 360->360 groups
pnml2lts-sym: Regrouping took 0.110 real 0.110 user 0.000 sys
pnml2lts-sym: state vector length is 386; there are 360 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: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
Killing (15) : 593
Killing (9) : 593

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="BusinessProcesses-PT-07"
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 BusinessProcesses-PT-07, 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 r041-tajo-167813694800502"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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