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-165472282500605.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 Medical-PT-20, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r312-tall-165472282500605
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.5M
-rw-r--r-- 1 mcc users 8.8K Jun 7 17:35 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K Jun 7 17:35 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Jun 7 17:33 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Jun 7 17:33 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Jun 6 15:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Jun 6 15:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 6 15:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Jun 6 15:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 6 12:11 NewModel
-rw-r--r-- 1 mcc users 8.2K Jun 7 17:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 74K Jun 7 17:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Jun 7 17:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K Jun 7 17:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 6 15:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Jun 6 15:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 6 12:11 instance
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 iscolored
-rw-r--r-- 1 mcc users 3.1M 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 Medical-PT-20-UpperBounds-00
FORMULA_NAME Medical-PT-20-UpperBounds-01
FORMULA_NAME Medical-PT-20-UpperBounds-02
FORMULA_NAME Medical-PT-20-UpperBounds-03
FORMULA_NAME Medical-PT-20-UpperBounds-04
FORMULA_NAME Medical-PT-20-UpperBounds-05
FORMULA_NAME Medical-PT-20-UpperBounds-06
FORMULA_NAME Medical-PT-20-UpperBounds-07
FORMULA_NAME Medical-PT-20-UpperBounds-08
FORMULA_NAME Medical-PT-20-UpperBounds-09
FORMULA_NAME Medical-PT-20-UpperBounds-10
FORMULA_NAME Medical-PT-20-UpperBounds-11
FORMULA_NAME Medical-PT-20-UpperBounds-12
FORMULA_NAME Medical-PT-20-UpperBounds-13
FORMULA_NAME Medical-PT-20-UpperBounds-14
FORMULA_NAME Medical-PT-20-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1654897960813

Running Version 202205111006
[2022-06-10 21:52:41] [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-10 21:52:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-10 21:52:42] [INFO ] Load time of PNML (sax parser for PT used): 300 ms
[2022-06-10 21:52:42] [INFO ] Transformed 312 places.
[2022-06-10 21:52:42] [INFO ] Transformed 5431 transitions.
[2022-06-10 21:52:42] [INFO ] Parsed PT model containing 312 places and 5431 transitions in 458 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 10 ms.
Deduced a syphon composed of 242 places in 24 ms
Reduce places removed 242 places and 5204 transitions.
Reduce places removed 1 places and 0 transitions.
FORMULA Medical-PT-20-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-20-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-20-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-20-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-20-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-20-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-20-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-20-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-20-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-20-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-20-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-20-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-20-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Normalized transition count is 182 out of 227 initially.
// Phase 1: matrix 182 rows 69 cols
[2022-06-10 21:52:42] [INFO ] Computed 10 place invariants in 16 ms
FORMULA Medical-PT-20-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10018 steps, including 33 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 2) seen :1
FORMULA Medical-PT-20-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
[2022-06-10 21:52:42] [INFO ] Flow matrix only has 182 transitions (discarded 45 similar events)
// Phase 1: matrix 182 rows 69 cols
[2022-06-10 21:52:42] [INFO ] Computed 10 place invariants in 2 ms
[2022-06-10 21:52:42] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2022-06-10 21:52:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-10 21:52:42] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2022-06-10 21:52:42] [INFO ] Solution in real domain found non-integer solution.
[2022-06-10 21:52:42] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2022-06-10 21:52:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-10 21:52:42] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2022-06-10 21:52:42] [INFO ] State equation strengthened by 56 read => feed constraints.
[2022-06-10 21:52:42] [INFO ] [Nat]Added 56 Read/Feed constraints in 8 ms returned sat
[2022-06-10 21:52:43] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 3 ms to minimize.
[2022-06-10 21:52:43] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 1 ms to minimize.
[2022-06-10 21:52:43] [INFO ] Deduced a trap composed of 33 places in 54 ms of which 1 ms to minimize.
[2022-06-10 21:52:43] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 0 ms to minimize.
[2022-06-10 21:52:43] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 0 ms to minimize.
[2022-06-10 21:52:43] [INFO ] Deduced a trap composed of 6 places in 45 ms of which 0 ms to minimize.
[2022-06-10 21:52:43] [INFO ] Deduced a trap composed of 33 places in 45 ms of which 0 ms to minimize.
[2022-06-10 21:52:43] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2022-06-10 21:52:43] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 1 ms to minimize.
[2022-06-10 21:52:43] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 0 ms to minimize.
[2022-06-10 21:52:43] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 0 ms to minimize.
[2022-06-10 21:52:43] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 0 ms to minimize.
[2022-06-10 21:52:43] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 0 ms to minimize.
[2022-06-10 21:52:43] [INFO ] Deduced a trap composed of 32 places in 41 ms of which 1 ms to minimize.
[2022-06-10 21:52:43] [INFO ] Deduced a trap composed of 31 places in 47 ms of which 1 ms to minimize.
[2022-06-10 21:52:43] [INFO ] Deduced a trap composed of 33 places in 54 ms of which 0 ms to minimize.
[2022-06-10 21:52:43] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 932 ms
[2022-06-10 21:52:43] [INFO ] Computed and/alt/rep : 122/716/121 causal constraints (skipped 56 transitions) in 18 ms.
[2022-06-10 21:52:44] [INFO ] Added : 41 causal constraints over 9 iterations in 159 ms. Result :sat
Minimization took 92 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 69 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 69/69 places, 227/227 transitions.
Graph (complete) has 347 edges and 69 vertex of which 67 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 0 output transitions
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 1 place count 67 transition count 224
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 7 place count 64 transition count 224
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 9 place count 63 transition count 224
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 11 place count 63 transition count 222
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 13 place count 61 transition count 222
Applied a total of 13 rules in 37 ms. Remains 61 /69 variables (removed 8) and now considering 222/227 (removed 5) transitions.
Finished structural reductions, in 1 iterations. Remains : 61/69 places, 222/227 transitions.
Normalized transition count is 176 out of 222 initially.
// Phase 1: matrix 176 rows 61 cols
[2022-06-10 21:52:44] [INFO ] Computed 8 place invariants in 6 ms
Incomplete random walk after 1000012 steps, including 2 resets, run finished after 410 ms. (steps per millisecond=2439 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 578 ms. (steps per millisecond=1730 ) properties (out of 1) seen :0
[2022-06-10 21:52:45] [INFO ] Flow matrix only has 176 transitions (discarded 46 similar events)
// Phase 1: matrix 176 rows 61 cols
[2022-06-10 21:52:45] [INFO ] Computed 8 place invariants in 6 ms
[2022-06-10 21:52:45] [INFO ] [Real]Absence check using 8 positive place invariants in 1 ms returned sat
[2022-06-10 21:52:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-10 21:52:45] [INFO ] [Real]Absence check using state equation in 89 ms returned sat
[2022-06-10 21:52:45] [INFO ] Solution in real domain found non-integer solution.
[2022-06-10 21:52:45] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2022-06-10 21:52:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-10 21:52:45] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2022-06-10 21:52:45] [INFO ] State equation strengthened by 57 read => feed constraints.
[2022-06-10 21:52:45] [INFO ] [Nat]Added 57 Read/Feed constraints in 9 ms returned sat
[2022-06-10 21:52:45] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 0 ms to minimize.
[2022-06-10 21:52:45] [INFO ] Deduced a trap composed of 30 places in 65 ms of which 1 ms to minimize.
[2022-06-10 21:52:45] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 1 ms to minimize.
[2022-06-10 21:52:45] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 9 ms to minimize.
[2022-06-10 21:52:45] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 229 ms
[2022-06-10 21:52:45] [INFO ] Computed and/alt/rep : 119/604/118 causal constraints (skipped 57 transitions) in 21 ms.
[2022-06-10 21:52:45] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 1 ms to minimize.
[2022-06-10 21:52:45] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2022-06-10 21:52:45] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 0 ms to minimize.
[2022-06-10 21:52:45] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 200 ms
[2022-06-10 21:52:46] [INFO ] Added : 32 causal constraints over 9 iterations in 364 ms. Result :sat
Minimization took 44 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 61 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 61/61 places, 222/222 transitions.
Applied a total of 0 rules in 9 ms. Remains 61 /61 variables (removed 0) and now considering 222/222 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 61/61 places, 222/222 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 61/61 places, 222/222 transitions.
Applied a total of 0 rules in 7 ms. Remains 61 /61 variables (removed 0) and now considering 222/222 (removed 0) transitions.
[2022-06-10 21:52:46] [INFO ] Flow matrix only has 176 transitions (discarded 46 similar events)
// Phase 1: matrix 176 rows 61 cols
[2022-06-10 21:52:46] [INFO ] Computed 8 place invariants in 1 ms
[2022-06-10 21:52:46] [INFO ] Implicit Places using invariants in 69 ms returned []
[2022-06-10 21:52:46] [INFO ] Flow matrix only has 176 transitions (discarded 46 similar events)
// Phase 1: matrix 176 rows 61 cols
[2022-06-10 21:52:46] [INFO ] Computed 8 place invariants in 2 ms
[2022-06-10 21:52:46] [INFO ] State equation strengthened by 57 read => feed constraints.
[2022-06-10 21:52:46] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 201 ms to find 0 implicit places.
[2022-06-10 21:52:46] [INFO ] Redundant transitions in 10 ms returned []
[2022-06-10 21:52:46] [INFO ] Flow matrix only has 176 transitions (discarded 46 similar events)
// Phase 1: matrix 176 rows 61 cols
[2022-06-10 21:52:46] [INFO ] Computed 8 place invariants in 3 ms
[2022-06-10 21:52:46] [INFO ] Dead Transitions using invariants and state equation in 116 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 61/61 places, 222/222 transitions.
Starting property specific reduction for Medical-PT-20-UpperBounds-08
Normalized transition count is 176 out of 222 initially.
// Phase 1: matrix 176 rows 61 cols
[2022-06-10 21:52:46] [INFO ] Computed 8 place invariants in 1 ms
Incomplete random walk after 10008 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1668 ) properties (out of 1) 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 1) seen :0
[2022-06-10 21:52:46] [INFO ] Flow matrix only has 176 transitions (discarded 46 similar events)
// Phase 1: matrix 176 rows 61 cols
[2022-06-10 21:52:46] [INFO ] Computed 8 place invariants in 1 ms
[2022-06-10 21:52:46] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2022-06-10 21:52:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-10 21:52:46] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2022-06-10 21:52:46] [INFO ] Solution in real domain found non-integer solution.
[2022-06-10 21:52:46] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2022-06-10 21:52:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-10 21:52:46] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2022-06-10 21:52:46] [INFO ] State equation strengthened by 57 read => feed constraints.
[2022-06-10 21:52:46] [INFO ] [Nat]Added 57 Read/Feed constraints in 8 ms returned sat
[2022-06-10 21:52:46] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 0 ms to minimize.
[2022-06-10 21:52:46] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 0 ms to minimize.
[2022-06-10 21:52:46] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 0 ms to minimize.
[2022-06-10 21:52:46] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 0 ms to minimize.
[2022-06-10 21:52:46] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 200 ms
[2022-06-10 21:52:46] [INFO ] Computed and/alt/rep : 119/604/118 causal constraints (skipped 57 transitions) in 13 ms.
[2022-06-10 21:52:46] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
[2022-06-10 21:52:46] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 0 ms to minimize.
[2022-06-10 21:52:47] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
[2022-06-10 21:52:47] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 174 ms
[2022-06-10 21:52:47] [INFO ] Added : 32 causal constraints over 9 iterations in 316 ms. Result :sat
Minimization took 42 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 61 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 61/61 places, 222/222 transitions.
Applied a total of 0 rules in 12 ms. Remains 61 /61 variables (removed 0) and now considering 222/222 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 61/61 places, 222/222 transitions.
Normalized transition count is 176 out of 222 initially.
// Phase 1: matrix 176 rows 61 cols
[2022-06-10 21:52:47] [INFO ] Computed 8 place invariants in 1 ms
Incomplete random walk after 1000010 steps, including 2 resets, run finished after 310 ms. (steps per millisecond=3225 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 431 ms. (steps per millisecond=2320 ) properties (out of 1) seen :0
[2022-06-10 21:52:47] [INFO ] Flow matrix only has 176 transitions (discarded 46 similar events)
// Phase 1: matrix 176 rows 61 cols
[2022-06-10 21:52:47] [INFO ] Computed 8 place invariants in 3 ms
[2022-06-10 21:52:48] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2022-06-10 21:52:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-10 21:52:48] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2022-06-10 21:52:48] [INFO ] Solution in real domain found non-integer solution.
[2022-06-10 21:52:48] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2022-06-10 21:52:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-10 21:52:48] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2022-06-10 21:52:48] [INFO ] State equation strengthened by 57 read => feed constraints.
[2022-06-10 21:52:48] [INFO ] [Nat]Added 57 Read/Feed constraints in 10 ms returned sat
[2022-06-10 21:52:48] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 0 ms to minimize.
[2022-06-10 21:52:48] [INFO ] Deduced a trap composed of 30 places in 62 ms of which 1 ms to minimize.
[2022-06-10 21:52:48] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 1 ms to minimize.
[2022-06-10 21:52:48] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2022-06-10 21:52:48] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 213 ms
[2022-06-10 21:52:48] [INFO ] Computed and/alt/rep : 119/604/118 causal constraints (skipped 57 transitions) in 12 ms.
[2022-06-10 21:52:48] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 4 ms to minimize.
[2022-06-10 21:52:48] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 0 ms to minimize.
[2022-06-10 21:52:48] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2022-06-10 21:52:48] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 183 ms
[2022-06-10 21:52:48] [INFO ] Added : 32 causal constraints over 9 iterations in 325 ms. Result :sat
Minimization took 42 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 61 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 61/61 places, 222/222 transitions.
Applied a total of 0 rules in 5 ms. Remains 61 /61 variables (removed 0) and now considering 222/222 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 61/61 places, 222/222 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 61/61 places, 222/222 transitions.
Applied a total of 0 rules in 7 ms. Remains 61 /61 variables (removed 0) and now considering 222/222 (removed 0) transitions.
[2022-06-10 21:52:48] [INFO ] Flow matrix only has 176 transitions (discarded 46 similar events)
// Phase 1: matrix 176 rows 61 cols
[2022-06-10 21:52:48] [INFO ] Computed 8 place invariants in 2 ms
[2022-06-10 21:52:48] [INFO ] Implicit Places using invariants in 53 ms returned []
[2022-06-10 21:52:48] [INFO ] Flow matrix only has 176 transitions (discarded 46 similar events)
// Phase 1: matrix 176 rows 61 cols
[2022-06-10 21:52:48] [INFO ] Computed 8 place invariants in 1 ms
[2022-06-10 21:52:48] [INFO ] State equation strengthened by 57 read => feed constraints.
[2022-06-10 21:52:48] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 176 ms to find 0 implicit places.
[2022-06-10 21:52:48] [INFO ] Redundant transitions in 10 ms returned []
[2022-06-10 21:52:48] [INFO ] Flow matrix only has 176 transitions (discarded 46 similar events)
// Phase 1: matrix 176 rows 61 cols
[2022-06-10 21:52:48] [INFO ] Computed 8 place invariants in 2 ms
[2022-06-10 21:52:49] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 61/61 places, 222/222 transitions.
Ending property specific reduction for Medical-PT-20-UpperBounds-08 in 2561 ms.
[2022-06-10 21:52:49] [INFO ] Flatten gal took : 81 ms
[2022-06-10 21:52:49] [INFO ] Applying decomposition
[2022-06-10 21:52:49] [INFO ] Flatten gal took : 22 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/graph7216573374572057142.txt' '-o' '/tmp/graph7216573374572057142.bin' '-w' '/tmp/graph7216573374572057142.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph7216573374572057142.bin' '-l' '-1' '-v' '-w' '/tmp/graph7216573374572057142.weights' '-q' '0' '-e' '0.001'
[2022-06-10 21:52:49] [INFO ] Decomposing Gal with order
[2022-06-10 21:52:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-10 21:52:49] [INFO ] Removed a total of 83 redundant transitions.
[2022-06-10 21:52:49] [INFO ] Flatten gal took : 73 ms
[2022-06-10 21:52:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 73 labels/synchronizations in 4 ms.
[2022-06-10 21:52:49] [INFO ] Time to serialize gal into /tmp/UpperBounds4148688106392775470.gal : 6 ms
[2022-06-10 21:52:49] [INFO ] Time to serialize properties into /tmp/UpperBounds1820087382948444369.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/UpperBounds4148688106392775470.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds1820087382948444369.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...274
Loading property file /tmp/UpperBounds1820087382948444369.prop.
Detected timeout of ITS tools.
[2022-06-10 22:12:51] [INFO ] Flatten gal took : 18 ms
[2022-06-10 22:12:51] [INFO ] Time to serialize gal into /tmp/UpperBounds99280602986822795.gal : 3 ms
[2022-06-10 22:12:51] [INFO ] Time to serialize properties into /tmp/UpperBounds14310890280749836867.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/UpperBounds99280602986822795.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds14310890280749836867.prop' '--nowitness' '--gen-order' 'FOLLOW'

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...294
Loading property file /tmp/UpperBounds14310890280749836867.prop.
Detected timeout of ITS tools.
[2022-06-10 22:32:54] [INFO ] Flatten gal took : 16 ms
[2022-06-10 22:32:54] [INFO ] Input system was already deterministic with 222 transitions.
[2022-06-10 22:32:54] [INFO ] Transformed 61 places.
[2022-06-10 22:32:54] [INFO ] Transformed 222 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-06-10 22:32:54] [INFO ] Time to serialize gal into /tmp/UpperBounds10036872734601529190.gal : 4 ms
[2022-06-10 22:32:54] [INFO ] Time to serialize properties into /tmp/UpperBounds17393108034005220496.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/UpperBounds10036872734601529190.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds17393108034005220496.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

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...342
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds17393108034005220496.prop.

BK_TIME_CONFINEMENT_REACHED

--------------------
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="Medical-PT-20"
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 Medical-PT-20, 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-165472282500605"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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