Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r071-tall-165254780500233.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-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 gold2021
Input is Dekker-PT-050, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r071-tall-165254780500233
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.1M
-rw-r--r-- 1 mcc users 8.2K Apr 30 05:32 CTLCardinality.txt
-rw-r--r-- 1 mcc users 91K Apr 30 05:32 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Apr 30 05:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Apr 30 05:23 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K May 9 07:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 07:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 9 07:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 07:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 30 05:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 158K Apr 30 05:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Apr 30 05:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 96K Apr 30 05:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 07:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 9 07:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 1.5M May 10 09:33 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 Dekker-PT-050-ReachabilityCardinality-00
FORMULA_NAME Dekker-PT-050-ReachabilityCardinality-01
FORMULA_NAME Dekker-PT-050-ReachabilityCardinality-02
FORMULA_NAME Dekker-PT-050-ReachabilityCardinality-03
FORMULA_NAME Dekker-PT-050-ReachabilityCardinality-04
FORMULA_NAME Dekker-PT-050-ReachabilityCardinality-05
FORMULA_NAME Dekker-PT-050-ReachabilityCardinality-06
FORMULA_NAME Dekker-PT-050-ReachabilityCardinality-07
FORMULA_NAME Dekker-PT-050-ReachabilityCardinality-08
FORMULA_NAME Dekker-PT-050-ReachabilityCardinality-09
FORMULA_NAME Dekker-PT-050-ReachabilityCardinality-10
FORMULA_NAME Dekker-PT-050-ReachabilityCardinality-11
FORMULA_NAME Dekker-PT-050-ReachabilityCardinality-12
FORMULA_NAME Dekker-PT-050-ReachabilityCardinality-13
FORMULA_NAME Dekker-PT-050-ReachabilityCardinality-14
FORMULA_NAME Dekker-PT-050-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1655069798988

Running Version 0
[2022-06-12 21:36:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-12 21:36:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-12 21:36:40] [INFO ] Load time of PNML (sax parser for PT used): 258 ms
[2022-06-12 21:36:40] [INFO ] Transformed 250 places.
[2022-06-12 21:36:41] [INFO ] Transformed 2600 transitions.
[2022-06-12 21:36:41] [INFO ] Found NUPN structural information;
[2022-06-12 21:36:41] [INFO ] Parsed PT model containing 250 places and 2600 transitions in 371 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 25 ms.
Working with output stream class java.io.PrintStream
FORMULA Dekker-PT-050-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-050-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-050-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-050-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-050-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-050-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 220 ms. (steps per millisecond=45 ) properties (out of 10) seen :1
FORMULA Dekker-PT-050-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
[2022-06-12 21:36:41] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 250 cols
[2022-06-12 21:36:41] [INFO ] Computed 150 place invariants in 20 ms
[2022-06-12 21:36:41] [INFO ] [Real]Absence check using 100 positive place invariants in 23 ms returned sat
[2022-06-12 21:36:41] [INFO ] [Real]Absence check using 100 positive and 50 generalized place invariants in 11 ms returned sat
[2022-06-12 21:36:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:36:41] [INFO ] [Real]Absence check using state equation in 87 ms returned sat
[2022-06-12 21:36:42] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:36:42] [INFO ] [Real]Absence check using 100 positive place invariants in 25 ms returned sat
[2022-06-12 21:36:42] [INFO ] [Real]Absence check using 100 positive and 50 generalized place invariants in 9 ms returned sat
[2022-06-12 21:36:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:36:42] [INFO ] [Real]Absence check using state equation in 77 ms returned sat
[2022-06-12 21:36:42] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:36:42] [INFO ] [Real]Absence check using 100 positive place invariants in 24 ms returned sat
[2022-06-12 21:36:42] [INFO ] [Real]Absence check using 100 positive and 50 generalized place invariants in 6 ms returned sat
[2022-06-12 21:36:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:36:42] [INFO ] [Real]Absence check using state equation in 63 ms returned sat
[2022-06-12 21:36:42] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:36:42] [INFO ] [Nat]Absence check using 100 positive place invariants in 16 ms returned sat
[2022-06-12 21:36:42] [INFO ] [Nat]Absence check using 100 positive and 50 generalized place invariants in 6 ms returned sat
[2022-06-12 21:36:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:36:42] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2022-06-12 21:36:42] [INFO ] State equation strengthened by 50 read => feed constraints.
[2022-06-12 21:36:42] [INFO ] [Nat]Added 50 Read/Feed constraints in 15 ms returned sat
[2022-06-12 21:36:42] [INFO ] Deduced a trap composed of 4 places in 143 ms of which 6 ms to minimize.
[2022-06-12 21:36:42] [INFO ] Deduced a trap composed of 4 places in 113 ms of which 2 ms to minimize.
[2022-06-12 21:36:43] [INFO ] Deduced a trap composed of 4 places in 88 ms of which 1 ms to minimize.
[2022-06-12 21:36:43] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 2 ms to minimize.
[2022-06-12 21:36:43] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 1 ms to minimize.
[2022-06-12 21:36:43] [INFO ] Deduced a trap composed of 4 places in 86 ms of which 0 ms to minimize.
[2022-06-12 21:36:43] [INFO ] Deduced a trap composed of 4 places in 92 ms of which 1 ms to minimize.
[2022-06-12 21:36:43] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 1 ms to minimize.
[2022-06-12 21:36:43] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 0 ms to minimize.
[2022-06-12 21:36:43] [INFO ] Deduced a trap composed of 5 places in 58 ms of which 1 ms to minimize.
[2022-06-12 21:36:43] [INFO ] Deduced a trap composed of 6 places in 58 ms of which 0 ms to minimize.
[2022-06-12 21:36:43] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 1 ms to minimize.
[2022-06-12 21:36:43] [INFO ] Deduced a trap composed of 6 places in 52 ms of which 0 ms to minimize.
[2022-06-12 21:36:43] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 0 ms to minimize.
[2022-06-12 21:36:43] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 1 ms to minimize.
[2022-06-12 21:36:43] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
[2022-06-12 21:36:44] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 0 ms to minimize.
[2022-06-12 21:36:44] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 1 ms to minimize.
[2022-06-12 21:36:44] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 0 ms to minimize.
[2022-06-12 21:36:44] [INFO ] Deduced a trap composed of 6 places in 52 ms of which 0 ms to minimize.
[2022-06-12 21:36:44] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 0 ms to minimize.
[2022-06-12 21:36:44] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 1 ms to minimize.
[2022-06-12 21:36:44] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
[2022-06-12 21:36:44] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2022-06-12 21:36:44] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 0 ms to minimize.
[2022-06-12 21:36:44] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 0 ms to minimize.
[2022-06-12 21:36:44] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
[2022-06-12 21:36:44] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2022-06-12 21:36:44] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2022-06-12 21:36:44] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2022-06-12 21:36:44] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2022-06-12 21:36:44] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2022-06-12 21:36:44] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2022-06-12 21:36:44] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2022-06-12 21:36:44] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 4 ms to minimize.
[2022-06-12 21:36:45] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 0 ms to minimize.
[2022-06-12 21:36:45] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2022-06-12 21:36:45] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 0 ms to minimize.
[2022-06-12 21:36:45] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
[2022-06-12 21:36:45] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2022-06-12 21:36:45] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 1 ms to minimize.
[2022-06-12 21:36:45] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2022-06-12 21:36:45] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2022-06-12 21:36:45] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2022-06-12 21:36:45] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2022-06-12 21:36:45] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2022-06-12 21:36:45] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2022-06-12 21:36:45] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2022-06-12 21:36:45] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2022-06-12 21:36:45] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 1 ms to minimize.
[2022-06-12 21:36:45] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2022-06-12 21:36:45] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2022-06-12 21:36:45] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2022-06-12 21:36:45] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2022-06-12 21:36:45] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2022-06-12 21:36:45] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 8 ms to minimize.
[2022-06-12 21:36:45] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2022-06-12 21:36:45] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2022-06-12 21:36:45] [INFO ] Trap strengthening (SAT) tested/added 59/58 trap constraints in 3244 ms
[2022-06-12 21:36:45] [INFO ] Computed and/alt/rep : 100/150/100 causal constraints (skipped 50 transitions) in 56 ms.
[2022-06-12 21:36:45] [INFO ] Added : 1 causal constraints over 1 iterations in 108 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 1 ms.
[2022-06-12 21:36:46] [INFO ] [Real]Absence check using 100 positive place invariants in 23 ms returned sat
[2022-06-12 21:36:46] [INFO ] [Real]Absence check using 100 positive and 50 generalized place invariants in 7 ms returned sat
[2022-06-12 21:36:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:36:46] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2022-06-12 21:36:46] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:36:46] [INFO ] [Real]Absence check using 100 positive place invariants in 18 ms returned sat
[2022-06-12 21:36:46] [INFO ] [Real]Absence check using 100 positive and 50 generalized place invariants in 7 ms returned sat
[2022-06-12 21:36:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:36:46] [INFO ] [Real]Absence check using state equation in 74 ms returned sat
[2022-06-12 21:36:46] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:36:46] [INFO ] [Real]Absence check using 100 positive place invariants in 17 ms returned sat
[2022-06-12 21:36:46] [INFO ] [Real]Absence check using 100 positive and 50 generalized place invariants in 7 ms returned sat
[2022-06-12 21:36:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:36:46] [INFO ] [Real]Absence check using state equation in 66 ms returned sat
[2022-06-12 21:36:46] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:36:46] [INFO ] [Nat]Absence check using 100 positive place invariants in 12 ms returned unsat
[2022-06-12 21:36:46] [INFO ] [Real]Absence check using 100 positive place invariants in 16 ms returned sat
[2022-06-12 21:36:46] [INFO ] [Real]Absence check using 100 positive and 50 generalized place invariants in 8 ms returned sat
[2022-06-12 21:36:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:36:46] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2022-06-12 21:36:46] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:36:46] [INFO ] [Nat]Absence check using 100 positive place invariants in 18 ms returned sat
[2022-06-12 21:36:46] [INFO ] [Nat]Absence check using 100 positive and 50 generalized place invariants in 7 ms returned sat
[2022-06-12 21:36:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:36:46] [INFO ] [Nat]Absence check using state equation in 71 ms returned sat
[2022-06-12 21:36:46] [INFO ] [Nat]Added 50 Read/Feed constraints in 11 ms returned sat
[2022-06-12 21:36:46] [INFO ] Deduced a trap composed of 6 places in 86 ms of which 1 ms to minimize.
[2022-06-12 21:36:47] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 0 ms to minimize.
[2022-06-12 21:36:47] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 0 ms to minimize.
[2022-06-12 21:36:47] [INFO ] Deduced a trap composed of 4 places in 91 ms of which 1 ms to minimize.
[2022-06-12 21:36:47] [INFO ] Deduced a trap composed of 5 places in 70 ms of which 0 ms to minimize.
[2022-06-12 21:36:47] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 0 ms to minimize.
[2022-06-12 21:36:47] [INFO ] Deduced a trap composed of 5 places in 62 ms of which 1 ms to minimize.
[2022-06-12 21:36:47] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 0 ms to minimize.
[2022-06-12 21:36:47] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 1 ms to minimize.
[2022-06-12 21:36:47] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 0 ms to minimize.
[2022-06-12 21:36:47] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 0 ms to minimize.
[2022-06-12 21:36:47] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 1 ms to minimize.
[2022-06-12 21:36:47] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 0 ms to minimize.
[2022-06-12 21:36:48] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 0 ms to minimize.
[2022-06-12 21:36:48] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
[2022-06-12 21:36:48] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 0 ms to minimize.
[2022-06-12 21:36:48] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 1 ms to minimize.
[2022-06-12 21:36:48] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 0 ms to minimize.
[2022-06-12 21:36:48] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 0 ms to minimize.
[2022-06-12 21:36:48] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 0 ms to minimize.
[2022-06-12 21:36:48] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 0 ms to minimize.
[2022-06-12 21:36:48] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 0 ms to minimize.
[2022-06-12 21:36:48] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
[2022-06-12 21:36:48] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 0 ms to minimize.
[2022-06-12 21:36:48] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 1 ms to minimize.
[2022-06-12 21:36:48] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
[2022-06-12 21:36:48] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 0 ms to minimize.
[2022-06-12 21:36:48] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2022-06-12 21:36:48] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 1 ms to minimize.
[2022-06-12 21:36:49] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
[2022-06-12 21:36:49] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2022-06-12 21:36:49] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 0 ms to minimize.
[2022-06-12 21:36:49] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2022-06-12 21:36:49] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2022-06-12 21:36:49] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 1 ms to minimize.
[2022-06-12 21:36:49] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2022-06-12 21:36:49] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 0 ms to minimize.
[2022-06-12 21:36:49] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 0 ms to minimize.
[2022-06-12 21:36:49] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2022-06-12 21:36:49] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 0 ms to minimize.
[2022-06-12 21:36:49] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 1 ms to minimize.
[2022-06-12 21:36:49] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 1 ms to minimize.
[2022-06-12 21:36:49] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 0 ms to minimize.
[2022-06-12 21:36:49] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 0 ms to minimize.
[2022-06-12 21:36:49] [INFO ] Deduced a trap composed of 5 places in 61 ms of which 0 ms to minimize.
[2022-06-12 21:36:50] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 1 ms to minimize.
[2022-06-12 21:36:50] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 0 ms to minimize.
[2022-06-12 21:36:50] [INFO ] Deduced a trap composed of 5 places in 52 ms of which 0 ms to minimize.
[2022-06-12 21:36:50] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 1 ms to minimize.
[2022-06-12 21:36:50] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 0 ms to minimize.
[2022-06-12 21:36:50] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 0 ms to minimize.
[2022-06-12 21:36:50] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 0 ms to minimize.
[2022-06-12 21:36:50] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
[2022-06-12 21:36:50] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 0 ms to minimize.
[2022-06-12 21:36:50] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
[2022-06-12 21:36:50] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 0 ms to minimize.
[2022-06-12 21:36:50] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 0 ms to minimize.
[2022-06-12 21:36:50] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 0 ms to minimize.
[2022-06-12 21:36:50] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 1 ms to minimize.
[2022-06-12 21:36:50] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 1 ms to minimize.
[2022-06-12 21:36:50] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 1 ms to minimize.
[2022-06-12 21:36:50] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 0 ms to minimize.
[2022-06-12 21:36:51] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 1 ms to minimize.
[2022-06-12 21:36:51] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 0 ms to minimize.
[2022-06-12 21:36:51] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 0 ms to minimize.
[2022-06-12 21:36:51] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
[2022-06-12 21:36:51] [INFO ] Deduced a trap composed of 6 places in 40 ms of which 0 ms to minimize.
[2022-06-12 21:36:51] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2022-06-12 21:36:51] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 0 ms to minimize.
[2022-06-12 21:36:51] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 0 ms to minimize.
[2022-06-12 21:36:51] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 1 ms to minimize.
[2022-06-12 21:36:51] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 0 ms to minimize.
[2022-06-12 21:36:51] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2022-06-12 21:36:51] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 0 ms to minimize.
[2022-06-12 21:36:51] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2022-06-12 21:36:51] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2022-06-12 21:36:51] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 6
[2022-06-12 21:36:51] [INFO ] [Real]Absence check using 100 positive place invariants in 18 ms returned sat
[2022-06-12 21:36:51] [INFO ] [Real]Absence check using 100 positive and 50 generalized place invariants in 8 ms returned sat
[2022-06-12 21:36:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:36:51] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2022-06-12 21:36:51] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:36:51] [INFO ] [Real]Absence check using 100 positive place invariants in 17 ms returned sat
[2022-06-12 21:36:51] [INFO ] [Real]Absence check using 100 positive and 50 generalized place invariants in 8 ms returned sat
[2022-06-12 21:36:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:36:52] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2022-06-12 21:36:52] [INFO ] Solution in real domain found non-integer solution.
FORMULA Dekker-PT-050-ReachabilityCardinality-14 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Dekker-PT-050-ReachabilityCardinality-12 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Dekker-PT-050-ReachabilityCardinality-08 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Dekker-PT-050-ReachabilityCardinality-06 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Dekker-PT-050-ReachabilityCardinality-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Dekker-PT-050-ReachabilityCardinality-01 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Dekker-PT-050-ReachabilityCardinality-00 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 9 Parikh solutions to 2 different solutions.
Incomplete Parikh walk after 14200 steps, including 98 resets, run finished after 283 ms. (steps per millisecond=50 ) properties (out of 2) seen :0 could not realise parikh vector
Support contains 19 out of 250 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 250/250 places, 2600/2600 transitions.
Applied a total of 0 rules in 208 ms. Remains 250 /250 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 250/250 places, 2600/2600 transitions.
[2022-06-12 21:36:53] [INFO ] Flatten gal took : 335 ms
[2022-06-12 21:36:53] [INFO ] Flatten gal took : 160 ms
[2022-06-12 21:36:53] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7189771110505339139.gal : 64 ms
[2022-06-12 21:36:53] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14382675192508673337.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality7189771110505339139.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality14382675192508673337.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality7189771110505339139.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality14382675192508673337.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality14382675192508673337.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :4 after 16
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :16 after 128
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :128 after 8192
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :8192 after 1.67772e+07
Detected timeout of ITS tools.
[2022-06-12 21:37:08] [INFO ] Flatten gal took : 168 ms
[2022-06-12 21:37:08] [INFO ] Applying decomposition
[2022-06-12 21:37:08] [INFO ] Flatten gal took : 130 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph5979463253139672861.txt, -o, /tmp/graph5979463253139672861.bin, -w, /tmp/graph5979463253139672861.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph5979463253139672861.bin, -l, -1, -v, -w, /tmp/graph5979463253139672861.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-12 21:37:09] [INFO ] Decomposing Gal with order
[2022-06-12 21:37:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 21:37:09] [INFO ] Removed a total of 8229 redundant transitions.
[2022-06-12 21:37:09] [INFO ] Flatten gal took : 338 ms
[2022-06-12 21:37:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 66 ms.
[2022-06-12 21:37:09] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9879858823689706400.gal : 23 ms
[2022-06-12 21:37:09] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2012477706188575367.prop : 7 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality9879858823689706400.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality2012477706188575367.prop, --nowitness], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality9879858823689706400.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality2012477706188575367.prop --nowitness
Loading property file /tmp/ReachabilityCardinality2012477706188575367.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :8 after 1.1259e+15
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :1.1259e+15 after 2.81475e+15
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,2.92734e+16,0.429809,13308,117,15,1848,1361,2897,1430,51,1970,0
Total reachable state count : 29273397577908224

Verifying 2 reachability properties.
Invariant property Dekker-PT-050-ReachabilityCardinality-04 does not hold.
FORMULA Dekker-PT-050-ReachabilityCardinality-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
Dekker-PT-050-ReachabilityCardinality-04,2.81475e+14,0.431463,13308,64,14,1848,1361,2900,1430,56,1970,65
Invariant property Dekker-PT-050-ReachabilityCardinality-11 does not hold.
FORMULA Dekker-PT-050-ReachabilityCardinality-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
Dekker-PT-050-ReachabilityCardinality-11,1.75922e+13,0.433581,13308,68,14,1848,1361,2931,1430,61,1970,552
All properties solved without resorting to model-checking.

BK_STOP 1655069831284

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination ReachabilityCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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="Dekker-PT-050"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="gold2021"
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 gold2021"
echo " Input is Dekker-PT-050, 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 r071-tall-165254780500233"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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