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-165254772300627.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-100, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r060-tall-165254772300627
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.2M
-rw-r--r-- 1 mcc users 9.9K Apr 30 05:18 CTLCardinality.txt
-rw-r--r-- 1 mcc users 110K Apr 30 05:18 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Apr 30 05:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Apr 30 05:16 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.7K 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.6K May 9 07:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 07:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 07:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K 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 5.9M 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-100-LTLCardinality-00
FORMULA_NAME Dekker-PT-100-LTLCardinality-01
FORMULA_NAME Dekker-PT-100-LTLCardinality-02
FORMULA_NAME Dekker-PT-100-LTLCardinality-03
FORMULA_NAME Dekker-PT-100-LTLCardinality-04
FORMULA_NAME Dekker-PT-100-LTLCardinality-05
FORMULA_NAME Dekker-PT-100-LTLCardinality-06
FORMULA_NAME Dekker-PT-100-LTLCardinality-07
FORMULA_NAME Dekker-PT-100-LTLCardinality-08
FORMULA_NAME Dekker-PT-100-LTLCardinality-09
FORMULA_NAME Dekker-PT-100-LTLCardinality-10
FORMULA_NAME Dekker-PT-100-LTLCardinality-11
FORMULA_NAME Dekker-PT-100-LTLCardinality-12
FORMULA_NAME Dekker-PT-100-LTLCardinality-13
FORMULA_NAME Dekker-PT-100-LTLCardinality-14
FORMULA_NAME Dekker-PT-100-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1652631828748

Running Version 202205111006
[2022-05-15 16:23:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -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-05-15 16:23:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 16:23:50] [INFO ] Load time of PNML (sax parser for PT used): 542 ms
[2022-05-15 16:23:50] [INFO ] Transformed 500 places.
[2022-05-15 16:23:50] [INFO ] Transformed 10200 transitions.
[2022-05-15 16:23:50] [INFO ] Found NUPN structural information;
[2022-05-15 16:23:50] [INFO ] Parsed PT model containing 500 places and 10200 transitions in 709 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA Dekker-PT-100-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-100-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-100-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-100-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-100-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-100-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-100-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-100-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 23 out of 500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 10200/10200 transitions.
Applied a total of 0 rules in 500 ms. Remains 500 /500 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2022-05-15 16:23:51] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
// Phase 1: matrix 400 rows 500 cols
[2022-05-15 16:23:51] [INFO ] Computed 300 place invariants in 33 ms
[2022-05-15 16:23:58] [INFO ] Implicit Places using invariants in 7474 ms returned [200, 203, 206, 209, 212, 215, 218, 221, 224, 227, 233, 236, 239, 242, 245, 248, 251, 254, 260, 263, 266, 269, 272, 275, 278, 281, 284, 287, 290, 293, 296, 299, 302, 305, 308, 311, 314, 317, 320, 323, 326, 329, 332, 335, 341, 344, 347, 350, 353, 356, 359, 362, 365, 371, 374, 377, 380, 383, 386, 389, 392, 395, 398, 401, 404, 407, 410, 413, 416, 419, 422, 425, 428, 431, 434, 437, 440, 443, 446, 449, 452, 455, 458, 461, 464, 467, 473, 476, 482, 488, 491, 494, 497]
Discarding 93 places :
Implicit Place search using SMT only with invariants took 7521 ms to find 93 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 407/500 places, 10200/10200 transitions.
Applied a total of 0 rules in 106 ms. Remains 407 /407 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 407/500 places, 10200/10200 transitions.
Support contains 23 out of 407 places after structural reductions.
[2022-05-15 16:23:59] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2022-05-15 16:23:59] [INFO ] Flatten gal took : 672 ms
FORMULA Dekker-PT-100-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-15 16:24:00] [INFO ] Flatten gal took : 489 ms
[2022-05-15 16:24:01] [INFO ] Input system was already deterministic with 10200 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 607 ms. (steps per millisecond=16 ) properties (out of 15) seen :11
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 4) 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 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2022-05-15 16:24:02] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
// Phase 1: matrix 400 rows 407 cols
[2022-05-15 16:24:02] [INFO ] Computed 207 place invariants in 10 ms
[2022-05-15 16:24:02] [INFO ] [Real]Absence check using 200 positive place invariants in 26 ms returned sat
[2022-05-15 16:24:02] [INFO ] [Real]Absence check using 200 positive and 7 generalized place invariants in 1 ms returned sat
[2022-05-15 16:24:02] [INFO ] After 198ms SMT Verify possible using state equation in real domain returned unsat :1 sat :1 real:2
[2022-05-15 16:24:02] [INFO ] State equation strengthened by 100 read => feed constraints.
[2022-05-15 16:24:02] [INFO ] After 81ms SMT Verify possible using 100 Read/Feed constraints in real domain returned unsat :1 sat :0 real:3
[2022-05-15 16:24:02] [INFO ] After 552ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:3
[2022-05-15 16:24:02] [INFO ] [Nat]Absence check using 200 positive place invariants in 29 ms returned sat
[2022-05-15 16:24:02] [INFO ] [Nat]Absence check using 200 positive and 7 generalized place invariants in 1 ms returned sat
[2022-05-15 16:24:02] [INFO ] After 174ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2022-05-15 16:24:03] [INFO ] After 133ms SMT Verify possible using 100 Read/Feed constraints in natural domain returned unsat :1 sat :3
[2022-05-15 16:24:03] [INFO ] Deduced a trap composed of 4 places in 322 ms of which 4 ms to minimize.
[2022-05-15 16:24:03] [INFO ] Deduced a trap composed of 4 places in 293 ms of which 2 ms to minimize.
[2022-05-15 16:24:04] [INFO ] Deduced a trap composed of 4 places in 305 ms of which 1 ms to minimize.
[2022-05-15 16:24:04] [INFO ] Deduced a trap composed of 4 places in 293 ms of which 1 ms to minimize.
[2022-05-15 16:24:04] [INFO ] Deduced a trap composed of 4 places in 259 ms of which 2 ms to minimize.
[2022-05-15 16:24:04] [INFO ] Deduced a trap composed of 4 places in 292 ms of which 1 ms to minimize.
[2022-05-15 16:24:05] [INFO ] Deduced a trap composed of 4 places in 261 ms of which 0 ms to minimize.
[2022-05-15 16:24:05] [INFO ] Deduced a trap composed of 4 places in 238 ms of which 1 ms to minimize.
[2022-05-15 16:24:05] [INFO ] Deduced a trap composed of 4 places in 236 ms of which 1 ms to minimize.
[2022-05-15 16:24:05] [INFO ] Deduced a trap composed of 4 places in 228 ms of which 0 ms to minimize.
[2022-05-15 16:24:06] [INFO ] Deduced a trap composed of 4 places in 222 ms of which 0 ms to minimize.
[2022-05-15 16:24:06] [INFO ] Trap strengthening procedure interrupted after too many repetitions 3161 ms
[2022-05-15 16:24:06] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 3161 ms
[2022-05-15 16:24:06] [INFO ] Deduced a trap composed of 4 places in 222 ms of which 0 ms to minimize.
[2022-05-15 16:24:06] [INFO ] Deduced a trap composed of 4 places in 256 ms of which 0 ms to minimize.
[2022-05-15 16:24:07] [INFO ] Deduced a trap composed of 4 places in 247 ms of which 1 ms to minimize.
[2022-05-15 16:24:07] [INFO ] Deduced a trap composed of 4 places in 220 ms of which 0 ms to minimize.
[2022-05-15 16:24:07] [INFO ] Deduced a trap composed of 4 places in 209 ms of which 0 ms to minimize.
[2022-05-15 16:24:07] [INFO ] Deduced a trap composed of 4 places in 205 ms of which 1 ms to minimize.
[2022-05-15 16:24:08] [INFO ] Deduced a trap composed of 4 places in 237 ms of which 0 ms to minimize.
[2022-05-15 16:24:08] [INFO ] Deduced a trap composed of 4 places in 228 ms of which 0 ms to minimize.
[2022-05-15 16:24:08] [INFO ] Deduced a trap composed of 4 places in 237 ms of which 1 ms to minimize.
[2022-05-15 16:24:08] [INFO ] Deduced a trap composed of 4 places in 204 ms of which 0 ms to minimize.
[2022-05-15 16:24:08] [INFO ] Deduced a trap composed of 4 places in 192 ms of which 0 ms to minimize.
[2022-05-15 16:24:08] [INFO ] Trap strengthening procedure interrupted after too many repetitions 2708 ms
[2022-05-15 16:24:08] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2708 ms
[2022-05-15 16:24:09] [INFO ] After 6097ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 68 ms.
[2022-05-15 16:24:09] [INFO ] After 6491ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :3
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 10 ms.
Support contains 5 out of 407 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 407/407 places, 10200/10200 transitions.
Applied a total of 0 rules in 883 ms. Remains 407 /407 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 407/407 places, 10200/10200 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 371 ms. (steps per millisecond=26 ) properties (out of 3) 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 3) 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 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 455712 steps, run timeout after 3001 ms. (steps per millisecond=151 ) properties seen :{0=1, 1=1}
Probabilistic random walk after 455712 steps, saw 417553 distinct states, run finished after 3001 ms. (steps per millisecond=151 ) properties seen :2
Running SMT prover for 1 properties.
[2022-05-15 16:24:13] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
// Phase 1: matrix 400 rows 407 cols
[2022-05-15 16:24:13] [INFO ] Computed 207 place invariants in 3 ms
[2022-05-15 16:24:13] [INFO ] [Real]Absence check using 200 positive place invariants in 26 ms returned sat
[2022-05-15 16:24:13] [INFO ] [Real]Absence check using 200 positive and 7 generalized place invariants in 1 ms returned sat
[2022-05-15 16:24:13] [INFO ] After 129ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-15 16:24:13] [INFO ] State equation strengthened by 100 read => feed constraints.
[2022-05-15 16:24:13] [INFO ] After 96ms SMT Verify possible using 100 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 16:24:13] [INFO ] After 404ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 16:24:13] [INFO ] [Nat]Absence check using 200 positive place invariants in 24 ms returned sat
[2022-05-15 16:24:13] [INFO ] [Nat]Absence check using 200 positive and 7 generalized place invariants in 1 ms returned sat
[2022-05-15 16:24:14] [INFO ] After 135ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 16:24:14] [INFO ] After 71ms SMT Verify possible using 100 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 16:24:14] [INFO ] Deduced a trap composed of 4 places in 294 ms of which 0 ms to minimize.
[2022-05-15 16:24:14] [INFO ] Deduced a trap composed of 4 places in 332 ms of which 0 ms to minimize.
[2022-05-15 16:24:15] [INFO ] Deduced a trap composed of 4 places in 328 ms of which 0 ms to minimize.
[2022-05-15 16:24:15] [INFO ] Deduced a trap composed of 4 places in 318 ms of which 1 ms to minimize.
[2022-05-15 16:24:15] [INFO ] Deduced a trap composed of 4 places in 306 ms of which 0 ms to minimize.
[2022-05-15 16:24:16] [INFO ] Deduced a trap composed of 4 places in 301 ms of which 0 ms to minimize.
[2022-05-15 16:24:16] [INFO ] Deduced a trap composed of 4 places in 313 ms of which 1 ms to minimize.
[2022-05-15 16:24:16] [INFO ] Deduced a trap composed of 4 places in 262 ms of which 1 ms to minimize.
[2022-05-15 16:24:17] [INFO ] Deduced a trap composed of 4 places in 258 ms of which 0 ms to minimize.
[2022-05-15 16:24:17] [INFO ] Deduced a trap composed of 4 places in 256 ms of which 0 ms to minimize.
[2022-05-15 16:24:17] [INFO ] Deduced a trap composed of 4 places in 254 ms of which 1 ms to minimize.
[2022-05-15 16:24:17] [INFO ] Trap strengthening procedure interrupted after too many repetitions 3457 ms
[2022-05-15 16:24:17] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 3458 ms
[2022-05-15 16:24:17] [INFO ] After 3549ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 31 ms.
[2022-05-15 16:24:17] [INFO ] After 3829ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 407 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 407/407 places, 10200/10200 transitions.
Applied a total of 0 rules in 378 ms. Remains 407 /407 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 407/407 places, 10200/10200 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 218 ms. (steps per millisecond=45 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 473387 steps, run timeout after 3001 ms. (steps per millisecond=157 ) properties seen :{}
Probabilistic random walk after 473387 steps, saw 433582 distinct states, run finished after 3002 ms. (steps per millisecond=157 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-15 16:24:21] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
// Phase 1: matrix 400 rows 407 cols
[2022-05-15 16:24:21] [INFO ] Computed 207 place invariants in 10 ms
[2022-05-15 16:24:21] [INFO ] [Real]Absence check using 200 positive place invariants in 23 ms returned sat
[2022-05-15 16:24:21] [INFO ] [Real]Absence check using 200 positive and 7 generalized place invariants in 4 ms returned sat
[2022-05-15 16:24:21] [INFO ] After 127ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-15 16:24:21] [INFO ] State equation strengthened by 100 read => feed constraints.
[2022-05-15 16:24:21] [INFO ] After 83ms SMT Verify possible using 100 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 16:24:21] [INFO ] After 402ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 16:24:21] [INFO ] [Nat]Absence check using 200 positive place invariants in 24 ms returned sat
[2022-05-15 16:24:21] [INFO ] [Nat]Absence check using 200 positive and 7 generalized place invariants in 3 ms returned sat
[2022-05-15 16:24:21] [INFO ] After 119ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 16:24:22] [INFO ] After 72ms SMT Verify possible using 100 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 16:24:22] [INFO ] Deduced a trap composed of 4 places in 346 ms of which 0 ms to minimize.
[2022-05-15 16:24:22] [INFO ] Deduced a trap composed of 4 places in 298 ms of which 0 ms to minimize.
[2022-05-15 16:24:23] [INFO ] Deduced a trap composed of 4 places in 292 ms of which 0 ms to minimize.
[2022-05-15 16:24:23] [INFO ] Deduced a trap composed of 4 places in 287 ms of which 1 ms to minimize.
[2022-05-15 16:24:23] [INFO ] Deduced a trap composed of 4 places in 284 ms of which 2 ms to minimize.
[2022-05-15 16:24:23] [INFO ] Deduced a trap composed of 4 places in 269 ms of which 0 ms to minimize.
[2022-05-15 16:24:24] [INFO ] Deduced a trap composed of 4 places in 270 ms of which 0 ms to minimize.
[2022-05-15 16:24:24] [INFO ] Deduced a trap composed of 4 places in 264 ms of which 0 ms to minimize.
[2022-05-15 16:24:24] [INFO ] Deduced a trap composed of 4 places in 348 ms of which 0 ms to minimize.
[2022-05-15 16:24:25] [INFO ] Deduced a trap composed of 4 places in 265 ms of which 0 ms to minimize.
[2022-05-15 16:24:25] [INFO ] Deduced a trap composed of 4 places in 254 ms of which 0 ms to minimize.
[2022-05-15 16:24:25] [INFO ] Trap strengthening procedure interrupted after too many repetitions 3393 ms
[2022-05-15 16:24:25] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 3393 ms
[2022-05-15 16:24:25] [INFO ] After 3481ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 26 ms.
[2022-05-15 16:24:25] [INFO ] After 3743ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 2 out of 407 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 407/407 places, 10200/10200 transitions.
Applied a total of 0 rules in 503 ms. Remains 407 /407 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 407/407 places, 10200/10200 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 407/407 places, 10200/10200 transitions.
Applied a total of 0 rules in 366 ms. Remains 407 /407 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2022-05-15 16:24:26] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
// Phase 1: matrix 400 rows 407 cols
[2022-05-15 16:24:26] [INFO ] Computed 207 place invariants in 5 ms
[2022-05-15 16:24:28] [INFO ] Implicit Places using invariants in 1916 ms returned [220, 239, 294, 315, 384, 391, 396]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 1930 ms to find 7 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 400/407 places, 10200/10200 transitions.
Applied a total of 0 rules in 363 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 400/407 places, 10200/10200 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 223 ms. (steps per millisecond=44 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 485002 steps, run timeout after 3001 ms. (steps per millisecond=161 ) properties seen :{}
Probabilistic random walk after 485002 steps, saw 444077 distinct states, run finished after 3001 ms. (steps per millisecond=161 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-15 16:24:31] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
// Phase 1: matrix 400 rows 400 cols
[2022-05-15 16:24:31] [INFO ] Computed 200 place invariants in 3 ms
[2022-05-15 16:24:32] [INFO ] [Real]Absence check using 200 positive place invariants in 22 ms returned sat
[2022-05-15 16:24:32] [INFO ] After 117ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-15 16:24:32] [INFO ] State equation strengthened by 100 read => feed constraints.
[2022-05-15 16:24:32] [INFO ] After 79ms SMT Verify possible using 100 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 16:24:32] [INFO ] After 348ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 16:24:32] [INFO ] [Nat]Absence check using 200 positive place invariants in 23 ms returned sat
[2022-05-15 16:24:32] [INFO ] After 113ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 16:24:32] [INFO ] After 67ms SMT Verify possible using 100 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 16:24:32] [INFO ] Deduced a trap composed of 4 places in 225 ms of which 0 ms to minimize.
[2022-05-15 16:24:33] [INFO ] Deduced a trap composed of 4 places in 220 ms of which 1 ms to minimize.
[2022-05-15 16:24:33] [INFO ] Deduced a trap composed of 4 places in 207 ms of which 1 ms to minimize.
[2022-05-15 16:24:33] [INFO ] Deduced a trap composed of 4 places in 246 ms of which 1 ms to minimize.
[2022-05-15 16:24:33] [INFO ] Deduced a trap composed of 4 places in 209 ms of which 0 ms to minimize.
[2022-05-15 16:24:34] [INFO ] Deduced a trap composed of 4 places in 206 ms of which 0 ms to minimize.
[2022-05-15 16:24:34] [INFO ] Deduced a trap composed of 4 places in 193 ms of which 0 ms to minimize.
[2022-05-15 16:24:34] [INFO ] Deduced a trap composed of 4 places in 192 ms of which 1 ms to minimize.
[2022-05-15 16:24:34] [INFO ] Deduced a trap composed of 4 places in 178 ms of which 0 ms to minimize.
[2022-05-15 16:24:34] [INFO ] Deduced a trap composed of 4 places in 180 ms of which 4 ms to minimize.
[2022-05-15 16:24:35] [INFO ] Deduced a trap composed of 4 places in 168 ms of which 0 ms to minimize.
[2022-05-15 16:24:35] [INFO ] Trap strengthening procedure interrupted after too many repetitions 2434 ms
[2022-05-15 16:24:35] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2434 ms
[2022-05-15 16:24:35] [INFO ] After 2523ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 23 ms.
[2022-05-15 16:24:35] [INFO ] After 2758ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 2 out of 400 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 400/400 places, 10200/10200 transitions.
Applied a total of 0 rules in 367 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 400/400 places, 10200/10200 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 400/400 places, 10200/10200 transitions.
Applied a total of 0 rules in 346 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2022-05-15 16:24:35] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
// Phase 1: matrix 400 rows 400 cols
[2022-05-15 16:24:35] [INFO ] Computed 200 place invariants in 3 ms
[2022-05-15 16:24:37] [INFO ] Implicit Places using invariants in 1387 ms returned []
Implicit Place search using SMT only with invariants took 1388 ms to find 0 implicit places.
[2022-05-15 16:24:37] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
// Phase 1: matrix 400 rows 400 cols
[2022-05-15 16:24:37] [INFO ] Computed 200 place invariants in 1 ms
[2022-05-15 16:24:40] [INFO ] Dead Transitions using invariants and state equation in 3043 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 400/400 places, 10200/10200 transitions.
Graph (complete) has 600 edges and 400 vertex of which 8 are kept as prefixes of interest. Removing 392 places using SCC suffix rule.4 ms
Discarding 392 places :
Also discarding 9996 output transitions
Drop transitions removed 9996 transitions
Ensure Unique test removed 196 transitions
Reduce isomorphic transitions removed 196 transitions.
Iterating post reduction 0 with 196 rules applied. Total rules applied 197 place count 8 transition count 8
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 3 rules applied. Total rules applied 200 place count 6 transition count 7
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 201 place count 6 transition count 6
Applied a total of 201 rules in 23 ms. Remains 6 /400 variables (removed 394) and now considering 6/10200 (removed 10194) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 6 rows 6 cols
[2022-05-15 16:24:40] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-15 16:24:40] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2022-05-15 16:24:40] [INFO ] After 3ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-15 16:24:40] [INFO ] After 5ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2022-05-15 16:24:40] [INFO ] After 23ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
[2022-05-15 16:24:40] [INFO ] Flatten gal took : 1 ms
[2022-05-15 16:24:40] [INFO ] Flatten gal took : 0 ms
[2022-05-15 16:24:40] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12343241472916082130.gal : 1 ms
[2022-05-15 16:24:40] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1515638186577335537.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms11588735298784789545;'/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/ReachabilityCardinality12343241472916082130.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1515638186577335537.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/ReachabilityCardinality1515638186577335537.prop.
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,6,0.012565,3304,2,11,5,40,7,0,36,22,0
Total reachable state count : 6

Verifying 1 reachability properties.
Reachability property AtomicPropp9 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
AtomicPropp9,1,0.013108,3728,2,7,6,40,7,0,39,22,0
Successfully simplified 1 atomic propositions for a total of 7 simplifications.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(p0)))'
Support contains 1 out of 407 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 407/407 places, 10200/10200 transitions.
Applied a total of 0 rules in 91 ms. Remains 407 /407 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2022-05-15 16:24:40] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
// Phase 1: matrix 400 rows 407 cols
[2022-05-15 16:24:40] [INFO ] Computed 207 place invariants in 2 ms
[2022-05-15 16:24:42] [INFO ] Implicit Places using invariants in 1811 ms returned [220, 239, 294, 315, 384, 391, 396]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 1823 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 400/407 places, 10200/10200 transitions.
Applied a total of 0 rules in 95 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 400/407 places, 10200/10200 transitions.
Stuttering acceptance computed with spot in 210 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : Dekker-PT-100-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=3, aps=[p0:(EQ s70 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 425 steps with 141 reset in 21 ms.
FORMULA Dekker-PT-100-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Dekker-PT-100-LTLCardinality-00 finished in 2300 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(((X(p2)||p1)&&p0)))'
Support contains 3 out of 407 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 407/407 places, 10200/10200 transitions.
Applied a total of 0 rules in 90 ms. Remains 407 /407 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2022-05-15 16:24:43] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
// Phase 1: matrix 400 rows 407 cols
[2022-05-15 16:24:43] [INFO ] Computed 207 place invariants in 4 ms
[2022-05-15 16:24:44] [INFO ] Implicit Places using invariants in 1835 ms returned [220, 239, 294, 315, 384, 391, 396]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 1848 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 400/407 places, 10200/10200 transitions.
Applied a total of 0 rules in 92 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 400/407 places, 10200/10200 transitions.
Stuttering acceptance computed with spot in 122 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : Dekker-PT-100-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s196 0) (EQ s399 1)), p1:(OR (EQ s276 1) (EQ s399 0) (EQ s196 1)), p2:(EQ s276 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 0 reset in 2270 ms.
Stack based approach found an accepted trace after 204 steps with 0 reset with depth 205 and stack size 205 in 6 ms.
FORMULA Dekker-PT-100-LTLCardinality-01 FALSE TECHNIQUES STACK_TEST
Treatment of property Dekker-PT-100-LTLCardinality-01 finished in 4453 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X(p0)&&G(F((X(G(!p1)) U p2)))))))'
Support contains 3 out of 407 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 407/407 places, 10200/10200 transitions.
Applied a total of 0 rules in 912 ms. Remains 407 /407 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2022-05-15 16:24:48] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
// Phase 1: matrix 400 rows 407 cols
[2022-05-15 16:24:48] [INFO ] Computed 207 place invariants in 4 ms
[2022-05-15 16:24:50] [INFO ] Implicit Places using invariants in 1806 ms returned [239, 384, 391, 396]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 1816 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 403/407 places, 10200/10200 transitions.
Applied a total of 0 rules in 474 ms. Remains 403 /403 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 403/407 places, 10200/10200 transitions.
Stuttering acceptance computed with spot in 76 ms :[(OR (NOT p0) (NOT p2)), (NOT p2)]
Running random walk in product with property : Dekker-PT-100-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s293 1), p2:(OR (EQ s314 0) (EQ s166 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 358 reset in 2195 ms.
Stack based approach found an accepted trace after 78 steps with 0 reset with depth 79 and stack size 79 in 2 ms.
FORMULA Dekker-PT-100-LTLCardinality-02 FALSE TECHNIQUES STACK_TEST
Treatment of property Dekker-PT-100-LTLCardinality-02 finished in 5512 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(p0))&&G(p1)))'
Support contains 3 out of 407 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 407/407 places, 10200/10200 transitions.
Applied a total of 0 rules in 104 ms. Remains 407 /407 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2022-05-15 16:24:52] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
// Phase 1: matrix 400 rows 407 cols
[2022-05-15 16:24:52] [INFO ] Computed 207 place invariants in 2 ms
[2022-05-15 16:24:54] [INFO ] Implicit Places using invariants in 1846 ms returned [220, 239, 294, 315, 384, 396]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 1858 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 401/407 places, 10200/10200 transitions.
Applied a total of 0 rules in 94 ms. Remains 401 /401 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 401/407 places, 10200/10200 transitions.
Stuttering acceptance computed with spot in 158 ms :[true, (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p1), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : Dekker-PT-100-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={} source=1 dest: 0}, { cond=(AND p1 p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 1}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=p1, acceptance={} source=4 dest: 2}]], initial=4, aps=[p1:(OR (EQ s353 0) (EQ s296 1)), p0:(EQ s386 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 2176 ms.
Product exploration explored 100000 steps with 0 reset in 2314 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X p1), true]
False Knowledge obtained : [(X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X (OR (NOT p1) (NOT p0)))), (X (X (NOT (OR (NOT p1) (NOT p0)))))]
Property proved to be false thanks to negative knowledge :(X (X (NOT (AND p1 p0))))
Knowledge based reduction with 3 factoid took 77 ms. Reduced automaton from 5 states, 9 edges and 2 AP to 1 states, 1 edges and 0 AP.
FORMULA Dekker-PT-100-LTLCardinality-06 FALSE TECHNIQUES KNOWLEDGE
Treatment of property Dekker-PT-100-LTLCardinality-06 finished in 6913 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(X(F(F(X(p0))))))))'
Support contains 2 out of 407 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 407/407 places, 10200/10200 transitions.
Applied a total of 0 rules in 92 ms. Remains 407 /407 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2022-05-15 16:24:59] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
// Phase 1: matrix 400 rows 407 cols
[2022-05-15 16:24:59] [INFO ] Computed 207 place invariants in 3 ms
[2022-05-15 16:25:01] [INFO ] Implicit Places using invariants in 1891 ms returned [220, 239, 294, 315, 384, 391, 396]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 1902 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 400/407 places, 10200/10200 transitions.
Applied a total of 0 rules in 93 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 400/407 places, 10200/10200 transitions.
Stuttering acceptance computed with spot in 178 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Dekker-PT-100-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p0:(OR (EQ s46 0) (EQ s86 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 14595 reset in 2011 ms.
Stack based approach found an accepted trace after 607 steps with 88 reset with depth 19 and stack size 19 in 13 ms.
FORMULA Dekker-PT-100-LTLCardinality-08 FALSE TECHNIQUES STACK_TEST
Treatment of property Dekker-PT-100-LTLCardinality-08 finished in 4312 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(X((F(p0) U p1))) U F(((p1 U X(p1))&&!p0))))'
Support contains 4 out of 407 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 407/407 places, 10200/10200 transitions.
Applied a total of 0 rules in 93 ms. Remains 407 /407 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2022-05-15 16:25:04] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
// Phase 1: matrix 400 rows 407 cols
[2022-05-15 16:25:04] [INFO ] Computed 207 place invariants in 3 ms
[2022-05-15 16:25:06] [INFO ] Implicit Places using invariants in 1865 ms returned [220, 294, 315, 391, 396]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 1874 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 402/407 places, 10200/10200 transitions.
Applied a total of 0 rules in 93 ms. Remains 402 /402 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 402/407 places, 10200/10200 transitions.
Stuttering acceptance computed with spot in 105 ms :[(OR (NOT p1) p0), (NOT p1), (NOT p1)]
Running random walk in product with property : Dekker-PT-100-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s381 0) (EQ s215 1)), p1:(OR (EQ s238 0) (EQ s285 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 1260 reset in 2193 ms.
Stack based approach found an accepted trace after 272 steps with 4 reset with depth 131 and stack size 131 in 6 ms.
FORMULA Dekker-PT-100-LTLCardinality-10 FALSE TECHNIQUES STACK_TEST
Treatment of property Dekker-PT-100-LTLCardinality-10 finished in 4397 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(((F(p0) U (X(p0)||G(p0)))||X(p1))))'
Support contains 4 out of 407 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 407/407 places, 10200/10200 transitions.
Applied a total of 0 rules in 95 ms. Remains 407 /407 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2022-05-15 16:25:08] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
// Phase 1: matrix 400 rows 407 cols
[2022-05-15 16:25:08] [INFO ] Computed 207 place invariants in 1 ms
[2022-05-15 16:25:10] [INFO ] Implicit Places using invariants in 1861 ms returned [220, 239, 294, 315, 384, 391]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 1871 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 401/407 places, 10200/10200 transitions.
Applied a total of 0 rules in 92 ms. Remains 401 /401 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 401/407 places, 10200/10200 transitions.
Stuttering acceptance computed with spot in 145 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Dekker-PT-100-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (EQ s24 0) (EQ s289 1)), p1:(AND (EQ s173 0) (EQ s390 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 14655 reset in 2068 ms.
Stack based approach found an accepted trace after 502 steps with 61 reset with depth 320 and stack size 320 in 12 ms.
FORMULA Dekker-PT-100-LTLCardinality-13 FALSE TECHNIQUES STACK_TEST
Treatment of property Dekker-PT-100-LTLCardinality-13 finished in 4307 ms.
All properties solved by simple procedures.
Total runtime 82961 ms.

BK_STOP 1652631912851

--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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-100"
export BK_EXAMINATION="LTLCardinality"
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-100, examination is LTLCardinality"
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-165254772300627"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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