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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 388K
-rw-r--r-- 1 mcc users 12K May 15 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 115K May 15 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.8K May 15 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 79K May 15 08:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 12 07:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K 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 15K 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:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K May 11 18:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 11 15:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K May 11 15:47 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 49K 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-ReachabilityFireability-00
FORMULA_NAME net-ReachabilityFireability-01
FORMULA_NAME net-ReachabilityFireability-02
FORMULA_NAME net-ReachabilityFireability-03
FORMULA_NAME net-ReachabilityFireability-04
FORMULA_NAME net-ReachabilityFireability-05
FORMULA_NAME net-ReachabilityFireability-06
FORMULA_NAME net-ReachabilityFireability-07
FORMULA_NAME net-ReachabilityFireability-08
FORMULA_NAME net-ReachabilityFireability-09
FORMULA_NAME net-ReachabilityFireability-10
FORMULA_NAME net-ReachabilityFireability-11
FORMULA_NAME net-ReachabilityFireability-12
FORMULA_NAME net-ReachabilityFireability-13
FORMULA_NAME net-ReachabilityFireability-14
FORMULA_NAME net-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1621341590603

[2021-05-18 12:39:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-18 12:39:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-18 12:39:52] [INFO ] Load time of PNML (sax parser for PT used): 52 ms
[2021-05-18 12:39:52] [INFO ] Transformed 156 places.
[2021-05-18 12:39:52] [INFO ] Transformed 326 transitions.
[2021-05-18 12:39:52] [INFO ] Found NUPN structural information;
[2021-05-18 12:39:52] [INFO ] Parsed PT model containing 156 places and 326 transitions in 97 ms.
Ensure Unique test removed 26 transitions
Reduce redundant transitions removed 26 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 18 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 564 resets, run finished after 101 ms. (steps per millisecond=99 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 1]
FORMULA net-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA net-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA net-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 75 resets, run finished after 20 ms. (steps per millisecond=500 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0]
FORMULA net-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 79 resets, run finished after 19 ms. (steps per millisecond=526 ) properties seen :[0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0]
FORMULA net-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 121 resets, run finished after 19 ms. (steps per millisecond=526 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 75 resets, run finished after 15 ms. (steps per millisecond=666 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 42 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 10001 steps, including 61 resets, run finished after 36 ms. (steps per millisecond=277 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 21 ms. (steps per millisecond=476 ) properties seen :[0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0]
FORMULA net-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 73 resets, run finished after 47 ms. (steps per millisecond=212 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 44 resets, run finished after 13 ms. (steps per millisecond=769 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 11 ms. (steps per millisecond=909 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 73 resets, run finished after 41 ms. (steps per millisecond=243 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
[2021-05-18 12:39:52] [INFO ] Flow matrix only has 288 transitions (discarded 12 similar events)
// Phase 1: matrix 288 rows 156 cols
[2021-05-18 12:39:52] [INFO ] Computed 18 place invariants in 10 ms
[2021-05-18 12:39:52] [INFO ] [Real]Absence check using 10 positive place invariants in 20 ms returned sat
[2021-05-18 12:39:52] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 5 ms returned sat
[2021-05-18 12:39:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:39:52] [INFO ] [Real]Absence check using state equation in 151 ms returned sat
[2021-05-18 12:39:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-18 12:39:52] [INFO ] [Real]Added 1 Read/Feed constraints in 4 ms returned sat
[2021-05-18 12:39:53] [INFO ] Computed and/alt/rep : 299/2289/287 causal constraints in 33 ms.
[2021-05-18 12:39:53] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:39:53] [INFO ] [Nat]Absence check using 10 positive place invariants in 35 ms returned sat
[2021-05-18 12:39:53] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 6 ms returned sat
[2021-05-18 12:39:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:39:53] [INFO ] [Nat]Absence check using state equation in 128 ms returned sat
[2021-05-18 12:39:53] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:39:53] [INFO ] Computed and/alt/rep : 299/2289/287 causal constraints in 29 ms.
[2021-05-18 12:39:54] [INFO ] Added : 156 causal constraints over 32 iterations in 1105 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 32 ms.
[2021-05-18 12:39:54] [INFO ] [Real]Absence check using 10 positive place invariants in 12 ms returned sat
[2021-05-18 12:39:54] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 10 ms returned sat
[2021-05-18 12:39:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:39:54] [INFO ] [Real]Absence check using state equation in 118 ms returned sat
[2021-05-18 12:39:54] [INFO ] [Real]Added 1 Read/Feed constraints in 6 ms returned sat
[2021-05-18 12:39:54] [INFO ] Deduced a trap composed of 30 places in 46 ms
[2021-05-18 12:39:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 64 ms
[2021-05-18 12:39:54] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:39:55] [INFO ] [Nat]Absence check using 10 positive place invariants in 275 ms returned sat
[2021-05-18 12:39:55] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 9 ms returned sat
[2021-05-18 12:39:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:39:55] [INFO ] [Nat]Absence check using state equation in 109 ms returned sat
[2021-05-18 12:39:55] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2021-05-18 12:39:55] [INFO ] Computed and/alt/rep : 299/2289/287 causal constraints in 22 ms.
[2021-05-18 12:39:56] [INFO ] Added : 153 causal constraints over 32 iterations in 855 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 21 ms.
[2021-05-18 12:39:56] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2021-05-18 12:39:56] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned unsat
[2021-05-18 12:39:56] [INFO ] [Real]Absence check using 10 positive place invariants in 12 ms returned sat
[2021-05-18 12:39:56] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-18 12:39:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:39:56] [INFO ] [Real]Absence check using state equation in 124 ms returned sat
[2021-05-18 12:39:56] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:39:56] [INFO ] Computed and/alt/rep : 299/2289/287 causal constraints in 22 ms.
[2021-05-18 12:39:56] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:39:56] [INFO ] [Nat]Absence check using 10 positive place invariants in 21 ms returned sat
[2021-05-18 12:39:56] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-18 12:39:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:39:56] [INFO ] [Nat]Absence check using state equation in 121 ms returned sat
[2021-05-18 12:39:56] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2021-05-18 12:39:56] [INFO ] Computed and/alt/rep : 299/2289/287 causal constraints in 23 ms.
[2021-05-18 12:39:57] [INFO ] Added : 174 causal constraints over 35 iterations in 993 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 23 ms.
[2021-05-18 12:39:57] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2021-05-18 12:39:57] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-18 12:39:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:39:57] [INFO ] [Real]Absence check using state equation in 109 ms returned sat
[2021-05-18 12:39:57] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:39:57] [INFO ] Computed and/alt/rep : 299/2289/287 causal constraints in 18 ms.
[2021-05-18 12:39:57] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:39:58] [INFO ] [Nat]Absence check using 10 positive place invariants in 244 ms returned sat
[2021-05-18 12:39:58] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 5 ms returned sat
[2021-05-18 12:39:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:39:58] [INFO ] [Nat]Absence check using state equation in 118 ms returned sat
[2021-05-18 12:39:58] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2021-05-18 12:39:58] [INFO ] Computed and/alt/rep : 299/2289/287 causal constraints in 22 ms.
[2021-05-18 12:39:59] [INFO ] Added : 152 causal constraints over 32 iterations in 1535 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 28 ms.
[2021-05-18 12:39:59] [INFO ] [Real]Absence check using 10 positive place invariants in 11 ms returned sat
[2021-05-18 12:39:59] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 10 ms returned sat
[2021-05-18 12:39:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:39:59] [INFO ] [Real]Absence check using state equation in 119 ms returned sat
[2021-05-18 12:39:59] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:39:59] [INFO ] Deduced a trap composed of 30 places in 23 ms
[2021-05-18 12:40:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 43 ms
[2021-05-18 12:40:00] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:40:00] [INFO ] [Nat]Absence check using 10 positive place invariants in 282 ms returned sat
[2021-05-18 12:40:00] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 10 ms returned sat
[2021-05-18 12:40:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:40:00] [INFO ] [Nat]Absence check using state equation in 122 ms returned sat
[2021-05-18 12:40:00] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2021-05-18 12:40:00] [INFO ] Computed and/alt/rep : 299/2289/287 causal constraints in 17 ms.
[2021-05-18 12:40:00] [INFO ] Added : 119 causal constraints over 24 iterations in 404 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 13 ms.
[2021-05-18 12:40:00] [INFO ] [Real]Absence check using 10 positive place invariants in 11 ms returned sat
[2021-05-18 12:40:00] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 12 ms returned sat
[2021-05-18 12:40:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:40:01] [INFO ] [Real]Absence check using state equation in 116 ms returned sat
[2021-05-18 12:40:01] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:40:01] [INFO ] Computed and/alt/rep : 299/2289/287 causal constraints in 15 ms.
[2021-05-18 12:40:01] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:40:01] [INFO ] [Nat]Absence check using 10 positive place invariants in 302 ms returned sat
[2021-05-18 12:40:01] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 9 ms returned sat
[2021-05-18 12:40:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:40:01] [INFO ] [Nat]Absence check using state equation in 118 ms returned sat
[2021-05-18 12:40:01] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:40:01] [INFO ] Computed and/alt/rep : 299/2289/287 causal constraints in 16 ms.
[2021-05-18 12:40:02] [INFO ] Added : 154 causal constraints over 32 iterations in 1016 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 22 ms.
[2021-05-18 12:40:02] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2021-05-18 12:40:02] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 9 ms returned sat
[2021-05-18 12:40:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:40:02] [INFO ] [Real]Absence check using state equation in 112 ms returned sat
[2021-05-18 12:40:02] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:40:02] [INFO ] Deduced a trap composed of 30 places in 35 ms
[2021-05-18 12:40:02] [INFO ] Deduced a trap composed of 29 places in 27 ms
[2021-05-18 12:40:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 78 ms
[2021-05-18 12:40:02] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2021-05-18 12:40:02] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-18 12:40:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:40:03] [INFO ] [Real]Absence check using state equation in 89 ms returned unsat
[2021-05-18 12:40:03] [INFO ] [Real]Absence check using 10 positive place invariants in 11 ms returned sat
[2021-05-18 12:40:03] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 10 ms returned sat
[2021-05-18 12:40:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:40:03] [INFO ] [Real]Absence check using state equation in 122 ms returned sat
[2021-05-18 12:40:03] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:40:03] [INFO ] [Nat]Absence check using 10 positive place invariants in 302 ms returned sat
[2021-05-18 12:40:03] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 12 ms returned sat
[2021-05-18 12:40:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:40:03] [INFO ] [Nat]Absence check using state equation in 171 ms returned sat
[2021-05-18 12:40:03] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2021-05-18 12:40:03] [INFO ] Computed and/alt/rep : 299/2289/287 causal constraints in 20 ms.
[2021-05-18 12:40:04] [INFO ] Added : 116 causal constraints over 24 iterations in 397 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 8 ms.
FORMULA net-ReachabilityFireability-12 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA net-ReachabilityFireability-11 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA net-ReachabilityFireability-03 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 6900 steps, including 242 resets, run finished after 33 ms. (steps per millisecond=209 ) properties seen :[0, 0, 0, 0, 0, 0, 1] could not realise parikh vector
FORMULA net-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 20500 steps, including 825 resets, run finished after 79 ms. (steps per millisecond=259 ) properties seen :[1, 1, 0, 0, 1, 0] could not realise parikh vector
FORMULA net-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA net-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA net-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 10700 steps, including 212 resets, run finished after 34 ms. (steps per millisecond=314 ) properties seen :[0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 14800 steps, including 324 resets, run finished after 43 ms. (steps per millisecond=344 ) properties seen :[0, 1, 0] could not realise parikh vector
FORMULA net-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 17100 steps, including 507 resets, run finished after 45 ms. (steps per millisecond=380 ) properties seen :[0, 0] could not realise parikh vector
Incomplete Parikh walk after 16800 steps, including 478 resets, run finished after 46 ms. (steps per millisecond=365 ) properties seen :[0, 0] could not realise parikh vector
Incomplete Parikh walk after 23600 steps, including 991 resets, run finished after 60 ms. (steps per millisecond=393 ) properties seen :[0, 1] could not realise parikh vector
FORMULA net-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 1 out of 156 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 156/156 places, 300/300 transitions.
Graph (trivial) has 237 edges and 156 vertex of which 10 / 156 are part of one of the 5 SCC in 4 ms
Free SCC test removed 5 places
Discarding 10 places :
Also discarding 10 output transitions
Drop transitions removed 10 transitions
Graph (complete) has 652 edges and 151 vertex of which 141 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.5 ms
Drop transitions removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 0 with 18 rules applied. Total rules applied 20 place count 141 transition count 272
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 12 rules applied. Total rules applied 32 place count 136 transition count 265
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 34 place count 134 transition count 265
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 34 place count 134 transition count 262
Deduced a syphon composed of 3 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 42 place count 129 transition count 262
Symmetric choice reduction at 3 with 77 rule applications. Total rules 119 place count 129 transition count 262
Deduced a syphon composed of 77 places in 0 ms
Reduce places removed 77 places and 154 transitions.
Iterating global reduction 3 with 154 rules applied. Total rules applied 273 place count 52 transition count 108
Symmetric choice reduction at 3 with 10 rule applications. Total rules 283 place count 52 transition count 108
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 20 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 303 place count 42 transition count 88
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 312 place count 42 transition count 79
Symmetric choice reduction at 4 with 3 rule applications. Total rules 315 place count 42 transition count 79
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 9 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 321 place count 39 transition count 70
Symmetric choice reduction at 4 with 3 rule applications. Total rules 324 place count 39 transition count 70
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 6 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 330 place count 36 transition count 64
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 339 place count 36 transition count 55
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 5 with 2 rules applied. Total rules applied 341 place count 35 transition count 54
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 342 place count 35 transition count 53
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -32
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 6 with 10 rules applied. Total rules applied 352 place count 30 transition count 85
Free-agglomeration rule applied 2 times.
Iterating global reduction 6 with 2 rules applied. Total rules applied 354 place count 30 transition count 83
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 356 place count 28 transition count 83
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 7 with 2 rules applied. Total rules applied 358 place count 28 transition count 146
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 364 place count 26 transition count 142
Symmetric choice reduction at 8 with 1 rule applications. Total rules 365 place count 26 transition count 142
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 31 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 367 place count 25 transition count 111
Symmetric choice reduction at 8 with 1 rule applications. Total rules 368 place count 25 transition count 111
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 4 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 370 place count 24 transition count 107
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 8 with 10 rules applied. Total rules applied 380 place count 24 transition count 97
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 9 with 8 rules applied. Total rules applied 388 place count 24 transition count 97
Drop transitions removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 9 with 14 rules applied. Total rules applied 402 place count 24 transition count 83
Applied a total of 402 rules in 56 ms. Remains 24 /156 variables (removed 132) and now considering 83/300 (removed 217) transitions.
[2021-05-18 12:40:04] [INFO ] Flow matrix only has 71 transitions (discarded 12 similar events)
// Phase 1: matrix 71 rows 24 cols
[2021-05-18 12:40:04] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-18 12:40:04] [INFO ] Dead Transitions using invariants and state equation in 48 ms returned [82]
Found 1 dead transitions using SMT.
Drop transitions removed 1 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 1 transitions :[82]
Starting structural reductions, iteration 1 : 24/156 places, 82/300 transitions.
Discarding 1 places :
Also discarding 0 output transitions
Graph (complete) has 91 edges and 24 vertex of which 23 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 23 transition count 82
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 22 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 22 transition count 60
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 22 transition count 60
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 5 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 7 place count 21 transition count 55
Symmetric choice reduction at 0 with 1 rule applications. Total rules 8 place count 21 transition count 55
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 3 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 20 transition count 52
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 14 place count 20 transition count 48
Applied a total of 14 rules in 6 ms. Remains 20 /24 variables (removed 4) and now considering 48/82 (removed 34) transitions.
Finished structural reductions, in 2 iterations. Remains : 20/156 places, 48/300 transitions.
Finished random walk after 34 steps, including 5 resets, run visited all 1 properties in 1 ms. (steps per millisecond=34 )
FORMULA net-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.

BK_STOP 1621341605590

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution ReachabilityFireability -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 ReachabilityFireability -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-08"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="gold2020"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool gold2020"
echo " Input is HealthRecord-PT-08, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r303-tall-162124171200160"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/HealthRecord-PT-08.tgz
mv HealthRecord-PT-08 execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;