Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r044-tall-174854028900668.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-D10N000, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r044-tall-174854028900668
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 776K
-rw-r--r-- 1 mcc users 22K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 156K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.5K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 9.2K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 45K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.4K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 22K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 33K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 211K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 19K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 137K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.8K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.5K 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 9.2K 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-D10N000-LTLFireability-00
FORMULA_NAME CryptoMiner-PT-D10N000-LTLFireability-01
FORMULA_NAME CryptoMiner-PT-D10N000-LTLFireability-02
FORMULA_NAME CryptoMiner-PT-D10N000-LTLFireability-03
FORMULA_NAME CryptoMiner-PT-D10N000-LTLFireability-04
FORMULA_NAME CryptoMiner-PT-D10N000-LTLFireability-05
FORMULA_NAME CryptoMiner-PT-D10N000-LTLFireability-06
FORMULA_NAME CryptoMiner-PT-D10N000-LTLFireability-07
FORMULA_NAME CryptoMiner-PT-D10N000-LTLFireability-08
FORMULA_NAME CryptoMiner-PT-D10N000-LTLFireability-09
FORMULA_NAME CryptoMiner-PT-D10N000-LTLFireability-10
FORMULA_NAME CryptoMiner-PT-D10N000-LTLFireability-11
FORMULA_NAME CryptoMiner-PT-D10N000-LTLFireability-12
FORMULA_NAME CryptoMiner-PT-D10N000-LTLFireability-13
FORMULA_NAME CryptoMiner-PT-D10N000-LTLFireability-14
FORMULA_NAME CryptoMiner-PT-D10N000-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1748637144960

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CryptoMiner-PT-D10N000
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-05-30 20:32:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-05-30 20:32:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 20:32:26] [INFO ] Load time of PNML (sax parser for PT used): 30 ms
[2025-05-30 20:32:26] [INFO ] Transformed 22 places.
[2025-05-30 20:32:26] [INFO ] Transformed 22 transitions.
[2025-05-30 20:32:26] [INFO ] Parsed PT model containing 22 places and 22 transitions and 64 arcs in 113 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA CryptoMiner-PT-D10N000-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CryptoMiner-PT-D10N000-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CryptoMiner-PT-D10N000-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 11 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 22/22 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 21 transition count 22
Applied a total of 1 rules in 15 ms. Remains 21 /22 variables (removed 1) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 21 cols
[2025-05-30 20:32:26] [INFO ] Computed 0 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 20:32:26] [INFO ] Implicit Places using invariants in 130 ms returned []
[2025-05-30 20:32:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 20:32:26] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-05-30 20:32:26] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 225 ms to find 0 implicit places.
Running 20 sub problems to find dead transitions.
[2025-05-30 20:32:26] [INFO ] Invariant cache hit.
[2025-05-30 20:32:26] [INFO ] State equation strengthened by 10 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 22/42 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 10/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 1/43 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 0/43 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 43/43 variables, and 31 constraints, problems are : Problem set: 0 solved, 20 unsolved in 401 ms.
Refiners :[State Equation: 21/21 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 22/42 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 10/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 19/49 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 1/43 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/43 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/43 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 0/43 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 43/43 variables, and 51 constraints, problems are : Problem set: 0 solved, 20 unsolved in 388 ms.
Refiners :[State Equation: 21/21 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 808ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 816ms
Starting structural reductions in LTL mode, iteration 1 : 21/22 places, 22/22 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1068 ms. Remains : 21/22 places, 22/22 transitions.
Support contains 11 out of 21 places after structural reductions.
[2025-05-30 20:32:27] [INFO ] Flatten gal took : 13 ms
[2025-05-30 20:32:27] [INFO ] Flatten gal took : 4 ms
[2025-05-30 20:32:27] [INFO ] Input system was already deterministic with 22 transitions.
RANDOM walk for 40000 steps (2821 resets) in 733 ms. (54 steps per ms) remains 2/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 230 ms. (173 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 186 ms. (213 steps per ms) remains 2/2 properties
[2025-05-30 20:32:28] [INFO ] Invariant cache hit.
[2025-05-30 20:32:28] [INFO ] State equation strengthened by 10 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/7 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/11 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 4/15 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 4/19 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/19 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp7 is UNSAT
After SMT solving in domain Real declared 22/43 variables, and 11 constraints, problems are : Problem set: 2 solved, 0 unsolved in 44 ms.
Refiners :[State Equation: 11/21 constraints, ReadFeed: 0/10 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 48ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 2 atomic propositions for a total of 13 simplifications.
Computed a total of 11 stabilizing places and 11 stable transitions
FORMULA CryptoMiner-PT-D10N000-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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) U p2)) U X(p1)))'
Support contains 11 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2025-05-30 20:32:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 20:32:28] [INFO ] Implicit Places using invariants in 33 ms returned []
[2025-05-30 20:32:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 20:32:28] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-05-30 20:32:28] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
Running 20 sub problems to find dead transitions.
[2025-05-30 20:32:28] [INFO ] Invariant cache hit.
[2025-05-30 20:32:28] [INFO ] State equation strengthened by 10 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 22/42 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 10/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 1/43 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 0/43 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 43/43 variables, and 31 constraints, problems are : Problem set: 0 solved, 20 unsolved in 445 ms.
Refiners :[State Equation: 21/21 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 22/42 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 10/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 19/49 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 1/43 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/43 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/43 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 0/43 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 43/43 variables, and 51 constraints, problems are : Problem set: 0 solved, 20 unsolved in 369 ms.
Refiners :[State Equation: 21/21 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 843ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 843ms
Finished structural reductions in LTL mode , in 1 iterations and 958 ms. Remains : 21/21 places, 22/22 transitions.
Stuttering acceptance computed with spot in 616 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p1), true, (NOT p2), (NOT p1), (NOT p2)]
Running random walk in product with property : CryptoMiner-PT-D10N000-LTLFireability-00
Product exploration explored 100000 steps with 50000 reset in 244 ms.
Product exploration explored 100000 steps with 50000 reset in 129 ms.
Computed a total of 11 stabilizing places and 11 stable transitions
Computed a total of 11 stabilizing places and 11 stable transitions
Detected a total of 11/21 stabilizing places and 11/22 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND p2 (NOT p0) p1), (X p1), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT p0)), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (OR (AND p2 (NOT p1)) (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (OR (AND p2 (NOT p1)) (AND (NOT p1) p0))))), (X (X p1)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) p1 (NOT p0)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0)))))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 15 factoid took 27 ms. Reduced automaton from 8 states, 19 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CryptoMiner-PT-D10N000-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CryptoMiner-PT-D10N000-LTLFireability-00 finished in 2060 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&&F(!p1)) U !p1) U X(p1)))'
Support contains 2 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 22/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 21 /21 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2025-05-30 20:32:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 20:32:30] [INFO ] Implicit Places using invariants in 26 ms returned []
[2025-05-30 20:32:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 20:32:30] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-05-30 20:32:30] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
Running 20 sub problems to find dead transitions.
[2025-05-30 20:32:30] [INFO ] Invariant cache hit.
[2025-05-30 20:32:30] [INFO ] State equation strengthened by 10 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 22/42 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 10/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 1/43 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 0/43 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 43/43 variables, and 31 constraints, problems are : Problem set: 0 solved, 20 unsolved in 259 ms.
Refiners :[State Equation: 21/21 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 22/42 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 10/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 19/49 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 1/43 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/43 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/43 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 0/43 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 43/43 variables, and 51 constraints, problems are : Problem set: 0 solved, 20 unsolved in 279 ms.
Refiners :[State Equation: 21/21 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 542ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 543ms
Finished structural reductions in LTL mode , in 1 iterations and 621 ms. Remains : 21/21 places, 22/22 transitions.
Stuttering acceptance computed with spot in 124 ms :[(NOT p1), true, (NOT p1), (NOT p1)]
Running random walk in product with property : CryptoMiner-PT-D10N000-LTLFireability-02
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 1 ms.
FORMULA CryptoMiner-PT-D10N000-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-PT-D10N000-LTLFireability-02 finished in 775 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(G(((G(p0) U (p1&&F(G(p2)))) U X(X(!p1))))))'
Support contains 11 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2025-05-30 20:32:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 20:32:31] [INFO ] Implicit Places using invariants in 32 ms returned []
[2025-05-30 20:32:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 20:32:31] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-05-30 20:32:31] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
Running 20 sub problems to find dead transitions.
[2025-05-30 20:32:31] [INFO ] Invariant cache hit.
[2025-05-30 20:32:31] [INFO ] State equation strengthened by 10 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 22/42 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 10/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 1/43 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 0/43 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 43/43 variables, and 31 constraints, problems are : Problem set: 0 solved, 20 unsolved in 214 ms.
Refiners :[State Equation: 21/21 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 22/42 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 10/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 19/49 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 1/43 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/43 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/43 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 0/43 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 43/43 variables, and 51 constraints, problems are : Problem set: 0 solved, 20 unsolved in 280 ms.
Refiners :[State Equation: 21/21 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 499ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 500ms
Finished structural reductions in LTL mode , in 1 iterations and 574 ms. Remains : 21/21 places, 22/22 transitions.
Stuttering acceptance computed with spot in 1046 ms :[p1, p1, (AND (NOT p0) p1), (AND p1 (NOT p2)), p1, (AND (NOT p2) p1), (AND p1 (NOT p2) (NOT p0)), p1, p1, (AND (NOT p0) p1), (AND p1 (NOT p2)), p1, (AND p1 (NOT p2) (NOT p0)), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p2) p1), (AND (NOT p2) p1 (NOT p0)), (AND (NOT p0) p1), (AND (NOT p0) p1), false, false]
Running random walk in product with property : CryptoMiner-PT-D10N000-LTLFireability-03
Product exploration explored 100000 steps with 11637 reset in 258 ms.
Product exploration explored 100000 steps with 11730 reset in 170 ms.
Computed a total of 11 stabilizing places and 11 stable transitions
Computed a total of 11 stabilizing places and 11 stable transitions
Detected a total of 11/21 stabilizing places and 11/22 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND p1 p0 (NOT p2)), (X (NOT p2)), (X (OR p1 p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X p1), (X (X (NOT p2))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 p2)))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (AND p1 p0)), (X (NOT (AND p1 p0))), (X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT p0)), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 13 factoid took 3840 ms. Reduced automaton from 21 states, 92 edges and 3 AP (stutter sensitive) to 43 states, 214 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 2503 ms :[p1, p1, (AND (NOT p0) p1), p1, (AND p1 (NOT p2)), (AND p1 (NOT p2) (NOT p0)), p1, p1, (AND (NOT p0) p1), (AND p1 (NOT p2)), p1, false, (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), false, false, false, false, (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 p2), false, (AND p0 p1 (NOT p2)), false, (AND p0 p1 p2), false, false, false, false, false, false, false, false, false, false, (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 p2), (AND p0 p1 (NOT p2)), (AND p0 p1 p2), false, false, false, false]
Reduction of identical properties reduced properties to check from 20 to 18
RANDOM walk for 40000 steps (2808 resets) in 418 ms. (95 steps per ms) remains 6/18 properties
BEST_FIRST walk for 40004 steps (8 resets) in 155 ms. (256 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 98 ms. (404 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (2010 resets) in 191 ms. (208 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (2856 resets) in 242 ms. (164 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 87 ms. (454 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 111 ms. (357 steps per ms) remains 6/6 properties
[2025-05-30 20:32:40] [INFO ] Invariant cache hit.
[2025-05-30 20:32:40] [INFO ] State equation strengthened by 10 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem apf2 is UNSAT
Problem apf3 is UNSAT
Problem apf8 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 3 unsolved
Problem apf5 is UNSAT
Problem apf6 is UNSAT
Problem apf19 is UNSAT
After SMT solving in domain Real declared 22/43 variables, and 11 constraints, problems are : Problem set: 6 solved, 0 unsolved in 26 ms.
Refiners :[State Equation: 11/21 constraints, ReadFeed: 0/10 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 30ms problems are : Problem set: 6 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 6 invariant AP formulas.
Knowledge obtained : [(AND p1 p0 (NOT p2)), (X (NOT p2)), (X (OR p1 p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X p1), (X (X (NOT p2))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 p2)))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (G (OR (NOT p0) (NOT p2) p1)), (G (OR (NOT p0) p2 p1)), (G (OR p0 (NOT p2) (NOT p1))), (G (OR (NOT p2) (NOT p1))), (G (OR (NOT p0) (NOT p2) (NOT p1))), (G (OR (NOT p0) p1))]
False Knowledge obtained : [(X (AND p1 p0)), (X (NOT (AND p1 p0))), (X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT p0)), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (F (NOT (OR (NOT p2) p1))), (F (NOT (OR p2 p1))), (F (NOT (AND (NOT p2) p1))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR p0 (NOT p2) p1))), (F (NOT (OR p0 p2 (NOT p1)))), (F (NOT (AND p0 p1))), (F p2), (F (NOT p1)), (F (NOT p0)), (F (NOT (OR p0 p1))), (F (NOT (OR p0 p2 p1))), (F (NOT (AND p0 (NOT p2) p1))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 19 factoid took 3957 ms. Reduced automaton from 43 states, 214 edges and 3 AP (stutter insensitive) to 16 states, 66 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 776 ms :[(OR p1 p0), (OR p1 p0), (OR p1 p0), p1, (OR p1 p0), (AND p1 (NOT p2)), p1, (AND p1 p2), false, false, (AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) p1 p0), false, false, (AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) p1 p0)]
Stuttering acceptance computed with spot in 785 ms :[(OR p1 p0), (OR p1 p0), (OR p1 p0), p1, (OR p1 p0), (AND p1 (NOT p2)), p1, (AND p1 p2), false, false, (AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) p1 p0), false, false, (AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) p1 p0)]
[2025-05-30 20:32:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-30 20:32:45] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2025-05-30 20:32:45] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-05-30 20:32:45] [INFO ] [Real]Added 10 Read/Feed constraints in 3 ms returned sat
[2025-05-30 20:32:45] [INFO ] Computed and/alt/rep : 20/30/20 causal constraints (skipped 0 transitions) in 2 ms.
[2025-05-30 20:32:45] [INFO ] Added : 8 causal constraints over 2 iterations in 18 ms. Result :sat
Could not prove EG p1
[2025-05-30 20:32:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
Proved EG p0
Knowledge obtained : [(AND p1 p0 (NOT p2)), (X (NOT p2)), (X (OR p1 p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X p1), (X (X (NOT p2))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 p2)))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (G (OR (NOT p0) (NOT p2) p1)), (G (OR (NOT p0) p2 p1)), (G (OR p0 (NOT p2) (NOT p1))), (G (OR (NOT p2) (NOT p1))), (G (OR (NOT p0) (NOT p2) (NOT p1))), (G (OR (NOT p0) p1))]
False Knowledge obtained : [(X (AND p1 p0)), (X (NOT (AND p1 p0))), (X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT p0)), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (F (NOT (OR (NOT p2) p1))), (F (NOT (OR p2 p1))), (F (NOT (AND (NOT p2) p1))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR p0 (NOT p2) p1))), (F (NOT (OR p0 p2 (NOT p1)))), (F (NOT (AND p0 p1))), (F p2), (F (NOT p1)), (F (NOT p0)), (F (NOT (OR p0 p1))), (F (NOT (OR p0 p2 p1))), (F (NOT (AND p0 (NOT p2) p1))), (F (NOT (OR p0 p1))), (G p0)]
Property proved to be false thanks to negative knowledge :(G p0)
Knowledge based reduction with 19 factoid took 4079 ms. Reduced automaton from 16 states, 66 edges and 3 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CryptoMiner-PT-D10N000-LTLFireability-03 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CryptoMiner-PT-D10N000-LTLFireability-03 finished in 18696 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(X(F((!p0&&F(p1))))))'
Support contains 10 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 21 /21 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2025-05-30 20:32:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 20:32:50] [INFO ] Implicit Places using invariants in 30 ms returned []
[2025-05-30 20:32:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 20:32:50] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-05-30 20:32:50] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
Running 20 sub problems to find dead transitions.
[2025-05-30 20:32:50] [INFO ] Invariant cache hit.
[2025-05-30 20:32:50] [INFO ] State equation strengthened by 10 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 22/42 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 10/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 1/43 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 0/43 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 43/43 variables, and 31 constraints, problems are : Problem set: 0 solved, 20 unsolved in 216 ms.
Refiners :[State Equation: 21/21 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 22/42 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 10/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 19/49 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 1/43 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/43 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/43 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 0/43 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 43/43 variables, and 51 constraints, problems are : Problem set: 0 solved, 20 unsolved in 236 ms.
Refiners :[State Equation: 21/21 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 457ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 458ms
Finished structural reductions in LTL mode , in 1 iterations and 526 ms. Remains : 21/21 places, 22/22 transitions.
Stuttering acceptance computed with spot in 166 ms :[(NOT p1), (OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0)]
Running random walk in product with property : CryptoMiner-PT-D10N000-LTLFireability-06
Product exploration explored 100000 steps with 28610 reset in 51 ms.
Product exploration explored 100000 steps with 28573 reset in 53 ms.
Computed a total of 11 stabilizing places and 11 stable transitions
Computed a total of 11 stabilizing places and 11 stable transitions
Detected a total of 11/21 stabilizing places and 11/22 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 5 factoid took 240 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 150 ms :[(NOT p1), (OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0)]
RANDOM walk for 42 steps (0 resets) in 4 ms. (8 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p1 p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT (OR p0 p1))), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 350 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 167 ms :[(NOT p1), (OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0)]
Stuttering acceptance computed with spot in 173 ms :[(NOT p1), (OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0)]
[2025-05-30 20:32:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
Proved EG p0
Knowledge obtained : [(AND p1 p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT (OR p0 p1))), (F (NOT p0)), (F (NOT p1)), (G p0)]
Property proved to be false thanks to negative knowledge :(G p0)
Knowledge based reduction with 5 factoid took 382 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CryptoMiner-PT-D10N000-LTLFireability-06 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CryptoMiner-PT-D10N000-LTLFireability-06 finished in 2327 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))'
Support contains 1 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2025-05-30 20:32:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 20:32:52] [INFO ] Implicit Places using invariants in 28 ms returned []
[2025-05-30 20:32:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 20:32:52] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-05-30 20:32:52] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
Running 20 sub problems to find dead transitions.
[2025-05-30 20:32:52] [INFO ] Invariant cache hit.
[2025-05-30 20:32:52] [INFO ] State equation strengthened by 10 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 22/42 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 10/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 1/43 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 0/43 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 43/43 variables, and 31 constraints, problems are : Problem set: 0 solved, 20 unsolved in 222 ms.
Refiners :[State Equation: 21/21 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 22/42 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 10/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 19/49 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 1/43 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/43 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/43 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 0/43 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 43/43 variables, and 51 constraints, problems are : Problem set: 0 solved, 20 unsolved in 295 ms.
Refiners :[State Equation: 21/21 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 523ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 523ms
Finished structural reductions in LTL mode , in 1 iterations and 585 ms. Remains : 21/21 places, 22/22 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : CryptoMiner-PT-D10N000-LTLFireability-07
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CryptoMiner-PT-D10N000-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-PT-D10N000-LTLFireability-07 finished in 677 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(X(G((p0&&X(G(!p1)))))))'
Support contains 2 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2025-05-30 20:32:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 20:32:53] [INFO ] Implicit Places using invariants in 22 ms returned []
[2025-05-30 20:32:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 20:32:53] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-05-30 20:32:53] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
Running 20 sub problems to find dead transitions.
[2025-05-30 20:32:53] [INFO ] Invariant cache hit.
[2025-05-30 20:32:53] [INFO ] State equation strengthened by 10 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 22/42 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 10/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 1/43 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 0/43 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 43/43 variables, and 31 constraints, problems are : Problem set: 0 solved, 20 unsolved in 216 ms.
Refiners :[State Equation: 21/21 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 22/42 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 10/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 19/49 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 1/43 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/43 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/43 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 0/43 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 43/43 variables, and 51 constraints, problems are : Problem set: 0 solved, 20 unsolved in 270 ms.
Refiners :[State Equation: 21/21 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 497ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 497ms
Finished structural reductions in LTL mode , in 1 iterations and 566 ms. Remains : 21/21 places, 22/22 transitions.
Stuttering acceptance computed with spot in 181 ms :[true, (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1)]
Running random walk in product with property : CryptoMiner-PT-D10N000-LTLFireability-08
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA CryptoMiner-PT-D10N000-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-PT-D10N000-LTLFireability-08 finished in 759 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))&&G((p0||F(!p1)))) U X(p2)))'
Support contains 3 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2025-05-30 20:32:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 20:32:53] [INFO ] Implicit Places using invariants in 28 ms returned []
[2025-05-30 20:32:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 20:32:53] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-05-30 20:32:53] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
Running 20 sub problems to find dead transitions.
[2025-05-30 20:32:53] [INFO ] Invariant cache hit.
[2025-05-30 20:32:53] [INFO ] State equation strengthened by 10 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 22/42 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 10/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 1/43 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 0/43 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 43/43 variables, and 31 constraints, problems are : Problem set: 0 solved, 20 unsolved in 200 ms.
Refiners :[State Equation: 21/21 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 22/42 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 10/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 19/49 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 1/43 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/43 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/43 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 0/43 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 43/43 variables, and 51 constraints, problems are : Problem set: 0 solved, 20 unsolved in 243 ms.
Refiners :[State Equation: 21/21 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 445ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 445ms
Finished structural reductions in LTL mode , in 1 iterations and 508 ms. Remains : 21/21 places, 22/22 transitions.
Stuttering acceptance computed with spot in 258 ms :[(NOT p2), (NOT p2), (AND p0 p1 (NOT p2)), (NOT p0), p1, (AND p1 (NOT p0))]
Running random walk in product with property : CryptoMiner-PT-D10N000-LTLFireability-09
Stuttering criterion allowed to conclude after 11527 steps with 2030 reset in 20 ms.
FORMULA CryptoMiner-PT-D10N000-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-PT-D10N000-LTLFireability-09 finished in 805 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))&&F(!p0)))'
Support contains 1 out of 21 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 22/22 transitions.
Applied a total of 0 rules in 6 ms. Remains 21 /21 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2025-05-30 20:32:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 20:32:54] [INFO ] Implicit Places using invariants in 25 ms returned []
[2025-05-30 20:32:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 20:32:54] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-05-30 20:32:54] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 20:32:54] [INFO ] Redundant transitions in 1 ms returned []
Running 20 sub problems to find dead transitions.
[2025-05-30 20:32:54] [INFO ] Invariant cache hit.
[2025-05-30 20:32:54] [INFO ] State equation strengthened by 10 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 22/42 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 10/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 1/43 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 0/43 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 43/43 variables, and 31 constraints, problems are : Problem set: 0 solved, 20 unsolved in 216 ms.
Refiners :[State Equation: 21/21 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 22/42 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 10/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 19/49 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 1/43 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/43 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/43 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 0/43 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 43/43 variables, and 51 constraints, problems are : Problem set: 0 solved, 20 unsolved in 247 ms.
Refiners :[State Equation: 21/21 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 466ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 466ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 536 ms. Remains : 21/21 places, 22/22 transitions.
Stuttering acceptance computed with spot in 148 ms :[true, (NOT p0), (NOT p0), p0]
Running random walk in product with property : CryptoMiner-PT-D10N000-LTLFireability-10
Product exploration explored 100000 steps with 12974 reset in 92 ms.
Product exploration explored 100000 steps with 12974 reset in 97 ms.
Computed a total of 11 stabilizing places and 11 stable transitions
Computed a total of 11 stabilizing places and 11 stable transitions
Detected a total of 11/21 stabilizing places and 11/22 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 112 ms. Reduced automaton from 4 states, 7 edges and 1 AP (stutter insensitive) to 5 states, 10 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 203 ms :[true, (NOT p0), (NOT p0), p0, false]
RANDOM walk for 20 steps (0 resets) in 4 ms. (4 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 117 ms. Reduced automaton from 5 states, 10 edges and 1 AP (stutter insensitive) to 5 states, 10 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 197 ms :[true, (NOT p0), (NOT p0), p0, false]
Stuttering acceptance computed with spot in 198 ms :[true, (NOT p0), (NOT p0), p0, false]
[2025-05-30 20:32:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
Proved EG true
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0)), true]
Knowledge based reduction with 4 factoid took 149 ms. Reduced automaton from 5 states, 10 edges and 1 AP (stutter insensitive) to 5 states, 10 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 188 ms :[true, (NOT p0), (NOT p0), p0, false]
Support contains 1 out of 21 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 22/22 transitions.
Applied a total of 0 rules in 4 ms. Remains 21 /21 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2025-05-30 20:32:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 20:32:56] [INFO ] Implicit Places using invariants in 25 ms returned []
[2025-05-30 20:32:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 20:32:56] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-05-30 20:32:56] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 20:32:56] [INFO ] Redundant transitions in 1 ms returned []
Running 20 sub problems to find dead transitions.
[2025-05-30 20:32:56] [INFO ] Invariant cache hit.
[2025-05-30 20:32:56] [INFO ] State equation strengthened by 10 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 22/42 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 10/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 1/43 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 0/43 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 43/43 variables, and 31 constraints, problems are : Problem set: 0 solved, 20 unsolved in 211 ms.
Refiners :[State Equation: 21/21 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 22/42 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 10/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 19/49 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 1/43 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/43 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/43 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 0/43 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 43/43 variables, and 51 constraints, problems are : Problem set: 0 solved, 20 unsolved in 262 ms.
Refiners :[State Equation: 21/21 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 515ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 515ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 592 ms. Remains : 21/21 places, 22/22 transitions.
Computed a total of 11 stabilizing places and 11 stable transitions
Computed a total of 11 stabilizing places and 11 stable transitions
Detected a total of 11/21 stabilizing places and 11/22 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 87 ms. Reduced automaton from 5 states, 10 edges and 1 AP (stutter insensitive) to 5 states, 10 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 166 ms :[true, (NOT p0), (NOT p0), p0, false]
RANDOM walk for 16 steps (0 resets) in 4 ms. (3 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 123 ms. Reduced automaton from 5 states, 10 edges and 1 AP (stutter insensitive) to 5 states, 10 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 170 ms :[true, (NOT p0), (NOT p0), p0, false]
Stuttering acceptance computed with spot in 168 ms :[true, (NOT p0), (NOT p0), p0, false]
[2025-05-30 20:32:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
Proved EG true
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0)), true]
Knowledge based reduction with 4 factoid took 144 ms. Reduced automaton from 5 states, 10 edges and 1 AP (stutter insensitive) to 5 states, 10 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 156 ms :[true, (NOT p0), (NOT p0), p0, false]
Stuttering acceptance computed with spot in 171 ms :[true, (NOT p0), (NOT p0), p0, false]
Product exploration explored 100000 steps with 12960 reset in 67 ms.
Product exploration explored 100000 steps with 13086 reset in 88 ms.
Built C files in :
/tmp/ltsmin4109651896381200305
[2025-05-30 20:32:58] [INFO ] Computing symmetric may disable matrix : 22 transitions.
[2025-05-30 20:32:58] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 20:32:58] [INFO ] Computing symmetric may enable matrix : 22 transitions.
[2025-05-30 20:32:58] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 20:32:58] [INFO ] Computing Do-Not-Accords matrix : 22 transitions.
[2025-05-30 20:32:58] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 20:32:58] [INFO ] Built C files in 47ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4109651896381200305
Running compilation step : cd /tmp/ltsmin4109651896381200305;'/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/ltsmin4109651896381200305;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin4109651896381200305;'/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/stateBased13031399932473756094.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 21 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 21 /21 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2025-05-30 20:33:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 20:33:13] [INFO ] Implicit Places using invariants in 32 ms returned []
[2025-05-30 20:33:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 20:33:14] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-05-30 20:33:14] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 20:33:14] [INFO ] Redundant transitions in 0 ms returned []
Running 20 sub problems to find dead transitions.
[2025-05-30 20:33:14] [INFO ] Invariant cache hit.
[2025-05-30 20:33:14] [INFO ] State equation strengthened by 10 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 22/42 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 10/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 1/43 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 0/43 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 43/43 variables, and 31 constraints, problems are : Problem set: 0 solved, 20 unsolved in 200 ms.
Refiners :[State Equation: 21/21 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 22/42 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 10/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 19/49 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 1/43 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/43 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/43 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 0/43 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 43/43 variables, and 51 constraints, problems are : Problem set: 0 solved, 20 unsolved in 285 ms.
Refiners :[State Equation: 21/21 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 495ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 495ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 574 ms. Remains : 21/21 places, 22/22 transitions.
Built C files in :
/tmp/ltsmin10440660113311987162
[2025-05-30 20:33:14] [INFO ] Computing symmetric may disable matrix : 22 transitions.
[2025-05-30 20:33:14] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 20:33:14] [INFO ] Computing symmetric may enable matrix : 22 transitions.
[2025-05-30 20:33:14] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 20:33:14] [INFO ] Computing Do-Not-Accords matrix : 22 transitions.
[2025-05-30 20:33:14] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 20:33:14] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10440660113311987162
Running compilation step : cd /tmp/ltsmin10440660113311987162;'/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 97 ms.
Running link step : cd /tmp/ltsmin10440660113311987162;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin10440660113311987162;'/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/stateBased6227404753024639721.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-05-30 20:33:29] [INFO ] Flatten gal took : 4 ms
[2025-05-30 20:33:29] [INFO ] Flatten gal took : 2 ms
[2025-05-30 20:33:29] [INFO ] Time to serialize gal into /tmp/LTL9766316205062539747.gal : 1 ms
[2025-05-30 20:33:29] [INFO ] Time to serialize properties into /tmp/LTL12173196558689801543.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9766316205062539747.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4196715008897137187.hoa' '-atoms' '/tmp/LTL12173196558689801543.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL12173196558689801543.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4196715008897137187.hoa
Detected timeout of ITS tools.
[2025-05-30 20:33:44] [INFO ] Flatten gal took : 2 ms
[2025-05-30 20:33:44] [INFO ] Flatten gal took : 2 ms
[2025-05-30 20:33:44] [INFO ] Time to serialize gal into /tmp/LTL5482304795637096142.gal : 1 ms
[2025-05-30 20:33:44] [INFO ] Time to serialize properties into /tmp/LTL14785301407729349044.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5482304795637096142.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14785301407729349044.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((G(F("(state_c3<1)")))&&(F("(state_c3>=1)"))))
Formula 0 simplified : FG!"(state_c3<1)" | G!"(state_c3>=1)"
Detected timeout of ITS tools.
[2025-05-30 20:33:59] [INFO ] Flatten gal took : 1 ms
[2025-05-30 20:33:59] [INFO ] Applying decomposition
[2025-05-30 20:33:59] [INFO ] Flatten gal took : 1 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph14123292226044300195.txt' '-o' '/tmp/graph14123292226044300195.bin' '-w' '/tmp/graph14123292226044300195.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph14123292226044300195.bin' '-l' '-1' '-v' '-w' '/tmp/graph14123292226044300195.weights' '-q' '0' '-e' '0.001'
[2025-05-30 20:33:59] [INFO ] Decomposing Gal with order
[2025-05-30 20:33:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 20:33:59] [INFO ] Flatten gal took : 43 ms
[2025-05-30 20:33:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2025-05-30 20:33:59] [INFO ] Time to serialize gal into /tmp/LTL5885778676311663373.gal : 1 ms
[2025-05-30 20:33:59] [INFO ] Time to serialize properties into /tmp/LTL16512638297602398503.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5885778676311663373.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16512638297602398503.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !(((G(F("(i2.u7.state_c3<1)")))&&(F("(i2.u7.state_c3>=1)"))))
Formula 0 simplified : FG!"(i2.u7.state_c3<1)" | G!"(i2.u7.state_c3>=1)"
Detected timeout of ITS tools.
Treatment of property CryptoMiner-PT-D10N000-LTLFireability-10 finished in 80435 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(G(!p0)))'
Support contains 1 out of 21 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 22/22 transitions.
Applied a total of 0 rules in 4 ms. Remains 21 /21 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2025-05-30 20:34:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 20:34:15] [INFO ] Implicit Places using invariants in 27 ms returned []
[2025-05-30 20:34:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 20:34:15] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-05-30 20:34:15] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 20:34:15] [INFO ] Redundant transitions in 0 ms returned []
Running 20 sub problems to find dead transitions.
[2025-05-30 20:34:15] [INFO ] Invariant cache hit.
[2025-05-30 20:34:15] [INFO ] State equation strengthened by 10 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 22/42 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 10/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 1/43 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 0/43 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 43/43 variables, and 31 constraints, problems are : Problem set: 0 solved, 20 unsolved in 425 ms.
Refiners :[State Equation: 21/21 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 22/42 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 10/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 19/49 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 1/43 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/43 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/43 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 0/43 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 43/43 variables, and 51 constraints, problems are : Problem set: 0 solved, 20 unsolved in 274 ms.
Refiners :[State Equation: 21/21 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 729ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 730ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 832 ms. Remains : 21/21 places, 22/22 transitions.
Stuttering acceptance computed with spot in 31 ms :[p0]
Running random walk in product with property : CryptoMiner-PT-D10N000-LTLFireability-11
Product exploration explored 100000 steps with 7365 reset in 43 ms.
Product exploration explored 100000 steps with 7343 reset in 62 ms.
Computed a total of 11 stabilizing places and 11 stable transitions
Computed a total of 11 stabilizing places and 11 stable transitions
Detected a total of 11/21 stabilizing places and 11/22 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 80 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[p0]
RANDOM walk for 43 steps (0 resets) in 4 ms. (8 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 90 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[p0]
Stuttering acceptance computed with spot in 28 ms :[p0]
Support contains 1 out of 21 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 22/22 transitions.
Applied a total of 0 rules in 4 ms. Remains 21 /21 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2025-05-30 20:34:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 20:34:16] [INFO ] Implicit Places using invariants in 28 ms returned []
[2025-05-30 20:34:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 20:34:16] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-05-30 20:34:16] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 20:34:16] [INFO ] Redundant transitions in 0 ms returned []
Running 20 sub problems to find dead transitions.
[2025-05-30 20:34:16] [INFO ] Invariant cache hit.
[2025-05-30 20:34:16] [INFO ] State equation strengthened by 10 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 22/42 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 10/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 1/43 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 0/43 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 43/43 variables, and 31 constraints, problems are : Problem set: 0 solved, 20 unsolved in 272 ms.
Refiners :[State Equation: 21/21 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 22/42 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 10/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 19/49 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 1/43 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/43 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/43 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 0/43 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 43/43 variables, and 51 constraints, problems are : Problem set: 0 solved, 20 unsolved in 296 ms.
Refiners :[State Equation: 21/21 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 591ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 591ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 685 ms. Remains : 21/21 places, 22/22 transitions.
Computed a total of 11 stabilizing places and 11 stable transitions
Computed a total of 11 stabilizing places and 11 stable transitions
Detected a total of 11/21 stabilizing places and 11/22 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 104 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[p0]
RANDOM walk for 41 steps (0 resets) in 4 ms. (8 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 91 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[p0]
Stuttering acceptance computed with spot in 33 ms :[p0]
Stuttering acceptance computed with spot in 34 ms :[p0]
Product exploration explored 100000 steps with 7338 reset in 42 ms.
Product exploration explored 100000 steps with 7348 reset in 48 ms.
Built C files in :
/tmp/ltsmin13578411602644993904
[2025-05-30 20:34:17] [INFO ] Computing symmetric may disable matrix : 22 transitions.
[2025-05-30 20:34:17] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 20:34:17] [INFO ] Computing symmetric may enable matrix : 22 transitions.
[2025-05-30 20:34:17] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 20:34:17] [INFO ] Computing Do-Not-Accords matrix : 22 transitions.
[2025-05-30 20:34:17] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 20:34:17] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13578411602644993904
Running compilation step : cd /tmp/ltsmin13578411602644993904;'/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 84 ms.
Running link step : cd /tmp/ltsmin13578411602644993904;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin13578411602644993904;'/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/stateBased17694960673925941174.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 21 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2025-05-30 20:34:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 20:34:32] [INFO ] Implicit Places using invariants in 61 ms returned []
[2025-05-30 20:34:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 20:34:32] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-05-30 20:34:32] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 20:34:32] [INFO ] Redundant transitions in 1 ms returned []
Running 20 sub problems to find dead transitions.
[2025-05-30 20:34:32] [INFO ] Invariant cache hit.
[2025-05-30 20:34:32] [INFO ] State equation strengthened by 10 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 22/42 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 10/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 1/43 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 0/43 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 43/43 variables, and 31 constraints, problems are : Problem set: 0 solved, 20 unsolved in 258 ms.
Refiners :[State Equation: 21/21 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 22/42 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 10/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 19/49 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 1/43 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/43 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/43 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 0/43 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 43/43 variables, and 51 constraints, problems are : Problem set: 0 solved, 20 unsolved in 508 ms.
Refiners :[State Equation: 21/21 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 782ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 783ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 896 ms. Remains : 21/21 places, 22/22 transitions.
Built C files in :
/tmp/ltsmin7541053944551533245
[2025-05-30 20:34:33] [INFO ] Computing symmetric may disable matrix : 22 transitions.
[2025-05-30 20:34:33] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 20:34:33] [INFO ] Computing symmetric may enable matrix : 22 transitions.
[2025-05-30 20:34:33] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 20:34:33] [INFO ] Computing Do-Not-Accords matrix : 22 transitions.
[2025-05-30 20:34:33] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 20:34:33] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7541053944551533245
Running compilation step : cd /tmp/ltsmin7541053944551533245;'/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 79 ms.
Running link step : cd /tmp/ltsmin7541053944551533245;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin7541053944551533245;'/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/stateBased3634922394989068988.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-05-30 20:34:48] [INFO ] Flatten gal took : 6 ms
[2025-05-30 20:34:48] [INFO ] Flatten gal took : 2 ms
[2025-05-30 20:34:48] [INFO ] Time to serialize gal into /tmp/LTL12748282891631990811.gal : 0 ms
[2025-05-30 20:34:48] [INFO ] Time to serialize properties into /tmp/LTL11663804126115564685.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12748282891631990811.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14616553284882240630.hoa' '-atoms' '/tmp/LTL11663804126115564685.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL11663804126115564685.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14616553284882240630.hoa
Detected timeout of ITS tools.
[2025-05-30 20:35:03] [INFO ] Flatten gal took : 1 ms
[2025-05-30 20:35:03] [INFO ] Flatten gal took : 3 ms
[2025-05-30 20:35:03] [INFO ] Time to serialize gal into /tmp/LTL15938179527247303706.gal : 2 ms
[2025-05-30 20:35:03] [INFO ] Time to serialize properties into /tmp/LTL10389082662870994353.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15938179527247303706.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10389082662870994353.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F(G("(state_c10<1)"))))
Formula 0 simplified : GF!"(state_c10<1)"
Detected timeout of ITS tools.
[2025-05-30 20:35:18] [INFO ] Flatten gal took : 3 ms
[2025-05-30 20:35:18] [INFO ] Applying decomposition
[2025-05-30 20:35:18] [INFO ] Flatten gal took : 2 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph10323581832969937974.txt' '-o' '/tmp/graph10323581832969937974.bin' '-w' '/tmp/graph10323581832969937974.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph10323581832969937974.bin' '-l' '-1' '-v' '-w' '/tmp/graph10323581832969937974.weights' '-q' '0' '-e' '0.001'
[2025-05-30 20:35:18] [INFO ] Decomposing Gal with order
[2025-05-30 20:35:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 20:35:18] [INFO ] Flatten gal took : 3 ms
[2025-05-30 20:35:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2025-05-30 20:35:18] [INFO ] Time to serialize gal into /tmp/LTL3515957112597131339.gal : 1 ms
[2025-05-30 20:35:18] [INFO ] Time to serialize properties into /tmp/LTL18307445985992183630.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3515957112597131339.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18307445985992183630.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F(G("(i1.u4.state_c10<1)"))))
Formula 0 simplified : GF!"(i1.u4.state_c10<1)"
Detected timeout of ITS tools.
Treatment of property CryptoMiner-PT-D10N000-LTLFireability-11 finished in 78812 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||X(X(X(X(F((!p0&&G(!p1))))))))))'
Support contains 2 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2025-05-30 20:35:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 20:35:33] [INFO ] Implicit Places using invariants in 24 ms returned []
[2025-05-30 20:35:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 20:35:33] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-05-30 20:35:33] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
Running 20 sub problems to find dead transitions.
[2025-05-30 20:35:33] [INFO ] Invariant cache hit.
[2025-05-30 20:35:33] [INFO ] State equation strengthened by 10 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 22/42 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 10/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 1/43 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 0/43 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 43/43 variables, and 31 constraints, problems are : Problem set: 0 solved, 20 unsolved in 234 ms.
Refiners :[State Equation: 21/21 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 22/42 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 10/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 19/49 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 1/43 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/43 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/43 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 0/43 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 43/43 variables, and 51 constraints, problems are : Problem set: 0 solved, 20 unsolved in 254 ms.
Refiners :[State Equation: 21/21 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 530ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 531ms
Finished structural reductions in LTL mode , in 1 iterations and 639 ms. Remains : 21/21 places, 22/22 transitions.
Stuttering acceptance computed with spot in 245 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (OR p1 p0), (OR p1 p0), (OR p1 p0), (OR p1 p0), p1]
Running random walk in product with property : CryptoMiner-PT-D10N000-LTLFireability-12
Product exploration explored 100000 steps with 7337 reset in 39 ms.
Product exploration explored 100000 steps with 7350 reset in 53 ms.
Computed a total of 11 stabilizing places and 11 stable transitions
Computed a total of 11 stabilizing places and 11 stable transitions
Detected a total of 11/21 stabilizing places and 11/22 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 111 ms. Reduced automaton from 7 states, 9 edges and 2 AP (stutter sensitive) to 7 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 220 ms :[(OR p1 p0), (OR p1 p0), (OR p1 p0), (OR p1 p0), (OR p1 p0), (OR p1 p0), p1]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 44 steps (0 resets) in 4 ms. (8 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 p1))), (F p0), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 4 factoid took 243 ms. Reduced automaton from 7 states, 9 edges and 2 AP (stutter sensitive) to 7 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 235 ms :[(OR p1 p0), (OR p1 p0), (OR p1 p0), (OR p1 p0), (OR p1 p0), (OR p1 p0), p1]
Stuttering acceptance computed with spot in 227 ms :[(OR p1 p0), (OR p1 p0), (OR p1 p0), (OR p1 p0), (OR p1 p0), (OR p1 p0), p1]
[2025-05-30 20:35:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
Proved EG p1
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 p1))), (F p0), (F (NOT (OR p0 p1))), (G p1)]
Property proved to be false thanks to negative knowledge :(G p1)
Knowledge based reduction with 4 factoid took 265 ms. Reduced automaton from 7 states, 9 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CryptoMiner-PT-D10N000-LTLFireability-12 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CryptoMiner-PT-D10N000-LTLFireability-12 finished in 2335 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((X(p1)||p0))))'
Support contains 2 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2025-05-30 20:35:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 20:35:36] [INFO ] Implicit Places using invariants in 21 ms returned []
[2025-05-30 20:35:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 20:35:36] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-05-30 20:35:36] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 126 ms to find 0 implicit places.
Running 20 sub problems to find dead transitions.
[2025-05-30 20:35:36] [INFO ] Invariant cache hit.
[2025-05-30 20:35:36] [INFO ] State equation strengthened by 10 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 22/42 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 10/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 1/43 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 0/43 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 43/43 variables, and 31 constraints, problems are : Problem set: 0 solved, 20 unsolved in 215 ms.
Refiners :[State Equation: 21/21 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 22/42 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 10/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 19/49 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 1/43 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/43 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/43 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 0/43 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 43/43 variables, and 51 constraints, problems are : Problem set: 0 solved, 20 unsolved in 255 ms.
Refiners :[State Equation: 21/21 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 504ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 504ms
Finished structural reductions in LTL mode , in 1 iterations and 631 ms. Remains : 21/21 places, 22/22 transitions.
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CryptoMiner-PT-D10N000-LTLFireability-14
Product exploration explored 100000 steps with 50000 reset in 34 ms.
Product exploration explored 100000 steps with 50000 reset in 40 ms.
Computed a total of 11 stabilizing places and 11 stable transitions
Computed a total of 11 stabilizing places and 11 stable transitions
Detected a total of 11/21 stabilizing places and 11/22 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 18 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CryptoMiner-PT-D10N000-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CryptoMiner-PT-D10N000-LTLFireability-14 finished in 838 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((G(!p0)||G(F(!p1)))))'
Support contains 2 out of 21 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2025-05-30 20:35:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 20:35:37] [INFO ] Implicit Places using invariants in 18 ms returned []
[2025-05-30 20:35:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 20:35:37] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-05-30 20:35:37] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 20:35:37] [INFO ] Redundant transitions in 0 ms returned []
Running 20 sub problems to find dead transitions.
[2025-05-30 20:35:37] [INFO ] Invariant cache hit.
[2025-05-30 20:35:37] [INFO ] State equation strengthened by 10 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 22/42 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 10/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 1/43 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 0/43 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 43/43 variables, and 31 constraints, problems are : Problem set: 0 solved, 20 unsolved in 223 ms.
Refiners :[State Equation: 21/21 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 22/42 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 10/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 19/49 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 1/43 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/43 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/43 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 0/43 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 43/43 variables, and 51 constraints, problems are : Problem set: 0 solved, 20 unsolved in 261 ms.
Refiners :[State Equation: 21/21 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 511ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 521ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 585 ms. Remains : 21/21 places, 22/22 transitions.
Stuttering acceptance computed with spot in 57 ms :[(AND p0 p1), (AND p0 p1)]
Running random walk in product with property : CryptoMiner-PT-D10N000-LTLFireability-15
Product exploration explored 100000 steps with 7359 reset in 40 ms.
Product exploration explored 100000 steps with 7350 reset in 43 ms.
Computed a total of 11 stabilizing places and 11 stable transitions
Computed a total of 11 stabilizing places and 11 stable transitions
Detected a total of 11/21 stabilizing places and 11/22 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X p1), (X (NOT p1)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 7 factoid took 459 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(AND p1 p0), (AND p1 p0)]
RANDOM walk for 40002 steps (2792 resets) in 146 ms. (272 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 17 ms. (2222 steps per ms) remains 1/1 properties
[2025-05-30 20:35:38] [INFO ] Invariant cache hit.
[2025-05-30 20:35:38] [INFO ] State equation strengthened by 10 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/5 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/9 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/13 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 4/17 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/17 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 4/21 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/21 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf0 is UNSAT
After SMT solving in domain Real declared 22/43 variables, and 11 constraints, problems are : Problem set: 1 solved, 0 unsolved in 61 ms.
Refiners :[State Equation: 11/21 constraints, ReadFeed: 0/10 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 68ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (G (OR (NOT p1) (NOT p0)))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X p1), (X (NOT p1)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F p0), (F (NOT (AND p1 (NOT p0))))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 23 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CryptoMiner-PT-D10N000-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CryptoMiner-PT-D10N000-LTLFireability-15 finished in 1428 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))&&F(!p0)))'
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(G(!p0)))'
[2025-05-30 20:35:38] [INFO ] Flatten gal took : 4 ms
Using solver Z3 to compute partial order matrices.
[2025-05-30 20:35:38] [INFO ] Applying decomposition
Built C files in :
/tmp/ltsmin17860104537253696318
[2025-05-30 20:35:38] [INFO ] Flatten gal took : 1 ms
[2025-05-30 20:35:38] [INFO ] Computing symmetric may disable matrix : 22 transitions.
[2025-05-30 20:35:38] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 20:35:38] [INFO ] Computing symmetric may enable matrix : 22 transitions.
[2025-05-30 20:35:38] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 20:35:38] [INFO ] Computing Do-Not-Accords matrix : 22 transitions.
[2025-05-30 20:35:38] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 20:35:38] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17860104537253696318
Running compilation step : cd /tmp/ltsmin17860104537253696318;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '360' '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'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph9662210405676440912.txt' '-o' '/tmp/graph9662210405676440912.bin' '-w' '/tmp/graph9662210405676440912.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9662210405676440912.bin' '-l' '-1' '-v' '-w' '/tmp/graph9662210405676440912.weights' '-q' '0' '-e' '0.001'
[2025-05-30 20:35:38] [INFO ] Decomposing Gal with order
[2025-05-30 20:35:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 20:35:38] [INFO ] Flatten gal took : 5 ms
[2025-05-30 20:35:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2025-05-30 20:35:38] [INFO ] Time to serialize gal into /tmp/LTLFireability12283018474334630216.gal : 1 ms
[2025-05-30 20:35:38] [INFO ] Time to serialize properties into /tmp/LTLFireability6457760123832571642.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability12283018474334630216.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability6457760123832571642.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 2 LTL properties
Checking formula 0 : !(((G(F("(i1.u6.state_c3<1)")))&&(F("(i1.u6.state_c3>=1)"))))
Formula 0 simplified : FG!"(i1.u6.state_c3<1)" | G!"(i1.u6.state_c3>=1)"
Compilation finished in 98 ms.
Running link step : cd /tmp/ltsmin17860104537253696318;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin17860104537253696318;'/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' '--ltl' '([](<>((LTLAPp0==true)))&&<>(!(LTLAPp0==true)))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 3/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.001: LTL layer: formula: ([](<>((LTLAPp0==true)))&&<>(!(LTLAPp0==true)))
pins2lts-mc-linux64( 3/ 8), 0.001: "([](<>((LTLAPp0==true)))&&<>(!(LTLAPp0==true)))" is not a file, parsing as formula...
pins2lts-mc-linux64( 3/ 8), 0.002: Using Spin LTL semantics
pins2lts-mc-linux64( 7/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.006: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.006: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.006: Initializing POR dependencies: labels 24, guards 22
pins2lts-mc-linux64( 5/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.009: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.010: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.010: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.011: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.012: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.012: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.012: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.017: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.017: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 0.047: There are 26 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.047: State length is 22, there are 29 groups
pins2lts-mc-linux64( 0/ 8), 0.047: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.047: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.047: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.047: Visible groups: 0 / 29, labels: 1 / 26
pins2lts-mc-linux64( 0/ 8), 0.047: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 0.047: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 3/ 8), 0.090: [Blue] ~25 levels ~960 states ~1304 transitions
pins2lts-mc-linux64( 3/ 8), 0.117: [Blue] ~28 levels ~1920 states ~2272 transitions
pins2lts-mc-linux64( 1/ 8), 0.171: [Blue] ~36 levels ~3840 states ~4072 transitions
pins2lts-mc-linux64( 1/ 8), 0.203: [Blue] ~43 levels ~7680 states ~8296 transitions
pins2lts-mc-linux64( 1/ 8), 0.357: [Blue] ~51 levels ~15360 states ~16912 transitions
pins2lts-mc-linux64( 1/ 8), 0.799: [Blue] ~73 levels ~30720 states ~35256 transitions
pins2lts-mc-linux64( 1/ 8), 1.157: [Blue] ~97 levels ~61440 states ~68760 transitions
pins2lts-mc-linux64( 1/ 8), 2.531: [Blue] ~115 levels ~122880 states ~137120 transitions
pins2lts-mc-linux64( 1/ 8), 4.487: [Blue] ~152 levels ~245760 states ~275928 transitions
pins2lts-mc-linux64( 2/ 8), 8.722: [Blue] ~244 levels ~491520 states ~565408 transitions
pins2lts-mc-linux64( 2/ 8), 11.772: [Blue] ~310 levels ~983040 states ~1103048 transitions
pins2lts-mc-linux64( 2/ 8), 17.263: [Blue] ~394 levels ~1966080 states ~2188056 transitions
pins2lts-mc-linux64( 2/ 8), 20.560: [Blue] ~485 levels ~3932160 states ~4244192 transitions
pins2lts-mc-linux64( 3/ 8), 24.112: [Blue] ~622 levels ~7864320 states ~8363328 transitions
pins2lts-mc-linux64( 3/ 8), 31.437: [Blue] ~793 levels ~15728640 states ~16588080 transitions
pins2lts-mc-linux64( 2/ 8), 47.313: [Blue] ~1017 levels ~31457280 states ~33128880 transitions
pins2lts-mc-linux64( 3/ 8), 78.383: [Blue] ~1279 levels ~62914560 states ~66237848 transitions
pins2lts-mc-linux64( 7/ 8), 111.728: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 111.732:
pins2lts-mc-linux64( 0/ 8), 111.732: Explored 79928437 states 95491965 transitions, fanout: 1.195
pins2lts-mc-linux64( 0/ 8), 111.732: Total exploration time 111.680 sec (111.660 sec minimum, 111.668 sec on average)
pins2lts-mc-linux64( 0/ 8), 111.732: States per second: 715692, Transitions per second: 855050
pins2lts-mc-linux64( 0/ 8), 111.732:
pins2lts-mc-linux64( 0/ 8), 111.732: State space has 71689967 states, 59469480 are accepting
pins2lts-mc-linux64( 0/ 8), 111.732: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 111.732: blue states: 79928437 (111.49%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 111.732: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 111.732: all-red states: 59469480 (82.95%), bogus 7116877 (9.93%)
pins2lts-mc-linux64( 0/ 8), 111.732:
pins2lts-mc-linux64( 0/ 8), 111.732: Total memory used for local state coloring: 203.6MB
pins2lts-mc-linux64( 0/ 8), 111.732:
pins2lts-mc-linux64( 0/ 8), 111.733: Queue width: 8B, total height: 13345073, memory: 101.81MB
pins2lts-mc-linux64( 0/ 8), 111.733: Tree memory: 803.0MB, 11.7 B/state, compr.: 13.0%
pins2lts-mc-linux64( 0/ 8), 111.733: Tree fill ratio (roots/leafs): 53.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 111.733: Stored 22 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 111.733: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 111.733: Est. total memory use: 904.8MB (~1125.8MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin17860104537253696318;'/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' '--ltl' '([](<>((LTLAPp0==true)))&&<>(!(LTLAPp0==true)))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin17860104537253696318;'/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' '--ltl' '([](<>((LTLAPp0==true)))&&<>(!(LTLAPp0==true)))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:241)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:176)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:114)
at java.base/java.lang.Thread.run(Thread.java:1583)
Detected timeout of ITS tools.
[2025-05-30 20:56:43] [INFO ] Flatten gal took : 3 ms
[2025-05-30 20:56:43] [INFO ] Time to serialize gal into /tmp/LTLFireability2750176045356540506.gal : 1 ms
[2025-05-30 20:56:43] [INFO ] Time to serialize properties into /tmp/LTLFireability13884821504665518342.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability2750176045356540506.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability13884821504665518342.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 2 LTL properties
Checking formula 0 : !(((G(F("(state_c3<1)")))&&(F("(state_c3>=1)"))))
Formula 0 simplified : FG!"(state_c3<1)" | G!"(state_c3>=1)"
Detected timeout of ITS tools.
[2025-05-30 21:17:47] [INFO ] Flatten gal took : 10 ms
[2025-05-30 21:17:47] [INFO ] Input system was already deterministic with 22 transitions.
[2025-05-30 21:17:47] [INFO ] Transformed 21 places.
[2025-05-30 21:17:47] [INFO ] Transformed 22 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2025-05-30 21:17:47] [INFO ] Time to serialize gal into /tmp/LTLFireability7368720107895109816.gal : 0 ms
[2025-05-30 21:17:47] [INFO ] Time to serialize properties into /tmp/LTLFireability16780753602669168534.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability7368720107895109816.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability16780753602669168534.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...343
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !(((G(F("(state_c3<1)")))&&(F("(state_c3>=1)"))))
Formula 0 simplified : FG!"(state_c3<1)" | G!"(state_c3>=1)"

BK_TIME_CONFINEMENT_REACHED

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

tar xzf /home/mcc/BenchKit/INPUTS/CryptoMiner-PT-D10N000.tgz
mv CryptoMiner-PT-D10N000 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;