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.r143-tall-165271830200125.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 Kanban-PT-50000, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r143-tall-165271830200125
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 476K
-rw-r--r-- 1 mcc users 6.2K Apr 29 17:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Apr 29 17:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Apr 29 17:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 29 17:36 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 9 08:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 9 08:10 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 9 08:10 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 9 08:10 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.0K Apr 29 17:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 78K Apr 29 17:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Apr 29 17:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 126K Apr 29 17:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 9 08:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 6 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 14K May 10 09:34 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 Kanban-PT-50000-ReachabilityCardinality-00
FORMULA_NAME Kanban-PT-50000-ReachabilityCardinality-01
FORMULA_NAME Kanban-PT-50000-ReachabilityCardinality-02
FORMULA_NAME Kanban-PT-50000-ReachabilityCardinality-03
FORMULA_NAME Kanban-PT-50000-ReachabilityCardinality-04
FORMULA_NAME Kanban-PT-50000-ReachabilityCardinality-05
FORMULA_NAME Kanban-PT-50000-ReachabilityCardinality-06
FORMULA_NAME Kanban-PT-50000-ReachabilityCardinality-07
FORMULA_NAME Kanban-PT-50000-ReachabilityCardinality-08
FORMULA_NAME Kanban-PT-50000-ReachabilityCardinality-09
FORMULA_NAME Kanban-PT-50000-ReachabilityCardinality-10
FORMULA_NAME Kanban-PT-50000-ReachabilityCardinality-11
FORMULA_NAME Kanban-PT-50000-ReachabilityCardinality-12
FORMULA_NAME Kanban-PT-50000-ReachabilityCardinality-13
FORMULA_NAME Kanban-PT-50000-ReachabilityCardinality-14
FORMULA_NAME Kanban-PT-50000-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1655068970952

Running Version 0
[2022-06-12 21:22:52] [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:22:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-12 21:22:52] [INFO ] Load time of PNML (sax parser for PT used): 23 ms
[2022-06-12 21:22:52] [INFO ] Transformed 16 places.
[2022-06-12 21:22:52] [INFO ] Transformed 16 transitions.
[2022-06-12 21:22:52] [INFO ] Parsed PT model containing 16 places and 16 transitions in 57 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 50001 steps, including 0 resets, run finished after 26 ms. (steps per millisecond=1923 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 16) seen :0
Probabilistic random walk after 1000001 steps, saw 749610 distinct states, run finished after 2094 ms. (steps per millisecond=477 ) properties seen :{13=1}
FORMULA Kanban-PT-50000-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 15 properties.
// Phase 1: matrix 16 rows 16 cols
[2022-06-12 21:22:55] [INFO ] Computed 5 place invariants in 8 ms
[2022-06-12 21:22:55] [INFO ] [Real]Absence check using 4 positive place invariants in 6 ms returned sat
[2022-06-12 21:22:55] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-12 21:22:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:22:55] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2022-06-12 21:22:55] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 4 ms.
[2022-06-12 21:22:55] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:22:55] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2022-06-12 21:22:55] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-12 21:22:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:22:55] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2022-06-12 21:22:55] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 2 ms.
[2022-06-12 21:22:55] [INFO ] Added : 2 causal constraints over 2 iterations in 10 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 2 ms.
[2022-06-12 21:22:55] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-06-12 21:22:55] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned unsat
[2022-06-12 21:22:55] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-06-12 21:22:55] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-12 21:22:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:22:55] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2022-06-12 21:22:55] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:22:55] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-06-12 21:22:55] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-12 21:22:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:22:55] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2022-06-12 21:22:55] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 4 ms.
[2022-06-12 21:22:55] [INFO ] Added : 3 causal constraints over 2 iterations in 20 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 1 ms.
[2022-06-12 21:22:55] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-06-12 21:22:55] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-12 21:22:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:22:55] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2022-06-12 21:22:55] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 2 ms.
[2022-06-12 21:22:55] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:22:55] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-06-12 21:22:55] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-12 21:22:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:22:55] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2022-06-12 21:22:55] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 1 ms.
[2022-06-12 21:22:55] [INFO ] Added : 13 causal constraints over 4 iterations in 14 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 1 ms.
[2022-06-12 21:22:55] [INFO ] [Real]Absence check using 4 positive place invariants in 0 ms returned sat
[2022-06-12 21:22:55] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-12 21:22:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:22:55] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2022-06-12 21:22:55] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 1 ms.
[2022-06-12 21:22:55] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:22:55] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-06-12 21:22:55] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-12 21:22:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:22:55] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2022-06-12 21:22:55] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 2 ms.
[2022-06-12 21:22:55] [INFO ] Added : 13 causal constraints over 4 iterations in 37 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 1 ms.
[2022-06-12 21:22:55] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-06-12 21:22:55] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-12 21:22:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:22:55] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2022-06-12 21:22:55] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:22:55] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-06-12 21:22:55] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-12 21:22:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:22:55] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2022-06-12 21:22:55] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 2 ms.
[2022-06-12 21:22:55] [INFO ] Added : 14 causal constraints over 3 iterations in 12 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 1 ms.
[2022-06-12 21:22:55] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-06-12 21:22:55] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-12 21:22:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:22:55] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2022-06-12 21:22:55] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 1 ms.
[2022-06-12 21:22:55] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:22:55] [INFO ] [Nat]Absence check using 4 positive place invariants in 0 ms returned sat
[2022-06-12 21:22:55] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-12 21:22:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:22:55] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2022-06-12 21:22:55] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 2 ms.
[2022-06-12 21:22:55] [INFO ] Added : 4 causal constraints over 2 iterations in 13 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 1 ms.
[2022-06-12 21:22:55] [INFO ] [Real]Absence check using 4 positive place invariants in 0 ms returned sat
[2022-06-12 21:22:55] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 14 ms returned sat
[2022-06-12 21:22:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:22:55] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2022-06-12 21:22:55] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 1 ms.
[2022-06-12 21:22:55] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:22:55] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-06-12 21:22:55] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-12 21:22:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:22:55] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2022-06-12 21:22:55] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 1 ms.
[2022-06-12 21:22:55] [INFO ] Added : 14 causal constraints over 4 iterations in 11 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 1 ms.
[2022-06-12 21:22:55] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-06-12 21:22:55] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-12 21:22:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:22:55] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2022-06-12 21:22:55] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 1 ms.
[2022-06-12 21:22:55] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 0 ms.
[2022-06-12 21:22:55] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-06-12 21:22:55] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-12 21:22:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:22:55] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2022-06-12 21:22:55] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 1 ms.
[2022-06-12 21:22:55] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:22:55] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-06-12 21:22:55] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-12 21:22:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:22:55] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2022-06-12 21:22:55] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 2 ms.
[2022-06-12 21:22:55] [INFO ] Added : 13 causal constraints over 4 iterations in 11 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 1 ms.
[2022-06-12 21:22:55] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-06-12 21:22:55] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-12 21:22:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:22:55] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2022-06-12 21:22:55] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:22:55] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-06-12 21:22:55] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-12 21:22:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:22:55] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2022-06-12 21:22:55] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 1 ms.
[2022-06-12 21:22:55] [INFO ] Added : 14 causal constraints over 3 iterations in 18 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 0 ms.
[2022-06-12 21:22:55] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-06-12 21:22:55] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-12 21:22:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:22:55] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2022-06-12 21:22:55] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 2 ms.
[2022-06-12 21:22:55] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:22:55] [INFO ] [Nat]Absence check using 4 positive place invariants in 0 ms returned sat
[2022-06-12 21:22:55] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-12 21:22:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:22:55] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2022-06-12 21:22:55] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 2 ms.
[2022-06-12 21:22:55] [INFO ] Added : 11 causal constraints over 3 iterations in 9 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 0 ms.
[2022-06-12 21:22:55] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-06-12 21:22:55] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-12 21:22:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:22:55] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2022-06-12 21:22:55] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:22:55] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-06-12 21:22:55] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-12 21:22:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:22:55] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2022-06-12 21:22:55] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 1 ms.
[2022-06-12 21:22:55] [INFO ] Added : 9 causal constraints over 2 iterations in 7 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 0 ms.
[2022-06-12 21:22:55] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-06-12 21:22:55] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-12 21:22:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:22:55] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2022-06-12 21:22:55] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 2 ms.
[2022-06-12 21:22:55] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:22:55] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-06-12 21:22:55] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-12 21:22:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:22:55] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2022-06-12 21:22:55] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 1 ms.
[2022-06-12 21:22:55] [INFO ] Added : 11 causal constraints over 3 iterations in 8 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 0 ms.
FORMULA Kanban-PT-50000-ReachabilityCardinality-09 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Kanban-PT-50000-ReachabilityCardinality-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 15 Parikh solutions to 13 different solutions.
Incomplete Parikh walk after 8213000 steps, including 98 resets, run finished after 7099 ms. (steps per millisecond=1156 ) properties (out of 13) seen :4 could not realise parikh vector
FORMULA Kanban-PT-50000-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Kanban-PT-50000-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Kanban-PT-50000-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Kanban-PT-50000-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 10000100 steps, including 98 resets, run finished after 8661 ms. (steps per millisecond=1154 ) properties (out of 9) seen :1 could not realise parikh vector
FORMULA Kanban-PT-50000-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 33578900 steps, including 99 resets, run finished after 27745 ms. (steps per millisecond=1210 ) properties (out of 8) seen :2 could not realise parikh vector
FORMULA Kanban-PT-50000-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Kanban-PT-50000-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 28559400 steps, including 99 resets, run finished after 17917 ms. (steps per millisecond=1593 ) properties (out of 6) seen :2 could not realise parikh vector
FORMULA Kanban-PT-50000-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Kanban-PT-50000-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Interrupted Parikh walk after 45204474 steps, including 74 resets, run timeout after 30001 ms. (steps per millisecond=1506 ) properties (out of 4) seen :1
FORMULA Kanban-PT-50000-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 10906800 steps, including 99 resets, run finished after 5474 ms. (steps per millisecond=1992 ) properties (out of 3) seen :0 could not realise parikh vector
Incomplete Parikh walk after 20376700 steps, including 99 resets, run finished after 12034 ms. (steps per millisecond=1693 ) properties (out of 3) seen :1 could not realise parikh vector
FORMULA Kanban-PT-50000-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 3 out of 16 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 16/16 places, 16/16 transitions.
Graph (trivial) has 8 edges and 16 vertex of which 4 / 16 are part of one of the 2 SCC in 4 ms
Free SCC test removed 2 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Ensure Unique test removed 1 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 13 transition count 11
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 12 transition count 10
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 11 transition count 10
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 6 place count 11 transition count 8
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 5 rules applied. Total rules applied 11 place count 8 transition count 8
Applied a total of 11 rules in 23 ms. Remains 8 /16 variables (removed 8) and now considering 8/16 (removed 8) transitions.
Finished structural reductions, in 1 iterations. Remains : 8/16 places, 8/16 transitions.
[2022-06-12 21:24:45] [INFO ] Flatten gal took : 16 ms
[2022-06-12 21:24:45] [INFO ] Flatten gal took : 2 ms
[2022-06-12 21:24:45] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality18611504863228364.gal : 3 ms
[2022-06-12 21:24:45] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality91111095838711397.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/ReachabilityCardinality18611504863228364.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality91111095838711397.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/ReachabilityCardinality18611504863228364.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality91111095838711397.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality91111095838711397.prop.
An unexpected exception occurred : Overflow error when converting initial marking. Please recompile libDDD with larger DDD::val_t definition.
ITS-tools command line returned an error code 1
[2022-06-12 21:24:45] [INFO ] Flatten gal took : 2 ms
[2022-06-12 21:24:45] [INFO ] Applying decomposition
[2022-06-12 21:24:45] [INFO ] Flatten gal took : 2 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/graph2577612718817335227.txt, -o, /tmp/graph2577612718817335227.bin, -w, /tmp/graph2577612718817335227.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/graph2577612718817335227.bin, -l, -1, -v, -w, /tmp/graph2577612718817335227.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-12 21:24:45] [INFO ] Decomposing Gal with order
[2022-06-12 21:24:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 21:24:45] [INFO ] Flatten gal took : 18 ms
[2022-06-12 21:24:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2022-06-12 21:24:45] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1860603670233064992.gal : 0 ms
[2022-06-12 21:24:45] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10827519845469076226.prop : 0 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/ReachabilityCardinality1860603670233064992.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality10827519845469076226.prop, --nowitness], workingDir=/home/mcc/execution]
ITS-tools command line returned an error code 1

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/ReachabilityCardinality1860603670233064992.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality10827519845469076226.prop --nowitness
Loading property file /tmp/ReachabilityCardinality10827519845469076226.prop.
An unexpected exception occurred : Overflow error when converting initial marking. Please recompile libDDD with larger DDD::val_t definition.
Built C files in :
/tmp/ltsmin2385199820955585518
[2022-06-12 21:24:45] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2385199820955585518
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin2385199820955585518]
Compilation finished in 291 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin2385199820955585518]
Link finished in 57 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, -i, KanbanPT50000ReachabilityCardinality10==true], workingDir=/tmp/ltsmin2385199820955585518]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Incomplete random walk after 1000022 steps, including 2 resets, run finished after 145 ms. (steps per millisecond=6896 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 327 ms. (steps per millisecond=3058 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 312 ms. (steps per millisecond=3205 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 40395845 steps, run timeout after 30001 ms. (steps per millisecond=1346 ) properties seen :{}
Probabilistic random walk after 40395845 steps, saw 23102903 distinct states, run finished after 30002 ms. (steps per millisecond=1346 ) properties seen :{}
Running SMT prover for 2 properties.
// Phase 1: matrix 8 rows 8 cols
[2022-06-12 21:25:31] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-12 21:25:31] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-12 21:25:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:25:31] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2022-06-12 21:25:31] [INFO ] Computed and/alt/rep : 7/12/7 causal constraints (skipped 0 transitions) in 10 ms.
[2022-06-12 21:25:31] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:25:31] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-12 21:25:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:25:31] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2022-06-12 21:25:31] [INFO ] Computed and/alt/rep : 7/12/7 causal constraints (skipped 0 transitions) in 2 ms.
[2022-06-12 21:25:31] [INFO ] Added : 6 causal constraints over 2 iterations in 21 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 1 ms.
[2022-06-12 21:25:31] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2022-06-12 21:25:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:25:31] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2022-06-12 21:25:31] [INFO ] Computed and/alt/rep : 7/12/7 causal constraints (skipped 0 transitions) in 0 ms.
[2022-06-12 21:25:31] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:25:31] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-12 21:25:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:25:31] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2022-06-12 21:25:31] [INFO ] Computed and/alt/rep : 7/12/7 causal constraints (skipped 0 transitions) in 1 ms.
[2022-06-12 21:25:31] [INFO ] Added : 4 causal constraints over 2 iterations in 5 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 1 ms.
Finished Parikh walk after 241591 steps, including 0 resets, run visited all 2 properties in 106 ms. (steps per millisecond=2279 )
FORMULA Kanban-PT-50000-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Kanban-PT-50000-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.

BK_STOP 1655069132532

--------------------
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="Kanban-PT-50000"
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 Kanban-PT-50000, 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 r143-tall-165271830200125"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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