fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r312-tall-165472281900181
Last Updated
Jun 22, 2022

About the Execution of ITS-Tools for DBSingleClientW-PT-d0m10

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
396.231 12508.00 17623.00 55.40 0 0 1 0 0 1 0 0 0 4 0 0 0 0 0 0 normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r312-tall-165472281900181.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-d0m10, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r312-tall-165472281900181
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 5.4K Jun 7 17:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 52K Jun 7 17:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Jun 7 17:13 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Jun 7 17:13 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Jun 6 15:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 6 15:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Jun 6 15:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 6 15:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 6 12:11 NewModel
-rw-r--r-- 1 mcc users 8.6K Jun 7 17:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 87K Jun 7 17:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Jun 7 17:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Jun 7 17:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Jun 6 15:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Jun 6 15:24 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-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 1654775141729

Running Version 202205111006
[2022-06-09 11:45:42] [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:45:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-09 11:45:43] [INFO ] Load time of PNML (sax parser for PT used): 95 ms
[2022-06-09 11:45:43] [INFO ] Transformed 553 places.
[2022-06-09 11:45:43] [INFO ] Transformed 150 transitions.
[2022-06-09 11:45:43] [INFO ] Parsed PT model containing 553 places and 150 transitions in 196 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Deduced a syphon composed of 444 places in 1 ms
Reduce places removed 444 places and 0 transitions.
FORMULA DBSingleClientW-PT-d0m10-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m10-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m10-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m10-UpperBounds-04 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-08 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-13 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
[2022-06-09 11:45:43] [INFO ] Computed 6 place invariants in 23 ms
Incomplete random walk after 10000 steps, including 2293 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 3) seen :2
FORMULA DBSingleClientW-PT-d0m10-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 1062 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :2
Incomplete Best-First random walk after 10001 steps, including 947 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :2
// Phase 1: matrix 150 rows 109 cols
[2022-06-09 11:45:43] [INFO ] Computed 6 place invariants in 5 ms
[2022-06-09 11:45:43] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2022-06-09 11:45:43] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 3 ms returned unsat
[2022-06-09 11:45:43] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-06-09 11:45:43] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2022-06-09 11:45:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 11:45:43] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2022-06-09 11:45:43] [INFO ] State equation strengthened by 74 read => feed constraints.
[2022-06-09 11:45:43] [INFO ] [Real]Added 74 Read/Feed constraints in 12 ms returned sat
[2022-06-09 11:45:43] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 11:45:43] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2022-06-09 11:45:43] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2022-06-09 11:45:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 11:45:43] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2022-06-09 11:45:43] [INFO ] [Nat]Added 74 Read/Feed constraints in 10 ms returned sat
[2022-06-09 11:45:43] [INFO ] Computed and/alt/rep : 39/69/39 causal constraints (skipped 110 transitions) in 19 ms.
[2022-06-09 11:45:43] [INFO ] Added : 2 causal constraints over 1 iterations in 40 ms. Result :sat
Minimization took 18 ms.
Current structural bounds on expressions (after SMT) : [1, 5] Max seen :[1, 1]
FORMULA DBSingleClientW-PT-d0m10-UpperBounds-02 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 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 38 place count 77 transition count 95
Iterating global reduction 1 with 24 rules applied. Total rules applied 62 place count 77 transition count 95
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 63 place count 77 transition count 94
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 75 place count 65 transition count 82
Iterating global reduction 2 with 12 rules applied. Total rules applied 87 place count 65 transition count 82
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 89 place count 65 transition count 80
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 91 place count 63 transition count 77
Iterating global reduction 3 with 2 rules applied. Total rules applied 93 place count 63 transition count 77
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 94 place count 63 transition count 76
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
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 97 place count 61 transition count 73
Iterating global reduction 4 with 1 rules applied. Total rules applied 98 place count 61 transition count 73
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 99 place count 60 transition count 72
Iterating global reduction 4 with 1 rules applied. Total rules applied 100 place count 60 transition count 72
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 102 place count 60 transition count 70
Applied a total of 102 rules in 50 ms. Remains 60 /109 variables (removed 49) and now considering 70/150 (removed 80) transitions.
Finished structural reductions, in 1 iterations. Remains : 60/109 places, 70/150 transitions.
// Phase 1: matrix 70 rows 60 cols
[2022-06-09 11:45:43] [INFO ] Computed 2 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 228705 resets, run finished after 707 ms. (steps per millisecond=1414 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000000 steps, including 101335 resets, run finished after 357 ms. (steps per millisecond=2801 ) properties (out of 1) seen :3
// Phase 1: matrix 70 rows 60 cols
[2022-06-09 11:45:44] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 11:45:44] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 11:45:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 11:45:44] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2022-06-09 11:45:44] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 11:45:44] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 11:45:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 11:45:44] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2022-06-09 11:45:44] [INFO ] State equation strengthened by 20 read => feed constraints.
[2022-06-09 11:45:44] [INFO ] [Nat]Added 20 Read/Feed constraints in 2 ms returned sat
[2022-06-09 11:45:44] [INFO ] Computed and/alt/rep : 19/42/19 causal constraints (skipped 50 transitions) in 6 ms.
[2022-06-09 11:45:44] [INFO ] Added : 2 causal constraints over 1 iterations in 16 ms. Result :sat
Minimization took 10 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[3]
Support contains 1 out of 60 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 60/60 places, 70/70 transitions.
Applied a total of 0 rules in 7 ms. Remains 60 /60 variables (removed 0) and now considering 70/70 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 60/60 places, 70/70 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 60/60 places, 70/70 transitions.
Applied a total of 0 rules in 4 ms. Remains 60 /60 variables (removed 0) and now considering 70/70 (removed 0) transitions.
// Phase 1: matrix 70 rows 60 cols
[2022-06-09 11:45:44] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:45:44] [INFO ] Implicit Places using invariants in 46 ms returned []
// Phase 1: matrix 70 rows 60 cols
[2022-06-09 11:45:44] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 11:45:45] [INFO ] State equation strengthened by 20 read => feed constraints.
[2022-06-09 11:45:45] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
[2022-06-09 11:45:45] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 70 rows 60 cols
[2022-06-09 11:45:45] [INFO ] Computed 2 place invariants in 10 ms
[2022-06-09 11:45:45] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 60/60 places, 70/70 transitions.
// Phase 1: matrix 70 rows 60 cols
[2022-06-09 11:45:45] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 229225 resets, run finished after 608 ms. (steps per millisecond=1644 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000001 steps, including 101300 resets, run finished after 318 ms. (steps per millisecond=3144 ) properties (out of 1) seen :2
// Phase 1: matrix 70 rows 60 cols
[2022-06-09 11:45:46] [INFO ] Computed 2 place invariants in 7 ms
[2022-06-09 11:45:46] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 11:45:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 11:45:46] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2022-06-09 11:45:46] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 11:45:46] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 11:45:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 11:45:46] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2022-06-09 11:45:46] [INFO ] State equation strengthened by 20 read => feed constraints.
[2022-06-09 11:45:46] [INFO ] [Nat]Added 20 Read/Feed constraints in 2 ms returned sat
[2022-06-09 11:45:46] [INFO ] Computed and/alt/rep : 19/42/19 causal constraints (skipped 50 transitions) in 6 ms.
[2022-06-09 11:45:46] [INFO ] Added : 2 causal constraints over 1 iterations in 14 ms. Result :sat
Minimization took 8 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[3]
Support contains 1 out of 60 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 60/60 places, 70/70 transitions.
Applied a total of 0 rules in 4 ms. Remains 60 /60 variables (removed 0) and now considering 70/70 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 60/60 places, 70/70 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 60/60 places, 70/70 transitions.
Applied a total of 0 rules in 5 ms. Remains 60 /60 variables (removed 0) and now considering 70/70 (removed 0) transitions.
// Phase 1: matrix 70 rows 60 cols
[2022-06-09 11:45:46] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:45:46] [INFO ] Implicit Places using invariants in 52 ms returned []
// Phase 1: matrix 70 rows 60 cols
[2022-06-09 11:45:46] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:45:46] [INFO ] State equation strengthened by 20 read => feed constraints.
[2022-06-09 11:45:46] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 128 ms to find 0 implicit places.
[2022-06-09 11:45:46] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 70 rows 60 cols
[2022-06-09 11:45:46] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:45:46] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 60/60 places, 70/70 transitions.
Starting property specific reduction for DBSingleClientW-PT-d0m10-UpperBounds-09
// Phase 1: matrix 70 rows 60 cols
[2022-06-09 11:45:46] [INFO ] Computed 2 place invariants in 0 ms
Incomplete random walk after 10000 steps, including 2290 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10000 steps, including 1014 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :1
// Phase 1: matrix 70 rows 60 cols
[2022-06-09 11:45:46] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:45:46] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 11:45:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 11:45:46] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2022-06-09 11:45:46] [INFO ] State equation strengthened by 20 read => feed constraints.
[2022-06-09 11:45:46] [INFO ] [Real]Added 20 Read/Feed constraints in 3 ms returned sat
[2022-06-09 11:45:46] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 11:45:46] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 11:45:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 11:45:46] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2022-06-09 11:45:46] [INFO ] [Nat]Added 20 Read/Feed constraints in 2 ms returned sat
[2022-06-09 11:45:46] [INFO ] Computed and/alt/rep : 19/42/19 causal constraints (skipped 50 transitions) in 6 ms.
[2022-06-09 11:45:46] [INFO ] Added : 2 causal constraints over 1 iterations in 21 ms. Result :sat
Minimization took 9 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[1]
Support contains 1 out of 60 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 60/60 places, 70/70 transitions.
Applied a total of 0 rules in 8 ms. Remains 60 /60 variables (removed 0) and now considering 70/70 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 60/60 places, 70/70 transitions.
// Phase 1: matrix 70 rows 60 cols
[2022-06-09 11:45:46] [INFO ] Computed 2 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 228894 resets, run finished after 605 ms. (steps per millisecond=1652 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000000 steps, including 101049 resets, run finished after 322 ms. (steps per millisecond=3105 ) properties (out of 1) seen :2
// Phase 1: matrix 70 rows 60 cols
[2022-06-09 11:45:47] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:45:47] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 11:45:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 11:45:47] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2022-06-09 11:45:47] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 11:45:47] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 11:45:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 11:45:47] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2022-06-09 11:45:47] [INFO ] State equation strengthened by 20 read => feed constraints.
[2022-06-09 11:45:47] [INFO ] [Nat]Added 20 Read/Feed constraints in 3 ms returned sat
[2022-06-09 11:45:47] [INFO ] Computed and/alt/rep : 19/42/19 causal constraints (skipped 50 transitions) in 5 ms.
[2022-06-09 11:45:47] [INFO ] Added : 2 causal constraints over 1 iterations in 13 ms. Result :sat
Minimization took 8 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[3]
Support contains 1 out of 60 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 60/60 places, 70/70 transitions.
Applied a total of 0 rules in 9 ms. Remains 60 /60 variables (removed 0) and now considering 70/70 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 60/60 places, 70/70 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 60/60 places, 70/70 transitions.
Applied a total of 0 rules in 4 ms. Remains 60 /60 variables (removed 0) and now considering 70/70 (removed 0) transitions.
// Phase 1: matrix 70 rows 60 cols
[2022-06-09 11:45:47] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 11:45:47] [INFO ] Implicit Places using invariants in 42 ms returned []
// Phase 1: matrix 70 rows 60 cols
[2022-06-09 11:45:47] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:45:47] [INFO ] State equation strengthened by 20 read => feed constraints.
[2022-06-09 11:45:47] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
[2022-06-09 11:45:47] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 70 rows 60 cols
[2022-06-09 11:45:47] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 11:45:47] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 60/60 places, 70/70 transitions.
// Phase 1: matrix 70 rows 60 cols
[2022-06-09 11:45:47] [INFO ] Computed 2 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 229345 resets, run finished after 604 ms. (steps per millisecond=1655 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000001 steps, including 101188 resets, run finished after 327 ms. (steps per millisecond=3058 ) properties (out of 1) seen :2
// Phase 1: matrix 70 rows 60 cols
[2022-06-09 11:45:48] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:45:48] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 11:45:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 11:45:48] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2022-06-09 11:45:48] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 11:45:48] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 11:45:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 11:45:48] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2022-06-09 11:45:48] [INFO ] State equation strengthened by 20 read => feed constraints.
[2022-06-09 11:45:48] [INFO ] [Nat]Added 20 Read/Feed constraints in 3 ms returned sat
[2022-06-09 11:45:48] [INFO ] Computed and/alt/rep : 19/42/19 causal constraints (skipped 50 transitions) in 5 ms.
[2022-06-09 11:45:48] [INFO ] Added : 2 causal constraints over 1 iterations in 14 ms. Result :sat
Minimization took 8 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[3]
Support contains 1 out of 60 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 60/60 places, 70/70 transitions.
Applied a total of 0 rules in 7 ms. Remains 60 /60 variables (removed 0) and now considering 70/70 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 60/60 places, 70/70 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 60/60 places, 70/70 transitions.
Applied a total of 0 rules in 6 ms. Remains 60 /60 variables (removed 0) and now considering 70/70 (removed 0) transitions.
// Phase 1: matrix 70 rows 60 cols
[2022-06-09 11:45:48] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 11:45:48] [INFO ] Implicit Places using invariants in 43 ms returned []
// Phase 1: matrix 70 rows 60 cols
[2022-06-09 11:45:48] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 11:45:48] [INFO ] State equation strengthened by 20 read => feed constraints.
[2022-06-09 11:45:48] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
[2022-06-09 11:45:48] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 70 rows 60 cols
[2022-06-09 11:45:48] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 11:45:48] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 60/60 places, 70/70 transitions.
Ending property specific reduction for DBSingleClientW-PT-d0m10-UpperBounds-09 in 2613 ms.
[2022-06-09 11:45:49] [INFO ] Flatten gal took : 28 ms
[2022-06-09 11:45:49] [INFO ] Applying decomposition
[2022-06-09 11:45:49] [INFO ] Flatten gal took : 9 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/graph13411398856665513101.txt' '-o' '/tmp/graph13411398856665513101.bin' '-w' '/tmp/graph13411398856665513101.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph13411398856665513101.bin' '-l' '-1' '-v' '-w' '/tmp/graph13411398856665513101.weights' '-q' '0' '-e' '0.001'
[2022-06-09 11:45:49] [INFO ] Decomposing Gal with order
[2022-06-09 11:45:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-09 11:45:49] [INFO ] Removed a total of 61 redundant transitions.
[2022-06-09 11:45:49] [INFO ] Flatten gal took : 38 ms
[2022-06-09 11:45:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 39 labels/synchronizations in 7 ms.
[2022-06-09 11:45:49] [INFO ] Time to serialize gal into /tmp/UpperBounds3220424061344232202.gal : 4 ms
[2022-06-09 11:45:49] [INFO ] Time to serialize properties into /tmp/UpperBounds12320335506454802849.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/UpperBounds3220424061344232202.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds12320335506454802849.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...275
Loading property file /tmp/UpperBounds12320335506454802849.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,5.93444e+07,4.25601,98116,2174,819,119589,40401,224,355613,78,267902,0
Total reachable state count : 59344430

Verifying 1 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 4
Bounds property DBSingleClientW-PT-d0m10-UpperBounds-09 :0 <= i4.u0.l509 <= 4
FORMULA DBSingleClientW-PT-d0m10-UpperBounds-09 4 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-d0m10-UpperBounds-09,0,4.8545,98116,1,0,119589,40401,296,355613,105,267902,1450
Total runtime 11372 ms.

BK_STOP 1654775154237

--------------------
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-d0m10"
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-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 r312-tall-165472281900181"
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 ;