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

About the Execution of Marcie+red for SieveSingleMsgMbox-PT-d2m18

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
5743.039 94092.00 113323.00 98.40 1 0 0 0 0 0 0 0 0 0 0 1 1 0 0 0 normal

Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r426-tajo-167905979000469.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-d2m18, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r426-tajo-167905979000469
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 7.1K Feb 26 10:33 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Feb 26 10:33 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 26 10:32 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 26 10:32 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K 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 15K Feb 25 17:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.3K Feb 26 10:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 26 10:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Feb 26 10:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 26 10:33 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-d2m18-UpperBounds-00
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-UpperBounds-01
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-UpperBounds-02
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-UpperBounds-03
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-UpperBounds-04
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-UpperBounds-05
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-UpperBounds-06
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-UpperBounds-07
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-UpperBounds-08
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-UpperBounds-09
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-UpperBounds-10
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-UpperBounds-11
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-UpperBounds-12
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-UpperBounds-13
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-UpperBounds-14
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1679355897763

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-d2m18
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-20 23:44:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-20 23:44:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 23:44:59] [INFO ] Load time of PNML (sax parser for PT used): 142 ms
[2023-03-20 23:44:59] [INFO ] Transformed 2398 places.
[2023-03-20 23:44:59] [INFO ] Transformed 1954 transitions.
[2023-03-20 23:44:59] [INFO ] Parsed PT model containing 2398 places and 1954 transitions and 7816 arcs in 218 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
Deduced a syphon composed of 1984 places in 21 ms
Reduce places removed 1984 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d2m18-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m18-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m18-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m18-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m18-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m18-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m18-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m18-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m18-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m18-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m18-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m18-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m18-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 1954 rows 414 cols
[2023-03-20 23:44:59] [INFO ] Computed 6 place invariants in 61 ms
Incomplete random walk after 10000 steps, including 2217 resets, run finished after 256 ms. (steps per millisecond=39 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 936 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 951 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 927 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 3) seen :0
[2023-03-20 23:45:00] [INFO ] Invariant cache hit.
[2023-03-20 23:45:00] [INFO ] [Real]Absence check using 3 positive place invariants in 8 ms returned sat
[2023-03-20 23:45:00] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-20 23:45:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 23:45:00] [INFO ] [Real]Absence check using state equation in 345 ms returned sat
[2023-03-20 23:45:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 23:45:01] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-20 23:45:01] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 5 ms returned sat
[2023-03-20 23:45:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 23:45:01] [INFO ] [Nat]Absence check using state equation in 490 ms returned sat
[2023-03-20 23:45:01] [INFO ] State equation strengthened by 1674 read => feed constraints.
[2023-03-20 23:45:02] [INFO ] [Nat]Added 1674 Read/Feed constraints in 564 ms returned sat
[2023-03-20 23:45:02] [INFO ] Deduced a trap composed of 115 places in 258 ms of which 3 ms to minimize.
[2023-03-20 23:45:02] [INFO ] Deduced a trap composed of 135 places in 208 ms of which 1 ms to minimize.
[2023-03-20 23:45:03] [INFO ] Deduced a trap composed of 105 places in 306 ms of which 2 ms to minimize.
[2023-03-20 23:45:03] [INFO ] Deduced a trap composed of 125 places in 144 ms of which 1 ms to minimize.
[2023-03-20 23:45:03] [INFO ] Deduced a trap composed of 141 places in 145 ms of which 0 ms to minimize.
[2023-03-20 23:45:03] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1695 ms
[2023-03-20 23:45:04] [INFO ] Computed and/alt/rep : 141/395/141 causal constraints (skipped 1812 transitions) in 360 ms.
[2023-03-20 23:45:05] [INFO ] Added : 25 causal constraints over 5 iterations in 1433 ms. Result :sat
Minimization took 501 ms.
[2023-03-20 23:45:05] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2023-03-20 23:45:06] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-20 23:45:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 23:45:06] [INFO ] [Real]Absence check using state equation in 353 ms returned sat
[2023-03-20 23:45:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 23:45:06] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2023-03-20 23:45:06] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-20 23:45:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 23:45:06] [INFO ] [Nat]Absence check using state equation in 419 ms returned sat
[2023-03-20 23:45:07] [INFO ] [Nat]Added 1674 Read/Feed constraints in 644 ms returned sat
[2023-03-20 23:45:07] [INFO ] Deduced a trap composed of 90 places in 313 ms of which 2 ms to minimize.
[2023-03-20 23:45:08] [INFO ] Deduced a trap composed of 98 places in 310 ms of which 1 ms to minimize.
[2023-03-20 23:45:08] [INFO ] Deduced a trap composed of 197 places in 242 ms of which 1 ms to minimize.
[2023-03-20 23:45:09] [INFO ] Deduced a trap composed of 244 places in 281 ms of which 1 ms to minimize.
[2023-03-20 23:45:09] [INFO ] Deduced a trap composed of 250 places in 277 ms of which 0 ms to minimize.
[2023-03-20 23:45:09] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2115 ms
[2023-03-20 23:45:09] [INFO ] Computed and/alt/rep : 141/395/141 causal constraints (skipped 1812 transitions) in 253 ms.
[2023-03-20 23:45:10] [INFO ] Added : 14 causal constraints over 4 iterations in 1044 ms. Result :sat
Minimization took 663 ms.
[2023-03-20 23:45:11] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2023-03-20 23:45:11] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-20 23:45:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 23:45:11] [INFO ] [Real]Absence check using state equation in 400 ms returned sat
[2023-03-20 23:45:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 23:45:12] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-20 23:45:12] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-20 23:45:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 23:45:12] [INFO ] [Nat]Absence check using state equation in 401 ms returned sat
[2023-03-20 23:45:13] [INFO ] [Nat]Added 1674 Read/Feed constraints in 526 ms returned sat
[2023-03-20 23:45:13] [INFO ] Deduced a trap composed of 113 places in 249 ms of which 0 ms to minimize.
[2023-03-20 23:45:13] [INFO ] Deduced a trap composed of 112 places in 151 ms of which 1 ms to minimize.
[2023-03-20 23:45:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 682 ms
[2023-03-20 23:45:13] [INFO ] Computed and/alt/rep : 141/395/141 causal constraints (skipped 1812 transitions) in 271 ms.
[2023-03-20 23:45:14] [INFO ] Added : 14 causal constraints over 3 iterations in 1011 ms. Result :sat
Minimization took 672 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 12] Max seen :[0, 0, 0]
Support contains 3 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 389 are kept as prefixes of interest. Removing 25 places using SCC suffix rule.6 ms
Discarding 25 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Ensure Unique test removed 792 transitions
Reduce isomorphic transitions removed 794 transitions.
Iterating post reduction 0 with 794 rules applied. Total rules applied 795 place count 389 transition count 1160
Discarding 118 places :
Symmetric choice reduction at 1 with 118 rule applications. Total rules 913 place count 271 transition count 374
Iterating global reduction 1 with 118 rules applied. Total rules applied 1031 place count 271 transition count 374
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 1040 place count 271 transition count 365
Discarding 93 places :
Symmetric choice reduction at 2 with 93 rule applications. Total rules 1133 place count 178 transition count 272
Iterating global reduction 2 with 93 rules applied. Total rules applied 1226 place count 178 transition count 272
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 2 with 36 rules applied. Total rules applied 1262 place count 178 transition count 236
Discarding 39 places :
Symmetric choice reduction at 3 with 39 rule applications. Total rules 1301 place count 139 transition count 182
Iterating global reduction 3 with 39 rules applied. Total rules applied 1340 place count 139 transition count 182
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 3 with 24 rules applied. Total rules applied 1364 place count 139 transition count 158
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 1373 place count 130 transition count 145
Iterating global reduction 4 with 9 rules applied. Total rules applied 1382 place count 130 transition count 145
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 1391 place count 121 transition count 136
Iterating global reduction 4 with 9 rules applied. Total rules applied 1400 place count 121 transition count 136
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 1405 place count 116 transition count 130
Iterating global reduction 4 with 5 rules applied. Total rules applied 1410 place count 116 transition count 130
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1412 place count 116 transition count 128
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 1417 place count 111 transition count 123
Iterating global reduction 5 with 5 rules applied. Total rules applied 1422 place count 111 transition count 123
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1424 place count 109 transition count 121
Iterating global reduction 5 with 2 rules applied. Total rules applied 1426 place count 109 transition count 121
Applied a total of 1426 rules in 129 ms. Remains 109 /414 variables (removed 305) and now considering 121/1954 (removed 1833) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 129 ms. Remains : 109/414 places, 121/1954 transitions.
// Phase 1: matrix 121 rows 109 cols
[2023-03-20 23:45:15] [INFO ] Computed 4 place invariants in 5 ms
Incomplete random walk after 1000000 steps, including 224394 resets, run finished after 927 ms. (steps per millisecond=1078 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000000 steps, including 104004 resets, run finished after 431 ms. (steps per millisecond=2320 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000000 steps, including 103196 resets, run finished after 417 ms. (steps per millisecond=2398 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000000 steps, including 103127 resets, run finished after 404 ms. (steps per millisecond=2475 ) properties (out of 3) seen :0
[2023-03-20 23:45:18] [INFO ] Invariant cache hit.
[2023-03-20 23:45:18] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-20 23:45:18] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-20 23:45:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 23:45:18] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2023-03-20 23:45:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 23:45:18] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-20 23:45:18] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-20 23:45:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 23:45:18] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2023-03-20 23:45:18] [INFO ] State equation strengthened by 47 read => feed constraints.
[2023-03-20 23:45:18] [INFO ] [Nat]Added 47 Read/Feed constraints in 13 ms returned sat
[2023-03-20 23:45:18] [INFO ] Computed and/alt/rep : 29/73/29 causal constraints (skipped 91 transitions) in 9 ms.
[2023-03-20 23:45:18] [INFO ] Added : 19 causal constraints over 4 iterations in 54 ms. Result :sat
Minimization took 25 ms.
[2023-03-20 23:45:18] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-20 23:45:18] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 23:45:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 23:45:18] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2023-03-20 23:45:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 23:45:18] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 23:45:18] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 23:45:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 23:45:18] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2023-03-20 23:45:18] [INFO ] [Nat]Added 47 Read/Feed constraints in 13 ms returned sat
[2023-03-20 23:45:18] [INFO ] Computed and/alt/rep : 29/73/29 causal constraints (skipped 91 transitions) in 8 ms.
[2023-03-20 23:45:18] [INFO ] Added : 14 causal constraints over 3 iterations in 41 ms. Result :sat
Minimization took 26 ms.
[2023-03-20 23:45:18] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-20 23:45:18] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 23:45:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 23:45:18] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2023-03-20 23:45:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 23:45:18] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-20 23:45:18] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 23:45:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 23:45:18] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2023-03-20 23:45:18] [INFO ] [Nat]Added 47 Read/Feed constraints in 14 ms returned sat
[2023-03-20 23:45:18] [INFO ] Deduced a trap composed of 40 places in 47 ms of which 1 ms to minimize.
[2023-03-20 23:45:18] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 0 ms to minimize.
[2023-03-20 23:45:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 113 ms
[2023-03-20 23:45:18] [INFO ] Computed and/alt/rep : 29/73/29 causal constraints (skipped 91 transitions) in 10 ms.
[2023-03-20 23:45:18] [INFO ] Added : 16 causal constraints over 4 iterations in 66 ms. Result :sat
Minimization took 29 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 12] Max seen :[0, 0, 0]
Support contains 3 out of 109 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 109/109 places, 121/121 transitions.
Applied a total of 0 rules in 9 ms. Remains 109 /109 variables (removed 0) and now considering 121/121 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 109/109 places, 121/121 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 109/109 places, 121/121 transitions.
Applied a total of 0 rules in 9 ms. Remains 109 /109 variables (removed 0) and now considering 121/121 (removed 0) transitions.
[2023-03-20 23:45:19] [INFO ] Invariant cache hit.
[2023-03-20 23:45:19] [INFO ] Implicit Places using invariants in 89 ms returned []
[2023-03-20 23:45:19] [INFO ] Invariant cache hit.
[2023-03-20 23:45:19] [INFO ] State equation strengthened by 47 read => feed constraints.
[2023-03-20 23:45:19] [INFO ] Implicit Places using invariants and state equation in 185 ms returned []
Implicit Place search using SMT with State Equation took 279 ms to find 0 implicit places.
[2023-03-20 23:45:19] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-20 23:45:19] [INFO ] Invariant cache hit.
[2023-03-20 23:45:19] [INFO ] Dead Transitions using invariants and state equation in 89 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 391 ms. Remains : 109/109 places, 121/121 transitions.
Starting property specific reduction for SieveSingleMsgMbox-PT-d2m18-UpperBounds-00
[2023-03-20 23:45:19] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 2264 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 1075 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
[2023-03-20 23:45:19] [INFO ] Invariant cache hit.
[2023-03-20 23:45:19] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-20 23:45:19] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 23:45:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 23:45:19] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2023-03-20 23:45:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 23:45:19] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-20 23:45:19] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 23:45:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 23:45:19] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2023-03-20 23:45:19] [INFO ] State equation strengthened by 47 read => feed constraints.
[2023-03-20 23:45:19] [INFO ] [Nat]Added 47 Read/Feed constraints in 12 ms returned sat
[2023-03-20 23:45:19] [INFO ] Computed and/alt/rep : 29/73/29 causal constraints (skipped 91 transitions) in 10 ms.
[2023-03-20 23:45:19] [INFO ] Added : 19 causal constraints over 4 iterations in 56 ms. Result :sat
Minimization took 25 ms.
Current structural bounds on expressions (after SMT) : [18] Max seen :[0]
Support contains 1 out of 109 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 109/109 places, 121/121 transitions.
Graph (complete) has 308 edges and 109 vertex of which 108 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 108 transition count 120
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 107 transition count 119
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 107 transition count 119
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 5 place count 107 transition count 118
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 6 place count 106 transition count 117
Iterating global reduction 2 with 1 rules applied. Total rules applied 7 place count 106 transition count 117
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 8 place count 105 transition count 116
Iterating global reduction 2 with 1 rules applied. Total rules applied 9 place count 105 transition count 116
Applied a total of 9 rules in 26 ms. Remains 105 /109 variables (removed 4) and now considering 116/121 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 105/109 places, 116/121 transitions.
// Phase 1: matrix 116 rows 105 cols
[2023-03-20 23:45:19] [INFO ] Computed 4 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 224653 resets, run finished after 1002 ms. (steps per millisecond=998 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 103800 resets, run finished after 423 ms. (steps per millisecond=2364 ) properties (out of 1) seen :0
[2023-03-20 23:45:21] [INFO ] Invariant cache hit.
[2023-03-20 23:45:21] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 23:45:21] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 23:45:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 23:45:21] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2023-03-20 23:45:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 23:45:21] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-20 23:45:21] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 23:45:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 23:45:21] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2023-03-20 23:45:21] [INFO ] State equation strengthened by 43 read => feed constraints.
[2023-03-20 23:45:21] [INFO ] [Nat]Added 43 Read/Feed constraints in 13 ms returned sat
[2023-03-20 23:45:21] [INFO ] Computed and/alt/rep : 28/73/28 causal constraints (skipped 87 transitions) in 8 ms.
[2023-03-20 23:45:21] [INFO ] Added : 18 causal constraints over 4 iterations in 60 ms. Result :sat
Minimization took 24 ms.
Current structural bounds on expressions (after SMT) : [18] Max seen :[0]
Support contains 1 out of 105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 116/116 transitions.
Applied a total of 0 rules in 8 ms. Remains 105 /105 variables (removed 0) and now considering 116/116 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 105/105 places, 116/116 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 116/116 transitions.
Applied a total of 0 rules in 6 ms. Remains 105 /105 variables (removed 0) and now considering 116/116 (removed 0) transitions.
[2023-03-20 23:45:21] [INFO ] Invariant cache hit.
[2023-03-20 23:45:21] [INFO ] Implicit Places using invariants in 99 ms returned []
[2023-03-20 23:45:21] [INFO ] Invariant cache hit.
[2023-03-20 23:45:21] [INFO ] State equation strengthened by 43 read => feed constraints.
[2023-03-20 23:45:22] [INFO ] Implicit Places using invariants and state equation in 182 ms returned []
Implicit Place search using SMT with State Equation took 283 ms to find 0 implicit places.
[2023-03-20 23:45:22] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-20 23:45:22] [INFO ] Invariant cache hit.
[2023-03-20 23:45:22] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 363 ms. Remains : 105/105 places, 116/116 transitions.
Ending property specific reduction for SieveSingleMsgMbox-PT-d2m18-UpperBounds-00 in 2528 ms.
Starting property specific reduction for SieveSingleMsgMbox-PT-d2m18-UpperBounds-11
// Phase 1: matrix 121 rows 109 cols
[2023-03-20 23:45:22] [INFO ] Computed 4 place invariants in 2 ms
Incomplete random walk after 10000 steps, including 2247 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 993 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
[2023-03-20 23:45:22] [INFO ] Invariant cache hit.
[2023-03-20 23:45:22] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-20 23:45:22] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 23:45:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 23:45:22] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2023-03-20 23:45:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 23:45:22] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-20 23:45:22] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 23:45:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 23:45:22] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2023-03-20 23:45:22] [INFO ] State equation strengthened by 47 read => feed constraints.
[2023-03-20 23:45:22] [INFO ] [Nat]Added 47 Read/Feed constraints in 12 ms returned sat
[2023-03-20 23:45:22] [INFO ] Computed and/alt/rep : 29/73/29 causal constraints (skipped 91 transitions) in 8 ms.
[2023-03-20 23:45:22] [INFO ] Added : 14 causal constraints over 3 iterations in 39 ms. Result :sat
Minimization took 25 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 109 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 109/109 places, 121/121 transitions.
Graph (complete) has 308 edges and 109 vertex of which 108 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 108 transition count 120
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 107 transition count 118
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 107 transition count 118
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 5 place count 106 transition count 117
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 106 transition count 117
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 7 place count 105 transition count 116
Iterating global reduction 1 with 1 rules applied. Total rules applied 8 place count 105 transition count 116
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 104 transition count 115
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 104 transition count 115
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 103 transition count 114
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 103 transition count 114
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 102 transition count 111
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 102 transition count 111
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 101 transition count 110
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 101 transition count 110
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 100 transition count 109
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 100 transition count 109
Applied a total of 18 rules in 18 ms. Remains 100 /109 variables (removed 9) and now considering 109/121 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 100/109 places, 109/121 transitions.
// Phase 1: matrix 109 rows 100 cols
[2023-03-20 23:45:22] [INFO ] Computed 4 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 224280 resets, run finished after 945 ms. (steps per millisecond=1058 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 103613 resets, run finished after 447 ms. (steps per millisecond=2237 ) properties (out of 1) seen :0
[2023-03-20 23:45:23] [INFO ] Invariant cache hit.
[2023-03-20 23:45:23] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-20 23:45:23] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 23:45:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 23:45:23] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2023-03-20 23:45:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 23:45:23] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-20 23:45:23] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-20 23:45:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 23:45:23] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2023-03-20 23:45:23] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-20 23:45:23] [INFO ] [Nat]Added 42 Read/Feed constraints in 6 ms returned sat
[2023-03-20 23:45:23] [INFO ] Computed and/alt/rep : 26/65/26 causal constraints (skipped 82 transitions) in 5 ms.
[2023-03-20 23:45:24] [INFO ] Added : 11 causal constraints over 3 iterations in 32 ms. Result :sat
Minimization took 18 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 100 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 100/100 places, 109/109 transitions.
Applied a total of 0 rules in 4 ms. Remains 100 /100 variables (removed 0) and now considering 109/109 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 100/100 places, 109/109 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 100/100 places, 109/109 transitions.
Applied a total of 0 rules in 3 ms. Remains 100 /100 variables (removed 0) and now considering 109/109 (removed 0) transitions.
[2023-03-20 23:45:24] [INFO ] Invariant cache hit.
[2023-03-20 23:45:24] [INFO ] Implicit Places using invariants in 78 ms returned []
[2023-03-20 23:45:24] [INFO ] Invariant cache hit.
[2023-03-20 23:45:24] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-20 23:45:24] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 234 ms to find 0 implicit places.
[2023-03-20 23:45:24] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-20 23:45:24] [INFO ] Invariant cache hit.
[2023-03-20 23:45:24] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 306 ms. Remains : 100/100 places, 109/109 transitions.
Ending property specific reduction for SieveSingleMsgMbox-PT-d2m18-UpperBounds-11 in 2274 ms.
Starting property specific reduction for SieveSingleMsgMbox-PT-d2m18-UpperBounds-12
// Phase 1: matrix 121 rows 109 cols
[2023-03-20 23:45:24] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2279 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 1014 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
[2023-03-20 23:45:24] [INFO ] Invariant cache hit.
[2023-03-20 23:45:24] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-20 23:45:24] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 23:45:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 23:45:24] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2023-03-20 23:45:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 23:45:24] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-20 23:45:24] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2023-03-20 23:45:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 23:45:24] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2023-03-20 23:45:24] [INFO ] State equation strengthened by 47 read => feed constraints.
[2023-03-20 23:45:24] [INFO ] [Nat]Added 47 Read/Feed constraints in 14 ms returned sat
[2023-03-20 23:45:24] [INFO ] Deduced a trap composed of 40 places in 47 ms of which 0 ms to minimize.
[2023-03-20 23:45:24] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 0 ms to minimize.
[2023-03-20 23:45:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 109 ms
[2023-03-20 23:45:24] [INFO ] Computed and/alt/rep : 29/73/29 causal constraints (skipped 91 transitions) in 9 ms.
[2023-03-20 23:45:24] [INFO ] Added : 16 causal constraints over 4 iterations in 63 ms. Result :sat
Minimization took 18 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 109 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 109/109 places, 121/121 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 107 transition count 118
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 107 transition count 118
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 107 transition count 117
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 7 place count 105 transition count 115
Iterating global reduction 1 with 2 rules applied. Total rules applied 9 place count 105 transition count 115
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 11 place count 103 transition count 113
Iterating global reduction 1 with 2 rules applied. Total rules applied 13 place count 103 transition count 113
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 102 transition count 112
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 102 transition count 112
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 101 transition count 111
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 101 transition count 111
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 100 transition count 108
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 100 transition count 108
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 99 transition count 107
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 99 transition count 107
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 98 transition count 106
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 98 transition count 106
Applied a total of 23 rules in 18 ms. Remains 98 /109 variables (removed 11) and now considering 106/121 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 98/109 places, 106/121 transitions.
// Phase 1: matrix 106 rows 98 cols
[2023-03-20 23:45:24] [INFO ] Computed 4 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 223831 resets, run finished after 754 ms. (steps per millisecond=1326 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 103528 resets, run finished after 387 ms. (steps per millisecond=2583 ) properties (out of 1) seen :0
[2023-03-20 23:45:25] [INFO ] Invariant cache hit.
[2023-03-20 23:45:26] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-20 23:45:26] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 23:45:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 23:45:26] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2023-03-20 23:45:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 23:45:26] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-20 23:45:26] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 23:45:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 23:45:26] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2023-03-20 23:45:26] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-20 23:45:26] [INFO ] [Nat]Added 40 Read/Feed constraints in 12 ms returned sat
[2023-03-20 23:45:26] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
[2023-03-20 23:45:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 68 ms
[2023-03-20 23:45:26] [INFO ] Computed and/alt/rep : 25/65/25 causal constraints (skipped 80 transitions) in 8 ms.
[2023-03-20 23:45:26] [INFO ] Added : 18 causal constraints over 4 iterations in 59 ms. Result :sat
Minimization took 23 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 98 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 106/106 transitions.
Applied a total of 0 rules in 3 ms. Remains 98 /98 variables (removed 0) and now considering 106/106 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 98/98 places, 106/106 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 106/106 transitions.
Applied a total of 0 rules in 3 ms. Remains 98 /98 variables (removed 0) and now considering 106/106 (removed 0) transitions.
[2023-03-20 23:45:26] [INFO ] Invariant cache hit.
[2023-03-20 23:45:26] [INFO ] Implicit Places using invariants in 81 ms returned []
[2023-03-20 23:45:26] [INFO ] Invariant cache hit.
[2023-03-20 23:45:26] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-20 23:45:26] [INFO ] Implicit Places using invariants and state equation in 184 ms returned []
Implicit Place search using SMT with State Equation took 267 ms to find 0 implicit places.
[2023-03-20 23:45:26] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-20 23:45:26] [INFO ] Invariant cache hit.
[2023-03-20 23:45:26] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 353 ms. Remains : 98/98 places, 106/106 transitions.
Ending property specific reduction for SieveSingleMsgMbox-PT-d2m18-UpperBounds-12 in 2313 ms.
[2023-03-20 23:45:26] [INFO ] Flatten gal took : 41 ms
[2023-03-20 23:45:26] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2023-03-20 23:45:26] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 109 places, 121 transitions and 482 arcs took 2 ms.
Total runtime 27537 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_d2m18
(NrP: 109 NrTr: 121 NrArc: 482)

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

net check time: 0m 0.000sec

init dd package: 0m 3.061sec


RS generation: 0m58.450sec


-> reachability set: #nodes 29445 (2.9e+04) #states 13,495,396,472 (10)



starting MCC model checker
--------------------------

checking: place_bound(p58)
normalized: place_bound(p58)

-> the formula is 1

FORMULA SieveSingleMsgMbox-PT-d2m18-UpperBounds-00 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(p86)
normalized: place_bound(p86)

-> the formula is 1

FORMULA SieveSingleMsgMbox-PT-d2m18-UpperBounds-11 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(p103)
normalized: place_bound(p103)

-> the formula is 1

FORMULA SieveSingleMsgMbox-PT-d2m18-UpperBounds-12 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

totally nodes used: 3250364 (3.3e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 203569472 161070340 364639812
used/not used/entry size/cache size: 61062170 6046694 16 1024MB
basic ops cache: hits/miss/sum: 6 5952 5958
used/not used/entry size/cache size: 17822 16759394 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 8 128MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 12 192MB
state nr cache: hits/miss/sum: 39394 29452 68846
used/not used/entry size/cache size: 29399 8359209 32 256MB
max state cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 64254343
1 2602828
2 212709
3 25606
4 4740
5 1284
6 937
7 619
8 1689
9 115
>= 10 3994

Total processing time: 1m 4.734sec


BK_STOP 1679355991855

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

11501 34375 43161 49292 40262 41367
iterations count:681382 (5631), effective:13734 (113)

initing FirstDep: 0m 0.000sec

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

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