About the Execution of Marcie+red for SieveSingleMsgMbox-PT-d1m04
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 5447.544 | 29261.00 | 46259.00 | 75.50 | 0 0 0 0 1 0 0 0 1 0 0 0 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-167905978900405.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-d1m04, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r426-tajo-167905978900405
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 904K
-rw-r--r-- 1 mcc users 7.2K Feb 26 10:32 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Feb 26 10:32 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 26 10:31 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Feb 26 10:31 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 17:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 17:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 17:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 10:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 128K Feb 26 10:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 10:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 92K Feb 26 10:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 17:05 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:05 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 450K 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-d1m04-UpperBounds-00
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-UpperBounds-01
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-UpperBounds-02
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-UpperBounds-03
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-UpperBounds-04
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-UpperBounds-05
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-UpperBounds-06
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-UpperBounds-07
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-UpperBounds-08
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-UpperBounds-09
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-UpperBounds-10
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-UpperBounds-11
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-UpperBounds-12
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-UpperBounds-13
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-UpperBounds-14
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1679351829782
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-d1m04
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-20 22:37:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-20 22:37:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 22:37:11] [INFO ] Load time of PNML (sax parser for PT used): 81 ms
[2023-03-20 22:37:11] [INFO ] Transformed 1295 places.
[2023-03-20 22:37:11] [INFO ] Transformed 749 transitions.
[2023-03-20 22:37:11] [INFO ] Parsed PT model containing 1295 places and 749 transitions and 2996 arcs in 140 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
Deduced a syphon composed of 1036 places in 6 ms
Reduce places removed 1036 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d1m04-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m04-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m04-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m04-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m04-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m04-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m04-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m04-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m04-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m04-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m04-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 749 rows 259 cols
[2023-03-20 22:37:11] [INFO ] Computed 6 place invariants in 35 ms
Incomplete random walk after 10000 steps, including 2233 resets, run finished after 148 ms. (steps per millisecond=67 ) properties (out of 5) seen :1
FORMULA SieveSingleMsgMbox-PT-d1m04-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 965 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 967 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 968 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 931 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 4) seen :0
[2023-03-20 22:37:11] [INFO ] Invariant cache hit.
[2023-03-20 22:37:12] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2023-03-20 22:37:12] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-20 22:37:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 22:37:12] [INFO ] [Real]Absence check using state equation in 160 ms returned sat
[2023-03-20 22:37:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 22:37:12] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-20 22:37:12] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-20 22:37:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 22:37:12] [INFO ] [Nat]Absence check using state equation in 167 ms returned sat
[2023-03-20 22:37:12] [INFO ] State equation strengthened by 587 read => feed constraints.
[2023-03-20 22:37:12] [INFO ] [Nat]Added 587 Read/Feed constraints in 193 ms returned sat
[2023-03-20 22:37:13] [INFO ] Deduced a trap composed of 26 places in 178 ms of which 3 ms to minimize.
[2023-03-20 22:37:13] [INFO ] Deduced a trap composed of 38 places in 159 ms of which 1 ms to minimize.
[2023-03-20 22:37:13] [INFO ] Deduced a trap composed of 38 places in 138 ms of which 1 ms to minimize.
[2023-03-20 22:37:13] [INFO ] Deduced a trap composed of 35 places in 158 ms of which 1 ms to minimize.
[2023-03-20 22:37:13] [INFO ] Deduced a trap composed of 56 places in 152 ms of which 0 ms to minimize.
[2023-03-20 22:37:13] [INFO ] Deduced a trap composed of 37 places in 136 ms of which 1 ms to minimize.
[2023-03-20 22:37:14] [INFO ] Deduced a trap composed of 37 places in 144 ms of which 0 ms to minimize.
[2023-03-20 22:37:14] [INFO ] Deduced a trap composed of 33 places in 182 ms of which 1 ms to minimize.
[2023-03-20 22:37:14] [INFO ] Deduced a trap composed of 62 places in 117 ms of which 1 ms to minimize.
[2023-03-20 22:37:14] [INFO ] Deduced a trap composed of 59 places in 110 ms of which 1 ms to minimize.
[2023-03-20 22:37:14] [INFO ] Deduced a trap composed of 33 places in 123 ms of which 1 ms to minimize.
[2023-03-20 22:37:15] [INFO ] Deduced a trap composed of 33 places in 174 ms of which 1 ms to minimize.
[2023-03-20 22:37:15] [INFO ] Deduced a trap composed of 59 places in 163 ms of which 1 ms to minimize.
[2023-03-20 22:37:15] [INFO ] Deduced a trap composed of 62 places in 150 ms of which 1 ms to minimize.
[2023-03-20 22:37:15] [INFO ] Deduced a trap composed of 59 places in 146 ms of which 1 ms to minimize.
[2023-03-20 22:37:16] [INFO ] Deduced a trap composed of 62 places in 99 ms of which 0 ms to minimize.
[2023-03-20 22:37:16] [INFO ] Deduced a trap composed of 62 places in 154 ms of which 0 ms to minimize.
[2023-03-20 22:37:16] [INFO ] Deduced a trap composed of 62 places in 189 ms of which 1 ms to minimize.
[2023-03-20 22:37:17] [INFO ] Trap strengthening (SAT) tested/added 18/18 trap constraints in 4538 ms
[2023-03-20 22:37:17] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2023-03-20 22:37:17] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-20 22:37:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 22:37:17] [INFO ] [Real]Absence check using state equation in 180 ms returned sat
[2023-03-20 22:37:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 22:37:17] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-20 22:37:17] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-20 22:37:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 22:37:17] [INFO ] [Nat]Absence check using state equation in 134 ms returned sat
[2023-03-20 22:37:17] [INFO ] [Nat]Added 587 Read/Feed constraints in 103 ms returned sat
[2023-03-20 22:37:18] [INFO ] Computed and/alt/rep : 82/233/82 causal constraints (skipped 666 transitions) in 150 ms.
[2023-03-20 22:37:18] [INFO ] Added : 5 causal constraints over 1 iterations in 306 ms. Result :sat
Minimization took 78 ms.
[2023-03-20 22:37:18] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-20 22:37:18] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-20 22:37:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 22:37:18] [INFO ] [Real]Absence check using state equation in 128 ms returned sat
[2023-03-20 22:37:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 22:37:18] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-20 22:37:18] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-20 22:37:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 22:37:18] [INFO ] [Nat]Absence check using state equation in 114 ms returned sat
[2023-03-20 22:37:18] [INFO ] [Nat]Added 587 Read/Feed constraints in 102 ms returned sat
[2023-03-20 22:37:19] [INFO ] Deduced a trap composed of 24 places in 126 ms of which 0 ms to minimize.
[2023-03-20 22:37:19] [INFO ] Deduced a trap composed of 22 places in 121 ms of which 1 ms to minimize.
[2023-03-20 22:37:19] [INFO ] Deduced a trap composed of 22 places in 114 ms of which 0 ms to minimize.
[2023-03-20 22:37:19] [INFO ] Deduced a trap composed of 29 places in 105 ms of which 2 ms to minimize.
[2023-03-20 22:37:19] [INFO ] Deduced a trap composed of 106 places in 105 ms of which 1 ms to minimize.
[2023-03-20 22:37:19] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 766 ms
[2023-03-20 22:37:19] [INFO ] Computed and/alt/rep : 82/233/82 causal constraints (skipped 666 transitions) in 74 ms.
[2023-03-20 22:37:20] [INFO ] Added : 18 causal constraints over 4 iterations in 468 ms. Result :sat
Minimization took 210 ms.
[2023-03-20 22:37:20] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-20 22:37:20] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-20 22:37:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 22:37:20] [INFO ] [Real]Absence check using state equation in 124 ms returned sat
[2023-03-20 22:37:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 22:37:20] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-20 22:37:20] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-20 22:37:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 22:37:20] [INFO ] [Nat]Absence check using state equation in 145 ms returned sat
[2023-03-20 22:37:20] [INFO ] [Nat]Added 587 Read/Feed constraints in 105 ms returned sat
[2023-03-20 22:37:20] [INFO ] Computed and/alt/rep : 82/233/82 causal constraints (skipped 666 transitions) in 82 ms.
[2023-03-20 22:37:21] [INFO ] Added : 10 causal constraints over 2 iterations in 252 ms. Result :sat
Minimization took 175 ms.
Current structural bounds on expressions (after SMT) : [29, 1, 1, 31] Max seen :[0, 0, 0, 0]
FORMULA SieveSingleMsgMbox-PT-d1m04-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 3 out of 259 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 259/259 places, 749/749 transitions.
Graph (complete) has 1159 edges and 259 vertex of which 241 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.4 ms
Discarding 18 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 242 transitions.
Iterating post reduction 0 with 242 rules applied. Total rules applied 243 place count 241 transition count 507
Discarding 61 places :
Symmetric choice reduction at 1 with 61 rule applications. Total rules 304 place count 180 transition count 230
Iterating global reduction 1 with 61 rules applied. Total rules applied 365 place count 180 transition count 230
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 371 place count 180 transition count 224
Discarding 43 places :
Symmetric choice reduction at 2 with 43 rule applications. Total rules 414 place count 137 transition count 181
Iterating global reduction 2 with 43 rules applied. Total rules applied 457 place count 137 transition count 181
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 2 with 15 rules applied. Total rules applied 472 place count 137 transition count 166
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 498 place count 111 transition count 138
Iterating global reduction 3 with 26 rules applied. Total rules applied 524 place count 111 transition count 138
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 3 with 15 rules applied. Total rules applied 539 place count 111 transition count 123
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 546 place count 104 transition count 114
Iterating global reduction 4 with 7 rules applied. Total rules applied 553 place count 104 transition count 114
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 560 place count 97 transition count 107
Iterating global reduction 4 with 7 rules applied. Total rules applied 567 place count 97 transition count 107
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 571 place count 93 transition count 102
Iterating global reduction 4 with 4 rules applied. Total rules applied 575 place count 93 transition count 102
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 577 place count 93 transition count 100
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 581 place count 89 transition count 96
Iterating global reduction 5 with 4 rules applied. Total rules applied 585 place count 89 transition count 96
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 587 place count 87 transition count 94
Iterating global reduction 5 with 2 rules applied. Total rules applied 589 place count 87 transition count 94
Applied a total of 589 rules in 127 ms. Remains 87 /259 variables (removed 172) and now considering 94/749 (removed 655) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 128 ms. Remains : 87/259 places, 94/749 transitions.
// Phase 1: matrix 94 rows 87 cols
[2023-03-20 22:37:21] [INFO ] Computed 4 place invariants in 14 ms
Incomplete random walk after 1000000 steps, including 224529 resets, run finished after 1133 ms. (steps per millisecond=882 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 103714 resets, run finished after 597 ms. (steps per millisecond=1675 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000000 steps, including 103477 resets, run finished after 538 ms. (steps per millisecond=1858 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 103121 resets, run finished after 539 ms. (steps per millisecond=1855 ) properties (out of 3) seen :0
[2023-03-20 22:37:24] [INFO ] Invariant cache hit.
[2023-03-20 22:37:24] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-20 22:37:24] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 11 ms returned sat
[2023-03-20 22:37:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 22:37:24] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2023-03-20 22:37:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 22:37:24] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-20 22:37:24] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-20 22:37:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 22:37:24] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2023-03-20 22:37:24] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-20 22:37:24] [INFO ] [Nat]Added 36 Read/Feed constraints in 8 ms returned sat
[2023-03-20 22:37:24] [INFO ] Computed and/alt/rep : 24/54/24 causal constraints (skipped 69 transitions) in 8 ms.
[2023-03-20 22:37:24] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
[2023-03-20 22:37:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 66 ms
[2023-03-20 22:37:24] [INFO ] Added : 16 causal constraints over 4 iterations in 133 ms. Result :sat
Minimization took 21 ms.
[2023-03-20 22:37:24] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-20 22:37:24] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-20 22:37:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 22:37:25] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2023-03-20 22:37:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 22:37:25] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-20 22:37:25] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-20 22:37:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 22:37:25] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2023-03-20 22:37:25] [INFO ] [Nat]Added 36 Read/Feed constraints in 17 ms returned sat
[2023-03-20 22:37:25] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 0 ms to minimize.
[2023-03-20 22:37:25] [INFO ] Deduced a trap composed of 25 places in 25 ms of which 0 ms to minimize.
[2023-03-20 22:37:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 88 ms
[2023-03-20 22:37:25] [INFO ] Computed and/alt/rep : 24/54/24 causal constraints (skipped 69 transitions) in 8 ms.
[2023-03-20 22:37:25] [INFO ] Added : 22 causal constraints over 5 iterations in 74 ms. Result :sat
Minimization took 28 ms.
[2023-03-20 22:37:25] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-20 22:37:25] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-20 22:37:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 22:37:25] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2023-03-20 22:37:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 22:37:25] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-20 22:37:25] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-20 22:37:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 22:37:25] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2023-03-20 22:37:25] [INFO ] [Nat]Added 36 Read/Feed constraints in 8 ms returned sat
[2023-03-20 22:37:25] [INFO ] Computed and/alt/rep : 24/54/24 causal constraints (skipped 69 transitions) in 7 ms.
[2023-03-20 22:37:25] [INFO ] Added : 11 causal constraints over 3 iterations in 33 ms. Result :sat
Minimization took 28 ms.
Current structural bounds on expressions (after SMT) : [29, 1, 4] Max seen :[0, 0, 0]
Support contains 3 out of 87 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 94/94 transitions.
Applied a total of 0 rules in 8 ms. Remains 87 /87 variables (removed 0) and now considering 94/94 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 87/87 places, 94/94 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 94/94 transitions.
Applied a total of 0 rules in 7 ms. Remains 87 /87 variables (removed 0) and now considering 94/94 (removed 0) transitions.
[2023-03-20 22:37:25] [INFO ] Invariant cache hit.
[2023-03-20 22:37:25] [INFO ] Implicit Places using invariants in 86 ms returned []
[2023-03-20 22:37:25] [INFO ] Invariant cache hit.
[2023-03-20 22:37:25] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-20 22:37:25] [INFO ] Implicit Places using invariants and state equation in 158 ms returned []
Implicit Place search using SMT with State Equation took 249 ms to find 0 implicit places.
[2023-03-20 22:37:25] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-20 22:37:25] [INFO ] Invariant cache hit.
[2023-03-20 22:37:25] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 345 ms. Remains : 87/87 places, 94/94 transitions.
Starting property specific reduction for SieveSingleMsgMbox-PT-d1m04-UpperBounds-01
[2023-03-20 22:37:25] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 2243 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 1030 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
[2023-03-20 22:37:25] [INFO ] Invariant cache hit.
[2023-03-20 22:37:25] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-20 22:37:25] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-20 22:37:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 22:37:26] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2023-03-20 22:37:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 22:37:26] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-20 22:37:26] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-20 22:37:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 22:37:26] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2023-03-20 22:37:26] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-20 22:37:26] [INFO ] [Nat]Added 36 Read/Feed constraints in 8 ms returned sat
[2023-03-20 22:37:26] [INFO ] Computed and/alt/rep : 24/54/24 causal constraints (skipped 69 transitions) in 7 ms.
[2023-03-20 22:37:26] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 0 ms to minimize.
[2023-03-20 22:37:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 71 ms
[2023-03-20 22:37:26] [INFO ] Added : 16 causal constraints over 4 iterations in 123 ms. Result :sat
Minimization took 34 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 87 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 94/94 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 86 transition count 93
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 86 transition count 93
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 86 transition count 92
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 85 transition count 90
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 85 transition count 90
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 84 transition count 89
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 84 transition count 89
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 83 transition count 88
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 83 transition count 88
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 82 transition count 87
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 82 transition count 87
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 81 transition count 86
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 81 transition count 86
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 80 transition count 84
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 80 transition count 84
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 79 transition count 83
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 79 transition count 83
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 78 transition count 82
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 78 transition count 82
Applied a total of 19 rules in 26 ms. Remains 78 /87 variables (removed 9) and now considering 82/94 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 78/87 places, 82/94 transitions.
// Phase 1: matrix 82 rows 78 cols
[2023-03-20 22:37:26] [INFO ] Computed 4 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 224436 resets, run finished after 874 ms. (steps per millisecond=1144 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 103261 resets, run finished after 332 ms. (steps per millisecond=3012 ) properties (out of 1) seen :0
[2023-03-20 22:37:27] [INFO ] Invariant cache hit.
[2023-03-20 22:37:27] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-20 22:37:27] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 22:37:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 22:37:27] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2023-03-20 22:37:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 22:37:27] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 22:37:27] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 22:37:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 22:37:27] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2023-03-20 22:37:27] [INFO ] State equation strengthened by 31 read => feed constraints.
[2023-03-20 22:37:27] [INFO ] [Nat]Added 31 Read/Feed constraints in 10 ms returned sat
[2023-03-20 22:37:27] [INFO ] Computed and/alt/rep : 21/46/21 causal constraints (skipped 60 transitions) in 6 ms.
[2023-03-20 22:37:27] [INFO ] Deduced a trap composed of 11 places in 66 ms of which 1 ms to minimize.
[2023-03-20 22:37:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 79 ms
[2023-03-20 22:37:27] [INFO ] Added : 14 causal constraints over 3 iterations in 127 ms. Result :sat
Minimization took 19 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 78 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 78/78 places, 82/82 transitions.
Applied a total of 0 rules in 8 ms. Remains 78 /78 variables (removed 0) and now considering 82/82 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 78/78 places, 82/82 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 78/78 places, 82/82 transitions.
Applied a total of 0 rules in 6 ms. Remains 78 /78 variables (removed 0) and now considering 82/82 (removed 0) transitions.
[2023-03-20 22:37:27] [INFO ] Invariant cache hit.
[2023-03-20 22:37:27] [INFO ] Implicit Places using invariants in 61 ms returned []
[2023-03-20 22:37:27] [INFO ] Invariant cache hit.
[2023-03-20 22:37:27] [INFO ] State equation strengthened by 31 read => feed constraints.
[2023-03-20 22:37:28] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 218 ms to find 0 implicit places.
[2023-03-20 22:37:28] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-20 22:37:28] [INFO ] Invariant cache hit.
[2023-03-20 22:37:28] [INFO ] Dead Transitions using invariants and state equation in 84 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 317 ms. Remains : 78/78 places, 82/82 transitions.
Ending property specific reduction for SieveSingleMsgMbox-PT-d1m04-UpperBounds-01 in 2224 ms.
Starting property specific reduction for SieveSingleMsgMbox-PT-d1m04-UpperBounds-05
// Phase 1: matrix 94 rows 87 cols
[2023-03-20 22:37:28] [INFO ] Computed 4 place invariants in 2 ms
Incomplete random walk after 10000 steps, including 2256 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 1041 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
[2023-03-20 22:37:28] [INFO ] Invariant cache hit.
[2023-03-20 22:37:28] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-20 22:37:28] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-20 22:37:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 22:37:28] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2023-03-20 22:37:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 22:37:28] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-20 22:37:28] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-20 22:37:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 22:37:28] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2023-03-20 22:37:28] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-20 22:37:28] [INFO ] [Nat]Added 36 Read/Feed constraints in 9 ms returned sat
[2023-03-20 22:37:28] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 1 ms to minimize.
[2023-03-20 22:37:28] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 0 ms to minimize.
[2023-03-20 22:37:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 107 ms
[2023-03-20 22:37:28] [INFO ] Computed and/alt/rep : 24/54/24 causal constraints (skipped 69 transitions) in 7 ms.
[2023-03-20 22:37:28] [INFO ] Added : 22 causal constraints over 5 iterations in 66 ms. Result :sat
Minimization took 27 ms.
Current structural bounds on expressions (after SMT) : [4] Max seen :[0]
Support contains 1 out of 87 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 94/94 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 86 transition count 93
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 86 transition count 93
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 85 transition count 92
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 85 transition count 92
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 85 transition count 91
Applied a total of 5 rules in 11 ms. Remains 85 /87 variables (removed 2) and now considering 91/94 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 85/87 places, 91/94 transitions.
// Phase 1: matrix 91 rows 85 cols
[2023-03-20 22:37:28] [INFO ] Computed 4 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 224092 resets, run finished after 871 ms. (steps per millisecond=1148 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 103410 resets, run finished after 362 ms. (steps per millisecond=2762 ) properties (out of 1) seen :0
[2023-03-20 22:37:29] [INFO ] Invariant cache hit.
[2023-03-20 22:37:29] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-20 22:37:29] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-20 22:37:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 22:37:29] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2023-03-20 22:37:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 22:37:29] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-20 22:37:29] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-20 22:37:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 22:37:29] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2023-03-20 22:37:29] [INFO ] State equation strengthened by 35 read => feed constraints.
[2023-03-20 22:37:30] [INFO ] [Nat]Added 35 Read/Feed constraints in 9 ms returned sat
[2023-03-20 22:37:30] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 0 ms to minimize.
[2023-03-20 22:37:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 69 ms
[2023-03-20 22:37:30] [INFO ] Computed and/alt/rep : 23/52/23 causal constraints (skipped 67 transitions) in 8 ms.
[2023-03-20 22:37:30] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 0 ms to minimize.
[2023-03-20 22:37:30] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 0 ms to minimize.
[2023-03-20 22:37:30] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 1 ms to minimize.
[2023-03-20 22:37:30] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 184 ms
[2023-03-20 22:37:30] [INFO ] Added : 21 causal constraints over 5 iterations in 259 ms. Result :sat
Minimization took 33 ms.
Current structural bounds on expressions (after SMT) : [4] Max seen :[0]
Support contains 1 out of 85 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 91/91 transitions.
Applied a total of 0 rules in 8 ms. Remains 85 /85 variables (removed 0) and now considering 91/91 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 85/85 places, 91/91 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 91/91 transitions.
Applied a total of 0 rules in 8 ms. Remains 85 /85 variables (removed 0) and now considering 91/91 (removed 0) transitions.
[2023-03-20 22:37:30] [INFO ] Invariant cache hit.
[2023-03-20 22:37:30] [INFO ] Implicit Places using invariants in 83 ms returned []
[2023-03-20 22:37:30] [INFO ] Invariant cache hit.
[2023-03-20 22:37:30] [INFO ] State equation strengthened by 35 read => feed constraints.
[2023-03-20 22:37:30] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 234 ms to find 0 implicit places.
[2023-03-20 22:37:30] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-20 22:37:30] [INFO ] Invariant cache hit.
[2023-03-20 22:37:30] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 307 ms. Remains : 85/85 places, 91/91 transitions.
Ending property specific reduction for SieveSingleMsgMbox-PT-d1m04-UpperBounds-05 in 2559 ms.
Starting property specific reduction for SieveSingleMsgMbox-PT-d1m04-UpperBounds-08
// Phase 1: matrix 94 rows 87 cols
[2023-03-20 22:37:30] [INFO ] Computed 4 place invariants in 2 ms
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 10000 steps, including 1021 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
[2023-03-20 22:37:30] [INFO ] Invariant cache hit.
[2023-03-20 22:37:30] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-20 22:37:30] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-20 22:37:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 22:37:30] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2023-03-20 22:37:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 22:37:30] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-20 22:37:30] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-20 22:37:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 22:37:30] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2023-03-20 22:37:30] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-20 22:37:30] [INFO ] [Nat]Added 36 Read/Feed constraints in 9 ms returned sat
[2023-03-20 22:37:30] [INFO ] Computed and/alt/rep : 24/54/24 causal constraints (skipped 69 transitions) in 8 ms.
[2023-03-20 22:37:30] [INFO ] Added : 11 causal constraints over 3 iterations in 35 ms. Result :sat
Minimization took 28 ms.
Current structural bounds on expressions (after SMT) : [4] Max seen :[0]
Support contains 1 out of 87 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 94/94 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 85 transition count 92
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 85 transition count 92
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 85 transition count 91
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 7 place count 83 transition count 88
Iterating global reduction 1 with 2 rules applied. Total rules applied 9 place count 83 transition count 88
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 10 place count 83 transition count 87
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 11 place count 82 transition count 86
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 82 transition count 86
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 13 place count 81 transition count 85
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 81 transition count 85
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 15 place count 80 transition count 84
Iterating global reduction 2 with 1 rules applied. Total rules applied 16 place count 80 transition count 84
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 17 place count 79 transition count 83
Iterating global reduction 2 with 1 rules applied. Total rules applied 18 place count 79 transition count 83
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 19 place count 78 transition count 81
Iterating global reduction 2 with 1 rules applied. Total rules applied 20 place count 78 transition count 81
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 21 place count 77 transition count 80
Iterating global reduction 2 with 1 rules applied. Total rules applied 22 place count 77 transition count 80
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 23 place count 76 transition count 79
Iterating global reduction 2 with 1 rules applied. Total rules applied 24 place count 76 transition count 79
Applied a total of 24 rules in 43 ms. Remains 76 /87 variables (removed 11) and now considering 79/94 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 76/87 places, 79/94 transitions.
// Phase 1: matrix 79 rows 76 cols
[2023-03-20 22:37:31] [INFO ] Computed 4 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 223879 resets, run finished after 847 ms. (steps per millisecond=1180 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 103838 resets, run finished after 452 ms. (steps per millisecond=2212 ) properties (out of 1) seen :1
[2023-03-20 22:37:32] [INFO ] Invariant cache hit.
[2023-03-20 22:37:32] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-20 22:37:32] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 22:37:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 22:37:32] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2023-03-20 22:37:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 22:37:32] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-20 22:37:32] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 22:37:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 22:37:32] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2023-03-20 22:37:32] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-20 22:37:32] [INFO ] [Nat]Added 30 Read/Feed constraints in 5 ms returned sat
[2023-03-20 22:37:32] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 1 ms to minimize.
[2023-03-20 22:37:32] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 0 ms to minimize.
[2023-03-20 22:37:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 111 ms
Current structural bounds on expressions (after SMT) : [1] Max seen :[1]
FORMULA SieveSingleMsgMbox-PT-d1m04-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Ending property specific reduction for SieveSingleMsgMbox-PT-d1m04-UpperBounds-08 in 1887 ms.
[2023-03-20 22:37:32] [INFO ] Flatten gal took : 38 ms
[2023-03-20 22:37:32] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2023-03-20 22:37:32] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 87 places, 94 transitions and 374 arcs took 1 ms.
Total runtime 21474 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_d1m04
(NrP: 87 NrTr: 94 NrArc: 374)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.001sec
net check time: 0m 0.000sec
init dd package: 0m 3.159sec
RS generation: 0m 0.043sec
-> reachability set: #nodes 1277 (1.3e+03) #states 915
starting MCC model checker
--------------------------
checking: place_bound(p19)
normalized: place_bound(p19)
-> the formula is 0
FORMULA SieveSingleMsgMbox-PT-d1m04-UpperBounds-01 0 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: place_bound(p42)
normalized: place_bound(p42)
-> the formula is 0
FORMULA SieveSingleMsgMbox-PT-d1m04-UpperBounds-05 0 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
totally nodes used: 10279 (1.0e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 42842 240466 283308
used/not used/entry size/cache size: 243927 66864937 16 1024MB
basic ops cache: hits/miss/sum: 6 3809 3815
used/not used/entry size/cache size: 11422 16765794 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: 140 1277 1417
used/not used/entry size/cache size: 1277 8387331 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 67098623
1 10204
2 36
3 1
4 0
5 0
6 0
7 0
8 0
9 0
>= 10 0
Total processing time: 0m 5.997sec
BK_STOP 1679351859043
--------------------
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
iterations count:6473 (68), effective:142 (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-d1m04"
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-d1m04, 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-167905978900405"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/SieveSingleMsgMbox-PT-d1m04.tgz
mv SieveSingleMsgMbox-PT-d1m04 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 '
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 ;