Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2021-input.r026-tajo-162038143500163.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/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 BridgeAndVehicles-PT-V04P05N02, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r026-tajo-162038143500163
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 600K
-rw-r--r-- 1 mcc users 26K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 163K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 29K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 130K 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 4.6K Mar 28 15:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 28 15:46 LTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Mar 28 15:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 26K Mar 28 15:46 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.7K Mar 23 02:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 23 02:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Mar 22 11:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 36K Mar 22 11:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.2K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 10 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 57K 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 BridgeAndVehicles-PT-V04P05N02-UpperBounds-00
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-UpperBounds-01
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-UpperBounds-02
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-UpperBounds-03
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-UpperBounds-04
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-UpperBounds-05
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-UpperBounds-06
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-UpperBounds-07
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-UpperBounds-08
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-UpperBounds-09
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-UpperBounds-10
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-UpperBounds-11
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-UpperBounds-12
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-UpperBounds-13
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-UpperBounds-14
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1620526282020

Running Version 0
[2021-05-09 02:11:23] [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 02:11:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 02:11:23] [INFO ] Load time of PNML (sax parser for PT used): 35 ms
[2021-05-09 02:11:23] [INFO ] Transformed 28 places.
[2021-05-09 02:11:23] [INFO ] Transformed 52 transitions.
[2021-05-09 02:11:23] [INFO ] Parsed PT model containing 28 places and 52 transitions in 71 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
FORMULA BridgeAndVehicles-PT-V04P05N02-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Normalized transition count is 34 out of 52 initially.
// Phase 1: matrix 34 rows 28 cols
[2021-05-09 02:11:23] [INFO ] Computed 7 place invariants in 6 ms
FORMULA BridgeAndVehicles-PT-V04P05N02-UpperBounds-10 4 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V04P05N02-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 230 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 13) seen :24
FORMULA BridgeAndVehicles-PT-V04P05N02-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V04P05N02-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V04P05N02-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V04P05N02-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V04P05N02-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V04P05N02-UpperBounds-07 4 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V04P05N02-UpperBounds-06 4 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V04P05N02-UpperBounds-03 4 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 111 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 5) seen :5
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 5) seen :7
Incomplete Best-First random walk after 10001 steps, including 98 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 5) seen :7
Incomplete Best-First random walk after 10001 steps, including 111 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 5) seen :5
Incomplete Best-First random walk after 10000 steps, including 98 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 5) seen :7
[2021-05-09 02:11:23] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 28 cols
[2021-05-09 02:11:23] [INFO ] Computed 7 place invariants in 4 ms
[2021-05-09 02:11:23] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned unsat
[2021-05-09 02:11:23] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned unsat
[2021-05-09 02:11:23] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2021-05-09 02:11:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 02:11:23] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2021-05-09 02:11:23] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 02:11:23] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2021-05-09 02:11:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 02:11:23] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2021-05-09 02:11:23] [INFO ] State equation strengthened by 6 read => feed constraints.
[2021-05-09 02:11:23] [INFO ] [Nat]Added 6 Read/Feed constraints in 1 ms returned sat
[2021-05-09 02:11:23] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 3 ms to minimize.
[2021-05-09 02:11:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 46 ms
[2021-05-09 02:11:23] [INFO ] Computed and/alt/rep : 25/123/25 causal constraints (skipped 6 transitions) in 7 ms.
[2021-05-09 02:11:23] [INFO ] Added : 22 causal constraints over 5 iterations in 34 ms. Result :sat
Minimization took 16 ms.
[2021-05-09 02:11:23] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned unsat
[2021-05-09 02:11:23] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2021-05-09 02:11:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 02:11:24] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2021-05-09 02:11:24] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 02:11:24] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2021-05-09 02:11:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 02:11:24] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2021-05-09 02:11:24] [INFO ] [Nat]Added 6 Read/Feed constraints in 1 ms returned sat
[2021-05-09 02:11:24] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 1 ms to minimize.
[2021-05-09 02:11:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 24 ms
[2021-05-09 02:11:24] [INFO ] Computed and/alt/rep : 25/123/25 causal constraints (skipped 6 transitions) in 3 ms.
[2021-05-09 02:11:24] [INFO ] Added : 22 causal constraints over 5 iterations in 34 ms. Result :sat
Minimization took 16 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 4, 1, 4] Max seen :[1, 1, 2, 1, 2]
FORMULA BridgeAndVehicles-PT-V04P05N02-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V04P05N02-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V04P05N02-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Incomplete Parikh walk after 4300 steps, including 457 resets, run finished after 8 ms. (steps per millisecond=537 ) properties (out of 2) seen :4 could not realise parikh vector
Incomplete Parikh walk after 4300 steps, including 456 resets, run finished after 8 ms. (steps per millisecond=537 ) properties (out of 2) seen :4 could not realise parikh vector
Support contains 1 out of 28 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 28/28 places, 52/52 transitions.
Graph (complete) has 146 edges and 28 vertex of which 26 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Discarding 2 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 3 place count 25 transition count 51
Applied a total of 3 rules in 23 ms. Remains 25 /28 variables (removed 3) and now considering 51/52 (removed 1) transitions.
[2021-05-09 02:11:24] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 25 cols
[2021-05-09 02:11:24] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-09 02:11:24] [INFO ] Dead Transitions using invariants and state equation in 34 ms returned []
Finished structural reductions, in 1 iterations. Remains : 25/28 places, 51/52 transitions.
Normalized transition count is 33 out of 51 initially.
// Phase 1: matrix 33 rows 25 cols
[2021-05-09 02:11:24] [INFO ] Computed 5 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 25603 resets, run finished after 765 ms. (steps per millisecond=1307 ) properties (out of 2) seen :4
Incomplete Best-First random walk after 1000000 steps, including 11477 resets, run finished after 417 ms. (steps per millisecond=2398 ) properties (out of 2) seen :4
Incomplete Best-First random walk after 1000000 steps, including 11492 resets, run finished after 391 ms. (steps per millisecond=2557 ) properties (out of 2) seen :4
[2021-05-09 02:11:25] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 25 cols
[2021-05-09 02:11:25] [INFO ] Computed 5 place invariants in 3 ms
[2021-05-09 02:11:25] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2021-05-09 02:11:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 02:11:25] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2021-05-09 02:11:25] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 02:11:25] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2021-05-09 02:11:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 02:11:25] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2021-05-09 02:11:25] [INFO ] State equation strengthened by 6 read => feed constraints.
[2021-05-09 02:11:25] [INFO ] [Nat]Added 6 Read/Feed constraints in 1 ms returned sat
[2021-05-09 02:11:25] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 0 ms to minimize.
[2021-05-09 02:11:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 29 ms
[2021-05-09 02:11:25] [INFO ] Computed and/alt/rep : 24/119/24 causal constraints (skipped 6 transitions) in 4 ms.
[2021-05-09 02:11:25] [INFO ] Added : 20 causal constraints over 4 iterations in 28 ms. Result :sat
Minimization took 20 ms.
[2021-05-09 02:11:25] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2021-05-09 02:11:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 02:11:25] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2021-05-09 02:11:25] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 02:11:25] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2021-05-09 02:11:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 02:11:25] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2021-05-09 02:11:25] [INFO ] [Nat]Added 6 Read/Feed constraints in 1 ms returned sat
[2021-05-09 02:11:25] [INFO ] Deduced a trap composed of 5 places in 10 ms of which 1 ms to minimize.
[2021-05-09 02:11:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 15 ms
[2021-05-09 02:11:25] [INFO ] Computed and/alt/rep : 24/119/24 causal constraints (skipped 6 transitions) in 3 ms.
[2021-05-09 02:11:25] [INFO ] Added : 20 causal constraints over 4 iterations in 21 ms. Result :sat
Minimization took 13 ms.
Current structural bounds on expressions (after SMT) : [4, 4] Max seen :[2, 2]
Incomplete Parikh walk after 1600 steps, including 232 resets, run finished after 3 ms. (steps per millisecond=533 ) properties (out of 2) seen :4 could not realise parikh vector
Incomplete Parikh walk after 1600 steps, including 228 resets, run finished after 4 ms. (steps per millisecond=400 ) properties (out of 2) seen :4 could not realise parikh vector
Support contains 1 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 51/51 transitions.
Applied a total of 0 rules in 2 ms. Remains 25 /25 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 25/25 places, 51/51 transitions.
Starting structural reductions, iteration 0 : 25/25 places, 51/51 transitions.
Applied a total of 0 rules in 3 ms. Remains 25 /25 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2021-05-09 02:11:26] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 25 cols
[2021-05-09 02:11:26] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-09 02:11:26] [INFO ] Implicit Places using invariants in 31 ms returned []
[2021-05-09 02:11:26] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 25 cols
[2021-05-09 02:11:26] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-09 02:11:26] [INFO ] State equation strengthened by 6 read => feed constraints.
[2021-05-09 02:11:26] [INFO ] Implicit Places using invariants and state equation in 51 ms returned [6, 16]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 85 ms to find 2 implicit places.
[2021-05-09 02:11:26] [INFO ] Redundant transitions in 1 ms returned []
[2021-05-09 02:11:26] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 23 cols
[2021-05-09 02:11:26] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-09 02:11:26] [INFO ] Dead Transitions using invariants and state equation in 33 ms returned []
Starting structural reductions, iteration 1 : 23/25 places, 51/51 transitions.
Applied a total of 0 rules in 2 ms. Remains 23 /23 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2021-05-09 02:11:26] [INFO ] Redundant transitions in 1 ms returned []
[2021-05-09 02:11:26] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 23 cols
[2021-05-09 02:11:26] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-09 02:11:26] [INFO ] Dead Transitions using invariants and state equation in 26 ms returned []
Finished structural reductions, in 2 iterations. Remains : 23/25 places, 51/51 transitions.
Normalized transition count is 33 out of 51 initially.
// Phase 1: matrix 33 rows 23 cols
[2021-05-09 02:11:26] [INFO ] Computed 5 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 25610 resets, run finished after 562 ms. (steps per millisecond=1779 ) properties (out of 2) seen :4
Incomplete Best-First random walk after 1000001 steps, including 11492 resets, run finished after 313 ms. (steps per millisecond=3194 ) properties (out of 2) seen :4
Incomplete Best-First random walk after 1000000 steps, including 11478 resets, run finished after 308 ms. (steps per millisecond=3246 ) properties (out of 2) seen :4
[2021-05-09 02:11:27] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 23 cols
[2021-05-09 02:11:27] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-09 02:11:27] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2021-05-09 02:11:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 02:11:27] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2021-05-09 02:11:27] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 02:11:27] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2021-05-09 02:11:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 02:11:27] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2021-05-09 02:11:27] [INFO ] State equation strengthened by 6 read => feed constraints.
[2021-05-09 02:11:27] [INFO ] [Nat]Added 6 Read/Feed constraints in 2 ms returned sat
[2021-05-09 02:11:27] [INFO ] Deduced a trap composed of 5 places in 13 ms of which 1 ms to minimize.
[2021-05-09 02:11:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 19 ms
[2021-05-09 02:11:27] [INFO ] Computed and/alt/rep : 24/79/24 causal constraints (skipped 6 transitions) in 3 ms.
[2021-05-09 02:11:27] [INFO ] Added : 18 causal constraints over 5 iterations in 30 ms. Result :sat
Minimization took 17 ms.
[2021-05-09 02:11:27] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2021-05-09 02:11:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 02:11:27] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2021-05-09 02:11:27] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 02:11:27] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2021-05-09 02:11:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 02:11:27] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2021-05-09 02:11:27] [INFO ] [Nat]Added 6 Read/Feed constraints in 2 ms returned sat
[2021-05-09 02:11:27] [INFO ] Deduced a trap composed of 5 places in 10 ms of which 1 ms to minimize.
[2021-05-09 02:11:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 15 ms
[2021-05-09 02:11:27] [INFO ] Computed and/alt/rep : 24/79/24 causal constraints (skipped 6 transitions) in 3 ms.
[2021-05-09 02:11:27] [INFO ] Added : 18 causal constraints over 5 iterations in 28 ms. Result :sat
Minimization took 17 ms.
Current structural bounds on expressions (after SMT) : [4, 4] Max seen :[2, 2]
Incomplete Parikh walk after 4300 steps, including 489 resets, run finished after 14 ms. (steps per millisecond=307 ) properties (out of 2) seen :4 could not realise parikh vector
Incomplete Parikh walk after 4300 steps, including 495 resets, run finished after 7 ms. (steps per millisecond=614 ) properties (out of 2) seen :4 could not realise parikh vector
Support contains 1 out of 23 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 23/23 places, 51/51 transitions.
Applied a total of 0 rules in 2 ms. Remains 23 /23 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 23/23 places, 51/51 transitions.
Starting structural reductions, iteration 0 : 23/23 places, 51/51 transitions.
Applied a total of 0 rules in 2 ms. Remains 23 /23 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2021-05-09 02:11:27] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 23 cols
[2021-05-09 02:11:27] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-09 02:11:27] [INFO ] Implicit Places using invariants in 38 ms returned []
[2021-05-09 02:11:27] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 23 cols
[2021-05-09 02:11:27] [INFO ] Computed 5 place invariants in 2 ms
[2021-05-09 02:11:27] [INFO ] State equation strengthened by 6 read => feed constraints.
[2021-05-09 02:11:27] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
[2021-05-09 02:11:27] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-09 02:11:27] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 23 cols
[2021-05-09 02:11:27] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-09 02:11:27] [INFO ] Dead Transitions using invariants and state equation in 53 ms returned []
Finished structural reductions, in 1 iterations. Remains : 23/23 places, 51/51 transitions.
Starting property specific reduction for BridgeAndVehicles-PT-V04P05N02-UpperBounds-04
Normalized transition count is 33 out of 51 initially.
// Phase 1: matrix 33 rows 23 cols
[2021-05-09 02:11:27] [INFO ] Computed 5 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 256 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 10001 steps, including 115 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :2
[2021-05-09 02:11:27] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 23 cols
[2021-05-09 02:11:27] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-09 02:11:27] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2021-05-09 02:11:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 02:11:27] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2021-05-09 02:11:27] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 02:11:27] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2021-05-09 02:11:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 02:11:27] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2021-05-09 02:11:27] [INFO ] State equation strengthened by 6 read => feed constraints.
[2021-05-09 02:11:27] [INFO ] [Nat]Added 6 Read/Feed constraints in 1 ms returned sat
[2021-05-09 02:11:27] [INFO ] Deduced a trap composed of 5 places in 13 ms of which 0 ms to minimize.
[2021-05-09 02:11:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 21 ms
[2021-05-09 02:11:27] [INFO ] Computed and/alt/rep : 24/79/24 causal constraints (skipped 6 transitions) in 3 ms.
[2021-05-09 02:11:27] [INFO ] Added : 18 causal constraints over 5 iterations in 27 ms. Result :sat
Minimization took 16 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[2]
Incomplete Parikh walk after 4300 steps, including 485 resets, run finished after 9 ms. (steps per millisecond=477 ) properties (out of 1) seen :2 could not realise parikh vector
Support contains 1 out of 23 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 23/23 places, 51/51 transitions.
Applied a total of 0 rules in 3 ms. Remains 23 /23 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2021-05-09 02:11:28] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 23 cols
[2021-05-09 02:11:28] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-09 02:11:28] [INFO ] Dead Transitions using invariants and state equation in 28 ms returned []
Finished structural reductions, in 1 iterations. Remains : 23/23 places, 51/51 transitions.
Normalized transition count is 33 out of 51 initially.
// Phase 1: matrix 33 rows 23 cols
[2021-05-09 02:11:28] [INFO ] Computed 5 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 25605 resets, run finished after 830 ms. (steps per millisecond=1204 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000001 steps, including 11484 resets, run finished after 356 ms. (steps per millisecond=2808 ) properties (out of 1) seen :2
[2021-05-09 02:11:29] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 23 cols
[2021-05-09 02:11:29] [INFO ] Computed 5 place invariants in 3 ms
[2021-05-09 02:11:29] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2021-05-09 02:11:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 02:11:29] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2021-05-09 02:11:29] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 02:11:29] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2021-05-09 02:11:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 02:11:29] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2021-05-09 02:11:29] [INFO ] State equation strengthened by 6 read => feed constraints.
[2021-05-09 02:11:29] [INFO ] [Nat]Added 6 Read/Feed constraints in 2 ms returned sat
[2021-05-09 02:11:29] [INFO ] Deduced a trap composed of 5 places in 10 ms of which 0 ms to minimize.
[2021-05-09 02:11:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 17 ms
[2021-05-09 02:11:29] [INFO ] Computed and/alt/rep : 24/79/24 causal constraints (skipped 6 transitions) in 4 ms.
[2021-05-09 02:11:29] [INFO ] Added : 18 causal constraints over 5 iterations in 41 ms. Result :sat
Minimization took 25 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[2]
Incomplete Parikh walk after 4300 steps, including 499 resets, run finished after 12 ms. (steps per millisecond=358 ) properties (out of 1) seen :2 could not realise parikh vector
Support contains 1 out of 23 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 23/23 places, 51/51 transitions.
Applied a total of 0 rules in 3 ms. Remains 23 /23 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 23/23 places, 51/51 transitions.
Starting structural reductions, iteration 0 : 23/23 places, 51/51 transitions.
Applied a total of 0 rules in 3 ms. Remains 23 /23 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2021-05-09 02:11:29] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 23 cols
[2021-05-09 02:11:29] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-09 02:11:29] [INFO ] Implicit Places using invariants in 44 ms returned []
[2021-05-09 02:11:29] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 23 cols
[2021-05-09 02:11:29] [INFO ] Computed 5 place invariants in 3 ms
[2021-05-09 02:11:29] [INFO ] State equation strengthened by 6 read => feed constraints.
[2021-05-09 02:11:29] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
[2021-05-09 02:11:29] [INFO ] Redundant transitions in 1 ms returned []
[2021-05-09 02:11:29] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 23 cols
[2021-05-09 02:11:29] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-09 02:11:29] [INFO ] Dead Transitions using invariants and state equation in 31 ms returned []
Finished structural reductions, in 1 iterations. Remains : 23/23 places, 51/51 transitions.
Ending property specific reduction for BridgeAndVehicles-PT-V04P05N02-UpperBounds-04 in 1699 ms.
Starting property specific reduction for BridgeAndVehicles-PT-V04P05N02-UpperBounds-11
Normalized transition count is 33 out of 51 initially.
// Phase 1: matrix 33 rows 23 cols
[2021-05-09 02:11:29] [INFO ] Computed 5 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 256 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 10000 steps, including 114 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :2
[2021-05-09 02:11:29] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 23 cols
[2021-05-09 02:11:29] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-09 02:11:29] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2021-05-09 02:11:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 02:11:29] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2021-05-09 02:11:29] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 02:11:29] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2021-05-09 02:11:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 02:11:29] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2021-05-09 02:11:29] [INFO ] State equation strengthened by 6 read => feed constraints.
[2021-05-09 02:11:29] [INFO ] [Nat]Added 6 Read/Feed constraints in 1 ms returned sat
[2021-05-09 02:11:29] [INFO ] Deduced a trap composed of 5 places in 11 ms of which 0 ms to minimize.
[2021-05-09 02:11:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 14 ms
[2021-05-09 02:11:29] [INFO ] Computed and/alt/rep : 24/79/24 causal constraints (skipped 6 transitions) in 3 ms.
[2021-05-09 02:11:29] [INFO ] Added : 18 causal constraints over 5 iterations in 22 ms. Result :sat
Minimization took 15 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[2]
Incomplete Parikh walk after 4300 steps, including 494 resets, run finished after 6 ms. (steps per millisecond=716 ) properties (out of 1) seen :2 could not realise parikh vector
Support contains 1 out of 23 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 23/23 places, 51/51 transitions.
Applied a total of 0 rules in 2 ms. Remains 23 /23 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2021-05-09 02:11:29] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 23 cols
[2021-05-09 02:11:29] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-09 02:11:29] [INFO ] Dead Transitions using invariants and state equation in 24 ms returned []
Finished structural reductions, in 1 iterations. Remains : 23/23 places, 51/51 transitions.
Normalized transition count is 33 out of 51 initially.
// Phase 1: matrix 33 rows 23 cols
[2021-05-09 02:11:29] [INFO ] Computed 5 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 25609 resets, run finished after 670 ms. (steps per millisecond=1492 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000001 steps, including 11489 resets, run finished after 329 ms. (steps per millisecond=3039 ) properties (out of 1) seen :2
[2021-05-09 02:11:30] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 23 cols
[2021-05-09 02:11:30] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-09 02:11:30] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2021-05-09 02:11:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 02:11:30] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-05-09 02:11:30] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 02:11:30] [INFO ] [Nat]Absence check using 5 positive place invariants in 0 ms returned sat
[2021-05-09 02:11:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 02:11:30] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2021-05-09 02:11:30] [INFO ] State equation strengthened by 6 read => feed constraints.
[2021-05-09 02:11:30] [INFO ] [Nat]Added 6 Read/Feed constraints in 1 ms returned sat
[2021-05-09 02:11:30] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 0 ms to minimize.
[2021-05-09 02:11:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 25 ms
[2021-05-09 02:11:30] [INFO ] Computed and/alt/rep : 24/79/24 causal constraints (skipped 6 transitions) in 3 ms.
[2021-05-09 02:11:30] [INFO ] Added : 18 causal constraints over 5 iterations in 25 ms. Result :sat
Minimization took 19 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[2]
Incomplete Parikh walk after 4300 steps, including 494 resets, run finished after 4 ms. (steps per millisecond=1075 ) properties (out of 1) seen :2 could not realise parikh vector
Support contains 1 out of 23 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 23/23 places, 51/51 transitions.
Applied a total of 0 rules in 2 ms. Remains 23 /23 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 23/23 places, 51/51 transitions.
Starting structural reductions, iteration 0 : 23/23 places, 51/51 transitions.
Applied a total of 0 rules in 2 ms. Remains 23 /23 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2021-05-09 02:11:30] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 23 cols
[2021-05-09 02:11:30] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-09 02:11:30] [INFO ] Implicit Places using invariants in 18 ms returned []
[2021-05-09 02:11:30] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 23 cols
[2021-05-09 02:11:30] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-09 02:11:30] [INFO ] State equation strengthened by 6 read => feed constraints.
[2021-05-09 02:11:30] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
[2021-05-09 02:11:30] [INFO ] Redundant transitions in 1 ms returned []
[2021-05-09 02:11:30] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 23 cols
[2021-05-09 02:11:30] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-09 02:11:30] [INFO ] Dead Transitions using invariants and state equation in 26 ms returned []
Finished structural reductions, in 1 iterations. Remains : 23/23 places, 51/51 transitions.
Ending property specific reduction for BridgeAndVehicles-PT-V04P05N02-UpperBounds-11 in 1355 ms.
[2021-05-09 02:11:31] [INFO ] Flatten gal took : 26 ms
[2021-05-09 02:11:31] [INFO ] Applying decomposition
[2021-05-09 02:11:31] [INFO ] Flatten gal took : 7 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/graph3533327733604948798.txt, -o, /tmp/graph3533327733604948798.bin, -w, /tmp/graph3533327733604948798.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/graph3533327733604948798.bin, -l, -1, -v, -w, /tmp/graph3533327733604948798.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 02:11:31] [INFO ] Decomposing Gal with order
[2021-05-09 02:11:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 02:11:31] [INFO ] Removed a total of 79 redundant transitions.
[2021-05-09 02:11:31] [INFO ] Flatten gal took : 39 ms
[2021-05-09 02:11:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 22 labels/synchronizations in 4 ms.
[2021-05-09 02:11:31] [INFO ] Time to serialize gal into /tmp/UpperBounds5231451323162912364.gal : 3 ms
[2021-05-09 02:11:31] [INFO ] Time to serialize properties into /tmp/UpperBounds6699410327288386460.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/UpperBounds5231451323162912364.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds6699410327288386460.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/UpperBounds5231451323162912364.gal -t CGAL -reachable-file /tmp/UpperBounds6699410327288386460.prop --nowitness
Loading property file /tmp/UpperBounds6699410327288386460.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,2246,0.043029,4924,139,80,2462,319,104,2398,46,1029,0
Total reachable state count : 2246

Verifying 2 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 2
Bounds property BridgeAndVehicles-PT-V04P05N02-UpperBounds-04 :0 <= u1.SUR_PONT_A <= 2
FORMULA BridgeAndVehicles-PT-V04P05N02-UpperBounds-04 2 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
BridgeAndVehicles-PT-V04P05N02-UpperBounds-04,0,0.044525,4924,1,0,2462,319,143,2398,59,1029,103
Min sum of variable value : 0
Maximum sum along a path : 2
Bounds property BridgeAndVehicles-PT-V04P05N02-UpperBounds-11 :0 <= u1.SUR_PONT_A <= 2
FORMULA BridgeAndVehicles-PT-V04P05N02-UpperBounds-11 2 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
BridgeAndVehicles-PT-V04P05N02-UpperBounds-11,0,0.044612,4924,1,0,2462,319,143,2398,59,1029,103

BK_STOP 1620526291453

--------------------
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="BridgeAndVehicles-PT-V04P05N02"
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 BridgeAndVehicles-PT-V04P05N02, 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 r026-tajo-162038143500163"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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