fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r060-tall-165254772300622
Last Updated
Jun 22, 2022

About the Execution of ITS-Tools for Dekker-PT-050

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
5353.436 249591.00 421854.00 405.30 TTFFFTTFTFFFTFTF normal

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.r060-tall-165254772300622.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 itstools
Input is Dekker-PT-050, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r060-tall-165254772300622
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.1M
-rw-r--r-- 1 mcc users 8.2K Apr 30 05:32 CTLCardinality.txt
-rw-r--r-- 1 mcc users 91K Apr 30 05:32 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Apr 30 05:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Apr 30 05:23 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K May 9 07:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 07:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 9 07:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 07:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 30 05:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 158K Apr 30 05:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Apr 30 05:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 96K Apr 30 05:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 07:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 9 07:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 1.5M May 10 09:33 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME Dekker-PT-050-ReachabilityCardinality-00
FORMULA_NAME Dekker-PT-050-ReachabilityCardinality-01
FORMULA_NAME Dekker-PT-050-ReachabilityCardinality-02
FORMULA_NAME Dekker-PT-050-ReachabilityCardinality-03
FORMULA_NAME Dekker-PT-050-ReachabilityCardinality-04
FORMULA_NAME Dekker-PT-050-ReachabilityCardinality-05
FORMULA_NAME Dekker-PT-050-ReachabilityCardinality-06
FORMULA_NAME Dekker-PT-050-ReachabilityCardinality-07
FORMULA_NAME Dekker-PT-050-ReachabilityCardinality-08
FORMULA_NAME Dekker-PT-050-ReachabilityCardinality-09
FORMULA_NAME Dekker-PT-050-ReachabilityCardinality-10
FORMULA_NAME Dekker-PT-050-ReachabilityCardinality-11
FORMULA_NAME Dekker-PT-050-ReachabilityCardinality-12
FORMULA_NAME Dekker-PT-050-ReachabilityCardinality-13
FORMULA_NAME Dekker-PT-050-ReachabilityCardinality-14
FORMULA_NAME Dekker-PT-050-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1654188687750

Running Version 202205111006
[2022-06-02 16:51:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-02 16:51:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-02 16:51:29] [INFO ] Load time of PNML (sax parser for PT used): 255 ms
[2022-06-02 16:51:29] [INFO ] Transformed 250 places.
[2022-06-02 16:51:29] [INFO ] Transformed 2600 transitions.
[2022-06-02 16:51:29] [INFO ] Found NUPN structural information;
[2022-06-02 16:51:29] [INFO ] Parsed PT model containing 250 places and 2600 transitions in 380 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 20 ms.
Working with output stream class java.io.PrintStream
FORMULA Dekker-PT-050-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-050-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-050-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-050-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-050-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-050-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 615 ms. (steps per millisecond=16 ) properties (out of 10) seen :1
FORMULA Dekker-PT-050-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 9) 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 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 9) 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 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
[2022-06-02 16:51:30] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 250 cols
[2022-06-02 16:51:30] [INFO ] Computed 150 place invariants in 17 ms
[2022-06-02 16:51:30] [INFO ] After 279ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2022-06-02 16:51:30] [INFO ] [Nat]Absence check using 100 positive place invariants in 20 ms returned sat
[2022-06-02 16:51:30] [INFO ] [Nat]Absence check using 100 positive and 50 generalized place invariants in 8 ms returned sat
[2022-06-02 16:51:31] [INFO ] After 128ms SMT Verify possible using state equation in natural domain returned unsat :7 sat :2
[2022-06-02 16:51:31] [INFO ] State equation strengthened by 50 read => feed constraints.
[2022-06-02 16:51:31] [INFO ] After 76ms SMT Verify possible using 50 Read/Feed constraints in natural domain returned unsat :7 sat :2
[2022-06-02 16:51:31] [INFO ] Deduced a trap composed of 4 places in 149 ms of which 3 ms to minimize.
[2022-06-02 16:51:31] [INFO ] Deduced a trap composed of 4 places in 301 ms of which 2 ms to minimize.
[2022-06-02 16:51:31] [INFO ] Deduced a trap composed of 4 places in 129 ms of which 1 ms to minimize.
[2022-06-02 16:51:31] [INFO ] Deduced a trap composed of 6 places in 114 ms of which 2 ms to minimize.
[2022-06-02 16:51:32] [INFO ] Deduced a trap composed of 4 places in 117 ms of which 0 ms to minimize.
[2022-06-02 16:51:32] [INFO ] Deduced a trap composed of 4 places in 103 ms of which 1 ms to minimize.
[2022-06-02 16:51:32] [INFO ] Deduced a trap composed of 4 places in 96 ms of which 1 ms to minimize.
[2022-06-02 16:51:32] [INFO ] Deduced a trap composed of 4 places in 93 ms of which 0 ms to minimize.
[2022-06-02 16:51:32] [INFO ] Deduced a trap composed of 4 places in 88 ms of which 1 ms to minimize.
[2022-06-02 16:51:32] [INFO ] Deduced a trap composed of 4 places in 88 ms of which 0 ms to minimize.
[2022-06-02 16:51:32] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 0 ms to minimize.
[2022-06-02 16:51:32] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 0 ms to minimize.
[2022-06-02 16:51:32] [INFO ] Deduced a trap composed of 4 places in 83 ms of which 0 ms to minimize.
[2022-06-02 16:51:32] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 0 ms to minimize.
[2022-06-02 16:51:33] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 0 ms to minimize.
[2022-06-02 16:51:33] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1870 ms
[2022-06-02 16:51:33] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 1870 ms
[2022-06-02 16:51:33] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 1 ms to minimize.
[2022-06-02 16:51:33] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 1 ms to minimize.
[2022-06-02 16:51:33] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 1 ms to minimize.
[2022-06-02 16:51:33] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 0 ms to minimize.
[2022-06-02 16:51:33] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 0 ms to minimize.
[2022-06-02 16:51:33] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 0 ms to minimize.
[2022-06-02 16:51:33] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 0 ms to minimize.
[2022-06-02 16:51:33] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 0 ms to minimize.
[2022-06-02 16:51:33] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 0 ms to minimize.
[2022-06-02 16:51:33] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 0 ms to minimize.
[2022-06-02 16:51:34] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 1 ms to minimize.
[2022-06-02 16:51:34] [INFO ] Trap strengthening procedure interrupted after too many repetitions 900 ms
[2022-06-02 16:51:34] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 900 ms
[2022-06-02 16:51:34] [INFO ] After 2895ms SMT Verify possible using trap constraints in natural domain returned unsat :7 sat :2
Attempting to minimize the solution found.
Minimization took 39 ms.
[2022-06-02 16:51:34] [INFO ] After 3221ms SMT Verify possible using all constraints in natural domain returned unsat :7 sat :2
FORMULA Dekker-PT-050-ReachabilityCardinality-14 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Dekker-PT-050-ReachabilityCardinality-12 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Dekker-PT-050-ReachabilityCardinality-08 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Dekker-PT-050-ReachabilityCardinality-06 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Dekker-PT-050-ReachabilityCardinality-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Dekker-PT-050-ReachabilityCardinality-01 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Dekker-PT-050-ReachabilityCardinality-00 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 9 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 5 ms.
Support contains 19 out of 250 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 250/250 places, 2600/2600 transitions.
Applied a total of 0 rules in 217 ms. Remains 250 /250 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 250/250 places, 2600/2600 transitions.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 14926 ms. (steps per millisecond=66 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1805 ms. (steps per millisecond=554 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2205 ms. (steps per millisecond=453 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 5475615 steps, run timeout after 54001 ms. (steps per millisecond=101 ) properties seen :{}
Probabilistic random walk after 5475615 steps, saw 4307141 distinct states, run finished after 54003 ms. (steps per millisecond=101 ) properties seen :0
Running SMT prover for 2 properties.
[2022-06-02 16:52:47] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 250 cols
[2022-06-02 16:52:47] [INFO ] Computed 150 place invariants in 13 ms
[2022-06-02 16:52:47] [INFO ] After 76ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-02 16:52:47] [INFO ] [Nat]Absence check using 100 positive place invariants in 11 ms returned sat
[2022-06-02 16:52:47] [INFO ] [Nat]Absence check using 100 positive and 50 generalized place invariants in 6 ms returned sat
[2022-06-02 16:52:47] [INFO ] After 95ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-02 16:52:47] [INFO ] State equation strengthened by 50 read => feed constraints.
[2022-06-02 16:52:47] [INFO ] After 68ms SMT Verify possible using 50 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-06-02 16:52:47] [INFO ] Deduced a trap composed of 4 places in 106 ms of which 0 ms to minimize.
[2022-06-02 16:52:47] [INFO ] Deduced a trap composed of 4 places in 113 ms of which 1 ms to minimize.
[2022-06-02 16:52:47] [INFO ] Deduced a trap composed of 4 places in 107 ms of which 1 ms to minimize.
[2022-06-02 16:52:48] [INFO ] Deduced a trap composed of 4 places in 101 ms of which 0 ms to minimize.
[2022-06-02 16:52:48] [INFO ] Deduced a trap composed of 4 places in 99 ms of which 0 ms to minimize.
[2022-06-02 16:52:48] [INFO ] Deduced a trap composed of 6 places in 98 ms of which 1 ms to minimize.
[2022-06-02 16:52:48] [INFO ] Deduced a trap composed of 4 places in 117 ms of which 1 ms to minimize.
[2022-06-02 16:52:48] [INFO ] Deduced a trap composed of 4 places in 91 ms of which 2 ms to minimize.
[2022-06-02 16:52:48] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 1 ms to minimize.
[2022-06-02 16:52:48] [INFO ] Deduced a trap composed of 4 places in 94 ms of which 1 ms to minimize.
[2022-06-02 16:52:48] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 0 ms to minimize.
[2022-06-02 16:52:48] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 0 ms to minimize.
[2022-06-02 16:52:49] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 1 ms to minimize.
[2022-06-02 16:52:49] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 0 ms to minimize.
[2022-06-02 16:52:49] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 1 ms to minimize.
[2022-06-02 16:52:49] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 0 ms to minimize.
[2022-06-02 16:52:49] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 0 ms to minimize.
[2022-06-02 16:52:49] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1759 ms
[2022-06-02 16:52:49] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 1759 ms
[2022-06-02 16:52:49] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 0 ms to minimize.
[2022-06-02 16:52:49] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 0 ms to minimize.
[2022-06-02 16:52:49] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 0 ms to minimize.
[2022-06-02 16:52:49] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 0 ms to minimize.
[2022-06-02 16:52:49] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 1 ms to minimize.
[2022-06-02 16:52:49] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 1 ms to minimize.
[2022-06-02 16:52:50] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 0 ms to minimize.
[2022-06-02 16:52:50] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 0 ms to minimize.
[2022-06-02 16:52:50] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 0 ms to minimize.
[2022-06-02 16:52:50] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 0 ms to minimize.
[2022-06-02 16:52:50] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 0 ms to minimize.
[2022-06-02 16:52:50] [INFO ] Trap strengthening procedure interrupted after too many repetitions 883 ms
[2022-06-02 16:52:50] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 884 ms
[2022-06-02 16:52:50] [INFO ] After 2760ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 44 ms.
[2022-06-02 16:52:50] [INFO ] After 3025ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 7 ms.
Support contains 19 out of 250 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 250/250 places, 2600/2600 transitions.
Applied a total of 0 rules in 75 ms. Remains 250 /250 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 250/250 places, 2600/2600 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 250/250 places, 2600/2600 transitions.
Applied a total of 0 rules in 73 ms. Remains 250 /250 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2022-06-02 16:52:50] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 250 cols
[2022-06-02 16:52:50] [INFO ] Computed 150 place invariants in 8 ms
[2022-06-02 16:52:51] [INFO ] Implicit Places using invariants in 1267 ms returned [100, 103, 106, 109, 112, 115, 118, 121, 124, 127, 130, 133, 136, 139, 142, 145, 148, 151, 154, 157, 160, 163, 166, 169, 172, 175, 178, 181, 184, 187, 190, 193, 196, 199, 202, 208, 214, 217, 220, 223, 226, 229, 232, 235, 238, 241, 244]
Discarding 47 places :
Implicit Place search using SMT only with invariants took 1276 ms to find 47 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 203/250 places, 2600/2600 transitions.
Applied a total of 0 rules in 65 ms. Remains 203 /203 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 203/250 places, 2600/2600 transitions.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 15422 ms. (steps per millisecond=64 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1688 ms. (steps per millisecond=592 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2068 ms. (steps per millisecond=483 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 5902434 steps, run timeout after 57001 ms. (steps per millisecond=103 ) properties seen :{}
Probabilistic random walk after 5902434 steps, saw 4650635 distinct states, run finished after 57001 ms. (steps per millisecond=103 ) properties seen :0
Running SMT prover for 2 properties.
[2022-06-02 16:54:08] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 203 cols
[2022-06-02 16:54:08] [INFO ] Computed 103 place invariants in 4 ms
[2022-06-02 16:54:08] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-02 16:54:08] [INFO ] [Nat]Absence check using 100 positive place invariants in 11 ms returned sat
[2022-06-02 16:54:08] [INFO ] [Nat]Absence check using 100 positive and 3 generalized place invariants in 1 ms returned sat
[2022-06-02 16:54:08] [INFO ] After 85ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-02 16:54:08] [INFO ] State equation strengthened by 50 read => feed constraints.
[2022-06-02 16:54:08] [INFO ] After 49ms SMT Verify possible using 50 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-06-02 16:54:08] [INFO ] Deduced a trap composed of 4 places in 89 ms of which 1 ms to minimize.
[2022-06-02 16:54:08] [INFO ] Deduced a trap composed of 4 places in 101 ms of which 1 ms to minimize.
[2022-06-02 16:54:08] [INFO ] Deduced a trap composed of 4 places in 89 ms of which 1 ms to minimize.
[2022-06-02 16:54:08] [INFO ] Deduced a trap composed of 4 places in 92 ms of which 0 ms to minimize.
[2022-06-02 16:54:08] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 1 ms to minimize.
[2022-06-02 16:54:08] [INFO ] Deduced a trap composed of 4 places in 118 ms of which 0 ms to minimize.
[2022-06-02 16:54:09] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 1 ms to minimize.
[2022-06-02 16:54:09] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 0 ms to minimize.
[2022-06-02 16:54:09] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 1 ms to minimize.
[2022-06-02 16:54:09] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 0 ms to minimize.
[2022-06-02 16:54:09] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 2 ms to minimize.
[2022-06-02 16:54:09] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1063 ms
[2022-06-02 16:54:09] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1063 ms
[2022-06-02 16:54:09] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 0 ms to minimize.
[2022-06-02 16:54:09] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 5 ms to minimize.
[2022-06-02 16:54:09] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 2 ms to minimize.
[2022-06-02 16:54:09] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 0 ms to minimize.
[2022-06-02 16:54:09] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 0 ms to minimize.
[2022-06-02 16:54:09] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 0 ms to minimize.
[2022-06-02 16:54:09] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 0 ms to minimize.
[2022-06-02 16:54:10] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 0 ms to minimize.
[2022-06-02 16:54:10] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 1 ms to minimize.
[2022-06-02 16:54:10] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 0 ms to minimize.
[2022-06-02 16:54:10] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 1 ms to minimize.
[2022-06-02 16:54:10] [INFO ] Trap strengthening procedure interrupted after too many repetitions 729 ms
[2022-06-02 16:54:10] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 729 ms
[2022-06-02 16:54:10] [INFO ] After 1888ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 42 ms.
[2022-06-02 16:54:10] [INFO ] After 2117ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 4 ms.
Support contains 19 out of 203 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 203/203 places, 2600/2600 transitions.
Applied a total of 0 rules in 68 ms. Remains 203 /203 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 203/203 places, 2600/2600 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 203/203 places, 2600/2600 transitions.
Applied a total of 0 rules in 64 ms. Remains 203 /203 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2022-06-02 16:54:10] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 203 cols
[2022-06-02 16:54:10] [INFO ] Computed 103 place invariants in 3 ms
[2022-06-02 16:54:10] [INFO ] Implicit Places using invariants in 485 ms returned []
[2022-06-02 16:54:10] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 203 cols
[2022-06-02 16:54:10] [INFO ] Computed 103 place invariants in 1 ms
[2022-06-02 16:54:10] [INFO ] State equation strengthened by 50 read => feed constraints.
[2022-06-02 16:54:11] [INFO ] Implicit Places using invariants and state equation in 626 ms returned []
Implicit Place search using SMT with State Equation took 1114 ms to find 0 implicit places.
[2022-06-02 16:54:11] [INFO ] Redundant transitions in 216 ms returned []
[2022-06-02 16:54:11] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 203 cols
[2022-06-02 16:54:11] [INFO ] Computed 103 place invariants in 3 ms
[2022-06-02 16:54:12] [INFO ] Dead Transitions using invariants and state equation in 806 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 203/203 places, 2600/2600 transitions.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 15923 ms. (steps per millisecond=62 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1781 ms. (steps per millisecond=561 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2220 ms. (steps per millisecond=450 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 5744691 steps, run timeout after 57001 ms. (steps per millisecond=100 ) properties seen :{}
Probabilistic random walk after 5744691 steps, saw 4531190 distinct states, run finished after 57002 ms. (steps per millisecond=100 ) properties seen :0
Running SMT prover for 2 properties.
[2022-06-02 16:55:29] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 203 cols
[2022-06-02 16:55:29] [INFO ] Computed 103 place invariants in 3 ms
[2022-06-02 16:55:29] [INFO ] After 60ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-02 16:55:29] [INFO ] [Nat]Absence check using 100 positive place invariants in 13 ms returned sat
[2022-06-02 16:55:29] [INFO ] [Nat]Absence check using 100 positive and 3 generalized place invariants in 1 ms returned sat
[2022-06-02 16:55:29] [INFO ] After 89ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-02 16:55:29] [INFO ] State equation strengthened by 50 read => feed constraints.
[2022-06-02 16:55:29] [INFO ] After 54ms SMT Verify possible using 50 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-06-02 16:55:29] [INFO ] Deduced a trap composed of 4 places in 90 ms of which 0 ms to minimize.
[2022-06-02 16:55:29] [INFO ] Deduced a trap composed of 4 places in 84 ms of which 1 ms to minimize.
[2022-06-02 16:55:30] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 0 ms to minimize.
[2022-06-02 16:55:30] [INFO ] Deduced a trap composed of 4 places in 92 ms of which 1 ms to minimize.
[2022-06-02 16:55:30] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 0 ms to minimize.
[2022-06-02 16:55:30] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 0 ms to minimize.
[2022-06-02 16:55:30] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 0 ms to minimize.
[2022-06-02 16:55:30] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 0 ms to minimize.
[2022-06-02 16:55:30] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 0 ms to minimize.
[2022-06-02 16:55:30] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 1 ms to minimize.
[2022-06-02 16:55:30] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 1 ms to minimize.
[2022-06-02 16:55:30] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1017 ms
[2022-06-02 16:55:30] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1017 ms
[2022-06-02 16:55:30] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 1 ms to minimize.
[2022-06-02 16:55:30] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 0 ms to minimize.
[2022-06-02 16:55:31] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 1 ms to minimize.
[2022-06-02 16:55:31] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 1 ms to minimize.
[2022-06-02 16:55:31] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 0 ms to minimize.
[2022-06-02 16:55:31] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 1 ms to minimize.
[2022-06-02 16:55:31] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 1 ms to minimize.
[2022-06-02 16:55:31] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 0 ms to minimize.
[2022-06-02 16:55:31] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 0 ms to minimize.
[2022-06-02 16:55:31] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 1 ms to minimize.
[2022-06-02 16:55:31] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 0 ms to minimize.
[2022-06-02 16:55:31] [INFO ] Trap strengthening procedure interrupted after too many repetitions 771 ms
[2022-06-02 16:55:31] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 771 ms
[2022-06-02 16:55:31] [INFO ] After 1882ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 42 ms.
[2022-06-02 16:55:31] [INFO ] After 2106ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 19 out of 203 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 203/203 places, 2600/2600 transitions.
Applied a total of 0 rules in 69 ms. Remains 203 /203 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 203/203 places, 2600/2600 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 203/203 places, 2600/2600 transitions.
Applied a total of 0 rules in 63 ms. Remains 203 /203 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2022-06-02 16:55:31] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 203 cols
[2022-06-02 16:55:31] [INFO ] Computed 103 place invariants in 1 ms
[2022-06-02 16:55:32] [INFO ] Implicit Places using invariants in 457 ms returned []
[2022-06-02 16:55:32] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 203 cols
[2022-06-02 16:55:32] [INFO ] Computed 103 place invariants in 1 ms
[2022-06-02 16:55:32] [INFO ] State equation strengthened by 50 read => feed constraints.
[2022-06-02 16:55:32] [INFO ] Implicit Places using invariants and state equation in 634 ms returned []
Implicit Place search using SMT with State Equation took 1092 ms to find 0 implicit places.
[2022-06-02 16:55:32] [INFO ] Redundant transitions in 62 ms returned []
[2022-06-02 16:55:32] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 203 cols
[2022-06-02 16:55:32] [INFO ] Computed 103 place invariants in 2 ms
[2022-06-02 16:55:33] [INFO ] Dead Transitions using invariants and state equation in 868 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 203/203 places, 2600/2600 transitions.
Graph (complete) has 315 edges and 203 vertex of which 75 are kept as prefixes of interest. Removing 128 places using SCC suffix rule.4 ms
Discarding 128 places :
Also discarding 1664 output transitions
Drop transitions removed 1664 transitions
Ensure Unique test removed 3 places
Ensure Unique test removed 864 transitions
Reduce isomorphic transitions removed 864 transitions.
Iterating post reduction 0 with 867 rules applied. Total rules applied 868 place count 72 transition count 72
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 874 place count 68 transition count 70
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 876 place count 68 transition count 68
Free-agglomeration rule applied 13 times.
Iterating global reduction 2 with 13 rules applied. Total rules applied 889 place count 68 transition count 55
Ensure Unique test removed 13 places
Reduce places removed 26 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 2 with 39 rules applied. Total rules applied 928 place count 42 transition count 42
Applied a total of 928 rules in 59 ms. Remains 42 /203 variables (removed 161) and now considering 42/2600 (removed 2558) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 42 rows 42 cols
[2022-06-02 16:55:33] [INFO ] Computed 21 place invariants in 0 ms
[2022-06-02 16:55:33] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-02 16:55:33] [INFO ] [Nat]Absence check using 21 positive place invariants in 2 ms returned sat
[2022-06-02 16:55:33] [INFO ] After 25ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-02 16:55:33] [INFO ] After 45ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 11 ms.
[2022-06-02 16:55:33] [INFO ] After 84ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2022-06-02 16:55:34] [INFO ] Flatten gal took : 20 ms
[2022-06-02 16:55:34] [INFO ] Flatten gal took : 6 ms
[2022-06-02 16:55:34] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15025482049326946475.gal : 5 ms
[2022-06-02 16:55:34] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1023513535924916016.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15025482049326946475.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1023513535924916016.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality1023513535924916016.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 16
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :16 after 288
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :288 after 110592
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,884736,0.015358,3992,2,67,8,410,8,0,250,177,0
Total reachable state count : 884736

Verifying 2 reachability properties.
Invariant property Dekker-PT-050-ReachabilityCardinality-04 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
Dekker-PT-050-ReachabilityCardinality-04,1152,0.015748,3992,2,56,8,410,8,0,254,177,0
Invariant property Dekker-PT-050-ReachabilityCardinality-11 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
Dekker-PT-050-ReachabilityCardinality-11,9216,0.017147,3992,2,61,8,430,8,0,277,177,0
[2022-06-02 16:55:34] [INFO ] Flatten gal took : 248 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin15893487839513373891
[2022-06-02 16:55:34] [INFO ] Too many transitions (2600) to apply POR reductions. Disabling POR matrices.
[2022-06-02 16:55:34] [INFO ] Built C files in 94ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15893487839513373891
[2022-06-02 16:55:34] [INFO ] Applying decomposition
Running compilation step : cd /tmp/ltsmin15893487839513373891;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-06-02 16:55:35] [INFO ] Flatten gal took : 235 ms
[2022-06-02 16:55:35] [INFO ] Flatten gal took : 409 ms
[2022-06-02 16:55:35] [INFO ] Input system was already deterministic with 2600 transitions.
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph112404195598861232.txt' '-o' '/tmp/graph112404195598861232.bin' '-w' '/tmp/graph112404195598861232.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph112404195598861232.bin' '-l' '-1' '-v' '-w' '/tmp/graph112404195598861232.weights' '-q' '0' '-e' '0.001'
[2022-06-02 16:55:35] [INFO ] Decomposing Gal with order
[2022-06-02 16:55:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-02 16:55:36] [INFO ] Removed a total of 7298 redundant transitions.
[2022-06-02 16:55:36] [INFO ] Flatten gal took : 635 ms
[2022-06-02 16:55:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 64 ms.
[2022-06-02 16:55:36] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15929949455243171617.gal : 27 ms
[2022-06-02 16:55:36] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4813627980548882929.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15929949455243171617.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4813627980548882929.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...299
Loading property file /tmp/ReachabilityCardinality4813627980548882929.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 64
Invariant property Dekker-PT-050-ReachabilityCardinality-04 does not hold.
FORMULA Dekker-PT-050-ReachabilityCardinality-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1.1259e+15 after 2.81475e+15
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2.81475e+15 after 2.81475e+15
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,2.92734e+16,0.414427,11940,119,18,2103,1369,2877,1661,49,1392,0
Total reachable state count : 29273397577908224

Verifying 2 reachability properties.
Invariant property Dekker-PT-050-ReachabilityCardinality-04 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
Dekker-PT-050-ReachabilityCardinality-04,2.81475e+14,0.415573,11940,63,13,2103,1369,2887,1661,54,1392,55
Invariant property Dekker-PT-050-ReachabilityCardinality-11 does not hold.
FORMULA Dekker-PT-050-ReachabilityCardinality-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
Dekker-PT-050-ReachabilityCardinality-11,1.75922e+13,0.417507,11940,66,14,2103,1369,2914,1661,58,1392,499
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-06-02 16:55:37] [WARNING] Script execution failed on command (define-fun trsrc2282 ((src (Array Int Int))(dst (Array Int Int))) Bool (and (_enabledsrc__2282 src) (= (store (store (store src 87 (- (select src 87) 1)) 188 (- (select src 188) 1)) 86 (+ (select src 86) 1)) dst))) with error
[2022-06-02 16:55:37] [WARNING] Script execution failed on command (define-fun tr2282 ((step Int)) Bool (trsrc2282 (select s step) (select s (+ step 1)))) with error (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
java.lang.RuntimeException: Error when declaring system variables to SMT solver.(error "Error writing to Z3 solver: java.io.IOException: Stream closed")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.init(NextBMCSolver.java:93)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.checkProperties(Gal2SMTFrontEnd.java:100)
at fr.lip6.move.gal.application.runner.smt.SMTRunner$2.run(SMTRunner.java:106)
at java.base/java.lang.Thread.run(Thread.java:829)
Total runtime 248319 ms.

BK_STOP 1654188937341

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

+ export LANG=C
+ LANG=C
+ 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
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -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=@none -Xss128m -Xms40m -Xmx8192m

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Dekker-PT-050"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="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 Dekker-PT-050, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r060-tall-165254772300622"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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