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-162075355700111.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-C0010N0000000100, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r113-smll-162075355700111
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 424K
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 108K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 21K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 120K 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.2K Mar 28 16:13 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 28 16:13 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 28 16:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 28 16:13 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 3.7K Mar 22 19:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K 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-C0010N0000000100-ReachabilityCardinality-00
FORMULA_NAME GPPP-PT-C0010N0000000100-ReachabilityCardinality-01
FORMULA_NAME GPPP-PT-C0010N0000000100-ReachabilityCardinality-02
FORMULA_NAME GPPP-PT-C0010N0000000100-ReachabilityCardinality-03
FORMULA_NAME GPPP-PT-C0010N0000000100-ReachabilityCardinality-04
FORMULA_NAME GPPP-PT-C0010N0000000100-ReachabilityCardinality-05
FORMULA_NAME GPPP-PT-C0010N0000000100-ReachabilityCardinality-06
FORMULA_NAME GPPP-PT-C0010N0000000100-ReachabilityCardinality-07
FORMULA_NAME GPPP-PT-C0010N0000000100-ReachabilityCardinality-08
FORMULA_NAME GPPP-PT-C0010N0000000100-ReachabilityCardinality-09
FORMULA_NAME GPPP-PT-C0010N0000000100-ReachabilityCardinality-10
FORMULA_NAME GPPP-PT-C0010N0000000100-ReachabilityCardinality-11
FORMULA_NAME GPPP-PT-C0010N0000000100-ReachabilityCardinality-12
FORMULA_NAME GPPP-PT-C0010N0000000100-ReachabilityCardinality-13
FORMULA_NAME GPPP-PT-C0010N0000000100-ReachabilityCardinality-14
FORMULA_NAME GPPP-PT-C0010N0000000100-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1620950420520

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-14 00:00:23] [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 00:00:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-14 00:00:24] [INFO ] Load time of PNML (sax parser for PT used): 61 ms
[2021-05-14 00:00:24] [INFO ] Transformed 33 places.
[2021-05-14 00:00:24] [INFO ] Transformed 22 transitions.
[2021-05-14 00:00:24] [INFO ] Parsed PT model containing 33 places and 22 transitions in 139 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 28 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 24 resets, run finished after 50 ms. (steps per millisecond=200 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 1, 0, 0, 0, 0]
FORMULA GPPP-PT-C0010N0000000100-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPPP-PT-C0010N0000000100-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPPP-PT-C0010N0000000100-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPPP-PT-C0010N0000000100-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 36 ms. (steps per millisecond=277 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 52 ms. (steps per millisecond=192 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 27 ms. (steps per millisecond=370 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 29 ms. (steps per millisecond=344 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 35 ms. (steps per millisecond=285 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 29 ms. (steps per millisecond=344 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 42 ms. (steps per millisecond=238 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 26 ms. (steps per millisecond=384 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 12 ms. (steps per millisecond=833 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 13 ms. (steps per millisecond=769 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 22 rows 33 cols
[2021-05-14 00:00:24] [INFO ] Computed 12 place invariants in 6 ms
[2021-05-14 00:00:24] [INFO ] [Real]Absence check using 6 positive place invariants in 22 ms returned sat
[2021-05-14 00:00:24] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 4 ms returned unsat
[2021-05-14 00:00:24] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned sat
[2021-05-14 00:00:24] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 4 ms returned sat
[2021-05-14 00:00:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 00:00:24] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2021-05-14 00:00:24] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 00:00:24] [INFO ] [Nat]Absence check using 6 positive place invariants in 12 ms returned sat
[2021-05-14 00:00:29] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-14 00:00:29] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 4969 ms returned unknown
[2021-05-14 00:00:29] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2021-05-14 00:00:29] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 3 ms returned unsat
[2021-05-14 00:00:29] [INFO ] [Real]Absence check using 6 positive place invariants in 9 ms returned sat
[2021-05-14 00:00:29] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 5 ms returned sat
[2021-05-14 00:00:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 00:00:29] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2021-05-14 00:00:29] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 00:00:29] [INFO ] [Nat]Absence check using 6 positive place invariants in 6 ms returned sat
[2021-05-14 00:00:29] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 4 ms returned sat
[2021-05-14 00:00:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 00:00:30] [INFO ] [Nat]Absence check using state equation in 310 ms returned unsat
[2021-05-14 00:00:30] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2021-05-14 00:00:30] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 4 ms returned sat
[2021-05-14 00:00:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 00:00:30] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2021-05-14 00:00:30] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 00:00:30] [INFO ] [Nat]Absence check using 6 positive place invariants in 6 ms returned sat
[2021-05-14 00:00:30] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 4 ms returned sat
[2021-05-14 00:00:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 00:00:30] [INFO ] [Nat]Absence check using state equation in 211 ms returned unsat
[2021-05-14 00:00:30] [INFO ] [Real]Absence check using 6 positive place invariants in 7 ms returned sat
[2021-05-14 00:00:30] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 5 ms returned sat
[2021-05-14 00:00:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 00:00:30] [INFO ] [Real]Absence check using state equation in 35 ms returned unsat
[2021-05-14 00:00:30] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2021-05-14 00:00:30] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 4 ms returned unsat
[2021-05-14 00:00:30] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned unsat
[2021-05-14 00:00:30] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned sat
[2021-05-14 00:00:30] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 4 ms returned sat
[2021-05-14 00:00:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 00:00:30] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2021-05-14 00:00:30] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 00:00:30] [INFO ] [Nat]Absence check using 6 positive place invariants in 9 ms returned sat
[2021-05-14 00:00:30] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 5 ms returned sat
[2021-05-14 00:00:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 00:00:30] [INFO ] [Nat]Absence check using state equation in 180 ms returned unsat
[2021-05-14 00:00:30] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2021-05-14 00:00:30] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 4 ms returned sat
[2021-05-14 00:00:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 00:00:30] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2021-05-14 00:00:30] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 00:00:31] [INFO ] [Nat]Absence check using 6 positive place invariants in 6 ms returned sat
[2021-05-14 00:00:31] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 4 ms returned sat
[2021-05-14 00:00:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 00:00:31] [INFO ] [Nat]Absence check using state equation in 89 ms returned unsat
[2021-05-14 00:00:31] [INFO ] [Real]Absence check using 6 positive place invariants in 7 ms returned sat
[2021-05-14 00:00:31] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 4 ms returned unsat
[2021-05-14 00:00:31] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned unsat
FORMULA GPPP-PT-C0010N0000000100-ReachabilityCardinality-15 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA GPPP-PT-C0010N0000000100-ReachabilityCardinality-14 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA GPPP-PT-C0010N0000000100-ReachabilityCardinality-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA GPPP-PT-C0010N0000000100-ReachabilityCardinality-12 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA GPPP-PT-C0010N0000000100-ReachabilityCardinality-08 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA GPPP-PT-C0010N0000000100-ReachabilityCardinality-06 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA GPPP-PT-C0010N0000000100-ReachabilityCardinality-05 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA GPPP-PT-C0010N0000000100-ReachabilityCardinality-04 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA GPPP-PT-C0010N0000000100-ReachabilityCardinality-03 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA GPPP-PT-C0010N0000000100-ReachabilityCardinality-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA GPPP-PT-C0010N0000000100-ReachabilityCardinality-00 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Support contains 8 out of 33 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 33/33 places, 22/22 transitions.
Graph (trivial) has 2 edges and 33 vertex of which 2 / 33 are part of one of the 1 SCC in 10 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 32 transition count 20
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 1 with 2 rules applied. Total rules applied 5 place count 31 transition count 19
Applied a total of 5 rules in 53 ms. Remains 31 /33 variables (removed 2) and now considering 19/22 (removed 3) transitions.
// Phase 1: matrix 19 rows 31 cols
[2021-05-14 00:00:31] [INFO ] Computed 12 place invariants in 3 ms
[2021-05-14 00:00:31] [INFO ] Dead Transitions using invariants and state equation in 48 ms returned []
Finished structural reductions, in 1 iterations. Remains : 31/33 places, 19/22 transitions.
Incomplete random walk after 1000004 steps, including 2781 resets, run finished after 696 ms. (steps per millisecond=1436 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 539 resets, run finished after 846 ms. (steps per millisecond=1182 ) properties seen :[0]
Interrupted probabilistic random walk after 28413561 steps, run timeout after 30001 ms. (steps per millisecond=947 ) properties seen :[0]
Probabilistic random walk after 28413561 steps, saw 3958928 distinct states, run finished after 30001 ms. (steps per millisecond=947 ) properties seen :[0]
// Phase 1: matrix 19 rows 31 cols
[2021-05-14 00:01:02] [INFO ] Computed 12 place invariants in 5 ms
[2021-05-14 00:01:02] [INFO ] [Real]Absence check using 6 positive place invariants in 7 ms returned sat
[2021-05-14 00:01:02] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 4 ms returned sat
[2021-05-14 00:01:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 00:01:02] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2021-05-14 00:01:02] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 00:01:02] [INFO ] [Nat]Absence check using 6 positive place invariants in 7 ms returned sat
[2021-05-14 00:01:05] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-14 00:01:08] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 6025 ms returned unknown
Support contains 8 out of 31 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 31/31 places, 19/19 transitions.
Applied a total of 0 rules in 3 ms. Remains 31 /31 variables (removed 0) and now considering 19/19 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 31/31 places, 19/19 transitions.
Starting structural reductions, iteration 0 : 31/31 places, 19/19 transitions.
Applied a total of 0 rules in 2 ms. Remains 31 /31 variables (removed 0) and now considering 19/19 (removed 0) transitions.
// Phase 1: matrix 19 rows 31 cols
[2021-05-14 00:01:08] [INFO ] Computed 12 place invariants in 2 ms
[2021-05-14 00:01:08] [INFO ] Implicit Places using invariants in 62 ms returned [1, 2, 3, 17]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 67 ms to find 4 implicit places.
[2021-05-14 00:01:08] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 19 rows 27 cols
[2021-05-14 00:01:09] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-14 00:01:09] [INFO ] Dead Transitions using invariants and state equation in 41 ms returned []
Starting structural reductions, iteration 1 : 27/31 places, 19/19 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 27 transition count 18
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 26 transition count 18
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 26 transition count 17
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 25 transition count 17
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 2 with 2 rules applied. Total rules applied 6 place count 24 transition count 16
Applied a total of 6 rules in 8 ms. Remains 24 /27 variables (removed 3) and now considering 16/19 (removed 3) transitions.
// Phase 1: matrix 16 rows 24 cols
[2021-05-14 00:01:09] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-14 00:01:09] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 16 rows 24 cols
[2021-05-14 00:01:09] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-14 00:01:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-14 00:01:09] [INFO ] Implicit Places using invariants and state equation in 46 ms returned [1, 3]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 86 ms to find 2 implicit places.
Starting structural reductions, iteration 2 : 22/31 places, 16/19 transitions.
Applied a total of 0 rules in 2 ms. Remains 22 /22 variables (removed 0) and now considering 16/16 (removed 0) transitions.
[2021-05-14 00:01:09] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 16 rows 22 cols
[2021-05-14 00:01:09] [INFO ] Computed 6 place invariants in 2 ms
[2021-05-14 00:01:09] [INFO ] Dead Transitions using invariants and state equation in 28 ms returned []
Finished structural reductions, in 3 iterations. Remains : 22/31 places, 16/19 transitions.
Incomplete random walk after 1000015 steps, including 3324 resets, run finished after 578 ms. (steps per millisecond=1730 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 699 resets, run finished after 572 ms. (steps per millisecond=1748 ) properties seen :[0]
Interrupted probabilistic random walk after 38117864 steps, run timeout after 30001 ms. (steps per millisecond=1270 ) properties seen :[0]
Probabilistic random walk after 38117864 steps, saw 5958877 distinct states, run finished after 30003 ms. (steps per millisecond=1270 ) properties seen :[0]
// Phase 1: matrix 16 rows 22 cols
[2021-05-14 00:01:40] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-14 00:01:40] [INFO ] [Real]Absence check using 4 positive place invariants in 7 ms returned sat
[2021-05-14 00:01:40] [INFO ] [Real]Absence check using 4 positive and 2 generalized place invariants in 3 ms returned sat
[2021-05-14 00:01:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 00:01:40] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2021-05-14 00:01:40] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 00:01:40] [INFO ] [Nat]Absence check using 4 positive place invariants in 5 ms returned sat
[2021-05-14 00:01:42] [INFO ] [Nat]Absence check using 4 positive and 2 generalized place invariants in 1805 ms returned sat
[2021-05-14 00:01:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 00:01:48] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-14 00:01:51] [INFO ] [Nat]Absence check using state equation in 9015 ms returned unknown
Support contains 8 out of 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 16/16 transitions.
Applied a total of 0 rules in 2 ms. Remains 22 /22 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 16/16 transitions.
Starting structural reductions, iteration 0 : 22/22 places, 16/16 transitions.
Applied a total of 0 rules in 3 ms. Remains 22 /22 variables (removed 0) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 22 cols
[2021-05-14 00:01:51] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-14 00:01:51] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 16 rows 22 cols
[2021-05-14 00:01:51] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-14 00:01:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-14 00:01:51] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
[2021-05-14 00:01:51] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 16 rows 22 cols
[2021-05-14 00:01:51] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-14 00:01:51] [INFO ] Dead Transitions using invariants and state equation in 37 ms returned []
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 16/16 transitions.
Incomplete random walk after 100001 steps, including 332 resets, run finished after 31 ms. (steps per millisecond=3225 ) properties seen :[0]
// Phase 1: matrix 16 rows 22 cols
[2021-05-14 00:01:51] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-14 00:01:51] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2021-05-14 00:01:51] [INFO ] [Real]Absence check using 4 positive and 2 generalized place invariants in 2 ms returned sat
[2021-05-14 00:01:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 00:01:51] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2021-05-14 00:01:51] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 00:01:51] [INFO ] [Nat]Absence check using 4 positive place invariants in 6 ms returned sat
[2021-05-14 00:01:53] [INFO ] [Nat]Absence check using 4 positive and 2 generalized place invariants in 2022 ms returned sat
[2021-05-14 00:01:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 00:01:59] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-14 00:02:02] [INFO ] [Nat]Absence check using state equation in 9022 ms returned unknown
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 22 cols
[2021-05-14 00:02:02] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-14 00:02:02] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2021-05-14 00:02:02] [INFO ] [Real]Absence check using 4 positive and 2 generalized place invariants in 2 ms returned sat
[2021-05-14 00:02:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 00:02:02] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2021-05-14 00:02:02] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 00:02:02] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2021-05-14 00:02:04] [INFO ] [Nat]Absence check using 4 positive and 2 generalized place invariants in 1951 ms returned sat
[2021-05-14 00:02:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 00:02:10] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-14 00:02:13] [INFO ] [Nat]Absence check using state equation in 9023 ms returned unknown
[2021-05-14 00:02:13] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 3 ms.
[2021-05-14 00:02:13] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 1 ms.
[2021-05-14 00:02:13] [INFO ] Flatten gal took : 31 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityCardinality @ GPPP-PT-C0010N0000000100 @ 3570 seconds
vrfy: finished
info: timeLeft: 3565
rslt: Output for ReachabilityCardinality @ GPPP-PT-C0010N0000000100

{
"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=ReachabilityCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--json=ReachabilityCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Fri May 14 00:02:15 2021
",
"timelimit": 3570
},
"child": null,
"exit":
{
"error": null,
"localtimelimitreached": true,
"memory": 20776,
"runtime": 4.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "E (F (((p19 + 1 <= p12) AND (p4 + 1 <= p2) AND (p6 + 1 <= p10) AND (p18 <= p19) AND (2 <= p0))))",
"processed_size": 96,
"rewrites": 1,
"skeleton": "E(F(**))"
},
"net":
{
"arcs": 51,
"conflict_clusters": 12,
"places": 22,
"places_significant": 16,
"singleton_clusters": 0,
"transitions": 16
},
"task":
{
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 5,
"problems": 5
},
"type": "reachability",
"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: 38/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 704
lola: finding significant places
lola: 22 places, 16 transitions, 16 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 ReachabilityCardinality.xml
lola: E (F (((p19 + 1 <= p12) AND (p4 + 1 <= p2) AND (p6 + 1 <= p10) AND (p18 <= p19) AND (2 <= p0))))
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((p19 + 1 <= p12) AND (p4 + 1 <= p2) AND (p6 + 1 <= p10) AND (p18 <= p19) AND (2 <= p0))))
lola: processed formula length: 96
lola: 1 rewrites
lola: closed formula file ReachabilityCardinality.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: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p19 + 1 <= p12) AND (p4 + 1 <= p2) AND (p6 + 1 <= p10) AND (p18 <= p19) AND (2 <= p0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 5 literals and 1 conjunctive subformulas
lola: local time limit reached - aborting
lola: state equation: write sara problem file to ReachabilityCardinality-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-0.sara.
lola: memory consumption: 20776 KB
lola: time consumption: 4 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityCardinality.json
lola: closed JSON file ReachabilityCardinality.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-C0010N0000000100"
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 GPPP-PT-C0010N0000000100, 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 r113-smll-162075355700111"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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