fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r151-tall-162089151200188
Last Updated
Jun 28, 2021

About the Execution of 2020-gold for ParamProductionCell-PT-1

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
247.880 3600000.00 18050.00 95.60 FFFFFTFTTFTTTFFF normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 600K
-rw-r--r-- 1 mcc users 23K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 146K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 17K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 92K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.1K Mar 28 16:23 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 16:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 28 16:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:23 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K Mar 27 06:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 27 06:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.3K Mar 25 07:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 25 07:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 2 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 174K 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 booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME ParamProductionCell-PT-1-ReachabilityFireability-00
FORMULA_NAME ParamProductionCell-PT-1-ReachabilityFireability-01
FORMULA_NAME ParamProductionCell-PT-1-ReachabilityFireability-02
FORMULA_NAME ParamProductionCell-PT-1-ReachabilityFireability-03
FORMULA_NAME ParamProductionCell-PT-1-ReachabilityFireability-04
FORMULA_NAME ParamProductionCell-PT-1-ReachabilityFireability-05
FORMULA_NAME ParamProductionCell-PT-1-ReachabilityFireability-06
FORMULA_NAME ParamProductionCell-PT-1-ReachabilityFireability-07
FORMULA_NAME ParamProductionCell-PT-1-ReachabilityFireability-08
FORMULA_NAME ParamProductionCell-PT-1-ReachabilityFireability-09
FORMULA_NAME ParamProductionCell-PT-1-ReachabilityFireability-10
FORMULA_NAME ParamProductionCell-PT-1-ReachabilityFireability-11
FORMULA_NAME ParamProductionCell-PT-1-ReachabilityFireability-12
FORMULA_NAME ParamProductionCell-PT-1-ReachabilityFireability-13
FORMULA_NAME ParamProductionCell-PT-1-ReachabilityFireability-14
FORMULA_NAME ParamProductionCell-PT-1-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1621005815952

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-14 15:23:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2021-05-14 15:23:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-14 15:23:37] [INFO ] Load time of PNML (sax parser for PT used): 72 ms
[2021-05-14 15:23:37] [INFO ] Transformed 231 places.
[2021-05-14 15:23:37] [INFO ] Transformed 202 transitions.
[2021-05-14 15:23:37] [INFO ] Found NUPN structural information;
[2021-05-14 15:23:37] [INFO ] Parsed PT model containing 231 places and 202 transitions in 125 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 29 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 0 resets, run finished after 75 ms. (steps per millisecond=133 ) properties seen :[0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 1]
FORMULA ParamProductionCell-PT-1-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ParamProductionCell-PT-1-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ParamProductionCell-PT-1-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ParamProductionCell-PT-1-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 44 ms. (steps per millisecond=227 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 35 ms. (steps per millisecond=285 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 29 ms. (steps per millisecond=344 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 28 ms. (steps per millisecond=357 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 33 ms. (steps per millisecond=303 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 28 ms. (steps per millisecond=357 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 32 ms. (steps per millisecond=312 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 31 ms. (steps per millisecond=322 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 32 ms. (steps per millisecond=312 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 51 ms. (steps per millisecond=196 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 60 ms. (steps per millisecond=166 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 27 ms. (steps per millisecond=370 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 202 rows 231 cols
[2021-05-14 15:23:38] [INFO ] Computed 59 place invariants in 14 ms
[2021-05-14 15:23:38] [INFO ] [Real]Absence check using 35 positive place invariants in 17 ms returned unsat
[2021-05-14 15:23:38] [INFO ] [Real]Absence check using 35 positive place invariants in 17 ms returned sat
[2021-05-14 15:23:38] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 9 ms returned sat
[2021-05-14 15:23:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 15:23:38] [INFO ] [Real]Absence check using state equation in 154 ms returned sat
[2021-05-14 15:23:38] [INFO ] State equation strengthened by 68 read => feed constraints.
[2021-05-14 15:23:38] [INFO ] [Real]Added 68 Read/Feed constraints in 19 ms returned sat
[2021-05-14 15:23:38] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 15:23:38] [INFO ] [Nat]Absence check using 35 positive place invariants in 20 ms returned sat
[2021-05-14 15:23:38] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 9 ms returned sat
[2021-05-14 15:23:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 15:23:38] [INFO ] [Nat]Absence check using state equation in 153 ms returned sat
[2021-05-14 15:23:38] [INFO ] [Nat]Added 68 Read/Feed constraints in 13 ms returned sat
[2021-05-14 15:23:38] [INFO ] Deduced a trap composed of 5 places in 115 ms
[2021-05-14 15:23:39] [INFO ] Deduced a trap composed of 8 places in 77 ms
[2021-05-14 15:23:39] [INFO ] Deduced a trap composed of 8 places in 74 ms
[2021-05-14 15:23:39] [INFO ] Deduced a trap composed of 7 places in 75 ms
[2021-05-14 15:23:39] [INFO ] Deduced a trap composed of 21 places in 72 ms
[2021-05-14 15:23:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 5 trap constraints in 470 ms
[2021-05-14 15:23:39] [INFO ] [Real]Absence check using 35 positive place invariants in 16 ms returned sat
[2021-05-14 15:23:39] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 5 ms returned unsat
[2021-05-14 15:23:39] [INFO ] [Real]Absence check using 35 positive place invariants in 22 ms returned sat
[2021-05-14 15:23:39] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 9 ms returned sat
[2021-05-14 15:23:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 15:23:39] [INFO ] [Real]Absence check using state equation in 164 ms returned sat
[2021-05-14 15:23:39] [INFO ] [Real]Added 68 Read/Feed constraints in 42 ms returned sat
[2021-05-14 15:23:39] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 15:23:39] [INFO ] [Nat]Absence check using 35 positive place invariants in 16 ms returned sat
[2021-05-14 15:23:39] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 9 ms returned sat
[2021-05-14 15:23:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 15:23:39] [INFO ] [Nat]Absence check using state equation in 143 ms returned sat
[2021-05-14 15:23:39] [INFO ] [Nat]Added 68 Read/Feed constraints in 11 ms returned sat
[2021-05-14 15:23:39] [INFO ] Deduced a trap composed of 6 places in 76 ms
[2021-05-14 15:23:40] [INFO ] Deduced a trap composed of 7 places in 58 ms
[2021-05-14 15:23:40] [INFO ] Deduced a trap composed of 5 places in 59 ms
[2021-05-14 15:23:40] [INFO ] Deduced a trap composed of 5 places in 71 ms
[2021-05-14 15:23:40] [INFO ] Deduced a trap composed of 26 places in 58 ms
[2021-05-14 15:23:40] [INFO ] Deduced a trap composed of 14 places in 57 ms
[2021-05-14 15:23:40] [INFO ] Deduced a trap composed of 24 places in 69 ms
[2021-05-14 15:23:40] [INFO ] Deduced a trap composed of 45 places in 57 ms
[2021-05-14 15:23:40] [INFO ] Deduced a trap composed of 34 places in 74 ms
[2021-05-14 15:23:40] [INFO ] Deduced a trap composed of 7 places in 57 ms
[2021-05-14 15:23:40] [INFO ] Deduced a trap composed of 38 places in 56 ms
[2021-05-14 15:23:40] [INFO ] Deduced a trap composed of 53 places in 57 ms
[2021-05-14 15:23:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 12 trap constraints in 886 ms
[2021-05-14 15:23:40] [INFO ] [Real]Absence check using 35 positive place invariants in 13 ms returned unsat
[2021-05-14 15:23:40] [INFO ] [Real]Absence check using 35 positive place invariants in 16 ms returned sat
[2021-05-14 15:23:40] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 13 ms returned sat
[2021-05-14 15:23:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 15:23:41] [INFO ] [Real]Absence check using state equation in 157 ms returned sat
[2021-05-14 15:23:41] [INFO ] [Real]Added 68 Read/Feed constraints in 17 ms returned sat
[2021-05-14 15:23:41] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 15:23:41] [INFO ] [Nat]Absence check using 35 positive place invariants in 19 ms returned sat
[2021-05-14 15:23:41] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 13 ms returned sat
[2021-05-14 15:23:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 15:23:41] [INFO ] [Nat]Absence check using state equation in 147 ms returned sat
[2021-05-14 15:23:41] [INFO ] [Nat]Added 68 Read/Feed constraints in 9 ms returned sat
[2021-05-14 15:23:41] [INFO ] Deduced a trap composed of 7 places in 74 ms
[2021-05-14 15:23:41] [INFO ] Deduced a trap composed of 10 places in 61 ms
[2021-05-14 15:23:41] [INFO ] Deduced a trap composed of 37 places in 66 ms
[2021-05-14 15:23:41] [INFO ] Deduced a trap composed of 33 places in 74 ms
[2021-05-14 15:23:41] [INFO ] Deduced a trap composed of 50 places in 63 ms
[2021-05-14 15:23:41] [INFO ] Deduced a trap composed of 9 places in 84 ms
[2021-05-14 15:23:41] [INFO ] Deduced a trap composed of 7 places in 63 ms
[2021-05-14 15:23:41] [INFO ] Deduced a trap composed of 25 places in 48 ms
[2021-05-14 15:23:41] [INFO ] Deduced a trap composed of 21 places in 59 ms
[2021-05-14 15:23:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 9 trap constraints in 680 ms
[2021-05-14 15:23:42] [INFO ] [Real]Absence check using 35 positive place invariants in 12 ms returned unsat
[2021-05-14 15:23:42] [INFO ] [Real]Absence check using 35 positive place invariants in 10 ms returned unsat
[2021-05-14 15:23:42] [INFO ] [Real]Absence check using 35 positive place invariants in 16 ms returned sat
[2021-05-14 15:23:42] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 15 ms returned sat
[2021-05-14 15:23:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 15:23:42] [INFO ] [Real]Absence check using state equation in 205 ms returned sat
[2021-05-14 15:23:42] [INFO ] [Real]Added 68 Read/Feed constraints in 25 ms returned sat
[2021-05-14 15:23:42] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 15:23:42] [INFO ] [Nat]Absence check using 35 positive place invariants in 20 ms returned sat
[2021-05-14 15:23:42] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 20 ms returned sat
[2021-05-14 15:23:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 15:23:42] [INFO ] [Nat]Absence check using state equation in 197 ms returned sat
[2021-05-14 15:23:42] [INFO ] [Nat]Added 68 Read/Feed constraints in 21 ms returned sat
[2021-05-14 15:23:42] [INFO ] Deduced a trap composed of 5 places in 59 ms
[2021-05-14 15:23:42] [INFO ] Deduced a trap composed of 12 places in 62 ms
[2021-05-14 15:23:42] [INFO ] Deduced a trap composed of 10 places in 59 ms
[2021-05-14 15:23:42] [INFO ] Deduced a trap composed of 9 places in 76 ms
[2021-05-14 15:23:43] [INFO ] Deduced a trap composed of 8 places in 58 ms
[2021-05-14 15:23:43] [INFO ] Deduced a trap composed of 41 places in 57 ms
[2021-05-14 15:23:43] [INFO ] Deduced a trap composed of 28 places in 57 ms
[2021-05-14 15:23:43] [INFO ] Deduced a trap composed of 39 places in 64 ms
[2021-05-14 15:23:43] [INFO ] Deduced a trap composed of 53 places in 68 ms
[2021-05-14 15:23:43] [INFO ] Deduced a trap composed of 11 places in 68 ms
[2021-05-14 15:23:43] [INFO ] Deduced a trap composed of 23 places in 66 ms
[2021-05-14 15:23:43] [INFO ] Deduced a trap composed of 67 places in 46 ms
[2021-05-14 15:23:43] [INFO ] Deduced a trap composed of 7 places in 55 ms
[2021-05-14 15:23:43] [INFO ] Deduced a trap composed of 7 places in 54 ms
[2021-05-14 15:23:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 14 trap constraints in 1028 ms
[2021-05-14 15:23:43] [INFO ] [Real]Absence check using 35 positive place invariants in 10 ms returned unsat
[2021-05-14 15:23:43] [INFO ] [Real]Absence check using 35 positive place invariants in 15 ms returned sat
[2021-05-14 15:23:43] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 9 ms returned sat
[2021-05-14 15:23:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 15:23:43] [INFO ] [Real]Absence check using state equation in 153 ms returned sat
[2021-05-14 15:23:43] [INFO ] [Real]Added 68 Read/Feed constraints in 17 ms returned sat
[2021-05-14 15:23:43] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 15:23:44] [INFO ] [Nat]Absence check using 35 positive place invariants in 16 ms returned sat
[2021-05-14 15:23:44] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 10 ms returned sat
[2021-05-14 15:23:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 15:23:44] [INFO ] [Nat]Absence check using state equation in 151 ms returned sat
[2021-05-14 15:23:44] [INFO ] [Nat]Added 68 Read/Feed constraints in 12 ms returned sat
[2021-05-14 15:23:44] [INFO ] Deduced a trap composed of 7 places in 63 ms
[2021-05-14 15:23:44] [INFO ] Deduced a trap composed of 9 places in 55 ms
[2021-05-14 15:23:44] [INFO ] Deduced a trap composed of 29 places in 65 ms
[2021-05-14 15:23:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 3 trap constraints in 206 ms
[2021-05-14 15:23:44] [INFO ] [Real]Absence check using 35 positive place invariants in 15 ms returned sat
[2021-05-14 15:23:44] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 9 ms returned sat
[2021-05-14 15:23:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 15:23:44] [INFO ] [Real]Absence check using state equation in 151 ms returned sat
[2021-05-14 15:23:44] [INFO ] [Real]Added 68 Read/Feed constraints in 24 ms returned sat
[2021-05-14 15:23:44] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 15:23:44] [INFO ] [Nat]Absence check using 35 positive place invariants in 19 ms returned sat
[2021-05-14 15:23:44] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 10 ms returned sat
[2021-05-14 15:23:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 15:23:44] [INFO ] [Nat]Absence check using state equation in 155 ms returned sat
[2021-05-14 15:23:44] [INFO ] [Nat]Added 68 Read/Feed constraints in 14 ms returned sat
[2021-05-14 15:23:44] [INFO ] Deduced a trap composed of 7 places in 67 ms
[2021-05-14 15:23:45] [INFO ] Deduced a trap composed of 7 places in 66 ms
[2021-05-14 15:23:45] [INFO ] Deduced a trap composed of 41 places in 66 ms
[2021-05-14 15:23:45] [INFO ] Deduced a trap composed of 5 places in 68 ms
[2021-05-14 15:23:45] [INFO ] Deduced a trap composed of 12 places in 66 ms
[2021-05-14 15:23:45] [INFO ] Deduced a trap composed of 10 places in 59 ms
[2021-05-14 15:23:45] [INFO ] Deduced a trap composed of 40 places in 61 ms
[2021-05-14 15:23:45] [INFO ] Deduced a trap composed of 53 places in 63 ms
[2021-05-14 15:23:45] [INFO ] Deduced a trap composed of 7 places in 63 ms
[2021-05-14 15:23:45] [INFO ] Deduced a trap composed of 6 places in 55 ms
[2021-05-14 15:23:45] [INFO ] Deduced a trap composed of 10 places in 52 ms
[2021-05-14 15:23:45] [INFO ] Deduced a trap composed of 59 places in 46 ms
[2021-05-14 15:23:45] [INFO ] Deduced a trap composed of 28 places in 58 ms
[2021-05-14 15:23:45] [INFO ] Deduced a trap composed of 7 places in 47 ms
[2021-05-14 15:23:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 14 trap constraints in 973 ms
FORMULA ParamProductionCell-PT-1-ReachabilityFireability-14 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ParamProductionCell-PT-1-ReachabilityFireability-13 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ParamProductionCell-PT-1-ReachabilityFireability-12 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ParamProductionCell-PT-1-ReachabilityFireability-09 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ParamProductionCell-PT-1-ReachabilityFireability-08 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ParamProductionCell-PT-1-ReachabilityFireability-07 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ParamProductionCell-PT-1-ReachabilityFireability-06 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ParamProductionCell-PT-1-ReachabilityFireability-04 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ParamProductionCell-PT-1-ReachabilityFireability-03 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ParamProductionCell-PT-1-ReachabilityFireability-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ParamProductionCell-PT-1-ReachabilityFireability-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ParamProductionCell-PT-1-ReachabilityFireability-00 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
All properties solved without resorting to model-checking.

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

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="ParamProductionCell-PT-1"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="gold2020"
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 gold2020"
echo " Input is ParamProductionCell-PT-1, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r151-tall-162089151200188"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ParamProductionCell-PT-1.tgz
mv ParamProductionCell-PT-1 execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;