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.r113-smll-162075355700108.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2021-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2020
Input is GPPP-PT-C0010N0000000010, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r113-smll-162075355700108
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 384K
-rw-r--r-- 1 mcc users 8.6K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 19K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 102K 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.0K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Mar 28 16:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 28 16:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 28 16:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 23 11:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 23 11:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.2K Mar 22 19:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 21K Mar 22 19:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K 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 17 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 1 May 5 16:51 large_marking
-rw-r--r-- 1 mcc users 21K 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 GPPP-PT-C0010N0000000010-ReachabilityFireability-00
FORMULA_NAME GPPP-PT-C0010N0000000010-ReachabilityFireability-01
FORMULA_NAME GPPP-PT-C0010N0000000010-ReachabilityFireability-02
FORMULA_NAME GPPP-PT-C0010N0000000010-ReachabilityFireability-03
FORMULA_NAME GPPP-PT-C0010N0000000010-ReachabilityFireability-04
FORMULA_NAME GPPP-PT-C0010N0000000010-ReachabilityFireability-05
FORMULA_NAME GPPP-PT-C0010N0000000010-ReachabilityFireability-06
FORMULA_NAME GPPP-PT-C0010N0000000010-ReachabilityFireability-07
FORMULA_NAME GPPP-PT-C0010N0000000010-ReachabilityFireability-08
FORMULA_NAME GPPP-PT-C0010N0000000010-ReachabilityFireability-09
FORMULA_NAME GPPP-PT-C0010N0000000010-ReachabilityFireability-10
FORMULA_NAME GPPP-PT-C0010N0000000010-ReachabilityFireability-11
FORMULA_NAME GPPP-PT-C0010N0000000010-ReachabilityFireability-12
FORMULA_NAME GPPP-PT-C0010N0000000010-ReachabilityFireability-13
FORMULA_NAME GPPP-PT-C0010N0000000010-ReachabilityFireability-14
FORMULA_NAME GPPP-PT-C0010N0000000010-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1620950193731

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-13 23:56: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-13 23:56:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 23:56:37] [INFO ] Load time of PNML (sax parser for PT used): 68 ms
[2021-05-13 23:56:37] [INFO ] Transformed 33 places.
[2021-05-13 23:56:37] [INFO ] Transformed 22 transitions.
[2021-05-13 23:56:37] [INFO ] Parsed PT model containing 33 places and 22 transitions in 153 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 35 ms.
Working with output stream class java.io.PrintStream
FORMULA GPPP-PT-C0010N0000000010-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10002 steps, including 23 resets, run finished after 98 ms. (steps per millisecond=102 ) properties seen :[0, 1, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1]
FORMULA GPPP-PT-C0010N0000000010-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPPP-PT-C0010N0000000010-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPPP-PT-C0010N0000000010-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPPP-PT-C0010N0000000010-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPPP-PT-C0010N0000000010-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPPP-PT-C0010N0000000010-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPPP-PT-C0010N0000000010-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPPP-PT-C0010N0000000010-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPPP-PT-C0010N0000000010-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 81 ms. (steps per millisecond=123 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 1 resets, run finished after 31 ms. (steps per millisecond=322 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 59 ms. (steps per millisecond=169 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 57 ms. (steps per millisecond=175 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 36 ms. (steps per millisecond=277 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 47 ms. (steps per millisecond=212 ) properties seen :[0, 0, 0, 0, 0, 0]
// Phase 1: matrix 22 rows 33 cols
[2021-05-13 23:56:37] [INFO ] Computed 12 place invariants in 9 ms
[2021-05-13 23:56:38] [INFO ] [Real]Absence check using 6 positive place invariants in 34 ms returned sat
[2021-05-13 23:56:38] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 8 ms returned unsat
[2021-05-13 23:56:38] [INFO ] [Real]Absence check using 6 positive place invariants in 11 ms returned sat
[2021-05-13 23:56:38] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 8 ms returned sat
[2021-05-13 23:56:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 23:56:38] [INFO ] [Real]Absence check using state equation in 52 ms returned unsat
[2021-05-13 23:56:38] [INFO ] [Real]Absence check using 6 positive place invariants in 9 ms returned sat
[2021-05-13 23:56:38] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 7 ms returned sat
[2021-05-13 23:56:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 23:56:38] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2021-05-13 23:56:38] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 23:56:38] [INFO ] [Nat]Absence check using 6 positive place invariants in 20 ms returned sat
[2021-05-13 23:56:41] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 23:56:43] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 4956 ms returned unknown
[2021-05-13 23:56:43] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned unsat
[2021-05-13 23:56:43] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned unsat
[2021-05-13 23:56:43] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned unsat
FORMULA GPPP-PT-C0010N0000000010-ReachabilityFireability-14 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA GPPP-PT-C0010N0000000010-ReachabilityFireability-06 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA GPPP-PT-C0010N0000000010-ReachabilityFireability-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA GPPP-PT-C0010N0000000010-ReachabilityFireability-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA GPPP-PT-C0010N0000000010-ReachabilityFireability-00 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Support contains 12 out of 33 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 33/33 places, 22/22 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 31 transition count 21
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 30 transition count 20
Applied a total of 5 rules in 35 ms. Remains 30 /33 variables (removed 3) and now considering 20/22 (removed 2) transitions.
// Phase 1: matrix 20 rows 30 cols
[2021-05-13 23:56:43] [INFO ] Computed 11 place invariants in 2 ms
[2021-05-13 23:56:43] [INFO ] Dead Transitions using invariants and state equation in 58 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30/33 places, 20/22 transitions.
Incomplete random walk after 1000001 steps, including 3041 resets, run finished after 809 ms. (steps per millisecond=1236 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 928 ms. (steps per millisecond=1077 ) properties seen :[0]
Interrupted probabilistic random walk after 27912649 steps, run timeout after 30001 ms. (steps per millisecond=930 ) properties seen :[0]
Probabilistic random walk after 27912649 steps, saw 3491639 distinct states, run finished after 30001 ms. (steps per millisecond=930 ) properties seen :[0]
// Phase 1: matrix 20 rows 30 cols
[2021-05-13 23:57:15] [INFO ] Computed 11 place invariants in 2 ms
[2021-05-13 23:57:15] [INFO ] [Real]Absence check using 5 positive place invariants in 6 ms returned sat
[2021-05-13 23:57:15] [INFO ] [Real]Absence check using 5 positive and 6 generalized place invariants in 11 ms returned sat
[2021-05-13 23:57:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 23:57:15] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2021-05-13 23:57:15] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 23:57:15] [INFO ] [Nat]Absence check using 5 positive place invariants in 24 ms returned sat
[2021-05-13 23:57:18] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 23:57:21] [INFO ] [Nat]Absence check using 5 positive and 6 generalized place invariants in 6020 ms returned unknown
Support contains 12 out of 30 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 30/30 places, 20/20 transitions.
Applied a total of 0 rules in 4 ms. Remains 30 /30 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 20/20 transitions.
Starting structural reductions, iteration 0 : 30/30 places, 20/20 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 30 cols
[2021-05-13 23:57:21] [INFO ] Computed 11 place invariants in 2 ms
[2021-05-13 23:57:21] [INFO ] Implicit Places using invariants in 41 ms returned [3, 17]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 45 ms to find 2 implicit places.
[2021-05-13 23:57:21] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 20 rows 28 cols
[2021-05-13 23:57:21] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-13 23:57:21] [INFO ] Dead Transitions using invariants and state equation in 44 ms returned []
Starting structural reductions, iteration 1 : 28/30 places, 20/20 transitions.
Applied a total of 0 rules in 2 ms. Remains 28 /28 variables (removed 0) and now considering 20/20 (removed 0) transitions.
[2021-05-13 23:57:21] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 20 rows 28 cols
[2021-05-13 23:57:21] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-13 23:57:21] [INFO ] Dead Transitions using invariants and state equation in 35 ms returned []
Finished structural reductions, in 2 iterations. Remains : 28/30 places, 20/20 transitions.
Incomplete random walk after 1000009 steps, including 3039 resets, run finished after 691 ms. (steps per millisecond=1447 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 823 ms. (steps per millisecond=1215 ) properties seen :[0]
Interrupted probabilistic random walk after 32519452 steps, run timeout after 30001 ms. (steps per millisecond=1083 ) properties seen :[0]
Probabilistic random walk after 32519452 steps, saw 4058300 distinct states, run finished after 30001 ms. (steps per millisecond=1083 ) properties seen :[0]
// Phase 1: matrix 20 rows 28 cols
[2021-05-13 23:57:53] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-13 23:57:53] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2021-05-13 23:57:53] [INFO ] [Real]Absence check using 5 positive and 4 generalized place invariants in 4 ms returned sat
[2021-05-13 23:57:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 23:57:53] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2021-05-13 23:57:53] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 23:57:53] [INFO ] [Nat]Absence check using 5 positive place invariants in 11 ms returned sat
[2021-05-13 23:57:56] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 23:57:59] [INFO ] [Nat]Absence check using 5 positive and 4 generalized place invariants in 6056 ms returned unknown
Support contains 12 out of 28 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 28/28 places, 20/20 transitions.
Applied a total of 0 rules in 2 ms. Remains 28 /28 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 28/28 places, 20/20 transitions.
Starting structural reductions, iteration 0 : 28/28 places, 20/20 transitions.
Applied a total of 0 rules in 2 ms. Remains 28 /28 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 28 cols
[2021-05-13 23:57:59] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-13 23:57:59] [INFO ] Implicit Places using invariants in 35 ms returned []
// Phase 1: matrix 20 rows 28 cols
[2021-05-13 23:57:59] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-13 23:57:59] [INFO ] Implicit Places using invariants and state equation in 52 ms returned [0, 2]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 89 ms to find 2 implicit places.
[2021-05-13 23:57:59] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 20 rows 26 cols
[2021-05-13 23:57:59] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-13 23:57:59] [INFO ] Dead Transitions using invariants and state equation in 32 ms returned []
Starting structural reductions, iteration 1 : 26/28 places, 20/20 transitions.
Applied a total of 0 rules in 2 ms. Remains 26 /26 variables (removed 0) and now considering 20/20 (removed 0) transitions.
[2021-05-13 23:57:59] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 20 rows 26 cols
[2021-05-13 23:57:59] [INFO ] Computed 7 place invariants in 2 ms
[2021-05-13 23:57:59] [INFO ] Dead Transitions using invariants and state equation in 34 ms returned []
Finished structural reductions, in 2 iterations. Remains : 26/28 places, 20/20 transitions.
Incomplete random walk after 1000005 steps, including 3036 resets, run finished after 582 ms. (steps per millisecond=1718 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 1091 ms. (steps per millisecond=916 ) properties seen :[0]
Interrupted probabilistic random walk after 31686302 steps, run timeout after 30001 ms. (steps per millisecond=1056 ) properties seen :[0]
Probabilistic random walk after 31686302 steps, saw 3957326 distinct states, run finished after 30001 ms. (steps per millisecond=1056 ) properties seen :[0]
// Phase 1: matrix 20 rows 26 cols
[2021-05-13 23:58:31] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-13 23:58:31] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2021-05-13 23:58:31] [INFO ] [Real]Absence check using 3 positive and 4 generalized place invariants in 4 ms returned sat
[2021-05-13 23:58:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 23:58:31] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2021-05-13 23:58:31] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 23:58:31] [INFO ] [Nat]Absence check using 3 positive place invariants in 7 ms returned sat
[2021-05-13 23:58:34] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 23:58:37] [INFO ] [Nat]Absence check using 3 positive and 4 generalized place invariants in 6035 ms returned unknown
Support contains 12 out of 26 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 26/26 places, 20/20 transitions.
Applied a total of 0 rules in 3 ms. Remains 26 /26 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 26/26 places, 20/20 transitions.
Starting structural reductions, iteration 0 : 26/26 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 26 /26 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 26 cols
[2021-05-13 23:58:37] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-13 23:58:37] [INFO ] Implicit Places using invariants in 34 ms returned []
// Phase 1: matrix 20 rows 26 cols
[2021-05-13 23:58:37] [INFO ] Computed 7 place invariants in 4 ms
[2021-05-13 23:58:37] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
[2021-05-13 23:58:37] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 20 rows 26 cols
[2021-05-13 23:58:37] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-13 23:58:37] [INFO ] Dead Transitions using invariants and state equation in 39 ms returned []
Finished structural reductions, in 1 iterations. Remains : 26/26 places, 20/20 transitions.
Incomplete random walk after 100001 steps, including 306 resets, run finished after 44 ms. (steps per millisecond=2272 ) properties seen :[0]
// Phase 1: matrix 20 rows 26 cols
[2021-05-13 23:58:37] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-13 23:58:37] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned sat
[2021-05-13 23:58:37] [INFO ] [Real]Absence check using 3 positive and 4 generalized place invariants in 3 ms returned sat
[2021-05-13 23:58:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 23:58:37] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2021-05-13 23:58:37] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 23:58:37] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2021-05-13 23:58:40] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 23:58:43] [INFO ] [Nat]Absence check using 3 positive and 4 generalized place invariants in 6005 ms returned unknown
Applied a total of 0 rules in 2 ms. Remains 26 /26 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 26 cols
[2021-05-13 23:58:43] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-13 23:58:43] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2021-05-13 23:58:43] [INFO ] [Real]Absence check using 3 positive and 4 generalized place invariants in 3 ms returned sat
[2021-05-13 23:58:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 23:58:43] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2021-05-13 23:58:43] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 23:58:43] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2021-05-13 23:58:46] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 23:58:49] [INFO ] [Nat]Absence check using 3 positive and 4 generalized place invariants in 6014 ms returned unknown
[2021-05-13 23:58:49] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 3 ms.
[2021-05-13 23:58:49] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 1 ms.
[2021-05-13 23:58:49] [INFO ] Flatten gal took : 32 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityFireability @ GPPP-PT-C0010N0000000010 @ 3570 seconds
vrfy: finished
info: timeLeft: 3564
rslt: Output for ReachabilityFireability @ GPPP-PT-C0010N0000000010

{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"localtimelimit": 0,
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=ReachabilityFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--json=ReachabilityFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Thu May 13 23:58:50 2021
",
"timelimit": 3570
},
"child": null,
"exit":
{
"error": null,
"localtimelimitreached": true,
"memory": 18144,
"runtime": 6.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityFireability.xml",
"net": "model.pnml"
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 4,
"aneg": 0,
"comp": 11,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 11,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 11,
"visible_transitions": 0
},
"processed": "A (G (((p15 <= 0) OR ((1 <= p0) AND (1 <= p9) AND ((p3 <= 0) OR (p22 <= 19)) AND ((p1 <= 1) OR (p10 <= 0) OR (p21 <= 0))) OR (((p6 <= 0) OR (p7 <= 0) OR (p24 <= 69))))))",
"processed_size": 176,
"rewrites": 2,
"skeleton": "A(G(**))"
},
"net":
{
"arcs": 66,
"conflict_clusters": 13,
"places": 26,
"places_significant": 19,
"singleton_clusters": 0,
"transitions": 20
},
"task":
{
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 23,
"problems": 4
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 46/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 832
lola: finding significant places
lola: 26 places, 20 transitions, 19 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from ReachabilityFireability.xml
lola: LP says that atomic proposition is always false: (70 <= p0)
lola: LP says that atomic proposition is always false: (70 <= p18)
lola: A (G (((p15 <= 0) OR ((1 <= p0) AND (1 <= p9) AND ((p3 <= 0) OR (p22 <= 19)) AND ((p1 <= 1) OR (p10 <= 0) OR (p21 <= 0))) OR (((p6 <= 0) OR (p7 <= 0) OR (p24 <= 69))))))
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G (((p15 <= 0) OR ((1 <= p0) AND (1 <= p9) AND ((p3 <= 0) OR (p22 <= 19)) AND ((p1 <= 1) OR (p10 <= 0) OR (p21 <= 0))) OR (((p6 <= 0) OR (p7 <= 0) OR (p24 <= 69))))))
lola: processed formula length: 176
lola: 2 rewrites
lola: closed formula file ReachabilityFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: subprocess will run for 0 seconds at most (--localtimelimit)
lola: state equation task get result started, id 0
lola: local time limit reached - aborting
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p15) AND ((p0 <= 0) OR (p9 <= 0) OR ((1 <= p3) AND (20 <= p22)) OR ((2 <= p1) AND (1 <= p10) AND (1 <= p21))) AND (((1 <= p6) AND (1 <= p7) AND (70 <= p24))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 23 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityFireability-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityFireability-0.sara.
lola: memory consumption: 18144 KB
lola: time consumption: 6 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityFireability.json
lola: closed JSON file ReachabilityFireability.json
rslt: finished

--------------------
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="GPPP-PT-C0010N0000000010"
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 GPPP-PT-C0010N0000000010, 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 r113-smll-162075355700108"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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