fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r189-tajo-162089432400020
Last Updated
Jun 28, 2021

About the Execution of 2020-gold for QuasiCertifProtocol-COL-18

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
812.968 3600000.00 168214.00 128.00 FTFTTTFFTFFTFTFT 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/mcc2021-input.r189-tajo-162089432400020.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 gold2020
Input is QuasiCertifProtocol-COL-18, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r189-tajo-162089432400020
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 460K
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 131K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.3K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 73K 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.8K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Mar 28 16:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 28 16:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 28 16:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 28 16:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Mar 27 10:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 27 10:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 25 13:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 25 13:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 22 08:13 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 08:13 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_pt
-rw-r--r-- 1 mcc users 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 5 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 93K 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 QuasiCertifProtocol-COL-18-ReachabilityFireability-00
FORMULA_NAME QuasiCertifProtocol-COL-18-ReachabilityFireability-01
FORMULA_NAME QuasiCertifProtocol-COL-18-ReachabilityFireability-02
FORMULA_NAME QuasiCertifProtocol-COL-18-ReachabilityFireability-03
FORMULA_NAME QuasiCertifProtocol-COL-18-ReachabilityFireability-04
FORMULA_NAME QuasiCertifProtocol-COL-18-ReachabilityFireability-05
FORMULA_NAME QuasiCertifProtocol-COL-18-ReachabilityFireability-06
FORMULA_NAME QuasiCertifProtocol-COL-18-ReachabilityFireability-07
FORMULA_NAME QuasiCertifProtocol-COL-18-ReachabilityFireability-08
FORMULA_NAME QuasiCertifProtocol-COL-18-ReachabilityFireability-09
FORMULA_NAME QuasiCertifProtocol-COL-18-ReachabilityFireability-10
FORMULA_NAME QuasiCertifProtocol-COL-18-ReachabilityFireability-11
FORMULA_NAME QuasiCertifProtocol-COL-18-ReachabilityFireability-12
FORMULA_NAME QuasiCertifProtocol-COL-18-ReachabilityFireability-13
FORMULA_NAME QuasiCertifProtocol-COL-18-ReachabilityFireability-14
FORMULA_NAME QuasiCertifProtocol-COL-18-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1621408744697

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-19 07:19:06] [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-19 07:19:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-19 07:19:06] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
SLF4J: Failed to load class "org.slf4j.impl.StaticLoggerBinder".
SLF4J: Defaulting to no-operation (NOP) logger implementation
SLF4J: See http://www.slf4j.org/codes.html#StaticLoggerBinder for further details.
[2021-05-19 07:19:07] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 667 ms
[2021-05-19 07:19:07] [INFO ] sort/places :
tsidxtsid->n9,n8,n7,
Dot->malicious_reservoir,CstopAbort,SstopAbort,AstopAbort,a5,a4,a3,a2,a1,Astart,AstopOK,
tsid->n6,n5,n4,n3,n2,n1,c1,Cstart,Sstart,s2,s3,s4,s5,s6,SstopOK,CstopOK,

[2021-05-19 07:19:07] [INFO ] Imported 30 HL places and 26 HL transitions for a total of 1398 PT places and 296.0 transition bindings in 62 ms.
[2021-05-19 07:19:07] [INFO ] Computed order based on color domains.
[2021-05-19 07:19:07] [INFO ] Unfolded HLPN to a Petri net with 1398 places and 296 transitions in 31 ms.
[2021-05-19 07:19:07] [INFO ] Unfolded HLPN properties in 0 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 61 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 440 resets, run finished after 280 ms. (steps per millisecond=35 ) properties seen :[0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
FORMULA QuasiCertifProtocol-COL-18-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 42 ms. (steps per millisecond=238 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 26 ms. (steps per millisecond=384 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 151 ms. (steps per millisecond=66 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 20 ms. (steps per millisecond=500 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 25 ms. (steps per millisecond=400 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 159 ms. (steps per millisecond=62 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 45 ms. (steps per millisecond=222 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 41 ms. (steps per millisecond=243 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 211 ms. (steps per millisecond=47 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 30 ms. (steps per millisecond=333 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 36 ms. (steps per millisecond=277 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 200 ms. (steps per millisecond=50 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 21 ms. (steps per millisecond=476 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 39 ms. (steps per millisecond=256 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 23 ms. (steps per millisecond=434 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 296 rows 1398 cols
[2021-05-19 07:19:08] [INFO ] Computed 1103 place invariants in 70 ms
[2021-05-19 07:19:09] [INFO ] [Real]Absence check using 4 positive place invariants in 57 ms returned sat
[2021-05-19 07:19:10] [INFO ] [Real]Absence check using 4 positive and 1099 generalized place invariants in 1310 ms returned sat
[2021-05-19 07:19:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:19:14] [INFO ] [Real]Absence check using state equation in 3063 ms returned (error "Solver has unexpectedly terminated")
[2021-05-19 07:19:14] [INFO ] [Real]Absence check using 4 positive place invariants in 22 ms returned sat
[2021-05-19 07:19:15] [INFO ] [Real]Absence check using 4 positive and 1099 generalized place invariants in 1147 ms returned sat
[2021-05-19 07:19:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:19:19] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-19 07:19:19] [INFO ] [Real]Absence check using state equation in 3589 ms returned (error "Failed to check-sat")
[2021-05-19 07:19:19] [INFO ] [Real]Absence check using 4 positive place invariants in 36 ms returned sat
[2021-05-19 07:19:22] [INFO ] [Real]Absence check using 4 positive and 1099 generalized place invariants in 3440 ms returned sat
[2021-05-19 07:19:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:19:24] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-19 07:19:24] [INFO ] [Real]Absence check using state equation in 1262 ms returned (error "Failed to check-sat")
[2021-05-19 07:19:24] [INFO ] [Real]Absence check using 4 positive place invariants in 16 ms returned sat
[2021-05-19 07:19:25] [INFO ] [Real]Absence check using 4 positive and 1099 generalized place invariants in 831 ms returned sat
[2021-05-19 07:19:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:19:27] [INFO ] [Real]Absence check using state equation in 2823 ms returned sat
[2021-05-19 07:19:28] [INFO ] Computed and/alt/rep : 276/1435/276 causal constraints in 33 ms.
[2021-05-19 07:19:28] [INFO ] Added : 31 causal constraints over 7 iterations in 501 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 18 ms.
[2021-05-19 07:19:28] [INFO ] [Real]Absence check using 4 positive place invariants in 42 ms returned sat
[2021-05-19 07:19:30] [INFO ] [Real]Absence check using 4 positive and 1099 generalized place invariants in 1146 ms returned sat
[2021-05-19 07:19:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:19:33] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-19 07:19:33] [INFO ] [Real]Absence check using state equation in 3627 ms returned (error "Failed to check-sat")
[2021-05-19 07:19:33] [INFO ] [Real]Absence check using 4 positive place invariants in 21 ms returned sat
[2021-05-19 07:19:35] [INFO ] [Real]Absence check using 4 positive and 1099 generalized place invariants in 1782 ms returned sat
[2021-05-19 07:19:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:19:38] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-19 07:19:38] [INFO ] [Real]Absence check using state equation in 2990 ms returned unknown
[2021-05-19 07:19:38] [INFO ] [Real]Absence check using 4 positive place invariants in 13 ms returned sat
[2021-05-19 07:19:40] [INFO ] [Real]Absence check using 4 positive and 1099 generalized place invariants in 1138 ms returned sat
[2021-05-19 07:19:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:19:43] [INFO ] [Real]Absence check using state equation in 3602 ms returned sat
[2021-05-19 07:19:43] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed") while checking expression at index 6
[2021-05-19 07:19:43] [INFO ] [Real]Absence check using 4 positive place invariants in 19 ms returned sat
[2021-05-19 07:19:44] [INFO ] [Real]Absence check using 4 positive and 1099 generalized place invariants in 1081 ms returned sat
[2021-05-19 07:19:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:19:48] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-19 07:19:48] [INFO ] [Real]Absence check using state equation in 3765 ms returned (error "Failed to check-sat")
[2021-05-19 07:19:48] [INFO ] [Real]Absence check using 4 positive place invariants in 20 ms returned sat
[2021-05-19 07:19:52] [INFO ] [Real]Absence check using 4 positive and 1099 generalized place invariants in 3630 ms returned sat
[2021-05-19 07:19:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:19:53] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-19 07:19:53] [INFO ] [Real]Absence check using state equation in 1210 ms returned (error "Failed to check-sat")
[2021-05-19 07:19:53] [INFO ] [Real]Absence check using 4 positive place invariants in 15 ms returned sat
[2021-05-19 07:19:54] [INFO ] [Real]Absence check using 4 positive and 1099 generalized place invariants in 961 ms returned sat
[2021-05-19 07:19:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:19:58] [INFO ] [Real]Absence check using state equation in 3201 ms returned sat
[2021-05-19 07:19:58] [INFO ] Computed and/alt/rep : 276/1435/276 causal constraints in 21 ms.
[2021-05-19 07:19:58] [INFO ] Added : 43 causal constraints over 9 iterations in 398 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 38 ms.
[2021-05-19 07:19:58] [INFO ] [Real]Absence check using 4 positive place invariants in 16 ms returned sat
[2021-05-19 07:20:00] [INFO ] [Real]Absence check using 4 positive and 1099 generalized place invariants in 1436 ms returned sat
[2021-05-19 07:20:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:20:03] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-19 07:20:03] [INFO ] [Real]Absence check using state equation in 3399 ms returned (error "Failed to check-sat")
[2021-05-19 07:20:03] [INFO ] [Real]Absence check using 4 positive place invariants in 18 ms returned sat
[2021-05-19 07:20:05] [INFO ] [Real]Absence check using 4 positive and 1099 generalized place invariants in 1650 ms returned sat
[2021-05-19 07:20:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:20:08] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-19 07:20:08] [INFO ] [Real]Absence check using state equation in 3164 ms returned (error "Failed to check-sat")
[2021-05-19 07:20:08] [INFO ] [Real]Absence check using 4 positive place invariants in 25 ms returned sat
[2021-05-19 07:20:09] [INFO ] [Real]Absence check using 4 positive and 1099 generalized place invariants in 1139 ms returned sat
[2021-05-19 07:20:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:20:13] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-19 07:20:13] [INFO ] [Real]Absence check using state equation in 3708 ms returned (error "Failed to check-sat")
[2021-05-19 07:20:13] [INFO ] [Real]Absence check using 4 positive place invariants in 20 ms returned sat
[2021-05-19 07:20:15] [INFO ] [Real]Absence check using 4 positive and 1099 generalized place invariants in 1108 ms returned sat
[2021-05-19 07:20:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:20:18] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-19 07:20:18] [INFO ] [Real]Absence check using state equation in 3700 ms returned (error "Failed to check-sat")
[2021-05-19 07:20:18] [INFO ] [Real]Absence check using 4 positive place invariants in 19 ms returned sat
[2021-05-19 07:20:19] [INFO ] [Real]Absence check using 4 positive and 1099 generalized place invariants in 952 ms returned sat
[2021-05-19 07:20:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:20:23] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-19 07:20:23] [INFO ] [Real]Absence check using state equation in 3883 ms returned (error "Failed to check-sat")
Incomplete Parikh walk after 4400 steps, including 102 resets, run finished after 80 ms. (steps per millisecond=55 ) properties seen :[0, 1, 1, 1, 1, 0, 0, 1, 0, 1, 1, 1, 0, 0, 0] could not realise parikh vector
FORMULA QuasiCertifProtocol-COL-18-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA QuasiCertifProtocol-COL-18-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA QuasiCertifProtocol-COL-18-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA QuasiCertifProtocol-COL-18-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA QuasiCertifProtocol-COL-18-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA QuasiCertifProtocol-COL-18-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA QuasiCertifProtocol-COL-18-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA QuasiCertifProtocol-COL-18-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 3200 steps, including 97 resets, run finished after 40 ms. (steps per millisecond=80 ) properties seen :[0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Support contains 957 out of 1398 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1398/1398 places, 296/296 transitions.
Discarding 42 places :
Also discarding 0 output transitions
Graph (complete) has 9608 edges and 1398 vertex of which 1356 are kept as prefixes of interest. Removing 42 places using SCC suffix rule.12 ms
Applied a total of 1 rules in 92 ms. Remains 1356 /1398 variables (removed 42) and now considering 296/296 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1356/1398 places, 296/296 transitions.
Incomplete random walk after 1000000 steps, including 44211 resets, run finished after 7925 ms. (steps per millisecond=126 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 3254 resets, run finished after 2012 ms. (steps per millisecond=497 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 863658 steps, including 2745 resets, run timeout after 5001 ms. (steps per millisecond=172 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 2416 resets, run finished after 1866 ms. (steps per millisecond=535 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 300644 steps, including 1072 resets, run timeout after 5001 ms. (steps per millisecond=60 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 3204 resets, run finished after 1942 ms. (steps per millisecond=514 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 3199 resets, run finished after 3452 ms. (steps per millisecond=289 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 2421 resets, run finished after 1956 ms. (steps per millisecond=511 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Interrupted probabilistic random walk after 14878014 steps, run timeout after 30001 ms. (steps per millisecond=495 ) properties seen :[0, 1, 1, 0, 1, 1, 1]
Probabilistic random walk after 14878014 steps, saw 1633145 distinct states, run finished after 30001 ms. (steps per millisecond=495 ) properties seen :[0, 1, 1, 0, 1, 1, 1]
FORMULA QuasiCertifProtocol-COL-18-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA QuasiCertifProtocol-COL-18-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA QuasiCertifProtocol-COL-18-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA QuasiCertifProtocol-COL-18-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA QuasiCertifProtocol-COL-18-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 296 rows 1356 cols
[2021-05-19 07:21:23] [INFO ] Computed 1062 place invariants in 109 ms
[2021-05-19 07:21:24] [INFO ] [Real]Absence check using 0 positive and 1062 generalized place invariants in 911 ms returned sat
[2021-05-19 07:21:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:21:26] [INFO ] [Real]Absence check using state equation in 2248 ms returned unsat
[2021-05-19 07:21:27] [INFO ] [Real]Absence check using 0 positive and 1062 generalized place invariants in 1132 ms returned sat
[2021-05-19 07:21:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:21:31] [INFO ] [Real]Absence check using state equation in 3557 ms returned unsat
FORMULA QuasiCertifProtocol-COL-18-ReachabilityFireability-09 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA QuasiCertifProtocol-COL-18-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="QuasiCertifProtocol-COL-18"
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 QuasiCertifProtocol-COL-18, 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 r189-tajo-162089432400020"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/QuasiCertifProtocol-COL-18.tgz
mv QuasiCertifProtocol-COL-18 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 ;