Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 588K
-rw-r--r-- 1 mcc users 7.4K Jun 7 17:13 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Jun 7 17:13 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Jun 7 17:12 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Jun 7 17:12 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Jun 6 15:23 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Jun 6 15:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Jun 6 15:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 6 15:23 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 6 12:11 NewModel
-rw-r--r-- 1 mcc users 13K Jun 7 17:13 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 146K Jun 7 17:13 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Jun 7 17:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Jun 7 17:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Jun 6 15:23 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Jun 6 15:23 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 equiv_col
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 instance
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 iscolored
-rw-r--r-- 1 mcc users 119K Jun 6 12:11 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-d0m04-UpperBounds-00
FORMULA_NAME DBSingleClientW-PT-d0m04-UpperBounds-01
FORMULA_NAME DBSingleClientW-PT-d0m04-UpperBounds-02
FORMULA_NAME DBSingleClientW-PT-d0m04-UpperBounds-03
FORMULA_NAME DBSingleClientW-PT-d0m04-UpperBounds-04
FORMULA_NAME DBSingleClientW-PT-d0m04-UpperBounds-05
FORMULA_NAME DBSingleClientW-PT-d0m04-UpperBounds-06
FORMULA_NAME DBSingleClientW-PT-d0m04-UpperBounds-07
FORMULA_NAME DBSingleClientW-PT-d0m04-UpperBounds-08
FORMULA_NAME DBSingleClientW-PT-d0m04-UpperBounds-09
FORMULA_NAME DBSingleClientW-PT-d0m04-UpperBounds-10
FORMULA_NAME DBSingleClientW-PT-d0m04-UpperBounds-11
FORMULA_NAME DBSingleClientW-PT-d0m04-UpperBounds-12
FORMULA_NAME DBSingleClientW-PT-d0m04-UpperBounds-13
FORMULA_NAME DBSingleClientW-PT-d0m04-UpperBounds-14
FORMULA_NAME DBSingleClientW-PT-d0m04-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1654774250953

Running Version 202205111006
[2022-06-09 11:30:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-09 11:30:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-09 11:30:52] [INFO ] Load time of PNML (sax parser for PT used): 102 ms
[2022-06-09 11:30:52] [INFO ] Transformed 553 places.
[2022-06-09 11:30:52] [INFO ] Transformed 150 transitions.
[2022-06-09 11:30:52] [INFO ] Parsed PT model containing 553 places and 150 transitions in 221 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Deduced a syphon composed of 444 places in 1 ms
Reduce places removed 444 places and 0 transitions.
FORMULA DBSingleClientW-PT-d0m04-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m04-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m04-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m04-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m04-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m04-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m04-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m04-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m04-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m04-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m04-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m04-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m04-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 150 rows 109 cols
[2022-06-09 11:30:52] [INFO ] Computed 6 place invariants in 23 ms
Incomplete random walk after 10000 steps, including 2323 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10000 steps, including 1008 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 954 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 990 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 3) seen :1
// Phase 1: matrix 150 rows 109 cols
[2022-06-09 11:30:52] [INFO ] Computed 6 place invariants in 5 ms
[2022-06-09 11:30:52] [INFO ] [Real]Absence check using 2 positive place invariants in 6 ms returned sat
[2022-06-09 11:30:52] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 4 ms returned unsat
[2022-06-09 11:30:52] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-06-09 11:30:52] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2022-06-09 11:30:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 11:30:52] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2022-06-09 11:30:52] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 11:30:52] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-06-09 11:30:52] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2022-06-09 11:30:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 11:30:52] [INFO ] [Nat]Absence check using state equation in 44 ms returned sat
[2022-06-09 11:30:52] [INFO ] State equation strengthened by 74 read => feed constraints.
[2022-06-09 11:30:53] [INFO ] [Nat]Added 74 Read/Feed constraints in 11 ms returned sat
[2022-06-09 11:30:53] [INFO ] Computed and/alt/rep : 39/69/39 causal constraints (skipped 110 transitions) in 20 ms.
[2022-06-09 11:30:53] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 8 ms to minimize.
[2022-06-09 11:30:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 100 ms
[2022-06-09 11:30:53] [INFO ] Added : 8 causal constraints over 3 iterations in 188 ms. Result :sat
Minimization took 49 ms.
[2022-06-09 11:30:53] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-06-09 11:30:53] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned unsat
Current structural bounds on expressions (after SMT) : [1, 4, 1] Max seen :[1, 0, 1]
FORMULA DBSingleClientW-PT-d0m04-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DBSingleClientW-PT-d0m04-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 1 out of 109 places. Attempting structural reductions.
Starting structural reductions in SAFETY 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.2 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 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 37 place count 78 transition count 96
Iterating global reduction 1 with 23 rules applied. Total rules applied 60 place count 78 transition count 96
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 61 place count 78 transition count 95
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 72 place count 67 transition count 84
Iterating global reduction 2 with 11 rules applied. Total rules applied 83 place count 67 transition count 84
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 85 place count 67 transition count 82
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 87 place count 65 transition count 79
Iterating global reduction 3 with 2 rules applied. Total rules applied 89 place count 65 transition count 79
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 90 place count 65 transition count 78
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 91 place count 64 transition count 76
Iterating global reduction 4 with 1 rules applied. Total rules applied 92 place count 64 transition count 76
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 93 place count 63 transition count 75
Iterating global reduction 4 with 1 rules applied. Total rules applied 94 place count 63 transition count 75
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 95 place count 62 transition count 74
Iterating global reduction 4 with 1 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
Applied a total of 98 rules in 42 ms. Remains 62 /109 variables (removed 47) and now considering 72/150 (removed 78) transitions.
Finished structural reductions, in 1 iterations. Remains : 62/109 places, 72/150 transitions.
// Phase 1: matrix 72 rows 62 cols
[2022-06-09 11:30:53] [INFO ] Computed 2 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 228995 resets, run finished after 746 ms. (steps per millisecond=1340 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 101489 resets, run finished after 366 ms. (steps per millisecond=2732 ) properties (out of 1) seen :0
// Phase 1: matrix 72 rows 62 cols
[2022-06-09 11:30:54] [INFO ] Computed 2 place invariants in 4 ms
[2022-06-09 11:30:54] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 11:30:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 11:30:54] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2022-06-09 11:30:54] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 11:30:54] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 11:30:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 11:30:54] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2022-06-09 11:30:54] [INFO ] State equation strengthened by 21 read => feed constraints.
[2022-06-09 11:30:54] [INFO ] [Nat]Added 21 Read/Feed constraints in 3 ms returned sat
[2022-06-09 11:30:54] [INFO ] Computed and/alt/rep : 20/43/20 causal constraints (skipped 51 transitions) in 12 ms.
[2022-06-09 11:30:54] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
[2022-06-09 11:30:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 47 ms
[2022-06-09 11:30:54] [INFO ] Added : 9 causal constraints over 2 iterations in 87 ms. Result :sat
Minimization took 21 ms.
Current structural bounds on expressions (after SMT) : [4] Max seen :[0]
Support contains 1 out of 62 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 62/62 places, 72/72 transitions.
Applied a total of 0 rules in 8 ms. Remains 62 /62 variables (removed 0) and now considering 72/72 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 62/62 places, 72/72 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 62/62 places, 72/72 transitions.
Applied a total of 0 rules in 4 ms. Remains 62 /62 variables (removed 0) and now considering 72/72 (removed 0) transitions.
// Phase 1: matrix 72 rows 62 cols
[2022-06-09 11:30:54] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 11:30:54] [INFO ] Implicit Places using invariants in 48 ms returned []
// Phase 1: matrix 72 rows 62 cols
[2022-06-09 11:30:54] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:30:54] [INFO ] State equation strengthened by 21 read => feed constraints.
[2022-06-09 11:30:54] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 137 ms to find 0 implicit places.
[2022-06-09 11:30:54] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 72 rows 62 cols
[2022-06-09 11:30:54] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-09 11:30:54] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 62/62 places, 72/72 transitions.
Starting property specific reduction for DBSingleClientW-PT-d0m04-UpperBounds-03
// Phase 1: matrix 72 rows 62 cols
[2022-06-09 11:30:55] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2285 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 1017 resets, run finished after 4 ms. (steps per millisecond=2500 ) properties (out of 1) seen :0
// Phase 1: matrix 72 rows 62 cols
[2022-06-09 11:30:55] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:30:55] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 11:30:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 11:30:55] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2022-06-09 11:30:55] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 11:30:55] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 11:30:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 11:30:55] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2022-06-09 11:30:55] [INFO ] State equation strengthened by 21 read => feed constraints.
[2022-06-09 11:30:55] [INFO ] [Nat]Added 21 Read/Feed constraints in 3 ms returned sat
[2022-06-09 11:30:55] [INFO ] Computed and/alt/rep : 20/43/20 causal constraints (skipped 51 transitions) in 6 ms.
[2022-06-09 11:30:55] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2022-06-09 11:30:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 53 ms
[2022-06-09 11:30:55] [INFO ] Added : 9 causal constraints over 2 iterations in 85 ms. Result :sat
Minimization took 21 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 62 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 62/62 places, 72/72 transitions.
Applied a total of 0 rules in 7 ms. Remains 62 /62 variables (removed 0) and now considering 72/72 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 62/62 places, 72/72 transitions.
// Phase 1: matrix 72 rows 62 cols
[2022-06-09 11:30:55] [INFO ] Computed 2 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 229265 resets, run finished after 647 ms. (steps per millisecond=1545 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 101727 resets, run finished after 337 ms. (steps per millisecond=2967 ) properties (out of 1) seen :1
// Phase 1: matrix 72 rows 62 cols
[2022-06-09 11:30:56] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:30:56] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 11:30:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 11:30:56] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2022-06-09 11:30:56] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 11:30:56] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 11:30:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 11:30:56] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2022-06-09 11:30:56] [INFO ] State equation strengthened by 21 read => feed constraints.
[2022-06-09 11:30:56] [INFO ] [Nat]Added 21 Read/Feed constraints in 4 ms returned sat
[2022-06-09 11:30:56] [INFO ] Computed and/alt/rep : 20/43/20 causal constraints (skipped 51 transitions) in 8 ms.
[2022-06-09 11:30:56] [INFO ] Added : 6 causal constraints over 2 iterations in 28 ms. Result :sat
Minimization took 16 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[1]
Support contains 1 out of 62 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 62/62 places, 72/72 transitions.
Applied a total of 0 rules in 7 ms. Remains 62 /62 variables (removed 0) and now considering 72/72 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 62/62 places, 72/72 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 62/62 places, 72/72 transitions.
Applied a total of 0 rules in 7 ms. Remains 62 /62 variables (removed 0) and now considering 72/72 (removed 0) transitions.
// Phase 1: matrix 72 rows 62 cols
[2022-06-09 11:30:56] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:30:56] [INFO ] Implicit Places using invariants in 48 ms returned []
// Phase 1: matrix 72 rows 62 cols
[2022-06-09 11:30:56] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:30:56] [INFO ] State equation strengthened by 21 read => feed constraints.
[2022-06-09 11:30:56] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 139 ms to find 0 implicit places.
[2022-06-09 11:30:56] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 72 rows 62 cols
[2022-06-09 11:30:56] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 11:30:56] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 62/62 places, 72/72 transitions.
// Phase 1: matrix 72 rows 62 cols
[2022-06-09 11:30:56] [INFO ] Computed 2 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 229515 resets, run finished after 671 ms. (steps per millisecond=1490 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 101660 resets, run finished after 342 ms. (steps per millisecond=2923 ) properties (out of 1) seen :0
// Phase 1: matrix 72 rows 62 cols
[2022-06-09 11:30:57] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:30:57] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 11:30:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 11:30:57] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2022-06-09 11:30:57] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 11:30:57] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 11:30:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 11:30:57] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2022-06-09 11:30:57] [INFO ] State equation strengthened by 21 read => feed constraints.
[2022-06-09 11:30:57] [INFO ] [Nat]Added 21 Read/Feed constraints in 4 ms returned sat
[2022-06-09 11:30:57] [INFO ] Computed and/alt/rep : 20/43/20 causal constraints (skipped 51 transitions) in 6 ms.
[2022-06-09 11:30:57] [INFO ] Added : 6 causal constraints over 2 iterations in 30 ms. Result :sat
Minimization took 16 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[1]
Support contains 1 out of 62 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 62/62 places, 72/72 transitions.
Applied a total of 0 rules in 9 ms. Remains 62 /62 variables (removed 0) and now considering 72/72 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 62/62 places, 72/72 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 62/62 places, 72/72 transitions.
Applied a total of 0 rules in 4 ms. Remains 62 /62 variables (removed 0) and now considering 72/72 (removed 0) transitions.
// Phase 1: matrix 72 rows 62 cols
[2022-06-09 11:30:57] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 11:30:57] [INFO ] Implicit Places using invariants in 53 ms returned []
// Phase 1: matrix 72 rows 62 cols
[2022-06-09 11:30:57] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 11:30:57] [INFO ] State equation strengthened by 21 read => feed constraints.
[2022-06-09 11:30:57] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 146 ms to find 0 implicit places.
[2022-06-09 11:30:57] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 72 rows 62 cols
[2022-06-09 11:30:57] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:30:58] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 62/62 places, 72/72 transitions.
Ending property specific reduction for DBSingleClientW-PT-d0m04-UpperBounds-03 in 3084 ms.
[2022-06-09 11:30:58] [INFO ] Flatten gal took : 34 ms
[2022-06-09 11:30:58] [INFO ] Applying decomposition
[2022-06-09 11:30:58] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph9728378393059285176.txt' '-o' '/tmp/graph9728378393059285176.bin' '-w' '/tmp/graph9728378393059285176.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph9728378393059285176.bin' '-l' '-1' '-v' '-w' '/tmp/graph9728378393059285176.weights' '-q' '0' '-e' '0.001'
[2022-06-09 11:30:58] [INFO ] Decomposing Gal with order
[2022-06-09 11:30:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-09 11:30:58] [INFO ] Removed a total of 60 redundant transitions.
[2022-06-09 11:30:58] [INFO ] Flatten gal took : 41 ms
[2022-06-09 11:30:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 41 labels/synchronizations in 8 ms.
[2022-06-09 11:30:58] [INFO ] Time to serialize gal into /tmp/UpperBounds10736455012000954943.gal : 5 ms
[2022-06-09 11:30:58] [INFO ] Time to serialize properties into /tmp/UpperBounds14442598508992938732.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds10736455012000954943.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds14442598508992938732.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...276
Loading property file /tmp/UpperBounds14442598508992938732.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,4894,0.051772,5552,354,232,2814,1029,274,5302,95,3806,0
Total reachable state count : 4894

Verifying 1 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DBSingleClientW-PT-d0m04-UpperBounds-03 :0 <= i3.u4.l489 <= 1
FORMULA DBSingleClientW-PT-d0m04-UpperBounds-03 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DBSingleClientW-PT-d0m04-UpperBounds-03,0,0.065384,5552,1,0,2814,1029,362,5302,114,3806,414
Total runtime 6296 ms.

BK_STOP 1654774258540

--------------------
content from stderr:

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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-d0m04"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
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-4028"
echo " Executing tool itstools"
echo " Input is DBSingleClientW-PT-d0m04, 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 r312-tall-165472281800133"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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