Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r106-tall-167814482500269.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is DBSingleClientW-PT-d1m08, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r106-tall-167814482500269
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 776K
-rw-r--r-- 1 mcc users 7.1K Feb 26 15:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Feb 26 15:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 26 15:35 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 26 15:35 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.3K Feb 26 15:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 42K Feb 26 15:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Feb 26 15:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Feb 26 15:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 432K Mar 5 18:22 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 DBSingleClientW-PT-d1m08-UpperBounds-00
FORMULA_NAME DBSingleClientW-PT-d1m08-UpperBounds-01
FORMULA_NAME DBSingleClientW-PT-d1m08-UpperBounds-02
FORMULA_NAME DBSingleClientW-PT-d1m08-UpperBounds-03
FORMULA_NAME DBSingleClientW-PT-d1m08-UpperBounds-04
FORMULA_NAME DBSingleClientW-PT-d1m08-UpperBounds-05
FORMULA_NAME DBSingleClientW-PT-d1m08-UpperBounds-06
FORMULA_NAME DBSingleClientW-PT-d1m08-UpperBounds-07
FORMULA_NAME DBSingleClientW-PT-d1m08-UpperBounds-08
FORMULA_NAME DBSingleClientW-PT-d1m08-UpperBounds-09
FORMULA_NAME DBSingleClientW-PT-d1m08-UpperBounds-10
FORMULA_NAME DBSingleClientW-PT-d1m08-UpperBounds-11
FORMULA_NAME DBSingleClientW-PT-d1m08-UpperBounds-12
FORMULA_NAME DBSingleClientW-PT-d1m08-UpperBounds-13
FORMULA_NAME DBSingleClientW-PT-d1m08-UpperBounds-14
FORMULA_NAME DBSingleClientW-PT-d1m08-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678355394138

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=DBSingleClientW-PT-d1m08
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-09 09:49:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-09 09:49:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 09:49:55] [INFO ] Load time of PNML (sax parser for PT used): 85 ms
[2023-03-09 09:49:55] [INFO ] Transformed 1440 places.
[2023-03-09 09:49:55] [INFO ] Transformed 672 transitions.
[2023-03-09 09:49:55] [INFO ] Parsed PT model containing 1440 places and 672 transitions and 2688 arcs in 150 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
Deduced a syphon composed of 1093 places in 6 ms
Reduce places removed 1093 places and 0 transitions.
FORMULA DBSingleClientW-PT-d1m08-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m08-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m08-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m08-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m08-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m08-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m08-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m08-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m08-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m08-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 672 rows 347 cols
[2023-03-09 09:49:55] [INFO ] Computed 6 place invariants in 45 ms
Incomplete random walk after 10000 steps, including 2266 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 6) seen :2
Incomplete Best-First random walk after 10000 steps, including 969 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10000 steps, including 974 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 957 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10000 steps, including 980 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 948 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 943 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 6) seen :1
[2023-03-09 09:49:56] [INFO ] Invariant cache hit.
[2023-03-09 09:49:56] [INFO ] [Real]Absence check using 2 positive place invariants in 9 ms returned sat
[2023-03-09 09:49:56] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 8 ms returned sat
[2023-03-09 09:49:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 09:49:56] [INFO ] [Real]Absence check using state equation in 141 ms returned sat
[2023-03-09 09:49:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 09:49:56] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-09 09:49:56] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 5 ms returned sat
[2023-03-09 09:49:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 09:49:56] [INFO ] [Nat]Absence check using state equation in 127 ms returned sat
[2023-03-09 09:49:56] [INFO ] State equation strengthened by 418 read => feed constraints.
[2023-03-09 09:49:56] [INFO ] [Nat]Added 418 Read/Feed constraints in 113 ms returned sat
[2023-03-09 09:49:57] [INFO ] Computed and/alt/rep : 126/406/126 causal constraints (skipped 545 transitions) in 129 ms.
[2023-03-09 09:49:57] [INFO ] Deduced a trap composed of 42 places in 138 ms of which 3 ms to minimize.
[2023-03-09 09:49:57] [INFO ] Deduced a trap composed of 46 places in 129 ms of which 0 ms to minimize.
[2023-03-09 09:49:57] [INFO ] Deduced a trap composed of 32 places in 122 ms of which 1 ms to minimize.
[2023-03-09 09:49:57] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 539 ms
[2023-03-09 09:49:57] [INFO ] Added : 15 causal constraints over 4 iterations in 922 ms. Result :sat
Minimization took 155 ms.
[2023-03-09 09:49:58] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-09 09:49:58] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 4 ms returned sat
[2023-03-09 09:49:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 09:49:58] [INFO ] [Real]Absence check using state equation in 176 ms returned sat
[2023-03-09 09:49:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 09:49:58] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-09 09:49:58] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 8 ms returned sat
[2023-03-09 09:49:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 09:49:58] [INFO ] [Nat]Absence check using state equation in 112 ms returned sat
[2023-03-09 09:49:58] [INFO ] [Nat]Added 418 Read/Feed constraints in 83 ms returned sat
[2023-03-09 09:49:58] [INFO ] Computed and/alt/rep : 126/406/126 causal constraints (skipped 545 transitions) in 66 ms.
[2023-03-09 09:49:59] [INFO ] Deduced a trap composed of 32 places in 151 ms of which 2 ms to minimize.
[2023-03-09 09:49:59] [INFO ] Deduced a trap composed of 49 places in 131 ms of which 1 ms to minimize.
[2023-03-09 09:49:59] [INFO ] Deduced a trap composed of 39 places in 129 ms of which 1 ms to minimize.
[2023-03-09 09:49:59] [INFO ] Deduced a trap composed of 29 places in 180 ms of which 9 ms to minimize.
[2023-03-09 09:49:59] [INFO ] Deduced a trap composed of 29 places in 128 ms of which 4 ms to minimize.
[2023-03-09 09:50:00] [INFO ] Deduced a trap composed of 47 places in 127 ms of which 1 ms to minimize.
[2023-03-09 09:50:00] [INFO ] Deduced a trap composed of 47 places in 131 ms of which 1 ms to minimize.
[2023-03-09 09:50:00] [INFO ] Deduced a trap composed of 40 places in 125 ms of which 0 ms to minimize.
[2023-03-09 09:50:00] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1619 ms
[2023-03-09 09:50:00] [INFO ] Added : 26 causal constraints over 6 iterations in 2075 ms. Result :sat
Minimization took 148 ms.
[2023-03-09 09:50:00] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-09 09:50:00] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 10 ms returned sat
[2023-03-09 09:50:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 09:50:01] [INFO ] [Real]Absence check using state equation in 116 ms returned sat
[2023-03-09 09:50:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 09:50:01] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-09 09:50:01] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 4 ms returned sat
[2023-03-09 09:50:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 09:50:01] [INFO ] [Nat]Absence check using state equation in 115 ms returned sat
[2023-03-09 09:50:01] [INFO ] [Nat]Added 418 Read/Feed constraints in 75 ms returned sat
[2023-03-09 09:50:01] [INFO ] Deduced a trap composed of 100 places in 156 ms of which 1 ms to minimize.
[2023-03-09 09:50:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 209 ms
[2023-03-09 09:50:01] [INFO ] Computed and/alt/rep : 126/406/126 causal constraints (skipped 545 transitions) in 67 ms.
[2023-03-09 09:50:01] [INFO ] Deduced a trap composed of 31 places in 127 ms of which 1 ms to minimize.
[2023-03-09 09:50:02] [INFO ] Deduced a trap composed of 22 places in 141 ms of which 0 ms to minimize.
[2023-03-09 09:50:02] [INFO ] Deduced a trap composed of 23 places in 142 ms of which 1 ms to minimize.
[2023-03-09 09:50:02] [INFO ] Deduced a trap composed of 30 places in 136 ms of which 1 ms to minimize.
[2023-03-09 09:50:02] [INFO ] Deduced a trap composed of 30 places in 118 ms of which 0 ms to minimize.
[2023-03-09 09:50:02] [INFO ] Deduced a trap composed of 30 places in 147 ms of which 1 ms to minimize.
[2023-03-09 09:50:03] [INFO ] Deduced a trap composed of 97 places in 121 ms of which 0 ms to minimize.
[2023-03-09 09:50:03] [INFO ] Deduced a trap composed of 26 places in 180 ms of which 0 ms to minimize.
[2023-03-09 09:50:03] [INFO ] Deduced a trap composed of 101 places in 127 ms of which 0 ms to minimize.
[2023-03-09 09:50:03] [INFO ] Deduced a trap composed of 23 places in 154 ms of which 1 ms to minimize.
[2023-03-09 09:50:03] [INFO ] Deduced a trap composed of 30 places in 150 ms of which 0 ms to minimize.
[2023-03-09 09:50:04] [INFO ] Deduced a trap composed of 30 places in 132 ms of which 0 ms to minimize.
[2023-03-09 09:50:04] [INFO ] Deduced a trap composed of 30 places in 130 ms of which 0 ms to minimize.
[2023-03-09 09:50:04] [INFO ] Deduced a trap composed of 23 places in 131 ms of which 0 ms to minimize.
[2023-03-09 09:50:04] [INFO ] Deduced a trap composed of 30 places in 130 ms of which 0 ms to minimize.
[2023-03-09 09:50:04] [INFO ] Deduced a trap composed of 30 places in 128 ms of which 1 ms to minimize.
[2023-03-09 09:50:05] [INFO ] Deduced a trap composed of 50 places in 131 ms of which 3 ms to minimize.
[2023-03-09 09:50:05] [INFO ] Deduced a trap composed of 50 places in 132 ms of which 1 ms to minimize.
[2023-03-09 09:50:05] [INFO ] Deduced a trap composed of 54 places in 119 ms of which 0 ms to minimize.
[2023-03-09 09:50:05] [INFO ] Deduced a trap composed of 29 places in 119 ms of which 0 ms to minimize.
[2023-03-09 09:50:05] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 3820 ms
[2023-03-09 09:50:05] [INFO ] Added : 31 causal constraints over 8 iterations in 4380 ms. Result :sat
Minimization took 165 ms.
[2023-03-09 09:50:06] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-09 09:50:06] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 3 ms returned sat
[2023-03-09 09:50:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 09:50:06] [INFO ] [Real]Absence check using state equation in 114 ms returned sat
[2023-03-09 09:50:06] [INFO ] [Real]Added 418 Read/Feed constraints in 79 ms returned sat
[2023-03-09 09:50:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 09:50:06] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-09 09:50:06] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 3 ms returned sat
[2023-03-09 09:50:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 09:50:06] [INFO ] [Nat]Absence check using state equation in 144 ms returned sat
[2023-03-09 09:50:06] [INFO ] [Nat]Added 418 Read/Feed constraints in 59 ms returned sat
[2023-03-09 09:50:06] [INFO ] Computed and/alt/rep : 126/406/126 causal constraints (skipped 545 transitions) in 55 ms.
[2023-03-09 09:50:06] [INFO ] Added : 2 causal constraints over 1 iterations in 140 ms. Result :sat
Minimization took 103 ms.
[2023-03-09 09:50:06] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-09 09:50:06] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 4 ms returned sat
[2023-03-09 09:50:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 09:50:07] [INFO ] [Real]Absence check using state equation in 146 ms returned sat
[2023-03-09 09:50:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 09:50:07] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-09 09:50:07] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 4 ms returned sat
[2023-03-09 09:50:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 09:50:07] [INFO ] [Nat]Absence check using state equation in 159 ms returned sat
[2023-03-09 09:50:07] [INFO ] [Nat]Added 418 Read/Feed constraints in 62 ms returned sat
[2023-03-09 09:50:07] [INFO ] Computed and/alt/rep : 126/406/126 causal constraints (skipped 545 transitions) in 57 ms.
[2023-03-09 09:50:07] [INFO ] Added : 6 causal constraints over 2 iterations in 196 ms. Result :sat
Minimization took 330 ms.
[2023-03-09 09:50:08] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-09 09:50:08] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 3 ms returned unsat
Current structural bounds on expressions (after SMT) : [8, 8, 8, 4, 8, 1] Max seen :[0, 0, 0, 1, 0, 1]
FORMULA DBSingleClientW-PT-d1m08-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 5 out of 347 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 347/347 places, 672/672 transitions.
Graph (complete) has 1246 edges and 347 vertex of which 325 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.2 ms
Discarding 22 places :
Also discarding 0 output transitions
Drop transitions removed 8 transitions
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 88 transitions.
Iterating post reduction 0 with 88 rules applied. Total rules applied 89 place count 325 transition count 584
Discarding 93 places :
Symmetric choice reduction at 1 with 93 rule applications. Total rules 182 place count 232 transition count 344
Iterating global reduction 1 with 93 rules applied. Total rules applied 275 place count 232 transition count 344
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 287 place count 232 transition count 332
Discarding 71 places :
Symmetric choice reduction at 2 with 71 rule applications. Total rules 358 place count 161 transition count 261
Iterating global reduction 2 with 71 rules applied. Total rules applied 429 place count 161 transition count 261
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 435 place count 161 transition count 255
Discarding 39 places :
Symmetric choice reduction at 3 with 39 rule applications. Total rules 474 place count 122 transition count 195
Iterating global reduction 3 with 39 rules applied. Total rules applied 513 place count 122 transition count 195
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 3 with 22 rules applied. Total rules applied 535 place count 122 transition count 173
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 545 place count 112 transition count 156
Iterating global reduction 4 with 10 rules applied. Total rules applied 555 place count 112 transition count 156
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 558 place count 112 transition count 153
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 564 place count 106 transition count 147
Iterating global reduction 5 with 6 rules applied. Total rules applied 570 place count 106 transition count 147
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 572 place count 106 transition count 145
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 577 place count 101 transition count 140
Iterating global reduction 6 with 5 rules applied. Total rules applied 582 place count 101 transition count 140
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 584 place count 99 transition count 132
Iterating global reduction 6 with 2 rules applied. Total rules applied 586 place count 99 transition count 132
Applied a total of 586 rules in 83 ms. Remains 99 /347 variables (removed 248) and now considering 132/672 (removed 540) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83 ms. Remains : 99/347 places, 132/672 transitions.
// Phase 1: matrix 132 rows 99 cols
[2023-03-09 09:50:08] [INFO ] Computed 2 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 229354 resets, run finished after 1016 ms. (steps per millisecond=984 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 1000000 steps, including 97905 resets, run finished after 483 ms. (steps per millisecond=2070 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 1000001 steps, including 97740 resets, run finished after 463 ms. (steps per millisecond=2159 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 1000000 steps, including 97780 resets, run finished after 465 ms. (steps per millisecond=2150 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 1000001 steps, including 97607 resets, run finished after 515 ms. (steps per millisecond=1941 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 1000000 steps, including 98065 resets, run finished after 467 ms. (steps per millisecond=2141 ) properties (out of 5) seen :2
[2023-03-09 09:50:11] [INFO ] Invariant cache hit.
[2023-03-09 09:50:11] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-09 09:50:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 09:50:11] [INFO ] [Real]Absence check using state equation in 20 ms returned unsat
[2023-03-09 09:50:11] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 09:50:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 09:50:11] [INFO ] [Real]Absence check using state equation in 19 ms returned unsat
[2023-03-09 09:50:11] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 09:50:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 09:50:11] [INFO ] [Real]Absence check using state equation in 22 ms returned unsat
[2023-03-09 09:50:11] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 09:50:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 09:50:11] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2023-03-09 09:50:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 09:50:11] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 09:50:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 09:50:12] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2023-03-09 09:50:12] [INFO ] State equation strengthened by 43 read => feed constraints.
[2023-03-09 09:50:12] [INFO ] [Nat]Added 43 Read/Feed constraints in 6 ms returned sat
[2023-03-09 09:50:12] [INFO ] Computed and/alt/rep : 35/86/35 causal constraints (skipped 96 transitions) in 10 ms.
[2023-03-09 09:50:12] [INFO ] Added : 2 causal constraints over 1 iterations in 26 ms. Result :sat
Minimization took 15 ms.
[2023-03-09 09:50:12] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2023-03-09 09:50:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 09:50:12] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2023-03-09 09:50:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 09:50:12] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-09 09:50:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 09:50:12] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2023-03-09 09:50:12] [INFO ] [Nat]Added 43 Read/Feed constraints in 5 ms returned sat
[2023-03-09 09:50:12] [INFO ] Computed and/alt/rep : 35/86/35 causal constraints (skipped 96 transitions) in 8 ms.
[2023-03-09 09:50:12] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 0 ms to minimize.
[2023-03-09 09:50:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 62 ms
[2023-03-09 09:50:12] [INFO ] Added : 9 causal constraints over 3 iterations in 109 ms. Result :sat
Minimization took 45 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 4, 8] Max seen :[1, 1, 1, 2, 0]
FORMULA DBSingleClientW-PT-d1m08-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DBSingleClientW-PT-d1m08-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DBSingleClientW-PT-d1m08-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 2 out of 99 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 99/99 places, 132/132 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 96 transition count 125
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 96 transition count 125
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 93 transition count 122
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 93 transition count 122
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 93 transition count 121
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 15 place count 91 transition count 117
Iterating global reduction 1 with 2 rules applied. Total rules applied 17 place count 91 transition count 117
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 19 place count 91 transition count 115
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 21 place count 89 transition count 113
Iterating global reduction 2 with 2 rules applied. Total rules applied 23 place count 89 transition count 113
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 25 place count 87 transition count 111
Iterating global reduction 2 with 2 rules applied. Total rules applied 27 place count 87 transition count 111
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 30 place count 87 transition count 108
Applied a total of 30 rules in 25 ms. Remains 87 /99 variables (removed 12) and now considering 108/132 (removed 24) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 87/99 places, 108/132 transitions.
// Phase 1: matrix 108 rows 87 cols
[2023-03-09 09:50:12] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 229726 resets, run finished after 796 ms. (steps per millisecond=1256 ) properties (out of 2) seen :2
Incomplete Best-First random walk after 1000000 steps, including 98599 resets, run finished after 393 ms. (steps per millisecond=2544 ) properties (out of 2) seen :2
Incomplete Best-First random walk after 1000001 steps, including 98594 resets, run finished after 388 ms. (steps per millisecond=2577 ) properties (out of 2) seen :1
[2023-03-09 09:50:14] [INFO ] Invariant cache hit.
[2023-03-09 09:50:14] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-09 09:50:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 09:50:14] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2023-03-09 09:50:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 09:50:14] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 09:50:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 09:50:14] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2023-03-09 09:50:14] [INFO ] State equation strengthened by 31 read => feed constraints.
[2023-03-09 09:50:14] [INFO ] [Nat]Added 31 Read/Feed constraints in 4 ms returned sat
[2023-03-09 09:50:14] [INFO ] Computed and/alt/rep : 31/69/31 causal constraints (skipped 76 transitions) in 6 ms.
[2023-03-09 09:50:14] [INFO ] Added : 2 causal constraints over 1 iterations in 18 ms. Result :sat
Minimization took 12 ms.
[2023-03-09 09:50:14] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 09:50:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 09:50:14] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2023-03-09 09:50:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 09:50:14] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-09 09:50:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 09:50:14] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2023-03-09 09:50:14] [INFO ] [Nat]Added 31 Read/Feed constraints in 5 ms returned sat
[2023-03-09 09:50:14] [INFO ] Computed and/alt/rep : 31/69/31 causal constraints (skipped 76 transitions) in 7 ms.
[2023-03-09 09:50:14] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2023-03-09 09:50:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 56 ms
[2023-03-09 09:50:14] [INFO ] Added : 9 causal constraints over 3 iterations in 94 ms. Result :sat
Minimization took 39 ms.
Current structural bounds on expressions (after SMT) : [4, 8] Max seen :[2, 0]
Support contains 2 out of 87 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 108/108 transitions.
Applied a total of 0 rules in 6 ms. Remains 87 /87 variables (removed 0) and now considering 108/108 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 87/87 places, 108/108 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 108/108 transitions.
Applied a total of 0 rules in 7 ms. Remains 87 /87 variables (removed 0) and now considering 108/108 (removed 0) transitions.
[2023-03-09 09:50:14] [INFO ] Invariant cache hit.
[2023-03-09 09:50:14] [INFO ] Implicit Places using invariants in 60 ms returned []
[2023-03-09 09:50:14] [INFO ] Invariant cache hit.
[2023-03-09 09:50:14] [INFO ] State equation strengthened by 31 read => feed constraints.
[2023-03-09 09:50:14] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 182 ms to find 0 implicit places.
[2023-03-09 09:50:14] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-09 09:50:14] [INFO ] Invariant cache hit.
[2023-03-09 09:50:14] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 255 ms. Remains : 87/87 places, 108/108 transitions.
Starting property specific reduction for DBSingleClientW-PT-d1m08-UpperBounds-10
[2023-03-09 09:50:14] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 2319 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10000 steps, including 1002 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :1
[2023-03-09 09:50:14] [INFO ] Invariant cache hit.
[2023-03-09 09:50:14] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 09:50:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 09:50:14] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2023-03-09 09:50:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 09:50:14] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 09:50:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 09:50:14] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2023-03-09 09:50:14] [INFO ] State equation strengthened by 31 read => feed constraints.
[2023-03-09 09:50:14] [INFO ] [Nat]Added 31 Read/Feed constraints in 3 ms returned sat
[2023-03-09 09:50:14] [INFO ] Computed and/alt/rep : 31/69/31 causal constraints (skipped 76 transitions) in 6 ms.
[2023-03-09 09:50:14] [INFO ] Added : 2 causal constraints over 1 iterations in 20 ms. Result :sat
Minimization took 18 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[1]
Support contains 1 out of 87 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 108/108 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 86 transition count 107
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 86 transition count 107
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 85 transition count 106
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 85 transition count 106
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 84 transition count 102
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 84 transition count 102
Applied a total of 6 rules in 11 ms. Remains 84 /87 variables (removed 3) and now considering 102/108 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 84/87 places, 102/108 transitions.
// Phase 1: matrix 102 rows 84 cols
[2023-03-09 09:50:14] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 229530 resets, run finished after 812 ms. (steps per millisecond=1231 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000001 steps, including 98461 resets, run finished after 393 ms. (steps per millisecond=2544 ) properties (out of 1) seen :1
[2023-03-09 09:50:16] [INFO ] Invariant cache hit.
[2023-03-09 09:50:16] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 09:50:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 09:50:16] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2023-03-09 09:50:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 09:50:16] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 09:50:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 09:50:16] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2023-03-09 09:50:16] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-09 09:50:16] [INFO ] [Nat]Added 30 Read/Feed constraints in 3 ms returned sat
[2023-03-09 09:50:16] [INFO ] Computed and/alt/rep : 30/64/30 causal constraints (skipped 71 transitions) in 5 ms.
[2023-03-09 09:50:16] [INFO ] Added : 2 causal constraints over 1 iterations in 16 ms. Result :sat
Minimization took 12 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[2]
Support contains 1 out of 84 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 102/102 transitions.
Applied a total of 0 rules in 7 ms. Remains 84 /84 variables (removed 0) and now considering 102/102 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 84/84 places, 102/102 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 102/102 transitions.
Applied a total of 0 rules in 4 ms. Remains 84 /84 variables (removed 0) and now considering 102/102 (removed 0) transitions.
[2023-03-09 09:50:16] [INFO ] Invariant cache hit.
[2023-03-09 09:50:16] [INFO ] Implicit Places using invariants in 50 ms returned []
[2023-03-09 09:50:16] [INFO ] Invariant cache hit.
[2023-03-09 09:50:16] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-09 09:50:16] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 166 ms to find 0 implicit places.
[2023-03-09 09:50:16] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-09 09:50:16] [INFO ] Invariant cache hit.
[2023-03-09 09:50:16] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 224 ms. Remains : 84/84 places, 102/102 transitions.
[2023-03-09 09:50:16] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 229689 resets, run finished after 802 ms. (steps per millisecond=1246 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000001 steps, including 98496 resets, run finished after 393 ms. (steps per millisecond=2544 ) properties (out of 1) seen :2
[2023-03-09 09:50:17] [INFO ] Invariant cache hit.
[2023-03-09 09:50:17] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2023-03-09 09:50:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 09:50:17] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2023-03-09 09:50:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 09:50:17] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 09:50:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 09:50:17] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2023-03-09 09:50:17] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-09 09:50:17] [INFO ] [Nat]Added 30 Read/Feed constraints in 4 ms returned sat
[2023-03-09 09:50:17] [INFO ] Computed and/alt/rep : 30/64/30 causal constraints (skipped 71 transitions) in 5 ms.
[2023-03-09 09:50:17] [INFO ] Added : 2 causal constraints over 1 iterations in 16 ms. Result :sat
Minimization took 12 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[2]
Support contains 1 out of 84 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 102/102 transitions.
Applied a total of 0 rules in 6 ms. Remains 84 /84 variables (removed 0) and now considering 102/102 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 84/84 places, 102/102 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 102/102 transitions.
Applied a total of 0 rules in 3 ms. Remains 84 /84 variables (removed 0) and now considering 102/102 (removed 0) transitions.
[2023-03-09 09:50:17] [INFO ] Invariant cache hit.
[2023-03-09 09:50:17] [INFO ] Implicit Places using invariants in 47 ms returned []
[2023-03-09 09:50:17] [INFO ] Invariant cache hit.
[2023-03-09 09:50:17] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-09 09:50:18] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 157 ms to find 0 implicit places.
[2023-03-09 09:50:18] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-09 09:50:18] [INFO ] Invariant cache hit.
[2023-03-09 09:50:18] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 220 ms. Remains : 84/84 places, 102/102 transitions.
Ending property specific reduction for DBSingleClientW-PT-d1m08-UpperBounds-10 in 3343 ms.
Starting property specific reduction for DBSingleClientW-PT-d1m08-UpperBounds-11
// Phase 1: matrix 108 rows 87 cols
[2023-03-09 09:50:18] [INFO ] Computed 2 place invariants in 2 ms
Incomplete random walk after 10000 steps, including 2298 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 976 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
[2023-03-09 09:50:18] [INFO ] Invariant cache hit.
[2023-03-09 09:50:18] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 09:50:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 09:50:18] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2023-03-09 09:50:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 09:50:18] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 09:50:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 09:50:18] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2023-03-09 09:50:18] [INFO ] State equation strengthened by 31 read => feed constraints.
[2023-03-09 09:50:18] [INFO ] [Nat]Added 31 Read/Feed constraints in 4 ms returned sat
[2023-03-09 09:50:18] [INFO ] Computed and/alt/rep : 31/69/31 causal constraints (skipped 76 transitions) in 6 ms.
[2023-03-09 09:50:18] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 0 ms to minimize.
[2023-03-09 09:50:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 54 ms
[2023-03-09 09:50:18] [INFO ] Added : 9 causal constraints over 3 iterations in 89 ms. Result :sat
Minimization took 38 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, 108/108 transitions.
Applied a total of 0 rules in 4 ms. Remains 87 /87 variables (removed 0) and now considering 108/108 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 87/87 places, 108/108 transitions.
[2023-03-09 09:50:18] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 229759 resets, run finished after 840 ms. (steps per millisecond=1190 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 98397 resets, run finished after 404 ms. (steps per millisecond=2475 ) properties (out of 1) seen :0
[2023-03-09 09:50:19] [INFO ] Invariant cache hit.
[2023-03-09 09:50:19] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 09:50:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 09:50:19] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2023-03-09 09:50:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 09:50:19] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 09:50:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 09:50:19] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2023-03-09 09:50:19] [INFO ] State equation strengthened by 31 read => feed constraints.
[2023-03-09 09:50:19] [INFO ] [Nat]Added 31 Read/Feed constraints in 4 ms returned sat
[2023-03-09 09:50:19] [INFO ] Computed and/alt/rep : 31/69/31 causal constraints (skipped 76 transitions) in 6 ms.
[2023-03-09 09:50:19] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
[2023-03-09 09:50:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 58 ms
[2023-03-09 09:50:19] [INFO ] Added : 9 causal constraints over 3 iterations in 94 ms. Result :sat
Minimization took 39 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, 108/108 transitions.
Applied a total of 0 rules in 3 ms. Remains 87 /87 variables (removed 0) and now considering 108/108 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 87/87 places, 108/108 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 108/108 transitions.
Applied a total of 0 rules in 3 ms. Remains 87 /87 variables (removed 0) and now considering 108/108 (removed 0) transitions.
[2023-03-09 09:50:19] [INFO ] Invariant cache hit.
[2023-03-09 09:50:19] [INFO ] Implicit Places using invariants in 57 ms returned []
[2023-03-09 09:50:19] [INFO ] Invariant cache hit.
[2023-03-09 09:50:20] [INFO ] State equation strengthened by 31 read => feed constraints.
[2023-03-09 09:50:20] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 212 ms to find 0 implicit places.
[2023-03-09 09:50:20] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-09 09:50:20] [INFO ] Invariant cache hit.
[2023-03-09 09:50:20] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 270 ms. Remains : 87/87 places, 108/108 transitions.
Ending property specific reduction for DBSingleClientW-PT-d1m08-UpperBounds-11 in 2117 ms.
[2023-03-09 09:50:20] [INFO ] Flatten gal took : 36 ms
[2023-03-09 09:50:20] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2023-03-09 09:50:20] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 87 places, 108 transitions and 426 arcs took 2 ms.
Total runtime 24794 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: DBSingleClientW_PT_d1m08
(NrP: 87 NrTr: 108 NrArc: 426)

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

net check time: 0m 0.000sec

init dd package: 0m 2.765sec


RS generation: 0m 9.519sec


-> reachability set: #nodes 29529 (3.0e+04) #states 23,602,988 (7)



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

checking: place_bound(p74)
normalized: place_bound(p74)

-> the formula is 3

FORMULA DBSingleClientW-PT-d1m08-UpperBounds-10 3 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(p82)
normalized: place_bound(p82)

-> the formula is 5

FORMULA DBSingleClientW-PT-d1m08-UpperBounds-11 5 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

totally nodes used: 1237195 (1.2e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 26814465 36414526 63228991
used/not used/entry size/cache size: 28720027 38388837 16 1024MB
basic ops cache: hits/miss/sum: 7391 8458 15849
used/not used/entry size/cache size: 19897 16757319 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: 16677 29532 46209
used/not used/entry size/cache size: 29470 8359138 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 66010844
1 983930
2 95807
3 15573
4 2141
5 271
6 49
7 60
8 14
9 19
>= 10 156

Total processing time: 0m14.254sec


BK_STOP 1678355435647

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

29673 29233
iterations count:221259 (2048), effective:6152 (56)

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="DBSingleClientW-PT-d1m08"
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 DBSingleClientW-PT-d1m08, 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 r106-tall-167814482500269"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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