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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 528K
-rw-r--r-- 1 mcc users 6.4K Feb 25 16:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Feb 25 16:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 25 16:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 25 16:48 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.7K Feb 25 15:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.5K Feb 25 16:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 70K Feb 25 16:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Feb 25 16:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 25 16:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:39 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 146K 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-12-ReachabilityCardinality-00
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-01
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-02
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-03
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-04
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-05
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-06
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-07
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-08
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-09
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-10
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-11
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-12
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-13
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-14
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678644166446

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-12
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 18:02:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-12 18:02:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 18:02:48] [INFO ] Load time of PNML (sax parser for PT used): 79 ms
[2023-03-12 18:02:48] [INFO ] Transformed 586 places.
[2023-03-12 18:02:48] [INFO ] Transformed 525 transitions.
[2023-03-12 18:02:48] [INFO ] Found NUPN structural information;
[2023-03-12 18:02:48] [INFO ] Parsed PT model containing 586 places and 525 transitions and 1560 arcs in 180 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 19 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 4 places in 25 ms
Reduce places removed 4 places and 4 transitions.
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 74 resets, run finished after 446 ms. (steps per millisecond=22 ) properties (out of 13) seen :2
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 14 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 521 rows 582 cols
[2023-03-12 18:02:49] [INFO ] Computed 98 place invariants in 25 ms
[2023-03-12 18:02:49] [INFO ] [Real]Absence check using 55 positive place invariants in 26 ms returned sat
[2023-03-12 18:02:49] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 13 ms returned sat
[2023-03-12 18:02:49] [INFO ] After 429ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-12 18:02:50] [INFO ] [Nat]Absence check using 55 positive place invariants in 17 ms returned sat
[2023-03-12 18:02:50] [INFO ] [Nat]Absence check using 55 positive and 43 generalized place invariants in 11 ms returned sat
[2023-03-12 18:02:50] [INFO ] After 567ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :10
[2023-03-12 18:02:50] [INFO ] Deduced a trap composed of 8 places in 100 ms of which 5 ms to minimize.
[2023-03-12 18:02:51] [INFO ] Deduced a trap composed of 14 places in 96 ms of which 0 ms to minimize.
[2023-03-12 18:02:51] [INFO ] Deduced a trap composed of 23 places in 83 ms of which 1 ms to minimize.
[2023-03-12 18:02:51] [INFO ] Deduced a trap composed of 14 places in 83 ms of which 3 ms to minimize.
[2023-03-12 18:02:51] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 1 ms to minimize.
[2023-03-12 18:02:51] [INFO ] Deduced a trap composed of 16 places in 84 ms of which 0 ms to minimize.
[2023-03-12 18:02:51] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 0 ms to minimize.
[2023-03-12 18:02:51] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 1 ms to minimize.
[2023-03-12 18:02:51] [INFO ] Deduced a trap composed of 22 places in 72 ms of which 0 ms to minimize.
[2023-03-12 18:02:51] [INFO ] Deduced a trap composed of 27 places in 63 ms of which 0 ms to minimize.
[2023-03-12 18:02:51] [INFO ] Deduced a trap composed of 27 places in 64 ms of which 0 ms to minimize.
[2023-03-12 18:02:51] [INFO ] Deduced a trap composed of 29 places in 64 ms of which 0 ms to minimize.
[2023-03-12 18:02:52] [INFO ] Deduced a trap composed of 32 places in 64 ms of which 0 ms to minimize.
[2023-03-12 18:02:52] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 0 ms to minimize.
[2023-03-12 18:02:52] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 1327 ms
[2023-03-12 18:02:52] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 1 ms to minimize.
[2023-03-12 18:02:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 130 ms
[2023-03-12 18:02:52] [INFO ] Deduced a trap composed of 40 places in 80 ms of which 1 ms to minimize.
[2023-03-12 18:02:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 122 ms
[2023-03-12 18:02:52] [INFO ] Deduced a trap composed of 31 places in 67 ms of which 1 ms to minimize.
[2023-03-12 18:02:52] [INFO ] Deduced a trap composed of 131 places in 116 ms of which 1 ms to minimize.
[2023-03-12 18:02:52] [INFO ] Deduced a trap composed of 134 places in 131 ms of which 1 ms to minimize.
[2023-03-12 18:02:53] [INFO ] Deduced a trap composed of 133 places in 121 ms of which 0 ms to minimize.
[2023-03-12 18:02:53] [INFO ] Deduced a trap composed of 27 places in 121 ms of which 0 ms to minimize.
[2023-03-12 18:02:53] [INFO ] Deduced a trap composed of 133 places in 143 ms of which 1 ms to minimize.
[2023-03-12 18:02:53] [INFO ] Deduced a trap composed of 132 places in 136 ms of which 1 ms to minimize.
[2023-03-12 18:02:53] [INFO ] Deduced a trap composed of 133 places in 141 ms of which 1 ms to minimize.
[2023-03-12 18:02:53] [INFO ] Deduced a trap composed of 137 places in 128 ms of which 1 ms to minimize.
[2023-03-12 18:02:54] [INFO ] Deduced a trap composed of 153 places in 108 ms of which 2 ms to minimize.
[2023-03-12 18:02:54] [INFO ] Deduced a trap composed of 137 places in 128 ms of which 1 ms to minimize.
[2023-03-12 18:02:54] [INFO ] Deduced a trap composed of 133 places in 119 ms of which 0 ms to minimize.
[2023-03-12 18:02:54] [INFO ] Deduced a trap composed of 141 places in 126 ms of which 0 ms to minimize.
[2023-03-12 18:02:54] [INFO ] Deduced a trap composed of 135 places in 112 ms of which 0 ms to minimize.
[2023-03-12 18:02:54] [INFO ] Deduced a trap composed of 154 places in 145 ms of which 0 ms to minimize.
[2023-03-12 18:02:54] [INFO ] Deduced a trap composed of 156 places in 112 ms of which 1 ms to minimize.
[2023-03-12 18:02:55] [INFO ] Deduced a trap composed of 145 places in 123 ms of which 1 ms to minimize.
[2023-03-12 18:02:55] [INFO ] Deduced a trap composed of 141 places in 116 ms of which 1 ms to minimize.
[2023-03-12 18:02:55] [INFO ] Deduced a trap composed of 138 places in 124 ms of which 7 ms to minimize.
[2023-03-12 18:02:55] [INFO ] Deduced a trap composed of 128 places in 150 ms of which 0 ms to minimize.
[2023-03-12 18:02:55] [INFO ] Deduced a trap composed of 131 places in 116 ms of which 1 ms to minimize.
[2023-03-12 18:02:55] [INFO ] Deduced a trap composed of 137 places in 106 ms of which 0 ms to minimize.
[2023-03-12 18:02:56] [INFO ] Deduced a trap composed of 140 places in 108 ms of which 0 ms to minimize.
[2023-03-12 18:02:56] [INFO ] Deduced a trap composed of 131 places in 113 ms of which 1 ms to minimize.
[2023-03-12 18:02:56] [INFO ] Deduced a trap composed of 29 places in 117 ms of which 0 ms to minimize.
[2023-03-12 18:02:56] [INFO ] Deduced a trap composed of 144 places in 122 ms of which 0 ms to minimize.
[2023-03-12 18:02:56] [INFO ] Deduced a trap composed of 138 places in 111 ms of which 0 ms to minimize.
[2023-03-12 18:02:56] [INFO ] Deduced a trap composed of 134 places in 100 ms of which 1 ms to minimize.
[2023-03-12 18:02:56] [INFO ] Deduced a trap composed of 133 places in 115 ms of which 1 ms to minimize.
[2023-03-12 18:02:57] [INFO ] Deduced a trap composed of 129 places in 117 ms of which 1 ms to minimize.
[2023-03-12 18:02:57] [INFO ] Deduced a trap composed of 127 places in 110 ms of which 1 ms to minimize.
[2023-03-12 18:02:57] [INFO ] Deduced a trap composed of 133 places in 110 ms of which 2 ms to minimize.
[2023-03-12 18:02:57] [INFO ] Deduced a trap composed of 134 places in 109 ms of which 1 ms to minimize.
[2023-03-12 18:02:57] [INFO ] Deduced a trap composed of 144 places in 109 ms of which 1 ms to minimize.
[2023-03-12 18:02:57] [INFO ] Deduced a trap composed of 127 places in 111 ms of which 1 ms to minimize.
[2023-03-12 18:02:57] [INFO ] Trap strengthening (SAT) tested/added 36/35 trap constraints in 5214 ms
[2023-03-12 18:02:58] [INFO ] Deduced a trap composed of 37 places in 81 ms of which 0 ms to minimize.
[2023-03-12 18:02:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 132 ms
[2023-03-12 18:02:58] [INFO ] After 7950ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :10
Attempting to minimize the solution found.
Minimization took 429 ms.
[2023-03-12 18:02:58] [INFO ] After 8709ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :10
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-05 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 11 Parikh solutions to 10 different solutions.
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 4 properties in 62 ms.
Support contains 28 out of 582 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 582/582 places, 521/521 transitions.
Graph (trivial) has 298 edges and 582 vertex of which 7 / 582 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 1178 edges and 576 vertex of which 572 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Discarding 4 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 107 transitions
Trivial Post-agglo rules discarded 107 transitions
Performed 107 trivial Post agglomeration. Transition count delta: 107
Iterating post reduction 0 with 107 rules applied. Total rules applied 109 place count 572 transition count 405
Reduce places removed 107 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 114 rules applied. Total rules applied 223 place count 465 transition count 398
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 230 place count 458 transition count 398
Performed 84 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 84 Pre rules applied. Total rules applied 230 place count 458 transition count 314
Deduced a syphon composed of 84 places in 1 ms
Ensure Unique test removed 11 places
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 3 with 179 rules applied. Total rules applied 409 place count 363 transition count 314
Discarding 67 places :
Symmetric choice reduction at 3 with 67 rule applications. Total rules 476 place count 296 transition count 247
Iterating global reduction 3 with 67 rules applied. Total rules applied 543 place count 296 transition count 247
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 543 place count 296 transition count 243
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 551 place count 292 transition count 243
Performed 79 Post agglomeration using F-continuation condition.Transition count delta: 79
Deduced a syphon composed of 79 places in 0 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 3 with 158 rules applied. Total rules applied 709 place count 213 transition count 164
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
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 711 place count 212 transition count 168
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 713 place count 212 transition count 166
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 715 place count 210 transition count 166
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 716 place count 210 transition count 166
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 717 place count 209 transition count 165
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 718 place count 208 transition count 165
Applied a total of 718 rules in 136 ms. Remains 208 /582 variables (removed 374) and now considering 165/521 (removed 356) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 137 ms. Remains : 208/582 places, 165/521 transitions.
Finished random walk after 4070 steps, including 81 resets, run visited all 6 properties in 49 ms. (steps per millisecond=83 )
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 10847 ms.
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --invariant=/tmp/625/inv_0_ --invariant=/tmp/625/inv_1_ --invariant=/tmp/625/inv_2_ --invariant=/tmp/625/inv_3_ --invariant=/tmp/625/inv_4_ --invariant=/tmp/625/inv_5_ --invariant=/tmp/625/inv_6_ --invariant=/tmp/625/inv_7_ --invariant=/tmp/625/inv_8_ --invariant=/tmp/625/inv_9_ --invariant=/tmp/625/inv_10_ --invariant=/tmp/625/inv_11_ --invariant=/tmp/625/inv_12_ --invariant=/tmp/625/inv_13_ --invariant=/tmp/625/inv_14_ --invariant=/tmp/625/inv_15_ --inv-par
Could not compute solution for formula : BusinessProcesses-PT-12-ReachabilityCardinality-00
Could not compute solution for formula : BusinessProcesses-PT-12-ReachabilityCardinality-01
Could not compute solution for formula : BusinessProcesses-PT-12-ReachabilityCardinality-02
Could not compute solution for formula : BusinessProcesses-PT-12-ReachabilityCardinality-03
Could not compute solution for formula : BusinessProcesses-PT-12-ReachabilityCardinality-04
Could not compute solution for formula : BusinessProcesses-PT-12-ReachabilityCardinality-05
Could not compute solution for formula : BusinessProcesses-PT-12-ReachabilityCardinality-06
Could not compute solution for formula : BusinessProcesses-PT-12-ReachabilityCardinality-07
Could not compute solution for formula : BusinessProcesses-PT-12-ReachabilityCardinality-08
Could not compute solution for formula : BusinessProcesses-PT-12-ReachabilityCardinality-09
Could not compute solution for formula : BusinessProcesses-PT-12-ReachabilityCardinality-10
Could not compute solution for formula : BusinessProcesses-PT-12-ReachabilityCardinality-11
Could not compute solution for formula : BusinessProcesses-PT-12-ReachabilityCardinality-12
Could not compute solution for formula : BusinessProcesses-PT-12-ReachabilityCardinality-13
Could not compute solution for formula : BusinessProcesses-PT-12-ReachabilityCardinality-14
Could not compute solution for formula : BusinessProcesses-PT-12-ReachabilityCardinality-15

BK_STOP 1678647187371

--------------------
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-12-ReachabilityCardinality-00
rfs formula type EF
rfs formula formula --invariant=/tmp/625/inv_0_
rfs formula name BusinessProcesses-PT-12-ReachabilityCardinality-01
rfs formula type EF
rfs formula formula --invariant=/tmp/625/inv_1_
rfs formula name BusinessProcesses-PT-12-ReachabilityCardinality-02
rfs formula type EF
rfs formula formula --invariant=/tmp/625/inv_2_
rfs formula name BusinessProcesses-PT-12-ReachabilityCardinality-03
rfs formula type EF
rfs formula formula --invariant=/tmp/625/inv_3_
rfs formula name BusinessProcesses-PT-12-ReachabilityCardinality-04
rfs formula type AG
rfs formula formula --invariant=/tmp/625/inv_4_
rfs formula name BusinessProcesses-PT-12-ReachabilityCardinality-05
rfs formula type EF
rfs formula formula --invariant=/tmp/625/inv_5_
rfs formula name BusinessProcesses-PT-12-ReachabilityCardinality-06
rfs formula type AG
rfs formula formula --invariant=/tmp/625/inv_6_
rfs formula name BusinessProcesses-PT-12-ReachabilityCardinality-07
rfs formula type AG
rfs formula formula --invariant=/tmp/625/inv_7_
rfs formula name BusinessProcesses-PT-12-ReachabilityCardinality-08
rfs formula type AG
rfs formula formula --invariant=/tmp/625/inv_8_
rfs formula name BusinessProcesses-PT-12-ReachabilityCardinality-09
rfs formula type EF
rfs formula formula --invariant=/tmp/625/inv_9_
rfs formula name BusinessProcesses-PT-12-ReachabilityCardinality-10
rfs formula type AG
rfs formula formula --invariant=/tmp/625/inv_10_
rfs formula name BusinessProcesses-PT-12-ReachabilityCardinality-11
rfs formula type EF
rfs formula formula --invariant=/tmp/625/inv_11_
rfs formula name BusinessProcesses-PT-12-ReachabilityCardinality-12
rfs formula type AG
rfs formula formula --invariant=/tmp/625/inv_12_
rfs formula name BusinessProcesses-PT-12-ReachabilityCardinality-13
rfs formula type EF
rfs formula formula --invariant=/tmp/625/inv_13_
rfs formula name BusinessProcesses-PT-12-ReachabilityCardinality-14
rfs formula type AG
rfs formula formula --invariant=/tmp/625/inv_14_
rfs formula name BusinessProcesses-PT-12-ReachabilityCardinality-15
rfs formula type AG
rfs formula formula --invariant=/tmp/625/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 586 places, 525 transitions and 1560 arcs
pnml2lts-sym: Petri net BusinessProcesses-PT-12 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: 525->525 groups
pnml2lts-sym: Regrouping took 0.140 real 0.140 user 0.000 sys
pnml2lts-sym: state vector length is 586; there are 525 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
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
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

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

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