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.r425-tajo-167905978300485.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 SieveSingleMsgMbox-PT-d2m64, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r425-tajo-167905978300485
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 6.0K Feb 26 10:30 CTLCardinality.txt
-rw-r--r-- 1 mcc users 57K Feb 26 10:30 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 26 10:29 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 26 10:29 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 17:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 17:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 10:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K Feb 26 10:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Feb 26 10:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 26 10:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 17:06 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:06 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 1.1M Mar 5 18:23 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-UpperBounds-00
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-UpperBounds-01
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-UpperBounds-02
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-UpperBounds-03
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-UpperBounds-04
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-UpperBounds-05
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-UpperBounds-06
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-UpperBounds-07
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-UpperBounds-08
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-UpperBounds-09
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-UpperBounds-10
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-UpperBounds-11
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-UpperBounds-12
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-UpperBounds-13
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-UpperBounds-14
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1679320431472

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=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SieveSingleMsgMbox-PT-d2m64
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-20 13:53:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-20 13:53:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 13:53:53] [INFO ] Load time of PNML (sax parser for PT used): 161 ms
[2023-03-20 13:53:53] [INFO ] Transformed 2398 places.
[2023-03-20 13:53:53] [INFO ] Transformed 1954 transitions.
[2023-03-20 13:53:53] [INFO ] Parsed PT model containing 2398 places and 1954 transitions and 7816 arcs in 250 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Deduced a syphon composed of 1984 places in 19 ms
Reduce places removed 1984 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d2m64-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m64-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m64-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m64-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m64-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m64-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m64-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m64-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m64-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m64-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m64-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m64-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m64-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m64-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m64-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 1954 rows 414 cols
[2023-03-20 13:53:53] [INFO ] Computed 6 place invariants in 62 ms
Incomplete random walk after 10000 steps, including 2199 resets, run finished after 212 ms. (steps per millisecond=47 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 963 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 1) seen :0
[2023-03-20 13:53:53] [INFO ] Invariant cache hit.
[2023-03-20 13:53:54] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned sat
[2023-03-20 13:53:54] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-20 13:53:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 13:53:54] [INFO ] [Real]Absence check using state equation in 378 ms returned sat
[2023-03-20 13:53:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 13:53:54] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2023-03-20 13:53:54] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-20 13:53:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 13:53:55] [INFO ] [Nat]Absence check using state equation in 351 ms returned sat
[2023-03-20 13:53:55] [INFO ] State equation strengthened by 1674 read => feed constraints.
[2023-03-20 13:53:55] [INFO ] [Nat]Added 1674 Read/Feed constraints in 538 ms returned sat
[2023-03-20 13:53:56] [INFO ] Computed and/alt/rep : 141/395/141 causal constraints (skipped 1812 transitions) in 374 ms.
[2023-03-20 13:53:56] [INFO ] Added : 12 causal constraints over 3 iterations in 1035 ms. Result :sat
Minimization took 1426 ms.
Current structural bounds on expressions (after SMT) : [115] Max seen :[0]
Support contains 1 out of 414 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 414/414 places, 1954/1954 transitions.
Graph (complete) has 2618 edges and 414 vertex of which 388 are kept as prefixes of interest. Removing 26 places using SCC suffix rule.9 ms
Discarding 26 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Ensure Unique test removed 828 transitions
Reduce isomorphic transitions removed 830 transitions.
Iterating post reduction 0 with 830 rules applied. Total rules applied 831 place count 388 transition count 1124
Discarding 119 places :
Symmetric choice reduction at 1 with 119 rule applications. Total rules 950 place count 269 transition count 372
Iterating global reduction 1 with 119 rules applied. Total rules applied 1069 place count 269 transition count 372
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 1079 place count 269 transition count 362
Discarding 93 places :
Symmetric choice reduction at 2 with 93 rule applications. Total rules 1172 place count 176 transition count 269
Iterating global reduction 2 with 93 rules applied. Total rules applied 1265 place count 176 transition count 269
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 2 with 36 rules applied. Total rules applied 1301 place count 176 transition count 233
Discarding 38 places :
Symmetric choice reduction at 3 with 38 rule applications. Total rules 1339 place count 138 transition count 181
Iterating global reduction 3 with 38 rules applied. Total rules applied 1377 place count 138 transition count 181
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 3 with 23 rules applied. Total rules applied 1400 place count 138 transition count 158
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 1410 place count 128 transition count 143
Iterating global reduction 4 with 10 rules applied. Total rules applied 1420 place count 128 transition count 143
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 1430 place count 118 transition count 133
Iterating global reduction 4 with 10 rules applied. Total rules applied 1440 place count 118 transition count 133
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 1446 place count 112 transition count 126
Iterating global reduction 4 with 6 rules applied. Total rules applied 1452 place count 112 transition count 126
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1454 place count 112 transition count 124
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 1460 place count 106 transition count 118
Iterating global reduction 5 with 6 rules applied. Total rules applied 1466 place count 106 transition count 118
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 1470 place count 102 transition count 114
Iterating global reduction 5 with 4 rules applied. Total rules applied 1474 place count 102 transition count 114
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1476 place count 100 transition count 110
Iterating global reduction 5 with 2 rules applied. Total rules applied 1478 place count 100 transition count 110
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1479 place count 99 transition count 109
Iterating global reduction 5 with 1 rules applied. Total rules applied 1480 place count 99 transition count 109
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1481 place count 98 transition count 108
Iterating global reduction 5 with 1 rules applied. Total rules applied 1482 place count 98 transition count 108
Applied a total of 1482 rules in 165 ms. Remains 98 /414 variables (removed 316) and now considering 108/1954 (removed 1846) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 166 ms. Remains : 98/414 places, 108/1954 transitions.
// Phase 1: matrix 108 rows 98 cols
[2023-03-20 13:53:58] [INFO ] Computed 4 place invariants in 6 ms
Incomplete random walk after 1000000 steps, including 224657 resets, run finished after 846 ms. (steps per millisecond=1182 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 103317 resets, run finished after 450 ms. (steps per millisecond=2222 ) properties (out of 1) seen :0
[2023-03-20 13:53:59] [INFO ] Invariant cache hit.
[2023-03-20 13:53:59] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 13:53:59] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 4 ms returned sat
[2023-03-20 13:53:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 13:53:59] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2023-03-20 13:53:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 13:53:59] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-20 13:54:00] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 13:54:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 13:54:00] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2023-03-20 13:54:00] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-20 13:54:00] [INFO ] [Nat]Added 40 Read/Feed constraints in 8 ms returned sat
[2023-03-20 13:54:00] [INFO ] Computed and/alt/rep : 25/67/25 causal constraints (skipped 82 transitions) in 11 ms.
[2023-03-20 13:54:00] [INFO ] Added : 13 causal constraints over 3 iterations in 46 ms. Result :sat
Minimization took 36 ms.
Current structural bounds on expressions (after SMT) : [64] Max seen :[0]
Support contains 1 out of 98 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 108/108 transitions.
Applied a total of 0 rules in 14 ms. Remains 98 /98 variables (removed 0) and now considering 108/108 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 98/98 places, 108/108 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 108/108 transitions.
Applied a total of 0 rules in 13 ms. Remains 98 /98 variables (removed 0) and now considering 108/108 (removed 0) transitions.
[2023-03-20 13:54:00] [INFO ] Invariant cache hit.
[2023-03-20 13:54:00] [INFO ] Implicit Places using invariants in 109 ms returned []
[2023-03-20 13:54:00] [INFO ] Invariant cache hit.
[2023-03-20 13:54:00] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-20 13:54:00] [INFO ] Implicit Places using invariants and state equation in 189 ms returned []
Implicit Place search using SMT with State Equation took 307 ms to find 0 implicit places.
[2023-03-20 13:54:00] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-20 13:54:00] [INFO ] Invariant cache hit.
[2023-03-20 13:54:00] [INFO ] Dead Transitions using invariants and state equation in 93 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 426 ms. Remains : 98/98 places, 108/108 transitions.
Starting property specific reduction for SieveSingleMsgMbox-PT-d2m64-UpperBounds-02
[2023-03-20 13:54:00] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 2238 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 1024 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
[2023-03-20 13:54:00] [INFO ] Invariant cache hit.
[2023-03-20 13:54:00] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-20 13:54:00] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 13:54:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 13:54:00] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2023-03-20 13:54:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 13:54:00] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-20 13:54:00] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 13:54:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 13:54:00] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2023-03-20 13:54:00] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-20 13:54:00] [INFO ] [Nat]Added 40 Read/Feed constraints in 9 ms returned sat
[2023-03-20 13:54:00] [INFO ] Computed and/alt/rep : 25/67/25 causal constraints (skipped 82 transitions) in 9 ms.
[2023-03-20 13:54:00] [INFO ] Added : 13 causal constraints over 3 iterations in 48 ms. Result :sat
Minimization took 41 ms.
Current structural bounds on expressions (after SMT) : [64] Max seen :[0]
Support contains 1 out of 98 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 108/108 transitions.
Applied a total of 0 rules in 14 ms. Remains 98 /98 variables (removed 0) and now considering 108/108 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 98/98 places, 108/108 transitions.
[2023-03-20 13:54:00] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 224527 resets, run finished after 1077 ms. (steps per millisecond=928 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 103238 resets, run finished after 447 ms. (steps per millisecond=2237 ) properties (out of 1) seen :0
[2023-03-20 13:54:02] [INFO ] Invariant cache hit.
[2023-03-20 13:54:02] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-20 13:54:02] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-20 13:54:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 13:54:02] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2023-03-20 13:54:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 13:54:02] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-20 13:54:02] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 13:54:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 13:54:02] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2023-03-20 13:54:02] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-20 13:54:02] [INFO ] [Nat]Added 40 Read/Feed constraints in 10 ms returned sat
[2023-03-20 13:54:02] [INFO ] Computed and/alt/rep : 25/67/25 causal constraints (skipped 82 transitions) in 8 ms.
[2023-03-20 13:54:02] [INFO ] Added : 13 causal constraints over 3 iterations in 50 ms. Result :sat
Minimization took 47 ms.
Current structural bounds on expressions (after SMT) : [64] Max seen :[0]
Support contains 1 out of 98 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 108/108 transitions.
Applied a total of 0 rules in 13 ms. Remains 98 /98 variables (removed 0) and now considering 108/108 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 98/98 places, 108/108 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 108/108 transitions.
Applied a total of 0 rules in 11 ms. Remains 98 /98 variables (removed 0) and now considering 108/108 (removed 0) transitions.
[2023-03-20 13:54:02] [INFO ] Invariant cache hit.
[2023-03-20 13:54:02] [INFO ] Implicit Places using invariants in 99 ms returned []
[2023-03-20 13:54:02] [INFO ] Invariant cache hit.
[2023-03-20 13:54:02] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-20 13:54:03] [INFO ] Implicit Places using invariants and state equation in 177 ms returned []
Implicit Place search using SMT with State Equation took 282 ms to find 0 implicit places.
[2023-03-20 13:54:03] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-20 13:54:03] [INFO ] Invariant cache hit.
[2023-03-20 13:54:03] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 380 ms. Remains : 98/98 places, 108/108 transitions.
Ending property specific reduction for SieveSingleMsgMbox-PT-d2m64-UpperBounds-02 in 2552 ms.
[2023-03-20 13:54:03] [INFO ] Flatten gal took : 35 ms
[2023-03-20 13:54:03] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2023-03-20 13:54:03] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 98 places, 108 transitions and 430 arcs took 2 ms.
Total runtime 10037 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 --maxsum=/tmp/528/ub_0_
TIME LIMIT: Killed by timeout after 3570 seconds
MemTotal: 16393356 kB
MemFree: 11650512 kB
After kill :
MemTotal: 16393356 kB
MemFree: 16097040 kB
Could not compute solution for formula : SieveSingleMsgMbox-PT-d2m64-UpperBounds-02

BK_STOP 1679324014681

--------------------
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 UpperBounds -timeout 360 -rebuildPNML
mcc2023
ub formula name SieveSingleMsgMbox-PT-d2m64-UpperBounds-02
ub formula formula --maxsum=/tmp/528/ub_0_
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 98 places, 108 transitions and 430 arcs
pnml2lts-sym: Petri net SieveSingleMsgMbox_PT_d2m64 analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.000 real 0.000 user 0.010 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: 108->106 groups
pnml2lts-sym: Regrouping took 0.020 real 0.010 user 0.000 sys
pnml2lts-sym: state vector length is 98; there are 106 groups
pnml2lts-sym: Computing maximum sum over 1 state variables.
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
Killing (15) : 534
Killing (9) : 534

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="SieveSingleMsgMbox-PT-d2m64"
export BK_EXAMINATION="UpperBounds"
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 SieveSingleMsgMbox-PT-d2m64, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r425-tajo-167905978300485"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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