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-167814480900229.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-d0m10, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r105-tall-167814480900229
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 568K
-rw-r--r-- 1 mcc users 5.7K Feb 26 15:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 57K Feb 26 15:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 26 15:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 26 15:25 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Feb 25 15:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 15:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 26 15:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 162K Feb 26 15:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Feb 26 15:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 26 15:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:48 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 119K 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-d0m10-UpperBounds-00
FORMULA_NAME DBSingleClientW-PT-d0m10-UpperBounds-01
FORMULA_NAME DBSingleClientW-PT-d0m10-UpperBounds-02
FORMULA_NAME DBSingleClientW-PT-d0m10-UpperBounds-03
FORMULA_NAME DBSingleClientW-PT-d0m10-UpperBounds-04
FORMULA_NAME DBSingleClientW-PT-d0m10-UpperBounds-05
FORMULA_NAME DBSingleClientW-PT-d0m10-UpperBounds-06
FORMULA_NAME DBSingleClientW-PT-d0m10-UpperBounds-07
FORMULA_NAME DBSingleClientW-PT-d0m10-UpperBounds-08
FORMULA_NAME DBSingleClientW-PT-d0m10-UpperBounds-09
FORMULA_NAME DBSingleClientW-PT-d0m10-UpperBounds-10
FORMULA_NAME DBSingleClientW-PT-d0m10-UpperBounds-11
FORMULA_NAME DBSingleClientW-PT-d0m10-UpperBounds-12
FORMULA_NAME DBSingleClientW-PT-d0m10-UpperBounds-13
FORMULA_NAME DBSingleClientW-PT-d0m10-UpperBounds-14
FORMULA_NAME DBSingleClientW-PT-d0m10-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678265589816

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-d0m10
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-08 08:53:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-08 08:53:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 08:53:11] [INFO ] Load time of PNML (sax parser for PT used): 78 ms
[2023-03-08 08:53:11] [INFO ] Transformed 553 places.
[2023-03-08 08:53:11] [INFO ] Transformed 150 transitions.
[2023-03-08 08:53:11] [INFO ] Parsed PT model containing 553 places and 150 transitions and 600 arcs in 147 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
Deduced a syphon composed of 444 places in 2 ms
Reduce places removed 444 places and 0 transitions.
FORMULA DBSingleClientW-PT-d0m10-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m10-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m10-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m10-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m10-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m10-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m10-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m10-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m10-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m10-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m10-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m10-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 150 rows 109 cols
[2023-03-08 08:53:11] [INFO ] Computed 6 place invariants in 25 ms
Incomplete random walk after 10000 steps, including 2286 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 1045 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 1014 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 988 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10000 steps, including 1010 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 4) seen :0
[2023-03-08 08:53:12] [INFO ] Invariant cache hit.
[2023-03-08 08:53:12] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-08 08:53:12] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 6 ms returned sat
[2023-03-08 08:53:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 08:53:12] [INFO ] [Real]Absence check using state equation in 74 ms returned sat
[2023-03-08 08:53:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 08:53:12] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-08 08:53:12] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 4 ms returned sat
[2023-03-08 08:53:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 08:53:12] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2023-03-08 08:53:12] [INFO ] State equation strengthened by 74 read => feed constraints.
[2023-03-08 08:53:12] [INFO ] [Nat]Added 74 Read/Feed constraints in 17 ms returned sat
[2023-03-08 08:53:12] [INFO ] Deduced a trap composed of 37 places in 64 ms of which 3 ms to minimize.
[2023-03-08 08:53:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 88 ms
[2023-03-08 08:53:12] [INFO ] Computed and/alt/rep : 39/69/39 causal constraints (skipped 110 transitions) in 19 ms.
[2023-03-08 08:53:12] [INFO ] Added : 6 causal constraints over 2 iterations in 65 ms. Result :sat
Minimization took 19 ms.
[2023-03-08 08:53:12] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-08 08:53:12] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 3 ms returned unsat
[2023-03-08 08:53:12] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-08 08:53:12] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned unsat
[2023-03-08 08:53:12] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-08 08:53:12] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2023-03-08 08:53:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 08:53:12] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2023-03-08 08:53:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 08:53:12] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-08 08:53:12] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2023-03-08 08:53:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 08:53:13] [INFO ] [Nat]Absence check using state equation in 44 ms returned sat
[2023-03-08 08:53:13] [INFO ] [Nat]Added 74 Read/Feed constraints in 10 ms returned sat
[2023-03-08 08:53:13] [INFO ] Computed and/alt/rep : 39/69/39 causal constraints (skipped 110 transitions) in 24 ms.
[2023-03-08 08:53:13] [INFO ] Added : 7 causal constraints over 2 iterations in 62 ms. Result :sat
Minimization took 40 ms.
Current structural bounds on expressions (after SMT) : [10, 1, 1, 10] Max seen :[0, 1, 1, 0]
FORMULA DBSingleClientW-PT-d0m10-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DBSingleClientW-PT-d0m10-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 2 out of 109 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 109/109 places, 150/150 transitions.
Graph (complete) has 332 edges and 109 vertex of which 101 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 101 transition count 137
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 36 place count 79 transition count 99
Iterating global reduction 1 with 22 rules applied. Total rules applied 58 place count 79 transition count 99
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 59 place count 79 transition count 98
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 69 place count 69 transition count 88
Iterating global reduction 2 with 10 rules applied. Total rules applied 79 place count 69 transition count 88
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 81 place count 69 transition count 86
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 84 place count 66 transition count 80
Iterating global reduction 3 with 3 rules applied. Total rules applied 87 place count 66 transition count 80
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 88 place count 66 transition count 79
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 90 place count 64 transition count 76
Iterating global reduction 4 with 2 rules applied. Total rules applied 92 place count 64 transition count 76
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 94 place count 62 transition count 74
Iterating global reduction 4 with 2 rules applied. Total rules applied 96 place count 62 transition count 74
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 98 place count 62 transition count 72
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 99 place count 61 transition count 71
Iterating global reduction 5 with 1 rules applied. Total rules applied 100 place count 61 transition count 71
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 102 place count 61 transition count 69
Applied a total of 102 rules in 44 ms. Remains 61 /109 variables (removed 48) and now considering 69/150 (removed 81) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 61/109 places, 69/150 transitions.
// Phase 1: matrix 69 rows 61 cols
[2023-03-08 08:53:13] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 229249 resets, run finished after 752 ms. (steps per millisecond=1329 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 1000001 steps, including 101864 resets, run finished after 414 ms. (steps per millisecond=2415 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 1000000 steps, including 101887 resets, run finished after 329 ms. (steps per millisecond=3039 ) properties (out of 2) seen :1
[2023-03-08 08:53:14] [INFO ] Invariant cache hit.
[2023-03-08 08:53:14] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 08:53:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 08:53:14] [INFO ] [Real]Absence check using state equation in 15 ms returned unsat
[2023-03-08 08:53:14] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 08:53:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 08:53:14] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2023-03-08 08:53:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 08:53:14] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 08:53:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 08:53:14] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2023-03-08 08:53:14] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-08 08:53:14] [INFO ] [Nat]Added 24 Read/Feed constraints in 3 ms returned sat
[2023-03-08 08:53:14] [INFO ] Computed and/alt/rep : 19/35/19 causal constraints (skipped 49 transitions) in 5 ms.
[2023-03-08 08:53:14] [INFO ] Added : 6 causal constraints over 2 iterations in 22 ms. Result :sat
Minimization took 17 ms.
Current structural bounds on expressions (after SMT) : [1, 10] Max seen :[1, 0]
FORMULA DBSingleClientW-PT-d0m10-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 1 out of 61 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 69/69 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 60 transition count 68
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 60 transition count 68
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 59 transition count 67
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 59 transition count 67
Applied a total of 4 rules in 13 ms. Remains 59 /61 variables (removed 2) and now considering 67/69 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 59/61 places, 67/69 transitions.
// Phase 1: matrix 67 rows 59 cols
[2023-03-08 08:53:14] [INFO ] Computed 2 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 229143 resets, run finished after 584 ms. (steps per millisecond=1712 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 101799 resets, run finished after 310 ms. (steps per millisecond=3225 ) properties (out of 1) seen :1
[2023-03-08 08:53:15] [INFO ] Invariant cache hit.
[2023-03-08 08:53:15] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 08:53:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 08:53:15] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2023-03-08 08:53:15] [INFO ] State equation strengthened by 23 read => feed constraints.
[2023-03-08 08:53:15] [INFO ] [Real]Added 23 Read/Feed constraints in 3 ms returned sat
[2023-03-08 08:53:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 08:53:15] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 08:53:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 08:53:15] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2023-03-08 08:53:15] [INFO ] [Nat]Added 23 Read/Feed constraints in 3 ms returned sat
[2023-03-08 08:53:15] [INFO ] Computed and/alt/rep : 18/35/18 causal constraints (skipped 48 transitions) in 6 ms.
[2023-03-08 08:53:15] [INFO ] Added : 6 causal constraints over 2 iterations in 26 ms. Result :sat
Minimization took 20 ms.
Current structural bounds on expressions (after SMT) : [10] Max seen :[1]
Support contains 1 out of 59 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 59/59 places, 67/67 transitions.
Applied a total of 0 rules in 7 ms. Remains 59 /59 variables (removed 0) and now considering 67/67 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 59/59 places, 67/67 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 59/59 places, 67/67 transitions.
Applied a total of 0 rules in 4 ms. Remains 59 /59 variables (removed 0) and now considering 67/67 (removed 0) transitions.
[2023-03-08 08:53:15] [INFO ] Invariant cache hit.
[2023-03-08 08:53:16] [INFO ] Implicit Places using invariants in 46 ms returned []
[2023-03-08 08:53:16] [INFO ] Invariant cache hit.
[2023-03-08 08:53:16] [INFO ] State equation strengthened by 23 read => feed constraints.
[2023-03-08 08:53:16] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
[2023-03-08 08:53:16] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 08:53:16] [INFO ] Invariant cache hit.
[2023-03-08 08:53:16] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 180 ms. Remains : 59/59 places, 67/67 transitions.
[2023-03-08 08:53:16] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 229595 resets, run finished after 587 ms. (steps per millisecond=1703 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 101478 resets, run finished after 304 ms. (steps per millisecond=3289 ) properties (out of 1) seen :0
[2023-03-08 08:53:17] [INFO ] Invariant cache hit.
[2023-03-08 08:53:17] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 08:53:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 08:53:17] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2023-03-08 08:53:17] [INFO ] State equation strengthened by 23 read => feed constraints.
[2023-03-08 08:53:17] [INFO ] [Real]Added 23 Read/Feed constraints in 3 ms returned sat
[2023-03-08 08:53:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 08:53:17] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 08:53:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 08:53:17] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2023-03-08 08:53:17] [INFO ] [Nat]Added 23 Read/Feed constraints in 3 ms returned sat
[2023-03-08 08:53:17] [INFO ] Computed and/alt/rep : 18/35/18 causal constraints (skipped 48 transitions) in 5 ms.
[2023-03-08 08:53:17] [INFO ] Added : 6 causal constraints over 2 iterations in 19 ms. Result :sat
Minimization took 21 ms.
Current structural bounds on expressions (after SMT) : [10] Max seen :[1]
Support contains 1 out of 59 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 59/59 places, 67/67 transitions.
Applied a total of 0 rules in 7 ms. Remains 59 /59 variables (removed 0) and now considering 67/67 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 59/59 places, 67/67 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 59/59 places, 67/67 transitions.
Applied a total of 0 rules in 4 ms. Remains 59 /59 variables (removed 0) and now considering 67/67 (removed 0) transitions.
[2023-03-08 08:53:17] [INFO ] Invariant cache hit.
[2023-03-08 08:53:17] [INFO ] Implicit Places using invariants in 48 ms returned []
[2023-03-08 08:53:17] [INFO ] Invariant cache hit.
[2023-03-08 08:53:17] [INFO ] State equation strengthened by 23 read => feed constraints.
[2023-03-08 08:53:17] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 126 ms to find 0 implicit places.
[2023-03-08 08:53:17] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 08:53:17] [INFO ] Invariant cache hit.
[2023-03-08 08:53:17] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 180 ms. Remains : 59/59 places, 67/67 transitions.
Starting property specific reduction for DBSingleClientW-PT-d0m10-UpperBounds-13
[2023-03-08 08:53:17] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 2266 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 1011 resets, run finished after 4 ms. (steps per millisecond=2500 ) properties (out of 1) seen :0
[2023-03-08 08:53:17] [INFO ] Invariant cache hit.
[2023-03-08 08:53:17] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 08:53:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 08:53:17] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2023-03-08 08:53:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 08:53:17] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 08:53:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 08:53:17] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2023-03-08 08:53:17] [INFO ] State equation strengthened by 23 read => feed constraints.
[2023-03-08 08:53:17] [INFO ] [Nat]Added 23 Read/Feed constraints in 3 ms returned sat
[2023-03-08 08:53:17] [INFO ] Computed and/alt/rep : 18/35/18 causal constraints (skipped 48 transitions) in 5 ms.
[2023-03-08 08:53:17] [INFO ] Added : 8 causal constraints over 2 iterations in 20 ms. Result :sat
Minimization took 21 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 59 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 59/59 places, 67/67 transitions.
Applied a total of 0 rules in 7 ms. Remains 59 /59 variables (removed 0) and now considering 67/67 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 59/59 places, 67/67 transitions.
[2023-03-08 08:53:17] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 229108 resets, run finished after 569 ms. (steps per millisecond=1757 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 101936 resets, run finished after 310 ms. (steps per millisecond=3225 ) properties (out of 1) seen :0
[2023-03-08 08:53:18] [INFO ] Invariant cache hit.
[2023-03-08 08:53:18] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 08:53:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 08:53:18] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2023-03-08 08:53:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 08:53:18] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 08:53:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 08:53:18] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2023-03-08 08:53:18] [INFO ] State equation strengthened by 23 read => feed constraints.
[2023-03-08 08:53:18] [INFO ] [Nat]Added 23 Read/Feed constraints in 2 ms returned sat
[2023-03-08 08:53:18] [INFO ] Computed and/alt/rep : 18/35/18 causal constraints (skipped 48 transitions) in 6 ms.
[2023-03-08 08:53:18] [INFO ] Added : 8 causal constraints over 2 iterations in 22 ms. Result :sat
Minimization took 22 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 59 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 59/59 places, 67/67 transitions.
Applied a total of 0 rules in 7 ms. Remains 59 /59 variables (removed 0) and now considering 67/67 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 59/59 places, 67/67 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 59/59 places, 67/67 transitions.
Applied a total of 0 rules in 4 ms. Remains 59 /59 variables (removed 0) and now considering 67/67 (removed 0) transitions.
[2023-03-08 08:53:18] [INFO ] Invariant cache hit.
[2023-03-08 08:53:18] [INFO ] Implicit Places using invariants in 52 ms returned []
[2023-03-08 08:53:18] [INFO ] Invariant cache hit.
[2023-03-08 08:53:18] [INFO ] State equation strengthened by 23 read => feed constraints.
[2023-03-08 08:53:18] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
[2023-03-08 08:53:18] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 08:53:18] [INFO ] Invariant cache hit.
[2023-03-08 08:53:18] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 206 ms. Remains : 59/59 places, 67/67 transitions.
Ending property specific reduction for DBSingleClientW-PT-d0m10-UpperBounds-13 in 1435 ms.
[2023-03-08 08:53:19] [INFO ] Flatten gal took : 30 ms
[2023-03-08 08:53:19] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/UpperBounds.sr.xml took 1 ms.
[2023-03-08 08:53:19] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 59 places, 67 transitions and 263 arcs took 1 ms.
Total runtime 7764 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/557/ub_0_
FORMULA DBSingleClientW-PT-d0m10-UpperBounds-13 7 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN

BK_STOP 1678265612208

--------------------
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-d0m10-UpperBounds-13
ub formula formula --maxsum=/tmp/557/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 59 places, 67 transitions and 263 arcs
pnml2lts-sym: Petri net DBSingleClientW_PT_d0m10 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: 67->62 groups
pnml2lts-sym: Regrouping took 0.010 real 0.010 user 0.000 sys
pnml2lts-sym: state vector length is 59; there are 62 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: Exploration took 253221 group checks and 0 next state calls
pnml2lts-sym: reachability took 2.760 real 11.040 user 0.000 sys
pnml2lts-sym: counting visited states...
pnml2lts-sym: counting took 0.010 real 0.020 user 0.000 sys
pnml2lts-sym: state space has 49226949 states, 26291 nodes
pnml2lts-sym: Maximum sum of /tmp/557/ub_0_ is: 7
pnml2lts-sym: group_next: 1661 nodes total
pnml2lts-sym: group_explored: 1980 nodes, 2735 short vectors total
pnml2lts-sym: max token count: 10

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

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