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-167813694700470.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-03, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r041-tajo-167813694700470
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 7.4K Feb 25 16:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 25 16:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 25 16:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 25 16:50 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.6K 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 16K Feb 25 15:38 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 16:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 123K Feb 25 16:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Feb 25 16:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 25 16:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:38 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K 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 63K 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-03-ReachabilityCardinality-00
FORMULA_NAME BusinessProcesses-PT-03-ReachabilityCardinality-01
FORMULA_NAME BusinessProcesses-PT-03-ReachabilityCardinality-02
FORMULA_NAME BusinessProcesses-PT-03-ReachabilityCardinality-03
FORMULA_NAME BusinessProcesses-PT-03-ReachabilityCardinality-04
FORMULA_NAME BusinessProcesses-PT-03-ReachabilityCardinality-05
FORMULA_NAME BusinessProcesses-PT-03-ReachabilityCardinality-06
FORMULA_NAME BusinessProcesses-PT-03-ReachabilityCardinality-07
FORMULA_NAME BusinessProcesses-PT-03-ReachabilityCardinality-08
FORMULA_NAME BusinessProcesses-PT-03-ReachabilityCardinality-09
FORMULA_NAME BusinessProcesses-PT-03-ReachabilityCardinality-10
FORMULA_NAME BusinessProcesses-PT-03-ReachabilityCardinality-11
FORMULA_NAME BusinessProcesses-PT-03-ReachabilityCardinality-12
FORMULA_NAME BusinessProcesses-PT-03-ReachabilityCardinality-13
FORMULA_NAME BusinessProcesses-PT-03-ReachabilityCardinality-14
FORMULA_NAME BusinessProcesses-PT-03-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678639713535

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-03
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 16:48:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-12 16:48:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 16:48:35] [INFO ] Load time of PNML (sax parser for PT used): 46 ms
[2023-03-12 16:48:35] [INFO ] Transformed 274 places.
[2023-03-12 16:48:35] [INFO ] Transformed 237 transitions.
[2023-03-12 16:48:35] [INFO ] Found NUPN structural information;
[2023-03-12 16:48:35] [INFO ] Parsed PT model containing 274 places and 237 transitions and 632 arcs in 108 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 1 transitions.
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 121 resets, run finished after 473 ms. (steps per millisecond=21 ) properties (out of 14) seen :4
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 19 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 25 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 236 rows 273 cols
[2023-03-12 16:48:36] [INFO ] Computed 43 place invariants in 10 ms
[2023-03-12 16:48:36] [INFO ] After 272ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-12 16:48:36] [INFO ] [Nat]Absence check using 31 positive place invariants in 9 ms returned sat
[2023-03-12 16:48:36] [INFO ] [Nat]Absence check using 31 positive and 12 generalized place invariants in 3 ms returned sat
[2023-03-12 16:48:37] [INFO ] After 157ms SMT Verify possible using state equation in natural domain returned unsat :5 sat :5
[2023-03-12 16:48:37] [INFO ] Deduced a trap composed of 8 places in 59 ms of which 3 ms to minimize.
[2023-03-12 16:48:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 80 ms
[2023-03-12 16:48:37] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
[2023-03-12 16:48:37] [INFO ] Deduced a trap composed of 70 places in 58 ms of which 2 ms to minimize.
[2023-03-12 16:48:37] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 2 ms to minimize.
[2023-03-12 16:48:37] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2023-03-12 16:48:37] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
[2023-03-12 16:48:37] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 0 ms to minimize.
[2023-03-12 16:48:37] [INFO ] Deduced a trap composed of 68 places in 51 ms of which 1 ms to minimize.
[2023-03-12 16:48:37] [INFO ] Deduced a trap composed of 32 places in 57 ms of which 0 ms to minimize.
[2023-03-12 16:48:37] [INFO ] Deduced a trap composed of 67 places in 48 ms of which 1 ms to minimize.
[2023-03-12 16:48:37] [INFO ] Deduced a trap composed of 75 places in 48 ms of which 1 ms to minimize.
[2023-03-12 16:48:37] [INFO ] Deduced a trap composed of 77 places in 47 ms of which 0 ms to minimize.
[2023-03-12 16:48:37] [INFO ] Deduced a trap composed of 72 places in 66 ms of which 0 ms to minimize.
[2023-03-12 16:48:37] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 724 ms
[2023-03-12 16:48:38] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 0 ms to minimize.
[2023-03-12 16:48:38] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 0 ms to minimize.
[2023-03-12 16:48:38] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 1 ms to minimize.
[2023-03-12 16:48:38] [INFO ] Deduced a trap composed of 69 places in 59 ms of which 0 ms to minimize.
[2023-03-12 16:48:38] [INFO ] Deduced a trap composed of 20 places in 83 ms of which 1 ms to minimize.
[2023-03-12 16:48:38] [INFO ] Deduced a trap composed of 24 places in 79 ms of which 0 ms to minimize.
[2023-03-12 16:48:38] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 0 ms to minimize.
[2023-03-12 16:48:38] [INFO ] Deduced a trap composed of 34 places in 58 ms of which 1 ms to minimize.
[2023-03-12 16:48:38] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 0 ms to minimize.
[2023-03-12 16:48:38] [INFO ] Deduced a trap composed of 36 places in 54 ms of which 0 ms to minimize.
[2023-03-12 16:48:38] [INFO ] Deduced a trap composed of 26 places in 67 ms of which 0 ms to minimize.
[2023-03-12 16:48:38] [INFO ] Deduced a trap composed of 35 places in 47 ms of which 0 ms to minimize.
[2023-03-12 16:48:38] [INFO ] Deduced a trap composed of 73 places in 62 ms of which 0 ms to minimize.
[2023-03-12 16:48:38] [INFO ] Deduced a trap composed of 37 places in 56 ms of which 0 ms to minimize.
[2023-03-12 16:48:39] [INFO ] Deduced a trap composed of 27 places in 57 ms of which 0 ms to minimize.
[2023-03-12 16:48:39] [INFO ] Deduced a trap composed of 69 places in 88 ms of which 1 ms to minimize.
[2023-03-12 16:48:39] [INFO ] Deduced a trap composed of 42 places in 67 ms of which 1 ms to minimize.
[2023-03-12 16:48:39] [INFO ] Deduced a trap composed of 74 places in 73 ms of which 1 ms to minimize.
[2023-03-12 16:48:39] [INFO ] Deduced a trap composed of 71 places in 57 ms of which 0 ms to minimize.
[2023-03-12 16:48:39] [INFO ] Deduced a trap composed of 73 places in 58 ms of which 0 ms to minimize.
[2023-03-12 16:48:39] [INFO ] Deduced a trap composed of 30 places in 61 ms of which 1 ms to minimize.
[2023-03-12 16:48:39] [INFO ] Deduced a trap composed of 29 places in 67 ms of which 4 ms to minimize.
[2023-03-12 16:48:39] [INFO ] Deduced a trap composed of 27 places in 61 ms of which 1 ms to minimize.
[2023-03-12 16:48:39] [INFO ] Deduced a trap composed of 44 places in 59 ms of which 0 ms to minimize.
[2023-03-12 16:48:39] [INFO ] Deduced a trap composed of 38 places in 58 ms of which 1 ms to minimize.
[2023-03-12 16:48:39] [INFO ] Deduced a trap composed of 71 places in 67 ms of which 1 ms to minimize.
[2023-03-12 16:48:39] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 1 ms to minimize.
[2023-03-12 16:48:40] [INFO ] Deduced a trap composed of 40 places in 60 ms of which 0 ms to minimize.
[2023-03-12 16:48:40] [INFO ] Deduced a trap composed of 32 places in 57 ms of which 1 ms to minimize.
[2023-03-12 16:48:40] [INFO ] Deduced a trap composed of 71 places in 55 ms of which 0 ms to minimize.
[2023-03-12 16:48:40] [INFO ] Trap strengthening (SAT) tested/added 31/30 trap constraints in 2221 ms
[2023-03-12 16:48:40] [INFO ] After 3280ms SMT Verify possible using trap constraints in natural domain returned unsat :6 sat :4
Attempting to minimize the solution found.
Minimization took 78 ms.
[2023-03-12 16:48:40] [INFO ] After 3527ms SMT Verify possible using all constraints in natural domain returned unsat :6 sat :4
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-09 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-07 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-06 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-03 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 10 Parikh solutions to 4 different solutions.
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 3 properties in 14 ms.
Support contains 12 out of 273 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 273/273 places, 236/236 transitions.
Graph (trivial) has 158 edges and 273 vertex of which 7 / 273 are part of one of the 1 SCC in 3 ms
Free SCC test removed 6 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 514 edges and 267 vertex of which 266 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 57 rules applied. Total rules applied 59 place count 266 transition count 171
Reduce places removed 56 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 59 rules applied. Total rules applied 118 place count 210 transition count 168
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 121 place count 207 transition count 168
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 36 Pre rules applied. Total rules applied 121 place count 207 transition count 132
Deduced a syphon composed of 36 places in 1 ms
Ensure Unique test removed 10 places
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 3 with 82 rules applied. Total rules applied 203 place count 161 transition count 132
Discarding 36 places :
Symmetric choice reduction at 3 with 36 rule applications. Total rules 239 place count 125 transition count 96
Iterating global reduction 3 with 36 rules applied. Total rules applied 275 place count 125 transition count 96
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 275 place count 125 transition count 95
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 277 place count 124 transition count 95
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 44
Deduced a syphon composed of 44 places in 1 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 365 place count 80 transition count 51
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 366 place count 79 transition count 50
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 367 place count 78 transition count 50
Applied a total of 367 rules in 47 ms. Remains 78 /273 variables (removed 195) and now considering 50/236 (removed 186) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 78/273 places, 50/236 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Finished Best-First random walk after 88 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=88 )
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
All properties solved without resorting to model-checking.
Total runtime 5337 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
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-00 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-01 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-02 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-03 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-04 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-05 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-06 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-07 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-08 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-09 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-10 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-11 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-12 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-13 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-14 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-15 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN

BK_STOP 1678639726133

--------------------
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-03-ReachabilityCardinality-00
rfs formula type AG
rfs formula formula --invariant=/tmp/587/inv_0_
rfs formula name BusinessProcesses-PT-03-ReachabilityCardinality-01
rfs formula type EF
rfs formula formula --invariant=/tmp/587/inv_1_
rfs formula name BusinessProcesses-PT-03-ReachabilityCardinality-02
rfs formula type EF
rfs formula formula --invariant=/tmp/587/inv_2_
rfs formula name BusinessProcesses-PT-03-ReachabilityCardinality-03
rfs formula type AG
rfs formula formula --invariant=/tmp/587/inv_3_
rfs formula name BusinessProcesses-PT-03-ReachabilityCardinality-04
rfs formula type AG
rfs formula formula --invariant=/tmp/587/inv_4_
rfs formula name BusinessProcesses-PT-03-ReachabilityCardinality-05
rfs formula type EF
rfs formula formula --invariant=/tmp/587/inv_5_
rfs formula name BusinessProcesses-PT-03-ReachabilityCardinality-06
rfs formula type AG
rfs formula formula --invariant=/tmp/587/inv_6_
rfs formula name BusinessProcesses-PT-03-ReachabilityCardinality-07
rfs formula type EF
rfs formula formula --invariant=/tmp/587/inv_7_
rfs formula name BusinessProcesses-PT-03-ReachabilityCardinality-08
rfs formula type AG
rfs formula formula --invariant=/tmp/587/inv_8_
rfs formula name BusinessProcesses-PT-03-ReachabilityCardinality-09
rfs formula type AG
rfs formula formula --invariant=/tmp/587/inv_9_
rfs formula name BusinessProcesses-PT-03-ReachabilityCardinality-10
rfs formula type AG
rfs formula formula --invariant=/tmp/587/inv_10_
rfs formula name BusinessProcesses-PT-03-ReachabilityCardinality-11
rfs formula type EF
rfs formula formula --invariant=/tmp/587/inv_11_
rfs formula name BusinessProcesses-PT-03-ReachabilityCardinality-12
rfs formula type AG
rfs formula formula --invariant=/tmp/587/inv_12_
rfs formula name BusinessProcesses-PT-03-ReachabilityCardinality-13
rfs formula type AG
rfs formula formula --invariant=/tmp/587/inv_13_
rfs formula name BusinessProcesses-PT-03-ReachabilityCardinality-14
rfs formula type AG
rfs formula formula --invariant=/tmp/587/inv_14_
rfs formula name BusinessProcesses-PT-03-ReachabilityCardinality-15
rfs formula type EF
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 274 places, 237 transitions and 632 arcs
pnml2lts-sym: Petri net BusinessProcesses-PT-03 analyzed
pnml2lts-sym: There are safe places
pnml2lts-sym: Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-sym: Initializing regrouping layer
pnml2lts-sym: Regroup specification: bs,w2W,ru,hf
pnml2lts-sym: Regroup Boost's Sloan
pnml2lts-sym: Regroup over-approximate must-write to may-write
pnml2lts-sym: Regroup Row sUbsume
pnml2lts-sym: Reqroup Horizontal Flip
pnml2lts-sym: Regrouping: 237->237 groups
pnml2lts-sym: Regrouping took 0.030 real 0.030 user 0.010 sys
pnml2lts-sym: state vector length is 274; there are 237 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/587/inv_0_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/587/inv_15_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/587/inv_4_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/587/inv_8_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/587/inv_10_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/587/inv_5_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/587/inv_12_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/587/inv_11_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: Exploration took 192681 group checks and 0 next state calls
pnml2lts-sym: reachability took 5.120 real 20.210 user 0.160 sys
pnml2lts-sym: counting visited states...
pnml2lts-sym: counting took 0.050 real 0.200 user 0.000 sys
pnml2lts-sym: state space has 14794040839043 states, 178490 nodes
pnml2lts-sym: group_next: 1166 nodes total
pnml2lts-sym: group_explored: 609 nodes, 653 short vectors total
pnml2lts-sym: max token count: 1

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

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