Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r044-tall-174854028900683.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is CryptoMiner-PT-D20N100, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r044-tall-174854028900683
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 27K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 153K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 16K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 108K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 17K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 70K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 33K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 45K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 268K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 35K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 230K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 9.0K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 8 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 27K May 29 14:32 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1748640754037

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CryptoMiner-PT-D20N100
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-05-30 21:32:35] [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]
[2025-05-30 21:32:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 21:32:35] [INFO ] Load time of PNML (sax parser for PT used): 43 ms
[2025-05-30 21:32:35] [INFO ] Transformed 63 places.
[2025-05-30 21:32:35] [INFO ] Transformed 63 transitions.
[2025-05-30 21:32:35] [INFO ] Parsed PT model containing 63 places and 63 transitions and 187 arcs in 126 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 17 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA CryptoMiner-PT-D20N100-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CryptoMiner-PT-D20N100-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 63 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 63/63 transitions.
Applied a total of 0 rules in 7 ms. Remains 63 /63 variables (removed 0) and now considering 63/63 (removed 0) transitions.
// Phase 1: matrix 63 rows 63 cols
[2025-05-30 21:32:35] [INFO ] Computed 1 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 21:32:35] [INFO ] Implicit Places using invariants in 141 ms returned []
[2025-05-30 21:32:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 21:32:35] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-05-30 21:32:35] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 244 ms to find 0 implicit places.
Running 60 sub problems to find dead transitions.
[2025-05-30 21:32:35] [INFO ] Invariant cache hit.
[2025-05-30 21:32:35] [INFO ] State equation strengthened by 20 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 2/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 63/125 variables, 62/63 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 1/126 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (OVERLAPS) 0/126 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 126/126 variables, and 84 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1939 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 2/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 63/125 variables, 62/63 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 59/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 1/126 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/126 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/126 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (OVERLAPS) 0/126 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 126/126 variables, and 144 constraints, problems are : Problem set: 0 solved, 60 unsolved in 3071 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5042ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 5055ms
Finished structural reductions in LTL mode , in 1 iterations and 5333 ms. Remains : 63/63 places, 63/63 transitions.
Support contains 63 out of 63 places after structural reductions.
[2025-05-30 21:32:40] [INFO ] Flatten gal took : 20 ms
[2025-05-30 21:32:40] [INFO ] Flatten gal took : 7 ms
[2025-05-30 21:32:41] [INFO ] Input system was already deterministic with 63 transitions.
RANDOM walk for 40213 steps (9 resets) in 183 ms. (218 steps per ms) remains 8/28 properties
BEST_FIRST walk for 40004 steps (8 resets) in 172 ms. (231 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 93 ms. (425 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 102 ms. (388 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 128 ms. (310 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 78 ms. (506 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 74 ms. (533 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 146 ms. (272 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 91 ms. (434 steps per ms) remains 8/8 properties
[2025-05-30 21:32:41] [INFO ] Invariant cache hit.
[2025-05-30 21:32:41] [INFO ] State equation strengthened by 20 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 36/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp27 is UNSAT
At refinement iteration 3 (OVERLAPS) 63/126 variables, 63/64 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 20/84 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 0/84 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 0/126 variables, 0/84 constraints. Problems are: Problem set: 4 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 126/126 variables, and 84 constraints, problems are : Problem set: 4 solved, 4 unsolved in 98 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 4 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 37/43 variables, 1/1 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/1 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 44/87 variables, 43/44 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 2/46 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 0/46 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 4/91 variables, 2/48 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/91 variables, 2/50 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/91 variables, 0/50 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 4/95 variables, 2/52 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/95 variables, 2/54 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/95 variables, 0/54 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 4/99 variables, 2/56 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/99 variables, 2/58 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/99 variables, 1/59 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/99 variables, 0/59 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 4/103 variables, 2/61 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/103 variables, 2/63 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/103 variables, 0/63 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 3/106 variables, 2/65 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/106 variables, 1/66 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/106 variables, 0/66 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 2/108 variables, 1/67 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/108 variables, 1/68 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/108 variables, 0/68 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 25 (OVERLAPS) 2/110 variables, 1/69 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/110 variables, 1/70 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/110 variables, 1/71 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/110 variables, 0/71 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 29 (OVERLAPS) 2/112 variables, 1/72 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/112 variables, 1/73 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/112 variables, 0/73 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 32 (OVERLAPS) 2/114 variables, 1/74 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/114 variables, 1/75 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/114 variables, 0/75 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 35 (OVERLAPS) 2/116 variables, 1/76 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/116 variables, 1/77 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/116 variables, 0/77 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 38 (OVERLAPS) 2/118 variables, 1/78 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/118 variables, 1/79 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/118 variables, 0/79 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 41 (OVERLAPS) 2/120 variables, 1/80 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/120 variables, 1/81 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/120 variables, 0/81 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 44 (OVERLAPS) 2/122 variables, 1/82 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/122 variables, 1/83 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/122 variables, 0/83 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 47 (OVERLAPS) 2/124 variables, 1/84 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/124 variables, 1/85 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/124 variables, 1/86 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/124 variables, 0/86 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 51 (OVERLAPS) 2/126 variables, 1/87 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/126 variables, 1/88 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/126 variables, 0/88 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 54 (OVERLAPS) 0/126 variables, 0/88 constraints. Problems are: Problem set: 4 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 126/126 variables, and 88 constraints, problems are : Problem set: 4 solved, 4 unsolved in 583 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 4/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 689ms problems are : Problem set: 4 solved, 4 unsolved
Finished Parikh walk after 1495 steps, including 2 resets, run visited all 1 properties in 2 ms. (steps per millisecond=747 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 4 properties in 83 ms.
Successfully simplified 4 atomic propositions for a total of 14 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA CryptoMiner-PT-D20N100-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 41 stabilizing places and 41 stable transitions
Graph (complete) has 165 edges and 63 vertex of which 22 are kept as prefixes of interest. Removing 41 places using SCC suffix rule.3 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U X(X((p1&&X((p1 U (G(p1)||(X(p2) U ((p3&&X(p2))||X(G(p2))))))))))))'
Support contains 63 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 63/63 transitions.
Applied a total of 0 rules in 1 ms. Remains 63 /63 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2025-05-30 21:32:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 21:32:42] [INFO ] Implicit Places using invariants in 24 ms returned []
[2025-05-30 21:32:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 21:32:42] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-05-30 21:32:42] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
Running 60 sub problems to find dead transitions.
[2025-05-30 21:32:42] [INFO ] Invariant cache hit.
[2025-05-30 21:32:42] [INFO ] State equation strengthened by 20 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 2/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 63/125 variables, 62/63 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 1/126 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (OVERLAPS) 0/126 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 126/126 variables, and 84 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1670 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 2/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 63/125 variables, 62/63 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 59/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 1/126 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/126 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/126 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (OVERLAPS) 0/126 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 126/126 variables, and 144 constraints, problems are : Problem set: 0 solved, 60 unsolved in 2774 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4453ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 4453ms
Finished structural reductions in LTL mode , in 1 iterations and 4523 ms. Remains : 63/63 places, 63/63 transitions.
Stuttering acceptance computed with spot in 1353 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : CryptoMiner-PT-D20N100-LTLCardinality-00
Product exploration explored 100000 steps with 10 reset in 751 ms.
Product exploration explored 100000 steps with 4 reset in 864 ms.
Computed a total of 41 stabilizing places and 41 stable transitions
Graph (complete) has 165 edges and 63 vertex of which 22 are kept as prefixes of interest. Removing 41 places using SCC suffix rule.1 ms
Computed a total of 41 stabilizing places and 41 stable transitions
Knowledge obtained : [(AND p0 p1 p2 p3), (X p0), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 203 ms. Reduced automaton from 26 states, 117 edges and 4 AP (stutter sensitive) to 25 states, 114 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 1217 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
RANDOM walk for 40207 steps (10 resets) in 222 ms. (180 steps per ms) remains 26/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 16/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (8 resets) in 30 ms. (129 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 16/16 properties
[2025-05-30 21:32:51] [INFO ] Invariant cache hit.
[2025-05-30 21:32:51] [INFO ] State equation strengthened by 20 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem apf16 is UNSAT
Problem apf35 is UNSAT
Problem apf0 is UNSAT
Problem apf5 is UNSAT
Problem apf17 is UNSAT
Problem apf18 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 1/1 constraints. Problems are: Problem set: 6 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 0/1 constraints. Problems are: Problem set: 6 solved, 10 unsolved
Problem apf4 is UNSAT
Problem apf7 is UNSAT
Problem apf9 is UNSAT
Problem apf14 is UNSAT
Problem apf24 is UNSAT
Problem apf45 is UNSAT
At refinement iteration 2 (OVERLAPS) 63/126 variables, 63/64 constraints. Problems are: Problem set: 12 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 20/84 constraints. Problems are: Problem set: 12 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 0/84 constraints. Problems are: Problem set: 12 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 0/126 variables, 0/84 constraints. Problems are: Problem set: 12 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 126/126 variables, and 84 constraints, problems are : Problem set: 12 solved, 4 unsolved in 172 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 12 solved, 4 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 1/1 constraints. Problems are: Problem set: 12 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 0/1 constraints. Problems are: Problem set: 12 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 63/126 variables, 63/64 constraints. Problems are: Problem set: 12 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 20/84 constraints. Problems are: Problem set: 12 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 4/88 constraints. Problems are: Problem set: 12 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 0/88 constraints. Problems are: Problem set: 12 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 0/126 variables, 0/88 constraints. Problems are: Problem set: 12 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 126/126 variables, and 88 constraints, problems are : Problem set: 12 solved, 4 unsolved in 474 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 4/16 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 736ms problems are : Problem set: 12 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Finished Parikh walk after 99 steps, including 0 resets, run visited all 4 properties in 6 ms. (steps per millisecond=16 )
Parikh walk visited 4 properties in 7 ms.
Found 12 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 p2 p3), (X p0), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (G (OR (NOT p1) p2 p3)), (G (OR (NOT p1) p2 (NOT p3))), (G (OR (NOT p1) p0)), (G (OR (NOT p1) p2 (NOT p0) p3)), (G (OR (NOT p1) p2 p0 (NOT p3))), (G (OR (NOT p1) p2 (NOT p0) (NOT p3))), (G (OR (NOT p1) p2 (NOT p0))), (G (OR (NOT p1) p2)), (G (OR (NOT p1) p2 p0 p3)), (G (OR (NOT p1) p2 p0)), (G (OR (NOT p1) p0 (NOT p3))), (G (OR (NOT p1) p0 p3))]
False Knowledge obtained : [(F (NOT (OR p1 (NOT p2) (NOT p0)))), (F (NOT (AND p1 p0 p3))), (F (NOT (OR (NOT p1) (NOT p0) p3))), (F (NOT (OR p1 p2 p0))), (F (NOT (OR (NOT p1) (NOT p2) (NOT p0) p3))), (F (NOT (OR p1 (NOT p0) p3))), (F (NOT (OR p1 p2 p3))), (F (NOT (OR (NOT p0) p3))), (F (NOT (OR p1 p0))), (F (NOT p3)), (F (NOT (OR p2 p0))), (F (NOT p0)), (F (NOT (OR (NOT p1) p3))), (F (NOT (OR p1 p2))), (F (NOT (AND p1 p0))), (F (NOT (OR p1 p2 p0 p3))), (F (NOT p1)), (F (NOT (OR p0 p3))), (F (NOT (OR p2 p3))), (F (NOT (OR p1 p3))), (F (NOT (OR p1 p2 (NOT p0)))), (F (NOT (OR (NOT p2) p3))), (F (NOT (OR p1 p2 (NOT p0) p3))), (F (NOT p2)), (F (NOT (OR p1 (NOT p0)))), (F (NOT (AND p1 p2 p0 p3))), (F (NOT (AND (OR p1 p0 p3) (OR (NOT p2) p0 p3)))), (F (NOT (OR p1 p0 p3))), (F (NOT (AND p1 p3))), (F (NOT (OR p1 (NOT p2) (NOT p0) p3))), (F (NOT (OR p2 p0 p3))), (F (NOT (OR p2 (NOT p0)))), (F (NOT (OR p2 (NOT p0) p3))), (F (NOT (AND (OR p1 (NOT p0) p3) (OR (NOT p2) (NOT p0) p3))))]
Knowledge based reduction with 20 factoid took 1886 ms. Reduced automaton from 25 states, 114 edges and 4 AP (stutter sensitive) to 22 states, 80 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 1089 ms :[(OR (NOT p1) (NOT p2) (NOT p0)), (OR (NOT p1) (NOT p2) (NOT p0)), (OR (NOT p1) (AND (NOT p2) p3)), true, (NOT p2), (NOT p2), (NOT p2), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p2) p3)), (OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p2) p3)), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2)) (AND (NOT p2) p3)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p2) p3)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2)) (AND (NOT p2) p3)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2)) (AND (NOT p2) p3)), (NOT p2), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2)) (AND (NOT p2) p3))]
Stuttering acceptance computed with spot in 1037 ms :[(OR (NOT p1) (NOT p2) (NOT p0)), (OR (NOT p1) (NOT p2) (NOT p0)), (OR (NOT p1) (AND (NOT p2) p3)), true, (NOT p2), (NOT p2), (NOT p2), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p2) p3)), (OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p2) p3)), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2)) (AND (NOT p2) p3)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p2) p3)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2)) (AND (NOT p2) p3)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2)) (AND (NOT p2) p3)), (NOT p2), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2)) (AND (NOT p2) p3))]
Support contains 63 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 63/63 transitions.
Applied a total of 0 rules in 1 ms. Remains 63 /63 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2025-05-30 21:32:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 21:32:56] [INFO ] Implicit Places using invariants in 27 ms returned []
[2025-05-30 21:32:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 21:32:56] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-05-30 21:32:56] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
Running 60 sub problems to find dead transitions.
[2025-05-30 21:32:56] [INFO ] Invariant cache hit.
[2025-05-30 21:32:56] [INFO ] State equation strengthened by 20 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 2/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 63/125 variables, 62/63 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 1/126 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (OVERLAPS) 0/126 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 126/126 variables, and 84 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1604 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 2/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 63/125 variables, 62/63 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 59/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 1/126 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/126 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/126 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (OVERLAPS) 0/126 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 126/126 variables, and 144 constraints, problems are : Problem set: 0 solved, 60 unsolved in 2847 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4457ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 4457ms
Finished structural reductions in LTL mode , in 1 iterations and 4535 ms. Remains : 63/63 places, 63/63 transitions.
Computed a total of 41 stabilizing places and 41 stable transitions
Graph (complete) has 165 edges and 63 vertex of which 22 are kept as prefixes of interest. Removing 41 places using SCC suffix rule.1 ms
Computed a total of 41 stabilizing places and 41 stable transitions
Knowledge obtained : [(AND p1 p2 p3 p0), (X (X (AND p1 p0))), (X (X p0)), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 393 ms. Reduced automaton from 22 states, 80 edges and 4 AP (stutter sensitive) to 22 states, 80 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 971 ms :[(OR (NOT p1) (NOT p2) (NOT p0)), (OR (NOT p1) (NOT p2) (NOT p0)), (OR (NOT p1) (AND (NOT p2) p3)), true, (NOT p2), (NOT p2), (NOT p2), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p2) p3)), (OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p2) p3)), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2)) (AND (NOT p2) p3)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p2) p3)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2)) (AND (NOT p2) p3)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2)) (AND (NOT p2) p3)), (NOT p2), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2)) (AND (NOT p2) p3))]
RANDOM walk for 40256 steps (8 resets) in 42 ms. (936 steps per ms) remains 11/23 properties
BEST_FIRST walk for 40003 steps (8 resets) in 126 ms. (314 steps per ms) remains 6/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 110 ms. (360 steps per ms) remains 2/6 properties
BEST_FIRST walk for 1584 steps (0 resets) in 7 ms. (198 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p1 p2 p3 p0), (X (X (AND p1 p0))), (X (X p0)), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR p2 (NOT p0) p3))), (F (NOT (OR p2 p0 p3))), (F (NOT p2)), (F (NOT (OR (NOT p0) p3))), (F (NOT (AND p1 p0 p3))), (F (NOT (OR p1 (NOT p2) (NOT p0) p3))), (F (NOT (AND (OR (NOT p1) (NOT p2) p3) (OR (NOT p1) p0 p3)))), (F (NOT (OR p2 (NOT p0)))), (F (NOT (OR p1 (NOT p0)))), (F (NOT (OR p1 (NOT p0) p3))), (F (NOT p1)), (F (NOT (OR (NOT p1) (NOT p0) p3))), (F (NOT (OR p2 p0))), (F (NOT (OR p1 p3))), (F (NOT p3)), (F (NOT (OR (NOT p2) p3))), (F (NOT (OR p1 (NOT p2) (NOT p0)))), (F (NOT (OR p2 p3))), (F (NOT (OR (NOT p1) p3))), (F (NOT (AND p1 p0))), (F (NOT (AND p1 p3))), (F (NOT (OR p0 p3)))]
Knowledge based reduction with 5 factoid took 1286 ms. Reduced automaton from 22 states, 80 edges and 4 AP (stutter sensitive) to 22 states, 80 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 1017 ms :[(OR (NOT p1) (NOT p2) (NOT p0)), (OR (NOT p1) (NOT p2) (NOT p0)), (OR (NOT p1) (AND (NOT p2) p3)), true, (NOT p2), (NOT p2), (NOT p2), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p2) p3)), (OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p2) p3)), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2)) (AND (NOT p2) p3)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p2) p3)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2)) (AND (NOT p2) p3)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2)) (AND (NOT p2) p3)), (NOT p2), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2)) (AND (NOT p2) p3))]
Stuttering acceptance computed with spot in 1037 ms :[(OR (NOT p1) (NOT p2) (NOT p0)), (OR (NOT p1) (NOT p2) (NOT p0)), (OR (NOT p1) (AND (NOT p2) p3)), true, (NOT p2), (NOT p2), (NOT p2), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p2) p3)), (OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p2) p3)), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2)) (AND (NOT p2) p3)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p2) p3)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2)) (AND (NOT p2) p3)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2)) (AND (NOT p2) p3)), (NOT p2), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2)) (AND (NOT p2) p3))]
Stuttering acceptance computed with spot in 970 ms :[(OR (NOT p1) (NOT p2) (NOT p0)), (OR (NOT p1) (NOT p2) (NOT p0)), (OR (NOT p1) (AND (NOT p2) p3)), true, (NOT p2), (NOT p2), (NOT p2), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p2) p3)), (OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p2) p3)), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2)) (AND (NOT p2) p3)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p2) p3)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2)) (AND (NOT p2) p3)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2)) (AND (NOT p2) p3)), (NOT p2), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2)) (AND (NOT p2) p3))]
Product exploration explored 100000 steps with 5 reset in 535 ms.
Product exploration explored 100000 steps with 23 reset in 644 ms.
Applying partial POR strategy [false, false, false, true, true, false, false, false, false, true, false, false, false, true, false, false, false, true, false, false, false, false, true, true, true, true]
Stuttering acceptance computed with spot in 1258 ms :[(OR (NOT p1) (NOT p2) (NOT p0)), (OR (NOT p1) (NOT p2) (NOT p0)), (OR (NOT p1) (AND (NOT p2) p3)), true, (NOT p2), (NOT p2), (NOT p2), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p2) p3)), (OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p2) p3)), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2)) (AND (NOT p2) p3)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p2) p3)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2)) (AND (NOT p2) p3)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2)) (AND (NOT p2) p3)), (NOT p2), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2)) (AND (NOT p2) p3)), (OR (NOT p1) (AND (NOT p2) p3)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p2) p3)), (NOT p2), (NOT p2)]
Support contains 63 out of 63 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 63/63 transitions.
Applied a total of 0 rules in 11 ms. Remains 63 /63 variables (removed 0) and now considering 63/63 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 21:33:09] [INFO ] Redundant transitions in 1 ms returned []
Running 60 sub problems to find dead transitions.
[2025-05-30 21:33:09] [INFO ] Invariant cache hit.
[2025-05-30 21:33:09] [INFO ] State equation strengthened by 20 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 2/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 63/125 variables, 62/63 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 1/126 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (OVERLAPS) 0/126 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 126/126 variables, and 84 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1644 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 2/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 63/125 variables, 62/63 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 59/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 1/126 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/126 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/126 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (OVERLAPS) 0/126 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 126/126 variables, and 144 constraints, problems are : Problem set: 0 solved, 60 unsolved in 2833 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4490ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 4490ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 4508 ms. Remains : 63/63 places, 63/63 transitions.
Built C files in :
/tmp/ltsmin2708126763837325333
[2025-05-30 21:33:14] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2708126763837325333
Running compilation step : cd /tmp/ltsmin2708126763837325333;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 262 ms.
Running link step : cd /tmp/ltsmin2708126763837325333;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin2708126763837325333;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased7804570593129397770.hoa' '--buchi-type=spotba'
LTSmin run took 557 ms.
FORMULA CryptoMiner-PT-D20N100-LTLCardinality-00 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property CryptoMiner-PT-D20N100-LTLCardinality-00 finished in 32709 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&(p1||X(p2))))))'
Support contains 63 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 63/63 transitions.
Applied a total of 0 rules in 2 ms. Remains 63 /63 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2025-05-30 21:33:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 21:33:15] [INFO ] Implicit Places using invariants in 26 ms returned []
[2025-05-30 21:33:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 21:33:15] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-05-30 21:33:15] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
Running 60 sub problems to find dead transitions.
[2025-05-30 21:33:15] [INFO ] Invariant cache hit.
[2025-05-30 21:33:15] [INFO ] State equation strengthened by 20 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 2/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 63/125 variables, 62/63 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 1/126 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (OVERLAPS) 0/126 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 126/126 variables, and 84 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1608 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 2/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 63/125 variables, 62/63 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 59/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 1/126 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/126 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/126 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (OVERLAPS) 0/126 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 126/126 variables, and 144 constraints, problems are : Problem set: 0 solved, 60 unsolved in 2781 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4394ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 4395ms
Finished structural reductions in LTL mode , in 1 iterations and 4464 ms. Remains : 63/63 places, 63/63 transitions.
Stuttering acceptance computed with spot in 135 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : CryptoMiner-PT-D20N100-LTLCardinality-01
Product exploration explored 100000 steps with 42880 reset in 124 ms.
Product exploration explored 100000 steps with 42834 reset in 124 ms.
Computed a total of 41 stabilizing places and 41 stable transitions
Graph (complete) has 165 edges and 63 vertex of which 22 are kept as prefixes of interest. Removing 41 places using SCC suffix rule.1 ms
Computed a total of 41 stabilizing places and 41 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X p0), (X (X p2)), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (NOT p1)), (X (X (NOT p0))), (X (X p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 79 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CryptoMiner-PT-D20N100-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CryptoMiner-PT-D20N100-LTLCardinality-01 finished in 4949 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0) U X(p1))))'
Support contains 63 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 63/63 transitions.
Applied a total of 0 rules in 2 ms. Remains 63 /63 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2025-05-30 21:33:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 21:33:20] [INFO ] Implicit Places using invariants in 21 ms returned []
[2025-05-30 21:33:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 21:33:20] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-05-30 21:33:20] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
Running 60 sub problems to find dead transitions.
[2025-05-30 21:33:20] [INFO ] Invariant cache hit.
[2025-05-30 21:33:20] [INFO ] State equation strengthened by 20 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 2/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 63/125 variables, 62/63 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 1/126 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (OVERLAPS) 0/126 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 126/126 variables, and 84 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1674 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 2/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 63/125 variables, 62/63 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 59/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 1/126 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/126 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/126 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (OVERLAPS) 0/126 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 126/126 variables, and 144 constraints, problems are : Problem set: 0 solved, 60 unsolved in 2797 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4477ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 4477ms
Finished structural reductions in LTL mode , in 1 iterations and 4542 ms. Remains : 63/63 places, 63/63 transitions.
Stuttering acceptance computed with spot in 154 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : CryptoMiner-PT-D20N100-LTLCardinality-02
Product exploration explored 100000 steps with 1313 reset in 209 ms.
Product exploration explored 100000 steps with 1341 reset in 225 ms.
Computed a total of 41 stabilizing places and 41 stable transitions
Graph (complete) has 165 edges and 63 vertex of which 22 are kept as prefixes of interest. Removing 41 places using SCC suffix rule.2 ms
Computed a total of 41 stabilizing places and 41 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 5 factoid took 198 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 143 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Reduction of identical properties reduced properties to check from 3 to 2
RANDOM walk for 27040 steps (6 resets) in 10 ms. (2458 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR p1 p0))), (F p1), (F (NOT p0))]
Knowledge based reduction with 5 factoid took 283 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 146 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 164 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
[2025-05-30 21:33:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-30 21:33:26] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned unsat
Proved EG (NOT p1)
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR p1 p0))), (F p1), (F (NOT p0)), (G (NOT p1))]
Property proved to be false thanks to negative knowledge :(G (NOT p1))
Knowledge based reduction with 5 factoid took 317 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CryptoMiner-PT-D20N100-LTLCardinality-02 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CryptoMiner-PT-D20N100-LTLCardinality-02 finished in 6514 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||(F(p0)&&X(X(F(!p1)))))))'
Support contains 63 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 63/63 transitions.
Applied a total of 0 rules in 1 ms. Remains 63 /63 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2025-05-30 21:33:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 21:33:26] [INFO ] Implicit Places using invariants in 27 ms returned []
[2025-05-30 21:33:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 21:33:26] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-05-30 21:33:26] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
Running 60 sub problems to find dead transitions.
[2025-05-30 21:33:26] [INFO ] Invariant cache hit.
[2025-05-30 21:33:26] [INFO ] State equation strengthened by 20 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 2/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 63/125 variables, 62/63 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 1/126 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (OVERLAPS) 0/126 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 126/126 variables, and 84 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1628 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 2/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 63/125 variables, 62/63 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 59/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 1/126 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/126 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/126 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (OVERLAPS) 0/126 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 126/126 variables, and 144 constraints, problems are : Problem set: 0 solved, 60 unsolved in 2863 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4497ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 4498ms
Finished structural reductions in LTL mode , in 1 iterations and 4567 ms. Remains : 63/63 places, 63/63 transitions.
Stuttering acceptance computed with spot in 270 ms :[(NOT p0), (NOT p0), (NOT p0), p1, (AND p1 (NOT p0)), p1, (AND p1 (NOT p0))]
Running random walk in product with property : CryptoMiner-PT-D20N100-LTLCardinality-03
Product exploration explored 100000 steps with 0 reset in 278 ms.
Product exploration explored 100000 steps with 0 reset in 370 ms.
Computed a total of 41 stabilizing places and 41 stable transitions
Graph (complete) has 165 edges and 63 vertex of which 22 are kept as prefixes of interest. Removing 41 places using SCC suffix rule.1 ms
Computed a total of 41 stabilizing places and 41 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 74 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 167 ms :[p1, (AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
RANDOM walk for 40278 steps (9 resets) in 19 ms. (2013 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 84 ms. (470 steps per ms) remains 1/1 properties
[2025-05-30 21:33:32] [INFO ] Invariant cache hit.
[2025-05-30 21:33:32] [INFO ] State equation strengthened by 20 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf0 is UNSAT
After SMT solving in domain Real declared 126/126 variables, and 64 constraints, problems are : Problem set: 1 solved, 0 unsolved in 38 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 43ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0)), (G (OR p0 (NOT p1)))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (NOT (AND p0 p1)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 11 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CryptoMiner-PT-D20N100-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CryptoMiner-PT-D20N100-LTLCardinality-03 finished in 5867 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(!p0)))'
Support contains 42 out of 63 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 63/63 transitions.
Applied a total of 0 rules in 15 ms. Remains 63 /63 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2025-05-30 21:33:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 21:33:32] [INFO ] Implicit Places using invariants in 33 ms returned []
[2025-05-30 21:33:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 21:33:32] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-05-30 21:33:32] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 21:33:32] [INFO ] Redundant transitions in 0 ms returned []
Running 60 sub problems to find dead transitions.
[2025-05-30 21:33:32] [INFO ] Invariant cache hit.
[2025-05-30 21:33:32] [INFO ] State equation strengthened by 20 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 2/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 63/125 variables, 62/63 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 1/126 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (OVERLAPS) 0/126 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 126/126 variables, and 84 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1659 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 2/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 63/125 variables, 62/63 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 59/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 1/126 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/126 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/126 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (OVERLAPS) 0/126 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 126/126 variables, and 144 constraints, problems are : Problem set: 0 solved, 60 unsolved in 2764 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4430ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 4431ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 4525 ms. Remains : 63/63 places, 63/63 transitions.
Stuttering acceptance computed with spot in 74 ms :[p0, p0]
Running random walk in product with property : CryptoMiner-PT-D20N100-LTLCardinality-04
Product exploration explored 100000 steps with 0 reset in 189 ms.
Product exploration explored 100000 steps with 0 reset in 285 ms.
Computed a total of 41 stabilizing places and 41 stable transitions
Graph (complete) has 165 edges and 63 vertex of which 22 are kept as prefixes of interest. Removing 41 places using SCC suffix rule.1 ms
Computed a total of 41 stabilizing places and 41 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 78 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[p0, p0]
RANDOM walk for 17078 steps (4 resets) in 13 ms. (1219 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 95 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[p0, p0]
Stuttering acceptance computed with spot in 75 ms :[p0, p0]
[2025-05-30 21:33:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
Proved EG p0
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (G p0)]
Property proved to be false thanks to negative knowledge :(G p0)
Knowledge based reduction with 3 factoid took 136 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CryptoMiner-PT-D20N100-LTLCardinality-04 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CryptoMiner-PT-D20N100-LTLCardinality-04 finished in 5729 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U G(p1)))'
Support contains 42 out of 63 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 63/63 transitions.
Graph (trivial) has 21 edges and 63 vertex of which 21 / 63 are part of one of the 1 SCC in 3 ms
Free SCC test removed 20 places
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Applied a total of 1 rules in 15 ms. Remains 43 /63 variables (removed 20) and now considering 43/63 (removed 20) transitions.
// Phase 1: matrix 43 rows 43 cols
[2025-05-30 21:33:38] [INFO ] Computed 1 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 21:33:38] [INFO ] Implicit Places using invariants in 25 ms returned []
[2025-05-30 21:33:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 21:33:38] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-05-30 21:33:38] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 21:33:38] [INFO ] Redundant transitions in 1 ms returned []
Running 40 sub problems to find dead transitions.
[2025-05-30 21:33:38] [INFO ] Invariant cache hit.
[2025-05-30 21:33:38] [INFO ] State equation strengthened by 20 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (OVERLAPS) 1/42 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (OVERLAPS) 42/84 variables, 42/43 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 20/63 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (OVERLAPS) 1/85 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/85 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 8 (OVERLAPS) 0/85 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Real declared 85/86 variables, and 64 constraints, problems are : Problem set: 0 solved, 40 unsolved in 777 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 43/43 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 40 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (OVERLAPS) 1/42 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (OVERLAPS) 42/84 variables, 42/43 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 20/63 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/84 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (OVERLAPS) 1/85 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/85 variables, 20/104 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/85 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 10 (OVERLAPS) 0/85 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Int declared 85/86 variables, and 104 constraints, problems are : Problem set: 0 solved, 40 unsolved in 1338 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 43/43 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2122ms problems are : Problem set: 0 solved, 40 unsolved
Search for dead transitions found 0 dead transitions in 2123ms
Starting structural reductions in SI_LTL mode, iteration 1 : 43/63 places, 43/63 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2209 ms. Remains : 43/63 places, 43/63 transitions.
Stuttering acceptance computed with spot in 97 ms :[(NOT p1), true, (NOT p1)]
Running random walk in product with property : CryptoMiner-PT-D20N100-LTLCardinality-05
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA CryptoMiner-PT-D20N100-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-PT-D20N100-LTLCardinality-05 finished in 2326 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X(X(!p1)))))'
Support contains 63 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 63/63 transitions.
Applied a total of 0 rules in 1 ms. Remains 63 /63 variables (removed 0) and now considering 63/63 (removed 0) transitions.
// Phase 1: matrix 63 rows 63 cols
[2025-05-30 21:33:40] [INFO ] Computed 1 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 21:33:40] [INFO ] Implicit Places using invariants in 24 ms returned []
[2025-05-30 21:33:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 21:33:40] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-05-30 21:33:40] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
Running 60 sub problems to find dead transitions.
[2025-05-30 21:33:40] [INFO ] Invariant cache hit.
[2025-05-30 21:33:40] [INFO ] State equation strengthened by 20 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 2/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 63/125 variables, 62/63 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 1/126 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (OVERLAPS) 0/126 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 126/126 variables, and 84 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1570 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 2/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 63/125 variables, 62/63 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 59/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 1/126 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/126 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/126 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (OVERLAPS) 0/126 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 126/126 variables, and 144 constraints, problems are : Problem set: 0 solved, 60 unsolved in 2741 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4317ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 4317ms
Finished structural reductions in LTL mode , in 1 iterations and 4380 ms. Remains : 63/63 places, 63/63 transitions.
Stuttering acceptance computed with spot in 129 ms :[(AND (NOT p0) p1), p1, p1, true]
Running random walk in product with property : CryptoMiner-PT-D20N100-LTLCardinality-06
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA CryptoMiner-PT-D20N100-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-PT-D20N100-LTLCardinality-06 finished in 4519 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 63/63 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 62 transition count 63
Applied a total of 1 rules in 10 ms. Remains 62 /63 variables (removed 1) and now considering 63/63 (removed 0) transitions.
// Phase 1: matrix 63 rows 62 cols
[2025-05-30 21:33:45] [INFO ] Computed 0 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 21:33:45] [INFO ] Implicit Places using invariants in 34 ms returned []
[2025-05-30 21:33:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 21:33:45] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-05-30 21:33:45] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
Running 60 sub problems to find dead transitions.
[2025-05-30 21:33:45] [INFO ] Invariant cache hit.
[2025-05-30 21:33:45] [INFO ] State equation strengthened by 20 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 63/123 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 2/125 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 0/125 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 125/125 variables, and 82 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1875 ms.
Refiners :[State Equation: 62/62 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 63/123 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 57/137 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (OVERLAPS) 2/125 variables, 2/139 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 3/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (OVERLAPS) 0/125 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 125/125 variables, and 142 constraints, problems are : Problem set: 0 solved, 60 unsolved in 2039 ms.
Refiners :[State Equation: 62/62 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3919ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 3920ms
Starting structural reductions in LTL mode, iteration 1 : 62/63 places, 63/63 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4029 ms. Remains : 62/63 places, 63/63 transitions.
Stuttering acceptance computed with spot in 79 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CryptoMiner-PT-D20N100-LTLCardinality-08
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CryptoMiner-PT-D20N100-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-PT-D20N100-LTLCardinality-08 finished in 4123 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F((F(p0)&&X(G(p1))))&&X(X(F(p2))))||G((F(p0)&&F(G(p1))))))'
Support contains 5 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 63/63 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 62 transition count 63
Applied a total of 1 rules in 3 ms. Remains 62 /63 variables (removed 1) and now considering 63/63 (removed 0) transitions.
[2025-05-30 21:33:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 21:33:49] [INFO ] Implicit Places using invariants in 25 ms returned []
[2025-05-30 21:33:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 21:33:49] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-05-30 21:33:49] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
Running 60 sub problems to find dead transitions.
[2025-05-30 21:33:49] [INFO ] Invariant cache hit.
[2025-05-30 21:33:49] [INFO ] State equation strengthened by 20 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 63/123 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 2/125 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 0/125 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 125/125 variables, and 82 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1790 ms.
Refiners :[State Equation: 62/62 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 63/123 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 57/137 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (OVERLAPS) 2/125 variables, 2/139 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 3/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (OVERLAPS) 0/125 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 125/125 variables, and 142 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1978 ms.
Refiners :[State Equation: 62/62 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3773ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 3774ms
Starting structural reductions in LTL mode, iteration 1 : 62/63 places, 63/63 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3873 ms. Remains : 62/63 places, 63/63 transitions.
Stuttering acceptance computed with spot in 295 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : CryptoMiner-PT-D20N100-LTLCardinality-09
Product exploration explored 100000 steps with 0 reset in 146 ms.
Product exploration explored 100000 steps with 0 reset in 189 ms.
Computed a total of 40 stabilizing places and 41 stable transitions
Graph (complete) has 162 edges and 62 vertex of which 22 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.1 ms
Computed a total of 40 stabilizing places and 41 stable transitions
Detected a total of 40/62 stabilizing places and 41/63 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 8 factoid took 383 ms. Reduced automaton from 8 states, 19 edges and 3 AP (stutter sensitive) to 8 states, 17 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 228 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2))]
RANDOM walk for 40295 steps (9 resets) in 18 ms. (2120 steps per ms) remains 3/7 properties
BEST_FIRST walk for 40002 steps (8 resets) in 55 ms. (714 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 24 ms. (1600 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 59 ms. (666 steps per ms) remains 3/3 properties
[2025-05-30 21:33:54] [INFO ] Invariant cache hit.
[2025-05-30 21:33:54] [INFO ] State equation strengthened by 20 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 8/12 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 21/33 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/33 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 19/52 variables, 9/26 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/52 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/52 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 20/72 variables, 10/38 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/72 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/72 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 16/88 variables, 9/49 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/88 variables, 3/52 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/88 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 11/99 variables, 6/58 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/99 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/99 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 8/107 variables, 5/64 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/107 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/107 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 2/109 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/109 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/109 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (OVERLAPS) 2/111 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/111 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/111 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (OVERLAPS) 2/113 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/113 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/113 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 31 (OVERLAPS) 2/115 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/115 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/115 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 34 (OVERLAPS) 2/117 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/117 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/117 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 37 (OVERLAPS) 2/119 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/119 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/119 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 40 (OVERLAPS) 2/121 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/121 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/121 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 43 (OVERLAPS) 2/123 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/123 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/123 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 46 (OVERLAPS) 2/125 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/125 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 48 (OVERLAPS) 0/125 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 125/125 variables, and 82 constraints, problems are : Problem set: 0 solved, 3 unsolved in 202 ms.
Refiners :[State Equation: 62/62 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 8/12 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 21/33 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/33 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 19/52 variables, 9/26 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/52 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/52 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 20/72 variables, 10/38 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/72 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/72 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 16/88 variables, 9/49 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/88 variables, 3/52 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/88 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 11/99 variables, 6/58 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/99 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/99 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 8/107 variables, 5/64 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/107 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/107 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 2/109 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/109 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/109 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (OVERLAPS) 2/111 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/111 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/111 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (OVERLAPS) 2/113 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/113 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/113 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 31 (OVERLAPS) 2/115 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/115 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/115 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 34 (OVERLAPS) 2/117 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/117 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/117 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 37 (OVERLAPS) 2/119 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/119 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/119 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 40 (OVERLAPS) 2/121 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/121 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/121 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 43 (OVERLAPS) 2/123 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/123 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/123 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/123 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 47 (OVERLAPS) 2/125 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/125 variables, 2/85 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/125 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 50 (OVERLAPS) 0/125 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 125/125 variables, and 85 constraints, problems are : Problem set: 0 solved, 3 unsolved in 359 ms.
Refiners :[State Equation: 62/62 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 563ms problems are : Problem set: 0 solved, 3 unsolved
Finished Parikh walk after 1752 steps, including 2 resets, run visited all 1 properties in 3 ms. (steps per millisecond=584 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 3 properties in 67 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p1)), (X (X (NOT p1))), (F (NOT (AND (NOT p0) (NOT p2)))), (F p0), (F p1), (F (NOT (AND (NOT p1) (NOT p2)))), (F p2), (F (NOT (OR (NOT p1) p2))), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 8 factoid took 714 ms. Reduced automaton from 8 states, 17 edges and 3 AP (stutter sensitive) to 8 states, 17 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 299 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 260 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2))]
[2025-05-30 21:33:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-30 21:33:56] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2025-05-30 21:33:56] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-30 21:33:56] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2025-05-30 21:33:56] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-05-30 21:33:56] [INFO ] [Nat]Added 20 Read/Feed constraints in 20 ms returned sat
[2025-05-30 21:33:56] [INFO ] Computed and/alt/rep : 60/100/60 causal constraints (skipped 0 transitions) in 7 ms.
[2025-05-30 21:33:56] [INFO ] Added : 53 causal constraints over 11 iterations in 140 ms. Result :sat
Could not prove EG (NOT p1)
[2025-05-30 21:33:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-30 21:33:56] [INFO ] [Real]Absence check using state equation in 81 ms returned sat
[2025-05-30 21:33:56] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-30 21:33:56] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2025-05-30 21:33:56] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-05-30 21:33:56] [INFO ] [Nat]Added 20 Read/Feed constraints in 6 ms returned unsat
Proved EG (NOT p0)
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p1)), (X (X (NOT p1))), (F (NOT (AND (NOT p0) (NOT p2)))), (F p0), (F p1), (F (NOT (AND (NOT p1) (NOT p2)))), (F p2), (F (NOT (OR (NOT p1) p2))), (F (NOT (AND (NOT p1) (NOT p0)))), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 8 factoid took 714 ms. Reduced automaton from 8 states, 17 edges and 3 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CryptoMiner-PT-D20N100-LTLCardinality-09 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CryptoMiner-PT-D20N100-LTLCardinality-09 finished in 8439 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0&&F(G(p1))))))'
Support contains 3 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 63/63 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 62 transition count 63
Applied a total of 1 rules in 3 ms. Remains 62 /63 variables (removed 1) and now considering 63/63 (removed 0) transitions.
[2025-05-30 21:33:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 21:33:57] [INFO ] Implicit Places using invariants in 28 ms returned []
[2025-05-30 21:33:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 21:33:57] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-05-30 21:33:57] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
Running 60 sub problems to find dead transitions.
[2025-05-30 21:33:57] [INFO ] Invariant cache hit.
[2025-05-30 21:33:57] [INFO ] State equation strengthened by 20 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 63/123 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 2/125 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 0/125 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 125/125 variables, and 82 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1845 ms.
Refiners :[State Equation: 62/62 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 63/123 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 57/137 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (OVERLAPS) 2/125 variables, 2/139 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 3/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (OVERLAPS) 0/125 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 125/125 variables, and 142 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1978 ms.
Refiners :[State Equation: 62/62 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3828ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 3828ms
Starting structural reductions in LTL mode, iteration 1 : 62/63 places, 63/63 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3954 ms. Remains : 62/63 places, 63/63 transitions.
Stuttering acceptance computed with spot in 130 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : CryptoMiner-PT-D20N100-LTLCardinality-11
Product exploration explored 100000 steps with 0 reset in 141 ms.
Product exploration explored 100000 steps with 0 reset in 230 ms.
Computed a total of 40 stabilizing places and 41 stable transitions
Graph (complete) has 162 edges and 62 vertex of which 22 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.1 ms
Computed a total of 40 stabilizing places and 41 stable transitions
Detected a total of 40/62 stabilizing places and 41/63 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X p0), (X (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 107 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(OR (NOT p0) (NOT p1)), true, (NOT p1)]
RANDOM walk for 8260 steps (4 resets) in 6 ms. (1180 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X p0), (X (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p1)))), (F p1), (F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 8 factoid took 214 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CryptoMiner-PT-D20N100-LTLCardinality-11 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CryptoMiner-PT-D20N100-LTLCardinality-11 finished in 4873 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U p1)||F(G(p1)))))'
Support contains 2 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 63/63 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 62 transition count 63
Applied a total of 1 rules in 4 ms. Remains 62 /63 variables (removed 1) and now considering 63/63 (removed 0) transitions.
[2025-05-30 21:34:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 21:34:02] [INFO ] Implicit Places using invariants in 31 ms returned []
[2025-05-30 21:34:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 21:34:02] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-05-30 21:34:02] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
Running 60 sub problems to find dead transitions.
[2025-05-30 21:34:02] [INFO ] Invariant cache hit.
[2025-05-30 21:34:02] [INFO ] State equation strengthened by 20 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 63/123 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 2/125 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 0/125 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 125/125 variables, and 82 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1881 ms.
Refiners :[State Equation: 62/62 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 63/123 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 57/137 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (OVERLAPS) 2/125 variables, 2/139 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 3/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (OVERLAPS) 0/125 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 125/125 variables, and 142 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1920 ms.
Refiners :[State Equation: 62/62 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3814ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 3814ms
Starting structural reductions in LTL mode, iteration 1 : 62/63 places, 63/63 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3911 ms. Remains : 62/63 places, 63/63 transitions.
Stuttering acceptance computed with spot in 92 ms :[(NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : CryptoMiner-PT-D20N100-LTLCardinality-12
Product exploration explored 100000 steps with 0 reset in 150 ms.
Product exploration explored 100000 steps with 0 reset in 227 ms.
Computed a total of 40 stabilizing places and 41 stable transitions
Graph (complete) has 162 edges and 62 vertex of which 22 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.1 ms
Computed a total of 40 stabilizing places and 41 stable transitions
Detected a total of 40/62 stabilizing places and 41/63 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 10 factoid took 135 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[(NOT p1)]
RANDOM walk for 40284 steps (9 resets) in 10 ms. (3662 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 45 ms. (869 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2794940 steps, run timeout after 3001 ms. (steps per millisecond=931 ) properties seen :0 out of 1
Probabilistic random walk after 2794940 steps, saw 1399030 distinct states, run finished after 3006 ms. (steps per millisecond=929 ) properties seen :0
[2025-05-30 21:34:10] [INFO ] Invariant cache hit.
[2025-05-30 21:34:10] [INFO ] State equation strengthened by 20 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/12 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 8/20 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/20 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 8/28 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/28 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 8/36 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/36 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 8/44 variables, 4/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/44 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 8/52 variables, 4/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/52 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 8/60 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/60 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 8/68 variables, 4/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/68 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 6/74 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/74 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 7/81 variables, 3/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/81 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 2/83 variables, 2/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/83 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 20/103 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/103 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 22/125 variables, 21/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/125 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/125 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 125/125 variables, and 82 constraints, problems are : Problem set: 0 solved, 1 unsolved in 124 ms.
Refiners :[State Equation: 62/62 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/12 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 8/20 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/20 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 8/28 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/28 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 8/36 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/36 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 8/44 variables, 4/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/44 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 8/52 variables, 4/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/52 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 8/60 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/60 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 8/68 variables, 4/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/68 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 6/74 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/74 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 7/81 variables, 3/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/81 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 2/83 variables, 2/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/83 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 20/103 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/103 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 22/125 variables, 21/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/125 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/125 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 0/125 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 125/125 variables, and 83 constraints, problems are : Problem set: 0 solved, 1 unsolved in 85 ms.
Refiners :[State Equation: 62/62 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 233ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 531 steps, including 2 resets, run visited all 1 properties in 2 ms. (steps per millisecond=265 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 10 factoid took 155 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 35 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p1)]
[2025-05-30 21:34:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
Proved EG (NOT p1)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p1), (G (NOT p1))]
Property proved to be false thanks to negative knowledge :(G (NOT p1))
Knowledge based reduction with 10 factoid took 181 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CryptoMiner-PT-D20N100-LTLCardinality-12 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CryptoMiner-PT-D20N100-LTLCardinality-12 finished in 8298 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(p0)))'
Support contains 1 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 63/63 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 62 transition count 63
Applied a total of 1 rules in 5 ms. Remains 62 /63 variables (removed 1) and now considering 63/63 (removed 0) transitions.
[2025-05-30 21:34:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 21:34:10] [INFO ] Implicit Places using invariants in 31 ms returned []
[2025-05-30 21:34:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 21:34:10] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-05-30 21:34:10] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
Running 60 sub problems to find dead transitions.
[2025-05-30 21:34:10] [INFO ] Invariant cache hit.
[2025-05-30 21:34:10] [INFO ] State equation strengthened by 20 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 63/123 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 2/125 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 0/125 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 125/125 variables, and 82 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1858 ms.
Refiners :[State Equation: 62/62 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 63/123 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 57/137 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (OVERLAPS) 2/125 variables, 2/139 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 3/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (OVERLAPS) 0/125 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 125/125 variables, and 142 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1968 ms.
Refiners :[State Equation: 62/62 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3833ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 3834ms
Starting structural reductions in LTL mode, iteration 1 : 62/63 places, 63/63 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3931 ms. Remains : 62/63 places, 63/63 transitions.
Stuttering acceptance computed with spot in 138 ms :[(NOT p0), true, (NOT p0), (NOT p0)]
Running random walk in product with property : CryptoMiner-PT-D20N100-LTLCardinality-13
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CryptoMiner-PT-D20N100-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-PT-D20N100-LTLCardinality-13 finished in 4086 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&X(F(p1)))))'
Support contains 4 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 63/63 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 62 transition count 63
Applied a total of 1 rules in 3 ms. Remains 62 /63 variables (removed 1) and now considering 63/63 (removed 0) transitions.
[2025-05-30 21:34:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 21:34:14] [INFO ] Implicit Places using invariants in 31 ms returned []
[2025-05-30 21:34:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 21:34:14] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-05-30 21:34:15] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
Running 60 sub problems to find dead transitions.
[2025-05-30 21:34:15] [INFO ] Invariant cache hit.
[2025-05-30 21:34:15] [INFO ] State equation strengthened by 20 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 63/123 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 2/125 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 0/125 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 125/125 variables, and 82 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1862 ms.
Refiners :[State Equation: 62/62 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 63/123 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 57/137 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (OVERLAPS) 2/125 variables, 2/139 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 3/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (OVERLAPS) 0/125 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 125/125 variables, and 142 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1978 ms.
Refiners :[State Equation: 62/62 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3846ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 3846ms
Starting structural reductions in LTL mode, iteration 1 : 62/63 places, 63/63 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3945 ms. Remains : 62/63 places, 63/63 transitions.
Stuttering acceptance computed with spot in 68 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : CryptoMiner-PT-D20N100-LTLCardinality-14
Product exploration explored 100000 steps with 31 reset in 134 ms.
Product exploration explored 100000 steps with 31 reset in 144 ms.
Computed a total of 40 stabilizing places and 41 stable transitions
Graph (complete) has 162 edges and 62 vertex of which 22 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.1 ms
Computed a total of 40 stabilizing places and 41 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X p0), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 117 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 54 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 405 steps (0 resets) in 4 ms. (81 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X p0), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p1)]
Knowledge based reduction with 4 factoid took 151 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 65 ms :[(NOT p1), (NOT p1)]
[2025-05-30 21:34:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-30 21:34:19] [INFO ] [Real]Absence check using state equation in 84 ms returned sat
[2025-05-30 21:34:19] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-30 21:34:19] [INFO ] [Nat]Absence check using state equation in 73 ms returned sat
[2025-05-30 21:34:19] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-05-30 21:34:19] [INFO ] [Nat]Added 20 Read/Feed constraints in 39 ms returned sat
[2025-05-30 21:34:19] [INFO ] Computed and/alt/rep : 60/100/60 causal constraints (skipped 0 transitions) in 5 ms.
[2025-05-30 21:34:20] [INFO ] Added : 47 causal constraints over 10 iterations in 139 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 2 out of 62 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 62/62 places, 63/63 transitions.
Applied a total of 0 rules in 4 ms. Remains 62 /62 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2025-05-30 21:34:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 21:34:20] [INFO ] Implicit Places using invariants in 30 ms returned []
[2025-05-30 21:34:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 21:34:20] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-05-30 21:34:20] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 21:34:20] [INFO ] Redundant transitions in 2 ms returned []
Running 60 sub problems to find dead transitions.
[2025-05-30 21:34:20] [INFO ] Invariant cache hit.
[2025-05-30 21:34:20] [INFO ] State equation strengthened by 20 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 63/123 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 2/125 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 0/125 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 125/125 variables, and 82 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1823 ms.
Refiners :[State Equation: 62/62 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 63/123 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 57/137 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (OVERLAPS) 2/125 variables, 2/139 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 3/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (OVERLAPS) 0/125 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 125/125 variables, and 142 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1990 ms.
Refiners :[State Equation: 62/62 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3824ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 3824ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 3930 ms. Remains : 62/62 places, 63/63 transitions.
Computed a total of 40 stabilizing places and 41 stable transitions
Graph (complete) has 162 edges and 62 vertex of which 22 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.2 ms
Computed a total of 40 stabilizing places and 41 stable transitions
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 59 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 54 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 409 steps (0 resets) in 5 ms. (68 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 3 factoid took 77 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 56 ms :[(NOT p1), (NOT p1)]
[2025-05-30 21:34:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-30 21:34:24] [INFO ] [Real]Absence check using state equation in 85 ms returned sat
[2025-05-30 21:34:24] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-30 21:34:24] [INFO ] [Nat]Absence check using state equation in 74 ms returned sat
[2025-05-30 21:34:24] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-05-30 21:34:24] [INFO ] [Nat]Added 20 Read/Feed constraints in 35 ms returned sat
[2025-05-30 21:34:24] [INFO ] Computed and/alt/rep : 60/100/60 causal constraints (skipped 0 transitions) in 4 ms.
[2025-05-30 21:34:24] [INFO ] Added : 47 causal constraints over 10 iterations in 144 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 71 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 28 reset in 143 ms.
Product exploration explored 100000 steps with 33 reset in 139 ms.
Built C files in :
/tmp/ltsmin2898280676265488255
[2025-05-30 21:34:25] [INFO ] Computing symmetric may disable matrix : 63 transitions.
[2025-05-30 21:34:25] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 21:34:25] [INFO ] Computing symmetric may enable matrix : 63 transitions.
[2025-05-30 21:34:25] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 21:34:25] [INFO ] Computing Do-Not-Accords matrix : 63 transitions.
[2025-05-30 21:34:25] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 21:34:25] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2898280676265488255
Running compilation step : cd /tmp/ltsmin2898280676265488255;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 146 ms.
Running link step : cd /tmp/ltsmin2898280676265488255;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin2898280676265488255;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16421152124535326209.hoa' '--buchi-type=spotba'
LTSmin run took 176 ms.
FORMULA CryptoMiner-PT-D20N100-LTLCardinality-14 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CryptoMiner-PT-D20N100-LTLCardinality-14 finished in 10640 ms.
All properties solved by simple procedures.
Total runtime 110386 ms.

BK_STOP 1748640865605

--------------------
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
++ 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.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /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="CryptoMiner-PT-D20N100"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is CryptoMiner-PT-D20N100, 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 r044-tall-174854028900683"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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