Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r140-tall-162089128200614.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is Peterson-PT-3, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r140-tall-162089128200614
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.9M
-rw-r--r-- 1 mcc users 132K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 555K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 104K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 464K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 16K Mar 28 16:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 59K Mar 28 16:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 21K Mar 28 16:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 77K Mar 28 16:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 19K Mar 27 06:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 59K Mar 27 06:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 17K Mar 25 08:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Mar 25 08:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 4.5K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 9.6K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 2 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 253K May 5 16:51 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 Peterson-PT-3-ReachabilityCardinality-00
FORMULA_NAME Peterson-PT-3-ReachabilityCardinality-01
FORMULA_NAME Peterson-PT-3-ReachabilityCardinality-02
FORMULA_NAME Peterson-PT-3-ReachabilityCardinality-03
FORMULA_NAME Peterson-PT-3-ReachabilityCardinality-04
FORMULA_NAME Peterson-PT-3-ReachabilityCardinality-05
FORMULA_NAME Peterson-PT-3-ReachabilityCardinality-06
FORMULA_NAME Peterson-PT-3-ReachabilityCardinality-07
FORMULA_NAME Peterson-PT-3-ReachabilityCardinality-08
FORMULA_NAME Peterson-PT-3-ReachabilityCardinality-09
FORMULA_NAME Peterson-PT-3-ReachabilityCardinality-10
FORMULA_NAME Peterson-PT-3-ReachabilityCardinality-11
FORMULA_NAME Peterson-PT-3-ReachabilityCardinality-12
FORMULA_NAME Peterson-PT-3-ReachabilityCardinality-13
FORMULA_NAME Peterson-PT-3-ReachabilityCardinality-14
FORMULA_NAME Peterson-PT-3-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1621019710134

Running Version 0
[2021-05-14 19:15:12] [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]
[2021-05-14 19:15:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-14 19:15:12] [INFO ] Load time of PNML (sax parser for PT used): 65 ms
[2021-05-14 19:15:12] [INFO ] Transformed 244 places.
[2021-05-14 19:15:12] [INFO ] Transformed 332 transitions.
[2021-05-14 19:15:12] [INFO ] Found NUPN structural information;
[2021-05-14 19:15:12] [INFO ] Parsed PT model containing 244 places and 332 transitions in 106 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 16 ms.
Working with output stream class java.io.PrintStream
FORMULA Peterson-PT-3-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 15) seen :5
FORMULA Peterson-PT-3-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-3-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-3-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-3-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-3-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 10) 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 10) 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
[2021-05-14 19:15:12] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 244 cols
[2021-05-14 19:15:12] [INFO ] Computed 15 place invariants in 22 ms
[2021-05-14 19:15:13] [INFO ] [Real]Absence check using 11 positive place invariants in 11 ms returned sat
[2021-05-14 19:15:13] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 1 ms returned sat
[2021-05-14 19:15:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 19:15:13] [INFO ] [Real]Absence check using state equation in 79 ms returned sat
[2021-05-14 19:15:13] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 19:15:13] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned unsat
[2021-05-14 19:15:13] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned unsat
[2021-05-14 19:15:13] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2021-05-14 19:15:13] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 1 ms returned sat
[2021-05-14 19:15:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 19:15:13] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2021-05-14 19:15:13] [INFO ] State equation strengthened by 66 read => feed constraints.
[2021-05-14 19:15:13] [INFO ] [Real]Added 66 Read/Feed constraints in 11 ms returned sat
[2021-05-14 19:15:13] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 19:15:13] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2021-05-14 19:15:13] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2021-05-14 19:15:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 19:15:13] [INFO ] [Nat]Absence check using state equation in 80 ms returned sat
[2021-05-14 19:15:13] [INFO ] [Nat]Added 66 Read/Feed constraints in 8 ms returned sat
[2021-05-14 19:15:13] [INFO ] Deduced a trap composed of 27 places in 96 ms of which 3 ms to minimize.
[2021-05-14 19:15:13] [INFO ] Deduced a trap composed of 27 places in 76 ms of which 2 ms to minimize.
[2021-05-14 19:15:13] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 1 ms to minimize.
[2021-05-14 19:15:14] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 1 ms to minimize.
[2021-05-14 19:15:14] [INFO ] Deduced a trap composed of 45 places in 57 ms of which 1 ms to minimize.
[2021-05-14 19:15:14] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 1 ms to minimize.
[2021-05-14 19:15:14] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 1 ms to minimize.
[2021-05-14 19:15:14] [INFO ] Deduced a trap composed of 45 places in 38 ms of which 0 ms to minimize.
[2021-05-14 19:15:14] [INFO ] Deduced a trap composed of 45 places in 54 ms of which 0 ms to minimize.
[2021-05-14 19:15:14] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 0 ms to minimize.
[2021-05-14 19:15:14] [INFO ] Deduced a trap composed of 48 places in 38 ms of which 0 ms to minimize.
[2021-05-14 19:15:14] [INFO ] Deduced a trap composed of 33 places in 45 ms of which 1 ms to minimize.
[2021-05-14 19:15:14] [INFO ] Deduced a trap composed of 29 places in 28 ms of which 0 ms to minimize.
[2021-05-14 19:15:14] [INFO ] Deduced a trap composed of 45 places in 48 ms of which 1 ms to minimize.
[2021-05-14 19:15:14] [INFO ] Deduced a trap composed of 34 places in 39 ms of which 1 ms to minimize.
[2021-05-14 19:15:14] [INFO ] Deduced a trap composed of 52 places in 35 ms of which 0 ms to minimize.
[2021-05-14 19:15:14] [INFO ] Deduced a trap composed of 56 places in 39 ms of which 0 ms to minimize.
[2021-05-14 19:15:14] [INFO ] Deduced a trap composed of 53 places in 33 ms of which 0 ms to minimize.
[2021-05-14 19:15:14] [INFO ] Deduced a trap composed of 88 places in 40 ms of which 0 ms to minimize.
[2021-05-14 19:15:14] [INFO ] Deduced a trap composed of 56 places in 33 ms of which 0 ms to minimize.
[2021-05-14 19:15:15] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 1 ms to minimize.
[2021-05-14 19:15:15] [INFO ] Deduced a trap composed of 49 places in 33 ms of which 1 ms to minimize.
[2021-05-14 19:15:15] [INFO ] Deduced a trap composed of 64 places in 33 ms of which 0 ms to minimize.
[2021-05-14 19:15:15] [INFO ] Deduced a trap composed of 38 places in 37 ms of which 0 ms to minimize.
[2021-05-14 19:15:15] [INFO ] Deduced a trap composed of 50 places in 43 ms of which 1 ms to minimize.
[2021-05-14 19:15:15] [INFO ] Deduced a trap composed of 49 places in 37 ms of which 0 ms to minimize.
[2021-05-14 19:15:15] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 0 ms to minimize.
[2021-05-14 19:15:15] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 0 ms to minimize.
[2021-05-14 19:15:15] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2021-05-14 19:15:16] [INFO ] Deduced a trap composed of 31 places in 26 ms of which 1 ms to minimize.
[2021-05-14 19:15:16] [INFO ] Deduced a trap composed of 31 places in 42 ms of which 0 ms to minimize.
[2021-05-14 19:15:16] [INFO ] Deduced a trap composed of 56 places in 36 ms of which 1 ms to minimize.
[2021-05-14 19:15:18] [INFO ] Deduced a trap composed of 2 places in 177 ms of which 1 ms to minimize.
[2021-05-14 19:15:18] [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 2
[2021-05-14 19:15:18] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned unsat
[2021-05-14 19:15:18] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2021-05-14 19:15:18] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 1 ms returned sat
[2021-05-14 19:15:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 19:15:18] [INFO ] [Real]Absence check using state equation in 64 ms returned sat
[2021-05-14 19:15:18] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 19:15:18] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2021-05-14 19:15:18] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 1 ms returned sat
[2021-05-14 19:15:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 19:15:19] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2021-05-14 19:15:19] [INFO ] [Nat]Added 66 Read/Feed constraints in 10 ms returned sat
[2021-05-14 19:15:19] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 0 ms to minimize.
[2021-05-14 19:15:19] [INFO ] Deduced a trap composed of 13 places in 94 ms of which 1 ms to minimize.
[2021-05-14 19:15:19] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 1 ms to minimize.
[2021-05-14 19:15:19] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 0 ms to minimize.
[2021-05-14 19:15:19] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 0 ms to minimize.
[2021-05-14 19:15:19] [INFO ] Deduced a trap composed of 29 places in 69 ms of which 0 ms to minimize.
[2021-05-14 19:15:19] [INFO ] Deduced a trap composed of 35 places in 69 ms of which 1 ms to minimize.
[2021-05-14 19:15:19] [INFO ] Deduced a trap composed of 27 places in 69 ms of which 2 ms to minimize.
[2021-05-14 19:15:19] [INFO ] Deduced a trap composed of 31 places in 68 ms of which 0 ms to minimize.
[2021-05-14 19:15:19] [INFO ] Deduced a trap composed of 49 places in 68 ms of which 0 ms to minimize.
[2021-05-14 19:15:19] [INFO ] Deduced a trap composed of 52 places in 56 ms of which 0 ms to minimize.
[2021-05-14 19:15:19] [INFO ] Deduced a trap composed of 34 places in 39 ms of which 1 ms to minimize.
[2021-05-14 19:15:20] [INFO ] Deduced a trap composed of 56 places in 43 ms of which 0 ms to minimize.
[2021-05-14 19:15:20] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1026 ms
[2021-05-14 19:15:20] [INFO ] Computed and/alt/rep : 283/461/283 causal constraints (skipped 21 transitions) in 21 ms.
[2021-05-14 19:15:21] [INFO ] Deduced a trap composed of 35 places in 46 ms of which 0 ms to minimize.
[2021-05-14 19:15:21] [INFO ] Deduced a trap composed of 94 places in 64 ms of which 0 ms to minimize.
[2021-05-14 19:15:21] [INFO ] Deduced a trap composed of 38 places in 28 ms of which 1 ms to minimize.
[2021-05-14 19:15:21] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 224 ms
[2021-05-14 19:15:21] [INFO ] Added : 251 causal constraints over 51 iterations in 1257 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 8 ms.
[2021-05-14 19:15:21] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2021-05-14 19:15:21] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 1 ms returned sat
[2021-05-14 19:15:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 19:15:21] [INFO ] [Real]Absence check using state equation in 87 ms returned sat
[2021-05-14 19:15:21] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 19:15:21] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2021-05-14 19:15:21] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 1 ms returned sat
[2021-05-14 19:15:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 19:15:21] [INFO ] [Nat]Absence check using state equation in 91 ms returned sat
[2021-05-14 19:15:21] [INFO ] [Nat]Added 66 Read/Feed constraints in 9 ms returned sat
[2021-05-14 19:15:21] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 1 ms to minimize.
[2021-05-14 19:15:21] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 1 ms to minimize.
[2021-05-14 19:15:21] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 0 ms to minimize.
[2021-05-14 19:15:21] [INFO ] Deduced a trap composed of 27 places in 64 ms of which 0 ms to minimize.
[2021-05-14 19:15:22] [INFO ] Deduced a trap composed of 35 places in 63 ms of which 0 ms to minimize.
[2021-05-14 19:15:22] [INFO ] Deduced a trap composed of 27 places in 58 ms of which 1 ms to minimize.
[2021-05-14 19:15:22] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 0 ms to minimize.
[2021-05-14 19:15:22] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 0 ms to minimize.
[2021-05-14 19:15:22] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 597 ms
[2021-05-14 19:15:22] [INFO ] Computed and/alt/rep : 283/461/283 causal constraints (skipped 21 transitions) in 19 ms.
[2021-05-14 19:15:23] [INFO ] Added : 230 causal constraints over 46 iterations in 845 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 6 ms.
[2021-05-14 19:15:23] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2021-05-14 19:15:23] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 1 ms returned sat
[2021-05-14 19:15:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 19:15:23] [INFO ] [Real]Absence check using state equation in 78 ms returned sat
[2021-05-14 19:15:23] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 19:15:23] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2021-05-14 19:15:23] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2021-05-14 19:15:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 19:15:23] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2021-05-14 19:15:23] [INFO ] [Nat]Added 66 Read/Feed constraints in 7 ms returned sat
[2021-05-14 19:15:23] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 1 ms to minimize.
[2021-05-14 19:15:23] [INFO ] Deduced a trap composed of 31 places in 52 ms of which 0 ms to minimize.
[2021-05-14 19:15:23] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 0 ms to minimize.
[2021-05-14 19:15:23] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 0 ms to minimize.
[2021-05-14 19:15:23] [INFO ] Deduced a trap composed of 52 places in 52 ms of which 0 ms to minimize.
[2021-05-14 19:15:23] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 0 ms to minimize.
[2021-05-14 19:15:23] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 0 ms to minimize.
[2021-05-14 19:15:23] [INFO ] Deduced a trap composed of 34 places in 37 ms of which 1 ms to minimize.
[2021-05-14 19:15:23] [INFO ] Deduced a trap composed of 29 places in 59 ms of which 0 ms to minimize.
[2021-05-14 19:15:24] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 9 ms to minimize.
[2021-05-14 19:15:24] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
[2021-05-14 19:15:24] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 1 ms to minimize.
[2021-05-14 19:15:24] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 0 ms to minimize.
[2021-05-14 19:15:24] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 0 ms to minimize.
[2021-05-14 19:15:24] [INFO ] Deduced a trap composed of 70 places in 37 ms of which 1 ms to minimize.
[2021-05-14 19:15:24] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 936 ms
[2021-05-14 19:15:24] [INFO ] Computed and/alt/rep : 283/461/283 causal constraints (skipped 21 transitions) in 16 ms.
[2021-05-14 19:15:25] [INFO ] Deduced a trap composed of 31 places in 51 ms of which 0 ms to minimize.
[2021-05-14 19:15:25] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 0 ms to minimize.
[2021-05-14 19:15:25] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 1 ms to minimize.
[2021-05-14 19:15:25] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 211 ms
[2021-05-14 19:15:25] [INFO ] Added : 228 causal constraints over 46 iterations in 1044 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 5 ms.
[2021-05-14 19:15:25] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2021-05-14 19:15:25] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 1 ms returned sat
[2021-05-14 19:15:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 19:15:25] [INFO ] [Real]Absence check using state equation in 66 ms returned sat
[2021-05-14 19:15:25] [INFO ] [Real]Added 66 Read/Feed constraints in 8 ms returned sat
[2021-05-14 19:15:25] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 19:15:25] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2021-05-14 19:15:25] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 1 ms returned sat
[2021-05-14 19:15:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 19:15:25] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2021-05-14 19:15:25] [INFO ] [Nat]Added 66 Read/Feed constraints in 8 ms returned sat
[2021-05-14 19:15:25] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 0 ms to minimize.
[2021-05-14 19:15:25] [INFO ] Deduced a trap composed of 27 places in 55 ms of which 0 ms to minimize.
[2021-05-14 19:15:25] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 0 ms to minimize.
[2021-05-14 19:15:25] [INFO ] Deduced a trap composed of 30 places in 53 ms of which 1 ms to minimize.
[2021-05-14 19:15:25] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 1 ms to minimize.
[2021-05-14 19:15:26] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 0 ms to minimize.
[2021-05-14 19:15:26] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 1 ms to minimize.
[2021-05-14 19:15:26] [INFO ] Deduced a trap composed of 49 places in 48 ms of which 1 ms to minimize.
[2021-05-14 19:15:26] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2021-05-14 19:15:26] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 568 ms
[2021-05-14 19:15:26] [INFO ] Computed and/alt/rep : 283/461/283 causal constraints (skipped 21 transitions) in 17 ms.
[2021-05-14 19:15:27] [INFO ] Added : 254 causal constraints over 51 iterations in 867 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 4 ms.
[2021-05-14 19:15:27] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2021-05-14 19:15:27] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 1 ms returned sat
[2021-05-14 19:15:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 19:15:27] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2021-05-14 19:15:27] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 19:15:27] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned unsat
FORMULA Peterson-PT-3-ReachabilityCardinality-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Peterson-PT-3-ReachabilityCardinality-07 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Peterson-PT-3-ReachabilityCardinality-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Peterson-PT-3-ReachabilityCardinality-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Peterson-PT-3-ReachabilityCardinality-00 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 10 Parikh solutions to 5 different solutions.
Incomplete Parikh walk after 63000 steps, including 937 resets, run finished after 253 ms. (steps per millisecond=249 ) properties (out of 5) seen :0 could not realise parikh vector
Incomplete Parikh walk after 68400 steps, including 896 resets, run finished after 223 ms. (steps per millisecond=306 ) properties (out of 5) seen :0 could not realise parikh vector
Incomplete Parikh walk after 41600 steps, including 687 resets, run finished after 135 ms. (steps per millisecond=308 ) properties (out of 5) seen :0 could not realise parikh vector
Incomplete Parikh walk after 64100 steps, including 959 resets, run finished after 210 ms. (steps per millisecond=305 ) properties (out of 5) seen :1 could not realise parikh vector
FORMULA Peterson-PT-3-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 110 out of 244 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 244/244 places, 332/332 transitions.
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 244 transition count 297
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 70 place count 209 transition count 297
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 70 place count 209 transition count 293
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 78 place count 205 transition count 293
Applied a total of 78 rules in 33 ms. Remains 205 /244 variables (removed 39) and now considering 293/332 (removed 39) transitions.
Finished structural reductions, in 1 iterations. Remains : 205/244 places, 293/332 transitions.
[2021-05-14 19:15:28] [INFO ] Flatten gal took : 52 ms
[2021-05-14 19:15:28] [INFO ] Flatten gal took : 19 ms
[2021-05-14 19:15:28] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8371704392292341756.gal : 12 ms
[2021-05-14 19:15:28] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14232776544539725442.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/ReachabilityCardinality8371704392292341756.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality14232776544539725442.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/ReachabilityCardinality8371704392292341756.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality14232776544539725442.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality14232776544539725442.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :2 after 6
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :6 after 7
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :7 after 8
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :8 after 30
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :30 after 51
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :51 after 138
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :138 after 422
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :422 after 1565
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :1565 after 3679
Reachability property Peterson-PT-3-ReachabilityCardinality-06 is true.
FORMULA Peterson-PT-3-ReachabilityCardinality-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,3 properties remain. new max is 2048
SDD size :3679 after 19782
SDD proceeding with computation,3 properties remain. new max is 4096
SDD size :19782 after 35447
SDD proceeding with computation,3 properties remain. new max is 8192
SDD size :35447 after 77996
SDD proceeding with computation,3 properties remain. new max is 16384
SDD size :77996 after 145882
Invariant property Peterson-PT-3-ReachabilityCardinality-09 does not hold.
FORMULA Peterson-PT-3-ReachabilityCardinality-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :145882 after 314483
Invariant property Peterson-PT-3-ReachabilityCardinality-10 does not hold.
FORMULA Peterson-PT-3-ReachabilityCardinality-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :314483 after 594156
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :594156 after 923019
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,1.46268e+06,12.7283,320608,2,53141,25,784992,7,0,1122,1.24167e+06,0
Total reachable state count : 1462675

Verifying 4 reachability properties.
Reachability property Peterson-PT-3-ReachabilityCardinality-03 does not hold.
FORMULA Peterson-PT-3-ReachabilityCardinality-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
No reachable states exhibit your property : Peterson-PT-3-ReachabilityCardinality-03

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
Peterson-PT-3-ReachabilityCardinality-03,0,12.7621,320608,1,0,25,784992,7,0,1190,1.24167e+06,0
Reachability property Peterson-PT-3-ReachabilityCardinality-06 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
Peterson-PT-3-ReachabilityCardinality-06,656,12.9043,320608,2,4989,25,784992,8,0,1583,1.24167e+06,0
Invariant property Peterson-PT-3-ReachabilityCardinality-09 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
Peterson-PT-3-ReachabilityCardinality-09,384,12.9339,320608,2,631,25,784992,9,0,1600,1.24167e+06,0
Invariant property Peterson-PT-3-ReachabilityCardinality-10 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
Peterson-PT-3-ReachabilityCardinality-10,20624,12.9375,320608,2,7866,25,784992,10,0,1610,1.24167e+06,0
All properties solved without resorting to model-checking.

BK_STOP 1621019743363

--------------------
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="Peterson-PT-3"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itstools"
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 itstools"
echo " Input is Peterson-PT-3, 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 r140-tall-162089128200614"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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