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.r303-tall-162124171300175.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 HealthRecord-PT-12, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r303-tall-162124171300175
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 364K
-rw-r--r-- 1 mcc users 9.0K May 15 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K May 15 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.4K May 15 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 75K May 15 08:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K May 12 07:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 12 07:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 12 07:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 12 07:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 08:13 NewModel
-rw-r--r-- 1 mcc users 3.0K May 11 18:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K May 11 18:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 11 15:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K May 11 15:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.3K May 12 04:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.4K May 12 04:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 08:13 equiv_col
-rw-r--r-- 1 mcc users 3 May 12 08:13 instance
-rw-r--r-- 1 mcc users 6 May 12 08:13 iscolored
-rw-r--r-- 1 mcc users 51K May 12 08:13 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 net-ReachabilityCardinality-00
FORMULA_NAME net-ReachabilityCardinality-01
FORMULA_NAME net-ReachabilityCardinality-02
FORMULA_NAME net-ReachabilityCardinality-03
FORMULA_NAME net-ReachabilityCardinality-04
FORMULA_NAME net-ReachabilityCardinality-05
FORMULA_NAME net-ReachabilityCardinality-06
FORMULA_NAME net-ReachabilityCardinality-07
FORMULA_NAME net-ReachabilityCardinality-08
FORMULA_NAME net-ReachabilityCardinality-09
FORMULA_NAME net-ReachabilityCardinality-10
FORMULA_NAME net-ReachabilityCardinality-11
FORMULA_NAME net-ReachabilityCardinality-12
FORMULA_NAME net-ReachabilityCardinality-13
FORMULA_NAME net-ReachabilityCardinality-14
FORMULA_NAME net-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1621341908158

[2021-05-18 12:45:10] [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, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-18 12:45:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-18 12:45:10] [INFO ] Load time of PNML (sax parser for PT used): 51 ms
[2021-05-18 12:45:10] [INFO ] Transformed 160 places.
[2021-05-18 12:45:10] [INFO ] Transformed 340 transitions.
[2021-05-18 12:45:10] [INFO ] Found NUPN structural information;
[2021-05-18 12:45:10] [INFO ] Parsed PT model containing 160 places and 340 transitions in 95 ms.
Ensure Unique test removed 28 transitions
Reduce redundant transitions removed 28 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 19 ms.
Working with output stream class java.io.PrintStream
FORMULA net-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA net-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA net-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA net-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 720 resets, run finished after 85 ms. (steps per millisecond=117 ) properties seen :[0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0]
FORMULA net-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 94 resets, run finished after 11 ms. (steps per millisecond=909 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 87 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties seen :[0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0]
FORMULA net-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 91 resets, run finished after 18 ms. (steps per millisecond=555 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 90 resets, run finished after 14 ms. (steps per millisecond=714 ) properties seen :[0, 0, 1, 0, 0, 0, 0, 0, 0, 0]
FORMULA net-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 95 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 92 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 89 resets, run finished after 13 ms. (steps per millisecond=769 ) properties seen :[0, 0, 0, 0, 1, 0, 0, 0, 0]
FORMULA net-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 91 resets, run finished after 16 ms. (steps per millisecond=625 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 88 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 91 resets, run finished after 11 ms. (steps per millisecond=909 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 91 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
[2021-05-18 12:45:11] [INFO ] Flow matrix only has 300 transitions (discarded 12 similar events)
// Phase 1: matrix 300 rows 160 cols
[2021-05-18 12:45:11] [INFO ] Computed 18 place invariants in 10 ms
[2021-05-18 12:45:11] [INFO ] [Real]Absence check using 10 positive place invariants in 19 ms returned sat
[2021-05-18 12:45:11] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-18 12:45:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:45:11] [INFO ] [Real]Absence check using state equation in 150 ms returned sat
[2021-05-18 12:45:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-18 12:45:11] [INFO ] [Real]Added 1 Read/Feed constraints in 4 ms returned sat
[2021-05-18 12:45:11] [INFO ] Computed and/alt/rep : 311/2449/299 causal constraints in 26 ms.
[2021-05-18 12:45:11] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:45:11] [INFO ] [Nat]Absence check using 10 positive place invariants in 57 ms returned sat
[2021-05-18 12:45:11] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 6 ms returned sat
[2021-05-18 12:45:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:45:11] [INFO ] [Nat]Absence check using state equation in 124 ms returned sat
[2021-05-18 12:45:11] [INFO ] [Nat]Added 1 Read/Feed constraints in 5 ms returned sat
[2021-05-18 12:45:11] [INFO ] Computed and/alt/rep : 311/2449/299 causal constraints in 32 ms.
[2021-05-18 12:45:13] [INFO ] Added : 166 causal constraints over 34 iterations in 1636 ms. Result :sat
[2021-05-18 12:45:13] [INFO ] Deduced a trap composed of 30 places in 59 ms
[2021-05-18 12:45:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 159 ms
Attempting to minimize the solution found.
Minimization took 34 ms.
[2021-05-18 12:45:13] [INFO ] [Real]Absence check using 10 positive place invariants in 30 ms returned sat
[2021-05-18 12:45:13] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 17 ms returned sat
[2021-05-18 12:45:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:45:14] [INFO ] [Real]Absence check using state equation in 155 ms returned sat
[2021-05-18 12:45:14] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:45:14] [INFO ] [Nat]Absence check using 10 positive place invariants in 54 ms returned sat
[2021-05-18 12:45:14] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 10 ms returned sat
[2021-05-18 12:45:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:45:14] [INFO ] [Nat]Absence check using state equation in 137 ms returned sat
[2021-05-18 12:45:14] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2021-05-18 12:45:14] [INFO ] Deduced a trap composed of 39 places in 51 ms
[2021-05-18 12:45:14] [INFO ] Deduced a trap composed of 24 places in 43 ms
[2021-05-18 12:45:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 128 ms
[2021-05-18 12:45:14] [INFO ] Computed and/alt/rep : 311/2449/299 causal constraints in 22 ms.
[2021-05-18 12:45:16] [INFO ] Added : 174 causal constraints over 36 iterations in 2192 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 34 ms.
[2021-05-18 12:45:16] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned unsat
[2021-05-18 12:45:16] [INFO ] [Real]Absence check using 10 positive place invariants in 15 ms returned sat
[2021-05-18 12:45:16] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-18 12:45:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:45:16] [INFO ] [Real]Absence check using state equation in 128 ms returned sat
[2021-05-18 12:45:16] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:45:16] [INFO ] Deduced a trap composed of 30 places in 27 ms
[2021-05-18 12:45:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 48 ms
[2021-05-18 12:45:16] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:45:17] [INFO ] [Nat]Absence check using 10 positive place invariants in 50 ms returned sat
[2021-05-18 12:45:17] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-18 12:45:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:45:17] [INFO ] [Nat]Absence check using state equation in 119 ms returned sat
[2021-05-18 12:45:17] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2021-05-18 12:45:17] [INFO ] Computed and/alt/rep : 311/2449/299 causal constraints in 18 ms.
[2021-05-18 12:45:18] [INFO ] Added : 161 causal constraints over 33 iterations in 965 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 24 ms.
[2021-05-18 12:45:18] [INFO ] [Real]Absence check using 10 positive place invariants in 27 ms returned sat
[2021-05-18 12:45:18] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 11 ms returned sat
[2021-05-18 12:45:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:45:18] [INFO ] [Real]Absence check using state equation in 140 ms returned sat
[2021-05-18 12:45:18] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:45:18] [INFO ] [Nat]Absence check using 10 positive place invariants in 49 ms returned sat
[2021-05-18 12:45:18] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 11 ms returned sat
[2021-05-18 12:45:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:45:18] [INFO ] [Nat]Absence check using state equation in 155 ms returned sat
[2021-05-18 12:45:18] [INFO ] [Nat]Added 1 Read/Feed constraints in 6 ms returned sat
[2021-05-18 12:45:18] [INFO ] Deduced a trap composed of 39 places in 55 ms
[2021-05-18 12:45:18] [INFO ] Deduced a trap composed of 38 places in 55 ms
[2021-05-18 12:45:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 152 ms
[2021-05-18 12:45:18] [INFO ] Computed and/alt/rep : 311/2449/299 causal constraints in 38 ms.
[2021-05-18 12:45:19] [INFO ] Added : 159 causal constraints over 32 iterations in 1174 ms. Result :sat
[2021-05-18 12:45:20] [INFO ] Deduced a trap composed of 29 places in 60 ms
[2021-05-18 12:45:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 124 ms
Attempting to minimize the solution found.
Minimization took 27 ms.
[2021-05-18 12:45:20] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2021-05-18 12:45:20] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-18 12:45:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:45:20] [INFO ] [Real]Absence check using state equation in 120 ms returned sat
[2021-05-18 12:45:20] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:45:20] [INFO ] Computed and/alt/rep : 311/2449/299 causal constraints in 20 ms.
[2021-05-18 12:45:20] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:45:20] [INFO ] [Nat]Absence check using 10 positive place invariants in 49 ms returned sat
[2021-05-18 12:45:20] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-18 12:45:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:45:20] [INFO ] [Nat]Absence check using state equation in 122 ms returned sat
[2021-05-18 12:45:20] [INFO ] [Nat]Added 1 Read/Feed constraints in 5 ms returned sat
[2021-05-18 12:45:20] [INFO ] Computed and/alt/rep : 311/2449/299 causal constraints in 19 ms.
[2021-05-18 12:45:21] [INFO ] Added : 146 causal constraints over 30 iterations in 553 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 13 ms.
[2021-05-18 12:45:21] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2021-05-18 12:45:21] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-18 12:45:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:45:21] [INFO ] [Real]Absence check using state equation in 130 ms returned sat
[2021-05-18 12:45:21] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:45:21] [INFO ] [Nat]Absence check using 10 positive place invariants in 30 ms returned sat
[2021-05-18 12:45:21] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-18 12:45:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:45:21] [INFO ] [Nat]Absence check using state equation in 118 ms returned sat
[2021-05-18 12:45:21] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2021-05-18 12:45:21] [INFO ] Computed and/alt/rep : 311/2449/299 causal constraints in 20 ms.
[2021-05-18 12:45:22] [INFO ] Added : 162 causal constraints over 33 iterations in 1009 ms. Result :sat
[2021-05-18 12:45:22] [INFO ] Deduced a trap composed of 29 places in 36 ms
[2021-05-18 12:45:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 78 ms
Attempting to minimize the solution found.
Minimization took 25 ms.
[2021-05-18 12:45:22] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2021-05-18 12:45:22] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-18 12:45:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:45:22] [INFO ] [Real]Absence check using state equation in 121 ms returned sat
[2021-05-18 12:45:22] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:45:22] [INFO ] Computed and/alt/rep : 311/2449/299 causal constraints in 16 ms.
[2021-05-18 12:45:23] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:45:23] [INFO ] [Nat]Absence check using 10 positive place invariants in 55 ms returned sat
[2021-05-18 12:45:23] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-18 12:45:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:45:23] [INFO ] [Nat]Absence check using state equation in 115 ms returned sat
[2021-05-18 12:45:23] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2021-05-18 12:45:23] [INFO ] Computed and/alt/rep : 311/2449/299 causal constraints in 18 ms.
[2021-05-18 12:45:25] [INFO ] Added : 192 causal constraints over 40 iterations in 1908 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 39 ms.
FORMULA net-ReachabilityCardinality-07 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 22200 steps, including 935 resets, run finished after 109 ms. (steps per millisecond=203 ) properties seen :[1, 1, 1, 0, 0, 0, 0] could not realise parikh vector
FORMULA net-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA net-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA net-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 20500 steps, including 985 resets, run finished after 84 ms. (steps per millisecond=244 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 11800 steps, including 270 resets, run finished after 35 ms. (steps per millisecond=337 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 24500 steps, including 1000 resets, run finished after 68 ms. (steps per millisecond=360 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 20000 steps, including 807 resets, run finished after 58 ms. (steps per millisecond=344 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 17800 steps, including 647 resets, run finished after 53 ms. (steps per millisecond=335 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 19800 steps, including 745 resets, run finished after 58 ms. (steps per millisecond=341 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Support contains 15 out of 160 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 160/160 places, 312/312 transitions.
Graph (trivial) has 204 edges and 160 vertex of which 8 / 160 are part of one of the 4 SCC in 4 ms
Free SCC test removed 4 places
Discarding 9 places :
Also discarding 9 output transitions
Drop transitions removed 9 transitions
Graph (complete) has 678 edges and 156 vertex of which 147 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.6 ms
Drop transitions removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 0 with 16 rules applied. Total rules applied 18 place count 147 transition count 287
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 26 place count 143 transition count 283
Symmetric choice reduction at 2 with 75 rule applications. Total rules 101 place count 143 transition count 283
Deduced a syphon composed of 75 places in 1 ms
Reduce places removed 75 places and 150 transitions.
Iterating global reduction 2 with 150 rules applied. Total rules applied 251 place count 68 transition count 133
Symmetric choice reduction at 2 with 8 rule applications. Total rules 259 place count 68 transition count 133
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 16 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 275 place count 60 transition count 117
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 284 place count 60 transition count 108
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 3 with 2 rules applied. Total rules applied 286 place count 59 transition count 107
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -31
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 296 place count 54 transition count 138
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 297 place count 54 transition count 137
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 298 place count 53 transition count 137
Partial Post-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 302 place count 53 transition count 137
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 303 place count 53 transition count 136
Partial Free-agglomeration rule applied 14 times.
Drop transitions removed 14 transitions
Iterating global reduction 4 with 14 rules applied. Total rules applied 317 place count 53 transition count 136
Applied a total of 317 rules in 56 ms. Remains 53 /160 variables (removed 107) and now considering 136/312 (removed 176) transitions.
Finished structural reductions, in 1 iterations. Remains : 53/160 places, 136/312 transitions.
Incomplete random walk after 1000000 steps, including 111502 resets, run finished after 2318 ms. (steps per millisecond=431 ) properties seen :[0, 1, 0, 0]
FORMULA net-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 16127 resets, run finished after 718 ms. (steps per millisecond=1392 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 15918 resets, run finished after 675 ms. (steps per millisecond=1481 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 15936 resets, run finished after 540 ms. (steps per millisecond=1851 ) properties seen :[0, 0, 0]
[2021-05-18 12:45:29] [INFO ] Flow matrix only has 129 transitions (discarded 7 similar events)
// Phase 1: matrix 129 rows 53 cols
[2021-05-18 12:45:29] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-18 12:45:30] [INFO ] [Real]Absence check using 9 positive place invariants in 4 ms returned sat
[2021-05-18 12:45:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:45:30] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2021-05-18 12:45:30] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:45:30] [INFO ] [Nat]Absence check using 9 positive place invariants in 8 ms returned sat
[2021-05-18 12:45:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:45:30] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2021-05-18 12:45:30] [INFO ] State equation strengthened by 18 read => feed constraints.
[2021-05-18 12:45:30] [INFO ] [Nat]Added 18 Read/Feed constraints in 4 ms returned sat
[2021-05-18 12:45:30] [INFO ] Deduced a trap composed of 19 places in 41 ms
[2021-05-18 12:45:30] [INFO ] Deduced a trap composed of 20 places in 24 ms
[2021-05-18 12:45:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 77 ms
[2021-05-18 12:45:30] [INFO ] Computed and/alt/rep : 120/2572/113 causal constraints in 8 ms.
[2021-05-18 12:45:30] [INFO ] Added : 60 causal constraints over 12 iterations in 161 ms. Result :sat
[2021-05-18 12:45:30] [INFO ] Deduced a trap composed of 23 places in 29 ms
[2021-05-18 12:45:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 45 ms
Attempting to minimize the solution found.
Minimization took 7 ms.
[2021-05-18 12:45:30] [INFO ] [Real]Absence check using 9 positive place invariants in 4 ms returned sat
[2021-05-18 12:45:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:45:30] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2021-05-18 12:45:30] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:45:30] [INFO ] [Nat]Absence check using 9 positive place invariants in 8 ms returned sat
[2021-05-18 12:45:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:45:30] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2021-05-18 12:45:30] [INFO ] [Nat]Added 18 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:45:30] [INFO ] Computed and/alt/rep : 120/2572/113 causal constraints in 10 ms.
[2021-05-18 12:45:30] [INFO ] Added : 51 causal constraints over 11 iterations in 150 ms. Result :sat
[2021-05-18 12:45:30] [INFO ] Deduced a trap composed of 17 places in 28 ms
[2021-05-18 12:45:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 42 ms
Attempting to minimize the solution found.
Minimization took 6 ms.
[2021-05-18 12:45:30] [INFO ] [Real]Absence check using 9 positive place invariants in 4 ms returned sat
[2021-05-18 12:45:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:45:30] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2021-05-18 12:45:30] [INFO ] [Real]Added 18 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:45:30] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:45:30] [INFO ] [Nat]Absence check using 9 positive place invariants in 7 ms returned sat
[2021-05-18 12:45:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:45:30] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2021-05-18 12:45:30] [INFO ] [Nat]Added 18 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:45:30] [INFO ] Computed and/alt/rep : 120/2572/113 causal constraints in 10 ms.
[2021-05-18 12:45:31] [INFO ] Added : 84 causal constraints over 25 iterations in 884 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 11 ms.
Incomplete Parikh walk after 10500 steps, including 624 resets, run finished after 27 ms. (steps per millisecond=388 ) properties seen :[0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 11800 steps, including 595 resets, run finished after 30 ms. (steps per millisecond=393 ) properties seen :[1, 0, 0] could not realise parikh vector
FORMULA net-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 12300 steps, including 1316 resets, run finished after 30 ms. (steps per millisecond=410 ) properties seen :[0, 0] could not realise parikh vector
Support contains 6 out of 53 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 53/53 places, 136/136 transitions.
Discarding 1 places :
Also discarding 0 output transitions
Graph (complete) has 245 edges and 53 vertex of which 52 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 52 transition count 135
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 3 place count 51 transition count 135
Symmetric choice reduction at 0 with 1 rule applications. Total rules 4 place count 51 transition count 135
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 2 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 50 transition count 133
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 47 transition count 130
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 46 transition count 131
Free-agglomeration rule applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 17 place count 46 transition count 128
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 20 place count 43 transition count 128
Partial Free-agglomeration rule applied 15 times.
Drop transitions removed 15 transitions
Iterating global reduction 1 with 15 rules applied. Total rules applied 35 place count 43 transition count 128
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 36 place count 43 transition count 127
Applied a total of 36 rules in 22 ms. Remains 43 /53 variables (removed 10) and now considering 127/136 (removed 9) transitions.
Finished structural reductions, in 1 iterations. Remains : 43/53 places, 127/136 transitions.
Incomplete random walk after 1000000 steps, including 178265 resets, run finished after 2435 ms. (steps per millisecond=410 ) properties seen :[0, 1]
FORMULA net-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 22912 resets, run finished after 640 ms. (steps per millisecond=1562 ) properties seen :[0]
[2021-05-18 12:45:34] [INFO ] Flow matrix only has 112 transitions (discarded 15 similar events)
// Phase 1: matrix 112 rows 43 cols
[2021-05-18 12:45:34] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-18 12:45:34] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 5 ms returned sat
[2021-05-18 12:45:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:45:34] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2021-05-18 12:45:34] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:45:34] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 9 ms returned sat
[2021-05-18 12:45:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:45:35] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2021-05-18 12:45:35] [INFO ] State equation strengthened by 28 read => feed constraints.
[2021-05-18 12:45:35] [INFO ] [Nat]Added 28 Read/Feed constraints in 5 ms returned sat
[2021-05-18 12:45:35] [INFO ] Computed and/alt/rep : 111/3218/96 causal constraints in 10 ms.
[2021-05-18 12:45:35] [INFO ] Added : 49 causal constraints over 14 iterations in 205 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 6 ms.
Incomplete Parikh walk after 6800 steps, including 773 resets, run finished after 20 ms. (steps per millisecond=340 ) properties seen :[0] could not realise parikh vector
Support contains 5 out of 43 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 43/43 places, 127/127 transitions.
Discarding 9 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Graph (complete) has 178 edges and 43 vertex of which 34 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Drop transitions removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 34 transition count 108
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 34 transition count 108
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 22 place count 33 transition count 107
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 33 transition count 107
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 2 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 25 place count 32 transition count 105
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 32 transition count 105
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 2 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 28 place count 31 transition count 103
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 35 place count 31 transition count 96
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 39 place count 29 transition count 94
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 40 place count 29 transition count 93
Applied a total of 40 rules in 12 ms. Remains 29 /43 variables (removed 14) and now considering 93/127 (removed 34) transitions.
Finished structural reductions, in 1 iterations. Remains : 29/43 places, 93/127 transitions.
Incomplete random walk after 1000000 steps, including 223206 resets, run finished after 2192 ms. (steps per millisecond=456 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 24982 resets, run finished after 519 ms. (steps per millisecond=1926 ) properties seen :[0]
Probably explored full state space saw : 3441 states, properties seen :[0]
Probabilistic random walk after 15473 steps, saw 3441 distinct states, run finished after 33 ms. (steps per millisecond=468 ) properties seen :[0]
Explored full state space saw : 3441 states, properties seen :[0]
Exhaustive walk after 15473 steps, saw 3441 distinct states, run finished after 17 ms. (steps per millisecond=910 ) properties seen :[0]
FORMULA net-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
All properties solved without resorting to model-checking.

BK_STOP 1621341939374

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination ReachabilityCardinality -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6

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="HealthRecord-PT-12"
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 HealthRecord-PT-12, 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 r303-tall-162124171300175"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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