Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r153-tall-171631151000067.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is Dekker-PT-050, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r153-tall-171631151000067
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.1M
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 15:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 22 14:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 11 21:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 149K Apr 11 21:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 16K Apr 11 20:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 121K Apr 11 20:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:39 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1.5M May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716414197231

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=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Dekker-PT-050
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-22 21:43:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-22 21:43:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 21:43:19] [INFO ] Load time of PNML (sax parser for PT used): 160 ms
[2024-05-22 21:43:19] [INFO ] Transformed 250 places.
[2024-05-22 21:43:19] [INFO ] Transformed 2600 transitions.
[2024-05-22 21:43:19] [INFO ] Found NUPN structural information;
[2024-05-22 21:43:19] [INFO ] Parsed PT model containing 250 places and 2600 transitions and 20100 arcs in 253 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA Dekker-PT-050-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-050-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-050-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-050-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-050-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-050-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 23 out of 250 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 2600/2600 transitions.
Applied a total of 0 rules in 77 ms. Remains 250 /250 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2024-05-22 21:43:19] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 250 cols
[2024-05-22 21:43:19] [INFO ] Computed 150 invariants in 19 ms
[2024-05-22 21:43:20] [INFO ] Implicit Places using invariants in 1398 ms returned [100, 103, 106, 109, 112, 115, 118, 124, 127, 130, 133, 136, 139, 142, 148, 154, 157, 160, 163, 169, 172, 175, 181, 184, 187, 190, 196, 199, 202, 205, 211, 214, 217, 220, 223, 226, 232, 235, 238, 241, 244, 247]
Discarding 42 places :
Implicit Place search using SMT only with invariants took 1424 ms to find 42 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 208/250 places, 2600/2600 transitions.
Applied a total of 0 rules in 33 ms. Remains 208 /208 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1535 ms. Remains : 208/250 places, 2600/2600 transitions.
Support contains 23 out of 208 places after structural reductions.
[2024-05-22 21:43:21] [INFO ] Flatten gal took : 224 ms
[2024-05-22 21:43:21] [INFO ] Flatten gal took : 138 ms
[2024-05-22 21:43:21] [INFO ] Input system was already deterministic with 2600 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 432 ms. (steps per millisecond=23 ) properties (out of 16) seen :9
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 7) seen :3
Running SMT prover for 4 properties.
[2024-05-22 21:43:22] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 208 cols
[2024-05-22 21:43:22] [INFO ] Computed 108 invariants in 8 ms
[2024-05-22 21:43:22] [INFO ] [Real]Absence check using 100 positive place invariants in 14 ms returned sat
[2024-05-22 21:43:22] [INFO ] [Real]Absence check using 100 positive and 8 generalized place invariants in 2 ms returned sat
[2024-05-22 21:43:22] [INFO ] After 256ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-22 21:43:22] [INFO ] [Nat]Absence check using 100 positive place invariants in 12 ms returned sat
[2024-05-22 21:43:22] [INFO ] [Nat]Absence check using 100 positive and 8 generalized place invariants in 3 ms returned sat
[2024-05-22 21:43:22] [INFO ] After 101ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-22 21:43:22] [INFO ] State equation strengthened by 50 read => feed constraints.
[2024-05-22 21:43:22] [INFO ] After 58ms SMT Verify possible using 50 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-22 21:43:23] [INFO ] Deduced a trap composed of 4 places in 105 ms of which 5 ms to minimize.
[2024-05-22 21:43:23] [INFO ] Deduced a trap composed of 4 places in 107 ms of which 1 ms to minimize.
[2024-05-22 21:43:23] [INFO ] Deduced a trap composed of 4 places in 98 ms of which 1 ms to minimize.
[2024-05-22 21:43:23] [INFO ] Deduced a trap composed of 4 places in 92 ms of which 1 ms to minimize.
[2024-05-22 21:43:23] [INFO ] Deduced a trap composed of 4 places in 90 ms of which 0 ms to minimize.
[2024-05-22 21:43:23] [INFO ] Deduced a trap composed of 4 places in 94 ms of which 1 ms to minimize.
[2024-05-22 21:43:23] [INFO ] Deduced a trap composed of 4 places in 86 ms of which 1 ms to minimize.
[2024-05-22 21:43:23] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 1 ms to minimize.
[2024-05-22 21:43:23] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 0 ms to minimize.
[2024-05-22 21:43:24] [INFO ] Deduced a trap composed of 5 places in 67 ms of which 0 ms to minimize.
[2024-05-22 21:43:24] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 0 ms to minimize.
[2024-05-22 21:43:24] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 0 ms to minimize.
[2024-05-22 21:43:24] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 0 ms to minimize.
[2024-05-22 21:43:24] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 0 ms to minimize.
[2024-05-22 21:43:24] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 1 ms to minimize.
[2024-05-22 21:43:24] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 0 ms to minimize.
[2024-05-22 21:43:24] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 0 ms to minimize.
[2024-05-22 21:43:24] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 0 ms to minimize.
[2024-05-22 21:43:24] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 0 ms to minimize.
[2024-05-22 21:43:24] [INFO ] Deduced a trap composed of 6 places in 47 ms of which 0 ms to minimize.
[2024-05-22 21:43:24] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 0 ms to minimize.
[2024-05-22 21:43:24] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 1 ms to minimize.
[2024-05-22 21:43:24] [INFO ] Deduced a trap composed of 6 places in 49 ms of which 0 ms to minimize.
[2024-05-22 21:43:24] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 0 ms to minimize.
[2024-05-22 21:43:25] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 1 ms to minimize.
[2024-05-22 21:43:25] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 0 ms to minimize.
[2024-05-22 21:43:25] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 0 ms to minimize.
[2024-05-22 21:43:25] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 0 ms to minimize.
[2024-05-22 21:43:25] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 0 ms to minimize.
[2024-05-22 21:43:25] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 1 ms to minimize.
[2024-05-22 21:43:25] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 0 ms to minimize.
[2024-05-22 21:43:25] [INFO ] Deduced a trap composed of 6 places in 50 ms of which 0 ms to minimize.
[2024-05-22 21:43:25] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 1 ms to minimize.
[2024-05-22 21:43:25] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 0 ms to minimize.
[2024-05-22 21:43:25] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 4 ms to minimize.
[2024-05-22 21:43:25] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 1 ms to minimize.
[2024-05-22 21:43:25] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 0 ms to minimize.
[2024-05-22 21:43:25] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 0 ms to minimize.
[2024-05-22 21:43:25] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 0 ms to minimize.
[2024-05-22 21:43:25] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 2 ms to minimize.
[2024-05-22 21:43:26] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
[2024-05-22 21:43:26] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 0 ms to minimize.
[2024-05-22 21:43:26] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 1 ms to minimize.
[2024-05-22 21:43:26] [INFO ] Trap strengthening procedure interrupted after too many repetitions 3155 ms
[2024-05-22 21:43:26] [INFO ] Trap strengthening (SAT) tested/added 43/42 trap constraints in 3157 ms
[2024-05-22 21:43:26] [INFO ] After 3306ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 39 ms.
[2024-05-22 21:43:26] [INFO ] After 3571ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 9 ms.
Support contains 6 out of 208 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 208/208 places, 2600/2600 transitions.
Applied a total of 0 rules in 131 ms. Remains 208 /208 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 131 ms. Remains : 208/208 places, 2600/2600 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 258 ms. (steps per millisecond=38 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 212466 steps, run timeout after 3006 ms. (steps per millisecond=70 ) properties seen :{}
Probabilistic random walk after 212466 steps, saw 176080 distinct states, run finished after 3007 ms. (steps per millisecond=70 ) properties seen :0
Running SMT prover for 4 properties.
[2024-05-22 21:43:29] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2024-05-22 21:43:29] [INFO ] Invariant cache hit.
[2024-05-22 21:43:29] [INFO ] [Real]Absence check using 100 positive place invariants in 16 ms returned sat
[2024-05-22 21:43:29] [INFO ] [Real]Absence check using 100 positive and 8 generalized place invariants in 1 ms returned sat
[2024-05-22 21:43:29] [INFO ] After 91ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:2
[2024-05-22 21:43:30] [INFO ] State equation strengthened by 50 read => feed constraints.
[2024-05-22 21:43:30] [INFO ] After 40ms SMT Verify possible using 50 Read/Feed constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-22 21:43:30] [INFO ] After 276ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-22 21:43:30] [INFO ] [Nat]Absence check using 100 positive place invariants in 12 ms returned sat
[2024-05-22 21:43:30] [INFO ] [Nat]Absence check using 100 positive and 8 generalized place invariants in 1 ms returned sat
[2024-05-22 21:43:30] [INFO ] After 82ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-22 21:43:30] [INFO ] After 60ms SMT Verify possible using 50 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-22 21:43:30] [INFO ] Deduced a trap composed of 4 places in 97 ms of which 0 ms to minimize.
[2024-05-22 21:43:30] [INFO ] Deduced a trap composed of 4 places in 84 ms of which 1 ms to minimize.
[2024-05-22 21:43:30] [INFO ] Deduced a trap composed of 4 places in 89 ms of which 0 ms to minimize.
[2024-05-22 21:43:30] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 0 ms to minimize.
[2024-05-22 21:43:30] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 1 ms to minimize.
[2024-05-22 21:43:30] [INFO ] Deduced a trap composed of 4 places in 120 ms of which 1 ms to minimize.
[2024-05-22 21:43:31] [INFO ] Deduced a trap composed of 4 places in 89 ms of which 1 ms to minimize.
[2024-05-22 21:43:31] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 0 ms to minimize.
[2024-05-22 21:43:31] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 0 ms to minimize.
[2024-05-22 21:43:31] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 1 ms to minimize.
[2024-05-22 21:43:31] [INFO ] Deduced a trap composed of 4 places in 89 ms of which 1 ms to minimize.
[2024-05-22 21:43:31] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1121 ms
[2024-05-22 21:43:31] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1121 ms
[2024-05-22 21:43:31] [INFO ] After 1248ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 40 ms.
[2024-05-22 21:43:31] [INFO ] After 1456ms 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 3 ms.
Support contains 6 out of 208 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 208/208 places, 2600/2600 transitions.
Applied a total of 0 rules in 84 ms. Remains 208 /208 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 98 ms. Remains : 208/208 places, 2600/2600 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 208/208 places, 2600/2600 transitions.
Applied a total of 0 rules in 105 ms. Remains 208 /208 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2024-05-22 21:43:31] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2024-05-22 21:43:31] [INFO ] Invariant cache hit.
[2024-05-22 21:43:32] [INFO ] Implicit Places using invariants in 1133 ms returned [114, 136, 147, 156, 167, 178, 193]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 1149 ms to find 7 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 201/208 places, 2600/2600 transitions.
Applied a total of 0 rules in 85 ms. Remains 201 /201 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1342 ms. Remains : 201/208 places, 2600/2600 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 302 ms. (steps per millisecond=33 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 302226 steps, run timeout after 3001 ms. (steps per millisecond=100 ) properties seen :{}
Probabilistic random walk after 302226 steps, saw 250201 distinct states, run finished after 3003 ms. (steps per millisecond=100 ) properties seen :0
Running SMT prover for 4 properties.
[2024-05-22 21:43:36] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 201 cols
[2024-05-22 21:43:36] [INFO ] Computed 101 invariants in 2 ms
[2024-05-22 21:43:36] [INFO ] [Real]Absence check using 100 positive place invariants in 14 ms returned sat
[2024-05-22 21:43:36] [INFO ] [Real]Absence check using 100 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-22 21:43:36] [INFO ] After 80ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3 real:1
[2024-05-22 21:43:36] [INFO ] State equation strengthened by 50 read => feed constraints.
[2024-05-22 21:43:36] [INFO ] After 44ms SMT Verify possible using 50 Read/Feed constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-22 21:43:36] [INFO ] After 278ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-22 21:43:36] [INFO ] [Nat]Absence check using 100 positive place invariants in 11 ms returned sat
[2024-05-22 21:43:36] [INFO ] [Nat]Absence check using 100 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-22 21:43:36] [INFO ] After 71ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-22 21:43:36] [INFO ] After 44ms SMT Verify possible using 50 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-22 21:43:36] [INFO ] After 110ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 42 ms.
[2024-05-22 21:43:36] [INFO ] After 303ms 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 6 out of 201 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 201/201 places, 2600/2600 transitions.
Applied a total of 0 rules in 54 ms. Remains 201 /201 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 201/201 places, 2600/2600 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 201/201 places, 2600/2600 transitions.
Applied a total of 0 rules in 52 ms. Remains 201 /201 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2024-05-22 21:43:37] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2024-05-22 21:43:37] [INFO ] Invariant cache hit.
[2024-05-22 21:43:37] [INFO ] Implicit Places using invariants in 464 ms returned []
[2024-05-22 21:43:37] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2024-05-22 21:43:37] [INFO ] Invariant cache hit.
[2024-05-22 21:43:37] [INFO ] State equation strengthened by 50 read => feed constraints.
[2024-05-22 21:43:38] [INFO ] Implicit Places using invariants and state equation in 564 ms returned []
Implicit Place search using SMT with State Equation took 1032 ms to find 0 implicit places.
[2024-05-22 21:43:38] [INFO ] Redundant transitions in 167 ms returned []
[2024-05-22 21:43:38] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2024-05-22 21:43:38] [INFO ] Invariant cache hit.
[2024-05-22 21:43:39] [INFO ] Dead Transitions using invariants and state equation in 782 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2040 ms. Remains : 201/201 places, 2600/2600 transitions.
Graph (complete) has 305 edges and 201 vertex of which 25 are kept as prefixes of interest. Removing 176 places using SCC suffix rule.2 ms
Discarding 176 places :
Also discarding 2288 output transitions
Drop transitions removed 2288 transitions
Ensure Unique test removed 1 places
Ensure Unique test removed 288 transitions
Reduce isomorphic transitions removed 288 transitions.
Iterating post reduction 0 with 289 rules applied. Total rules applied 290 place count 24 transition count 24
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 302 place count 16 transition count 20
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 306 place count 16 transition count 16
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 308 place count 16 transition count 14
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 314 place count 12 transition count 12
Applied a total of 314 rules in 14 ms. Remains 12 /201 variables (removed 189) and now considering 12/2600 (removed 2588) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 12 rows 12 cols
[2024-05-22 21:43:39] [INFO ] Computed 6 invariants in 1 ms
[2024-05-22 21:43:39] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-05-22 21:43:39] [INFO ] After 7ms SMT Verify possible using state equation in real domain returned unsat :0 sat :4
[2024-05-22 21:43:39] [INFO ] After 13ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 5 ms.
[2024-05-22 21:43:39] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:3
[2024-05-22 21:43:39] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-05-22 21:43:39] [INFO ] After 7ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-22 21:43:39] [INFO ] After 12ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 5 ms.
[2024-05-22 21:43:39] [INFO ] After 42ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
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.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 2 out of 208 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 208/208 places, 2600/2600 transitions.
Applied a total of 0 rules in 248 ms. Remains 208 /208 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2024-05-22 21:43:39] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 208 cols
[2024-05-22 21:43:39] [INFO ] Computed 108 invariants in 5 ms
[2024-05-22 21:43:40] [INFO ] Implicit Places using invariants in 540 ms returned [114, 131, 136, 147, 156, 167, 178, 193]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 545 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 200/208 places, 2600/2600 transitions.
Applied a total of 0 rules in 86 ms. Remains 200 /200 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 881 ms. Remains : 200/208 places, 2600/2600 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 712 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : Dekker-PT-050-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s185 0) (EQ s147 1)), p1:(AND (NEQ s147 0) (NEQ s185 1))], nbAcceptance=2, 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 1246 ms.
Stack based approach found an accepted trace after 30 steps with 0 reset with depth 31 and stack size 31 in 1 ms.
FORMULA Dekker-PT-050-LTLCardinality-02 FALSE TECHNIQUES STACK_TEST
Treatment of property Dekker-PT-050-LTLCardinality-02 finished in 2910 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 2 out of 208 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 208/208 places, 2600/2600 transitions.
Applied a total of 0 rules in 16 ms. Remains 208 /208 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2024-05-22 21:43:42] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2024-05-22 21:43:42] [INFO ] Invariant cache hit.
[2024-05-22 21:43:42] [INFO ] Implicit Places using invariants in 526 ms returned [114, 131, 136, 147, 167, 178, 193]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 530 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 201/208 places, 2600/2600 transitions.
Applied a total of 0 rules in 15 ms. Remains 201 /201 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 562 ms. Remains : 201/208 places, 2600/2600 transitions.
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : Dekker-PT-050-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s7 0) (EQ s152 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 828 ms.
Product exploration explored 100000 steps with 50000 reset in 802 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 : [p0, (X p0), true]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 21 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Dekker-PT-050-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Dekker-PT-050-LTLCardinality-04 finished in 2365 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X(G(p1)))))'
Support contains 5 out of 208 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 208/208 places, 2600/2600 transitions.
Applied a total of 0 rules in 14 ms. Remains 208 /208 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2024-05-22 21:43:44] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2024-05-22 21:43:44] [INFO ] Invariant cache hit.
[2024-05-22 21:43:45] [INFO ] Implicit Places using invariants in 537 ms returned [114, 131, 136, 156, 167]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 540 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 203/208 places, 2600/2600 transitions.
Applied a total of 0 rules in 13 ms. Remains 203 /203 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 569 ms. Remains : 203/208 places, 2600/2600 transitions.
Stuttering acceptance computed with spot in 152 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : Dekker-PT-050-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s188 1) (EQ s127 0) (EQ s173 1)), p1:(AND (NEQ s53 0) (NEQ s144 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 8 steps with 0 reset in 1 ms.
FORMULA Dekker-PT-050-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Dekker-PT-050-LTLCardinality-05 finished in 738 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||G(p1)))'
Support contains 4 out of 208 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 208/208 places, 2600/2600 transitions.
Applied a total of 0 rules in 15 ms. Remains 208 /208 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2024-05-22 21:43:45] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2024-05-22 21:43:45] [INFO ] Invariant cache hit.
[2024-05-22 21:43:45] [INFO ] Implicit Places using invariants in 533 ms returned [114, 131, 147, 156, 167, 178, 193]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 537 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 201/208 places, 2600/2600 transitions.
Applied a total of 0 rules in 14 ms. Remains 201 /201 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 567 ms. Remains : 201/208 places, 2600/2600 transitions.
Stuttering acceptance computed with spot in 184 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : Dekker-PT-050-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=2, aps=[p0:(OR (EQ s17 0) (EQ s101 1)), p1:(OR (EQ s134 0) (EQ s188 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 49 steps with 24 reset in 1 ms.
FORMULA Dekker-PT-050-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Dekker-PT-050-LTLCardinality-06 finished in 778 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 208 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 208/208 places, 2600/2600 transitions.
Applied a total of 0 rules in 70 ms. Remains 208 /208 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2024-05-22 21:43:46] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2024-05-22 21:43:46] [INFO ] Invariant cache hit.
[2024-05-22 21:43:46] [INFO ] Implicit Places using invariants in 539 ms returned [114, 131, 136, 147, 156, 167, 178, 193]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 543 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 200/208 places, 2600/2600 transitions.
Applied a total of 0 rules in 67 ms. Remains 200 /200 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 681 ms. Remains : 200/208 places, 2600/2600 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : Dekker-PT-050-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s119 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 966 ms.
Stack based approach found an accepted trace after 29 steps with 0 reset with depth 30 and stack size 30 in 0 ms.
FORMULA Dekker-PT-050-LTLCardinality-07 FALSE TECHNIQUES STACK_TEST
Treatment of property Dekker-PT-050-LTLCardinality-07 finished in 1703 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 208 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 208/208 places, 2600/2600 transitions.
Applied a total of 0 rules in 13 ms. Remains 208 /208 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2024-05-22 21:43:47] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2024-05-22 21:43:47] [INFO ] Invariant cache hit.
[2024-05-22 21:43:48] [INFO ] Implicit Places using invariants in 548 ms returned [131, 136, 147, 156, 167, 178, 193]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 554 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 201/208 places, 2600/2600 transitions.
Applied a total of 0 rules in 12 ms. Remains 201 /201 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 580 ms. Remains : 201/208 places, 2600/2600 transitions.
Stuttering acceptance computed with spot in 131 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Dekker-PT-050-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}]], initial=3, aps=[p0:(EQ s114 0)], 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA Dekker-PT-050-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Dekker-PT-050-LTLCardinality-09 finished in 734 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&X(G((p0 U p1))))))'
Support contains 4 out of 208 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 208/208 places, 2600/2600 transitions.
Applied a total of 0 rules in 72 ms. Remains 208 /208 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2024-05-22 21:43:48] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2024-05-22 21:43:48] [INFO ] Invariant cache hit.
[2024-05-22 21:43:49] [INFO ] Implicit Places using invariants in 532 ms returned [114, 131, 136, 147, 156, 178, 193]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 535 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 201/208 places, 2600/2600 transitions.
Applied a total of 0 rules in 67 ms. Remains 201 /201 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 676 ms. Remains : 201/208 places, 2600/2600 transitions.
Stuttering acceptance computed with spot in 161 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : Dekker-PT-050-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(OR p0 p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s112 0) (EQ s80 1)), p1:(OR (EQ s119 0) (EQ s162 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 1001 ms.
Product exploration explored 100000 steps with 0 reset in 1138 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 p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (OR p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (OR p0 p1))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 8 factoid took 133 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 102 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 263 ms. (steps per millisecond=38 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-22 21:43:52] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 201 cols
[2024-05-22 21:43:52] [INFO ] Computed 101 invariants in 4 ms
[2024-05-22 21:43:52] [INFO ] [Real]Absence check using 100 positive place invariants in 11 ms returned sat
[2024-05-22 21:43:52] [INFO ] [Real]Absence check using 100 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-22 21:43:52] [INFO ] After 85ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2024-05-22 21:43:52] [INFO ] State equation strengthened by 50 read => feed constraints.
[2024-05-22 21:43:52] [INFO ] After 28ms SMT Verify possible using 50 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-22 21:43:52] [INFO ] After 205ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-22 21:43:52] [INFO ] [Nat]Absence check using 100 positive place invariants in 11 ms returned sat
[2024-05-22 21:43:52] [INFO ] [Nat]Absence check using 100 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-22 21:43:52] [INFO ] After 79ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-22 21:43:52] [INFO ] After 45ms SMT Verify possible using 50 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-22 21:43:52] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 1 ms to minimize.
[2024-05-22 21:43:52] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 0 ms to minimize.
[2024-05-22 21:43:52] [INFO ] Deduced a trap composed of 4 places in 83 ms of which 0 ms to minimize.
[2024-05-22 21:43:53] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 0 ms to minimize.
[2024-05-22 21:43:53] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 1 ms to minimize.
[2024-05-22 21:43:53] [INFO ] Deduced a trap composed of 4 places in 88 ms of which 0 ms to minimize.
[2024-05-22 21:43:53] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 2 ms to minimize.
[2024-05-22 21:43:53] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 1 ms to minimize.
[2024-05-22 21:43:53] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 2 ms to minimize.
[2024-05-22 21:43:53] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 1 ms to minimize.
[2024-05-22 21:43:53] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 2 ms to minimize.
[2024-05-22 21:43:53] [INFO ] Trap strengthening procedure interrupted after too many repetitions 965 ms
[2024-05-22 21:43:53] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 965 ms
[2024-05-22 21:43:53] [INFO ] After 1066ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 35 ms.
[2024-05-22 21:43:53] [INFO ] After 1266ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 201 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 201/201 places, 2600/2600 transitions.
Applied a total of 0 rules in 51 ms. Remains 201 /201 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 201/201 places, 2600/2600 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 258 ms. (steps per millisecond=38 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 267546 steps, run timeout after 3001 ms. (steps per millisecond=89 ) properties seen :{}
Probabilistic random walk after 267546 steps, saw 221937 distinct states, run finished after 3001 ms. (steps per millisecond=89 ) properties seen :0
Running SMT prover for 3 properties.
[2024-05-22 21:43:57] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2024-05-22 21:43:57] [INFO ] Invariant cache hit.
[2024-05-22 21:43:57] [INFO ] [Real]Absence check using 100 positive place invariants in 11 ms returned sat
[2024-05-22 21:43:57] [INFO ] [Real]Absence check using 100 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-22 21:43:57] [INFO ] After 167ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-22 21:43:57] [INFO ] [Nat]Absence check using 100 positive place invariants in 12 ms returned sat
[2024-05-22 21:43:57] [INFO ] [Nat]Absence check using 100 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-22 21:43:57] [INFO ] After 80ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-22 21:43:57] [INFO ] State equation strengthened by 50 read => feed constraints.
[2024-05-22 21:43:57] [INFO ] After 44ms SMT Verify possible using 50 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-22 21:43:57] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 0 ms to minimize.
[2024-05-22 21:43:57] [INFO ] Deduced a trap composed of 4 places in 96 ms of which 1 ms to minimize.
[2024-05-22 21:43:57] [INFO ] Deduced a trap composed of 4 places in 91 ms of which 0 ms to minimize.
[2024-05-22 21:43:57] [INFO ] Deduced a trap composed of 4 places in 90 ms of which 0 ms to minimize.
[2024-05-22 21:43:58] [INFO ] Deduced a trap composed of 4 places in 101 ms of which 1 ms to minimize.
[2024-05-22 21:43:58] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 1 ms to minimize.
[2024-05-22 21:43:58] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 1 ms to minimize.
[2024-05-22 21:43:58] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 0 ms to minimize.
[2024-05-22 21:43:58] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 1 ms to minimize.
[2024-05-22 21:43:58] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 1 ms to minimize.
[2024-05-22 21:43:58] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 1 ms to minimize.
[2024-05-22 21:43:58] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1053 ms
[2024-05-22 21:43:58] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1053 ms
[2024-05-22 21:43:58] [INFO ] After 1165ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 33 ms.
[2024-05-22 21:43:58] [INFO ] After 1387ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 201 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 201/201 places, 2600/2600 transitions.
Applied a total of 0 rules in 60 ms. Remains 201 /201 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60 ms. Remains : 201/201 places, 2600/2600 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 201/201 places, 2600/2600 transitions.
Applied a total of 0 rules in 53 ms. Remains 201 /201 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2024-05-22 21:43:58] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2024-05-22 21:43:58] [INFO ] Invariant cache hit.
[2024-05-22 21:43:59] [INFO ] Implicit Places using invariants in 431 ms returned []
[2024-05-22 21:43:59] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2024-05-22 21:43:59] [INFO ] Invariant cache hit.
[2024-05-22 21:43:59] [INFO ] State equation strengthened by 50 read => feed constraints.
[2024-05-22 21:43:59] [INFO ] Implicit Places using invariants and state equation in 547 ms returned []
Implicit Place search using SMT with State Equation took 980 ms to find 0 implicit places.
[2024-05-22 21:43:59] [INFO ] Redundant transitions in 55 ms returned []
[2024-05-22 21:43:59] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2024-05-22 21:43:59] [INFO ] Invariant cache hit.
[2024-05-22 21:44:00] [INFO ] Dead Transitions using invariants and state equation in 803 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1907 ms. Remains : 201/201 places, 2600/2600 transitions.
Graph (complete) has 305 edges and 201 vertex of which 17 are kept as prefixes of interest. Removing 184 places using SCC suffix rule.1 ms
Discarding 184 places :
Also discarding 2392 output transitions
Drop transitions removed 2392 transitions
Ensure Unique test removed 1 places
Ensure Unique test removed 192 transitions
Reduce isomorphic transitions removed 192 transitions.
Iterating post reduction 0 with 193 rules applied. Total rules applied 194 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 197 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 198 place count 14 transition count 14
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 200 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 206 place count 10 transition count 10
Applied a total of 206 rules in 7 ms. Remains 10 /201 variables (removed 191) and now considering 10/2600 (removed 2590) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 10 rows 10 cols
[2024-05-22 21:44:00] [INFO ] Computed 5 invariants in 2 ms
[2024-05-22 21:44:00] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-22 21:44:00] [INFO ] After 7ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3
[2024-05-22 21:44:00] [INFO ] After 12ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2 real:1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2024-05-22 21:44:00] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-22 21:44:00] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-22 21:44:00] [INFO ] After 7ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-22 21:44:00] [INFO ] After 29ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 5 ms.
[2024-05-22 21:44:00] [INFO ] After 63ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (OR p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (OR p0 p1))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 8 factoid took 2503 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 137 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 130 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Support contains 4 out of 201 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 201/201 places, 2600/2600 transitions.
Applied a total of 0 rules in 71 ms. Remains 201 /201 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2024-05-22 21:44:03] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 201 cols
[2024-05-22 21:44:03] [INFO ] Computed 101 invariants in 3 ms
[2024-05-22 21:44:04] [INFO ] Implicit Places using invariants in 441 ms returned []
[2024-05-22 21:44:04] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2024-05-22 21:44:04] [INFO ] Invariant cache hit.
[2024-05-22 21:44:04] [INFO ] State equation strengthened by 50 read => feed constraints.
[2024-05-22 21:44:04] [INFO ] Implicit Places using invariants and state equation in 566 ms returned []
Implicit Place search using SMT with State Equation took 1009 ms to find 0 implicit places.
[2024-05-22 21:44:04] [INFO ] Redundant transitions in 87 ms returned []
[2024-05-22 21:44:04] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2024-05-22 21:44:04] [INFO ] Invariant cache hit.
[2024-05-22 21:44:05] [INFO ] Dead Transitions using invariants and state equation in 834 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2013 ms. Remains : 201/201 places, 2600/2600 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 p0 p1), (X (NOT (AND (NOT p1) p0))), (X p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (OR p1 p0)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (OR p1 p0)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 8 factoid took 138 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 122 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 163 ms. (steps per millisecond=61 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-22 21:44:06] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2024-05-22 21:44:06] [INFO ] Invariant cache hit.
[2024-05-22 21:44:06] [INFO ] [Real]Absence check using 100 positive place invariants in 13 ms returned sat
[2024-05-22 21:44:06] [INFO ] [Real]Absence check using 100 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-22 21:44:06] [INFO ] After 173ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-22 21:44:06] [INFO ] [Nat]Absence check using 100 positive place invariants in 11 ms returned sat
[2024-05-22 21:44:06] [INFO ] [Nat]Absence check using 100 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-22 21:44:06] [INFO ] After 78ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-22 21:44:06] [INFO ] State equation strengthened by 50 read => feed constraints.
[2024-05-22 21:44:06] [INFO ] After 48ms SMT Verify possible using 50 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-22 21:44:06] [INFO ] Deduced a trap composed of 4 places in 102 ms of which 0 ms to minimize.
[2024-05-22 21:44:06] [INFO ] Deduced a trap composed of 4 places in 94 ms of which 1 ms to minimize.
[2024-05-22 21:44:06] [INFO ] Deduced a trap composed of 4 places in 92 ms of which 0 ms to minimize.
[2024-05-22 21:44:06] [INFO ] Deduced a trap composed of 4 places in 90 ms of which 0 ms to minimize.
[2024-05-22 21:44:07] [INFO ] Deduced a trap composed of 4 places in 91 ms of which 0 ms to minimize.
[2024-05-22 21:44:07] [INFO ] Deduced a trap composed of 4 places in 83 ms of which 0 ms to minimize.
[2024-05-22 21:44:07] [INFO ] Deduced a trap composed of 4 places in 83 ms of which 0 ms to minimize.
[2024-05-22 21:44:07] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 0 ms to minimize.
[2024-05-22 21:44:07] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 0 ms to minimize.
[2024-05-22 21:44:07] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 1 ms to minimize.
[2024-05-22 21:44:07] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 0 ms to minimize.
[2024-05-22 21:44:07] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1106 ms
[2024-05-22 21:44:07] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1107 ms
[2024-05-22 21:44:07] [INFO ] After 1209ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 35 ms.
[2024-05-22 21:44:07] [INFO ] After 1409ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 201 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 201/201 places, 2600/2600 transitions.
Applied a total of 0 rules in 60 ms. Remains 201 /201 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60 ms. Remains : 201/201 places, 2600/2600 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 165 ms. (steps per millisecond=60 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 283764 steps, run timeout after 3001 ms. (steps per millisecond=94 ) properties seen :{}
Probabilistic random walk after 283764 steps, saw 235308 distinct states, run finished after 3001 ms. (steps per millisecond=94 ) properties seen :0
Running SMT prover for 3 properties.
[2024-05-22 21:44:10] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2024-05-22 21:44:10] [INFO ] Invariant cache hit.
[2024-05-22 21:44:11] [INFO ] [Real]Absence check using 100 positive place invariants in 11 ms returned sat
[2024-05-22 21:44:11] [INFO ] [Real]Absence check using 100 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-22 21:44:11] [INFO ] After 153ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-22 21:44:11] [INFO ] [Nat]Absence check using 100 positive place invariants in 12 ms returned sat
[2024-05-22 21:44:11] [INFO ] [Nat]Absence check using 100 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-22 21:44:11] [INFO ] After 74ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-22 21:44:11] [INFO ] State equation strengthened by 50 read => feed constraints.
[2024-05-22 21:44:11] [INFO ] After 48ms SMT Verify possible using 50 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-22 21:44:11] [INFO ] Deduced a trap composed of 4 places in 102 ms of which 1 ms to minimize.
[2024-05-22 21:44:11] [INFO ] Deduced a trap composed of 4 places in 100 ms of which 0 ms to minimize.
[2024-05-22 21:44:11] [INFO ] Deduced a trap composed of 4 places in 89 ms of which 0 ms to minimize.
[2024-05-22 21:44:11] [INFO ] Deduced a trap composed of 4 places in 84 ms of which 0 ms to minimize.
[2024-05-22 21:44:11] [INFO ] Deduced a trap composed of 4 places in 88 ms of which 1 ms to minimize.
[2024-05-22 21:44:11] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 0 ms to minimize.
[2024-05-22 21:44:12] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 1 ms to minimize.
[2024-05-22 21:44:12] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 0 ms to minimize.
[2024-05-22 21:44:12] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 1 ms to minimize.
[2024-05-22 21:44:12] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 0 ms to minimize.
[2024-05-22 21:44:12] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 0 ms to minimize.
[2024-05-22 21:44:12] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1057 ms
[2024-05-22 21:44:12] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1057 ms
[2024-05-22 21:44:12] [INFO ] After 1157ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 34 ms.
[2024-05-22 21:44:12] [INFO ] After 1350ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 201 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 201/201 places, 2600/2600 transitions.
Applied a total of 0 rules in 49 ms. Remains 201 /201 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 201/201 places, 2600/2600 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 201/201 places, 2600/2600 transitions.
Applied a total of 0 rules in 49 ms. Remains 201 /201 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2024-05-22 21:44:12] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2024-05-22 21:44:12] [INFO ] Invariant cache hit.
[2024-05-22 21:44:12] [INFO ] Implicit Places using invariants in 406 ms returned []
[2024-05-22 21:44:12] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2024-05-22 21:44:12] [INFO ] Invariant cache hit.
[2024-05-22 21:44:13] [INFO ] State equation strengthened by 50 read => feed constraints.
[2024-05-22 21:44:13] [INFO ] Implicit Places using invariants and state equation in 541 ms returned []
Implicit Place search using SMT with State Equation took 950 ms to find 0 implicit places.
[2024-05-22 21:44:13] [INFO ] Redundant transitions in 86 ms returned []
[2024-05-22 21:44:13] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2024-05-22 21:44:13] [INFO ] Invariant cache hit.
[2024-05-22 21:44:14] [INFO ] Dead Transitions using invariants and state equation in 825 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1923 ms. Remains : 201/201 places, 2600/2600 transitions.
Graph (complete) has 305 edges and 201 vertex of which 17 are kept as prefixes of interest. Removing 184 places using SCC suffix rule.0 ms
Discarding 184 places :
Also discarding 2392 output transitions
Drop transitions removed 2392 transitions
Ensure Unique test removed 1 places
Ensure Unique test removed 192 transitions
Reduce isomorphic transitions removed 192 transitions.
Iterating post reduction 0 with 193 rules applied. Total rules applied 194 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 197 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 198 place count 14 transition count 14
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 200 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 206 place count 10 transition count 10
Applied a total of 206 rules in 6 ms. Remains 10 /201 variables (removed 191) and now considering 10/2600 (removed 2590) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 10 rows 10 cols
[2024-05-22 21:44:14] [INFO ] Computed 5 invariants in 0 ms
[2024-05-22 21:44:14] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-22 21:44:14] [INFO ] After 6ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3
[2024-05-22 21:44:14] [INFO ] After 11ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2 real:1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2024-05-22 21:44:14] [INFO ] After 36ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-22 21:44:14] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-22 21:44:14] [INFO ] After 6ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-22 21:44:14] [INFO ] After 11ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 4 ms.
[2024-05-22 21:44:14] [INFO ] After 32ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p1) p0))), (X p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (OR p1 p0)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (OR p1 p0)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 8 factoid took 158 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 102 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 103 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 126 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 989 ms.
Product exploration explored 100000 steps with 0 reset in 1089 ms.
Built C files in :
/tmp/ltsmin968439160843123761
[2024-05-22 21:44:17] [INFO ] Too many transitions (2600) to apply POR reductions. Disabling POR matrices.
[2024-05-22 21:44:17] [INFO ] Built C files in 59ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin968439160843123761
Running compilation step : cd /tmp/ltsmin968439160843123761;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin968439160843123761;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin968439160843123761;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 4 out of 201 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 201/201 places, 2600/2600 transitions.
Applied a total of 0 rules in 68 ms. Remains 201 /201 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2024-05-22 21:44:20] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 201 cols
[2024-05-22 21:44:20] [INFO ] Computed 101 invariants in 4 ms
[2024-05-22 21:44:20] [INFO ] Implicit Places using invariants in 414 ms returned []
[2024-05-22 21:44:20] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2024-05-22 21:44:20] [INFO ] Invariant cache hit.
[2024-05-22 21:44:20] [INFO ] State equation strengthened by 50 read => feed constraints.
[2024-05-22 21:44:21] [INFO ] Implicit Places using invariants and state equation in 546 ms returned []
Implicit Place search using SMT with State Equation took 965 ms to find 0 implicit places.
[2024-05-22 21:44:21] [INFO ] Redundant transitions in 86 ms returned []
[2024-05-22 21:44:21] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2024-05-22 21:44:21] [INFO ] Invariant cache hit.
[2024-05-22 21:44:22] [INFO ] Dead Transitions using invariants and state equation in 781 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1911 ms. Remains : 201/201 places, 2600/2600 transitions.
Built C files in :
/tmp/ltsmin1801016552251466252
[2024-05-22 21:44:22] [INFO ] Too many transitions (2600) to apply POR reductions. Disabling POR matrices.
[2024-05-22 21:44:22] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1801016552251466252
Running compilation step : cd /tmp/ltsmin1801016552251466252;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1801016552251466252;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1801016552251466252;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-22 21:44:25] [INFO ] Flatten gal took : 117 ms
[2024-05-22 21:44:25] [INFO ] Flatten gal took : 106 ms
[2024-05-22 21:44:25] [INFO ] Time to serialize gal into /tmp/LTL12922338272482057597.gal : 20 ms
[2024-05-22 21:44:25] [INFO ] Time to serialize properties into /tmp/LTL13258795900135167458.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12922338272482057597.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1821446921777374363.hoa' '-atoms' '/tmp/LTL13258795900135167458.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL13258795900135167458.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1821446921777374363.hoa
Reverse transition relation is NOT exact ! Due to transitions t51, t103, t155, t207, t259, t311, t363, t415, t467, t519, t571, t623, t675, t727, t779, t831...494
Detected timeout of ITS tools.
[2024-05-22 21:44:40] [INFO ] Flatten gal took : 92 ms
[2024-05-22 21:44:40] [INFO ] Flatten gal took : 86 ms
[2024-05-22 21:44:40] [INFO ] Time to serialize gal into /tmp/LTL550930560408132804.gal : 17 ms
[2024-05-22 21:44:40] [INFO ] Time to serialize properties into /tmp/LTL4598925857213662091.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL550930560408132804.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4598925857213662091.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...274
Read 1 LTL properties
Checking formula 0 : !((F((X(G(("((p1_6==0)||(flag_0_40==1))")U("((p3_9==0)||(p0_31==1))"))))&&("((p1_6==0)||(flag_0_40==1))"))))
Formula 0 simplified : G(!"((p1_6==0)||(flag_0_40==1))" | XF(!"((p1_6==0)||(flag_0_40==1))" R !"((p3_9==0)||(p0_31==1))"))
Reverse transition relation is NOT exact ! Due to transitions t51, t103, t155, t207, t259, t311, t363, t415, t467, t519, t571, t623, t675, t727, t779, t831...494
Detected timeout of ITS tools.
[2024-05-22 21:44:56] [INFO ] Flatten gal took : 83 ms
[2024-05-22 21:44:56] [INFO ] Applying decomposition
[2024-05-22 21:44:56] [INFO ] Flatten gal took : 82 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph13905632523581689191.txt' '-o' '/tmp/graph13905632523581689191.bin' '-w' '/tmp/graph13905632523581689191.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph13905632523581689191.bin' '-l' '-1' '-v' '-w' '/tmp/graph13905632523581689191.weights' '-q' '0' '-e' '0.001'
[2024-05-22 21:44:56] [INFO ] Decomposing Gal with order
[2024-05-22 21:44:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 21:44:57] [INFO ] Removed a total of 7249 redundant transitions.
[2024-05-22 21:44:57] [INFO ] Flatten gal took : 635 ms
[2024-05-22 21:44:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 57 ms.
[2024-05-22 21:44:57] [INFO ] Time to serialize gal into /tmp/LTL3818857102514817809.gal : 30 ms
[2024-05-22 21:44:57] [INFO ] Time to serialize properties into /tmp/LTL14912941923431756843.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3818857102514817809.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14912941923431756843.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F((X(G(("((u6.p1_6==0)||(u40.flag_0_40==1))")U("((u9.p3_9==0)||(i31.u50.p0_31==1))"))))&&("((u6.p1_6==0)||(u40.flag_0_40==1))"))))
Formula 0 simplified : G(!"((u6.p1_6==0)||(u40.flag_0_40==1))" | XF(!"((u6.p1_6==0)||(u40.flag_0_40==1))" R !"((u9.p3_9==0)||(i31.u50.p0_31==1))"))
Reverse transition relation is NOT exact ! Due to transitions u0.t51, u1.t103, u2.t155, u3.t207, u4.t259, u5.t311, u6.t363, u7.t415, u8.t467, u9.t519, u10....684
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
182 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.973,79132,1,0,169809,1355,19751,92095,174,1382,228151
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Dekker-PT-050-LTLCardinality-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property Dekker-PT-050-LTLCardinality-11 finished in 71350 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 208 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 208/208 places, 2600/2600 transitions.
Applied a total of 0 rules in 63 ms. Remains 208 /208 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2024-05-22 21:45:00] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 208 cols
[2024-05-22 21:45:00] [INFO ] Computed 108 invariants in 1 ms
[2024-05-22 21:45:00] [INFO ] Implicit Places using invariants in 725 ms returned [114, 131, 136, 147, 156, 167, 178, 193]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 729 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 200/208 places, 2600/2600 transitions.
Applied a total of 0 rules in 78 ms. Remains 200 /200 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 876 ms. Remains : 200/208 places, 2600/2600 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : Dekker-PT-050-LTLCardinality-13 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 s125 0) (EQ s11 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 959 ms.
Product exploration explored 100000 steps with 0 reset in 1025 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 : [p0, (X p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 128 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 149 ms. (steps per millisecond=67 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 761379 steps, run timeout after 3001 ms. (steps per millisecond=253 ) properties seen :{}
Probabilistic random walk after 761379 steps, saw 618980 distinct states, run finished after 3001 ms. (steps per millisecond=253 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-22 21:45:06] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 200 cols
[2024-05-22 21:45:06] [INFO ] Computed 100 invariants in 14 ms
[2024-05-22 21:45:06] [INFO ] [Real]Absence check using 100 positive place invariants in 11 ms returned sat
[2024-05-22 21:45:06] [INFO ] After 82ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-22 21:45:06] [INFO ] State equation strengthened by 50 read => feed constraints.
[2024-05-22 21:45:06] [INFO ] After 23ms SMT Verify possible using 50 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 21:45:06] [INFO ] After 208ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 21:45:06] [INFO ] [Nat]Absence check using 100 positive place invariants in 10 ms returned sat
[2024-05-22 21:45:06] [INFO ] After 49ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 21:45:06] [INFO ] After 20ms SMT Verify possible using 50 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-22 21:45:06] [INFO ] After 36ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2024-05-22 21:45:06] [INFO ] After 177ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 200 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 200/200 places, 2600/2600 transitions.
Applied a total of 0 rules in 54 ms. Remains 200 /200 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 200/200 places, 2600/2600 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 793458 steps, run timeout after 3001 ms. (steps per millisecond=264 ) properties seen :{}
Probabilistic random walk after 793458 steps, saw 645010 distinct states, run finished after 3001 ms. (steps per millisecond=264 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-22 21:45:09] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2024-05-22 21:45:09] [INFO ] Invariant cache hit.
[2024-05-22 21:45:09] [INFO ] [Real]Absence check using 100 positive place invariants in 12 ms returned sat
[2024-05-22 21:45:09] [INFO ] After 67ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-22 21:45:09] [INFO ] State equation strengthened by 50 read => feed constraints.
[2024-05-22 21:45:09] [INFO ] After 25ms SMT Verify possible using 50 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 21:45:09] [INFO ] After 181ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 21:45:10] [INFO ] [Nat]Absence check using 100 positive place invariants in 11 ms returned sat
[2024-05-22 21:45:10] [INFO ] After 51ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 21:45:10] [INFO ] After 19ms SMT Verify possible using 50 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-22 21:45:10] [INFO ] After 35ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 11 ms.
[2024-05-22 21:45:10] [INFO ] After 175ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 200 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 200/200 places, 2600/2600 transitions.
Applied a total of 0 rules in 53 ms. Remains 200 /200 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 200/200 places, 2600/2600 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 200/200 places, 2600/2600 transitions.
Applied a total of 0 rules in 52 ms. Remains 200 /200 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2024-05-22 21:45:10] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2024-05-22 21:45:10] [INFO ] Invariant cache hit.
[2024-05-22 21:45:10] [INFO ] Implicit Places using invariants in 410 ms returned []
[2024-05-22 21:45:10] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2024-05-22 21:45:10] [INFO ] Invariant cache hit.
[2024-05-22 21:45:10] [INFO ] State equation strengthened by 50 read => feed constraints.
[2024-05-22 21:45:11] [INFO ] Implicit Places using invariants and state equation in 510 ms returned []
Implicit Place search using SMT with State Equation took 958 ms to find 0 implicit places.
[2024-05-22 21:45:11] [INFO ] Redundant transitions in 84 ms returned []
[2024-05-22 21:45:11] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2024-05-22 21:45:11] [INFO ] Invariant cache hit.
[2024-05-22 21:45:12] [INFO ] Dead Transitions using invariants and state equation in 815 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1934 ms. Remains : 200/200 places, 2600/2600 transitions.
Graph (complete) has 300 edges and 200 vertex of which 8 are kept as prefixes of interest. Removing 192 places using SCC suffix rule.0 ms
Discarding 192 places :
Also discarding 2496 output transitions
Drop transitions removed 2496 transitions
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 96 transitions.
Iterating post reduction 0 with 96 rules applied. Total rules applied 97 place count 8 transition count 8
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 3 rules applied. Total rules applied 100 place count 6 transition count 7
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 101 place count 6 transition count 6
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 102 place count 6 transition count 5
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 105 place count 4 transition count 4
Applied a total of 105 rules in 4 ms. Remains 4 /200 variables (removed 196) and now considering 4/2600 (removed 2596) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 4 rows 4 cols
[2024-05-22 21:45:12] [INFO ] Computed 2 invariants in 0 ms
[2024-05-22 21:45:12] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-22 21:45:12] [INFO ] After 3ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-22 21:45:12] [INFO ] After 6ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2024-05-22 21:45:12] [INFO ] After 27ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 116 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Support contains 2 out of 200 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 200/200 places, 2600/2600 transitions.
Applied a total of 0 rules in 68 ms. Remains 200 /200 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2024-05-22 21:45:12] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 200 cols
[2024-05-22 21:45:12] [INFO ] Computed 100 invariants in 1 ms
[2024-05-22 21:45:12] [INFO ] Implicit Places using invariants in 391 ms returned []
[2024-05-22 21:45:12] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2024-05-22 21:45:12] [INFO ] Invariant cache hit.
[2024-05-22 21:45:13] [INFO ] State equation strengthened by 50 read => feed constraints.
[2024-05-22 21:45:13] [INFO ] Implicit Places using invariants and state equation in 575 ms returned []
Implicit Place search using SMT with State Equation took 992 ms to find 0 implicit places.
[2024-05-22 21:45:13] [INFO ] Redundant transitions in 87 ms returned []
[2024-05-22 21:45:13] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2024-05-22 21:45:13] [INFO ] Invariant cache hit.
[2024-05-22 21:45:14] [INFO ] Dead Transitions using invariants and state equation in 885 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2052 ms. Remains : 200/200 places, 2600/2600 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 : [p0, (X p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 135 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 885615 steps, run timeout after 3001 ms. (steps per millisecond=295 ) properties seen :{}
Probabilistic random walk after 885615 steps, saw 718795 distinct states, run finished after 3001 ms. (steps per millisecond=295 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-22 21:45:17] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2024-05-22 21:45:17] [INFO ] Invariant cache hit.
[2024-05-22 21:45:17] [INFO ] [Real]Absence check using 100 positive place invariants in 12 ms returned sat
[2024-05-22 21:45:17] [INFO ] After 51ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-22 21:45:17] [INFO ] State equation strengthened by 50 read => feed constraints.
[2024-05-22 21:45:17] [INFO ] After 24ms SMT Verify possible using 50 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 21:45:17] [INFO ] After 161ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 21:45:18] [INFO ] [Nat]Absence check using 100 positive place invariants in 10 ms returned sat
[2024-05-22 21:45:18] [INFO ] After 49ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 21:45:18] [INFO ] After 20ms SMT Verify possible using 50 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-22 21:45:18] [INFO ] After 37ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2024-05-22 21:45:18] [INFO ] After 184ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 200 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 200/200 places, 2600/2600 transitions.
Applied a total of 0 rules in 52 ms. Remains 200 /200 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 200/200 places, 2600/2600 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 822681 steps, run timeout after 3001 ms. (steps per millisecond=274 ) properties seen :{}
Probabilistic random walk after 822681 steps, saw 668335 distinct states, run finished after 3001 ms. (steps per millisecond=274 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-22 21:45:21] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2024-05-22 21:45:21] [INFO ] Invariant cache hit.
[2024-05-22 21:45:21] [INFO ] [Real]Absence check using 100 positive place invariants in 12 ms returned sat
[2024-05-22 21:45:21] [INFO ] After 57ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-22 21:45:21] [INFO ] State equation strengthened by 50 read => feed constraints.
[2024-05-22 21:45:21] [INFO ] After 25ms SMT Verify possible using 50 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 21:45:21] [INFO ] After 174ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 21:45:21] [INFO ] [Nat]Absence check using 100 positive place invariants in 37 ms returned sat
[2024-05-22 21:45:21] [INFO ] After 91ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 21:45:21] [INFO ] After 22ms SMT Verify possible using 50 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-22 21:45:21] [INFO ] After 37ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2024-05-22 21:45:21] [INFO ] After 240ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 200 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 200/200 places, 2600/2600 transitions.
Applied a total of 0 rules in 51 ms. Remains 200 /200 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 200/200 places, 2600/2600 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 200/200 places, 2600/2600 transitions.
Applied a total of 0 rules in 52 ms. Remains 200 /200 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2024-05-22 21:45:21] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2024-05-22 21:45:21] [INFO ] Invariant cache hit.
[2024-05-22 21:45:22] [INFO ] Implicit Places using invariants in 460 ms returned []
[2024-05-22 21:45:22] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2024-05-22 21:45:22] [INFO ] Invariant cache hit.
[2024-05-22 21:45:22] [INFO ] State equation strengthened by 50 read => feed constraints.
[2024-05-22 21:45:23] [INFO ] Implicit Places using invariants and state equation in 658 ms returned []
Implicit Place search using SMT with State Equation took 1139 ms to find 0 implicit places.
[2024-05-22 21:45:23] [INFO ] Redundant transitions in 86 ms returned []
[2024-05-22 21:45:23] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2024-05-22 21:45:23] [INFO ] Invariant cache hit.
[2024-05-22 21:45:23] [INFO ] Dead Transitions using invariants and state equation in 813 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2113 ms. Remains : 200/200 places, 2600/2600 transitions.
Graph (complete) has 300 edges and 200 vertex of which 8 are kept as prefixes of interest. Removing 192 places using SCC suffix rule.0 ms
Discarding 192 places :
Also discarding 2496 output transitions
Drop transitions removed 2496 transitions
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 96 transitions.
Iterating post reduction 0 with 96 rules applied. Total rules applied 97 place count 8 transition count 8
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 3 rules applied. Total rules applied 100 place count 6 transition count 7
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 101 place count 6 transition count 6
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 102 place count 6 transition count 5
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 105 place count 4 transition count 4
Applied a total of 105 rules in 2 ms. Remains 4 /200 variables (removed 196) and now considering 4/2600 (removed 2596) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 4 rows 4 cols
[2024-05-22 21:45:23] [INFO ] Computed 2 invariants in 0 ms
[2024-05-22 21:45:23] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-22 21:45:23] [INFO ] After 3ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-22 21:45:23] [INFO ] After 5ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1 ms.
[2024-05-22 21:45:24] [INFO ] After 63ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 181 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 939 ms.
Product exploration explored 100000 steps with 0 reset in 1071 ms.
Built C files in :
/tmp/ltsmin10697835647157088574
[2024-05-22 21:45:26] [INFO ] Too many transitions (2600) to apply POR reductions. Disabling POR matrices.
[2024-05-22 21:45:26] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10697835647157088574
Running compilation step : cd /tmp/ltsmin10697835647157088574;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10697835647157088574;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10697835647157088574;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 2 out of 200 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 200/200 places, 2600/2600 transitions.
Applied a total of 0 rules in 65 ms. Remains 200 /200 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2024-05-22 21:45:29] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 200 cols
[2024-05-22 21:45:29] [INFO ] Computed 100 invariants in 1 ms
[2024-05-22 21:45:29] [INFO ] Implicit Places using invariants in 385 ms returned []
[2024-05-22 21:45:29] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2024-05-22 21:45:29] [INFO ] Invariant cache hit.
[2024-05-22 21:45:30] [INFO ] State equation strengthened by 50 read => feed constraints.
[2024-05-22 21:45:30] [INFO ] Implicit Places using invariants and state equation in 492 ms returned []
Implicit Place search using SMT with State Equation took 916 ms to find 0 implicit places.
[2024-05-22 21:45:30] [INFO ] Redundant transitions in 60 ms returned []
[2024-05-22 21:45:30] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2024-05-22 21:45:30] [INFO ] Invariant cache hit.
[2024-05-22 21:45:31] [INFO ] Dead Transitions using invariants and state equation in 805 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1889 ms. Remains : 200/200 places, 2600/2600 transitions.
Built C files in :
/tmp/ltsmin11830174290784718489
[2024-05-22 21:45:31] [INFO ] Too many transitions (2600) to apply POR reductions. Disabling POR matrices.
[2024-05-22 21:45:31] [INFO ] Built C files in 35ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11830174290784718489
Running compilation step : cd /tmp/ltsmin11830174290784718489;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11830174290784718489;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11830174290784718489;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-22 21:45:35] [INFO ] Flatten gal took : 79 ms
[2024-05-22 21:45:35] [INFO ] Flatten gal took : 78 ms
[2024-05-22 21:45:35] [INFO ] Time to serialize gal into /tmp/LTL1838949291922457941.gal : 12 ms
[2024-05-22 21:45:35] [INFO ] Time to serialize properties into /tmp/LTL11006185155666416457.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1838949291922457941.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13574585174316497477.hoa' '-atoms' '/tmp/LTL11006185155666416457.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL11006185155666416457.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13574585174316497477.hoa
Reverse transition relation is NOT exact ! Due to transitions t51, t103, t155, t207, t259, t311, t363, t415, t467, t519, t571, t623, t675, t727, t779, t831...494
Detected timeout of ITS tools.
[2024-05-22 21:45:50] [INFO ] Flatten gal took : 77 ms
[2024-05-22 21:45:50] [INFO ] Flatten gal took : 76 ms
[2024-05-22 21:45:50] [INFO ] Time to serialize gal into /tmp/LTL2861360219455609717.gal : 11 ms
[2024-05-22 21:45:50] [INFO ] Time to serialize properties into /tmp/LTL14143238117514774742.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2861360219455609717.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14143238117514774742.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G("((p3_12==0)||(flag_1_5==1))"))))
Formula 0 simplified : GF!"((p3_12==0)||(flag_1_5==1))"
Reverse transition relation is NOT exact ! Due to transitions t51, t103, t155, t207, t259, t311, t363, t415, t467, t519, t571, t623, t675, t727, t779, t831...494
Detected timeout of ITS tools.
[2024-05-22 21:46:05] [INFO ] Flatten gal took : 108 ms
[2024-05-22 21:46:05] [INFO ] Applying decomposition
[2024-05-22 21:46:05] [INFO ] Flatten gal took : 75 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph956263903609527900.txt' '-o' '/tmp/graph956263903609527900.bin' '-w' '/tmp/graph956263903609527900.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph956263903609527900.bin' '-l' '-1' '-v' '-w' '/tmp/graph956263903609527900.weights' '-q' '0' '-e' '0.001'
[2024-05-22 21:46:05] [INFO ] Decomposing Gal with order
[2024-05-22 21:46:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 21:46:06] [INFO ] Removed a total of 7200 redundant transitions.
[2024-05-22 21:46:06] [INFO ] Flatten gal took : 260 ms
[2024-05-22 21:46:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 33 ms.
[2024-05-22 21:46:06] [INFO ] Time to serialize gal into /tmp/LTL7186692866783632636.gal : 25 ms
[2024-05-22 21:46:06] [INFO ] Time to serialize properties into /tmp/LTL5619327360598629023.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7186692866783632636.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5619327360598629023.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((F(G("((u12.p3_12==0)||(u5.flag_1_5==1))"))))
Formula 0 simplified : GF!"((u12.p3_12==0)||(u5.flag_1_5==1))"
Reverse transition relation is NOT exact ! Due to transitions u0.t51, u1.t103, u2.t155, u3.t207, u4.t259, u5.t311, u6.t363, u7.t415, u8.t467, u9.t519, u10....684
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
191 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,2.07954,94920,1,0,215226,1350,19012,139372,165,1325,311315
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Dekker-PT-050-LTLCardinality-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property Dekker-PT-050-LTLCardinality-13 finished in 68904 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(!((p0 U p1) U G(p0)))'
Support contains 3 out of 208 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 208/208 places, 2600/2600 transitions.
Applied a total of 0 rules in 75 ms. Remains 208 /208 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2024-05-22 21:46:08] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 208 cols
[2024-05-22 21:46:08] [INFO ] Computed 108 invariants in 2 ms
[2024-05-22 21:46:09] [INFO ] Implicit Places using invariants in 520 ms returned [114, 136, 147, 156, 167, 178, 193]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 537 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 201/208 places, 2600/2600 transitions.
Applied a total of 0 rules in 60 ms. Remains 201 /201 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 673 ms. Remains : 201/208 places, 2600/2600 transitions.
Stuttering acceptance computed with spot in 477 ms :[p0, p0, (AND p1 p0)]
Running random walk in product with property : Dekker-PT-050-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(NEQ s82 1), p0:(OR (EQ s188 0) (EQ s130 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 921 ms.
Stack based approach found an accepted trace after 41 steps with 0 reset with depth 42 and stack size 42 in 0 ms.
FORMULA Dekker-PT-050-LTLCardinality-14 FALSE TECHNIQUES STACK_TEST
Treatment of property Dekker-PT-050-LTLCardinality-14 finished in 2092 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||G(p1)))))'
Support contains 2 out of 208 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 208/208 places, 2600/2600 transitions.
Applied a total of 0 rules in 10 ms. Remains 208 /208 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2024-05-22 21:46:10] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2024-05-22 21:46:10] [INFO ] Invariant cache hit.
[2024-05-22 21:46:11] [INFO ] Implicit Places using invariants in 518 ms returned [114, 131, 136, 147, 156, 167, 178, 193]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 539 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 200/208 places, 2600/2600 transitions.
Applied a total of 0 rules in 10 ms. Remains 200 /200 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 560 ms. Remains : 200/208 places, 2600/2600 transitions.
Stuttering acceptance computed with spot in 101 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Dekker-PT-050-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(EQ s192 1), p0:(EQ s119 0)], 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][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 926 ms.
Product exploration explored 100000 steps with 0 reset in 994 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 (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT (AND (NOT p0) p1))), true, (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X (NOT p1))), (X (X p1))]
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be false thanks to negative knowledge :(X (X (AND (NOT p0) (NOT p1))))
Knowledge based reduction with 6 factoid took 107 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA Dekker-PT-050-LTLCardinality-15 FALSE TECHNIQUES KNOWLEDGE
Treatment of property Dekker-PT-050-LTLCardinality-15 finished in 2726 ms.
All properties solved by simple procedures.
Total runtime 174660 ms.

BK_STOP 1716414374916

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Dekker-PT-050"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is Dekker-PT-050, 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 r153-tall-171631151000067"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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