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.r180-tall-165277028000518.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 PolyORBNT-PT-S05J40, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r180-tall-165277028000518
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.9M
-rw-r--r-- 1 mcc users 27K Apr 30 03:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 146K Apr 30 03:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 57K Apr 30 03:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 256K Apr 30 03:07 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 8.9K May 9 08:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 33K May 9 08:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 13K May 9 08:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 58K May 9 08:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.5K May 9 08:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.4K May 9 08:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 7 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 1.3M 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

FORMULA_NAME StableMarking

=== Now, execution of the tool begins

BK_START 1652835435992

Running Version 0
[2022-05-18 00:57:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -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, 1800]
[2022-05-18 00:57:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-18 00:57:17] [INFO ] Load time of PNML (sax parser for PT used): 141 ms
[2022-05-18 00:57:17] [INFO ] Transformed 629 places.
[2022-05-18 00:57:17] [INFO ] Transformed 1590 transitions.
[2022-05-18 00:57:17] [INFO ] Parsed PT model containing 629 places and 1590 transitions in 192 ms.
Structural test allowed to assert that 2 places are NOT stable. Took 11 ms.
Ensure Unique test removed 655 transitions
Reduce redundant transitions removed 655 transitions.
Incomplete random walk after 10000 steps, including 706 resets, run finished after 258 ms. (steps per millisecond=38 ) properties (out of 627) seen :371
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 256) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 256) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 256) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 256) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=100 ) properties (out of 256) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 256) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 256) seen :0
Incomplete Best-First random walk after 100 steps, including 3 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 256) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=100 ) properties (out of 256) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 256) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 256) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 256) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=100 ) properties (out of 256) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 256) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 256) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 256) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 256) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=100 ) properties (out of 256) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 256) seen :0
Incomplete Best-First random walk after 100 steps, including 3 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 256) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 256) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 256) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 256) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 256) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 256) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 256) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 256) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 256) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 256) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 256) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 256) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=100 ) properties (out of 256) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 256) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 256) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 256) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 256) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=16 ) properties (out of 256) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=100 ) properties (out of 256) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=100 ) properties (out of 256) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 256) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 256) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 256) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 256) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 256) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 256) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 256) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=100 ) properties (out of 256) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 256) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 256) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 256) seen :0
Running SMT prover for 256 properties.
[2022-05-18 00:57:18] [INFO ] Flow matrix only has 931 transitions (discarded 4 similar events)
// Phase 1: matrix 931 rows 629 cols
[2022-05-18 00:57:18] [INFO ] Computed 102 place invariants in 81 ms
[2022-05-18 00:57:21] [INFO ] SMT Verify possible in real domain returnedunsat :0 sat :0 real:256
[2022-05-18 00:57:24] [INFO ] [Nat]Absence check using 76 positive place invariants in 28 ms returned sat
[2022-05-18 00:57:24] [INFO ] [Nat]Absence check using 76 positive and 26 generalized place invariants in 35 ms returned sat
[2022-05-18 00:57:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 00:57:45] [INFO ] [Nat]Absence check using state equation in 17870 ms returned unsat :0 sat :256
[2022-05-18 00:57:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-18 00:57:45] [INFO ] [Nat]Added 1 Read/Feed constraints in 10 ms returned sat
0timeout
^^^^^^^^
(error "Invalid token: 0timeout")
Attempting to minimize the solution found.
Minimization took 1 ms.
[2022-05-18 00:57:46] [INFO ] SMT Verify possible in nat domain returned unsat :0 sat :256
Fused 256 Parikh solutions to 253 different solutions.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
Incomplete Parikh walk after 82 steps, including 41 resets, run finished after 3 ms. (steps per millisecond=27 ) properties (out of 256) seen :0 could not realise parikh vector
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
Incomplete Parikh walk after 133 steps, including 66 resets, run finished after 3 ms. (steps per millisecond=44 ) properties (out of 256) seen :0 could not realise parikh vector
Incomplete Parikh walk after 133 steps, including 66 resets, run finished after 3 ms. (steps per millisecond=44 ) properties (out of 256) seen :0 could not realise parikh vector
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
Incomplete Parikh walk after 109 steps, including 27 resets, run finished after 3 ms. (steps per millisecond=36 ) properties (out of 256) seen :0 could not realise parikh vector
Incomplete Parikh walk after 109 steps, including 27 resets, run finished after 2 ms. (steps per millisecond=54 ) properties (out of 256) seen :0 could not realise parikh vector
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
Incomplete Parikh walk after 43 steps, including 21 resets, run finished after 2 ms. (steps per millisecond=21 ) properties (out of 256) seen :0 could not realise parikh vector
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
Support contains 256 out of 629 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 629/629 places, 935/935 transitions.
Ensure Unique test removed 5 places
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 624 transition count 920
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 35 place count 609 transition count 920
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 35 place count 609 transition count 905
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 65 place count 594 transition count 905
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 66 place count 593 transition count 904
Iterating global reduction 2 with 1 rules applied. Total rules applied 67 place count 593 transition count 904
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 71 place count 591 transition count 902
Applied a total of 71 rules in 168 ms. Remains 591 /629 variables (removed 38) and now considering 902/935 (removed 33) transitions.
[2022-05-18 00:57:47] [INFO ] Flow matrix only has 898 transitions (discarded 4 similar events)
// Phase 1: matrix 898 rows 591 cols
[2022-05-18 00:57:47] [INFO ] Computed 97 place invariants in 67 ms
[2022-05-18 00:57:48] [INFO ] Dead Transitions using invariants and state equation in 888 ms returned [567, 568, 569, 570, 572, 573, 574, 575, 576, 577, 578, 579, 580, 581, 582, 583, 585, 588, 589, 590, 591, 592, 594, 599, 600, 601, 602, 603, 605, 606, 607, 609, 611, 612, 613, 614, 615, 616, 618, 619, 621, 622, 623, 624, 625, 626, 628, 629, 630, 632, 633, 635, 636, 638, 639, 640, 641, 642, 643, 645, 648, 649, 650, 651, 653, 655, 656, 657, 658, 660, 662, 663, 664, 665, 666, 667, 668, 669, 670, 671, 672, 673, 674, 675, 676, 677, 678, 679, 680, 682, 683, 685, 686, 687, 690]
Found 95 dead transitions using SMT.
Drop transitions removed 95 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 95 transitions :[690, 687, 686, 685, 683, 682, 680, 679, 678, 677, 676, 675, 674, 673, 672, 671, 670, 669, 668, 667, 666, 665, 664, 663, 662, 660, 658, 657, 656, 655, 653, 651, 650, 649, 648, 645, 643, 642, 641, 640, 639, 638, 636, 635, 633, 632, 630, 629, 628, 626, 625, 624, 623, 622, 621, 619, 618, 616, 615, 614, 613, 612, 611, 609, 607, 606, 605, 603, 602, 601, 600, 599, 594, 592, 591, 590, 589, 588, 585, 583, 582, 581, 580, 579, 578, 577, 576, 575, 574, 573, 572, 570, 569, 568, 567]
Starting structural reductions, iteration 1 : 591/629 places, 807/935 transitions.
Applied a total of 0 rules in 33 ms. Remains 591 /591 variables (removed 0) and now considering 807/807 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 591/629 places, 807/935 transitions.
[2022-05-18 00:57:48] [INFO ] Flatten gal took : 119 ms
[2022-05-18 00:57:48] [INFO ] Flatten gal took : 66 ms
[2022-05-18 00:57:48] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality572859840576122997.gal : 23 ms
[2022-05-18 00:57:48] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12403105591875611081.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/ReachabilityCardinality572859840576122997.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality12403105591875611081.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/ReachabilityCardinality572859840576122997.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality12403105591875611081.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality12403105591875611081.prop.
SDD proceeding with computation,256 properties remain. new max is 4
SDD size :1 after 16
SDD proceeding with computation,256 properties remain. new max is 8
SDD size :16 after 32
SDD proceeding with computation,256 properties remain. new max is 16
SDD size :32 after 81
SDD proceeding with computation,256 properties remain. new max is 32
SDD size :81 after 94
Invariant property smplace_614 does not hold.
Invariant property smplace_600 does not hold.
Invariant property smplace_558 does not hold.
Invariant property smplace_489 does not hold.
Invariant property smplace_453 does not hold.
Invariant property smplace_450 does not hold.
Invariant property smplace_436 does not hold.
Invariant property smplace_418 does not hold.
Invariant property smplace_335 does not hold.
Invariant property smplace_333 does not hold.
Invariant property smplace_318 does not hold.
Invariant property smplace_294 does not hold.
Invariant property smplace_286 does not hold.
Invariant property smplace_278 does not hold.
Invariant property smplace_273 does not hold.
Invariant property smplace_236 does not hold.
Invariant property smplace_209 does not hold.
Invariant property smplace_184 does not hold.
Invariant property smplace_176 does not hold.
Invariant property smplace_175 does not hold.
Invariant property smplace_154 does not hold.
Invariant property smplace_119 does not hold.
Invariant property smplace_117 does not hold.
Invariant property smplace_104 does not hold.
Invariant property smplace_88 does not hold.
Invariant property smplace_65 does not hold.
Invariant property smplace_57 does not hold.
Invariant property smplace_32 does not hold.
SDD proceeding with computation,228 properties remain. new max is 32
SDD size :94 after 12684
Invariant property smplace_594 does not hold.
Invariant property smplace_553 does not hold.
Invariant property smplace_493 does not hold.
Invariant property smplace_440 does not hold.
Invariant property smplace_399 does not hold.
Invariant property smplace_392 does not hold.
Invariant property smplace_311 does not hold.
Invariant property smplace_237 does not hold.
Invariant property smplace_187 does not hold.
Invariant property smplace_128 does not hold.
Invariant property smplace_100 does not hold.
Invariant property smplace_39 does not hold.
SDD proceeding with computation,216 properties remain. new max is 32
Detected timeout of ITS tools.
[2022-05-18 00:58:03] [INFO ] Flatten gal took : 64 ms
[2022-05-18 00:58:03] [INFO ] Applying decomposition
[2022-05-18 00:58:03] [INFO ] Flatten gal took : 51 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/graph15004490743647581432.txt, -o, /tmp/graph15004490743647581432.bin, -w, /tmp/graph15004490743647581432.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/graph15004490743647581432.bin, -l, -1, -v, -w, /tmp/graph15004490743647581432.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-05-18 00:58:03] [INFO ] Decomposing Gal with order
[2022-05-18 00:58:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-18 00:58:04] [INFO ] Removed a total of 844 redundant transitions.
[2022-05-18 00:58:04] [INFO ] Flatten gal took : 554 ms
[2022-05-18 00:58:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 307 labels/synchronizations in 85 ms.
[2022-05-18 00:58:04] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4383391036381587540.gal : 23 ms
[2022-05-18 00:58:04] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2372864931033836221.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/ReachabilityCardinality4383391036381587540.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality2372864931033836221.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/ReachabilityCardinality4383391036381587540.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality2372864931033836221.prop --nowitness
Loading property file /tmp/ReachabilityCardinality2372864931033836221.prop.
SDD proceeding with computation,216 properties remain. new max is 4
SDD size :1 after 66
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1391399890369564242
[2022-05-18 00:58:19] [INFO ] Built C files in 49ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1391399890369564242
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/ltsmin1391399890369564242]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running 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/ltsmin1391399890369564242] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running 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/ltsmin1391399890369564242] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Finished random walk after 12924 steps, including 645 resets, run visited all 216 properties in 146 ms. (steps per millisecond=88 )
Able to resolve query StableMarking after proving 628 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK MARKED_SUFFIX_TEST DECISION_DIAGRAMS COLLATERAL_PROCESSING TOPOLOGICAL

BK_STOP 1652835502117

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ StableMarking = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution StableMarking -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ 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 StableMarking -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 1800 -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="PolyORBNT-PT-S05J40"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="gold2021"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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 PolyORBNT-PT-S05J40, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r180-tall-165277028000518"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-PT-S05J40.tgz
mv PolyORBNT-PT-S05J40 execution
cd execution
if [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "UpperBounds" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] || [ "StableMarking" = "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 [ "StableMarking" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "StableMarking" != "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 "StableMarking.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property StableMarking.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "StableMarking.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 '' StableMarking.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] ; then
echo "FORMULA_NAME StableMarking"
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 ;