Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 628K
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 112K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 18K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 112K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.4K Apr 26 07:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 26 07:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 26 07:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 26 07:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Mar 23 10:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 23 10:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.4K Mar 22 17:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 22 17:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 09:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 22 09:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 4 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 247K May 5 16:51 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 Dekker-PT-020-UpperBounds-00
FORMULA_NAME Dekker-PT-020-UpperBounds-01
FORMULA_NAME Dekker-PT-020-UpperBounds-02
FORMULA_NAME Dekker-PT-020-UpperBounds-03
FORMULA_NAME Dekker-PT-020-UpperBounds-04
FORMULA_NAME Dekker-PT-020-UpperBounds-05
FORMULA_NAME Dekker-PT-020-UpperBounds-06
FORMULA_NAME Dekker-PT-020-UpperBounds-07
FORMULA_NAME Dekker-PT-020-UpperBounds-08
FORMULA_NAME Dekker-PT-020-UpperBounds-09
FORMULA_NAME Dekker-PT-020-UpperBounds-10
FORMULA_NAME Dekker-PT-020-UpperBounds-11
FORMULA_NAME Dekker-PT-020-UpperBounds-12
FORMULA_NAME Dekker-PT-020-UpperBounds-13
FORMULA_NAME Dekker-PT-020-UpperBounds-14
FORMULA_NAME Dekker-PT-020-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1620569608078

Running Version 0
[2021-05-09 14:13:29] [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]
[2021-05-09 14:13:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 14:13:29] [INFO ] Load time of PNML (sax parser for PT used): 80 ms
[2021-05-09 14:13:29] [INFO ] Transformed 100 places.
[2021-05-09 14:13:29] [INFO ] Transformed 440 transitions.
[2021-05-09 14:13:29] [INFO ] Found NUPN structural information;
[2021-05-09 14:13:29] [INFO ] Parsed PT model containing 100 places and 440 transitions in 123 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 77 ms.
FORMULA Dekker-PT-020-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-020-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-020-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Normalized transition count is 80 out of 440 initially.
// Phase 1: matrix 80 rows 100 cols
[2021-05-09 14:13:29] [INFO ] Computed 60 place invariants in 19 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 13) seen :11
FORMULA Dekker-PT-020-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Dekker-PT-020-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Dekker-PT-020-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Dekker-PT-020-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Dekker-PT-020-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Dekker-PT-020-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Dekker-PT-020-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Dekker-PT-020-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Dekker-PT-020-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Dekker-PT-020-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Dekker-PT-020-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) 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 2) seen :0
[2021-05-09 14:13:29] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 100 cols
[2021-05-09 14:13:29] [INFO ] Computed 60 place invariants in 6 ms
[2021-05-09 14:13:30] [INFO ] [Real]Absence check using 40 positive place invariants in 10 ms returned sat
[2021-05-09 14:13:30] [INFO ] [Real]Absence check using 40 positive and 20 generalized place invariants in 3 ms returned sat
[2021-05-09 14:13:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 14:13:30] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2021-05-09 14:13:30] [INFO ] State equation strengthened by 20 read => feed constraints.
[2021-05-09 14:13:30] [INFO ] [Real]Added 20 Read/Feed constraints in 4 ms returned sat
[2021-05-09 14:13:30] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 14:13:30] [INFO ] [Nat]Absence check using 40 positive place invariants in 9 ms returned sat
[2021-05-09 14:13:30] [INFO ] [Nat]Absence check using 40 positive and 20 generalized place invariants in 4 ms returned sat
[2021-05-09 14:13:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 14:13:30] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2021-05-09 14:13:30] [INFO ] [Nat]Added 20 Read/Feed constraints in 3 ms returned sat
[2021-05-09 14:13:30] [INFO ] Deduced a trap composed of 6 places in 55 ms of which 2 ms to minimize.
[2021-05-09 14:13:30] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2021-05-09 14:13:30] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2021-05-09 14:13:30] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2021-05-09 14:13:30] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2021-05-09 14:13:30] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2021-05-09 14:13:30] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2021-05-09 14:13:30] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2021-05-09 14:13:30] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2021-05-09 14:13:30] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2021-05-09 14:13:30] [INFO ] Deduced a trap composed of 5 places in 13 ms of which 0 ms to minimize.
[2021-05-09 14:13:30] [INFO ] Deduced a trap composed of 6 places in 11 ms of which 0 ms to minimize.
[2021-05-09 14:13:30] [INFO ] Deduced a trap composed of 4 places in 9 ms of which 0 ms to minimize.
[2021-05-09 14:13:30] [INFO ] Deduced a trap composed of 4 places in 10 ms of which 0 ms to minimize.
[2021-05-09 14:13:30] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 420 ms
[2021-05-09 14:13:30] [INFO ] Computed and/alt/rep : 40/60/40 causal constraints (skipped 20 transitions) in 15 ms.
[2021-05-09 14:13:30] [INFO ] Added : 1 causal constraints over 1 iterations in 30 ms. Result :sat
Minimization took 10 ms.
[2021-05-09 14:13:30] [INFO ] [Real]Absence check using 40 positive place invariants in 6 ms returned sat
[2021-05-09 14:13:30] [INFO ] [Real]Absence check using 40 positive and 20 generalized place invariants in 2 ms returned sat
[2021-05-09 14:13:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 14:13:30] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2021-05-09 14:13:30] [INFO ] [Real]Added 20 Read/Feed constraints in 11 ms returned sat
[2021-05-09 14:13:30] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 14:13:30] [INFO ] [Nat]Absence check using 40 positive place invariants in 7 ms returned sat
[2021-05-09 14:13:30] [INFO ] [Nat]Absence check using 40 positive and 20 generalized place invariants in 3 ms returned sat
[2021-05-09 14:13:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 14:13:30] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2021-05-09 14:13:30] [INFO ] [Nat]Added 20 Read/Feed constraints in 2 ms returned sat
[2021-05-09 14:13:30] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 1 ms to minimize.
[2021-05-09 14:13:30] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2021-05-09 14:13:30] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2021-05-09 14:13:30] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2021-05-09 14:13:30] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2021-05-09 14:13:30] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2021-05-09 14:13:30] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 0 ms to minimize.
[2021-05-09 14:13:31] [INFO ] Deduced a trap composed of 5 places in 11 ms of which 1 ms to minimize.
[2021-05-09 14:13:31] [INFO ] Deduced a trap composed of 5 places in 11 ms of which 0 ms to minimize.
[2021-05-09 14:13:31] [INFO ] Deduced a trap composed of 6 places in 13 ms of which 0 ms to minimize.
[2021-05-09 14:13:31] [INFO ] Deduced a trap composed of 4 places in 8 ms of which 0 ms to minimize.
[2021-05-09 14:13:31] [INFO ] Deduced a trap composed of 4 places in 12 ms of which 1 ms to minimize.
[2021-05-09 14:13:31] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 0 ms to minimize.
[2021-05-09 14:13:31] [INFO ] Deduced a trap composed of 5 places in 11 ms of which 1 ms to minimize.
[2021-05-09 14:13:31] [INFO ] Deduced a trap composed of 6 places in 12 ms of which 1 ms to minimize.
[2021-05-09 14:13:31] [INFO ] Deduced a trap composed of 4 places in 8 ms of which 1 ms to minimize.
[2021-05-09 14:13:31] [INFO ] Deduced a trap composed of 4 places in 8 ms of which 1 ms to minimize.
[2021-05-09 14:13:31] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 302 ms
[2021-05-09 14:13:31] [INFO ] Computed and/alt/rep : 40/60/40 causal constraints (skipped 20 transitions) in 11 ms.
[2021-05-09 14:13:31] [INFO ] Added : 1 causal constraints over 1 iterations in 23 ms. Result :sat
Minimization took 11 ms.
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
Incomplete Parikh walk after 6700 steps, including 108 resets, run finished after 71 ms. (steps per millisecond=94 ) properties (out of 2) seen :1 could not realise parikh vector
FORMULA Dekker-PT-020-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 6900 steps, including 111 resets, run finished after 58 ms. (steps per millisecond=118 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 100 places. Attempting structural reductions.
Drop transitions removed 1 transitions
Starting structural reductions, iteration 0 : 100/100 places, 439/439 transitions.
Applied a total of 0 rules in 41 ms. Remains 100 /100 variables (removed 0) and now considering 439/439 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 100/100 places, 439/439 transitions.
Normalized transition count is 79 out of 439 initially.
// Phase 1: matrix 79 rows 100 cols
[2021-05-09 14:13:31] [INFO ] Computed 60 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 5103 ms. (steps per millisecond=195 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 845 ms. (steps per millisecond=1183 ) properties (out of 1) seen :0
[2021-05-09 14:13:37] [INFO ] Flow matrix only has 79 transitions (discarded 360 similar events)
// Phase 1: matrix 79 rows 100 cols
[2021-05-09 14:13:37] [INFO ] Computed 60 place invariants in 1 ms
[2021-05-09 14:13:37] [INFO ] [Real]Absence check using 40 positive place invariants in 11 ms returned sat
[2021-05-09 14:13:37] [INFO ] [Real]Absence check using 40 positive and 20 generalized place invariants in 2 ms returned sat
[2021-05-09 14:13:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 14:13:37] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2021-05-09 14:13:37] [INFO ] State equation strengthened by 20 read => feed constraints.
[2021-05-09 14:13:37] [INFO ] [Real]Added 20 Read/Feed constraints in 3 ms returned sat
[2021-05-09 14:13:37] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 14:13:37] [INFO ] [Nat]Absence check using 40 positive place invariants in 6 ms returned sat
[2021-05-09 14:13:37] [INFO ] [Nat]Absence check using 40 positive and 20 generalized place invariants in 2 ms returned sat
[2021-05-09 14:13:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 14:13:37] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2021-05-09 14:13:37] [INFO ] [Nat]Added 20 Read/Feed constraints in 3 ms returned sat
[2021-05-09 14:13:37] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 0 ms to minimize.
[2021-05-09 14:13:37] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2021-05-09 14:13:37] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2021-05-09 14:13:37] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2021-05-09 14:13:37] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2021-05-09 14:13:37] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2021-05-09 14:13:37] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2021-05-09 14:13:37] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 1 ms to minimize.
[2021-05-09 14:13:37] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2021-05-09 14:13:37] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 0 ms to minimize.
[2021-05-09 14:13:37] [INFO ] Deduced a trap composed of 5 places in 12 ms of which 0 ms to minimize.
[2021-05-09 14:13:37] [INFO ] Deduced a trap composed of 6 places in 9 ms of which 0 ms to minimize.
[2021-05-09 14:13:37] [INFO ] Deduced a trap composed of 4 places in 10 ms of which 0 ms to minimize.
[2021-05-09 14:13:37] [INFO ] Deduced a trap composed of 4 places in 8 ms of which 0 ms to minimize.
[2021-05-09 14:13:37] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 288 ms
[2021-05-09 14:13:37] [INFO ] Computed and/alt/rep : 39/58/39 causal constraints (skipped 20 transitions) in 10 ms.
[2021-05-09 14:13:37] [INFO ] Added : 1 causal constraints over 1 iterations in 21 ms. Result :sat
Minimization took 11 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 6900 steps, including 111 resets, run finished after 51 ms. (steps per millisecond=135 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 100 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 100/100 places, 439/439 transitions.
Applied a total of 0 rules in 23 ms. Remains 100 /100 variables (removed 0) and now considering 439/439 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 100/100 places, 439/439 transitions.
Starting structural reductions, iteration 0 : 100/100 places, 439/439 transitions.
Applied a total of 0 rules in 19 ms. Remains 100 /100 variables (removed 0) and now considering 439/439 (removed 0) transitions.
[2021-05-09 14:13:37] [INFO ] Flow matrix only has 79 transitions (discarded 360 similar events)
// Phase 1: matrix 79 rows 100 cols
[2021-05-09 14:13:37] [INFO ] Computed 60 place invariants in 2 ms
[2021-05-09 14:13:38] [INFO ] Implicit Places using invariants in 149 ms returned [40, 43, 46, 49, 52, 55, 58, 61, 64, 67, 70, 73, 76, 79, 82, 85, 88, 91, 94, 97]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 151 ms to find 20 implicit places.
[2021-05-09 14:13:38] [INFO ] Redundant transitions in 27 ms returned []
[2021-05-09 14:13:38] [INFO ] Flow matrix only has 79 transitions (discarded 360 similar events)
// Phase 1: matrix 79 rows 80 cols
[2021-05-09 14:13:38] [INFO ] Computed 40 place invariants in 4 ms
[2021-05-09 14:13:38] [INFO ] Dead Transitions using invariants and state equation in 187 ms returned []
Starting structural reductions, iteration 1 : 80/100 places, 439/439 transitions.
Applied a total of 0 rules in 16 ms. Remains 80 /80 variables (removed 0) and now considering 439/439 (removed 0) transitions.
[2021-05-09 14:13:38] [INFO ] Redundant transitions in 7 ms returned []
[2021-05-09 14:13:38] [INFO ] Flow matrix only has 79 transitions (discarded 360 similar events)
// Phase 1: matrix 79 rows 80 cols
[2021-05-09 14:13:38] [INFO ] Computed 40 place invariants in 1 ms
[2021-05-09 14:13:38] [INFO ] Dead Transitions using invariants and state equation in 151 ms returned []
Finished structural reductions, in 2 iterations. Remains : 80/100 places, 439/439 transitions.
Normalized transition count is 79 out of 439 initially.
// Phase 1: matrix 79 rows 80 cols
[2021-05-09 14:13:38] [INFO ] Computed 40 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 4977 ms. (steps per millisecond=200 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 835 ms. (steps per millisecond=1197 ) properties (out of 1) seen :0
[2021-05-09 14:13:44] [INFO ] Flow matrix only has 79 transitions (discarded 360 similar events)
// Phase 1: matrix 79 rows 80 cols
[2021-05-09 14:13:44] [INFO ] Computed 40 place invariants in 1 ms
[2021-05-09 14:13:44] [INFO ] [Real]Absence check using 40 positive place invariants in 5 ms returned sat
[2021-05-09 14:13:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 14:13:44] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2021-05-09 14:13:44] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 14:13:44] [INFO ] [Nat]Absence check using 40 positive place invariants in 6 ms returned sat
[2021-05-09 14:13:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 14:13:44] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2021-05-09 14:13:44] [INFO ] State equation strengthened by 20 read => feed constraints.
[2021-05-09 14:13:44] [INFO ] [Nat]Added 20 Read/Feed constraints in 2 ms returned sat
[2021-05-09 14:13:44] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2021-05-09 14:13:44] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 0 ms to minimize.
[2021-05-09 14:13:44] [INFO ] Deduced a trap composed of 4 places in 12 ms of which 1 ms to minimize.
[2021-05-09 14:13:44] [INFO ] Deduced a trap composed of 4 places in 10 ms of which 0 ms to minimize.
[2021-05-09 14:13:44] [INFO ] Deduced a trap composed of 4 places in 9 ms of which 0 ms to minimize.
[2021-05-09 14:13:44] [INFO ] Deduced a trap composed of 4 places in 10 ms of which 1 ms to minimize.
[2021-05-09 14:13:44] [INFO ] Deduced a trap composed of 4 places in 9 ms of which 0 ms to minimize.
[2021-05-09 14:13:44] [INFO ] Deduced a trap composed of 4 places in 9 ms of which 0 ms to minimize.
[2021-05-09 14:13:44] [INFO ] Deduced a trap composed of 4 places in 8 ms of which 0 ms to minimize.
[2021-05-09 14:13:44] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2021-05-09 14:13:44] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 167 ms
[2021-05-09 14:13:44] [INFO ] Computed and/alt/rep : 39/58/39 causal constraints (skipped 20 transitions) in 10 ms.
[2021-05-09 14:13:44] [INFO ] Added : 1 causal constraints over 1 iterations in 21 ms. Result :sat
Minimization took 9 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 6100 steps, including 98 resets, run finished after 42 ms. (steps per millisecond=145 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 80 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 80/80 places, 439/439 transitions.
Applied a total of 0 rules in 10 ms. Remains 80 /80 variables (removed 0) and now considering 439/439 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 80/80 places, 439/439 transitions.
Starting structural reductions, iteration 0 : 80/80 places, 439/439 transitions.
Applied a total of 0 rules in 10 ms. Remains 80 /80 variables (removed 0) and now considering 439/439 (removed 0) transitions.
[2021-05-09 14:13:44] [INFO ] Flow matrix only has 79 transitions (discarded 360 similar events)
// Phase 1: matrix 79 rows 80 cols
[2021-05-09 14:13:44] [INFO ] Computed 40 place invariants in 1 ms
[2021-05-09 14:13:44] [INFO ] Implicit Places using invariants in 208 ms returned []
[2021-05-09 14:13:44] [INFO ] Flow matrix only has 79 transitions (discarded 360 similar events)
// Phase 1: matrix 79 rows 80 cols
[2021-05-09 14:13:44] [INFO ] Computed 40 place invariants in 0 ms
[2021-05-09 14:13:44] [INFO ] State equation strengthened by 20 read => feed constraints.
[2021-05-09 14:13:44] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 364 ms to find 0 implicit places.
[2021-05-09 14:13:44] [INFO ] Redundant transitions in 3 ms returned []
[2021-05-09 14:13:44] [INFO ] Flow matrix only has 79 transitions (discarded 360 similar events)
// Phase 1: matrix 79 rows 80 cols
[2021-05-09 14:13:44] [INFO ] Computed 40 place invariants in 3 ms
[2021-05-09 14:13:45] [INFO ] Dead Transitions using invariants and state equation in 186 ms returned []
Finished structural reductions, in 1 iterations. Remains : 80/80 places, 439/439 transitions.
Starting property specific reduction for Dekker-PT-020-UpperBounds-06
Normalized transition count is 79 out of 439 initially.
// Phase 1: matrix 79 rows 80 cols
[2021-05-09 14:13:45] [INFO ] Computed 40 place invariants in 0 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
[2021-05-09 14:13:45] [INFO ] Flow matrix only has 79 transitions (discarded 360 similar events)
// Phase 1: matrix 79 rows 80 cols
[2021-05-09 14:13:45] [INFO ] Computed 40 place invariants in 0 ms
[2021-05-09 14:13:45] [INFO ] [Real]Absence check using 40 positive place invariants in 5 ms returned sat
[2021-05-09 14:13:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 14:13:45] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2021-05-09 14:13:45] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 14:13:45] [INFO ] [Nat]Absence check using 40 positive place invariants in 5 ms returned sat
[2021-05-09 14:13:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 14:13:45] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2021-05-09 14:13:45] [INFO ] State equation strengthened by 20 read => feed constraints.
[2021-05-09 14:13:45] [INFO ] [Nat]Added 20 Read/Feed constraints in 3 ms returned sat
[2021-05-09 14:13:45] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2021-05-09 14:13:45] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 7 ms to minimize.
[2021-05-09 14:13:45] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2021-05-09 14:13:45] [INFO ] Deduced a trap composed of 4 places in 10 ms of which 0 ms to minimize.
[2021-05-09 14:13:45] [INFO ] Deduced a trap composed of 4 places in 9 ms of which 0 ms to minimize.
[2021-05-09 14:13:45] [INFO ] Deduced a trap composed of 4 places in 10 ms of which 0 ms to minimize.
[2021-05-09 14:13:45] [INFO ] Deduced a trap composed of 4 places in 10 ms of which 0 ms to minimize.
[2021-05-09 14:13:45] [INFO ] Deduced a trap composed of 4 places in 9 ms of which 0 ms to minimize.
[2021-05-09 14:13:45] [INFO ] Deduced a trap composed of 4 places in 8 ms of which 0 ms to minimize.
[2021-05-09 14:13:45] [INFO ] Deduced a trap composed of 4 places in 6 ms of which 1 ms to minimize.
[2021-05-09 14:13:45] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 162 ms
[2021-05-09 14:13:45] [INFO ] Computed and/alt/rep : 39/58/39 causal constraints (skipped 20 transitions) in 9 ms.
[2021-05-09 14:13:45] [INFO ] Added : 1 causal constraints over 1 iterations in 19 ms. Result :sat
Minimization took 10 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 6100 steps, including 98 resets, run finished after 41 ms. (steps per millisecond=148 ) properties (out of 1) seen :1 could not realise parikh vector
FORMULA Dekker-PT-020-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Ending property specific reduction for Dekker-PT-020-UpperBounds-06 in 460 ms.
[2021-05-09 14:13:45] [INFO ] Flatten gal took : 80 ms
[2021-05-09 14:13:45] [INFO ] Applying decomposition
[2021-05-09 14:13:45] [INFO ] Flatten gal took : 51 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph16992955601789223334.txt, -o, /tmp/graph16992955601789223334.bin, -w, /tmp/graph16992955601789223334.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph16992955601789223334.bin, -l, -1, -v, -w, /tmp/graph16992955601789223334.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 14:13:46] [INFO ] Decomposing Gal with order
[2021-05-09 14:13:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 14:13:46] [INFO ] Removed a total of 1080 redundant transitions.
[2021-05-09 14:13:46] [INFO ] Flatten gal took : 85 ms
[2021-05-09 14:13:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 8 ms.
[2021-05-09 14:13:46] [INFO ] Time to serialize gal into /tmp/UpperBounds7826263750379372577.gal : 5 ms
[2021-05-09 14:13:46] [INFO ] Time to serialize properties into /tmp/UpperBounds15171764170789106259.prop : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds7826263750379372577.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds15171764170789106259.prop, --nowitness], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds7826263750379372577.gal -t CGAL -reachable-file /tmp/UpperBounds15171764170789106259.prop --nowitness
Loading property file /tmp/UpperBounds15171764170789106259.prop.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 3 fixpoint passes
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,4,0.036832,5388,23,9,46,245,538,0,27,217,0
Total reachable state count : 4

ITS tools runner thread asked to quit. Dying gracefully.

BK_STOP 1620569628347

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

+ 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
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -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=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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="Dekker-PT-020"
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 Dekker-PT-020, 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 r064-tall-162038397700771"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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