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.r426-tajo-167905979000485.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 marciexred
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 r426-tajo-167905979000485
=====================================================================

--------------------
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 1679356734484

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=marciexred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SieveSingleMsgMbox-PT-d2m64
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-20 23:58:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-20 23:58:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 23:58:56] [INFO ] Load time of PNML (sax parser for PT used): 131 ms
[2023-03-20 23:58:56] [INFO ] Transformed 2398 places.
[2023-03-20 23:58:56] [INFO ] Transformed 1954 transitions.
[2023-03-20 23:58:56] [INFO ] Parsed PT model containing 2398 places and 1954 transitions and 7816 arcs in 197 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 4 ms.
Deduced a syphon composed of 1984 places in 17 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 23:58:56] [INFO ] Computed 6 place invariants in 67 ms
Incomplete random walk after 10000 steps, including 2232 resets, run finished after 197 ms. (steps per millisecond=50 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 913 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 1) seen :0
[2023-03-20 23:58:56] [INFO ] Invariant cache hit.
[2023-03-20 23:58:56] [INFO ] [Real]Absence check using 3 positive place invariants in 11 ms returned sat
[2023-03-20 23:58:56] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-20 23:58:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 23:58:57] [INFO ] [Real]Absence check using state equation in 310 ms returned sat
[2023-03-20 23:58:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 23:58:57] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-20 23:58:57] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-20 23:58:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 23:58:57] [INFO ] [Nat]Absence check using state equation in 294 ms returned sat
[2023-03-20 23:58:57] [INFO ] State equation strengthened by 1674 read => feed constraints.
[2023-03-20 23:58:58] [INFO ] [Nat]Added 1674 Read/Feed constraints in 502 ms returned sat
[2023-03-20 23:58:58] [INFO ] Computed and/alt/rep : 141/395/141 causal constraints (skipped 1812 transitions) in 348 ms.
[2023-03-20 23:58:59] [INFO ] Added : 12 causal constraints over 3 iterations in 1091 ms. Result :sat
Minimization took 1273 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.8 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 154 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 155 ms. Remains : 98/414 places, 108/1954 transitions.
// Phase 1: matrix 108 rows 98 cols
[2023-03-20 23:59:01] [INFO ] Computed 4 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 224451 resets, run finished after 1010 ms. (steps per millisecond=990 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 103580 resets, run finished after 458 ms. (steps per millisecond=2183 ) properties (out of 1) seen :0
[2023-03-20 23:59:02] [INFO ] Invariant cache hit.
[2023-03-20 23:59:02] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-20 23:59:02] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 23:59:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 23:59:02] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2023-03-20 23:59:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 23:59:02] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-20 23:59:02] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-20 23:59:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 23:59:02] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2023-03-20 23:59:02] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-20 23:59:02] [INFO ] [Nat]Added 40 Read/Feed constraints in 20 ms returned sat
[2023-03-20 23:59:02] [INFO ] Computed and/alt/rep : 25/67/25 causal constraints (skipped 82 transitions) in 10 ms.
[2023-03-20 23:59:02] [INFO ] Added : 13 causal constraints over 3 iterations in 58 ms. Result :sat
Minimization took 54 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 15 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 23:59:02] [INFO ] Invariant cache hit.
[2023-03-20 23:59:02] [INFO ] Implicit Places using invariants in 78 ms returned []
[2023-03-20 23:59:02] [INFO ] Invariant cache hit.
[2023-03-20 23:59:02] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-20 23:59:03] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 255 ms to find 0 implicit places.
[2023-03-20 23:59:03] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-20 23:59:03] [INFO ] Invariant cache hit.
[2023-03-20 23:59:03] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 333 ms. Remains : 98/98 places, 108/108 transitions.
Starting property specific reduction for SieveSingleMsgMbox-PT-d2m64-UpperBounds-02
[2023-03-20 23:59:03] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 2233 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 1052 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
[2023-03-20 23:59:03] [INFO ] Invariant cache hit.
[2023-03-20 23:59:03] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 23:59:03] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 23:59:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 23:59:03] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2023-03-20 23:59:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 23:59:03] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 23:59:03] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 23:59:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 23:59:03] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2023-03-20 23:59:03] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-20 23:59:03] [INFO ] [Nat]Added 40 Read/Feed constraints in 8 ms returned sat
[2023-03-20 23:59:03] [INFO ] Computed and/alt/rep : 25/67/25 causal constraints (skipped 82 transitions) in 7 ms.
[2023-03-20 23:59:03] [INFO ] Added : 13 causal constraints over 3 iterations in 41 ms. Result :sat
Minimization took 44 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 7 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 7 ms. Remains : 98/98 places, 108/108 transitions.
[2023-03-20 23:59:03] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 224464 resets, run finished after 767 ms. (steps per millisecond=1303 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 103047 resets, run finished after 393 ms. (steps per millisecond=2544 ) properties (out of 1) seen :0
[2023-03-20 23:59:04] [INFO ] Invariant cache hit.
[2023-03-20 23:59:04] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-20 23:59:04] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 23:59:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 23:59:04] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2023-03-20 23:59:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 23:59:04] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-20 23:59:04] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 23:59:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 23:59:04] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2023-03-20 23:59:04] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-20 23:59:04] [INFO ] [Nat]Added 40 Read/Feed constraints in 14 ms returned sat
[2023-03-20 23:59:04] [INFO ] Computed and/alt/rep : 25/67/25 causal constraints (skipped 82 transitions) in 5 ms.
[2023-03-20 23:59:04] [INFO ] Added : 13 causal constraints over 3 iterations in 45 ms. Result :sat
Minimization took 32 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 5 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 5 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 5 ms. Remains 98 /98 variables (removed 0) and now considering 108/108 (removed 0) transitions.
[2023-03-20 23:59:04] [INFO ] Invariant cache hit.
[2023-03-20 23:59:04] [INFO ] Implicit Places using invariants in 54 ms returned []
[2023-03-20 23:59:04] [INFO ] Invariant cache hit.
[2023-03-20 23:59:04] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-20 23:59:05] [INFO ] Implicit Places using invariants and state equation in 164 ms returned []
Implicit Place search using SMT with State Equation took 222 ms to find 0 implicit places.
[2023-03-20 23:59:05] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-20 23:59:05] [INFO ] Invariant cache hit.
[2023-03-20 23:59:05] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 282 ms. Remains : 98/98 places, 108/108 transitions.
Ending property specific reduction for SieveSingleMsgMbox-PT-d2m64-UpperBounds-02 in 1929 ms.
[2023-03-20 23:59:05] [INFO ] Flatten gal took : 29 ms
[2023-03-20 23:59:05] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2023-03-20 23:59:05] [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 9082 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=UpperBounds.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: SieveSingleMsgMbox_PT_d2m64
(NrP: 98 NrTr: 108 NrArc: 430)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.001sec

net check time: 0m 0.000sec

init dd package: 0m 3.138sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 173368 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16186540 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.000sec

17679 50579 112683 169281 223671 292523 320976 549911 691854 584700 563122 656530 663751

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="marciexred"
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 marciexred"
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 r426-tajo-167905979000485"
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 ;