About the Execution of LoLa+red for Dekker-PT-100
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 5174.707 | 512803.00 | 586926.00 | 2440.40 | FFTFFFFTFFFTFFF? | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r135-smll-167819413300035.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
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 r135-smll-167819413300035
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.4M
-rw-r--r-- 1 mcc users 8.7K Feb 26 01:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K Feb 26 01:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Feb 26 01:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 26 01:46 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Feb 25 15:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 15:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 01:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 117K Feb 26 01:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Feb 26 01:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 41K Feb 26 01:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:56 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 5.9M Mar 5 18:22 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 1678268605976
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Dekker-PT-100
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-08 09:43:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-08 09:43:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 09:43:30] [INFO ] Load time of PNML (sax parser for PT used): 1019 ms
[2023-03-08 09:43:30] [INFO ] Transformed 500 places.
[2023-03-08 09:43:30] [INFO ] Transformed 10200 transitions.
[2023-03-08 09:43:30] [INFO ] Found NUPN structural information;
[2023-03-08 09:43:30] [INFO ] Parsed PT model containing 500 places and 10200 transitions and 80200 arcs in 1246 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA Dekker-PT-100-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-100-LTLCardinality-02 TRUE 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-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-100-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-100-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 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 641 ms. Remains 500 /500 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2023-03-08 09:43:31] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
// Phase 1: matrix 400 rows 500 cols
[2023-03-08 09:43:31] [INFO ] Computed 300 place invariants in 58 ms
[2023-03-08 09:43:42] [INFO ] Implicit Places using invariants in 11076 ms returned [200, 203, 206, 209, 212, 215, 218, 221, 224, 227, 230, 233, 236, 239, 242, 245, 248, 251, 254, 257, 260, 263, 266, 269, 272, 275, 278, 281, 284, 287, 290, 293, 299, 302, 305, 308, 311, 314, 317, 320, 323, 326, 329, 332, 335, 338, 341, 344, 347, 350, 353, 356, 359, 362, 365, 368, 371, 374, 377, 380, 383, 386, 389, 392, 395, 398, 401, 404, 407, 410, 413, 416, 422, 425, 428, 431, 434, 437, 440, 443, 449, 452, 458, 461, 464, 467, 470, 473, 476, 479, 482, 485, 488, 491, 494]
Discarding 95 places :
Implicit Place search using SMT only with invariants took 11148 ms to find 95 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 405/500 places, 10200/10200 transitions.
Applied a total of 0 rules in 155 ms. Remains 405 /405 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 11952 ms. Remains : 405/500 places, 10200/10200 transitions.
Support contains 30 out of 405 places after structural reductions.
[2023-03-08 09:43:43] [INFO ] Flatten gal took : 783 ms
[2023-03-08 09:43:44] [INFO ] Flatten gal took : 501 ms
[2023-03-08 09:43:45] [INFO ] Input system was already deterministic with 10200 transitions.
Support contains 26 out of 405 places (down from 30) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 790 ms. (steps per millisecond=12 ) properties (out of 16) seen :9
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2023-03-08 09:43:46] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
// Phase 1: matrix 400 rows 405 cols
[2023-03-08 09:43:46] [INFO ] Computed 205 place invariants in 6 ms
[2023-03-08 09:43:46] [INFO ] [Real]Absence check using 200 positive place invariants in 52 ms returned sat
[2023-03-08 09:43:46] [INFO ] [Real]Absence check using 200 positive and 5 generalized place invariants in 1 ms returned sat
[2023-03-08 09:43:47] [INFO ] After 407ms SMT Verify possible using state equation in real domain returned unsat :0 sat :4 real:3
[2023-03-08 09:43:47] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-08 09:43:47] [INFO ] After 226ms SMT Verify possible using 100 Read/Feed constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-08 09:43:47] [INFO ] After 1126ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-08 09:43:47] [INFO ] [Nat]Absence check using 200 positive place invariants in 54 ms returned sat
[2023-03-08 09:43:47] [INFO ] [Nat]Absence check using 200 positive and 5 generalized place invariants in 2 ms returned sat
[2023-03-08 09:43:48] [INFO ] After 351ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-08 09:43:48] [INFO ] After 286ms SMT Verify possible using 100 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-08 09:43:48] [INFO ] Deduced a trap composed of 4 places in 470 ms of which 7 ms to minimize.
[2023-03-08 09:43:49] [INFO ] Deduced a trap composed of 4 places in 453 ms of which 1 ms to minimize.
[2023-03-08 09:43:49] [INFO ] Deduced a trap composed of 4 places in 415 ms of which 1 ms to minimize.
[2023-03-08 09:43:50] [INFO ] Deduced a trap composed of 4 places in 398 ms of which 2 ms to minimize.
[2023-03-08 09:43:50] [INFO ] Deduced a trap composed of 4 places in 372 ms of which 1 ms to minimize.
[2023-03-08 09:43:51] [INFO ] Deduced a trap composed of 4 places in 382 ms of which 1 ms to minimize.
[2023-03-08 09:43:51] [INFO ] Deduced a trap composed of 4 places in 375 ms of which 1 ms to minimize.
[2023-03-08 09:43:51] [INFO ] Deduced a trap composed of 4 places in 380 ms of which 0 ms to minimize.
[2023-03-08 09:43:52] [INFO ] Deduced a trap composed of 4 places in 505 ms of which 1 ms to minimize.
[2023-03-08 09:43:52] [INFO ] Deduced a trap composed of 4 places in 491 ms of which 1 ms to minimize.
[2023-03-08 09:43:53] [INFO ] Deduced a trap composed of 4 places in 494 ms of which 1 ms to minimize.
[2023-03-08 09:43:53] [INFO ] Trap strengthening procedure interrupted after too many repetitions 4991 ms
[2023-03-08 09:43:53] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 4991 ms
[2023-03-08 09:43:54] [INFO ] Deduced a trap composed of 4 places in 495 ms of which 1 ms to minimize.
[2023-03-08 09:43:54] [INFO ] Deduced a trap composed of 4 places in 480 ms of which 1 ms to minimize.
[2023-03-08 09:43:54] [INFO ] Deduced a trap composed of 4 places in 323 ms of which 1 ms to minimize.
[2023-03-08 09:43:55] [INFO ] Deduced a trap composed of 4 places in 320 ms of which 0 ms to minimize.
[2023-03-08 09:43:55] [INFO ] Deduced a trap composed of 4 places in 311 ms of which 1 ms to minimize.
[2023-03-08 09:43:55] [INFO ] Deduced a trap composed of 4 places in 405 ms of which 0 ms to minimize.
[2023-03-08 09:43:56] [INFO ] Deduced a trap composed of 4 places in 395 ms of which 0 ms to minimize.
[2023-03-08 09:43:56] [INFO ] Deduced a trap composed of 4 places in 284 ms of which 1 ms to minimize.
[2023-03-08 09:43:57] [INFO ] Deduced a trap composed of 4 places in 310 ms of which 1 ms to minimize.
[2023-03-08 09:43:57] [INFO ] Deduced a trap composed of 4 places in 271 ms of which 0 ms to minimize.
[2023-03-08 09:43:57] [INFO ] Deduced a trap composed of 4 places in 263 ms of which 1 ms to minimize.
[2023-03-08 09:43:57] [INFO ] Trap strengthening procedure interrupted after too many repetitions 4081 ms
[2023-03-08 09:43:57] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 4081 ms
[2023-03-08 09:43:57] [INFO ] Deduced a trap composed of 4 places in 268 ms of which 1 ms to minimize.
[2023-03-08 09:43:58] [INFO ] Deduced a trap composed of 4 places in 342 ms of which 1 ms to minimize.
[2023-03-08 09:43:58] [INFO ] Deduced a trap composed of 4 places in 252 ms of which 1 ms to minimize.
[2023-03-08 09:43:58] [INFO ] Deduced a trap composed of 4 places in 245 ms of which 1 ms to minimize.
[2023-03-08 09:43:59] [INFO ] Deduced a trap composed of 4 places in 307 ms of which 1 ms to minimize.
[2023-03-08 09:43:59] [INFO ] Deduced a trap composed of 4 places in 303 ms of which 0 ms to minimize.
[2023-03-08 09:43:59] [INFO ] Deduced a trap composed of 4 places in 304 ms of which 1 ms to minimize.
[2023-03-08 09:44:00] [INFO ] Deduced a trap composed of 4 places in 287 ms of which 1 ms to minimize.
[2023-03-08 09:44:00] [INFO ] Deduced a trap composed of 4 places in 295 ms of which 1 ms to minimize.
[2023-03-08 09:44:00] [INFO ] Deduced a trap composed of 4 places in 213 ms of which 0 ms to minimize.
[2023-03-08 09:44:00] [INFO ] Deduced a trap composed of 4 places in 268 ms of which 2 ms to minimize.
[2023-03-08 09:44:00] [INFO ] Trap strengthening procedure interrupted after too many repetitions 3314 ms
[2023-03-08 09:44:00] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 3317 ms
[2023-03-08 09:44:01] [INFO ] After 12942ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 166 ms.
[2023-03-08 09:44:01] [INFO ] After 13768ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Fused 7 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 16 ms.
Support contains 11 out of 405 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 405/405 places, 10200/10200 transitions.
Applied a total of 0 rules in 896 ms. Remains 405 /405 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 901 ms. Remains : 405/405 places, 10200/10200 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 464 ms. (steps per millisecond=21 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 108878 steps, run timeout after 3002 ms. (steps per millisecond=36 ) properties seen :{}
Probabilistic random walk after 108878 steps, saw 101001 distinct states, run finished after 3003 ms. (steps per millisecond=36 ) properties seen :0
Running SMT prover for 7 properties.
[2023-03-08 09:44:05] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2023-03-08 09:44:05] [INFO ] Invariant cache hit.
[2023-03-08 09:44:06] [INFO ] [Real]Absence check using 200 positive place invariants in 49 ms returned sat
[2023-03-08 09:44:06] [INFO ] [Real]Absence check using 200 positive and 5 generalized place invariants in 2 ms returned sat
[2023-03-08 09:44:06] [INFO ] After 363ms SMT Verify possible using state equation in real domain returned unsat :0 sat :4 real:3
[2023-03-08 09:44:06] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-08 09:44:06] [INFO ] After 219ms SMT Verify possible using 100 Read/Feed constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-08 09:44:06] [INFO ] After 931ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-08 09:44:07] [INFO ] [Nat]Absence check using 200 positive place invariants in 48 ms returned sat
[2023-03-08 09:44:07] [INFO ] [Nat]Absence check using 200 positive and 5 generalized place invariants in 2 ms returned sat
[2023-03-08 09:44:07] [INFO ] After 335ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-08 09:44:07] [INFO ] After 268ms SMT Verify possible using 100 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-08 09:44:08] [INFO ] Deduced a trap composed of 4 places in 731 ms of which 3 ms to minimize.
[2023-03-08 09:44:09] [INFO ] Deduced a trap composed of 4 places in 464 ms of which 1 ms to minimize.
[2023-03-08 09:44:09] [INFO ] Deduced a trap composed of 4 places in 657 ms of which 1 ms to minimize.
[2023-03-08 09:44:10] [INFO ] Deduced a trap composed of 4 places in 637 ms of which 1 ms to minimize.
[2023-03-08 09:44:10] [INFO ] Deduced a trap composed of 4 places in 453 ms of which 1 ms to minimize.
[2023-03-08 09:44:11] [INFO ] Deduced a trap composed of 4 places in 464 ms of which 2 ms to minimize.
[2023-03-08 09:44:11] [INFO ] Deduced a trap composed of 4 places in 605 ms of which 1 ms to minimize.
[2023-03-08 09:44:12] [INFO ] Deduced a trap composed of 4 places in 436 ms of which 0 ms to minimize.
[2023-03-08 09:44:12] [INFO ] Deduced a trap composed of 4 places in 437 ms of which 1 ms to minimize.
[2023-03-08 09:44:13] [INFO ] Deduced a trap composed of 4 places in 435 ms of which 1 ms to minimize.
[2023-03-08 09:44:13] [INFO ] Deduced a trap composed of 4 places in 429 ms of which 1 ms to minimize.
[2023-03-08 09:44:13] [INFO ] Trap strengthening procedure interrupted after too many repetitions 5965 ms
[2023-03-08 09:44:13] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 5966 ms
[2023-03-08 09:44:14] [INFO ] Deduced a trap composed of 4 places in 448 ms of which 1 ms to minimize.
[2023-03-08 09:44:14] [INFO ] Deduced a trap composed of 4 places in 408 ms of which 0 ms to minimize.
[2023-03-08 09:44:15] [INFO ] Deduced a trap composed of 4 places in 434 ms of which 1 ms to minimize.
[2023-03-08 09:44:15] [INFO ] Deduced a trap composed of 4 places in 543 ms of which 1 ms to minimize.
[2023-03-08 09:44:16] [INFO ] Deduced a trap composed of 4 places in 428 ms of which 0 ms to minimize.
[2023-03-08 09:44:16] [INFO ] Deduced a trap composed of 4 places in 514 ms of which 2 ms to minimize.
[2023-03-08 09:44:17] [INFO ] Deduced a trap composed of 4 places in 429 ms of which 1 ms to minimize.
[2023-03-08 09:44:17] [INFO ] Deduced a trap composed of 4 places in 368 ms of which 0 ms to minimize.
[2023-03-08 09:44:17] [INFO ] Deduced a trap composed of 4 places in 358 ms of which 1 ms to minimize.
[2023-03-08 09:44:18] [INFO ] Deduced a trap composed of 4 places in 363 ms of which 1 ms to minimize.
[2023-03-08 09:44:18] [INFO ] Deduced a trap composed of 4 places in 356 ms of which 1 ms to minimize.
[2023-03-08 09:44:18] [INFO ] Trap strengthening procedure interrupted after too many repetitions 4863 ms
[2023-03-08 09:44:18] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 4863 ms
[2023-03-08 09:44:19] [INFO ] Deduced a trap composed of 4 places in 363 ms of which 3 ms to minimize.
[2023-03-08 09:44:19] [INFO ] Deduced a trap composed of 4 places in 345 ms of which 0 ms to minimize.
[2023-03-08 09:44:19] [INFO ] Deduced a trap composed of 4 places in 318 ms of which 1 ms to minimize.
[2023-03-08 09:44:20] [INFO ] Deduced a trap composed of 4 places in 331 ms of which 0 ms to minimize.
[2023-03-08 09:44:20] [INFO ] Deduced a trap composed of 4 places in 325 ms of which 1 ms to minimize.
[2023-03-08 09:44:20] [INFO ] Deduced a trap composed of 4 places in 317 ms of which 1 ms to minimize.
[2023-03-08 09:44:21] [INFO ] Deduced a trap composed of 4 places in 309 ms of which 1 ms to minimize.
[2023-03-08 09:44:21] [INFO ] Deduced a trap composed of 4 places in 296 ms of which 2 ms to minimize.
[2023-03-08 09:44:21] [INFO ] Deduced a trap composed of 4 places in 306 ms of which 2 ms to minimize.
[2023-03-08 09:44:22] [INFO ] Deduced a trap composed of 4 places in 290 ms of which 1 ms to minimize.
[2023-03-08 09:44:22] [INFO ] Deduced a trap composed of 4 places in 274 ms of which 2 ms to minimize.
[2023-03-08 09:44:22] [INFO ] Trap strengthening procedure interrupted after too many repetitions 3697 ms
[2023-03-08 09:44:22] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 3697 ms
[2023-03-08 09:44:22] [INFO ] After 15030ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 154 ms.
[2023-03-08 09:44:22] [INFO ] After 15786ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Fused 7 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 7 ms.
Support contains 11 out of 405 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 405/405 places, 10200/10200 transitions.
Applied a total of 0 rules in 529 ms. Remains 405 /405 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 529 ms. Remains : 405/405 places, 10200/10200 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 405/405 places, 10200/10200 transitions.
Applied a total of 0 rules in 706 ms. Remains 405 /405 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2023-03-08 09:44:23] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2023-03-08 09:44:23] [INFO ] Invariant cache hit.
[2023-03-08 09:44:26] [INFO ] Implicit Places using invariants in 2663 ms returned [264, 366, 402]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 2685 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 402/405 places, 10200/10200 transitions.
Applied a total of 0 rules in 471 ms. Remains 402 /402 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3866 ms. Remains : 402/405 places, 10200/10200 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 448 ms. (steps per millisecond=22 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 112211 steps, run timeout after 3003 ms. (steps per millisecond=37 ) properties seen :{}
Probabilistic random walk after 112211 steps, saw 104067 distinct states, run finished after 3003 ms. (steps per millisecond=37 ) properties seen :0
Running SMT prover for 7 properties.
[2023-03-08 09:44:30] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
// Phase 1: matrix 400 rows 402 cols
[2023-03-08 09:44:30] [INFO ] Computed 202 place invariants in 3 ms
[2023-03-08 09:44:31] [INFO ] [Real]Absence check using 200 positive place invariants in 48 ms returned sat
[2023-03-08 09:44:31] [INFO ] [Real]Absence check using 200 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 09:44:31] [INFO ] After 346ms SMT Verify possible using state equation in real domain returned unsat :0 sat :5 real:2
[2023-03-08 09:44:31] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-08 09:44:31] [INFO ] After 264ms SMT Verify possible using 100 Read/Feed constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-08 09:44:31] [INFO ] After 944ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-08 09:44:32] [INFO ] [Nat]Absence check using 200 positive place invariants in 71 ms returned sat
[2023-03-08 09:44:32] [INFO ] [Nat]Absence check using 200 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 09:44:32] [INFO ] After 459ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-08 09:44:33] [INFO ] After 428ms SMT Verify possible using 100 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-08 09:44:33] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 0 ms to minimize.
[2023-03-08 09:44:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 114 ms
[2023-03-08 09:44:33] [INFO ] Deduced a trap composed of 4 places in 366 ms of which 1 ms to minimize.
[2023-03-08 09:44:33] [INFO ] Deduced a trap composed of 4 places in 365 ms of which 1 ms to minimize.
[2023-03-08 09:44:34] [INFO ] Deduced a trap composed of 4 places in 346 ms of which 0 ms to minimize.
[2023-03-08 09:44:34] [INFO ] Deduced a trap composed of 4 places in 485 ms of which 1 ms to minimize.
[2023-03-08 09:44:35] [INFO ] Deduced a trap composed of 4 places in 343 ms of which 0 ms to minimize.
[2023-03-08 09:44:35] [INFO ] Deduced a trap composed of 4 places in 439 ms of which 0 ms to minimize.
[2023-03-08 09:44:36] [INFO ] Deduced a trap composed of 4 places in 440 ms of which 1 ms to minimize.
[2023-03-08 09:44:36] [INFO ] Deduced a trap composed of 4 places in 414 ms of which 1 ms to minimize.
[2023-03-08 09:44:36] [INFO ] Deduced a trap composed of 4 places in 417 ms of which 1 ms to minimize.
[2023-03-08 09:44:37] [INFO ] Deduced a trap composed of 4 places in 258 ms of which 1 ms to minimize.
[2023-03-08 09:44:37] [INFO ] Deduced a trap composed of 4 places in 390 ms of which 1 ms to minimize.
[2023-03-08 09:44:37] [INFO ] Trap strengthening procedure interrupted after too many repetitions 4482 ms
[2023-03-08 09:44:37] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 4482 ms
[2023-03-08 09:44:37] [INFO ] Deduced a trap composed of 4 places in 291 ms of which 0 ms to minimize.
[2023-03-08 09:44:38] [INFO ] Deduced a trap composed of 4 places in 365 ms of which 1 ms to minimize.
[2023-03-08 09:44:38] [INFO ] Deduced a trap composed of 4 places in 267 ms of which 1 ms to minimize.
[2023-03-08 09:44:38] [INFO ] Deduced a trap composed of 4 places in 260 ms of which 1 ms to minimize.
[2023-03-08 09:44:39] [INFO ] Deduced a trap composed of 4 places in 330 ms of which 1 ms to minimize.
[2023-03-08 09:44:39] [INFO ] Deduced a trap composed of 4 places in 251 ms of which 0 ms to minimize.
[2023-03-08 09:44:39] [INFO ] Deduced a trap composed of 4 places in 318 ms of which 1 ms to minimize.
[2023-03-08 09:44:40] [INFO ] Deduced a trap composed of 4 places in 304 ms of which 1 ms to minimize.
[2023-03-08 09:44:40] [INFO ] Deduced a trap composed of 4 places in 228 ms of which 1 ms to minimize.
[2023-03-08 09:44:40] [INFO ] Deduced a trap composed of 4 places in 293 ms of which 1 ms to minimize.
[2023-03-08 09:44:41] [INFO ] Deduced a trap composed of 4 places in 276 ms of which 0 ms to minimize.
[2023-03-08 09:44:41] [INFO ] Trap strengthening procedure interrupted after too many repetitions 3383 ms
[2023-03-08 09:44:41] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 3384 ms
[2023-03-08 09:44:41] [INFO ] After 8644ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 148 ms.
[2023-03-08 09:44:41] [INFO ] After 9609ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Fused 7 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 6 ms.
Support contains 11 out of 402 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 402/402 places, 10200/10200 transitions.
Applied a total of 0 rules in 435 ms. Remains 402 /402 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 435 ms. Remains : 402/402 places, 10200/10200 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 402/402 places, 10200/10200 transitions.
Applied a total of 0 rules in 434 ms. Remains 402 /402 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2023-03-08 09:44:42] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2023-03-08 09:44:42] [INFO ] Invariant cache hit.
[2023-03-08 09:44:44] [INFO ] Implicit Places using invariants in 1929 ms returned []
Implicit Place search using SMT only with invariants took 1930 ms to find 0 implicit places.
[2023-03-08 09:44:44] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2023-03-08 09:44:44] [INFO ] Invariant cache hit.
[2023-03-08 09:44:50] [INFO ] Dead Transitions using invariants and state equation in 6594 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8960 ms. Remains : 402/402 places, 10200/10200 transitions.
Graph (complete) has 610 edges and 402 vertex of which 46 are kept as prefixes of interest. Removing 356 places using SCC suffix rule.2 ms
Discarding 356 places :
Also discarding 9078 output transitions
Drop transitions removed 9078 transitions
Ensure Unique test removed 2 places
Ensure Unique test removed 1078 transitions
Reduce isomorphic transitions removed 1078 transitions.
Iterating post reduction 0 with 1080 rules applied. Total rules applied 1081 place count 44 transition count 44
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 1 with 24 rules applied. Total rules applied 1105 place count 28 transition count 36
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 1113 place count 28 transition count 28
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1115 place count 28 transition count 26
Ensure Unique test removed 2 places
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 1121 place count 24 transition count 24
Applied a total of 1121 rules in 67 ms. Remains 24 /402 variables (removed 378) and now considering 24/10200 (removed 10176) transitions.
Running SMT prover for 7 properties.
// Phase 1: matrix 24 rows 24 cols
[2023-03-08 09:44:50] [INFO ] Computed 12 place invariants in 0 ms
[2023-03-08 09:44:50] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-08 09:44:50] [INFO ] After 23ms SMT Verify possible using state equation in real domain returned unsat :0 sat :7
[2023-03-08 09:44:50] [INFO ] After 56ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 33 ms.
[2023-03-08 09:44:51] [INFO ] After 133ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:6
[2023-03-08 09:44:51] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2023-03-08 09:44:51] [INFO ] After 32ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-08 09:44:51] [INFO ] After 73ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 23 ms.
[2023-03-08 09:44:51] [INFO ] After 151ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((p0||(!p1&&(p2||X(G(!p3)))))))))'
Support contains 7 out of 405 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 405/405 places, 10200/10200 transitions.
Applied a total of 0 rules in 202 ms. Remains 405 /405 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2023-03-08 09:44:51] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
// Phase 1: matrix 400 rows 405 cols
[2023-03-08 09:44:51] [INFO ] Computed 205 place invariants in 3 ms
[2023-03-08 09:44:54] [INFO ] Implicit Places using invariants in 2428 ms returned [264, 373, 402]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 2441 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 402/405 places, 10200/10200 transitions.
Applied a total of 0 rules in 204 ms. Remains 402 /402 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2850 ms. Remains : 402/405 places, 10200/10200 transitions.
Stuttering acceptance computed with spot in 406 ms :[true, (OR (AND (NOT p0) (NOT p2) p3) (AND (NOT p0) p1)), (OR p3 (AND (NOT p0) p1)), (OR (AND (NOT p0) (NOT p2) p3) (AND (NOT p0) p1)), (OR (AND (NOT p0) (NOT p2) p3) (AND (NOT p0) p1))]
Running random walk in product with property : Dekker-PT-100-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 0}, { cond=(OR p0 (AND (NOT p1) p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=(OR (AND (NOT p0) p1) p3), acceptance={} source=2 dest: 0}, { cond=(OR (AND p0 (NOT p3)) (AND (NOT p1) (NOT p3))), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=3, aps=[p0:(AND (EQ s365 0) (EQ s27 1)), p1:(OR (EQ s76 0) (EQ s115 1)), p2:(NEQ s63 1), p3:(OR (EQ s375 0) (EQ s346 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]]
Entered a terminal (fully accepting) state of product in 12 steps with 0 reset in 6 ms.
FORMULA Dekker-PT-100-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Dekker-PT-100-LTLCardinality-00 finished in 3376 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 405 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 405/405 places, 10200/10200 transitions.
Applied a total of 0 rules in 1275 ms. Remains 405 /405 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2023-03-08 09:44:56] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2023-03-08 09:44:56] [INFO ] Invariant cache hit.
[2023-03-08 09:44:58] [INFO ] Implicit Places using invariants in 2104 ms returned [264, 347, 366, 373, 402]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 2110 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 400/405 places, 10200/10200 transitions.
Applied a total of 0 rules in 570 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3957 ms. Remains : 400/405 places, 10200/10200 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : Dekker-PT-100-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s330 0) (EQ s283 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 2734 ms.
Stack based approach found an accepted trace after 58 steps with 0 reset with depth 59 and stack size 59 in 3 ms.
FORMULA Dekker-PT-100-LTLCardinality-03 FALSE TECHNIQUES STACK_TEST
Treatment of property Dekker-PT-100-LTLCardinality-03 finished in 6766 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0&&(F(p1) U X(p2))))))'
Support contains 6 out of 405 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 405/405 places, 10200/10200 transitions.
Applied a total of 0 rules in 625 ms. Remains 405 /405 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2023-03-08 09:45:02] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2023-03-08 09:45:02] [INFO ] Invariant cache hit.
[2023-03-08 09:45:04] [INFO ] Implicit Places using invariants in 2435 ms returned [264, 347, 366, 402]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 2448 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 401/405 places, 10200/10200 transitions.
Applied a total of 0 rules in 606 ms. Remains 401 /401 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3680 ms. Remains : 401/405 places, 10200/10200 transitions.
Stuttering acceptance computed with spot in 194 ms :[(OR (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : Dekker-PT-100-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s317 0) (EQ s370 1)), p1:(OR (EQ s289 0) (EQ s298 1)), p2:(OR (EQ s375 0) (EQ s49 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 25011 reset in 2684 ms.
Stack based approach found an accepted trace after 927 steps with 285 reset with depth 11 and stack size 11 in 26 ms.
FORMULA Dekker-PT-100-LTLCardinality-04 FALSE TECHNIQUES STACK_TEST
Treatment of property Dekker-PT-100-LTLCardinality-04 finished in 6622 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 405 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 405/405 places, 10200/10200 transitions.
Applied a total of 0 rules in 565 ms. Remains 405 /405 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2023-03-08 09:45:09] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2023-03-08 09:45:09] [INFO ] Invariant cache hit.
[2023-03-08 09:45:11] [INFO ] Implicit Places using invariants in 2149 ms returned [264, 347, 366, 373, 402]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 2156 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 400/405 places, 10200/10200 transitions.
Applied a total of 0 rules in 555 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3276 ms. Remains : 400/405 places, 10200/10200 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Running random walk in product with property : Dekker-PT-100-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s303 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 2454 ms.
Stack based approach found an accepted trace after 53 steps with 0 reset with depth 54 and stack size 54 in 2 ms.
FORMULA Dekker-PT-100-LTLCardinality-06 FALSE TECHNIQUES STACK_TEST
Treatment of property Dekker-PT-100-LTLCardinality-06 finished in 5808 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 405 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 405/405 places, 10200/10200 transitions.
Applied a total of 0 rules in 544 ms. Remains 405 /405 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2023-03-08 09:45:14] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2023-03-08 09:45:14] [INFO ] Invariant cache hit.
[2023-03-08 09:45:16] [INFO ] Implicit Places using invariants in 2114 ms returned [264, 347, 366, 373, 402]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 2122 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 400/405 places, 10200/10200 transitions.
Applied a total of 0 rules in 553 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3223 ms. Remains : 400/405 places, 10200/10200 transitions.
Stuttering acceptance computed with spot in 53 ms :[(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}]], initial=0, aps=[p0:(AND (EQ s247 0) (EQ s361 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 2628 ms.
Stack based approach found an accepted trace after 80 steps with 0 reset with depth 81 and stack size 81 in 3 ms.
FORMULA Dekker-PT-100-LTLCardinality-08 FALSE TECHNIQUES STACK_TEST
Treatment of property Dekker-PT-100-LTLCardinality-08 finished in 5935 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(G(p0))))))'
Support contains 2 out of 405 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 405/405 places, 10200/10200 transitions.
Applied a total of 0 rules in 120 ms. Remains 405 /405 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2023-03-08 09:45:20] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2023-03-08 09:45:20] [INFO ] Invariant cache hit.
[2023-03-08 09:45:22] [INFO ] Implicit Places using invariants in 2340 ms returned [264, 347, 366, 373, 402]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 2352 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 400/405 places, 10200/10200 transitions.
Applied a total of 0 rules in 209 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2682 ms. Remains : 400/405 places, 10200/10200 transitions.
Stuttering acceptance computed with spot in 223 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Dekker-PT-100-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}]], initial=5, aps=[p0:(AND (NEQ s338 0) (NEQ s34 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, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 1 ms.
FORMULA Dekker-PT-100-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Dekker-PT-100-LTLCardinality-09 finished in 2935 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 1 out of 405 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 405/405 places, 10200/10200 transitions.
Applied a total of 0 rules in 120 ms. Remains 405 /405 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2023-03-08 09:45:23] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2023-03-08 09:45:23] [INFO ] Invariant cache hit.
[2023-03-08 09:45:25] [INFO ] Implicit Places using invariants in 2358 ms returned [264, 347, 366, 373, 402]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 2365 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 400/405 places, 10200/10200 transitions.
Applied a total of 0 rules in 122 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2607 ms. Remains : 400/405 places, 10200/10200 transitions.
Stuttering acceptance computed with spot in 110 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Dekker-PT-100-LTLCardinality-10 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}]], initial=2, aps=[p0:(EQ s83 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][false, false, false]]
Product exploration explored 100000 steps with 1005 reset in 2474 ms.
Stack based approach found an accepted trace after 90 steps with 1 reset with depth 21 and stack size 21 in 4 ms.
FORMULA Dekker-PT-100-LTLCardinality-10 FALSE TECHNIQUES STACK_TEST
Treatment of property Dekker-PT-100-LTLCardinality-10 finished in 5220 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 405 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 405/405 places, 10200/10200 transitions.
Applied a total of 0 rules in 120 ms. Remains 405 /405 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2023-03-08 09:45:28] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2023-03-08 09:45:28] [INFO ] Invariant cache hit.
[2023-03-08 09:45:30] [INFO ] Implicit Places using invariants in 2113 ms returned [264, 347, 366, 373, 402]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 2121 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 400/405 places, 10200/10200 transitions.
Applied a total of 0 rules in 121 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2365 ms. Remains : 400/405 places, 10200/10200 transitions.
Stuttering acceptance computed with spot in 80 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Dekker-PT-100-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s341 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Dekker-PT-100-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Dekker-PT-100-LTLCardinality-14 finished in 2469 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X((p1 U (G(p2)||F(G(p1)))))))'
Support contains 5 out of 405 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 405/405 places, 10200/10200 transitions.
Applied a total of 0 rules in 123 ms. Remains 405 /405 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2023-03-08 09:45:30] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2023-03-08 09:45:30] [INFO ] Invariant cache hit.
[2023-03-08 09:45:33] [INFO ] Implicit Places using invariants in 2095 ms returned [264, 347, 366, 373, 402]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 2103 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 400/405 places, 10200/10200 transitions.
Applied a total of 0 rules in 121 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2349 ms. Remains : 400/405 places, 10200/10200 transitions.
Stuttering acceptance computed with spot in 146 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : Dekker-PT-100-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(AND p0 p2 p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p2 (NOT p1)), acceptance={1} source=1 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0, 1} source=1 dest: 1}], [{ cond=p1, acceptance={0} source=2 dest: 2}, { cond=(NOT p1), acceptance={0, 1} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 2}, { cond=p2, acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(OR (EQ s199 0) (EQ s80 1)), p2:(OR (EQ s373 0) (EQ s399 1)), p0:(EQ s114 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 2473 ms.
Product exploration explored 100000 steps with 0 reset in 2650 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 p2 p0), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND p2 (NOT p1)))), (X p1), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1)))))]
False Knowledge obtained : [(X (AND p0 p2 p1)), (X (NOT (AND p0 p2 p1))), (X (NOT p0)), (X p0), (X (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT p2))), (X (X p2)), (X (X (AND p0 p2 (NOT p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND p0 p2 p1))), (X (X (NOT (AND p0 p2 p1)))), (X (X p1)), (X (X (NOT p1))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 9 factoid took 793 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter sensitive) to 4 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 143 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 740 ms. (steps per millisecond=13 ) properties (out of 9) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) 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
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-08 09:45:40] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
// Phase 1: matrix 400 rows 400 cols
[2023-03-08 09:45:40] [INFO ] Computed 200 place invariants in 2 ms
[2023-03-08 09:45:40] [INFO ] [Real]Absence check using 200 positive place invariants in 58 ms returned sat
[2023-03-08 09:45:41] [INFO ] After 589ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-08 09:45:41] [INFO ] [Nat]Absence check using 200 positive place invariants in 57 ms returned sat
[2023-03-08 09:45:41] [INFO ] After 323ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-08 09:45:41] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-08 09:45:42] [INFO ] After 208ms SMT Verify possible using 100 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-08 09:45:42] [INFO ] Deduced a trap composed of 4 places in 504 ms of which 3 ms to minimize.
[2023-03-08 09:45:43] [INFO ] Deduced a trap composed of 4 places in 393 ms of which 1 ms to minimize.
[2023-03-08 09:45:43] [INFO ] Deduced a trap composed of 4 places in 476 ms of which 0 ms to minimize.
[2023-03-08 09:45:43] [INFO ] Deduced a trap composed of 4 places in 337 ms of which 1 ms to minimize.
[2023-03-08 09:45:44] [INFO ] Deduced a trap composed of 4 places in 439 ms of which 1 ms to minimize.
[2023-03-08 09:45:44] [INFO ] Deduced a trap composed of 4 places in 429 ms of which 1 ms to minimize.
[2023-03-08 09:45:45] [INFO ] Deduced a trap composed of 4 places in 414 ms of which 1 ms to minimize.
[2023-03-08 09:45:45] [INFO ] Deduced a trap composed of 4 places in 504 ms of which 0 ms to minimize.
[2023-03-08 09:45:46] [INFO ] Deduced a trap composed of 4 places in 490 ms of which 0 ms to minimize.
[2023-03-08 09:45:46] [INFO ] Deduced a trap composed of 4 places in 462 ms of which 1 ms to minimize.
[2023-03-08 09:45:47] [INFO ] Deduced a trap composed of 4 places in 448 ms of which 0 ms to minimize.
[2023-03-08 09:45:47] [INFO ] Trap strengthening procedure interrupted after too many repetitions 5170 ms
[2023-03-08 09:45:47] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 5171 ms
[2023-03-08 09:45:47] [INFO ] Deduced a trap composed of 4 places in 437 ms of which 1 ms to minimize.
[2023-03-08 09:45:48] [INFO ] Deduced a trap composed of 4 places in 427 ms of which 1 ms to minimize.
[2023-03-08 09:45:48] [INFO ] Deduced a trap composed of 4 places in 417 ms of which 1 ms to minimize.
[2023-03-08 09:45:49] [INFO ] Deduced a trap composed of 4 places in 369 ms of which 0 ms to minimize.
[2023-03-08 09:45:49] [INFO ] Deduced a trap composed of 4 places in 308 ms of which 0 ms to minimize.
[2023-03-08 09:45:49] [INFO ] Deduced a trap composed of 4 places in 232 ms of which 1 ms to minimize.
[2023-03-08 09:45:49] [INFO ] Deduced a trap composed of 4 places in 226 ms of which 1 ms to minimize.
[2023-03-08 09:45:50] [INFO ] Deduced a trap composed of 4 places in 229 ms of which 0 ms to minimize.
[2023-03-08 09:45:50] [INFO ] Deduced a trap composed of 4 places in 210 ms of which 1 ms to minimize.
[2023-03-08 09:45:50] [INFO ] Deduced a trap composed of 4 places in 202 ms of which 1 ms to minimize.
[2023-03-08 09:45:50] [INFO ] Deduced a trap composed of 4 places in 195 ms of which 0 ms to minimize.
[2023-03-08 09:45:50] [INFO ] Trap strengthening procedure interrupted after too many repetitions 3499 ms
[2023-03-08 09:45:50] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 3499 ms
[2023-03-08 09:45:51] [INFO ] Deduced a trap composed of 4 places in 188 ms of which 1 ms to minimize.
[2023-03-08 09:45:51] [INFO ] Deduced a trap composed of 4 places in 183 ms of which 1 ms to minimize.
[2023-03-08 09:45:51] [INFO ] Deduced a trap composed of 4 places in 176 ms of which 0 ms to minimize.
[2023-03-08 09:45:51] [INFO ] Deduced a trap composed of 4 places in 166 ms of which 1 ms to minimize.
[2023-03-08 09:45:51] [INFO ] Deduced a trap composed of 4 places in 158 ms of which 0 ms to minimize.
[2023-03-08 09:45:51] [INFO ] Deduced a trap composed of 4 places in 155 ms of which 1 ms to minimize.
[2023-03-08 09:45:52] [INFO ] Deduced a trap composed of 4 places in 145 ms of which 1 ms to minimize.
[2023-03-08 09:45:52] [INFO ] Deduced a trap composed of 4 places in 137 ms of which 1 ms to minimize.
[2023-03-08 09:45:52] [INFO ] Deduced a trap composed of 4 places in 128 ms of which 1 ms to minimize.
[2023-03-08 09:45:52] [INFO ] Deduced a trap composed of 4 places in 122 ms of which 0 ms to minimize.
[2023-03-08 09:45:52] [INFO ] Deduced a trap composed of 4 places in 112 ms of which 1 ms to minimize.
[2023-03-08 09:45:52] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1868 ms
[2023-03-08 09:45:52] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1868 ms
[2023-03-08 09:45:52] [INFO ] After 10869ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 92 ms.
[2023-03-08 09:45:52] [INFO ] After 11648ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 6 ms.
Support contains 5 out of 400 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 400/400 places, 10200/10200 transitions.
Applied a total of 0 rules in 424 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 424 ms. Remains : 400/400 places, 10200/10200 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 467 ms. (steps per millisecond=21 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 148369 steps, run timeout after 3002 ms. (steps per millisecond=49 ) properties seen :{}
Probabilistic random walk after 148369 steps, saw 137157 distinct states, run finished after 3002 ms. (steps per millisecond=49 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-08 09:45:56] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2023-03-08 09:45:56] [INFO ] Invariant cache hit.
[2023-03-08 09:45:57] [INFO ] [Real]Absence check using 200 positive place invariants in 46 ms returned sat
[2023-03-08 09:45:57] [INFO ] After 497ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-08 09:45:57] [INFO ] [Nat]Absence check using 200 positive place invariants in 45 ms returned sat
[2023-03-08 09:45:57] [INFO ] After 263ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-08 09:45:57] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-08 09:45:58] [INFO ] After 175ms SMT Verify possible using 100 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-08 09:45:58] [INFO ] Deduced a trap composed of 4 places in 415 ms of which 0 ms to minimize.
[2023-03-08 09:45:58] [INFO ] Deduced a trap composed of 4 places in 390 ms of which 1 ms to minimize.
[2023-03-08 09:45:59] [INFO ] Deduced a trap composed of 4 places in 386 ms of which 0 ms to minimize.
[2023-03-08 09:45:59] [INFO ] Deduced a trap composed of 4 places in 373 ms of which 0 ms to minimize.
[2023-03-08 09:46:00] [INFO ] Deduced a trap composed of 4 places in 389 ms of which 1 ms to minimize.
[2023-03-08 09:46:00] [INFO ] Deduced a trap composed of 4 places in 362 ms of which 1 ms to minimize.
[2023-03-08 09:46:00] [INFO ] Deduced a trap composed of 4 places in 365 ms of which 0 ms to minimize.
[2023-03-08 09:46:01] [INFO ] Deduced a trap composed of 4 places in 356 ms of which 1 ms to minimize.
[2023-03-08 09:46:01] [INFO ] Deduced a trap composed of 4 places in 349 ms of which 1 ms to minimize.
[2023-03-08 09:46:02] [INFO ] Deduced a trap composed of 4 places in 340 ms of which 1 ms to minimize.
[2023-03-08 09:46:02] [INFO ] Deduced a trap composed of 4 places in 333 ms of which 0 ms to minimize.
[2023-03-08 09:46:02] [INFO ] Trap strengthening procedure interrupted after too many repetitions 4259 ms
[2023-03-08 09:46:02] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 4259 ms
[2023-03-08 09:46:02] [INFO ] Deduced a trap composed of 4 places in 318 ms of which 0 ms to minimize.
[2023-03-08 09:46:03] [INFO ] Deduced a trap composed of 4 places in 317 ms of which 0 ms to minimize.
[2023-03-08 09:46:03] [INFO ] Deduced a trap composed of 4 places in 306 ms of which 0 ms to minimize.
[2023-03-08 09:46:03] [INFO ] Deduced a trap composed of 4 places in 301 ms of which 2 ms to minimize.
[2023-03-08 09:46:04] [INFO ] Deduced a trap composed of 4 places in 288 ms of which 1 ms to minimize.
[2023-03-08 09:46:04] [INFO ] Deduced a trap composed of 4 places in 281 ms of which 1 ms to minimize.
[2023-03-08 09:46:04] [INFO ] Deduced a trap composed of 4 places in 279 ms of which 1 ms to minimize.
[2023-03-08 09:46:04] [INFO ] Deduced a trap composed of 4 places in 268 ms of which 1 ms to minimize.
[2023-03-08 09:46:05] [INFO ] Deduced a trap composed of 4 places in 260 ms of which 1 ms to minimize.
[2023-03-08 09:46:05] [INFO ] Deduced a trap composed of 4 places in 251 ms of which 1 ms to minimize.
[2023-03-08 09:46:05] [INFO ] Deduced a trap composed of 4 places in 239 ms of which 1 ms to minimize.
[2023-03-08 09:46:05] [INFO ] Trap strengthening procedure interrupted after too many repetitions 3309 ms
[2023-03-08 09:46:05] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 3309 ms
[2023-03-08 09:46:06] [INFO ] Deduced a trap composed of 4 places in 247 ms of which 0 ms to minimize.
[2023-03-08 09:46:06] [INFO ] Deduced a trap composed of 4 places in 243 ms of which 0 ms to minimize.
[2023-03-08 09:46:06] [INFO ] Deduced a trap composed of 4 places in 232 ms of which 0 ms to minimize.
[2023-03-08 09:46:06] [INFO ] Deduced a trap composed of 4 places in 218 ms of which 1 ms to minimize.
[2023-03-08 09:46:06] [INFO ] Deduced a trap composed of 4 places in 215 ms of which 1 ms to minimize.
[2023-03-08 09:46:07] [INFO ] Deduced a trap composed of 4 places in 212 ms of which 1 ms to minimize.
[2023-03-08 09:46:07] [INFO ] Deduced a trap composed of 4 places in 208 ms of which 0 ms to minimize.
[2023-03-08 09:46:07] [INFO ] Deduced a trap composed of 4 places in 206 ms of which 0 ms to minimize.
[2023-03-08 09:46:07] [INFO ] Deduced a trap composed of 4 places in 196 ms of which 1 ms to minimize.
[2023-03-08 09:46:08] [INFO ] Deduced a trap composed of 4 places in 196 ms of which 1 ms to minimize.
[2023-03-08 09:46:08] [INFO ] Deduced a trap composed of 4 places in 186 ms of which 0 ms to minimize.
[2023-03-08 09:46:08] [INFO ] Trap strengthening procedure interrupted after too many repetitions 2561 ms
[2023-03-08 09:46:08] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2562 ms
[2023-03-08 09:46:08] [INFO ] After 10412ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 93 ms.
[2023-03-08 09:46:08] [INFO ] After 11029ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 5 ms.
Support contains 5 out of 400 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 400/400 places, 10200/10200 transitions.
Applied a total of 0 rules in 413 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 413 ms. Remains : 400/400 places, 10200/10200 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 400/400 places, 10200/10200 transitions.
Applied a total of 0 rules in 416 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2023-03-08 09:46:09] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2023-03-08 09:46:09] [INFO ] Invariant cache hit.
[2023-03-08 09:46:11] [INFO ] Implicit Places using invariants in 1782 ms returned []
Implicit Place search using SMT only with invariants took 1783 ms to find 0 implicit places.
[2023-03-08 09:46:11] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2023-03-08 09:46:11] [INFO ] Invariant cache hit.
[2023-03-08 09:46:19] [INFO ] Dead Transitions using invariants and state equation in 8222 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10424 ms. Remains : 400/400 places, 10200/10200 transitions.
Graph (complete) has 600 edges and 400 vertex of which 16 are kept as prefixes of interest. Removing 384 places using SCC suffix rule.2 ms
Discarding 384 places :
Also discarding 9792 output transitions
Drop transitions removed 9792 transitions
Ensure Unique test removed 392 transitions
Reduce isomorphic transitions removed 392 transitions.
Iterating post reduction 0 with 392 rules applied. Total rules applied 393 place count 16 transition count 16
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 396 place count 14 transition count 15
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 397 place count 14 transition count 14
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 399 place count 14 transition count 12
Ensure Unique test removed 2 places
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 405 place count 10 transition count 10
Applied a total of 405 rules in 15 ms. Remains 10 /400 variables (removed 390) and now considering 10/10200 (removed 10190) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 10 rows 10 cols
[2023-03-08 09:46:19] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-08 09:46:19] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-08 09:46:19] [INFO ] After 12ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:3
[2023-03-08 09:46:19] [INFO ] After 15ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-08 09:46:19] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-08 09:46:19] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-08 09:46:19] [INFO ] After 13ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-08 09:46:19] [INFO ] After 25ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-08 09:46:19] [INFO ] After 64ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Knowledge obtained : [(AND p1 p2 p0), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND p2 (NOT p1)))), (X p1), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1)))))]
False Knowledge obtained : [(X (AND p0 p2 p1)), (X (NOT (AND p0 p2 p1))), (X (NOT p0)), (X p0), (X (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT p2))), (X (X p2)), (X (X (AND p0 p2 (NOT p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND p0 p2 p1))), (X (X (NOT (AND p0 p2 p1)))), (X (X p1)), (X (X (NOT p1))), (X (X (NOT p0))), (X (X p0)), (F (NOT (AND p0 p1 p2))), (F (NOT p0)), (F (AND p0 (NOT p1) p2)), (F (NOT p1)), (F (AND (NOT p1) p2))]
Knowledge based reduction with 9 factoid took 840 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter sensitive) to 4 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 143 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 136 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2))]
Support contains 5 out of 400 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 400/400 places, 10200/10200 transitions.
Applied a total of 0 rules in 120 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2023-03-08 09:46:20] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
// Phase 1: matrix 400 rows 400 cols
[2023-03-08 09:46:20] [INFO ] Computed 200 place invariants in 8 ms
[2023-03-08 09:46:22] [INFO ] Implicit Places using invariants in 1772 ms returned []
Implicit Place search using SMT only with invariants took 1774 ms to find 0 implicit places.
[2023-03-08 09:46:22] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2023-03-08 09:46:22] [INFO ] Invariant cache hit.
[2023-03-08 09:46:28] [INFO ] Dead Transitions using invariants and state equation in 5635 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7543 ms. Remains : 400/400 places, 10200/10200 transitions.
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 p2 p0), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p0 (NOT p1) p2))), (X p1), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(X (AND p0 p1 p2)), (X (NOT (AND p0 p1 p2))), (X (NOT p0)), (X p0), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT p2))), (X (X p2)), (X (X (AND p0 p1 p2))), (X (X (NOT (AND p0 p1 p2)))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X p1)), (X (X (NOT p1))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 9 factoid took 1310 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter sensitive) to 4 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 148 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 540 ms. (steps per millisecond=18 ) properties (out of 9) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-08 09:46:30] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2023-03-08 09:46:30] [INFO ] Invariant cache hit.
[2023-03-08 09:46:30] [INFO ] [Real]Absence check using 200 positive place invariants in 47 ms returned sat
[2023-03-08 09:46:30] [INFO ] After 490ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-08 09:46:31] [INFO ] [Nat]Absence check using 200 positive place invariants in 57 ms returned sat
[2023-03-08 09:46:31] [INFO ] After 320ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-08 09:46:31] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-08 09:46:31] [INFO ] After 209ms SMT Verify possible using 100 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-08 09:46:32] [INFO ] Deduced a trap composed of 4 places in 574 ms of which 1 ms to minimize.
[2023-03-08 09:46:33] [INFO ] Deduced a trap composed of 4 places in 540 ms of which 1 ms to minimize.
[2023-03-08 09:46:33] [INFO ] Deduced a trap composed of 4 places in 396 ms of which 1 ms to minimize.
[2023-03-08 09:46:33] [INFO ] Deduced a trap composed of 4 places in 389 ms of which 0 ms to minimize.
[2023-03-08 09:46:34] [INFO ] Deduced a trap composed of 4 places in 505 ms of which 1 ms to minimize.
[2023-03-08 09:46:34] [INFO ] Deduced a trap composed of 4 places in 482 ms of which 0 ms to minimize.
[2023-03-08 09:46:35] [INFO ] Deduced a trap composed of 4 places in 392 ms of which 0 ms to minimize.
[2023-03-08 09:46:35] [INFO ] Deduced a trap composed of 4 places in 348 ms of which 0 ms to minimize.
[2023-03-08 09:46:36] [INFO ] Deduced a trap composed of 4 places in 344 ms of which 0 ms to minimize.
[2023-03-08 09:46:36] [INFO ] Deduced a trap composed of 4 places in 445 ms of which 0 ms to minimize.
[2023-03-08 09:46:36] [INFO ] Deduced a trap composed of 4 places in 335 ms of which 0 ms to minimize.
[2023-03-08 09:46:36] [INFO ] Trap strengthening procedure interrupted after too many repetitions 4961 ms
[2023-03-08 09:46:36] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 4961 ms
[2023-03-08 09:46:37] [INFO ] Deduced a trap composed of 4 places in 332 ms of which 1 ms to minimize.
[2023-03-08 09:46:37] [INFO ] Deduced a trap composed of 4 places in 316 ms of which 0 ms to minimize.
[2023-03-08 09:46:37] [INFO ] Deduced a trap composed of 4 places in 304 ms of which 1 ms to minimize.
[2023-03-08 09:46:38] [INFO ] Deduced a trap composed of 4 places in 293 ms of which 1 ms to minimize.
[2023-03-08 09:46:38] [INFO ] Deduced a trap composed of 4 places in 378 ms of which 1 ms to minimize.
[2023-03-08 09:46:38] [INFO ] Deduced a trap composed of 4 places in 284 ms of which 1 ms to minimize.
[2023-03-08 09:46:39] [INFO ] Deduced a trap composed of 4 places in 358 ms of which 0 ms to minimize.
[2023-03-08 09:46:39] [INFO ] Deduced a trap composed of 4 places in 263 ms of which 0 ms to minimize.
[2023-03-08 09:46:39] [INFO ] Deduced a trap composed of 4 places in 337 ms of which 0 ms to minimize.
[2023-03-08 09:46:40] [INFO ] Deduced a trap composed of 4 places in 255 ms of which 1 ms to minimize.
[2023-03-08 09:46:40] [INFO ] Deduced a trap composed of 4 places in 246 ms of which 0 ms to minimize.
[2023-03-08 09:46:40] [INFO ] Trap strengthening procedure interrupted after too many repetitions 3581 ms
[2023-03-08 09:46:40] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 3582 ms
[2023-03-08 09:46:40] [INFO ] Deduced a trap composed of 4 places in 249 ms of which 1 ms to minimize.
[2023-03-08 09:46:41] [INFO ] Deduced a trap composed of 4 places in 270 ms of which 0 ms to minimize.
[2023-03-08 09:46:41] [INFO ] Deduced a trap composed of 4 places in 226 ms of which 1 ms to minimize.
[2023-03-08 09:46:41] [INFO ] Deduced a trap composed of 4 places in 229 ms of which 0 ms to minimize.
[2023-03-08 09:46:41] [INFO ] Deduced a trap composed of 4 places in 212 ms of which 0 ms to minimize.
[2023-03-08 09:46:42] [INFO ] Deduced a trap composed of 4 places in 203 ms of which 0 ms to minimize.
[2023-03-08 09:46:42] [INFO ] Deduced a trap composed of 4 places in 220 ms of which 0 ms to minimize.
[2023-03-08 09:46:42] [INFO ] Deduced a trap composed of 4 places in 203 ms of which 0 ms to minimize.
[2023-03-08 09:46:42] [INFO ] Deduced a trap composed of 4 places in 199 ms of which 0 ms to minimize.
[2023-03-08 09:46:42] [INFO ] Deduced a trap composed of 4 places in 188 ms of which 1 ms to minimize.
[2023-03-08 09:46:43] [INFO ] Deduced a trap composed of 4 places in 183 ms of which 1 ms to minimize.
[2023-03-08 09:46:43] [INFO ] Trap strengthening procedure interrupted after too many repetitions 2611 ms
[2023-03-08 09:46:43] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2612 ms
[2023-03-08 09:46:43] [INFO ] After 11482ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 93 ms.
[2023-03-08 09:46:43] [INFO ] After 12263ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 6 ms.
Support contains 5 out of 400 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 400/400 places, 10200/10200 transitions.
Applied a total of 0 rules in 418 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 418 ms. Remains : 400/400 places, 10200/10200 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 549 ms. (steps per millisecond=18 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 134027 steps, run timeout after 3002 ms. (steps per millisecond=44 ) properties seen :{}
Probabilistic random walk after 134027 steps, saw 124046 distinct states, run finished after 3002 ms. (steps per millisecond=44 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-08 09:46:47] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2023-03-08 09:46:47] [INFO ] Invariant cache hit.
[2023-03-08 09:46:47] [INFO ] [Real]Absence check using 200 positive place invariants in 44 ms returned sat
[2023-03-08 09:46:47] [INFO ] After 608ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-08 09:46:48] [INFO ] [Nat]Absence check using 200 positive place invariants in 46 ms returned sat
[2023-03-08 09:46:48] [INFO ] After 266ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-08 09:46:48] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-08 09:46:48] [INFO ] After 172ms SMT Verify possible using 100 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-08 09:46:49] [INFO ] Deduced a trap composed of 4 places in 555 ms of which 1 ms to minimize.
[2023-03-08 09:46:49] [INFO ] Deduced a trap composed of 4 places in 536 ms of which 1 ms to minimize.
[2023-03-08 09:46:50] [INFO ] Deduced a trap composed of 4 places in 517 ms of which 1 ms to minimize.
[2023-03-08 09:46:50] [INFO ] Deduced a trap composed of 4 places in 510 ms of which 1 ms to minimize.
[2023-03-08 09:46:51] [INFO ] Deduced a trap composed of 4 places in 499 ms of which 1 ms to minimize.
[2023-03-08 09:46:51] [INFO ] Deduced a trap composed of 4 places in 362 ms of which 1 ms to minimize.
[2023-03-08 09:46:52] [INFO ] Deduced a trap composed of 4 places in 477 ms of which 1 ms to minimize.
[2023-03-08 09:46:52] [INFO ] Deduced a trap composed of 4 places in 362 ms of which 1 ms to minimize.
[2023-03-08 09:46:53] [INFO ] Deduced a trap composed of 4 places in 385 ms of which 0 ms to minimize.
[2023-03-08 09:46:53] [INFO ] Deduced a trap composed of 4 places in 342 ms of which 1 ms to minimize.
[2023-03-08 09:46:53] [INFO ] Deduced a trap composed of 4 places in 423 ms of which 1 ms to minimize.
[2023-03-08 09:46:53] [INFO ] Trap strengthening procedure interrupted after too many repetitions 5169 ms
[2023-03-08 09:46:53] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 5170 ms
[2023-03-08 09:46:54] [INFO ] Deduced a trap composed of 4 places in 451 ms of which 0 ms to minimize.
[2023-03-08 09:46:54] [INFO ] Deduced a trap composed of 4 places in 439 ms of which 1 ms to minimize.
[2023-03-08 09:46:55] [INFO ] Deduced a trap composed of 4 places in 420 ms of which 1 ms to minimize.
[2023-03-08 09:46:55] [INFO ] Deduced a trap composed of 4 places in 405 ms of which 1 ms to minimize.
[2023-03-08 09:46:56] [INFO ] Deduced a trap composed of 4 places in 411 ms of which 1 ms to minimize.
[2023-03-08 09:46:56] [INFO ] Deduced a trap composed of 4 places in 398 ms of which 1 ms to minimize.
[2023-03-08 09:46:56] [INFO ] Deduced a trap composed of 4 places in 365 ms of which 1 ms to minimize.
[2023-03-08 09:46:57] [INFO ] Deduced a trap composed of 4 places in 267 ms of which 0 ms to minimize.
[2023-03-08 09:46:57] [INFO ] Deduced a trap composed of 4 places in 370 ms of which 1 ms to minimize.
[2023-03-08 09:46:57] [INFO ] Deduced a trap composed of 4 places in 349 ms of which 1 ms to minimize.
[2023-03-08 09:46:58] [INFO ] Deduced a trap composed of 4 places in 335 ms of which 1 ms to minimize.
[2023-03-08 09:46:58] [INFO ] Trap strengthening procedure interrupted after too many repetitions 4459 ms
[2023-03-08 09:46:58] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 4460 ms
[2023-03-08 09:46:58] [INFO ] Deduced a trap composed of 4 places in 337 ms of which 0 ms to minimize.
[2023-03-08 09:46:59] [INFO ] Deduced a trap composed of 4 places in 326 ms of which 1 ms to minimize.
[2023-03-08 09:46:59] [INFO ] Deduced a trap composed of 4 places in 311 ms of which 1 ms to minimize.
[2023-03-08 09:46:59] [INFO ] Deduced a trap composed of 4 places in 300 ms of which 0 ms to minimize.
[2023-03-08 09:47:00] [INFO ] Deduced a trap composed of 4 places in 293 ms of which 1 ms to minimize.
[2023-03-08 09:47:00] [INFO ] Deduced a trap composed of 4 places in 290 ms of which 1 ms to minimize.
[2023-03-08 09:47:00] [INFO ] Deduced a trap composed of 4 places in 303 ms of which 1 ms to minimize.
[2023-03-08 09:47:00] [INFO ] Deduced a trap composed of 4 places in 284 ms of which 0 ms to minimize.
[2023-03-08 09:47:01] [INFO ] Deduced a trap composed of 4 places in 276 ms of which 1 ms to minimize.
[2023-03-08 09:47:01] [INFO ] Deduced a trap composed of 4 places in 258 ms of which 1 ms to minimize.
[2023-03-08 09:47:01] [INFO ] Deduced a trap composed of 4 places in 249 ms of which 0 ms to minimize.
[2023-03-08 09:47:01] [INFO ] Trap strengthening procedure interrupted after too many repetitions 3461 ms
[2023-03-08 09:47:01] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 3462 ms
[2023-03-08 09:47:01] [INFO ] After 13396ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 111 ms.
[2023-03-08 09:47:02] [INFO ] After 14041ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 9 ms.
Support contains 5 out of 400 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 400/400 places, 10200/10200 transitions.
Applied a total of 0 rules in 709 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 710 ms. Remains : 400/400 places, 10200/10200 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 400/400 places, 10200/10200 transitions.
Applied a total of 0 rules in 445 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2023-03-08 09:47:03] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2023-03-08 09:47:03] [INFO ] Invariant cache hit.
[2023-03-08 09:47:05] [INFO ] Implicit Places using invariants in 2009 ms returned []
Implicit Place search using SMT only with invariants took 2011 ms to find 0 implicit places.
[2023-03-08 09:47:05] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2023-03-08 09:47:05] [INFO ] Invariant cache hit.
[2023-03-08 09:47:11] [INFO ] Dead Transitions using invariants and state equation in 6463 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8922 ms. Remains : 400/400 places, 10200/10200 transitions.
Graph (complete) has 600 edges and 400 vertex of which 16 are kept as prefixes of interest. Removing 384 places using SCC suffix rule.2 ms
Discarding 384 places :
Also discarding 9792 output transitions
Drop transitions removed 9792 transitions
Ensure Unique test removed 392 transitions
Reduce isomorphic transitions removed 392 transitions.
Iterating post reduction 0 with 392 rules applied. Total rules applied 393 place count 16 transition count 16
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 396 place count 14 transition count 15
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 397 place count 14 transition count 14
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 399 place count 14 transition count 12
Ensure Unique test removed 2 places
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 405 place count 10 transition count 10
Applied a total of 405 rules in 12 ms. Remains 10 /400 variables (removed 390) and now considering 10/10200 (removed 10190) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 10 rows 10 cols
[2023-03-08 09:47:11] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-08 09:47:11] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-08 09:47:11] [INFO ] After 13ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:3
[2023-03-08 09:47:11] [INFO ] After 16ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-08 09:47:11] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-08 09:47:11] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-08 09:47:11] [INFO ] After 13ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-08 09:47:11] [INFO ] After 24ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-03-08 09:47:11] [INFO ] After 58ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Knowledge obtained : [(AND p1 p2 p0), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p0 (NOT p1) p2))), (X p1), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(X (AND p0 p1 p2)), (X (NOT (AND p0 p1 p2))), (X (NOT p0)), (X p0), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT p2))), (X (X p2)), (X (X (AND p0 p1 p2))), (X (X (NOT (AND p0 p1 p2)))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X p1)), (X (X (NOT p1))), (X (X (NOT p0))), (X (X p0)), (F (NOT (AND p0 p1 p2))), (F (NOT p0)), (F (AND p0 (NOT p1) p2)), (F (NOT p1)), (F (AND (NOT p1) p2))]
Knowledge based reduction with 9 factoid took 834 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter sensitive) to 4 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 141 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 252 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 0 reset in 2484 ms.
Product exploration explored 100000 steps with 0 reset in 3051 ms.
Applying partial POR strategy [true, false, true, true]
Stuttering acceptance computed with spot in 159 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2))]
Support contains 5 out of 400 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 400/400 places, 10200/10200 transitions.
Applied a total of 0 rules in 1072 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2023-03-08 09:47:20] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
// Phase 1: matrix 400 rows 400 cols
[2023-03-08 09:47:20] [INFO ] Computed 200 place invariants in 2 ms
[2023-03-08 09:47:28] [INFO ] Dead Transitions using invariants and state equation in 8132 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9207 ms. Remains : 400/400 places, 10200/10200 transitions.
Support contains 5 out of 400 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 400/400 places, 10200/10200 transitions.
Applied a total of 0 rules in 122 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2023-03-08 09:47:28] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2023-03-08 09:47:28] [INFO ] Invariant cache hit.
[2023-03-08 09:47:30] [INFO ] Implicit Places using invariants in 1758 ms returned []
Implicit Place search using SMT only with invariants took 1760 ms to find 0 implicit places.
[2023-03-08 09:47:30] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2023-03-08 09:47:30] [INFO ] Invariant cache hit.
[2023-03-08 09:47:38] [INFO ] Dead Transitions using invariants and state equation in 8104 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9987 ms. Remains : 400/400 places, 10200/10200 transitions.
Treatment of property Dekker-PT-100-LTLCardinality-15 finished in 128189 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X((p1 U (G(p2)||F(G(p1)))))))'
Found a Lengthening insensitive property : Dekker-PT-100-LTLCardinality-15
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2))]
Support contains 5 out of 405 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 405/405 places, 10200/10200 transitions.
Applied a total of 0 rules in 316 ms. Remains 405 /405 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2023-03-08 09:47:39] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
// Phase 1: matrix 400 rows 405 cols
[2023-03-08 09:47:39] [INFO ] Computed 205 place invariants in 3 ms
[2023-03-08 09:47:41] [INFO ] Implicit Places using invariants in 2123 ms returned [264, 347, 366, 373, 402]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 2129 ms to find 5 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 400/405 places, 10200/10200 transitions.
Applied a total of 0 rules in 294 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 2739 ms. Remains : 400/405 places, 10200/10200 transitions.
Running random walk in product with property : Dekker-PT-100-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(AND p0 p2 p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p2 (NOT p1)), acceptance={1} source=1 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0, 1} source=1 dest: 1}], [{ cond=p1, acceptance={0} source=2 dest: 2}, { cond=(NOT p1), acceptance={0, 1} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 2}, { cond=p2, acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(OR (EQ s199 0) (EQ s80 1)), p2:(OR (EQ s373 0) (EQ s399 1)), p0:(EQ s114 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 2457 ms.
Product exploration explored 100000 steps with 0 reset in 2675 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 p2 p0), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND p2 (NOT p1)))), (X p1), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1)))))]
False Knowledge obtained : [(X (AND p0 p2 p1)), (X (NOT (AND p0 p2 p1))), (X (NOT p0)), (X p0), (X (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT p2))), (X (X p2)), (X (X (AND p0 p2 (NOT p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND p0 p2 p1))), (X (X (NOT (AND p0 p2 p1)))), (X (X p1)), (X (X (NOT p1))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 9 factoid took 822 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter sensitive) to 4 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 175 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 463 ms. (steps per millisecond=21 ) properties (out of 9) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-08 09:47:48] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
// Phase 1: matrix 400 rows 400 cols
[2023-03-08 09:47:48] [INFO ] Computed 200 place invariants in 1 ms
[2023-03-08 09:47:49] [INFO ] [Real]Absence check using 200 positive place invariants in 72 ms returned sat
[2023-03-08 09:47:49] [INFO ] After 685ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-08 09:47:49] [INFO ] [Nat]Absence check using 200 positive place invariants in 48 ms returned sat
[2023-03-08 09:47:50] [INFO ] After 272ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-08 09:47:50] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-08 09:47:50] [INFO ] After 178ms SMT Verify possible using 100 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-08 09:47:50] [INFO ] Deduced a trap composed of 4 places in 355 ms of which 0 ms to minimize.
[2023-03-08 09:47:51] [INFO ] Deduced a trap composed of 4 places in 349 ms of which 0 ms to minimize.
[2023-03-08 09:47:51] [INFO ] Deduced a trap composed of 4 places in 335 ms of which 1 ms to minimize.
[2023-03-08 09:47:51] [INFO ] Deduced a trap composed of 4 places in 338 ms of which 0 ms to minimize.
[2023-03-08 09:47:52] [INFO ] Deduced a trap composed of 4 places in 327 ms of which 0 ms to minimize.
[2023-03-08 09:47:52] [INFO ] Deduced a trap composed of 4 places in 319 ms of which 0 ms to minimize.
[2023-03-08 09:47:52] [INFO ] Deduced a trap composed of 4 places in 309 ms of which 1 ms to minimize.
[2023-03-08 09:47:53] [INFO ] Deduced a trap composed of 4 places in 305 ms of which 1 ms to minimize.
[2023-03-08 09:47:53] [INFO ] Deduced a trap composed of 4 places in 293 ms of which 0 ms to minimize.
[2023-03-08 09:47:53] [INFO ] Deduced a trap composed of 4 places in 290 ms of which 0 ms to minimize.
[2023-03-08 09:47:54] [INFO ] Deduced a trap composed of 4 places in 276 ms of which 1 ms to minimize.
[2023-03-08 09:47:54] [INFO ] Trap strengthening procedure interrupted after too many repetitions 3691 ms
[2023-03-08 09:47:54] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 3691 ms
[2023-03-08 09:47:54] [INFO ] Deduced a trap composed of 4 places in 274 ms of which 0 ms to minimize.
[2023-03-08 09:47:54] [INFO ] Deduced a trap composed of 4 places in 264 ms of which 1 ms to minimize.
[2023-03-08 09:47:54] [INFO ] Deduced a trap composed of 4 places in 257 ms of which 1 ms to minimize.
[2023-03-08 09:47:55] [INFO ] Deduced a trap composed of 4 places in 246 ms of which 1 ms to minimize.
[2023-03-08 09:47:55] [INFO ] Deduced a trap composed of 4 places in 234 ms of which 0 ms to minimize.
[2023-03-08 09:47:55] [INFO ] Deduced a trap composed of 4 places in 244 ms of which 2 ms to minimize.
[2023-03-08 09:47:55] [INFO ] Deduced a trap composed of 4 places in 224 ms of which 1 ms to minimize.
[2023-03-08 09:47:56] [INFO ] Deduced a trap composed of 4 places in 213 ms of which 1 ms to minimize.
[2023-03-08 09:47:56] [INFO ] Deduced a trap composed of 4 places in 211 ms of which 1 ms to minimize.
[2023-03-08 09:47:56] [INFO ] Deduced a trap composed of 4 places in 201 ms of which 0 ms to minimize.
[2023-03-08 09:47:56] [INFO ] Deduced a trap composed of 4 places in 194 ms of which 1 ms to minimize.
[2023-03-08 09:47:56] [INFO ] Trap strengthening procedure interrupted after too many repetitions 2757 ms
[2023-03-08 09:47:56] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2758 ms
[2023-03-08 09:47:57] [INFO ] Deduced a trap composed of 4 places in 194 ms of which 1 ms to minimize.
[2023-03-08 09:47:57] [INFO ] Deduced a trap composed of 4 places in 186 ms of which 3 ms to minimize.
[2023-03-08 09:47:57] [INFO ] Deduced a trap composed of 4 places in 176 ms of which 1 ms to minimize.
[2023-03-08 09:47:57] [INFO ] Deduced a trap composed of 4 places in 232 ms of which 1 ms to minimize.
[2023-03-08 09:47:57] [INFO ] Deduced a trap composed of 4 places in 221 ms of which 1 ms to minimize.
[2023-03-08 09:47:58] [INFO ] Deduced a trap composed of 4 places in 207 ms of which 0 ms to minimize.
[2023-03-08 09:47:58] [INFO ] Deduced a trap composed of 4 places in 199 ms of which 1 ms to minimize.
[2023-03-08 09:47:58] [INFO ] Deduced a trap composed of 4 places in 190 ms of which 1 ms to minimize.
[2023-03-08 09:47:58] [INFO ] Deduced a trap composed of 4 places in 182 ms of which 1 ms to minimize.
[2023-03-08 09:47:59] [INFO ] Deduced a trap composed of 4 places in 127 ms of which 0 ms to minimize.
[2023-03-08 09:47:59] [INFO ] Deduced a trap composed of 4 places in 112 ms of which 0 ms to minimize.
[2023-03-08 09:47:59] [INFO ] Trap strengthening procedure interrupted after too many repetitions 2255 ms
[2023-03-08 09:47:59] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2256 ms
[2023-03-08 09:47:59] [INFO ] After 8991ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 95 ms.
[2023-03-08 09:47:59] [INFO ] After 9620ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 5 out of 400 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 400/400 places, 10200/10200 transitions.
Applied a total of 0 rules in 424 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 425 ms. Remains : 400/400 places, 10200/10200 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 587 ms. (steps per millisecond=17 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 121099 steps, run timeout after 3001 ms. (steps per millisecond=40 ) properties seen :{}
Probabilistic random walk after 121099 steps, saw 112213 distinct states, run finished after 3001 ms. (steps per millisecond=40 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-08 09:48:03] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2023-03-08 09:48:03] [INFO ] Invariant cache hit.
[2023-03-08 09:48:03] [INFO ] [Real]Absence check using 200 positive place invariants in 44 ms returned sat
[2023-03-08 09:48:03] [INFO ] After 488ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-08 09:48:04] [INFO ] [Nat]Absence check using 200 positive place invariants in 47 ms returned sat
[2023-03-08 09:48:04] [INFO ] After 264ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-08 09:48:04] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-08 09:48:04] [INFO ] After 191ms SMT Verify possible using 100 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-08 09:48:05] [INFO ] Deduced a trap composed of 4 places in 527 ms of which 1 ms to minimize.
[2023-03-08 09:48:05] [INFO ] Deduced a trap composed of 4 places in 401 ms of which 1 ms to minimize.
[2023-03-08 09:48:06] [INFO ] Deduced a trap composed of 4 places in 394 ms of which 1 ms to minimize.
[2023-03-08 09:48:06] [INFO ] Deduced a trap composed of 4 places in 536 ms of which 1 ms to minimize.
[2023-03-08 09:48:07] [INFO ] Deduced a trap composed of 4 places in 379 ms of which 0 ms to minimize.
[2023-03-08 09:48:07] [INFO ] Deduced a trap composed of 4 places in 481 ms of which 1 ms to minimize.
[2023-03-08 09:48:08] [INFO ] Deduced a trap composed of 4 places in 499 ms of which 0 ms to minimize.
[2023-03-08 09:48:08] [INFO ] Deduced a trap composed of 4 places in 362 ms of which 0 ms to minimize.
[2023-03-08 09:48:08] [INFO ] Deduced a trap composed of 4 places in 347 ms of which 1 ms to minimize.
[2023-03-08 09:48:09] [INFO ] Deduced a trap composed of 4 places in 430 ms of which 1 ms to minimize.
[2023-03-08 09:48:09] [INFO ] Deduced a trap composed of 4 places in 326 ms of which 0 ms to minimize.
[2023-03-08 09:48:09] [INFO ] Trap strengthening procedure interrupted after too many repetitions 4896 ms
[2023-03-08 09:48:09] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 4896 ms
[2023-03-08 09:48:09] [INFO ] Deduced a trap composed of 4 places in 323 ms of which 1 ms to minimize.
[2023-03-08 09:48:10] [INFO ] Deduced a trap composed of 4 places in 465 ms of which 1 ms to minimize.
[2023-03-08 09:48:10] [INFO ] Deduced a trap composed of 4 places in 479 ms of which 1 ms to minimize.
[2023-03-08 09:48:11] [INFO ] Deduced a trap composed of 4 places in 432 ms of which 1 ms to minimize.
[2023-03-08 09:48:11] [INFO ] Deduced a trap composed of 4 places in 464 ms of which 1 ms to minimize.
[2023-03-08 09:48:12] [INFO ] Deduced a trap composed of 4 places in 458 ms of which 1 ms to minimize.
[2023-03-08 09:48:12] [INFO ] Deduced a trap composed of 4 places in 442 ms of which 1 ms to minimize.
[2023-03-08 09:48:13] [INFO ] Deduced a trap composed of 4 places in 377 ms of which 1 ms to minimize.
[2023-03-08 09:48:13] [INFO ] Deduced a trap composed of 4 places in 373 ms of which 1 ms to minimize.
[2023-03-08 09:48:14] [INFO ] Deduced a trap composed of 4 places in 357 ms of which 0 ms to minimize.
[2023-03-08 09:48:14] [INFO ] Deduced a trap composed of 4 places in 394 ms of which 1 ms to minimize.
[2023-03-08 09:48:14] [INFO ] Trap strengthening procedure interrupted after too many repetitions 4856 ms
[2023-03-08 09:48:14] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 4856 ms
[2023-03-08 09:48:14] [INFO ] Deduced a trap composed of 4 places in 348 ms of which 1 ms to minimize.
[2023-03-08 09:48:15] [INFO ] Deduced a trap composed of 4 places in 375 ms of which 1 ms to minimize.
[2023-03-08 09:48:15] [INFO ] Deduced a trap composed of 4 places in 365 ms of which 1 ms to minimize.
[2023-03-08 09:48:16] [INFO ] Deduced a trap composed of 4 places in 329 ms of which 1 ms to minimize.
[2023-03-08 09:48:16] [INFO ] Deduced a trap composed of 4 places in 329 ms of which 0 ms to minimize.
[2023-03-08 09:48:16] [INFO ] Deduced a trap composed of 4 places in 328 ms of which 1 ms to minimize.
[2023-03-08 09:48:17] [INFO ] Deduced a trap composed of 4 places in 304 ms of which 1 ms to minimize.
[2023-03-08 09:48:17] [INFO ] Deduced a trap composed of 4 places in 318 ms of which 0 ms to minimize.
[2023-03-08 09:48:17] [INFO ] Deduced a trap composed of 4 places in 311 ms of which 1 ms to minimize.
[2023-03-08 09:48:18] [INFO ] Deduced a trap composed of 4 places in 274 ms of which 1 ms to minimize.
[2023-03-08 09:48:18] [INFO ] Deduced a trap composed of 4 places in 280 ms of which 1 ms to minimize.
[2023-03-08 09:48:18] [INFO ] Trap strengthening procedure interrupted after too many repetitions 3823 ms
[2023-03-08 09:48:18] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 3823 ms
[2023-03-08 09:48:18] [INFO ] After 13906ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 119 ms.
[2023-03-08 09:48:18] [INFO ] After 14572ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 4 ms.
Support contains 5 out of 400 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 400/400 places, 10200/10200 transitions.
Applied a total of 0 rules in 690 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 690 ms. Remains : 400/400 places, 10200/10200 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 400/400 places, 10200/10200 transitions.
Applied a total of 0 rules in 419 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2023-03-08 09:48:19] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2023-03-08 09:48:19] [INFO ] Invariant cache hit.
[2023-03-08 09:48:21] [INFO ] Implicit Places using invariants in 2288 ms returned []
Implicit Place search using SMT only with invariants took 2290 ms to find 0 implicit places.
[2023-03-08 09:48:21] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2023-03-08 09:48:21] [INFO ] Invariant cache hit.
[2023-03-08 09:48:27] [INFO ] Dead Transitions using invariants and state equation in 5441 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8157 ms. Remains : 400/400 places, 10200/10200 transitions.
Graph (complete) has 600 edges and 400 vertex of which 16 are kept as prefixes of interest. Removing 384 places using SCC suffix rule.1 ms
Discarding 384 places :
Also discarding 9792 output transitions
Drop transitions removed 9792 transitions
Ensure Unique test removed 392 transitions
Reduce isomorphic transitions removed 392 transitions.
Iterating post reduction 0 with 392 rules applied. Total rules applied 393 place count 16 transition count 16
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 396 place count 14 transition count 15
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 397 place count 14 transition count 14
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 399 place count 14 transition count 12
Ensure Unique test removed 2 places
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 405 place count 10 transition count 10
Applied a total of 405 rules in 10 ms. Remains 10 /400 variables (removed 390) and now considering 10/10200 (removed 10190) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 10 rows 10 cols
[2023-03-08 09:48:27] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-08 09:48:27] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-08 09:48:27] [INFO ] After 12ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:3
[2023-03-08 09:48:27] [INFO ] After 15ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-08 09:48:27] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-08 09:48:27] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-08 09:48:27] [INFO ] After 13ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-08 09:48:27] [INFO ] After 24ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 11 ms.
[2023-03-08 09:48:27] [INFO ] After 65ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Knowledge obtained : [(AND p1 p2 p0), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND p2 (NOT p1)))), (X p1), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1)))))]
False Knowledge obtained : [(X (AND p0 p2 p1)), (X (NOT (AND p0 p2 p1))), (X (NOT p0)), (X p0), (X (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT p2))), (X (X p2)), (X (X (AND p0 p2 (NOT p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND p0 p2 p1))), (X (X (NOT (AND p0 p2 p1)))), (X (X p1)), (X (X (NOT p1))), (X (X (NOT p0))), (X (X p0)), (F (NOT (AND p0 p1 p2))), (F (NOT p0)), (F (AND p0 (NOT p1) p2)), (F (NOT p1)), (F (AND (NOT p1) p2))]
Knowledge based reduction with 9 factoid took 1169 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter sensitive) to 4 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 207 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 202 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2))]
Support contains 5 out of 400 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 400/400 places, 10200/10200 transitions.
Applied a total of 0 rules in 204 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2023-03-08 09:48:29] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
// Phase 1: matrix 400 rows 400 cols
[2023-03-08 09:48:29] [INFO ] Computed 200 place invariants in 7 ms
[2023-03-08 09:48:32] [INFO ] Implicit Places using invariants in 2860 ms returned []
Implicit Place search using SMT only with invariants took 2861 ms to find 0 implicit places.
[2023-03-08 09:48:32] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2023-03-08 09:48:32] [INFO ] Invariant cache hit.
[2023-03-08 09:48:39] [INFO ] Dead Transitions using invariants and state equation in 7163 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10230 ms. Remains : 400/400 places, 10200/10200 transitions.
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 p2 p0), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p0 (NOT p1) p2))), (X p1), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(X (AND p0 p1 p2)), (X (NOT (AND p0 p1 p2))), (X (NOT p0)), (X p0), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT p2))), (X (X p2)), (X (X (AND p0 p1 p2))), (X (X (NOT (AND p0 p1 p2)))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X p1)), (X (X (NOT p1))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 9 factoid took 1086 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter sensitive) to 4 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 203 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 864 ms. (steps per millisecond=11 ) properties (out of 9) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-08 09:48:41] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2023-03-08 09:48:41] [INFO ] Invariant cache hit.
[2023-03-08 09:48:42] [INFO ] [Real]Absence check using 200 positive place invariants in 47 ms returned sat
[2023-03-08 09:48:42] [INFO ] After 590ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-08 09:48:42] [INFO ] [Nat]Absence check using 200 positive place invariants in 76 ms returned sat
[2023-03-08 09:48:43] [INFO ] After 418ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-08 09:48:43] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-08 09:48:43] [INFO ] After 292ms SMT Verify possible using 100 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-08 09:48:44] [INFO ] Deduced a trap composed of 4 places in 649 ms of which 1 ms to minimize.
[2023-03-08 09:48:45] [INFO ] Deduced a trap composed of 4 places in 644 ms of which 0 ms to minimize.
[2023-03-08 09:48:45] [INFO ] Deduced a trap composed of 4 places in 617 ms of which 1 ms to minimize.
[2023-03-08 09:48:46] [INFO ] Deduced a trap composed of 4 places in 560 ms of which 1 ms to minimize.
[2023-03-08 09:48:46] [INFO ] Deduced a trap composed of 4 places in 599 ms of which 1 ms to minimize.
[2023-03-08 09:48:47] [INFO ] Deduced a trap composed of 4 places in 583 ms of which 0 ms to minimize.
[2023-03-08 09:48:48] [INFO ] Deduced a trap composed of 4 places in 586 ms of which 1 ms to minimize.
[2023-03-08 09:48:48] [INFO ] Deduced a trap composed of 4 places in 576 ms of which 0 ms to minimize.
[2023-03-08 09:48:49] [INFO ] Deduced a trap composed of 4 places in 494 ms of which 1 ms to minimize.
[2023-03-08 09:48:49] [INFO ] Deduced a trap composed of 4 places in 534 ms of which 1 ms to minimize.
[2023-03-08 09:48:50] [INFO ] Deduced a trap composed of 4 places in 495 ms of which 1 ms to minimize.
[2023-03-08 09:48:50] [INFO ] Trap strengthening procedure interrupted after too many repetitions 6650 ms
[2023-03-08 09:48:50] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 6651 ms
[2023-03-08 09:48:50] [INFO ] Deduced a trap composed of 4 places in 520 ms of which 1 ms to minimize.
[2023-03-08 09:48:51] [INFO ] Deduced a trap composed of 4 places in 503 ms of which 1 ms to minimize.
[2023-03-08 09:48:52] [INFO ] Deduced a trap composed of 4 places in 488 ms of which 1 ms to minimize.
[2023-03-08 09:48:52] [INFO ] Deduced a trap composed of 4 places in 478 ms of which 1 ms to minimize.
[2023-03-08 09:48:53] [INFO ] Deduced a trap composed of 4 places in 464 ms of which 0 ms to minimize.
[2023-03-08 09:48:53] [INFO ] Deduced a trap composed of 4 places in 455 ms of which 1 ms to minimize.
[2023-03-08 09:48:53] [INFO ] Deduced a trap composed of 4 places in 456 ms of which 1 ms to minimize.
[2023-03-08 09:48:54] [INFO ] Deduced a trap composed of 4 places in 426 ms of which 1 ms to minimize.
[2023-03-08 09:48:54] [INFO ] Deduced a trap composed of 4 places in 418 ms of which 1 ms to minimize.
[2023-03-08 09:48:55] [INFO ] Deduced a trap composed of 4 places in 400 ms of which 1 ms to minimize.
[2023-03-08 09:48:55] [INFO ] Deduced a trap composed of 4 places in 384 ms of which 1 ms to minimize.
[2023-03-08 09:48:55] [INFO ] Trap strengthening procedure interrupted after too many repetitions 5317 ms
[2023-03-08 09:48:55] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 5317 ms
[2023-03-08 09:48:56] [INFO ] Deduced a trap composed of 4 places in 382 ms of which 1 ms to minimize.
[2023-03-08 09:48:56] [INFO ] Deduced a trap composed of 4 places in 386 ms of which 0 ms to minimize.
[2023-03-08 09:48:56] [INFO ] Deduced a trap composed of 4 places in 365 ms of which 0 ms to minimize.
[2023-03-08 09:48:57] [INFO ] Deduced a trap composed of 4 places in 354 ms of which 1 ms to minimize.
[2023-03-08 09:48:57] [INFO ] Deduced a trap composed of 4 places in 338 ms of which 1 ms to minimize.
[2023-03-08 09:48:58] [INFO ] Deduced a trap composed of 4 places in 338 ms of which 1 ms to minimize.
[2023-03-08 09:48:58] [INFO ] Deduced a trap composed of 4 places in 334 ms of which 1 ms to minimize.
[2023-03-08 09:48:58] [INFO ] Deduced a trap composed of 4 places in 323 ms of which 1 ms to minimize.
[2023-03-08 09:48:59] [INFO ] Deduced a trap composed of 4 places in 341 ms of which 1 ms to minimize.
[2023-03-08 09:48:59] [INFO ] Deduced a trap composed of 4 places in 301 ms of which 0 ms to minimize.
[2023-03-08 09:48:59] [INFO ] Deduced a trap composed of 4 places in 293 ms of which 1 ms to minimize.
[2023-03-08 09:48:59] [INFO ] Trap strengthening procedure interrupted after too many repetitions 4088 ms
[2023-03-08 09:48:59] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 4088 ms
[2023-03-08 09:48:59] [INFO ] After 16526ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 155 ms.
[2023-03-08 09:49:00] [INFO ] After 17531ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 4 ms.
Support contains 5 out of 400 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 400/400 places, 10200/10200 transitions.
Applied a total of 0 rules in 694 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 694 ms. Remains : 400/400 places, 10200/10200 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 732 ms. (steps per millisecond=13 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) 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
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 143016 steps, run timeout after 3002 ms. (steps per millisecond=47 ) properties seen :{}
Probabilistic random walk after 143016 steps, saw 132264 distinct states, run finished after 3002 ms. (steps per millisecond=47 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-08 09:49:04] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2023-03-08 09:49:04] [INFO ] Invariant cache hit.
[2023-03-08 09:49:04] [INFO ] [Real]Absence check using 200 positive place invariants in 46 ms returned sat
[2023-03-08 09:49:05] [INFO ] After 510ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-08 09:49:05] [INFO ] [Nat]Absence check using 200 positive place invariants in 71 ms returned sat
[2023-03-08 09:49:06] [INFO ] After 425ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-08 09:49:06] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-08 09:49:06] [INFO ] After 297ms SMT Verify possible using 100 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-08 09:49:07] [INFO ] Deduced a trap composed of 4 places in 651 ms of which 1 ms to minimize.
[2023-03-08 09:49:07] [INFO ] Deduced a trap composed of 4 places in 633 ms of which 1 ms to minimize.
[2023-03-08 09:49:08] [INFO ] Deduced a trap composed of 4 places in 611 ms of which 0 ms to minimize.
[2023-03-08 09:49:09] [INFO ] Deduced a trap composed of 4 places in 605 ms of which 0 ms to minimize.
[2023-03-08 09:49:09] [INFO ] Deduced a trap composed of 4 places in 600 ms of which 1 ms to minimize.
[2023-03-08 09:49:10] [INFO ] Deduced a trap composed of 4 places in 590 ms of which 1 ms to minimize.
[2023-03-08 09:49:10] [INFO ] Deduced a trap composed of 4 places in 581 ms of which 0 ms to minimize.
[2023-03-08 09:49:11] [INFO ] Deduced a trap composed of 4 places in 558 ms of which 1 ms to minimize.
[2023-03-08 09:49:12] [INFO ] Deduced a trap composed of 4 places in 571 ms of which 1 ms to minimize.
[2023-03-08 09:49:12] [INFO ] Deduced a trap composed of 4 places in 540 ms of which 1 ms to minimize.
[2023-03-08 09:49:13] [INFO ] Deduced a trap composed of 4 places in 531 ms of which 1 ms to minimize.
[2023-03-08 09:49:13] [INFO ] Trap strengthening procedure interrupted after too many repetitions 6798 ms
[2023-03-08 09:49:13] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 6798 ms
[2023-03-08 09:49:13] [INFO ] Deduced a trap composed of 4 places in 522 ms of which 1 ms to minimize.
[2023-03-08 09:49:14] [INFO ] Deduced a trap composed of 4 places in 513 ms of which 1 ms to minimize.
[2023-03-08 09:49:14] [INFO ] Deduced a trap composed of 4 places in 489 ms of which 1 ms to minimize.
[2023-03-08 09:49:15] [INFO ] Deduced a trap composed of 4 places in 489 ms of which 1 ms to minimize.
[2023-03-08 09:49:15] [INFO ] Deduced a trap composed of 4 places in 468 ms of which 1 ms to minimize.
[2023-03-08 09:49:16] [INFO ] Deduced a trap composed of 4 places in 452 ms of which 1 ms to minimize.
[2023-03-08 09:49:16] [INFO ] Deduced a trap composed of 4 places in 442 ms of which 1 ms to minimize.
[2023-03-08 09:49:17] [INFO ] Deduced a trap composed of 4 places in 436 ms of which 0 ms to minimize.
[2023-03-08 09:49:17] [INFO ] Deduced a trap composed of 4 places in 410 ms of which 1 ms to minimize.
[2023-03-08 09:49:18] [INFO ] Deduced a trap composed of 4 places in 401 ms of which 1 ms to minimize.
[2023-03-08 09:49:18] [INFO ] Deduced a trap composed of 4 places in 386 ms of which 1 ms to minimize.
[2023-03-08 09:49:18] [INFO ] Trap strengthening procedure interrupted after too many repetitions 5326 ms
[2023-03-08 09:49:18] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 5326 ms
[2023-03-08 09:49:19] [INFO ] Deduced a trap composed of 4 places in 383 ms of which 1 ms to minimize.
[2023-03-08 09:49:19] [INFO ] Deduced a trap composed of 4 places in 382 ms of which 1 ms to minimize.
[2023-03-08 09:49:19] [INFO ] Deduced a trap composed of 4 places in 356 ms of which 1 ms to minimize.
[2023-03-08 09:49:20] [INFO ] Deduced a trap composed of 4 places in 354 ms of which 1 ms to minimize.
[2023-03-08 09:49:20] [INFO ] Deduced a trap composed of 4 places in 344 ms of which 1 ms to minimize.
[2023-03-08 09:49:20] [INFO ] Deduced a trap composed of 4 places in 345 ms of which 0 ms to minimize.
[2023-03-08 09:49:21] [INFO ] Deduced a trap composed of 4 places in 338 ms of which 1 ms to minimize.
[2023-03-08 09:49:21] [INFO ] Deduced a trap composed of 4 places in 326 ms of which 0 ms to minimize.
[2023-03-08 09:49:22] [INFO ] Deduced a trap composed of 4 places in 318 ms of which 1 ms to minimize.
[2023-03-08 09:49:22] [INFO ] Deduced a trap composed of 4 places in 308 ms of which 0 ms to minimize.
[2023-03-08 09:49:22] [INFO ] Deduced a trap composed of 4 places in 283 ms of which 1 ms to minimize.
[2023-03-08 09:49:22] [INFO ] Trap strengthening procedure interrupted after too many repetitions 4066 ms
[2023-03-08 09:49:22] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 4067 ms
[2023-03-08 09:49:22] [INFO ] After 16666ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 159 ms.
[2023-03-08 09:49:22] [INFO ] After 17665ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 4 ms.
Support contains 5 out of 400 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 400/400 places, 10200/10200 transitions.
Applied a total of 0 rules in 697 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 698 ms. Remains : 400/400 places, 10200/10200 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 400/400 places, 10200/10200 transitions.
Applied a total of 0 rules in 705 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2023-03-08 09:49:24] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2023-03-08 09:49:24] [INFO ] Invariant cache hit.
[2023-03-08 09:49:27] [INFO ] Implicit Places using invariants in 2874 ms returned []
Implicit Place search using SMT only with invariants took 2876 ms to find 0 implicit places.
[2023-03-08 09:49:27] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2023-03-08 09:49:27] [INFO ] Invariant cache hit.
[2023-03-08 09:49:33] [INFO ] Dead Transitions using invariants and state equation in 6476 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10062 ms. Remains : 400/400 places, 10200/10200 transitions.
Graph (complete) has 600 edges and 400 vertex of which 16 are kept as prefixes of interest. Removing 384 places using SCC suffix rule.2 ms
Discarding 384 places :
Also discarding 9792 output transitions
Drop transitions removed 9792 transitions
Ensure Unique test removed 392 transitions
Reduce isomorphic transitions removed 392 transitions.
Iterating post reduction 0 with 392 rules applied. Total rules applied 393 place count 16 transition count 16
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 396 place count 14 transition count 15
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 397 place count 14 transition count 14
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 399 place count 14 transition count 12
Ensure Unique test removed 2 places
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 405 place count 10 transition count 10
Applied a total of 405 rules in 14 ms. Remains 10 /400 variables (removed 390) and now considering 10/10200 (removed 10190) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 10 rows 10 cols
[2023-03-08 09:49:33] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-08 09:49:33] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-08 09:49:33] [INFO ] After 35ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:3
[2023-03-08 09:49:33] [INFO ] After 40ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-08 09:49:33] [INFO ] After 76ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-08 09:49:33] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-08 09:49:33] [INFO ] After 26ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-08 09:49:33] [INFO ] After 40ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-08 09:49:33] [INFO ] After 95ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Knowledge obtained : [(AND p1 p2 p0), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p0 (NOT p1) p2))), (X p1), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(X (AND p0 p1 p2)), (X (NOT (AND p0 p1 p2))), (X (NOT p0)), (X p0), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT p2))), (X (X p2)), (X (X (AND p0 p1 p2))), (X (X (NOT (AND p0 p1 p2)))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X p1)), (X (X (NOT p1))), (X (X (NOT p0))), (X (X p0)), (F (NOT (AND p0 p1 p2))), (F (NOT p0)), (F (AND p0 (NOT p1) p2)), (F (NOT p1)), (F (AND (NOT p1) p2))]
Knowledge based reduction with 9 factoid took 1332 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter sensitive) to 4 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 145 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 142 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 136 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 0 reset in 2479 ms.
Product exploration explored 100000 steps with 0 reset in 2664 ms.
Applying partial POR strategy [true, false, true, true]
Stuttering acceptance computed with spot in 141 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2))]
Support contains 5 out of 400 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 400/400 places, 10200/10200 transitions.
Applied a total of 0 rules in 586 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2023-03-08 09:49:41] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
// Phase 1: matrix 400 rows 400 cols
[2023-03-08 09:49:41] [INFO ] Computed 200 place invariants in 1 ms
[2023-03-08 09:49:49] [INFO ] Dead Transitions using invariants and state equation in 8190 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8778 ms. Remains : 400/400 places, 10200/10200 transitions.
Support contains 5 out of 400 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 400/400 places, 10200/10200 transitions.
Applied a total of 0 rules in 123 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2023-03-08 09:49:49] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2023-03-08 09:49:49] [INFO ] Invariant cache hit.
[2023-03-08 09:49:51] [INFO ] Implicit Places using invariants in 1807 ms returned []
Implicit Place search using SMT only with invariants took 1808 ms to find 0 implicit places.
[2023-03-08 09:49:51] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2023-03-08 09:49:51] [INFO ] Invariant cache hit.
[2023-03-08 09:50:00] [INFO ] Dead Transitions using invariants and state equation in 8345 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10277 ms. Remains : 400/400 places, 10200/10200 transitions.
Treatment of property Dekker-PT-100-LTLCardinality-15 finished in 141477 ms.
[2023-03-08 09:50:01] [INFO ] Flatten gal took : 481 ms
[2023-03-08 09:50:01] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2023-03-08 09:50:01] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 405 places, 10200 transitions and 70605 arcs took 102 ms.
Total runtime 392231 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT Dekker-PT-100
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/373
LTLCardinality
BK_STOP 1678269118779
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/373/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/373/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/373/LTLCardinality.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: NOTDEADLOCKFREE
lola: LAUNCH task # 1 (type EXCL) for 0 Dekker-PT-100-LTLCardinality-15
lola: time limit : 3594 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Dekker-PT-100-LTLCardinality-15: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 0/3594 1/32 Dekker-PT-100-LTLCardinality-15 10717 m, 2143 m/sec, 28137 t fired, .
Time elapsed: 6 secs. Pages in use: 1
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Dekker-PT-100-LTLCardinality-15: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/3594 2/32 Dekker-PT-100-LTLCardinality-15 229614 m, 43779 m/sec, 640518 t fired, .
Time elapsed: 11 secs. Pages in use: 2
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Dekker-PT-100-LTLCardinality-15: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 10/3594 4/32 Dekker-PT-100-LTLCardinality-15 443476 m, 42772 m/sec, 1249153 t fired, .
Time elapsed: 16 secs. Pages in use: 4
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Dekker-PT-100-LTLCardinality-15: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 15/3594 5/32 Dekker-PT-100-LTLCardinality-15 659111 m, 43127 m/sec, 1861203 t fired, .
Time elapsed: 21 secs. Pages in use: 5
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Dekker-PT-100-LTLCardinality-15: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 20/3594 7/32 Dekker-PT-100-LTLCardinality-15 876688 m, 43515 m/sec, 2489449 t fired, .
Time elapsed: 26 secs. Pages in use: 7
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Dekker-PT-100-LTLCardinality-15: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 25/3594 8/32 Dekker-PT-100-LTLCardinality-15 1085890 m, 41840 m/sec, 3103446 t fired, .
Time elapsed: 31 secs. Pages in use: 8
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Dekker-PT-100-LTLCardinality-15: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 30/3594 10/32 Dekker-PT-100-LTLCardinality-15 1293307 m, 41483 m/sec, 3719771 t fired, .
Time elapsed: 36 secs. Pages in use: 10
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Dekker-PT-100-LTLCardinality-15: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 35/3594 11/32 Dekker-PT-100-LTLCardinality-15 1499879 m, 41314 m/sec, 4336876 t fired, .
Time elapsed: 41 secs. Pages in use: 11
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Dekker-PT-100-LTLCardinality-15: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 40/3594 12/32 Dekker-PT-100-LTLCardinality-15 1708603 m, 41744 m/sec, 4961114 t fired, .
Time elapsed: 46 secs. Pages in use: 12
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Dekker-PT-100-LTLCardinality-15: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 45/3594 14/32 Dekker-PT-100-LTLCardinality-15 1919110 m, 42101 m/sec, 5561517 t fired, .
Time elapsed: 51 secs. Pages in use: 14
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Dekker-PT-100-LTLCardinality-15: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 50/3594 15/32 Dekker-PT-100-LTLCardinality-15 2132110 m, 42600 m/sec, 6190315 t fired, .
Time elapsed: 56 secs. Pages in use: 15
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Dekker-PT-100-LTLCardinality-15: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 55/3594 17/32 Dekker-PT-100-LTLCardinality-15 2346313 m, 42840 m/sec, 6806436 t fired, .
Time elapsed: 61 secs. Pages in use: 17
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Dekker-PT-100-LTLCardinality-15: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 60/3594 18/32 Dekker-PT-100-LTLCardinality-15 2560877 m, 42912 m/sec, 7432924 t fired, .
Time elapsed: 66 secs. Pages in use: 18
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Dekker-PT-100-LTLCardinality-15: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 65/3594 20/32 Dekker-PT-100-LTLCardinality-15 2778869 m, 43598 m/sec, 8056343 t fired, .
Time elapsed: 71 secs. Pages in use: 20
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Dekker-PT-100-LTLCardinality-15: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 70/3594 21/32 Dekker-PT-100-LTLCardinality-15 2997808 m, 43787 m/sec, 8680505 t fired, .
Time elapsed: 76 secs. Pages in use: 21
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Dekker-PT-100-LTLCardinality-15: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 75/3594 23/32 Dekker-PT-100-LTLCardinality-15 3219057 m, 44249 m/sec, 9314624 t fired, .
Time elapsed: 81 secs. Pages in use: 23
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Dekker-PT-100-LTLCardinality-15: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 80/3594 24/32 Dekker-PT-100-LTLCardinality-15 3431431 m, 42474 m/sec, 9954647 t fired, .
Time elapsed: 86 secs. Pages in use: 24
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Dekker-PT-100-LTLCardinality-15: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 85/3594 26/32 Dekker-PT-100-LTLCardinality-15 3637123 m, 41138 m/sec, 10578054 t fired, .
Time elapsed: 91 secs. Pages in use: 26
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Dekker-PT-100-LTLCardinality-15: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 90/3594 27/32 Dekker-PT-100-LTLCardinality-15 3835507 m, 39676 m/sec, 11195325 t fired, .
Time elapsed: 96 secs. Pages in use: 27
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Dekker-PT-100-LTLCardinality-15: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 95/3594 29/32 Dekker-PT-100-LTLCardinality-15 4036288 m, 40156 m/sec, 11826394 t fired, .
Time elapsed: 101 secs. Pages in use: 29
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Dekker-PT-100-LTLCardinality-15: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 100/3594 30/32 Dekker-PT-100-LTLCardinality-15 4241462 m, 41034 m/sec, 12448546 t fired, .
Time elapsed: 106 secs. Pages in use: 30
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Dekker-PT-100-LTLCardinality-15: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 105/3594 32/32 Dekker-PT-100-LTLCardinality-15 4443710 m, 40449 m/sec, 13082693 t fired, .
Time elapsed: 111 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 1
lola: CANCELED task # 1 (type EXCL) for Dekker-PT-100-LTLCardinality-15 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Dekker-PT-100-LTLCardinality-15: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
Time elapsed: 116 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 1
lola: Portfolio finished: no open tasks 1
FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Dekker-PT-100-LTLCardinality-15: LTL unknown AGGR
Time elapsed: 116 secs. Pages in use: 32
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="lolaxred"
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-5348"
echo " Executing tool lolaxred"
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 r135-smll-167819413300035"
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 '
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 ;