fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r042-smll-165252095700430
Last Updated
Jun 22, 2022

About the Execution of ITS-Tools for DES-PT-02b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
538.451 318211.00 468424.00 707.00 TFTTFTFTTTFFTFTF 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.r042-smll-165252095700430.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 DES-PT-02b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r042-smll-165252095700430
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 480K
-rw-r--r-- 1 mcc users 5.2K Apr 29 15:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 53K Apr 29 15:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Apr 29 15:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Apr 29 15:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 9 07:22 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 07:22 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 9 07:22 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 07:22 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 29 15:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 126K Apr 29 15:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Apr 29 15:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 49K Apr 29 15:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 9 07:22 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K May 9 07:22 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 69K 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 DES-PT-02b-ReachabilityCardinality-00
FORMULA_NAME DES-PT-02b-ReachabilityCardinality-01
FORMULA_NAME DES-PT-02b-ReachabilityCardinality-02
FORMULA_NAME DES-PT-02b-ReachabilityCardinality-03
FORMULA_NAME DES-PT-02b-ReachabilityCardinality-04
FORMULA_NAME DES-PT-02b-ReachabilityCardinality-05
FORMULA_NAME DES-PT-02b-ReachabilityCardinality-06
FORMULA_NAME DES-PT-02b-ReachabilityCardinality-07
FORMULA_NAME DES-PT-02b-ReachabilityCardinality-08
FORMULA_NAME DES-PT-02b-ReachabilityCardinality-09
FORMULA_NAME DES-PT-02b-ReachabilityCardinality-10
FORMULA_NAME DES-PT-02b-ReachabilityCardinality-11
FORMULA_NAME DES-PT-02b-ReachabilityCardinality-12
FORMULA_NAME DES-PT-02b-ReachabilityCardinality-13
FORMULA_NAME DES-PT-02b-ReachabilityCardinality-14
FORMULA_NAME DES-PT-02b-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1654183264592

Running Version 202205111006
[2022-06-02 15:21:07] [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 15:21:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-02 15:21:07] [INFO ] Load time of PNML (sax parser for PT used): 220 ms
[2022-06-02 15:21:07] [INFO ] Transformed 288 places.
[2022-06-02 15:21:07] [INFO ] Transformed 239 transitions.
[2022-06-02 15:21:07] [INFO ] Found NUPN structural information;
[2022-06-02 15:21:07] [INFO ] Parsed PT model containing 288 places and 239 transitions in 523 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 66 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 83 resets, run finished after 1000 ms. (steps per millisecond=10 ) properties (out of 16) seen :9
FORMULA DES-PT-02b-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-02b-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-02b-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-02b-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-02b-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-02b-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-02b-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-02b-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-02b-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 154 ms. (steps per millisecond=64 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 14 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 11 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 239 rows 288 cols
[2022-06-02 15:21:09] [INFO ] Computed 65 place invariants in 23 ms
[2022-06-02 15:21:10] [INFO ] After 756ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2022-06-02 15:21:10] [INFO ] [Nat]Absence check using 39 positive place invariants in 37 ms returned sat
[2022-06-02 15:21:10] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 22 ms returned sat
[2022-06-02 15:21:11] [INFO ] After 839ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :3
[2022-06-02 15:21:12] [INFO ] Deduced a trap composed of 19 places in 196 ms of which 10 ms to minimize.
[2022-06-02 15:21:12] [INFO ] Deduced a trap composed of 20 places in 166 ms of which 4 ms to minimize.
[2022-06-02 15:21:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 468 ms
[2022-06-02 15:21:12] [INFO ] Deduced a trap composed of 7 places in 122 ms of which 2 ms to minimize.
[2022-06-02 15:21:12] [INFO ] Deduced a trap composed of 14 places in 99 ms of which 3 ms to minimize.
[2022-06-02 15:21:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 332 ms
[2022-06-02 15:21:13] [INFO ] Deduced a trap composed of 30 places in 87 ms of which 1 ms to minimize.
[2022-06-02 15:21:13] [INFO ] Deduced a trap composed of 34 places in 92 ms of which 2 ms to minimize.
[2022-06-02 15:21:13] [INFO ] Deduced a trap composed of 30 places in 85 ms of which 1 ms to minimize.
[2022-06-02 15:21:13] [INFO ] Deduced a trap composed of 34 places in 80 ms of which 1 ms to minimize.
[2022-06-02 15:21:13] [INFO ] Deduced a trap composed of 20 places in 103 ms of which 1 ms to minimize.
[2022-06-02 15:21:13] [INFO ] Deduced a trap composed of 34 places in 74 ms of which 1 ms to minimize.
[2022-06-02 15:21:13] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 755 ms
[2022-06-02 15:21:13] [INFO ] After 2722ms SMT Verify possible using trap constraints in natural domain returned unsat :4 sat :3
Attempting to minimize the solution found.
Minimization took 281 ms.
[2022-06-02 15:21:14] [INFO ] After 3570ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :3
FORMULA DES-PT-02b-ReachabilityCardinality-08 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DES-PT-02b-ReachabilityCardinality-07 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DES-PT-02b-ReachabilityCardinality-04 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DES-PT-02b-ReachabilityCardinality-00 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 7 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 1794 ms.
Support contains 60 out of 288 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 288/288 places, 239/239 transitions.
Graph (complete) has 525 edges and 288 vertex of which 282 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.7 ms
Discarding 6 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 282 transition count 221
Reduce places removed 12 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 14 rules applied. Total rules applied 29 place count 270 transition count 219
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 31 place count 268 transition count 219
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 31 place count 268 transition count 213
Deduced a syphon composed of 6 places in 3 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 43 place count 262 transition count 213
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 55 place count 250 transition count 201
Iterating global reduction 3 with 12 rules applied. Total rules applied 67 place count 250 transition count 201
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 72 place count 245 transition count 196
Iterating global reduction 3 with 5 rules applied. Total rules applied 77 place count 245 transition count 196
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 5 rules applied. Total rules applied 82 place count 245 transition count 191
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 83 place count 244 transition count 191
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 5 with 94 rules applied. Total rules applied 177 place count 197 transition count 144
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 178 place count 197 transition count 143
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 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 182 place count 195 transition count 145
Free-agglomeration rule applied 5 times.
Iterating global reduction 6 with 5 rules applied. Total rules applied 187 place count 195 transition count 140
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 192 place count 190 transition count 140
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 193 place count 190 transition count 139
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 7 with 4 rules applied. Total rules applied 197 place count 190 transition count 135
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 201 place count 186 transition count 135
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 202 place count 186 transition count 134
Applied a total of 202 rules in 186 ms. Remains 186 /288 variables (removed 102) and now considering 134/239 (removed 105) transitions.
Finished structural reductions, in 1 iterations. Remains : 186/288 places, 134/239 transitions.
Incomplete random walk after 1000000 steps, including 14379 resets, run finished after 14580 ms. (steps per millisecond=68 ) properties (out of 3) seen :1
FORMULA DES-PT-02b-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000000 steps, including 2898 resets, run finished after 4217 ms. (steps per millisecond=237 ) properties (out of 2) seen :0
Interrupted Best-First random walk after 958597 steps, including 2665 resets, run timeout after 5001 ms. (steps per millisecond=191 ) properties seen 0
Running SMT prover for 2 properties.
// Phase 1: matrix 134 rows 186 cols
[2022-06-02 15:21:39] [INFO ] Computed 65 place invariants in 12 ms
[2022-06-02 15:21:39] [INFO ] After 90ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-02 15:21:40] [INFO ] [Nat]Absence check using 40 positive place invariants in 24 ms returned sat
[2022-06-02 15:21:40] [INFO ] [Nat]Absence check using 40 positive and 25 generalized place invariants in 25 ms returned sat
[2022-06-02 15:21:40] [INFO ] After 265ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-02 15:21:40] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-06-02 15:21:40] [INFO ] After 126ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-06-02 15:21:40] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 1 ms to minimize.
[2022-06-02 15:21:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 90 ms
[2022-06-02 15:21:40] [INFO ] Deduced a trap composed of 11 places in 128 ms of which 1 ms to minimize.
[2022-06-02 15:21:41] [INFO ] Deduced a trap composed of 26 places in 132 ms of which 1 ms to minimize.
[2022-06-02 15:21:41] [INFO ] Deduced a trap composed of 13 places in 124 ms of which 2 ms to minimize.
[2022-06-02 15:21:41] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 475 ms
[2022-06-02 15:21:41] [INFO ] After 841ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 130 ms.
[2022-06-02 15:21:41] [INFO ] After 1386ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 658 ms.
Support contains 43 out of 186 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 186/186 places, 134/134 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 186 transition count 132
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 184 transition count 132
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 183 transition count 131
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 183 transition count 131
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 18 place count 177 transition count 125
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 176 transition count 129
Applied a total of 20 rules in 45 ms. Remains 176 /186 variables (removed 10) and now considering 129/134 (removed 5) transitions.
Finished structural reductions, in 1 iterations. Remains : 176/186 places, 129/134 transitions.
Incomplete random walk after 1000000 steps, including 16754 resets, run finished after 15062 ms. (steps per millisecond=66 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3201 resets, run finished after 4032 ms. (steps per millisecond=248 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3098 resets, run finished after 4860 ms. (steps per millisecond=205 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 22006649 steps, run timeout after 69001 ms. (steps per millisecond=318 ) properties seen :{}
Probabilistic random walk after 22006649 steps, saw 2625271 distinct states, run finished after 69004 ms. (steps per millisecond=318 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 129 rows 176 cols
[2022-06-02 15:23:15] [INFO ] Computed 65 place invariants in 4 ms
[2022-06-02 15:23:15] [INFO ] After 58ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-02 15:23:15] [INFO ] [Nat]Absence check using 39 positive place invariants in 19 ms returned sat
[2022-06-02 15:23:15] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 16 ms returned sat
[2022-06-02 15:23:15] [INFO ] After 269ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-02 15:23:15] [INFO ] State equation strengthened by 6 read => feed constraints.
[2022-06-02 15:23:15] [INFO ] After 109ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-06-02 15:23:15] [INFO ] Deduced a trap composed of 6 places in 97 ms of which 2 ms to minimize.
[2022-06-02 15:23:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 121 ms
[2022-06-02 15:23:15] [INFO ] After 330ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 95 ms.
[2022-06-02 15:23:15] [INFO ] After 815ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 747 ms.
Support contains 43 out of 176 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 176/176 places, 129/129 transitions.
Applied a total of 0 rules in 15 ms. Remains 176 /176 variables (removed 0) and now considering 129/129 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 176/176 places, 129/129 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 176/176 places, 129/129 transitions.
Applied a total of 0 rules in 12 ms. Remains 176 /176 variables (removed 0) and now considering 129/129 (removed 0) transitions.
// Phase 1: matrix 129 rows 176 cols
[2022-06-02 15:23:16] [INFO ] Computed 65 place invariants in 3 ms
[2022-06-02 15:23:16] [INFO ] Implicit Places using invariants in 238 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 245 ms to find 1 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 175/176 places, 129/129 transitions.
Applied a total of 0 rules in 12 ms. Remains 175 /175 variables (removed 0) and now considering 129/129 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 175/176 places, 129/129 transitions.
Incomplete random walk after 1000000 steps, including 16665 resets, run finished after 14058 ms. (steps per millisecond=71 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3183 resets, run finished after 3371 ms. (steps per millisecond=296 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000000 steps, including 3100 resets, run finished after 4173 ms. (steps per millisecond=239 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 19238205 steps, run timeout after 63001 ms. (steps per millisecond=305 ) properties seen :{}
Probabilistic random walk after 19238205 steps, saw 2333891 distinct states, run finished after 63001 ms. (steps per millisecond=305 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 129 rows 175 cols
[2022-06-02 15:24:41] [INFO ] Computed 64 place invariants in 3 ms
[2022-06-02 15:24:41] [INFO ] After 62ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-02 15:24:41] [INFO ] [Nat]Absence check using 38 positive place invariants in 16 ms returned sat
[2022-06-02 15:24:41] [INFO ] [Nat]Absence check using 38 positive and 26 generalized place invariants in 15 ms returned sat
[2022-06-02 15:24:41] [INFO ] After 249ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-02 15:24:41] [INFO ] State equation strengthened by 6 read => feed constraints.
[2022-06-02 15:24:42] [INFO ] After 97ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-06-02 15:24:42] [INFO ] Deduced a trap composed of 13 places in 82 ms of which 1 ms to minimize.
[2022-06-02 15:24:42] [INFO ] Deduced a trap composed of 5 places in 48 ms of which 1 ms to minimize.
[2022-06-02 15:24:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 178 ms
[2022-06-02 15:24:42] [INFO ] Deduced a trap composed of 8 places in 76 ms of which 0 ms to minimize.
[2022-06-02 15:24:42] [INFO ] Deduced a trap composed of 12 places in 82 ms of which 1 ms to minimize.
[2022-06-02 15:24:42] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 1 ms to minimize.
[2022-06-02 15:24:42] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2022-06-02 15:24:42] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 386 ms
[2022-06-02 15:24:42] [INFO ] After 820ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 114 ms.
[2022-06-02 15:24:42] [INFO ] After 1306ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 610 ms.
Support contains 43 out of 175 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 175/175 places, 129/129 transitions.
Applied a total of 0 rules in 12 ms. Remains 175 /175 variables (removed 0) and now considering 129/129 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 175/175 places, 129/129 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 175/175 places, 129/129 transitions.
Applied a total of 0 rules in 11 ms. Remains 175 /175 variables (removed 0) and now considering 129/129 (removed 0) transitions.
// Phase 1: matrix 129 rows 175 cols
[2022-06-02 15:24:43] [INFO ] Computed 64 place invariants in 4 ms
[2022-06-02 15:24:43] [INFO ] Implicit Places using invariants in 276 ms returned []
// Phase 1: matrix 129 rows 175 cols
[2022-06-02 15:24:43] [INFO ] Computed 64 place invariants in 4 ms
[2022-06-02 15:24:44] [INFO ] State equation strengthened by 6 read => feed constraints.
[2022-06-02 15:24:44] [INFO ] Implicit Places using invariants and state equation in 405 ms returned []
Implicit Place search using SMT with State Equation took 685 ms to find 0 implicit places.
[2022-06-02 15:24:44] [INFO ] Redundant transitions in 7 ms returned []
// Phase 1: matrix 129 rows 175 cols
[2022-06-02 15:24:44] [INFO ] Computed 64 place invariants in 2 ms
[2022-06-02 15:24:44] [INFO ] Dead Transitions using invariants and state equation in 177 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 175/175 places, 129/129 transitions.
Incomplete random walk after 1000000 steps, including 16668 resets, run finished after 11805 ms. (steps per millisecond=84 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3174 resets, run finished after 3218 ms. (steps per millisecond=310 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3096 resets, run finished after 4225 ms. (steps per millisecond=236 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 17404092 steps, run timeout after 57001 ms. (steps per millisecond=305 ) properties seen :{}
Probabilistic random walk after 17404092 steps, saw 2127431 distinct states, run finished after 57002 ms. (steps per millisecond=305 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 129 rows 175 cols
[2022-06-02 15:26:00] [INFO ] Computed 64 place invariants in 6 ms
[2022-06-02 15:26:00] [INFO ] After 62ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-02 15:26:00] [INFO ] [Nat]Absence check using 38 positive place invariants in 13 ms returned sat
[2022-06-02 15:26:00] [INFO ] [Nat]Absence check using 38 positive and 26 generalized place invariants in 13 ms returned sat
[2022-06-02 15:26:01] [INFO ] After 179ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-02 15:26:01] [INFO ] State equation strengthened by 6 read => feed constraints.
[2022-06-02 15:26:01] [INFO ] After 69ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-06-02 15:26:01] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 1 ms to minimize.
[2022-06-02 15:26:01] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 1 ms to minimize.
[2022-06-02 15:26:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 116 ms
[2022-06-02 15:26:01] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 0 ms to minimize.
[2022-06-02 15:26:01] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 0 ms to minimize.
[2022-06-02 15:26:01] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2022-06-02 15:26:01] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 0 ms to minimize.
[2022-06-02 15:26:01] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 247 ms
[2022-06-02 15:26:01] [INFO ] After 539ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 80 ms.
[2022-06-02 15:26:01] [INFO ] After 895ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 448 ms.
Support contains 43 out of 175 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 175/175 places, 129/129 transitions.
Applied a total of 0 rules in 19 ms. Remains 175 /175 variables (removed 0) and now considering 129/129 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 175/175 places, 129/129 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 175/175 places, 129/129 transitions.
Applied a total of 0 rules in 11 ms. Remains 175 /175 variables (removed 0) and now considering 129/129 (removed 0) transitions.
// Phase 1: matrix 129 rows 175 cols
[2022-06-02 15:26:02] [INFO ] Computed 64 place invariants in 2 ms
[2022-06-02 15:26:02] [INFO ] Implicit Places using invariants in 246 ms returned []
// Phase 1: matrix 129 rows 175 cols
[2022-06-02 15:26:02] [INFO ] Computed 64 place invariants in 11 ms
[2022-06-02 15:26:02] [INFO ] State equation strengthened by 6 read => feed constraints.
[2022-06-02 15:26:02] [INFO ] Implicit Places using invariants and state equation in 380 ms returned []
Implicit Place search using SMT with State Equation took 628 ms to find 0 implicit places.
[2022-06-02 15:26:02] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 129 rows 175 cols
[2022-06-02 15:26:02] [INFO ] Computed 64 place invariants in 3 ms
[2022-06-02 15:26:02] [INFO ] Dead Transitions using invariants and state equation in 186 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 175/175 places, 129/129 transitions.
Graph (complete) has 456 edges and 175 vertex of which 174 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 11 ms. Remains 174 /175 variables (removed 1) and now considering 129/129 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 129 rows 174 cols
[2022-06-02 15:26:02] [INFO ] Computed 63 place invariants in 2 ms
[2022-06-02 15:26:03] [INFO ] After 65ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-02 15:26:03] [INFO ] [Nat]Absence check using 37 positive place invariants in 9 ms returned sat
[2022-06-02 15:26:03] [INFO ] [Nat]Absence check using 37 positive and 26 generalized place invariants in 10 ms returned sat
[2022-06-02 15:26:03] [INFO ] After 175ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-02 15:26:03] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 0 ms to minimize.
[2022-06-02 15:26:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 76 ms
[2022-06-02 15:26:03] [INFO ] After 371ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 107 ms.
[2022-06-02 15:26:03] [INFO ] After 571ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2022-06-02 15:26:03] [INFO ] Flatten gal took : 76 ms
[2022-06-02 15:26:03] [INFO ] Flatten gal took : 30 ms
[2022-06-02 15:26:03] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3960710451852665146.gal : 14 ms
[2022-06-02 15:26:04] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16901880263636655826.prop : 2 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/ReachabilityCardinality3960710451852665146.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16901880263636655826.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/ReachabilityCardinality16901880263636655826.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :3 after 7
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :7 after 18
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :18 after 429
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :429 after 3813
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :3813 after 6513
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :6513 after 33081
Detected timeout of ITS tools.
[2022-06-02 15:26:19] [INFO ] Flatten gal took : 19 ms
[2022-06-02 15:26:19] [INFO ] Applying decomposition
[2022-06-02 15:26:19] [INFO ] Flatten gal took : 16 ms
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/graph3496498606368034288.txt' '-o' '/tmp/graph3496498606368034288.bin' '-w' '/tmp/graph3496498606368034288.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph3496498606368034288.bin' '-l' '-1' '-v' '-w' '/tmp/graph3496498606368034288.weights' '-q' '0' '-e' '0.001'
[2022-06-02 15:26:19] [INFO ] Decomposing Gal with order
[2022-06-02 15:26:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-02 15:26:19] [INFO ] Removed a total of 93 redundant transitions.
[2022-06-02 15:26:19] [INFO ] Flatten gal took : 81 ms
[2022-06-02 15:26:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 31 labels/synchronizations in 14 ms.
[2022-06-02 15:26:19] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13330294722830585849.gal : 14 ms
[2022-06-02 15:26:19] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5116112188995435028.prop : 1 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/ReachabilityCardinality13330294722830585849.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5116112188995435028.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/ReachabilityCardinality5116112188995435028.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 49
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :49 after 105
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :105 after 383
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :383 after 677705
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :1.40287e+09 after 9.57744e+10
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,7.13952e+13,1.00645,22676,3059,204,44927,1681,625,61217,136,5622,0
Total reachable state count : 71395185555083

Verifying 2 reachability properties.
Invariant property DES-PT-02b-ReachabilityCardinality-01 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
DES-PT-02b-ReachabilityCardinality-01,4.28367e+09,1.06765,22676,467,140,44927,1681,647,61217,145,5622,14610
Invariant property DES-PT-02b-ReachabilityCardinality-12 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
DES-PT-02b-ReachabilityCardinality-12,0,1.21803,22676,1,0,44927,1681,707,62523,150,5622,39985
FORMULA DES-PT-02b-ReachabilityCardinality-12 TRUE TECHNIQUES OVER_APPROXIMATION
[2022-06-02 15:26:20] [INFO ] Flatten gal took : 23 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin884165620599368688
[2022-06-02 15:26:20] [INFO ] Applying decomposition
[2022-06-02 15:26:20] [INFO ] Flatten gal took : 38 ms
[2022-06-02 15:26:20] [INFO ] Computing symmetric may disable matrix : 129 transitions.
[2022-06-02 15:26:20] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-02 15:26:20] [INFO ] Computing symmetric may enable matrix : 129 transitions.
[2022-06-02 15:26:20] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-02 15:26:20] [INFO ] Flatten gal took : 46 ms
[2022-06-02 15:26:20] [INFO ] Computing Do-Not-Accords matrix : 129 transitions.
[2022-06-02 15:26:20] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-02 15:26:20] [INFO ] Built C files in 81ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin884165620599368688
[2022-06-02 15:26:20] [INFO ] Input system was already deterministic with 129 transitions.
Running compilation step : cd /tmp/ltsmin884165620599368688;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' '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'
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/graph8239116433535937965.txt' '-o' '/tmp/graph8239116433535937965.bin' '-w' '/tmp/graph8239116433535937965.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph8239116433535937965.bin' '-l' '-1' '-v' '-w' '/tmp/graph8239116433535937965.weights' '-q' '0' '-e' '0.001'
[2022-06-02 15:26:20] [INFO ] Decomposing Gal with order
[2022-06-02 15:26:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-02 15:26:20] [INFO ] Removed a total of 117 redundant transitions.
[2022-06-02 15:26:20] [INFO ] Flatten gal took : 44 ms
[2022-06-02 15:26:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 20 labels/synchronizations in 10 ms.
[2022-06-02 15:26:21] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15108454948027436540.gal : 11 ms
[2022-06-02 15:26:21] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8091378822062348695.prop : 1 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/ReachabilityCardinality15108454948027436540.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8091378822062348695.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/ReachabilityCardinality8091378822062348695.prop.
[2022-06-02 15:26:21] [INFO ] Ran tautology test, simplified 0 / 1 in 328 ms.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 21
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :21 after 51
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :51 after 294
[2022-06-02 15:26:21] [INFO ] BMC solution for property DES-PT-02b-ReachabilityCardinality-01(UNSAT) depth K=0 took 6 ms
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :294 after 2.05914e+06
[2022-06-02 15:26:21] [INFO ] BMC solution for property DES-PT-02b-ReachabilityCardinality-01(UNSAT) depth K=1 took 13 ms
[2022-06-02 15:26:21] [INFO ] BMC solution for property DES-PT-02b-ReachabilityCardinality-01(UNSAT) depth K=2 took 45 ms
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 129 rows 175 cols
[2022-06-02 15:26:21] [INFO ] Computed 64 place invariants in 3 ms
[2022-06-02 15:26:21] [INFO ] Computed 64 place invariants in 3 ms
[2022-06-02 15:26:21] [INFO ] BMC solution for property DES-PT-02b-ReachabilityCardinality-01(UNSAT) depth K=3 took 472 ms
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :2.17533e+10 after 2.09339e+11
[2022-06-02 15:26:21] [INFO ] Proved 175 variables to be positive in 519 ms
[2022-06-02 15:26:21] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDES-PT-02b-ReachabilityCardinality-01
[2022-06-02 15:26:21] [INFO ] KInduction solution for property DES-PT-02b-ReachabilityCardinality-01(SAT) depth K=0 took 39 ms
Compilation finished in 1132 ms.
Running link step : cd /tmp/ltsmin884165620599368688;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin884165620599368688;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'DESPT02bReachabilityCardinality01==true'
[2022-06-02 15:26:22] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDES-PT-02b-ReachabilityCardinality-01
[2022-06-02 15:26:22] [INFO ] KInduction solution for property DES-PT-02b-ReachabilityCardinality-01(SAT) depth K=1 took 73 ms
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,3.56976e+13,1.00739,16356,1865,193,27519,1283,509,41332,131,3389,0
Total reachable state count : 35697592780031

Verifying 1 reachability properties.
Invariant property DES-PT-02b-ReachabilityCardinality-01 does not hold.
FORMULA DES-PT-02b-ReachabilityCardinality-01 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
DES-PT-02b-ReachabilityCardinality-01,2.14183e+09,1.05871,16620,361,134,27519,1283,540,41332,141,3389,5849
[2022-06-02 15:26:22] [WARNING] Interrupting SMT solver.
[2022-06-02 15:26:22] [WARNING] SMT solver unexpectedly returned 'unknown' answer, retrying.
java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:307)
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.verify(KInductionSolver.java:587)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runKInduction(Gal2SMTFrontEnd.java:306)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$2.run(Gal2SMTFrontEnd.java:171)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-06-02 15:26:22] [WARNING] Unexpected error occurred while running SMT. Was verifying DES-PT-02b-ReachabilityCardinality-01 K-induction depth 2
Exception in thread "Thread-11" java.lang.RuntimeException: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runKInduction(Gal2SMTFrontEnd.java:344)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$2.run(Gal2SMTFrontEnd.java:171)
at java.base/java.lang.Thread.run(Thread.java:829)
Caused by: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:307)
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.verify(KInductionSolver.java:587)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runKInduction(Gal2SMTFrontEnd.java:306)
... 2 more
[2022-06-02 15:26:22] [WARNING] SMT solver unexpectedly returned 'unknown' answer, retrying.
java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:307)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verifyAssertion(NextBMCSolver.java:454)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verify(NextBMCSolver.java:437)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runBMC(Gal2SMTFrontEnd.java:385)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$1.run(Gal2SMTFrontEnd.java:164)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-06-02 15:26:22] [WARNING] Unexpected error occurred while running SMT. Was verifying DES-PT-02b-ReachabilityCardinality-01 SMT depth 4
java.lang.RuntimeException: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runBMC(Gal2SMTFrontEnd.java:411)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$1.run(Gal2SMTFrontEnd.java:164)
at java.base/java.lang.Thread.run(Thread.java:829)
Caused by: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:307)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verifyAssertion(NextBMCSolver.java:454)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verify(NextBMCSolver.java:437)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runBMC(Gal2SMTFrontEnd.java:385)
... 2 more
[2022-06-02 15:26:22] [INFO ] During BMC, SMT solver timed out at depth 4
[2022-06-02 15:26:22] [INFO ] BMC solving timed out (3600000 secs) at depth 4
[2022-06-02 15:26:22] [INFO ] SMT solved 0/ 1 properties. Interrupting SMT analysis.
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 315685 ms.

BK_STOP 1654183582803

--------------------
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="DES-PT-02b"
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 DES-PT-02b, 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 r042-smll-165252095700430"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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