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.r517-tall-167987243600229.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 itstools
Input is EisenbergMcGuire-PT-04, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r517-tall-167987243600229
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 624K
-rw-r--r-- 1 mcc users 7.3K Mar 23 15:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Mar 23 15:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Mar 23 15:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K Mar 23 15:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 23 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 23 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 23 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 23 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 11K Mar 23 15:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 96K Mar 23 15:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Mar 23 15:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 48K Mar 23 15:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 23 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 23 07:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 255K Mar 31 16:48 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 EisenbergMcGuire-PT-04-UpperBounds-00
FORMULA_NAME EisenbergMcGuire-PT-04-UpperBounds-01
FORMULA_NAME EisenbergMcGuire-PT-04-UpperBounds-02
FORMULA_NAME EisenbergMcGuire-PT-04-UpperBounds-03
FORMULA_NAME EisenbergMcGuire-PT-04-UpperBounds-04
FORMULA_NAME EisenbergMcGuire-PT-04-UpperBounds-05
FORMULA_NAME EisenbergMcGuire-PT-04-UpperBounds-06
FORMULA_NAME EisenbergMcGuire-PT-04-UpperBounds-07
FORMULA_NAME EisenbergMcGuire-PT-04-UpperBounds-08
FORMULA_NAME EisenbergMcGuire-PT-04-UpperBounds-09
FORMULA_NAME EisenbergMcGuire-PT-04-UpperBounds-10
FORMULA_NAME EisenbergMcGuire-PT-04-UpperBounds-11
FORMULA_NAME EisenbergMcGuire-PT-04-UpperBounds-12
FORMULA_NAME EisenbergMcGuire-PT-04-UpperBounds-13
FORMULA_NAME EisenbergMcGuire-PT-04-UpperBounds-14
FORMULA_NAME EisenbergMcGuire-PT-04-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1680822631840

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=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=EisenbergMcGuire-PT-04
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2023-04-06 23:10:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-04-06 23:10:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-06 23:10:33] [INFO ] Load time of PNML (sax parser for PT used): 65 ms
[2023-04-06 23:10:33] [INFO ] Transformed 196 places.
[2023-04-06 23:10:33] [INFO ] Transformed 448 transitions.
[2023-04-06 23:10:33] [INFO ] Found NUPN structural information;
[2023-04-06 23:10:33] [INFO ] Parsed PT model containing 196 places and 448 transitions and 1952 arcs in 129 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
FORMULA EisenbergMcGuire-PT-04-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Normalized transition count is 284 out of 448 initially.
// Phase 1: matrix 284 rows 196 cols
[2023-04-06 23:10:33] [INFO ] Computed 13 invariants in 21 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 15) seen :9
FORMULA EisenbergMcGuire-PT-04-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-04-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-04-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-04-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-04-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-04-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-04-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-04-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-04-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 6) seen :0
[2023-04-06 23:10:33] [INFO ] Flow matrix only has 284 transitions (discarded 164 similar events)
// Phase 1: matrix 284 rows 196 cols
[2023-04-06 23:10:33] [INFO ] Computed 13 invariants in 3 ms
[2023-04-06 23:10:33] [INFO ] [Real]Absence check using 9 positive place invariants in 8 ms returned sat
[2023-04-06 23:10:33] [INFO ] [Real]Absence check using 9 positive and 4 generalized place invariants in 2 ms returned sat
[2023-04-06 23:10:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-06 23:10:33] [INFO ] [Real]Absence check using state equation in 70 ms returned sat
[2023-04-06 23:10:34] [INFO ] Solution in real domain found non-integer solution.
[2023-04-06 23:10:34] [INFO ] [Nat]Absence check using 9 positive place invariants in 5 ms returned sat
[2023-04-06 23:10:34] [INFO ] [Nat]Absence check using 9 positive and 4 generalized place invariants in 1 ms returned sat
[2023-04-06 23:10:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-06 23:10:34] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2023-04-06 23:10:34] [INFO ] State equation strengthened by 112 read => feed constraints.
[2023-04-06 23:10:34] [INFO ] [Nat]Added 112 Read/Feed constraints in 15 ms returned sat
[2023-04-06 23:10:34] [INFO ] Computed and/alt/rep : 296/974/260 causal constraints (skipped 20 transitions) in 31 ms.
[2023-04-06 23:10:35] [INFO ] Deduced a trap composed of 4 places in 86 ms of which 5 ms to minimize.
[2023-04-06 23:10:35] [INFO ] Deduced a trap composed of 26 places in 94 ms of which 1 ms to minimize.
[2023-04-06 23:10:35] [INFO ] Deduced a trap composed of 22 places in 88 ms of which 1 ms to minimize.
[2023-04-06 23:10:35] [INFO ] Deduced a trap composed of 14 places in 86 ms of which 1 ms to minimize.
[2023-04-06 23:10:35] [INFO ] Deduced a trap composed of 43 places in 65 ms of which 0 ms to minimize.
[2023-04-06 23:10:35] [INFO ] Deduced a trap composed of 36 places in 65 ms of which 1 ms to minimize.
[2023-04-06 23:10:35] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 669 ms
[2023-04-06 23:10:35] [INFO ] Added : 149 causal constraints over 31 iterations in 1492 ms. Result :sat
Minimization took 115 ms.
[2023-04-06 23:10:35] [INFO ] [Real]Absence check using 9 positive place invariants in 4 ms returned sat
[2023-04-06 23:10:35] [INFO ] [Real]Absence check using 9 positive and 4 generalized place invariants in 4 ms returned sat
[2023-04-06 23:10:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-06 23:10:35] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2023-04-06 23:10:35] [INFO ] Solution in real domain found non-integer solution.
[2023-04-06 23:10:35] [INFO ] [Nat]Absence check using 9 positive place invariants in 5 ms returned sat
[2023-04-06 23:10:35] [INFO ] [Nat]Absence check using 9 positive and 4 generalized place invariants in 1 ms returned sat
[2023-04-06 23:10:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-06 23:10:36] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2023-04-06 23:10:36] [INFO ] [Nat]Added 112 Read/Feed constraints in 12 ms returned sat
[2023-04-06 23:10:36] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 0 ms to minimize.
[2023-04-06 23:10:36] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-04-06 23:10:36] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 0 ms to minimize.
[2023-04-06 23:10:36] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 169 ms
[2023-04-06 23:10:36] [INFO ] Computed and/alt/rep : 296/974/260 causal constraints (skipped 20 transitions) in 21 ms.
[2023-04-06 23:10:36] [INFO ] Added : 101 causal constraints over 21 iterations in 475 ms. Result :sat
Minimization took 62 ms.
[2023-04-06 23:10:36] [INFO ] [Real]Absence check using 9 positive place invariants in 4 ms returned sat
[2023-04-06 23:10:36] [INFO ] [Real]Absence check using 9 positive and 4 generalized place invariants in 1 ms returned sat
[2023-04-06 23:10:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-06 23:10:36] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2023-04-06 23:10:36] [INFO ] Solution in real domain found non-integer solution.
[2023-04-06 23:10:36] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2023-04-06 23:10:36] [INFO ] [Nat]Absence check using 9 positive and 4 generalized place invariants in 2 ms returned sat
[2023-04-06 23:10:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-06 23:10:36] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2023-04-06 23:10:37] [INFO ] [Nat]Added 112 Read/Feed constraints in 10 ms returned sat
[2023-04-06 23:10:37] [INFO ] Deduced a trap composed of 82 places in 54 ms of which 0 ms to minimize.
[2023-04-06 23:10:37] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 0 ms to minimize.
[2023-04-06 23:10:37] [INFO ] Deduced a trap composed of 36 places in 55 ms of which 0 ms to minimize.
[2023-04-06 23:10:37] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 0 ms to minimize.
[2023-04-06 23:10:37] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 1 ms to minimize.
[2023-04-06 23:10:37] [INFO ] Deduced a trap composed of 45 places in 37 ms of which 1 ms to minimize.
[2023-04-06 23:10:37] [INFO ] Deduced a trap composed of 48 places in 43 ms of which 0 ms to minimize.
[2023-04-06 23:10:37] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 490 ms
[2023-04-06 23:10:37] [INFO ] Computed and/alt/rep : 296/974/260 causal constraints (skipped 20 transitions) in 20 ms.
[2023-04-06 23:10:38] [INFO ] Added : 159 causal constraints over 32 iterations in 767 ms. Result :sat
Minimization took 83 ms.
[2023-04-06 23:10:38] [INFO ] [Real]Absence check using 9 positive place invariants in 5 ms returned sat
[2023-04-06 23:10:38] [INFO ] [Real]Absence check using 9 positive and 4 generalized place invariants in 2 ms returned sat
[2023-04-06 23:10:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-06 23:10:38] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2023-04-06 23:10:38] [INFO ] Solution in real domain found non-integer solution.
[2023-04-06 23:10:38] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2023-04-06 23:10:38] [INFO ] [Nat]Absence check using 9 positive and 4 generalized place invariants in 1 ms returned sat
[2023-04-06 23:10:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-06 23:10:38] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2023-04-06 23:10:38] [INFO ] [Nat]Added 112 Read/Feed constraints in 13 ms returned sat
[2023-04-06 23:10:38] [INFO ] Deduced a trap composed of 3 places in 69 ms of which 1 ms to minimize.
[2023-04-06 23:10:38] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 0 ms to minimize.
[2023-04-06 23:10:38] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 1 ms to minimize.
[2023-04-06 23:10:38] [INFO ] Deduced a trap composed of 6 places in 60 ms of which 0 ms to minimize.
[2023-04-06 23:10:38] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 0 ms to minimize.
[2023-04-06 23:10:38] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 0 ms to minimize.
[2023-04-06 23:10:39] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 0 ms to minimize.
[2023-04-06 23:10:39] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-04-06 23:10:39] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 496 ms
[2023-04-06 23:10:39] [INFO ] Computed and/alt/rep : 296/974/260 causal constraints (skipped 20 transitions) in 18 ms.
[2023-04-06 23:10:39] [INFO ] Deduced a trap composed of 42 places in 44 ms of which 0 ms to minimize.
[2023-04-06 23:10:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 81 ms
[2023-04-06 23:10:39] [INFO ] Added : 173 causal constraints over 36 iterations in 863 ms. Result :sat
Minimization took 83 ms.
[2023-04-06 23:10:40] [INFO ] [Real]Absence check using 9 positive place invariants in 5 ms returned sat
[2023-04-06 23:10:40] [INFO ] [Real]Absence check using 9 positive and 4 generalized place invariants in 1 ms returned sat
[2023-04-06 23:10:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-06 23:10:40] [INFO ] [Real]Absence check using state equation in 65 ms returned sat
[2023-04-06 23:10:40] [INFO ] Solution in real domain found non-integer solution.
[2023-04-06 23:10:40] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2023-04-06 23:10:40] [INFO ] [Nat]Absence check using 9 positive and 4 generalized place invariants in 1 ms returned sat
[2023-04-06 23:10:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-06 23:10:40] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2023-04-06 23:10:40] [INFO ] [Nat]Added 112 Read/Feed constraints in 10 ms returned sat
[2023-04-06 23:10:40] [INFO ] Deduced a trap composed of 59 places in 53 ms of which 0 ms to minimize.
[2023-04-06 23:10:40] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
[2023-04-06 23:10:40] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 0 ms to minimize.
[2023-04-06 23:10:40] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 0 ms to minimize.
[2023-04-06 23:10:40] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 0 ms to minimize.
[2023-04-06 23:10:40] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 303 ms
[2023-04-06 23:10:40] [INFO ] Computed and/alt/rep : 296/974/260 causal constraints (skipped 20 transitions) in 18 ms.
[2023-04-06 23:10:41] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 0 ms to minimize.
[2023-04-06 23:10:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 99 ms
[2023-04-06 23:10:41] [INFO ] Added : 143 causal constraints over 29 iterations in 763 ms. Result :sat
Minimization took 67 ms.
[2023-04-06 23:10:41] [INFO ] [Real]Absence check using 9 positive place invariants in 4 ms returned sat
[2023-04-06 23:10:41] [INFO ] [Real]Absence check using 9 positive and 4 generalized place invariants in 8 ms returned sat
[2023-04-06 23:10:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-06 23:10:41] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2023-04-06 23:10:41] [INFO ] Solution in real domain found non-integer solution.
[2023-04-06 23:10:41] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2023-04-06 23:10:41] [INFO ] [Nat]Absence check using 9 positive and 4 generalized place invariants in 1 ms returned sat
[2023-04-06 23:10:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-06 23:10:41] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2023-04-06 23:10:41] [INFO ] [Nat]Added 112 Read/Feed constraints in 9 ms returned sat
[2023-04-06 23:10:41] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 0 ms to minimize.
[2023-04-06 23:10:41] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 0 ms to minimize.
[2023-04-06 23:10:41] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 0 ms to minimize.
[2023-04-06 23:10:41] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 3 ms to minimize.
[2023-04-06 23:10:41] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 256 ms
[2023-04-06 23:10:41] [INFO ] Computed and/alt/rep : 296/974/260 causal constraints (skipped 20 transitions) in 21 ms.
[2023-04-06 23:10:42] [INFO ] Deduced a trap composed of 3 places in 84 ms of which 0 ms to minimize.
[2023-04-06 23:10:43] [INFO ] Deduced a trap composed of 39 places in 61 ms of which 0 ms to minimize.
[2023-04-06 23:10:43] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 0 ms to minimize.
[2023-04-06 23:10:43] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 1 ms to minimize.
[2023-04-06 23:10:43] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 0 ms to minimize.
[2023-04-06 23:10:43] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 466 ms
[2023-04-06 23:10:43] [INFO ] Added : 209 causal constraints over 43 iterations in 1534 ms. Result :sat
Minimization took 120 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0]
FORMULA EisenbergMcGuire-PT-04-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA EisenbergMcGuire-PT-04-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA EisenbergMcGuire-PT-04-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 3 out of 196 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 196/196 places, 448/448 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 196 transition count 444
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 192 transition count 444
Performed 52 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 52 Pre rules applied. Total rules applied 8 place count 192 transition count 392
Deduced a syphon composed of 52 places in 2 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 2 with 104 rules applied. Total rules applied 112 place count 140 transition count 392
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 124 place count 128 transition count 344
Iterating global reduction 2 with 12 rules applied. Total rules applied 136 place count 128 transition count 344
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 160 place count 116 transition count 332
Applied a total of 160 rules in 59 ms. Remains 116 /196 variables (removed 80) and now considering 332/448 (removed 116) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60 ms. Remains : 116/196 places, 332/448 transitions.
Normalized transition count is 168 out of 332 initially.
// Phase 1: matrix 168 rows 116 cols
[2023-04-06 23:10:43] [INFO ] Computed 13 invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1031 ms. (steps per millisecond=969 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 338 ms. (steps per millisecond=2958 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 321 ms. (steps per millisecond=3115 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 313 ms. (steps per millisecond=3194 ) properties (out of 3) seen :0
[2023-04-06 23:10:45] [INFO ] Flow matrix only has 168 transitions (discarded 164 similar events)
// Phase 1: matrix 168 rows 116 cols
[2023-04-06 23:10:45] [INFO ] Computed 13 invariants in 2 ms
[2023-04-06 23:10:45] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-04-06 23:10:45] [INFO ] [Real]Absence check using 9 positive and 4 generalized place invariants in 1 ms returned sat
[2023-04-06 23:10:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-06 23:10:45] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2023-04-06 23:10:45] [INFO ] Solution in real domain found non-integer solution.
[2023-04-06 23:10:45] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-04-06 23:10:45] [INFO ] [Nat]Absence check using 9 positive and 4 generalized place invariants in 1 ms returned sat
[2023-04-06 23:10:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-06 23:10:46] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2023-04-06 23:10:46] [INFO ] State equation strengthened by 76 read => feed constraints.
[2023-04-06 23:10:46] [INFO ] [Nat]Added 76 Read/Feed constraints in 16 ms returned sat
[2023-04-06 23:10:46] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-04-06 23:10:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 34 ms
[2023-04-06 23:10:46] [INFO ] Computed and/alt/rep : 165/496/129 causal constraints (skipped 35 transitions) in 11 ms.
[2023-04-06 23:10:46] [INFO ] Added : 43 causal constraints over 9 iterations in 112 ms. Result :sat
Minimization took 28 ms.
[2023-04-06 23:10:46] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-04-06 23:10:46] [INFO ] [Real]Absence check using 9 positive and 4 generalized place invariants in 1 ms returned sat
[2023-04-06 23:10:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-06 23:10:46] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2023-04-06 23:10:46] [INFO ] Solution in real domain found non-integer solution.
[2023-04-06 23:10:46] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-04-06 23:10:46] [INFO ] [Nat]Absence check using 9 positive and 4 generalized place invariants in 1 ms returned sat
[2023-04-06 23:10:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-06 23:10:46] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2023-04-06 23:10:46] [INFO ] [Nat]Added 76 Read/Feed constraints in 7 ms returned sat
[2023-04-06 23:10:46] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 0 ms to minimize.
[2023-04-06 23:10:46] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 0 ms to minimize.
[2023-04-06 23:10:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 84 ms
[2023-04-06 23:10:46] [INFO ] Computed and/alt/rep : 165/496/129 causal constraints (skipped 35 transitions) in 12 ms.
[2023-04-06 23:10:46] [INFO ] Added : 22 causal constraints over 5 iterations in 67 ms. Result :sat
Minimization took 23 ms.
[2023-04-06 23:10:46] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-04-06 23:10:46] [INFO ] [Real]Absence check using 9 positive and 4 generalized place invariants in 1 ms returned sat
[2023-04-06 23:10:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-06 23:10:46] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2023-04-06 23:10:46] [INFO ] Solution in real domain found non-integer solution.
[2023-04-06 23:10:46] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-04-06 23:10:46] [INFO ] [Nat]Absence check using 9 positive and 4 generalized place invariants in 4 ms returned sat
[2023-04-06 23:10:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-06 23:10:46] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2023-04-06 23:10:46] [INFO ] [Nat]Added 76 Read/Feed constraints in 7 ms returned sat
[2023-04-06 23:10:46] [INFO ] Computed and/alt/rep : 165/496/129 causal constraints (skipped 35 transitions) in 11 ms.
[2023-04-06 23:10:46] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-04-06 23:10:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 55 ms
[2023-04-06 23:10:46] [INFO ] Added : 39 causal constraints over 9 iterations in 178 ms. Result :sat
Minimization took 27 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1] Max seen :[0, 0, 0]
FORMULA EisenbergMcGuire-PT-04-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA EisenbergMcGuire-PT-04-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA EisenbergMcGuire-PT-04-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.
Total runtime 13573 ms.

BK_STOP 1680822647809

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="EisenbergMcGuire-PT-04"
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-5348"
echo " Executing tool itstools"
echo " Input is EisenbergMcGuire-PT-04, 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 r517-tall-167987243600229"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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