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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.9M
-rw-r--r-- 1 mcc users 132K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 555K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 104K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 464K 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 16K Mar 28 16:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 59K Mar 28 16:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 21K Mar 28 16:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 77K Mar 28 16:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 19K Mar 27 06:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 59K Mar 27 06:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 17K Mar 25 08:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Mar 25 08:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 4.5K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 9.6K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 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 253K 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-PT-3-ReachabilityFireability-00
FORMULA_NAME Peterson-PT-3-ReachabilityFireability-01
FORMULA_NAME Peterson-PT-3-ReachabilityFireability-02
FORMULA_NAME Peterson-PT-3-ReachabilityFireability-03
FORMULA_NAME Peterson-PT-3-ReachabilityFireability-04
FORMULA_NAME Peterson-PT-3-ReachabilityFireability-05
FORMULA_NAME Peterson-PT-3-ReachabilityFireability-06
FORMULA_NAME Peterson-PT-3-ReachabilityFireability-07
FORMULA_NAME Peterson-PT-3-ReachabilityFireability-08
FORMULA_NAME Peterson-PT-3-ReachabilityFireability-09
FORMULA_NAME Peterson-PT-3-ReachabilityFireability-10
FORMULA_NAME Peterson-PT-3-ReachabilityFireability-11
FORMULA_NAME Peterson-PT-3-ReachabilityFireability-12
FORMULA_NAME Peterson-PT-3-ReachabilityFireability-13
FORMULA_NAME Peterson-PT-3-ReachabilityFireability-14
FORMULA_NAME Peterson-PT-3-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1621024853064

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-14 20:40:54] [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 20:40:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-14 20:40:54] [INFO ] Load time of PNML (sax parser for PT used): 71 ms
[2021-05-14 20:40:54] [INFO ] Transformed 244 places.
[2021-05-14 20:40:54] [INFO ] Transformed 332 transitions.
[2021-05-14 20:40:54] [INFO ] Found NUPN structural information;
[2021-05-14 20:40:54] [INFO ] Parsed PT model containing 244 places and 332 transitions in 113 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 33 ms.
Working with output stream class java.io.PrintStream
FORMULA Peterson-PT-3-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 0 resets, run finished after 108 ms. (steps per millisecond=92 ) properties seen :[0, 0, 1, 0, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0]
FORMULA Peterson-PT-3-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-3-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-3-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-3-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 75 ms. (steps per millisecond=133 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0]
FORMULA Peterson-PT-3-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Peterson-PT-3-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
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]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 16 ms. (steps per millisecond=625 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 14 ms. (steps per millisecond=714 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 26 ms. (steps per millisecond=384 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 17 ms. (steps per millisecond=588 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 15 ms. (steps per millisecond=666 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 16 ms. (steps per millisecond=625 ) properties seen :[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]
[2021-05-14 20:40:55] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 244 cols
[2021-05-14 20:40:55] [INFO ] Computed 15 place invariants in 10 ms
[2021-05-14 20:40:55] [INFO ] [Real]Absence check using 11 positive place invariants in 33 ms returned sat
[2021-05-14 20:40:55] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 79 ms returned unsat
[2021-05-14 20:40:55] [INFO ] [Real]Absence check using 11 positive place invariants in 13 ms returned sat
[2021-05-14 20:40:55] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2021-05-14 20:40:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 20:40:55] [INFO ] [Real]Absence check using state equation in 195 ms returned sat
[2021-05-14 20:40:55] [INFO ] State equation strengthened by 66 read => feed constraints.
[2021-05-14 20:40:55] [INFO ] [Real]Added 66 Read/Feed constraints in 9 ms returned sat
[2021-05-14 20:40:55] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 20:40:55] [INFO ] [Nat]Absence check using 11 positive place invariants in 29 ms returned sat
[2021-05-14 20:40:55] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2021-05-14 20:40:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 20:40:55] [INFO ] [Nat]Absence check using state equation in 194 ms returned sat
[2021-05-14 20:40:55] [INFO ] [Nat]Added 66 Read/Feed constraints in 12 ms returned sat
[2021-05-14 20:40:56] [INFO ] Deduced a trap composed of 9 places in 143 ms
[2021-05-14 20:40:56] [INFO ] Deduced a trap composed of 9 places in 104 ms
[2021-05-14 20:40:56] [INFO ] Deduced a trap composed of 16 places in 102 ms
[2021-05-14 20:40:56] [INFO ] Deduced a trap composed of 9 places in 103 ms
[2021-05-14 20:40:56] [INFO ] Deduced a trap composed of 13 places in 98 ms
[2021-05-14 20:40:56] [INFO ] Deduced a trap composed of 49 places in 90 ms
[2021-05-14 20:40:56] [INFO ] Deduced a trap composed of 13 places in 90 ms
[2021-05-14 20:40:56] [INFO ] Deduced a trap composed of 16 places in 90 ms
[2021-05-14 20:40:57] [INFO ] Deduced a trap composed of 50 places in 98 ms
[2021-05-14 20:40:57] [INFO ] Deduced a trap composed of 41 places in 82 ms
[2021-05-14 20:40:57] [INFO ] Deduced a trap composed of 31 places in 77 ms
[2021-05-14 20:40:57] [INFO ] Deduced a trap composed of 30 places in 72 ms
[2021-05-14 20:40:57] [INFO ] Deduced a trap composed of 49 places in 65 ms
[2021-05-14 20:40:57] [INFO ] Deduced a trap composed of 53 places in 61 ms
[2021-05-14 20:40:57] [INFO ] Deduced a trap composed of 49 places in 63 ms
[2021-05-14 20:40:57] [INFO ] Deduced a trap composed of 84 places in 52 ms
[2021-05-14 20:40:57] [INFO ] Deduced a trap composed of 97 places in 60 ms
[2021-05-14 20:40:57] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 1730 ms
[2021-05-14 20:40:57] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 20 ms.
[2021-05-14 20:40:58] [INFO ] Added : 304 causal constraints over 61 iterations in 1185 ms. Result :sat
[2021-05-14 20:40:58] [INFO ] Deduced a trap composed of 60 places in 66 ms
[2021-05-14 20:40:59] [INFO ] Deduced a trap composed of 61 places in 56 ms
[2021-05-14 20:40:59] [INFO ] Deduced a trap composed of 64 places in 47 ms
[2021-05-14 20:40:59] [INFO ] Deduced a trap composed of 73 places in 51 ms
[2021-05-14 20:40:59] [INFO ] Deduced a trap composed of 49 places in 56 ms
[2021-05-14 20:40:59] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 416 ms
Attempting to minimize the solution found.
Minimization took 22 ms.
[2021-05-14 20:40:59] [INFO ] [Real]Absence check using 11 positive place invariants in 12 ms returned sat
[2021-05-14 20:40:59] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2021-05-14 20:40:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 20:40:59] [INFO ] [Real]Absence check using state equation in 202 ms returned sat
[2021-05-14 20:40:59] [INFO ] [Real]Added 66 Read/Feed constraints in 10 ms returned sat
[2021-05-14 20:40:59] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 20:40:59] [INFO ] [Nat]Absence check using 11 positive place invariants in 25 ms returned sat
[2021-05-14 20:40:59] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 1 ms returned sat
[2021-05-14 20:40:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 20:40:59] [INFO ] [Nat]Absence check using state equation in 183 ms returned sat
[2021-05-14 20:40:59] [INFO ] [Nat]Added 66 Read/Feed constraints in 11 ms returned sat
[2021-05-14 20:40:59] [INFO ] Deduced a trap composed of 9 places in 89 ms
[2021-05-14 20:41:00] [INFO ] Deduced a trap composed of 9 places in 86 ms
[2021-05-14 20:41:00] [INFO ] Deduced a trap composed of 16 places in 87 ms
[2021-05-14 20:41:00] [INFO ] Deduced a trap composed of 9 places in 86 ms
[2021-05-14 20:41:00] [INFO ] Deduced a trap composed of 13 places in 76 ms
[2021-05-14 20:41:00] [INFO ] Deduced a trap composed of 49 places in 76 ms
[2021-05-14 20:41:00] [INFO ] Deduced a trap composed of 13 places in 75 ms
[2021-05-14 20:41:00] [INFO ] Deduced a trap composed of 16 places in 89 ms
[2021-05-14 20:41:00] [INFO ] Deduced a trap composed of 50 places in 95 ms
[2021-05-14 20:41:00] [INFO ] Deduced a trap composed of 41 places in 80 ms
[2021-05-14 20:41:00] [INFO ] Deduced a trap composed of 31 places in 78 ms
[2021-05-14 20:41:01] [INFO ] Deduced a trap composed of 30 places in 79 ms
[2021-05-14 20:41:01] [INFO ] Deduced a trap composed of 49 places in 58 ms
[2021-05-14 20:41:01] [INFO ] Deduced a trap composed of 53 places in 58 ms
[2021-05-14 20:41:01] [INFO ] Deduced a trap composed of 49 places in 56 ms
[2021-05-14 20:41:01] [INFO ] Deduced a trap composed of 84 places in 48 ms
[2021-05-14 20:41:01] [INFO ] Deduced a trap composed of 97 places in 53 ms
[2021-05-14 20:41:01] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 1490 ms
[2021-05-14 20:41:01] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 14 ms.
[2021-05-14 20:41:02] [INFO ] Added : 304 causal constraints over 61 iterations in 1057 ms. Result :sat
[2021-05-14 20:41:02] [INFO ] Deduced a trap composed of 60 places in 55 ms
[2021-05-14 20:41:02] [INFO ] Deduced a trap composed of 61 places in 56 ms
[2021-05-14 20:41:02] [INFO ] Deduced a trap composed of 64 places in 54 ms
[2021-05-14 20:41:02] [INFO ] Deduced a trap composed of 73 places in 61 ms
[2021-05-14 20:41:02] [INFO ] Deduced a trap composed of 49 places in 65 ms
[2021-05-14 20:41:02] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 425 ms
Attempting to minimize the solution found.
Minimization took 12 ms.
[2021-05-14 20:41:02] [INFO ] [Real]Absence check using 11 positive place invariants in 12 ms returned sat
[2021-05-14 20:41:02] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 1 ms returned sat
[2021-05-14 20:41:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 20:41:03] [INFO ] [Real]Absence check using state equation in 165 ms returned sat
[2021-05-14 20:41:03] [INFO ] [Real]Added 66 Read/Feed constraints in 10 ms returned sat
[2021-05-14 20:41:03] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 20:41:03] [INFO ] [Nat]Absence check using 11 positive place invariants in 27 ms returned sat
[2021-05-14 20:41:03] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 1 ms returned sat
[2021-05-14 20:41:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 20:41:03] [INFO ] [Nat]Absence check using state equation in 167 ms returned sat
[2021-05-14 20:41:03] [INFO ] [Nat]Added 66 Read/Feed constraints in 12 ms returned sat
[2021-05-14 20:41:03] [INFO ] Deduced a trap composed of 16 places in 64 ms
[2021-05-14 20:41:03] [INFO ] Deduced a trap composed of 12 places in 78 ms
[2021-05-14 20:41:03] [INFO ] Deduced a trap composed of 9 places in 63 ms
[2021-05-14 20:41:03] [INFO ] Deduced a trap composed of 27 places in 94 ms
[2021-05-14 20:41:03] [INFO ] Deduced a trap composed of 9 places in 63 ms
[2021-05-14 20:41:03] [INFO ] Deduced a trap composed of 27 places in 65 ms
[2021-05-14 20:41:03] [INFO ] Deduced a trap composed of 27 places in 63 ms
[2021-05-14 20:41:04] [INFO ] Deduced a trap composed of 10 places in 65 ms
[2021-05-14 20:41:04] [INFO ] Deduced a trap composed of 29 places in 70 ms
[2021-05-14 20:41:04] [INFO ] Deduced a trap composed of 49 places in 38 ms
[2021-05-14 20:41:04] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 774 ms
[2021-05-14 20:41:04] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 19 ms.
[2021-05-14 20:41:05] [INFO ] Added : 304 causal constraints over 61 iterations in 1034 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 18 ms.
[2021-05-14 20:41:05] [INFO ] [Real]Absence check using 11 positive place invariants in 13 ms returned sat
[2021-05-14 20:41:05] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned unsat
[2021-05-14 20:41:05] [INFO ] [Real]Absence check using 11 positive place invariants in 15 ms returned unsat
[2021-05-14 20:41:05] [INFO ] [Real]Absence check using 11 positive place invariants in 11 ms returned sat
[2021-05-14 20:41:05] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2021-05-14 20:41:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 20:41:05] [INFO ] [Real]Absence check using state equation in 157 ms returned sat
[2021-05-14 20:41:05] [INFO ] [Real]Added 66 Read/Feed constraints in 8 ms returned sat
[2021-05-14 20:41:05] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 20:41:05] [INFO ] [Nat]Absence check using 11 positive place invariants in 21 ms returned sat
[2021-05-14 20:41:05] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 1 ms returned sat
[2021-05-14 20:41:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 20:41:05] [INFO ] [Nat]Absence check using state equation in 168 ms returned sat
[2021-05-14 20:41:05] [INFO ] [Nat]Added 66 Read/Feed constraints in 11 ms returned sat
[2021-05-14 20:41:05] [INFO ] Deduced a trap composed of 31 places in 67 ms
[2021-05-14 20:41:05] [INFO ] Deduced a trap composed of 11 places in 67 ms
[2021-05-14 20:41:06] [INFO ] Deduced a trap composed of 21 places in 72 ms
[2021-05-14 20:41:06] [INFO ] Deduced a trap composed of 38 places in 65 ms
[2021-05-14 20:41:06] [INFO ] Deduced a trap composed of 48 places in 62 ms
[2021-05-14 20:41:06] [INFO ] Deduced a trap composed of 30 places in 59 ms
[2021-05-14 20:41:06] [INFO ] Deduced a trap composed of 56 places in 63 ms
[2021-05-14 20:41:06] [INFO ] Deduced a trap composed of 12 places in 73 ms
[2021-05-14 20:41:06] [INFO ] Deduced a trap composed of 26 places in 73 ms
[2021-05-14 20:41:06] [INFO ] Deduced a trap composed of 13 places in 58 ms
[2021-05-14 20:41:06] [INFO ] Deduced a trap composed of 9 places in 56 ms
[2021-05-14 20:41:06] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 831 ms
[2021-05-14 20:41:06] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 19 ms.
[2021-05-14 20:41:07] [INFO ] Added : 304 causal constraints over 61 iterations in 1001 ms. Result :sat
[2021-05-14 20:41:07] [INFO ] Deduced a trap composed of 34 places in 64 ms
[2021-05-14 20:41:07] [INFO ] Deduced a trap composed of 27 places in 66 ms
[2021-05-14 20:41:07] [INFO ] Deduced a trap composed of 50 places in 71 ms
[2021-05-14 20:41:07] [INFO ] Deduced a trap composed of 9 places in 40 ms
[2021-05-14 20:41:08] [INFO ] Deduced a trap composed of 16 places in 75 ms
[2021-05-14 20:41:08] [INFO ] Deduced a trap composed of 57 places in 65 ms
[2021-05-14 20:41:08] [INFO ] Deduced a trap composed of 35 places in 34 ms
[2021-05-14 20:41:08] [INFO ] Deduced a trap composed of 27 places in 23 ms
[2021-05-14 20:41:08] [INFO ] Deduced a trap composed of 39 places in 27 ms
[2021-05-14 20:41:08] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 726 ms
Attempting to minimize the solution found.
Minimization took 11 ms.
[2021-05-14 20:41:08] [INFO ] [Real]Absence check using 11 positive place invariants in 11 ms returned sat
[2021-05-14 20:41:08] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 1 ms returned sat
[2021-05-14 20:41:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 20:41:08] [INFO ] [Real]Absence check using state equation in 159 ms returned sat
[2021-05-14 20:41:08] [INFO ] [Real]Added 66 Read/Feed constraints in 7 ms returned sat
[2021-05-14 20:41:08] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 20:41:08] [INFO ] [Nat]Absence check using 11 positive place invariants in 16 ms returned sat
[2021-05-14 20:41:08] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 1 ms returned sat
[2021-05-14 20:41:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 20:41:08] [INFO ] [Nat]Absence check using state equation in 192 ms returned sat
[2021-05-14 20:41:08] [INFO ] [Nat]Added 66 Read/Feed constraints in 10 ms returned sat
[2021-05-14 20:41:08] [INFO ] Deduced a trap composed of 35 places in 28 ms
[2021-05-14 20:41:08] [INFO ] Deduced a trap composed of 34 places in 28 ms
[2021-05-14 20:41:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 84 ms
[2021-05-14 20:41:08] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 19 ms.
[2021-05-14 20:41:09] [INFO ] Added : 304 causal constraints over 61 iterations in 1037 ms. Result :sat
[2021-05-14 20:41:10] [INFO ] Deduced a trap composed of 14 places in 87 ms
[2021-05-14 20:41:10] [INFO ] Deduced a trap composed of 27 places in 85 ms
[2021-05-14 20:41:10] [INFO ] Deduced a trap composed of 13 places in 87 ms
[2021-05-14 20:41:10] [INFO ] Deduced a trap composed of 34 places in 73 ms
[2021-05-14 20:41:10] [INFO ] Deduced a trap composed of 45 places in 45 ms
[2021-05-14 20:41:10] [INFO ] Deduced a trap composed of 56 places in 48 ms
[2021-05-14 20:41:10] [INFO ] Deduced a trap composed of 61 places in 62 ms
[2021-05-14 20:41:10] [INFO ] Deduced a trap composed of 52 places in 51 ms
[2021-05-14 20:41:10] [INFO ] Deduced a trap composed of 56 places in 49 ms
[2021-05-14 20:41:10] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 821 ms
Attempting to minimize the solution found.
Minimization took 10 ms.
[2021-05-14 20:41:10] [INFO ] [Real]Absence check using 11 positive place invariants in 11 ms returned sat
[2021-05-14 20:41:10] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 1 ms returned sat
[2021-05-14 20:41:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 20:41:11] [INFO ] [Real]Absence check using state equation in 160 ms returned sat
[2021-05-14 20:41:11] [INFO ] [Real]Added 66 Read/Feed constraints in 9 ms returned sat
[2021-05-14 20:41:11] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 20:41:11] [INFO ] [Nat]Absence check using 11 positive place invariants in 16 ms returned sat
[2021-05-14 20:41:11] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 1 ms returned sat
[2021-05-14 20:41:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 20:41:11] [INFO ] [Nat]Absence check using state equation in 171 ms returned sat
[2021-05-14 20:41:11] [INFO ] [Nat]Added 66 Read/Feed constraints in 12 ms returned sat
[2021-05-14 20:41:11] [INFO ] Deduced a trap composed of 9 places in 61 ms
[2021-05-14 20:41:11] [INFO ] Deduced a trap composed of 17 places in 59 ms
[2021-05-14 20:41:11] [INFO ] Deduced a trap composed of 27 places in 59 ms
[2021-05-14 20:41:11] [INFO ] Deduced a trap composed of 45 places in 66 ms
[2021-05-14 20:41:11] [INFO ] Deduced a trap composed of 45 places in 66 ms
[2021-05-14 20:41:11] [INFO ] Deduced a trap composed of 45 places in 65 ms
[2021-05-14 20:41:11] [INFO ] Deduced a trap composed of 16 places in 59 ms
[2021-05-14 20:41:11] [INFO ] Deduced a trap composed of 16 places in 62 ms
[2021-05-14 20:41:11] [INFO ] Deduced a trap composed of 39 places in 43 ms
[2021-05-14 20:41:11] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 655 ms
[2021-05-14 20:41:11] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 18 ms.
[2021-05-14 20:41:13] [INFO ] Added : 304 causal constraints over 61 iterations in 1055 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 11 ms.
FORMULA Peterson-PT-3-ReachabilityFireability-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Peterson-PT-3-ReachabilityFireability-09 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Peterson-PT-3-ReachabilityFireability-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 74300 steps, including 875 resets, run finished after 239 ms. (steps per millisecond=310 ) properties seen :[1, 1, 1, 1, 0, 0] could not realise parikh vector
FORMULA Peterson-PT-3-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Peterson-PT-3-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Peterson-PT-3-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Peterson-PT-3-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 66900 steps, including 899 resets, run finished after 164 ms. (steps per millisecond=407 ) properties seen :[0, 0] could not realise parikh vector
Incomplete Parikh walk after 65600 steps, including 788 resets, run finished after 157 ms. (steps per millisecond=417 ) properties seen :[0, 0] could not realise parikh vector
Incomplete Parikh walk after 72400 steps, including 956 resets, run finished after 176 ms. (steps per millisecond=411 ) properties seen :[0, 0] could not realise parikh vector
Incomplete Parikh walk after 76900 steps, including 870 resets, run finished after 181 ms. (steps per millisecond=424 ) properties seen :[0, 0] could not realise parikh vector
Incomplete Parikh walk after 76900 steps, including 872 resets, run finished after 182 ms. (steps per millisecond=422 ) properties seen :[0, 0] could not realise parikh vector
Support contains 17 out of 244 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 244/244 places, 332/332 transitions.
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: 88
Iterating post reduction 0 with 88 rules applied. Total rules applied 88 place count 244 transition count 244
Reduce places removed 88 places and 0 transitions.
Iterating post reduction 1 with 88 rules applied. Total rules applied 176 place count 156 transition count 244
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 45 Pre rules applied. Total rules applied 176 place count 156 transition count 199
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 2 with 90 rules applied. Total rules applied 266 place count 111 transition count 199
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 2 with 20 rules applied. Total rules applied 286 place count 101 transition count 189
Applied a total of 286 rules in 40 ms. Remains 101 /244 variables (removed 143) and now considering 189/332 (removed 143) transitions.
Finished structural reductions, in 1 iterations. Remains : 101/244 places, 189/332 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 2026 ms. (steps per millisecond=493 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000000 steps, including 0 resets, run finished after 735 ms. (steps per millisecond=1360 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000000 steps, including 0 resets, run finished after 732 ms. (steps per millisecond=1366 ) properties seen :[0, 0]
Finished probabilistic random walk after 131710 steps, run visited all 2 properties in 195 ms. (steps per millisecond=675 )
Probabilistic random walk after 131710 steps, saw 26343 distinct states, run finished after 195 ms. (steps per millisecond=675 ) properties seen :[1, 1]
FORMULA Peterson-PT-3-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA Peterson-PT-3-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_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-PT-3"
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 Peterson-PT-3, 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-162089151400308"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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