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-162089151400283.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 Peterson-COL-3, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r151-tall-162089151400283
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 380K
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 75K 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.5K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Mar 28 16:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 16:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 28 16:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 27 06:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 27 06:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Mar 25 08:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 25 08:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_pt
-rw-r--r-- 1 mcc users 2 May 5 16:51 instance
-rw-r--r-- 1 mcc users 5 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 43K 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 Peterson-COL-3-ReachabilityCardinality-00
FORMULA_NAME Peterson-COL-3-ReachabilityCardinality-01
FORMULA_NAME Peterson-COL-3-ReachabilityCardinality-02
FORMULA_NAME Peterson-COL-3-ReachabilityCardinality-03
FORMULA_NAME Peterson-COL-3-ReachabilityCardinality-04
FORMULA_NAME Peterson-COL-3-ReachabilityCardinality-05
FORMULA_NAME Peterson-COL-3-ReachabilityCardinality-06
FORMULA_NAME Peterson-COL-3-ReachabilityCardinality-07
FORMULA_NAME Peterson-COL-3-ReachabilityCardinality-08
FORMULA_NAME Peterson-COL-3-ReachabilityCardinality-09
FORMULA_NAME Peterson-COL-3-ReachabilityCardinality-10
FORMULA_NAME Peterson-COL-3-ReachabilityCardinality-11
FORMULA_NAME Peterson-COL-3-ReachabilityCardinality-12
FORMULA_NAME Peterson-COL-3-ReachabilityCardinality-13
FORMULA_NAME Peterson-COL-3-ReachabilityCardinality-14
FORMULA_NAME Peterson-COL-3-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1621019704876

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-14 19:15:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2021-05-14 19:15:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-14 19:15:07] [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-14 19:15:07] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 693 ms
[2021-05-14 19:15:07] [INFO ] sort/places :
ProcTourProc->BeginLoop,TestIdentity,TestAlone,IsEndLoop,
ProcBool->WantSection,
TourProc->Turn,
ProcTour->AskForSection,TestTurn,EndTurn,
Process->Idle,CS,

[2021-05-14 19:15:08] [INFO ] Imported 11 HL places and 14 HL transitions for a total of 256 PT places and 396.0 transition bindings in 55 ms.
[2021-05-14 19:15:08] [INFO ] Computed order based on color domains.
[2021-05-14 19:15:08] [INFO ] Unfolded HLPN to a Petri net with 256 places and 356 transitions in 32 ms.
[2021-05-14 19:15:08] [INFO ] Unfolded HLPN properties in 0 ms.
Deduced a syphon composed of 12 places in 4 ms
Reduce places removed 12 places and 24 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 92 ms.
Working with output stream class java.io.PrintStream
FORMULA Peterson-COL-3-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-COL-3-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 0 resets, run finished after 128 ms. (steps per millisecond=78 ) properties seen :[0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 1, 0]
FORMULA Peterson-COL-3-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-3-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-3-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-3-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 59 ms. (steps per millisecond=169 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 34 ms. (steps per millisecond=294 ) properties seen :[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]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 30 ms. (steps per millisecond=333 ) properties seen :[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]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 41 ms. (steps per millisecond=243 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 43 ms. (steps per millisecond=232 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 20 ms. (steps per millisecond=500 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 24 ms. (steps per millisecond=416 ) properties seen :[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]
[2021-05-14 19:15:08] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 244 cols
[2021-05-14 19:15:08] [INFO ] Computed 15 place invariants in 11 ms
[2021-05-14 19:15:08] [INFO ] [Real]Absence check using 11 positive place invariants in 30 ms returned sat
[2021-05-14 19:15:08] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 4 ms returned sat
[2021-05-14 19:15:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 19:15:09] [INFO ] [Real]Absence check using state equation in 351 ms returned sat
[2021-05-14 19:15:09] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 19:15:09] [INFO ] [Nat]Absence check using 11 positive place invariants in 14 ms returned unsat
[2021-05-14 19:15:09] [INFO ] [Real]Absence check using 11 positive place invariants in 33 ms returned unsat
[2021-05-14 19:15:09] [INFO ] [Real]Absence check using 11 positive place invariants in 30 ms returned sat
[2021-05-14 19:15:09] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 3 ms returned sat
[2021-05-14 19:15:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 19:15:09] [INFO ] [Real]Absence check using state equation in 266 ms returned sat
[2021-05-14 19:15:09] [INFO ] State equation strengthened by 66 read => feed constraints.
[2021-05-14 19:15:09] [INFO ] [Real]Added 66 Read/Feed constraints in 18 ms returned sat
[2021-05-14 19:15:09] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 19:15:09] [INFO ] [Nat]Absence check using 11 positive place invariants in 12 ms returned sat
[2021-05-14 19:15:09] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 3 ms returned sat
[2021-05-14 19:15:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 19:15:10] [INFO ] [Nat]Absence check using state equation in 249 ms returned sat
[2021-05-14 19:15:10] [INFO ] [Nat]Added 66 Read/Feed constraints in 11 ms returned sat
[2021-05-14 19:15:10] [INFO ] Deduced a trap composed of 13 places in 121 ms
[2021-05-14 19:15:10] [INFO ] Deduced a trap composed of 20 places in 151 ms
[2021-05-14 19:15:10] [INFO ] Deduced a trap composed of 16 places in 115 ms
[2021-05-14 19:15:10] [INFO ] Deduced a trap composed of 13 places in 128 ms
[2021-05-14 19:15:10] [INFO ] Deduced a trap composed of 35 places in 104 ms
[2021-05-14 19:15:10] [INFO ] Deduced a trap composed of 34 places in 142 ms
[2021-05-14 19:15:11] [INFO ] Deduced a trap composed of 54 places in 62 ms
[2021-05-14 19:15:11] [INFO ] Deduced a trap composed of 38 places in 66 ms
[2021-05-14 19:15:11] [INFO ] Deduced a trap composed of 31 places in 73 ms
[2021-05-14 19:15:11] [INFO ] Deduced a trap composed of 51 places in 79 ms
[2021-05-14 19:15:11] [INFO ] Deduced a trap composed of 51 places in 79 ms
[2021-05-14 19:15:11] [INFO ] Deduced a trap composed of 51 places in 94 ms
[2021-05-14 19:15:11] [INFO ] Deduced a trap composed of 55 places in 81 ms
[2021-05-14 19:15:11] [INFO ] Deduced a trap composed of 55 places in 101 ms
[2021-05-14 19:15:11] [INFO ] Deduced a trap composed of 38 places in 73 ms
[2021-05-14 19:15:11] [INFO ] Deduced a trap composed of 31 places in 91 ms
[2021-05-14 19:15:12] [INFO ] Deduced a trap composed of 16 places in 69 ms
[2021-05-14 19:15:12] [INFO ] Deduced a trap composed of 34 places in 66 ms
[2021-05-14 19:15:12] [INFO ] Deduced a trap composed of 30 places in 90 ms
[2021-05-14 19:15:12] [INFO ] Deduced a trap composed of 49 places in 54 ms
[2021-05-14 19:15:12] [INFO ] Deduced a trap composed of 27 places in 54 ms
[2021-05-14 19:15:12] [INFO ] Deduced a trap composed of 45 places in 45 ms
[2021-05-14 19:15:12] [INFO ] Deduced a trap composed of 45 places in 55 ms
[2021-05-14 19:15:12] [INFO ] Deduced a trap composed of 54 places in 56 ms
[2021-05-14 19:15:12] [INFO ] Deduced a trap composed of 9 places in 61 ms
[2021-05-14 19:15:12] [INFO ] Deduced a trap composed of 45 places in 51 ms
[2021-05-14 19:15:12] [INFO ] Deduced a trap composed of 20 places in 56 ms
[2021-05-14 19:15:12] [INFO ] Deduced a trap composed of 17 places in 58 ms
[2021-05-14 19:15:13] [INFO ] Deduced a trap composed of 57 places in 42 ms
[2021-05-14 19:15:13] [INFO ] Deduced a trap composed of 70 places in 51 ms
[2021-05-14 19:15:13] [INFO ] Deduced a trap composed of 57 places in 51 ms
[2021-05-14 19:15:13] [INFO ] Deduced a trap composed of 57 places in 51 ms
[2021-05-14 19:15:13] [INFO ] Deduced a trap composed of 53 places in 43 ms
[2021-05-14 19:15:13] [INFO ] Deduced a trap composed of 49 places in 56 ms
[2021-05-14 19:15:13] [INFO ] Deduced a trap composed of 53 places in 42 ms
[2021-05-14 19:15:13] [INFO ] Deduced a trap composed of 49 places in 50 ms
[2021-05-14 19:15:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 36 trap constraints in 4626 ms
[2021-05-14 19:15:14] [INFO ] [Real]Absence check using 11 positive place invariants in 8 ms returned unsat
[2021-05-14 19:15:14] [INFO ] [Real]Absence check using 11 positive place invariants in 9 ms returned sat
[2021-05-14 19:15:14] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 3 ms returned sat
[2021-05-14 19:15:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 19:15:14] [INFO ] [Real]Absence check using state equation in 204 ms returned sat
[2021-05-14 19:15:14] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 19:15:15] [INFO ] [Nat]Absence check using 11 positive place invariants in 15 ms returned sat
[2021-05-14 19:15:15] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2021-05-14 19:15:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 19:15:15] [INFO ] [Nat]Absence check using state equation in 190 ms returned sat
[2021-05-14 19:15:15] [INFO ] [Nat]Added 66 Read/Feed constraints in 12 ms returned sat
[2021-05-14 19:15:15] [INFO ] Deduced a trap composed of 13 places in 90 ms
[2021-05-14 19:15:15] [INFO ] Deduced a trap composed of 16 places in 127 ms
[2021-05-14 19:15:15] [INFO ] Deduced a trap composed of 45 places in 104 ms
[2021-05-14 19:15:15] [INFO ] Deduced a trap composed of 13 places in 127 ms
[2021-05-14 19:15:15] [INFO ] Deduced a trap composed of 16 places in 105 ms
[2021-05-14 19:15:16] [INFO ] Deduced a trap composed of 38 places in 193 ms
[2021-05-14 19:15:16] [INFO ] Deduced a trap composed of 9 places in 317 ms
[2021-05-14 19:15:16] [INFO ] Deduced a trap composed of 50 places in 160 ms
[2021-05-14 19:15:16] [INFO ] Deduced a trap composed of 55 places in 193 ms
[2021-05-14 19:15:16] [INFO ] Deduced a trap composed of 9 places in 85 ms
[2021-05-14 19:15:17] [INFO ] Deduced a trap composed of 14 places in 93 ms
[2021-05-14 19:15:17] [INFO ] Deduced a trap composed of 39 places in 36 ms
[2021-05-14 19:15:17] [INFO ] Deduced a trap composed of 31 places in 33 ms
[2021-05-14 19:15:17] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1886 ms
[2021-05-14 19:15:17] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 18 ms.
[2021-05-14 19:15:18] [INFO ] Added : 268 causal constraints over 54 iterations in 1333 ms. Result :sat
[2021-05-14 19:15:18] [INFO ] Deduced a trap composed of 38 places in 66 ms
[2021-05-14 19:15:18] [INFO ] Deduced a trap composed of 56 places in 67 ms
[2021-05-14 19:15:18] [INFO ] Deduced a trap composed of 35 places in 44 ms
[2021-05-14 19:15:18] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 279 ms
Attempting to minimize the solution found.
Minimization took 17 ms.
[2021-05-14 19:15:18] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned unsat
[2021-05-14 19:15:18] [INFO ] [Real]Absence check using 11 positive place invariants in 9 ms returned unsat
[2021-05-14 19:15:18] [INFO ] [Real]Absence check using 11 positive place invariants in 8 ms returned sat
[2021-05-14 19:15:18] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2021-05-14 19:15:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 19:15:19] [INFO ] [Real]Absence check using state equation in 221 ms returned sat
[2021-05-14 19:15:19] [INFO ] [Real]Added 66 Read/Feed constraints in 17 ms returned sat
[2021-05-14 19:15:19] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 19:15:19] [INFO ] [Nat]Absence check using 11 positive place invariants in 16 ms returned sat
[2021-05-14 19:15:19] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 4 ms returned sat
[2021-05-14 19:15:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 19:15:19] [INFO ] [Nat]Absence check using state equation in 194 ms returned sat
[2021-05-14 19:15:19] [INFO ] [Nat]Added 66 Read/Feed constraints in 12 ms returned sat
[2021-05-14 19:15:19] [INFO ] Deduced a trap composed of 13 places in 84 ms
[2021-05-14 19:15:19] [INFO ] Deduced a trap composed of 16 places in 67 ms
[2021-05-14 19:15:19] [INFO ] Deduced a trap composed of 17 places in 72 ms
[2021-05-14 19:15:19] [INFO ] Deduced a trap composed of 36 places in 59 ms
[2021-05-14 19:15:19] [INFO ] Deduced a trap composed of 87 places in 59 ms
[2021-05-14 19:15:19] [INFO ] Deduced a trap composed of 87 places in 62 ms
[2021-05-14 19:15:20] [INFO ] Deduced a trap composed of 34 places in 62 ms
[2021-05-14 19:15:20] [INFO ] Deduced a trap composed of 56 places in 62 ms
[2021-05-14 19:15:20] [INFO ] Deduced a trap composed of 16 places in 73 ms
[2021-05-14 19:15:20] [INFO ] Deduced a trap composed of 38 places in 85 ms
[2021-05-14 19:15:20] [INFO ] Deduced a trap composed of 9 places in 70 ms
[2021-05-14 19:15:20] [INFO ] Deduced a trap composed of 27 places in 58 ms
[2021-05-14 19:15:20] [INFO ] Deduced a trap composed of 34 places in 64 ms
[2021-05-14 19:15:20] [INFO ] Deduced a trap composed of 56 places in 63 ms
[2021-05-14 19:15:20] [INFO ] Deduced a trap composed of 49 places in 60 ms
[2021-05-14 19:15:20] [INFO ] Deduced a trap composed of 71 places in 50 ms
[2021-05-14 19:15:20] [INFO ] Deduced a trap composed of 38 places in 78 ms
[2021-05-14 19:15:20] [INFO ] Deduced a trap composed of 60 places in 58 ms
[2021-05-14 19:15:20] [INFO ] Deduced a trap composed of 60 places in 53 ms
[2021-05-14 19:15:21] [INFO ] Deduced a trap composed of 27 places in 53 ms
[2021-05-14 19:15:21] [INFO ] Deduced a trap composed of 53 places in 57 ms
[2021-05-14 19:15:21] [INFO ] Deduced a trap composed of 27 places in 81 ms
[2021-05-14 19:15:21] [INFO ] Deduced a trap composed of 20 places in 64 ms
[2021-05-14 19:15:21] [INFO ] Deduced a trap composed of 13 places in 65 ms
[2021-05-14 19:15:21] [INFO ] Deduced a trap composed of 45 places in 73 ms
[2021-05-14 19:15:21] [INFO ] Deduced a trap composed of 45 places in 69 ms
[2021-05-14 19:15:21] [INFO ] Deduced a trap composed of 45 places in 61 ms
[2021-05-14 19:15:21] [INFO ] Deduced a trap composed of 14 places in 76 ms
[2021-05-14 19:15:21] [INFO ] Deduced a trap composed of 38 places in 72 ms
[2021-05-14 19:15:22] [INFO ] Deduced a trap composed of 60 places in 72 ms
[2021-05-14 19:15:22] [INFO ] Deduced a trap composed of 48 places in 72 ms
[2021-05-14 19:15:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 31 trap constraints in 3173 ms
[2021-05-14 19:15:22] [INFO ] [Real]Absence check using 11 positive place invariants in 9 ms returned unsat
[2021-05-14 19:15:22] [INFO ] [Real]Absence check using 11 positive place invariants in 9 ms returned unsat
FORMULA Peterson-COL-3-ReachabilityCardinality-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Peterson-COL-3-ReachabilityCardinality-12 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Peterson-COL-3-ReachabilityCardinality-10 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Peterson-COL-3-ReachabilityCardinality-09 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Peterson-COL-3-ReachabilityCardinality-07 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Peterson-COL-3-ReachabilityCardinality-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Peterson-COL-3-ReachabilityCardinality-03 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Peterson-COL-3-ReachabilityCardinality-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Peterson-COL-3-ReachabilityCardinality-00 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Finished Parikh walk after 34074 steps, including 490 resets, run visited all 1 properties in 151 ms. (steps per millisecond=225 )
FORMULA Peterson-COL-3-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
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="Peterson-COL-3"
export BK_EXAMINATION="ReachabilityCardinality"
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 Peterson-COL-3, examination is ReachabilityCardinality"
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-162089151400283"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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