About the Execution of 2021-gold for Angiogenesis-PT-20
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
307.184 | 5439.00 | 12074.00 | 52.00 | 20 20 20 20 10 20 20 20 20 20 20 20 20 19 20 20 | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2022-input.r010-tajo-165245701700130.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2022-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 gold2021
Input is Angiogenesis-PT-20, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r010-tajo-165245701700130
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 236K
-rw-r--r-- 1 mcc users 5.8K Apr 29 19:33 CTLCardinality.txt
-rw-r--r-- 1 mcc users 50K Apr 29 19:33 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Apr 29 19:32 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Apr 29 19:32 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.1K May 9 07:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 9 07:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 9 07:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 9 07:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:03 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 07:03 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 33K May 10 09:33 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 Angiogenesis-PT-20-UpperBounds-00
FORMULA_NAME Angiogenesis-PT-20-UpperBounds-01
FORMULA_NAME Angiogenesis-PT-20-UpperBounds-02
FORMULA_NAME Angiogenesis-PT-20-UpperBounds-03
FORMULA_NAME Angiogenesis-PT-20-UpperBounds-04
FORMULA_NAME Angiogenesis-PT-20-UpperBounds-05
FORMULA_NAME Angiogenesis-PT-20-UpperBounds-06
FORMULA_NAME Angiogenesis-PT-20-UpperBounds-07
FORMULA_NAME Angiogenesis-PT-20-UpperBounds-08
FORMULA_NAME Angiogenesis-PT-20-UpperBounds-09
FORMULA_NAME Angiogenesis-PT-20-UpperBounds-10
FORMULA_NAME Angiogenesis-PT-20-UpperBounds-11
FORMULA_NAME Angiogenesis-PT-20-UpperBounds-12
FORMULA_NAME Angiogenesis-PT-20-UpperBounds-13
FORMULA_NAME Angiogenesis-PT-20-UpperBounds-14
FORMULA_NAME Angiogenesis-PT-20-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1652727641037
Running Version 0
[2022-05-16 19:00:43] [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-05-16 19:00:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 19:00:43] [INFO ] Load time of PNML (sax parser for PT used): 33 ms
[2022-05-16 19:00:43] [INFO ] Transformed 39 places.
[2022-05-16 19:00:43] [INFO ] Transformed 64 transitions.
[2022-05-16 19:00:43] [INFO ] Parsed PT model containing 39 places and 64 transitions in 80 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 9 ms.
// Phase 1: matrix 64 rows 39 cols
[2022-05-16 19:00:43] [INFO ] Computed 8 place invariants in 5 ms
FORMULA Angiogenesis-PT-20-UpperBounds-10 20 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Angiogenesis-PT-20-UpperBounds-09 20 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10018 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=667 ) properties (out of 14) seen :200
FORMULA Angiogenesis-PT-20-UpperBounds-12 20 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Angiogenesis-PT-20-UpperBounds-11 20 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Angiogenesis-PT-20-UpperBounds-08 20 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Angiogenesis-PT-20-UpperBounds-07 20 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Angiogenesis-PT-20-UpperBounds-06 20 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Angiogenesis-PT-20-UpperBounds-05 20 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Angiogenesis-PT-20-UpperBounds-03 20 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Angiogenesis-PT-20-UpperBounds-02 20 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Angiogenesis-PT-20-UpperBounds-01 20 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Angiogenesis-PT-20-UpperBounds-00 20 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 4) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 4) seen :10
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 4) seen :11
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 4) seen :20
// Phase 1: matrix 64 rows 39 cols
[2022-05-16 19:00:43] [INFO ] Computed 8 place invariants in 5 ms
[2022-05-16 19:00:43] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2022-05-16 19:00:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 19:00:43] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2022-05-16 19:00:43] [INFO ] Computed and/alt/rep : 59/142/59 causal constraints (skipped 2 transitions) in 6 ms.
[2022-05-16 19:00:43] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 19:00:43] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2022-05-16 19:00:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 19:00:43] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2022-05-16 19:00:43] [INFO ] Computed and/alt/rep : 59/142/59 causal constraints (skipped 2 transitions) in 16 ms.
[2022-05-16 19:00:43] [INFO ] Added : 55 causal constraints over 11 iterations in 268 ms. Result :sat
Minimization took 19 ms.
[2022-05-16 19:00:43] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2022-05-16 19:00:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 19:00:43] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2022-05-16 19:00:43] [INFO ] Computed and/alt/rep : 59/142/59 causal constraints (skipped 2 transitions) in 16 ms.
[2022-05-16 19:00:44] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 19:00:44] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2022-05-16 19:00:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 19:00:44] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2022-05-16 19:00:44] [INFO ] Computed and/alt/rep : 59/142/59 causal constraints (skipped 2 transitions) in 6 ms.
[2022-05-16 19:00:44] [INFO ] Added : 55 causal constraints over 11 iterations in 91 ms. Result :sat
Minimization took 40 ms.
[2022-05-16 19:00:44] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2022-05-16 19:00:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 19:00:44] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2022-05-16 19:00:44] [INFO ] Computed and/alt/rep : 59/142/59 causal constraints (skipped 2 transitions) in 25 ms.
[2022-05-16 19:00:44] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 19:00:44] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2022-05-16 19:00:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 19:00:44] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2022-05-16 19:00:44] [INFO ] Computed and/alt/rep : 59/142/59 causal constraints (skipped 2 transitions) in 7 ms.
[2022-05-16 19:00:44] [INFO ] Added : 55 causal constraints over 11 iterations in 149 ms. Result :sat
Minimization took 23 ms.
[2022-05-16 19:00:44] [INFO ] [Real]Absence check using 8 positive place invariants in 1 ms returned sat
[2022-05-16 19:00:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 19:00:44] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2022-05-16 19:00:44] [INFO ] Computed and/alt/rep : 59/142/59 causal constraints (skipped 2 transitions) in 3 ms.
[2022-05-16 19:00:44] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 19:00:44] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2022-05-16 19:00:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 19:00:44] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2022-05-16 19:00:44] [INFO ] Computed and/alt/rep : 59/142/59 causal constraints (skipped 2 transitions) in 6 ms.
[2022-05-16 19:00:44] [INFO ] Added : 54 causal constraints over 11 iterations in 76 ms. Result :sat
Minimization took 16 ms.
Current structural bounds on expressions (after SMT) : [10, 20, 20, 20] Max seen :[1, 4, 1, 16]
Incomplete Parikh walk after 11100 steps, including 184 resets, run finished after 31 ms. (steps per millisecond=358 ) properties (out of 4) seen :23 could not realise parikh vector
FORMULA Angiogenesis-PT-20-UpperBounds-15 20 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 22100 steps, including 201 resets, run finished after 34 ms. (steps per millisecond=650 ) properties (out of 3) seen :33 could not realise parikh vector
FORMULA Angiogenesis-PT-20-UpperBounds-14 20 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 14300 steps, including 593 resets, run finished after 20 ms. (steps per millisecond=715 ) properties (out of 2) seen :16 could not realise parikh vector
Incomplete Parikh walk after 15300 steps, including 178 resets, run finished after 26 ms. (steps per millisecond=588 ) properties (out of 2) seen :19 could not realise parikh vector
FORMULA Angiogenesis-PT-20-UpperBounds-04 10 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 1 out of 39 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 39/39 places, 64/64 transitions.
Graph (complete) has 117 edges and 39 vertex of which 38 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 38 transition count 63
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 4 place count 36 transition count 63
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 36 transition count 62
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 1 with 20 rules applied. Total rules applied 25 place count 26 transition count 52
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (complete) has 79 edges and 26 vertex of which 25 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 1 with 10 rules applied. Total rules applied 35 place count 25 transition count 43
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 36 place count 25 transition count 42
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 46 place count 20 transition count 48
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 56 place count 20 transition count 38
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 62 place count 20 transition count 32
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 4 with 5 rules applied. Total rules applied 67 place count 20 transition count 27
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 74 place count 15 transition count 25
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 75 place count 15 transition count 24
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 76 place count 15 transition count 24
Applied a total of 76 rules in 61 ms. Remains 15 /39 variables (removed 24) and now considering 24/64 (removed 40) transitions.
Finished structural reductions, in 1 iterations. Remains : 15/39 places, 24/64 transitions.
Normalized transition count is 23 out of 24 initially.
// Phase 1: matrix 23 rows 15 cols
[2022-05-16 19:00:44] [INFO ] Computed 6 place invariants in 2 ms
Incomplete random walk after 1000016 steps, including 2 resets, run finished after 343 ms. (steps per millisecond=2915 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 335 ms. (steps per millisecond=2985 ) properties (out of 1) seen :10
[2022-05-16 19:00:45] [INFO ] Flow matrix only has 23 transitions (discarded 1 similar events)
// Phase 1: matrix 23 rows 15 cols
[2022-05-16 19:00:45] [INFO ] Computed 6 place invariants in 2 ms
[2022-05-16 19:00:45] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-16 19:00:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 19:00:45] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2022-05-16 19:00:45] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-16 19:00:45] [INFO ] [Real]Added 2 Read/Feed constraints in 3 ms returned sat
[2022-05-16 19:00:45] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 19:00:45] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-16 19:00:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 19:00:45] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2022-05-16 19:00:45] [INFO ] [Nat]Added 2 Read/Feed constraints in 0 ms returned sat
[2022-05-16 19:00:45] [INFO ] Computed and/alt/rep : 22/73/21 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-16 19:00:45] [INFO ] Added : 21 causal constraints over 5 iterations in 47 ms. Result :sat
Minimization took 80 ms.
Current structural bounds on expressions (after SMT) : [20] Max seen :[15]
Incomplete Parikh walk after 8000 steps, including 182 resets, run finished after 15 ms. (steps per millisecond=533 ) properties (out of 1) seen :19 could not realise parikh vector
Support contains 1 out of 15 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 15/15 places, 24/24 transitions.
Applied a total of 0 rules in 2 ms. Remains 15 /15 variables (removed 0) and now considering 24/24 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 15/15 places, 24/24 transitions.
Starting structural reductions, iteration 0 : 15/15 places, 24/24 transitions.
Applied a total of 0 rules in 1 ms. Remains 15 /15 variables (removed 0) and now considering 24/24 (removed 0) transitions.
[2022-05-16 19:00:45] [INFO ] Flow matrix only has 23 transitions (discarded 1 similar events)
// Phase 1: matrix 23 rows 15 cols
[2022-05-16 19:00:45] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-16 19:00:45] [INFO ] Implicit Places using invariants in 46 ms returned [5, 11, 12, 13]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 49 ms to find 4 implicit places.
[2022-05-16 19:00:45] [INFO ] Redundant transitions in 4 ms returned [16]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions :[16]
// Phase 1: matrix 23 rows 11 cols
[2022-05-16 19:00:45] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-16 19:00:45] [INFO ] Dead Transitions using invariants and state equation in 17 ms returned []
Starting structural reductions, iteration 1 : 11/15 places, 23/24 transitions.
Graph (trivial) has 14 edges and 11 vertex of which 6 / 11 are part of one of the 2 SCC in 2 ms
Free SCC test removed 4 places
Drop transitions removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Applied a total of 1 rules in 3 ms. Remains 7 /11 variables (removed 4) and now considering 11/23 (removed 12) transitions.
[2022-05-16 19:00:45] [INFO ] Flow matrix only has 10 transitions (discarded 1 similar events)
// Phase 1: matrix 10 rows 7 cols
[2022-05-16 19:00:45] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-16 19:00:45] [INFO ] Implicit Places using invariants in 25 ms returned []
[2022-05-16 19:00:45] [INFO ] Flow matrix only has 10 transitions (discarded 1 similar events)
// Phase 1: matrix 10 rows 7 cols
[2022-05-16 19:00:45] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-16 19:00:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 19:00:45] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 7/15 places, 11/24 transitions.
Normalized transition count is 10 out of 11 initially.
// Phase 1: matrix 10 rows 7 cols
[2022-05-16 19:00:45] [INFO ] Computed 2 place invariants in 0 ms
Incomplete random walk after 1000014 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=10000 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 232 ms. (steps per millisecond=4310 ) properties (out of 1) seen :13
[2022-05-16 19:00:46] [INFO ] Flow matrix only has 10 transitions (discarded 1 similar events)
// Phase 1: matrix 10 rows 7 cols
[2022-05-16 19:00:46] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-16 19:00:46] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 19:00:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 19:00:46] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2022-05-16 19:00:46] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 19:00:46] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 19:00:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 19:00:46] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2022-05-16 19:00:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 19:00:46] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2022-05-16 19:00:46] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 4 ms to minimize.
[2022-05-16 19:00:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
Current structural bounds on expressions (after SMT) : [19] Max seen :[19]
FORMULA Angiogenesis-PT-20-UpperBounds-13 19 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
BK_STOP 1652727646476
--------------------
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="Angiogenesis-PT-20"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2021"
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 gold2021"
echo " Input is Angiogenesis-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 r010-tajo-165245701700130"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Angiogenesis-PT-20.tgz
mv Angiogenesis-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 '
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 ;