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.r105-tall-167814481000325.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 ltsminxred
Input is DBSingleClientW-PT-d2m08, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r105-tall-167814481000325
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 8.4K Feb 26 15:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 94K Feb 26 15:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Feb 26 15:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 26 15:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 15:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Feb 25 15:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 15:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 15:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Feb 26 15:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 97K Feb 26 15:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Feb 26 15:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 26 15:30 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 1.6M 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-d2m08-UpperBounds-00
FORMULA_NAME DBSingleClientW-PT-d2m08-UpperBounds-01
FORMULA_NAME DBSingleClientW-PT-d2m08-UpperBounds-02
FORMULA_NAME DBSingleClientW-PT-d2m08-UpperBounds-03
FORMULA_NAME DBSingleClientW-PT-d2m08-UpperBounds-04
FORMULA_NAME DBSingleClientW-PT-d2m08-UpperBounds-05
FORMULA_NAME DBSingleClientW-PT-d2m08-UpperBounds-06
FORMULA_NAME DBSingleClientW-PT-d2m08-UpperBounds-07
FORMULA_NAME DBSingleClientW-PT-d2m08-UpperBounds-08
FORMULA_NAME DBSingleClientW-PT-d2m08-UpperBounds-09
FORMULA_NAME DBSingleClientW-PT-d2m08-UpperBounds-10
FORMULA_NAME DBSingleClientW-PT-d2m08-UpperBounds-11
FORMULA_NAME DBSingleClientW-PT-d2m08-UpperBounds-12
FORMULA_NAME DBSingleClientW-PT-d2m08-UpperBounds-13
FORMULA_NAME DBSingleClientW-PT-d2m08-UpperBounds-14
FORMULA_NAME DBSingleClientW-PT-d2m08-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678278605872

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=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d2m08
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-08 12:30:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-08 12:30:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 12:30:07] [INFO ] Load time of PNML (sax parser for PT used): 167 ms
[2023-03-08 12:30:07] [INFO ] Transformed 4763 places.
[2023-03-08 12:30:07] [INFO ] Transformed 2478 transitions.
[2023-03-08 12:30:07] [INFO ] Parsed PT model containing 4763 places and 2478 transitions and 9912 arcs in 261 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Deduced a syphon composed of 3580 places in 16 ms
Reduce places removed 3580 places and 0 transitions.
FORMULA DBSingleClientW-PT-d2m08-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m08-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m08-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m08-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m08-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m08-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m08-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m08-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m08-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m08-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m08-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m08-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m08-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m08-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 2478 rows 1183 cols
[2023-03-08 12:30:07] [INFO ] Computed 6 place invariants in 181 ms
Incomplete random walk after 10000 steps, including 2261 resets, run finished after 271 ms. (steps per millisecond=36 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 942 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 969 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 2) seen :0
[2023-03-08 12:30:08] [INFO ] Invariant cache hit.
[2023-03-08 12:30:08] [INFO ] [Real]Absence check using 2 positive place invariants in 13 ms returned sat
[2023-03-08 12:30:08] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 10 ms returned sat
[2023-03-08 12:30:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 12:30:09] [INFO ] [Real]Absence check using state equation in 635 ms returned sat
[2023-03-08 12:30:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 12:30:09] [INFO ] [Nat]Absence check using 2 positive place invariants in 11 ms returned sat
[2023-03-08 12:30:09] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 16 ms returned sat
[2023-03-08 12:30:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 12:30:10] [INFO ] [Nat]Absence check using state equation in 665 ms returned sat
[2023-03-08 12:30:10] [INFO ] State equation strengthened by 1588 read => feed constraints.
[2023-03-08 12:30:11] [INFO ] [Nat]Added 1588 Read/Feed constraints in 753 ms returned sat
[2023-03-08 12:30:12] [INFO ] Deduced a trap composed of 307 places in 627 ms of which 5 ms to minimize.
[2023-03-08 12:30:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 818 ms
[2023-03-08 12:30:13] [INFO ] Computed and/alt/rep : 372/636/372 causal constraints (skipped 2105 transitions) in 692 ms.
[2023-03-08 12:30:13] [INFO ] Added : 6 causal constraints over 2 iterations in 1119 ms. Result :sat
Minimization took 570 ms.
[2023-03-08 12:30:14] [INFO ] [Real]Absence check using 2 positive place invariants in 10 ms returned sat
[2023-03-08 12:30:14] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 9 ms returned sat
[2023-03-08 12:30:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 12:30:14] [INFO ] [Real]Absence check using state equation in 653 ms returned sat
[2023-03-08 12:30:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 12:30:15] [INFO ] [Nat]Absence check using 2 positive place invariants in 11 ms returned sat
[2023-03-08 12:30:15] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 9 ms returned sat
[2023-03-08 12:30:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 12:30:15] [INFO ] [Nat]Absence check using state equation in 650 ms returned sat
[2023-03-08 12:30:16] [INFO ] [Nat]Added 1588 Read/Feed constraints in 1181 ms returned sat
[2023-03-08 12:30:17] [INFO ] Deduced a trap composed of 183 places in 618 ms of which 2 ms to minimize.
[2023-03-08 12:30:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 826 ms
[2023-03-08 12:30:18] [INFO ] Computed and/alt/rep : 372/636/372 causal constraints (skipped 2105 transitions) in 610 ms.
[2023-03-08 12:30:19] [INFO ] Added : 13 causal constraints over 3 iterations in 1250 ms. Result :sat
Minimization took 960 ms.
Current structural bounds on expressions (after SMT) : [8, 2887] Max seen :[0, 0]
Support contains 2 out of 1183 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1183/1183 places, 2478/2478 transitions.
Graph (complete) has 4476 edges and 1183 vertex of which 1137 are kept as prefixes of interest. Removing 46 places using SCC suffix rule.9 ms
Discarding 46 places :
Also discarding 0 output transitions
Drop transitions removed 18 transitions
Ensure Unique test removed 195 transitions
Reduce isomorphic transitions removed 213 transitions.
Iterating post reduction 0 with 213 rules applied. Total rules applied 214 place count 1137 transition count 2265
Discarding 391 places :
Symmetric choice reduction at 1 with 391 rule applications. Total rules 605 place count 746 transition count 1203
Iterating global reduction 1 with 391 rules applied. Total rules applied 996 place count 746 transition count 1203
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 1005 place count 746 transition count 1194
Discarding 316 places :
Symmetric choice reduction at 2 with 316 rule applications. Total rules 1321 place count 430 transition count 878
Iterating global reduction 2 with 316 rules applied. Total rules applied 1637 place count 430 transition count 878
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 1649 place count 430 transition count 866
Discarding 242 places :
Symmetric choice reduction at 3 with 242 rule applications. Total rules 1891 place count 188 transition count 522
Iterating global reduction 3 with 242 rules applied. Total rules applied 2133 place count 188 transition count 522
Ensure Unique test removed 213 transitions
Reduce isomorphic transitions removed 213 transitions.
Iterating post reduction 3 with 213 rules applied. Total rules applied 2346 place count 188 transition count 309
Discarding 25 places :
Symmetric choice reduction at 4 with 25 rule applications. Total rules 2371 place count 163 transition count 269
Iterating global reduction 4 with 25 rules applied. Total rules applied 2396 place count 163 transition count 269
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 2402 place count 163 transition count 263
Discarding 17 places :
Symmetric choice reduction at 5 with 17 rule applications. Total rules 2419 place count 146 transition count 246
Iterating global reduction 5 with 17 rules applied. Total rules applied 2436 place count 146 transition count 246
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 2440 place count 146 transition count 242
Discarding 14 places :
Symmetric choice reduction at 6 with 14 rule applications. Total rules 2454 place count 132 transition count 228
Iterating global reduction 6 with 14 rules applied. Total rules applied 2468 place count 132 transition count 228
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 6 with 13 rules applied. Total rules applied 2481 place count 132 transition count 215
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 2486 place count 127 transition count 191
Iterating global reduction 7 with 5 rules applied. Total rules applied 2491 place count 127 transition count 191
Applied a total of 2491 rules in 247 ms. Remains 127 /1183 variables (removed 1056) and now considering 191/2478 (removed 2287) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 249 ms. Remains : 127/1183 places, 191/2478 transitions.
// Phase 1: matrix 191 rows 127 cols
[2023-03-08 12:30:20] [INFO ] Computed 2 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 229978 resets, run finished after 1349 ms. (steps per millisecond=741 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 95213 resets, run finished after 621 ms. (steps per millisecond=1610 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 95513 resets, run finished after 605 ms. (steps per millisecond=1652 ) properties (out of 2) seen :0
[2023-03-08 12:30:22] [INFO ] Invariant cache hit.
[2023-03-08 12:30:22] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 12:30:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 12:30:22] [INFO ] [Real]Absence check using state equation in 34 ms returned unsat
[2023-03-08 12:30:22] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 12:30:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 12:30:23] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2023-03-08 12:30:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 12:30:23] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 12:30:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 12:30:23] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2023-03-08 12:30:23] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-03-08 12:30:23] [INFO ] [Nat]Added 72 Read/Feed constraints in 14 ms returned sat
[2023-03-08 12:30:23] [INFO ] Computed and/alt/rep : 49/115/49 causal constraints (skipped 141 transitions) in 15 ms.
[2023-03-08 12:30:23] [INFO ] Added : 12 causal constraints over 3 iterations in 74 ms. Result :sat
Minimization took 37 ms.
Current structural bounds on expressions (after SMT) : [1, 2887] Max seen :[1, 0]
FORMULA DBSingleClientW-PT-d2m08-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 1 out of 127 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 127/127 places, 191/191 transitions.
Applied a total of 0 rules in 12 ms. Remains 127 /127 variables (removed 0) and now considering 191/191 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 127/127 places, 191/191 transitions.
[2023-03-08 12:30:23] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 230203 resets, run finished after 1302 ms. (steps per millisecond=768 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 96174 resets, run finished after 593 ms. (steps per millisecond=1686 ) properties (out of 1) seen :0
[2023-03-08 12:30:25] [INFO ] Invariant cache hit.
[2023-03-08 12:30:25] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 12:30:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 12:30:25] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2023-03-08 12:30:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 12:30:25] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 12:30:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 12:30:25] [INFO ] [Nat]Absence check using state equation in 44 ms returned sat
[2023-03-08 12:30:25] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-03-08 12:30:25] [INFO ] [Nat]Added 72 Read/Feed constraints in 23 ms returned sat
[2023-03-08 12:30:25] [INFO ] Computed and/alt/rep : 49/115/49 causal constraints (skipped 141 transitions) in 14 ms.
[2023-03-08 12:30:25] [INFO ] Added : 12 causal constraints over 3 iterations in 64 ms. Result :sat
Minimization took 36 ms.
Current structural bounds on expressions (after SMT) : [2887] Max seen :[0]
Support contains 1 out of 127 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 127/127 places, 191/191 transitions.
Applied a total of 0 rules in 8 ms. Remains 127 /127 variables (removed 0) and now considering 191/191 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 127/127 places, 191/191 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 127/127 places, 191/191 transitions.
Applied a total of 0 rules in 7 ms. Remains 127 /127 variables (removed 0) and now considering 191/191 (removed 0) transitions.
[2023-03-08 12:30:25] [INFO ] Invariant cache hit.
[2023-03-08 12:30:25] [INFO ] Implicit Places using invariants in 82 ms returned []
[2023-03-08 12:30:25] [INFO ] Invariant cache hit.
[2023-03-08 12:30:25] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-03-08 12:30:25] [INFO ] Implicit Places using invariants and state equation in 255 ms returned []
Implicit Place search using SMT with State Equation took 341 ms to find 0 implicit places.
[2023-03-08 12:30:25] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-08 12:30:25] [INFO ] Invariant cache hit.
[2023-03-08 12:30:25] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 437 ms. Remains : 127/127 places, 191/191 transitions.
Starting property specific reduction for DBSingleClientW-PT-d2m08-UpperBounds-14
[2023-03-08 12:30:25] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 2288 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 948 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
[2023-03-08 12:30:25] [INFO ] Invariant cache hit.
[2023-03-08 12:30:26] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 12:30:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 12:30:26] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2023-03-08 12:30:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 12:30:26] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 12:30:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 12:30:26] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2023-03-08 12:30:26] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-03-08 12:30:26] [INFO ] [Nat]Added 72 Read/Feed constraints in 17 ms returned sat
[2023-03-08 12:30:26] [INFO ] Computed and/alt/rep : 49/115/49 causal constraints (skipped 141 transitions) in 16 ms.
[2023-03-08 12:30:26] [INFO ] Added : 12 causal constraints over 3 iterations in 66 ms. Result :sat
Minimization took 36 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 127 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 127/127 places, 191/191 transitions.
Applied a total of 0 rules in 6 ms. Remains 127 /127 variables (removed 0) and now considering 191/191 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 127/127 places, 191/191 transitions.
[2023-03-08 12:30:26] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 230195 resets, run finished after 1327 ms. (steps per millisecond=753 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 95910 resets, run finished after 607 ms. (steps per millisecond=1647 ) properties (out of 1) seen :0
[2023-03-08 12:30:28] [INFO ] Invariant cache hit.
[2023-03-08 12:30:28] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 4 ms returned sat
[2023-03-08 12:30:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 12:30:28] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2023-03-08 12:30:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 12:30:28] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 12:30:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 12:30:28] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2023-03-08 12:30:28] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-03-08 12:30:28] [INFO ] [Nat]Added 72 Read/Feed constraints in 13 ms returned sat
[2023-03-08 12:30:28] [INFO ] Computed and/alt/rep : 49/115/49 causal constraints (skipped 141 transitions) in 14 ms.
[2023-03-08 12:30:28] [INFO ] Added : 12 causal constraints over 3 iterations in 68 ms. Result :sat
Minimization took 36 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 127 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 127/127 places, 191/191 transitions.
Applied a total of 0 rules in 6 ms. Remains 127 /127 variables (removed 0) and now considering 191/191 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 127/127 places, 191/191 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 127/127 places, 191/191 transitions.
Applied a total of 0 rules in 6 ms. Remains 127 /127 variables (removed 0) and now considering 191/191 (removed 0) transitions.
[2023-03-08 12:30:28] [INFO ] Invariant cache hit.
[2023-03-08 12:30:28] [INFO ] Implicit Places using invariants in 196 ms returned []
[2023-03-08 12:30:28] [INFO ] Invariant cache hit.
[2023-03-08 12:30:28] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-03-08 12:30:29] [INFO ] Implicit Places using invariants and state equation in 247 ms returned []
Implicit Place search using SMT with State Equation took 446 ms to find 0 implicit places.
[2023-03-08 12:30:29] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-08 12:30:29] [INFO ] Invariant cache hit.
[2023-03-08 12:30:29] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 553 ms. Remains : 127/127 places, 191/191 transitions.
Ending property specific reduction for DBSingleClientW-PT-d2m08-UpperBounds-14 in 3159 ms.
[2023-03-08 12:30:29] [INFO ] Flatten gal took : 79 ms
[2023-03-08 12:30:29] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2023-03-08 12:30:29] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 127 places, 191 transitions and 753 arcs took 2 ms.
Total runtime 21990 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --maxsum=/tmp/543/ub_0_
FORMULA DBSingleClientW-PT-d2m08-UpperBounds-14 1 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN

BK_STOP 1678278683805

--------------------
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
mcc2023
ub formula name DBSingleClientW-PT-d2m08-UpperBounds-14
ub formula formula --maxsum=/tmp/543/ub_0_
pnml2lts-sym: Exploration order is bfs-prev
pnml2lts-sym: Saturation strategy is sat
pnml2lts-sym: Guided search strategy is unguided
pnml2lts-sym: Attractor strategy is default
pnml2lts-sym: opening model.pnml
pnml2lts-sym: Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-sym: Petri net has 127 places, 191 transitions and 753 arcs
pnml2lts-sym: Petri net DBSingleClientW_PT_d2m08 analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-sym: Initializing regrouping layer
pnml2lts-sym: Regroup specification: bs,w2W,ru,hf
pnml2lts-sym: Regroup Boost's Sloan
pnml2lts-sym: Regroup over-approximate must-write to may-write
pnml2lts-sym: Regroup Row sUbsume
pnml2lts-sym: Reqroup Horizontal Flip
pnml2lts-sym: Regrouping: 191->180 groups
pnml2lts-sym: Regrouping took 0.040 real 0.040 user 0.000 sys
pnml2lts-sym: state vector length is 127; there are 180 groups
pnml2lts-sym: Computing maximum sum over 1 state variables.
pnml2lts-sym: Creating a multi-core ListDD domain.
pnml2lts-sym: Sylvan allocates 15.000 GB virtual memory for nodes table and operation cache.
pnml2lts-sym: Initial nodes table and operation cache requires 60.00 MB.
pnml2lts-sym: Using GBgetTransitionsShortR2W as next-state function
pnml2lts-sym: got initial state
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: Exploration took 4478956 group checks and 0 next state calls
pnml2lts-sym: reachability took 52.350 real 209.050 user 0.060 sys
pnml2lts-sym: counting visited states...
pnml2lts-sym: counting took 0.020 real 0.060 user 0.000 sys
pnml2lts-sym: state space has 53518719 states, 81224 nodes
pnml2lts-sym: Maximum sum of /tmp/543/ub_0_ is: 1
pnml2lts-sym: group_next: 2902 nodes total
pnml2lts-sym: group_explored: 3687 nodes, 4279 short vectors total
pnml2lts-sym: max token count: 8

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-d2m08"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is DBSingleClientW-PT-d2m08, 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 r105-tall-167814481000325"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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