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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
5447.815 29474.00 50535.00 198.10 0 0 0 0 0 0 0 0 0 0 0 0 0 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-167905979000453.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-d2m04, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r426-tajo-167905979000453
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.6M
-rw-r--r-- 1 mcc users 7.9K Feb 26 10:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K Feb 26 10:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 26 10:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 26 10:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 17:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 17:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 17:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Feb 26 10:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 186K Feb 26 10:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Feb 26 10:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K Feb 26 10:30 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-d2m04-UpperBounds-00
FORMULA_NAME SieveSingleMsgMbox-PT-d2m04-UpperBounds-01
FORMULA_NAME SieveSingleMsgMbox-PT-d2m04-UpperBounds-02
FORMULA_NAME SieveSingleMsgMbox-PT-d2m04-UpperBounds-03
FORMULA_NAME SieveSingleMsgMbox-PT-d2m04-UpperBounds-04
FORMULA_NAME SieveSingleMsgMbox-PT-d2m04-UpperBounds-05
FORMULA_NAME SieveSingleMsgMbox-PT-d2m04-UpperBounds-06
FORMULA_NAME SieveSingleMsgMbox-PT-d2m04-UpperBounds-07
FORMULA_NAME SieveSingleMsgMbox-PT-d2m04-UpperBounds-08
FORMULA_NAME SieveSingleMsgMbox-PT-d2m04-UpperBounds-09
FORMULA_NAME SieveSingleMsgMbox-PT-d2m04-UpperBounds-10
FORMULA_NAME SieveSingleMsgMbox-PT-d2m04-UpperBounds-11
FORMULA_NAME SieveSingleMsgMbox-PT-d2m04-UpperBounds-12
FORMULA_NAME SieveSingleMsgMbox-PT-d2m04-UpperBounds-13
FORMULA_NAME SieveSingleMsgMbox-PT-d2m04-UpperBounds-14
FORMULA_NAME SieveSingleMsgMbox-PT-d2m04-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1679355240473

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-d2m04
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-20 23:34:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-20 23:34:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 23:34:02] [INFO ] Load time of PNML (sax parser for PT used): 140 ms
[2023-03-20 23:34:02] [INFO ] Transformed 2398 places.
[2023-03-20 23:34:02] [INFO ] Transformed 1954 transitions.
[2023-03-20 23:34:03] [INFO ] Parsed PT model containing 2398 places and 1954 transitions and 7816 arcs in 262 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Deduced a syphon composed of 1984 places in 18 ms
Reduce places removed 1984 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d2m04-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m04-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m04-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m04-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m04-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m04-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m04-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m04-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m04-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m04-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m04-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m04-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m04-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m04-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 1954 rows 414 cols
[2023-03-20 23:34:03] [INFO ] Computed 6 place invariants in 78 ms
Incomplete random walk after 10000 steps, including 2179 resets, run finished after 231 ms. (steps per millisecond=43 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 926 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 939 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 2) seen :0
[2023-03-20 23:34:03] [INFO ] Invariant cache hit.
[2023-03-20 23:34:03] [INFO ] [Real]Absence check using 3 positive place invariants in 15 ms returned sat
[2023-03-20 23:34:03] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-20 23:34:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 23:34:04] [INFO ] [Real]Absence check using state equation in 556 ms returned sat
[2023-03-20 23:34:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 23:34:04] [INFO ] [Nat]Absence check using 3 positive place invariants in 24 ms returned sat
[2023-03-20 23:34:04] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 52 ms returned sat
[2023-03-20 23:34:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 23:34:06] [INFO ] [Nat]Absence check using state equation in 1835 ms returned sat
[2023-03-20 23:34:06] [INFO ] State equation strengthened by 1674 read => feed constraints.
[2023-03-20 23:34:07] [INFO ] [Nat]Added 1674 Read/Feed constraints in 465 ms returned sat
[2023-03-20 23:34:07] [INFO ] Deduced a trap composed of 30 places in 294 ms of which 4 ms to minimize.
[2023-03-20 23:34:07] [INFO ] Deduced a trap composed of 25 places in 286 ms of which 1 ms to minimize.
[2023-03-20 23:34:08] [INFO ] Deduced a trap composed of 98 places in 314 ms of which 2 ms to minimize.
[2023-03-20 23:34:08] [INFO ] Deduced a trap composed of 102 places in 214 ms of which 2 ms to minimize.
[2023-03-20 23:34:08] [INFO ] Deduced a trap composed of 143 places in 217 ms of which 1 ms to minimize.
[2023-03-20 23:34:09] [INFO ] Deduced a trap composed of 247 places in 314 ms of which 1 ms to minimize.
[2023-03-20 23:34:09] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2291 ms
[2023-03-20 23:34:09] [INFO ] Computed and/alt/rep : 141/395/141 causal constraints (skipped 1812 transitions) in 313 ms.
[2023-03-20 23:34:09] [INFO ] Added : 0 causal constraints over 0 iterations in 314 ms. Result :unknown
[2023-03-20 23:34:09] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2023-03-20 23:34:09] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 4 ms returned sat
[2023-03-20 23:34:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 23:34:10] [INFO ] [Real]Absence check using state equation in 404 ms returned sat
[2023-03-20 23:34:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 23:34:10] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2023-03-20 23:34:10] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 16 ms returned sat
[2023-03-20 23:34:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 23:34:10] [INFO ] [Nat]Absence check using state equation in 286 ms returned sat
[2023-03-20 23:34:11] [INFO ] [Nat]Added 1674 Read/Feed constraints in 559 ms returned sat
[2023-03-20 23:34:11] [INFO ] Deduced a trap composed of 282 places in 256 ms of which 1 ms to minimize.
[2023-03-20 23:34:11] [INFO ] Deduced a trap composed of 25 places in 285 ms of which 13 ms to minimize.
[2023-03-20 23:34:12] [INFO ] Deduced a trap composed of 141 places in 136 ms of which 1 ms to minimize.
[2023-03-20 23:34:12] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 920 ms
[2023-03-20 23:34:12] [INFO ] Computed and/alt/rep : 141/395/141 causal constraints (skipped 1812 transitions) in 233 ms.
[2023-03-20 23:34:13] [INFO ] Added : 19 causal constraints over 4 iterations in 1152 ms. Result :sat
Minimization took 518 ms.
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
Support contains 2 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.5 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 118 places :
Symmetric choice reduction at 1 with 118 rule applications. Total rules 949 place count 270 transition count 373
Iterating global reduction 1 with 118 rules applied. Total rules applied 1067 place count 270 transition count 373
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 1077 place count 270 transition count 363
Discarding 91 places :
Symmetric choice reduction at 2 with 91 rule applications. Total rules 1168 place count 179 transition count 272
Iterating global reduction 2 with 91 rules applied. Total rules applied 1259 place count 179 transition count 272
Ensure Unique test removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Iterating post reduction 2 with 34 rules applied. Total rules applied 1293 place count 179 transition count 238
Discarding 39 places :
Symmetric choice reduction at 3 with 39 rule applications. Total rules 1332 place count 140 transition count 184
Iterating global reduction 3 with 39 rules applied. Total rules applied 1371 place count 140 transition count 184
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 3 with 24 rules applied. Total rules applied 1395 place count 140 transition count 160
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 1404 place count 131 transition count 147
Iterating global reduction 4 with 9 rules applied. Total rules applied 1413 place count 131 transition count 147
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 1422 place count 122 transition count 138
Iterating global reduction 4 with 9 rules applied. Total rules applied 1431 place count 122 transition count 138
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 1436 place count 117 transition count 132
Iterating global reduction 4 with 5 rules applied. Total rules applied 1441 place count 117 transition count 132
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1443 place count 117 transition count 130
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 1448 place count 112 transition count 125
Iterating global reduction 5 with 5 rules applied. Total rules applied 1453 place count 112 transition count 125
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 1456 place count 109 transition count 122
Iterating global reduction 5 with 3 rules applied. Total rules applied 1459 place count 109 transition count 122
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1460 place count 108 transition count 121
Iterating global reduction 5 with 1 rules applied. Total rules applied 1461 place count 108 transition count 121
Applied a total of 1461 rules in 211 ms. Remains 108 /414 variables (removed 306) and now considering 121/1954 (removed 1833) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 213 ms. Remains : 108/414 places, 121/1954 transitions.
// Phase 1: matrix 121 rows 108 cols
[2023-03-20 23:34:14] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 224477 resets, run finished after 1116 ms. (steps per millisecond=896 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 103000 resets, run finished after 643 ms. (steps per millisecond=1555 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 103282 resets, run finished after 587 ms. (steps per millisecond=1703 ) properties (out of 2) seen :0
[2023-03-20 23:34:16] [INFO ] Invariant cache hit.
[2023-03-20 23:34:16] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-20 23:34:16] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 23:34:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 23:34:16] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2023-03-20 23:34:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 23:34:16] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 23:34:16] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 23:34:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 23:34:16] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2023-03-20 23:34:16] [INFO ] State equation strengthened by 45 read => feed constraints.
[2023-03-20 23:34:16] [INFO ] [Nat]Added 45 Read/Feed constraints in 9 ms returned sat
[2023-03-20 23:34:16] [INFO ] Deduced a trap composed of 16 places in 87 ms of which 1 ms to minimize.
[2023-03-20 23:34:16] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 1 ms to minimize.
[2023-03-20 23:34:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 157 ms
[2023-03-20 23:34:17] [INFO ] Computed and/alt/rep : 29/75/29 causal constraints (skipped 91 transitions) in 8 ms.
[2023-03-20 23:34:17] [INFO ] Added : 22 causal constraints over 5 iterations in 80 ms. Result :sat
Minimization took 27 ms.
[2023-03-20 23:34:17] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 23:34:17] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 23:34:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 23:34:17] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2023-03-20 23:34:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 23:34:17] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 23:34:17] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 23:34:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 23:34:17] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2023-03-20 23:34:17] [INFO ] [Nat]Added 45 Read/Feed constraints in 11 ms returned sat
[2023-03-20 23:34:17] [INFO ] Computed and/alt/rep : 29/75/29 causal constraints (skipped 91 transitions) in 11 ms.
[2023-03-20 23:34:17] [INFO ] Added : 20 causal constraints over 4 iterations in 67 ms. Result :sat
Minimization took 29 ms.
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
Support contains 2 out of 108 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 108/108 places, 121/121 transitions.
Applied a total of 0 rules in 8 ms. Remains 108 /108 variables (removed 0) and now considering 121/121 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 108/108 places, 121/121 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 108/108 places, 121/121 transitions.
Applied a total of 0 rules in 15 ms. Remains 108 /108 variables (removed 0) and now considering 121/121 (removed 0) transitions.
[2023-03-20 23:34:17] [INFO ] Invariant cache hit.
[2023-03-20 23:34:17] [INFO ] Implicit Places using invariants in 110 ms returned []
[2023-03-20 23:34:17] [INFO ] Invariant cache hit.
[2023-03-20 23:34:17] [INFO ] State equation strengthened by 45 read => feed constraints.
[2023-03-20 23:34:17] [INFO ] Implicit Places using invariants and state equation in 331 ms returned []
Implicit Place search using SMT with State Equation took 457 ms to find 0 implicit places.
[2023-03-20 23:34:17] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-20 23:34:17] [INFO ] Invariant cache hit.
[2023-03-20 23:34:18] [INFO ] Dead Transitions using invariants and state equation in 94 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 592 ms. Remains : 108/108 places, 121/121 transitions.
Starting property specific reduction for SieveSingleMsgMbox-PT-d2m04-UpperBounds-12
[2023-03-20 23:34:18] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 2248 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 1063 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
[2023-03-20 23:34:18] [INFO ] Invariant cache hit.
[2023-03-20 23:34:18] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-20 23:34:18] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 23:34:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 23:34:18] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2023-03-20 23:34:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 23:34:18] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-20 23:34:18] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 23:34:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 23:34:18] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2023-03-20 23:34:18] [INFO ] State equation strengthened by 45 read => feed constraints.
[2023-03-20 23:34:18] [INFO ] [Nat]Added 45 Read/Feed constraints in 8 ms returned sat
[2023-03-20 23:34:18] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
[2023-03-20 23:34:18] [INFO ] Deduced a trap composed of 32 places in 25 ms of which 0 ms to minimize.
[2023-03-20 23:34:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 114 ms
[2023-03-20 23:34:18] [INFO ] Computed and/alt/rep : 29/75/29 causal constraints (skipped 91 transitions) in 8 ms.
[2023-03-20 23:34:18] [INFO ] Added : 22 causal constraints over 5 iterations in 100 ms. Result :sat
Minimization took 19 ms.
Current structural bounds on expressions (after SMT) : [4] Max seen :[0]
Support contains 1 out of 108 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 108/108 places, 121/121 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 107 transition count 120
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 107 transition count 120
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 106 transition count 119
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 106 transition count 119
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 106 transition count 118
Applied a total of 5 rules in 15 ms. Remains 106 /108 variables (removed 2) and now considering 118/121 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 106/108 places, 118/121 transitions.
// Phase 1: matrix 118 rows 106 cols
[2023-03-20 23:34:18] [INFO ] Computed 4 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 223889 resets, run finished after 940 ms. (steps per millisecond=1063 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 103691 resets, run finished after 439 ms. (steps per millisecond=2277 ) properties (out of 1) seen :0
[2023-03-20 23:34:19] [INFO ] Invariant cache hit.
[2023-03-20 23:34:20] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 23:34:20] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 23:34:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 23:34:20] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2023-03-20 23:34:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 23:34:20] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 23:34:20] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 23:34:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 23:34:20] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2023-03-20 23:34:20] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-03-20 23:34:20] [INFO ] [Nat]Added 44 Read/Feed constraints in 22 ms returned sat
[2023-03-20 23:34:20] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 1 ms to minimize.
[2023-03-20 23:34:20] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 0 ms to minimize.
[2023-03-20 23:34:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 155 ms
[2023-03-20 23:34:20] [INFO ] Computed and/alt/rep : 28/74/28 causal constraints (skipped 89 transitions) in 10 ms.
[2023-03-20 23:34:20] [INFO ] Added : 20 causal constraints over 5 iterations in 56 ms. Result :sat
Minimization took 18 ms.
Current structural bounds on expressions (after SMT) : [4] Max seen :[0]
Support contains 1 out of 106 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 106/106 places, 118/118 transitions.
Applied a total of 0 rules in 5 ms. Remains 106 /106 variables (removed 0) and now considering 118/118 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 106/106 places, 118/118 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 106/106 places, 118/118 transitions.
Applied a total of 0 rules in 7 ms. Remains 106 /106 variables (removed 0) and now considering 118/118 (removed 0) transitions.
[2023-03-20 23:34:20] [INFO ] Invariant cache hit.
[2023-03-20 23:34:20] [INFO ] Implicit Places using invariants in 149 ms returned []
[2023-03-20 23:34:20] [INFO ] Invariant cache hit.
[2023-03-20 23:34:20] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-03-20 23:34:20] [INFO ] Implicit Places using invariants and state equation in 194 ms returned []
Implicit Place search using SMT with State Equation took 370 ms to find 0 implicit places.
[2023-03-20 23:34:20] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-20 23:34:20] [INFO ] Invariant cache hit.
[2023-03-20 23:34:20] [INFO ] Dead Transitions using invariants and state equation in 89 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 485 ms. Remains : 106/106 places, 118/118 transitions.
Ending property specific reduction for SieveSingleMsgMbox-PT-d2m04-UpperBounds-12 in 2831 ms.
Starting property specific reduction for SieveSingleMsgMbox-PT-d2m04-UpperBounds-15
// Phase 1: matrix 121 rows 108 cols
[2023-03-20 23:34:20] [INFO ] Computed 4 place invariants in 5 ms
Incomplete random walk after 10000 steps, including 2210 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 983 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
[2023-03-20 23:34:20] [INFO ] Invariant cache hit.
[2023-03-20 23:34:20] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-20 23:34:20] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 23:34:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 23:34:21] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2023-03-20 23:34:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 23:34:21] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-20 23:34:21] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 23:34:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 23:34:21] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2023-03-20 23:34:21] [INFO ] State equation strengthened by 45 read => feed constraints.
[2023-03-20 23:34:21] [INFO ] [Nat]Added 45 Read/Feed constraints in 21 ms returned sat
[2023-03-20 23:34:21] [INFO ] Computed and/alt/rep : 29/75/29 causal constraints (skipped 91 transitions) in 11 ms.
[2023-03-20 23:34:21] [INFO ] Added : 20 causal constraints over 4 iterations in 92 ms. Result :sat
Minimization took 33 ms.
Current structural bounds on expressions (after SMT) : [19] Max seen :[0]
Support contains 1 out of 108 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 108/108 places, 121/121 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 107 transition count 120
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 107 transition count 120
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 107 transition count 119
Applied a total of 3 rules in 7 ms. Remains 107 /108 variables (removed 1) and now considering 119/121 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 107/108 places, 119/121 transitions.
// Phase 1: matrix 119 rows 107 cols
[2023-03-20 23:34:21] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 224164 resets, run finished after 823 ms. (steps per millisecond=1215 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 103219 resets, run finished after 427 ms. (steps per millisecond=2341 ) properties (out of 1) seen :0
[2023-03-20 23:34:22] [INFO ] Invariant cache hit.
[2023-03-20 23:34:22] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-20 23:34:22] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-20 23:34:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 23:34:22] [INFO ] [Real]Absence check using state equation in 90 ms returned sat
[2023-03-20 23:34:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 23:34:22] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-20 23:34:22] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-20 23:34:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 23:34:22] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2023-03-20 23:34:22] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-03-20 23:34:22] [INFO ] [Nat]Added 44 Read/Feed constraints in 10 ms returned sat
[2023-03-20 23:34:22] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints (skipped 89 transitions) in 8 ms.
[2023-03-20 23:34:22] [INFO ] Added : 19 causal constraints over 5 iterations in 86 ms. Result :sat
Minimization took 28 ms.
Current structural bounds on expressions (after SMT) : [19] Max seen :[0]
Support contains 1 out of 107 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 107/107 places, 119/119 transitions.
Applied a total of 0 rules in 6 ms. Remains 107 /107 variables (removed 0) and now considering 119/119 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 107/107 places, 119/119 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 107/107 places, 119/119 transitions.
Applied a total of 0 rules in 3 ms. Remains 107 /107 variables (removed 0) and now considering 119/119 (removed 0) transitions.
[2023-03-20 23:34:22] [INFO ] Invariant cache hit.
[2023-03-20 23:34:23] [INFO ] Implicit Places using invariants in 153 ms returned []
[2023-03-20 23:34:23] [INFO ] Invariant cache hit.
[2023-03-20 23:34:23] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-03-20 23:34:23] [INFO ] Implicit Places using invariants and state equation in 210 ms returned []
Implicit Place search using SMT with State Equation took 375 ms to find 0 implicit places.
[2023-03-20 23:34:23] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-20 23:34:23] [INFO ] Invariant cache hit.
[2023-03-20 23:34:23] [INFO ] Dead Transitions using invariants and state equation in 117 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 506 ms. Remains : 107/107 places, 119/119 transitions.
Ending property specific reduction for SieveSingleMsgMbox-PT-d2m04-UpperBounds-15 in 2594 ms.
[2023-03-20 23:34:23] [INFO ] Flatten gal took : 50 ms
[2023-03-20 23:34:23] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/UpperBounds.sr.xml took 3 ms.
[2023-03-20 23:34:23] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 108 places, 121 transitions and 482 arcs took 2 ms.
Total runtime 21160 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_d2m04
(NrP: 108 NrTr: 121 NrArc: 482)

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

net check time: 0m 0.000sec

init dd package: 0m 3.349sec


RS generation: 0m 0.079sec


-> reachability set: #nodes 1869 (1.9e+03) #states 924



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

checking: place_bound(p50)
normalized: place_bound(p50)

-> the formula is 0

FORMULA SieveSingleMsgMbox-PT-d2m04-UpperBounds-12 0 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(p10)
normalized: place_bound(p10)

-> the formula is 0

FORMULA SieveSingleMsgMbox-PT-d2m04-UpperBounds-15 0 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

totally nodes used: 15272 (1.5e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 65644 412369 478013
used/not used/entry size/cache size: 417003 66691861 16 1024MB
basic ops cache: hits/miss/sum: 5 5839 5844
used/not used/entry size/cache size: 17486 16759730 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: 150 1869 2019
used/not used/entry size/cache size: 1869 8386739 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 67093649
1 15159
2 55
3 1
4 0
5 0
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 5.720sec


BK_STOP 1679355269947

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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


iterations count:6892 (56), effective:138 (1)

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

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