fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r091-tall-171624187400299
Last Updated
July 7, 2024

About the Execution of GreatSPN+red for CryptoMiner-COL-D03N010

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
423.487 17738.00 32826.00 218.00 FFTTFFFFFFTTTFFF normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 552K
-rw-r--r-- 1 mcc users 7.2K Apr 12 12:39 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Apr 12 12:39 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Apr 12 12:33 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Apr 12 12:33 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:35 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 12 12:43 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 151K Apr 12 12:43 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 16K Apr 12 12:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 138K Apr 12 12:41 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 22 14:35 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:35 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_pt
-rw-r--r-- 1 mcc users 8 May 18 16:42 instance
-rw-r--r-- 1 mcc users 5 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 13K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716278565092

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CryptoMiner-COL-D03N010
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 08:02:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-21 08:02:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 08:02:46] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-21 08:02:46] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-21 08:02:46] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 548 ms
[2024-05-21 08:02:46] [INFO ] Imported 3 HL places and 5 HL transitions for a total of 12 PT places and 20.0 transition bindings in 17 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
[2024-05-21 08:02:47] [INFO ] Built PT skeleton of HLPN with 3 places and 5 transitions 14 arcs in 4 ms.
[2024-05-21 08:02:47] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 3 formulas.
FORMULA CryptoMiner-COL-D03N010-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CryptoMiner-COL-D03N010-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CryptoMiner-COL-D03N010-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 3 stabilizing places and 3 stable transitions
Remains 13 properties that can be checked using skeleton over-approximation.
Computed a total of 3 stabilizing places and 3 stable transitions
RANDOM walk for 40014 steps (5335 resets) in 483 ms. (82 steps per ms) remains 3/20 properties
BEST_FIRST walk for 40004 steps (972 resets) in 193 ms. (206 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (1087 resets) in 282 ms. (141 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (972 resets) in 110 ms. (360 steps per ms) remains 3/3 properties
[2024-05-21 08:02:47] [INFO ] Flow matrix only has 4 transitions (discarded 1 similar events)
// Phase 1: matrix 4 rows 3 cols
[2024-05-21 08:02:47] [INFO ] Computed 0 invariants in 2 ms
[2024-05-21 08:02:47] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp13 is UNSAT
After SMT solving in domain Real declared 5/7 variables, and 2 constraints, problems are : Problem set: 3 solved, 0 unsolved in 169 ms.
Refiners :[State Equation: 2/3 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 203ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 3 atomic propositions for a total of 13 simplifications.
FORMULA CryptoMiner-COL-D03N010-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 08:02:47] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2024-05-21 08:02:47] [INFO ] Flatten gal took : 13 ms
FORMULA CryptoMiner-COL-D03N010-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 08:02:47] [INFO ] Flatten gal took : 1 ms
Arc [0:1*[(MOD (ADD $x 1) 4)]] contains successor/predecessor on variables of sort CD
[2024-05-21 08:02:48] [INFO ] Unfolded HLPN to a Petri net with 12 places and 12 transitions 34 arcs in 9 ms.
[2024-05-21 08:02:48] [INFO ] Unfolded 11 HLPN properties in 0 ms.
Support contains 12 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Applied a total of 0 rules in 5 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
// Phase 1: matrix 12 rows 12 cols
[2024-05-21 08:02:48] [INFO ] Computed 1 invariants in 0 ms
[2024-05-21 08:02:48] [INFO ] Implicit Places using invariants in 103 ms returned []
[2024-05-21 08:02:48] [INFO ] Invariant cache hit.
[2024-05-21 08:02:48] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 08:02:48] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 155 ms to find 0 implicit places.
Running 9 sub problems to find dead transitions.
[2024-05-21 08:02:48] [INFO ] Invariant cache hit.
[2024-05-21 08:02:48] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 2/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 12/23 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 1/24 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/24 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 0/24 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 24/24 variables, and 16 constraints, problems are : Problem set: 0 solved, 9 unsolved in 146 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 12/12 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 2/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 12/23 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 8/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/23 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 1/24 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/24 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/24 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 0/24 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 24/24 variables, and 25 constraints, problems are : Problem set: 0 solved, 9 unsolved in 143 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 12/12 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 296ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 297ms
Finished structural reductions in LTL mode , in 1 iterations and 466 ms. Remains : 12/12 places, 12/12 transitions.
Support contains 12 out of 12 places after structural reductions.
[2024-05-21 08:02:48] [INFO ] Flatten gal took : 2 ms
[2024-05-21 08:02:48] [INFO ] Flatten gal took : 3 ms
[2024-05-21 08:02:48] [INFO ] Input system was already deterministic with 12 transitions.
RANDOM walk for 40009 steps (8 resets) in 230 ms. (173 steps per ms) remains 2/16 properties
BEST_FIRST walk for 40003 steps (8 resets) in 102 ms. (388 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 32 ms. (1212 steps per ms) remains 1/1 properties
[2024-05-21 08:02:48] [INFO ] Invariant cache hit.
[2024-05-21 08:02:48] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp9 is UNSAT
After SMT solving in domain Real declared 8/24 variables, and 4 constraints, problems are : Problem set: 1 solved, 0 unsolved in 53 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1 constraints, State Equation: 4/12 constraints, ReadFeed: 0/3 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 84ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 29 edges and 12 vertex of which 5 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0&&(F(!p0)||X(G(p1)))))))'
Support contains 8 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2024-05-21 08:02:49] [INFO ] Invariant cache hit.
[2024-05-21 08:02:49] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-21 08:02:49] [INFO ] Invariant cache hit.
[2024-05-21 08:02:49] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 08:02:49] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
Running 9 sub problems to find dead transitions.
[2024-05-21 08:02:49] [INFO ] Invariant cache hit.
[2024-05-21 08:02:49] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 2/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 12/23 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 1/24 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/24 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 0/24 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 24/24 variables, and 16 constraints, problems are : Problem set: 0 solved, 9 unsolved in 121 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 12/12 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 2/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 12/23 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 8/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/23 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 1/24 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/24 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/24 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 0/24 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 24/24 variables, and 25 constraints, problems are : Problem set: 0 solved, 9 unsolved in 132 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 12/12 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 258ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 258ms
Finished structural reductions in LTL mode , in 1 iterations and 328 ms. Remains : 12/12 places, 12/12 transitions.
Stuttering acceptance computed with spot in 318 ms :[true, p0, (OR (NOT p0) (NOT p1)), (AND p0 (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : CryptoMiner-COL-D03N010-LTLCardinality-01
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 2 ms.
FORMULA CryptoMiner-COL-D03N010-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-COL-D03N010-LTLCardinality-01 finished in 703 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 8 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2024-05-21 08:02:49] [INFO ] Invariant cache hit.
[2024-05-21 08:02:49] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-05-21 08:02:49] [INFO ] Invariant cache hit.
[2024-05-21 08:02:49] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 08:02:49] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
Running 9 sub problems to find dead transitions.
[2024-05-21 08:02:49] [INFO ] Invariant cache hit.
[2024-05-21 08:02:49] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 2/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 12/23 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 1/24 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/24 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 0/24 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 24/24 variables, and 16 constraints, problems are : Problem set: 0 solved, 9 unsolved in 90 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 12/12 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 2/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 12/23 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 8/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/23 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 1/24 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/24 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/24 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 0/24 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 24/24 variables, and 25 constraints, problems are : Problem set: 0 solved, 9 unsolved in 101 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 12/12 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 213ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 213ms
Finished structural reductions in LTL mode , in 1 iterations and 262 ms. Remains : 12/12 places, 12/12 transitions.
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CryptoMiner-COL-D03N010-LTLCardinality-02
Product exploration explored 100000 steps with 50000 reset in 188 ms.
Product exploration explored 100000 steps with 50000 reset in 107 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 29 edges and 12 vertex of which 5 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 18 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CryptoMiner-COL-D03N010-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CryptoMiner-COL-D03N010-LTLCardinality-02 finished in 662 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||G(F(p1)))))'
Support contains 12 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2024-05-21 08:02:50] [INFO ] Invariant cache hit.
[2024-05-21 08:02:50] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-21 08:02:50] [INFO ] Invariant cache hit.
[2024-05-21 08:02:50] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 08:02:50] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
Running 9 sub problems to find dead transitions.
[2024-05-21 08:02:50] [INFO ] Invariant cache hit.
[2024-05-21 08:02:50] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 2/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 12/23 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 1/24 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/24 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 0/24 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 24/24 variables, and 16 constraints, problems are : Problem set: 0 solved, 9 unsolved in 156 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 12/12 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 2/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 12/23 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 8/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/23 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 1/24 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/24 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/24 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 0/24 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 24/24 variables, and 25 constraints, problems are : Problem set: 0 solved, 9 unsolved in 95 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 12/12 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 257ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 257ms
Finished structural reductions in LTL mode , in 1 iterations and 361 ms. Remains : 12/12 places, 12/12 transitions.
Stuttering acceptance computed with spot in 143 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : CryptoMiner-COL-D03N010-LTLCardinality-04
Product exploration explored 100000 steps with 1 reset in 158 ms.
Product exploration explored 100000 steps with 0 reset in 140 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 29 edges and 12 vertex of which 5 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X p1))]
False Knowledge obtained : [(X p0), (X (NOT p0))]
Knowledge based reduction with 4 factoid took 143 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 150 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
RANDOM walk for 26707 steps (6 resets) in 32 ms. (809 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X p1))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (F (NOT p1)), (F p0)]
Knowledge based reduction with 4 factoid took 173 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 138 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 131 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Support contains 12 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2024-05-21 08:02:52] [INFO ] Invariant cache hit.
[2024-05-21 08:02:52] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-21 08:02:52] [INFO ] Invariant cache hit.
[2024-05-21 08:02:52] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 08:02:52] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
Running 9 sub problems to find dead transitions.
[2024-05-21 08:02:52] [INFO ] Invariant cache hit.
[2024-05-21 08:02:52] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 2/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 12/23 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 1/24 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/24 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 0/24 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 24/24 variables, and 16 constraints, problems are : Problem set: 0 solved, 9 unsolved in 84 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 12/12 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 2/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 12/23 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 8/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/23 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 1/24 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/24 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/24 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 0/24 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 24/24 variables, and 25 constraints, problems are : Problem set: 0 solved, 9 unsolved in 90 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 12/12 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 180ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 180ms
Finished structural reductions in LTL mode , in 1 iterations and 221 ms. Remains : 12/12 places, 12/12 transitions.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 29 edges and 12 vertex of which 5 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.0 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (X p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0)]
Knowledge based reduction with 2 factoid took 102 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 145 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
RANDOM walk for 10035 steps (2 resets) in 7 ms. (1254 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (X p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (F (NOT p1)), (F p0)]
Knowledge based reduction with 2 factoid took 185 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 136 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 135 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 129 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 65 ms.
Product exploration explored 100000 steps with 0 reset in 135 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Support contains 12 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Applied a total of 0 rules in 2 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2024-05-21 08:02:53] [INFO ] Redundant transitions in 1 ms returned []
Running 9 sub problems to find dead transitions.
[2024-05-21 08:02:53] [INFO ] Invariant cache hit.
[2024-05-21 08:02:53] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 2/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 12/23 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 1/24 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/24 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 0/24 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 24/24 variables, and 16 constraints, problems are : Problem set: 0 solved, 9 unsolved in 87 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 12/12 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 2/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 12/23 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 8/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/23 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 1/24 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/24 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/24 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 0/24 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 24/24 variables, and 25 constraints, problems are : Problem set: 0 solved, 9 unsolved in 80 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 12/12 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 173ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 174ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 184 ms. Remains : 12/12 places, 12/12 transitions.
Support contains 12 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2024-05-21 08:02:53] [INFO ] Invariant cache hit.
[2024-05-21 08:02:53] [INFO ] Implicit Places using invariants in 13 ms returned []
[2024-05-21 08:02:53] [INFO ] Invariant cache hit.
[2024-05-21 08:02:53] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 08:02:53] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
Running 9 sub problems to find dead transitions.
[2024-05-21 08:02:53] [INFO ] Invariant cache hit.
[2024-05-21 08:02:53] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 2/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 12/23 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 1/24 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/24 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 0/24 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 24/24 variables, and 16 constraints, problems are : Problem set: 0 solved, 9 unsolved in 68 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 12/12 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 2/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 12/23 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 8/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/23 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 1/24 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/24 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/24 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 0/24 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 24/24 variables, and 25 constraints, problems are : Problem set: 0 solved, 9 unsolved in 74 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 12/12 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 161ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 162ms
Finished structural reductions in LTL mode , in 1 iterations and 200 ms. Remains : 12/12 places, 12/12 transitions.
Treatment of property CryptoMiner-COL-D03N010-LTLCardinality-04 finished in 3754 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&F(G(!p1)))))'
Support contains 8 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Applied a total of 0 rules in 3 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2024-05-21 08:02:54] [INFO ] Invariant cache hit.
[2024-05-21 08:02:54] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-21 08:02:54] [INFO ] Invariant cache hit.
[2024-05-21 08:02:54] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 08:02:54] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2024-05-21 08:02:54] [INFO ] Redundant transitions in 0 ms returned []
Running 9 sub problems to find dead transitions.
[2024-05-21 08:02:54] [INFO ] Invariant cache hit.
[2024-05-21 08:02:54] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 2/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 12/23 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 1/24 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/24 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 0/24 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 24/24 variables, and 16 constraints, problems are : Problem set: 0 solved, 9 unsolved in 96 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 12/12 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 2/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 12/23 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 8/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/23 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 1/24 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/24 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/24 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 0/24 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 24/24 variables, and 25 constraints, problems are : Problem set: 0 solved, 9 unsolved in 79 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 12/12 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 182ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 182ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 236 ms. Remains : 12/12 places, 12/12 transitions.
Stuttering acceptance computed with spot in 153 ms :[(OR (NOT p0) p1), p1, (NOT p0)]
Running random walk in product with property : CryptoMiner-COL-D03N010-LTLCardinality-05
Product exploration explored 100000 steps with 0 reset in 84 ms.
Stack based approach found an accepted trace after 26 steps with 1 reset with depth 24 and stack size 24 in 0 ms.
FORMULA CryptoMiner-COL-D03N010-LTLCardinality-05 FALSE TECHNIQUES STACK_TEST
Treatment of property CryptoMiner-COL-D03N010-LTLCardinality-05 finished in 484 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(p1)&&X(p2)&&p0)))'
Support contains 12 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2024-05-21 08:02:54] [INFO ] Invariant cache hit.
[2024-05-21 08:02:54] [INFO ] Implicit Places using invariants in 15 ms returned []
[2024-05-21 08:02:54] [INFO ] Invariant cache hit.
[2024-05-21 08:02:54] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 08:02:54] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
Running 9 sub problems to find dead transitions.
[2024-05-21 08:02:54] [INFO ] Invariant cache hit.
[2024-05-21 08:02:54] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 2/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 12/23 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 1/24 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/24 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 0/24 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 24/24 variables, and 16 constraints, problems are : Problem set: 0 solved, 9 unsolved in 68 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 12/12 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 2/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 12/23 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 8/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/23 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 1/24 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/24 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/24 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 0/24 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 24/24 variables, and 25 constraints, problems are : Problem set: 0 solved, 9 unsolved in 108 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 12/12 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 198ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 198ms
Finished structural reductions in LTL mode , in 1 iterations and 238 ms. Remains : 12/12 places, 12/12 transitions.
Stuttering acceptance computed with spot in 112 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Running random walk in product with property : CryptoMiner-COL-D03N010-LTLCardinality-06
Product exploration explored 100000 steps with 11876 reset in 181 ms.
Stack based approach found an accepted trace after 130 steps with 17 reset with depth 11 and stack size 11 in 1 ms.
FORMULA CryptoMiner-COL-D03N010-LTLCardinality-06 FALSE TECHNIQUES STACK_TEST
Treatment of property CryptoMiner-COL-D03N010-LTLCardinality-06 finished in 550 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||G(p1))))'
Support contains 12 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2024-05-21 08:02:55] [INFO ] Invariant cache hit.
[2024-05-21 08:02:55] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-21 08:02:55] [INFO ] Invariant cache hit.
[2024-05-21 08:02:55] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 08:02:55] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
Running 9 sub problems to find dead transitions.
[2024-05-21 08:02:55] [INFO ] Invariant cache hit.
[2024-05-21 08:02:55] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 2/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 12/23 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 1/24 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/24 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 0/24 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 24/24 variables, and 16 constraints, problems are : Problem set: 0 solved, 9 unsolved in 68 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 12/12 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 2/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 12/23 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 8/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/23 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 1/24 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/24 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/24 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 0/24 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 24/24 variables, and 25 constraints, problems are : Problem set: 0 solved, 9 unsolved in 82 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 12/12 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 182ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 183ms
Finished structural reductions in LTL mode , in 1 iterations and 232 ms. Remains : 12/12 places, 12/12 transitions.
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CryptoMiner-COL-D03N010-LTLCardinality-07
Product exploration explored 100000 steps with 2 reset in 66 ms.
Stack based approach found an accepted trace after 16 steps with 0 reset with depth 17 and stack size 17 in 0 ms.
FORMULA CryptoMiner-COL-D03N010-LTLCardinality-07 FALSE TECHNIQUES STACK_TEST
Treatment of property CryptoMiner-COL-D03N010-LTLCardinality-07 finished in 418 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(!p0)||(p1 U p2))))'
Support contains 12 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2024-05-21 08:02:55] [INFO ] Invariant cache hit.
[2024-05-21 08:02:55] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-21 08:02:55] [INFO ] Invariant cache hit.
[2024-05-21 08:02:55] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 08:02:55] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2024-05-21 08:02:55] [INFO ] Redundant transitions in 0 ms returned []
Running 9 sub problems to find dead transitions.
[2024-05-21 08:02:55] [INFO ] Invariant cache hit.
[2024-05-21 08:02:55] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 2/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 12/23 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 1/24 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/24 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 0/24 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 24/24 variables, and 16 constraints, problems are : Problem set: 0 solved, 9 unsolved in 102 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 12/12 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 2/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 12/23 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 8/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/23 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 1/24 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/24 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/24 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 0/24 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 24/24 variables, and 25 constraints, problems are : Problem set: 0 solved, 9 unsolved in 110 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 12/12 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 230ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 230ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 281 ms. Remains : 12/12 places, 12/12 transitions.
Stuttering acceptance computed with spot in 101 ms :[(AND p0 (NOT p2)), p0, (AND p0 (NOT p2))]
Running random walk in product with property : CryptoMiner-COL-D03N010-LTLCardinality-09
Product exploration explored 100000 steps with 0 reset in 111 ms.
Stack based approach found an accepted trace after 19 steps with 0 reset with depth 20 and stack size 19 in 0 ms.
FORMULA CryptoMiner-COL-D03N010-LTLCardinality-09 FALSE TECHNIQUES STACK_TEST
Treatment of property CryptoMiner-COL-D03N010-LTLCardinality-09 finished in 511 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(F(p1)))))'
Support contains 12 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2024-05-21 08:02:56] [INFO ] Invariant cache hit.
[2024-05-21 08:02:56] [INFO ] Implicit Places using invariants in 15 ms returned []
[2024-05-21 08:02:56] [INFO ] Invariant cache hit.
[2024-05-21 08:02:56] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 08:02:56] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
[2024-05-21 08:02:56] [INFO ] Redundant transitions in 0 ms returned []
Running 9 sub problems to find dead transitions.
[2024-05-21 08:02:56] [INFO ] Invariant cache hit.
[2024-05-21 08:02:56] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 2/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 12/23 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 1/24 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/24 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 0/24 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 24/24 variables, and 16 constraints, problems are : Problem set: 0 solved, 9 unsolved in 68 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 12/12 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 2/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 12/23 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 8/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/23 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 1/24 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/24 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/24 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 0/24 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 24/24 variables, and 25 constraints, problems are : Problem set: 0 solved, 9 unsolved in 84 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 12/12 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 159ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 160ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 202 ms. Remains : 12/12 places, 12/12 transitions.
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CryptoMiner-COL-D03N010-LTLCardinality-11
Product exploration explored 100000 steps with 0 reset in 61 ms.
Product exploration explored 100000 steps with 0 reset in 69 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 29 edges and 12 vertex of which 5 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.0 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 5 factoid took 253 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 76 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 40016 steps (8 resets) in 20 ms. (1905 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 65 ms. (606 steps per ms) remains 1/1 properties
[2024-05-21 08:02:56] [INFO ] Invariant cache hit.
[2024-05-21 08:02:56] [INFO ] State equation strengthened by 3 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf1 is UNSAT
After SMT solving in domain Real declared 24/24 variables, and 13 constraints, problems are : Problem set: 1 solved, 0 unsolved in 27 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 12/12 constraints, ReadFeed: 0/3 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 30ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (G (OR p1 p0))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F p1), (F (NOT (AND (NOT p1) p0))), (F (NOT p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 12 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-COL-D03N010-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CryptoMiner-COL-D03N010-LTLCardinality-11 finished in 824 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((!p0||G(p0)))||F(G(!p1))))'
Support contains 8 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Graph (trivial) has 4 edges and 12 vertex of which 4 / 12 are part of one of the 1 SCC in 3 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Applied a total of 1 rules in 13 ms. Remains 9 /12 variables (removed 3) and now considering 9/12 (removed 3) transitions.
// Phase 1: matrix 9 rows 9 cols
[2024-05-21 08:02:56] [INFO ] Computed 1 invariants in 0 ms
[2024-05-21 08:02:56] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-05-21 08:02:56] [INFO ] Invariant cache hit.
[2024-05-21 08:02:57] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 08:02:57] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2024-05-21 08:02:57] [INFO ] Redundant transitions in 1 ms returned []
Running 6 sub problems to find dead transitions.
[2024-05-21 08:02:57] [INFO ] Invariant cache hit.
[2024-05-21 08:02:57] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/16 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/16 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 1/17 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/17 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 0/17 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 17/18 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 65 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 9/9 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/16 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/16 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/16 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 1/17 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/17 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/17 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 0/17 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 17/18 variables, and 19 constraints, problems are : Problem set: 0 solved, 6 unsolved in 53 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 9/9 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 132ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 133ms
Starting structural reductions in SI_LTL mode, iteration 1 : 9/12 places, 9/12 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 200 ms. Remains : 9/12 places, 9/12 transitions.
Stuttering acceptance computed with spot in 103 ms :[false, (AND (NOT p0) p1), p1]
Running random walk in product with property : CryptoMiner-COL-D03N010-LTLCardinality-12
Product exploration explored 100000 steps with 0 reset in 112 ms.
Product exploration explored 100000 steps with 0 reset in 92 ms.
Computed a total of 9 stabilizing places and 8 stable transitions
Graph (complete) has 26 edges and 9 vertex of which 1 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Computed a total of 9 stabilizing places and 8 stable transitions
Detected a total of 9/9 stabilizing places and 8/9 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 4 factoid took 237 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 94 ms :[false, (AND (NOT p0) p1), p1]
RANDOM walk for 27 steps (0 resets) in 4 ms. (5 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p1), (F p0)]
Knowledge based reduction with 4 factoid took 317 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 104 ms :[false, (AND (NOT p0) p1), p1]
Stuttering acceptance computed with spot in 109 ms :[false, (AND (NOT p0) p1), p1]
Support contains 8 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 9/9 transitions.
Applied a total of 0 rules in 4 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2024-05-21 08:02:58] [INFO ] Invariant cache hit.
[2024-05-21 08:02:58] [INFO ] Implicit Places using invariants in 15 ms returned []
[2024-05-21 08:02:58] [INFO ] Invariant cache hit.
[2024-05-21 08:02:58] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 08:02:58] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
[2024-05-21 08:02:58] [INFO ] Redundant transitions in 1 ms returned []
Running 6 sub problems to find dead transitions.
[2024-05-21 08:02:58] [INFO ] Invariant cache hit.
[2024-05-21 08:02:58] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/16 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/16 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 1/17 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/17 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 0/17 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 17/18 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 48 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 9/9 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/16 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/16 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/16 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 1/17 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/17 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/17 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 0/17 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 17/18 variables, and 19 constraints, problems are : Problem set: 0 solved, 6 unsolved in 51 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 9/9 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 100ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 101ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 146 ms. Remains : 9/9 places, 9/9 transitions.
Computed a total of 9 stabilizing places and 8 stable transitions
Graph (complete) has 26 edges and 9 vertex of which 1 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.0 ms
Computed a total of 9 stabilizing places and 8 stable transitions
Detected a total of 9/9 stabilizing places and 8/9 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 4 factoid took 323 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 105 ms :[false, (AND (NOT p0) p1), p1]
RANDOM walk for 38 steps (0 resets) in 4 ms. (7 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p1), (F p0)]
Knowledge based reduction with 4 factoid took 347 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 112 ms :[false, (AND (NOT p0) p1), p1]
Stuttering acceptance computed with spot in 114 ms :[false, (AND (NOT p0) p1), p1]
Stuttering acceptance computed with spot in 105 ms :[false, (AND (NOT p0) p1), p1]
Product exploration explored 100000 steps with 0 reset in 58 ms.
Product exploration explored 100000 steps with 0 reset in 65 ms.
Support contains 8 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 9/9 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2024-05-21 08:02:59] [INFO ] Invariant cache hit.
[2024-05-21 08:02:59] [INFO ] Implicit Places using invariants in 15 ms returned []
[2024-05-21 08:02:59] [INFO ] Invariant cache hit.
[2024-05-21 08:02:59] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 08:02:59] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2024-05-21 08:02:59] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2024-05-21 08:02:59] [INFO ] Invariant cache hit.
[2024-05-21 08:02:59] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/16 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/16 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 1/17 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/17 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 0/17 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 17/18 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 47 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 9/9 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/16 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/16 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/16 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 1/17 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/17 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/17 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 0/17 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 17/18 variables, and 19 constraints, problems are : Problem set: 0 solved, 6 unsolved in 52 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 9/9 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 120ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 120ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 167 ms. Remains : 9/9 places, 9/9 transitions.
Treatment of property CryptoMiner-COL-D03N010-LTLCardinality-12 finished in 2988 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U G(p1)))'
Support contains 8 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Graph (trivial) has 4 edges and 12 vertex of which 4 / 12 are part of one of the 1 SCC in 0 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Applied a total of 1 rules in 0 ms. Remains 9 /12 variables (removed 3) and now considering 9/12 (removed 3) transitions.
[2024-05-21 08:02:59] [INFO ] Invariant cache hit.
[2024-05-21 08:02:59] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-05-21 08:02:59] [INFO ] Invariant cache hit.
[2024-05-21 08:02:59] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 08:02:59] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2024-05-21 08:02:59] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2024-05-21 08:02:59] [INFO ] Invariant cache hit.
[2024-05-21 08:02:59] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/16 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/16 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 1/17 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/17 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 0/17 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 17/18 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 58 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 9/9 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/16 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/16 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/16 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 1/17 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/17 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/17 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 0/17 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 17/18 variables, and 19 constraints, problems are : Problem set: 0 solved, 6 unsolved in 51 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 9/9 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 125ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 125ms
Starting structural reductions in SI_LTL mode, iteration 1 : 9/12 places, 9/12 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 180 ms. Remains : 9/12 places, 9/12 transitions.
Stuttering acceptance computed with spot in 107 ms :[(NOT p1), true, (AND p1 (NOT p0)), (NOT p1)]
Running random walk in product with property : CryptoMiner-COL-D03N010-LTLCardinality-13
Product exploration explored 100000 steps with 0 reset in 82 ms.
Product exploration explored 100000 steps with 0 reset in 141 ms.
Computed a total of 9 stabilizing places and 8 stable transitions
Graph (complete) has 26 edges and 9 vertex of which 1 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Computed a total of 9 stabilizing places and 8 stable transitions
Detected a total of 9/9 stabilizing places and 8/9 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 12 factoid took 548 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[true, (NOT p1)]
RANDOM walk for 49 steps (1 resets) in 4 ms. (9 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X p0)), (X (X (NOT p0))), (F (NOT p1))]
Property proved to be false thanks to negative knowledge :(F (NOT p1))
Knowledge based reduction with 12 factoid took 615 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CryptoMiner-COL-D03N010-LTLCardinality-13 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CryptoMiner-COL-D03N010-LTLCardinality-13 finished in 1738 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((!p1&&X(G(!p2))))||p0)))'
Support contains 12 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
// Phase 1: matrix 12 rows 12 cols
[2024-05-21 08:03:01] [INFO ] Computed 1 invariants in 0 ms
[2024-05-21 08:03:01] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-05-21 08:03:01] [INFO ] Invariant cache hit.
[2024-05-21 08:03:01] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 08:03:01] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
Running 9 sub problems to find dead transitions.
[2024-05-21 08:03:01] [INFO ] Invariant cache hit.
[2024-05-21 08:03:01] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 2/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 12/23 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 1/24 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/24 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 0/24 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 24/24 variables, and 16 constraints, problems are : Problem set: 0 solved, 9 unsolved in 66 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 12/12 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 2/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 12/23 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 8/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/23 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 1/24 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/24 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/24 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 0/24 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 24/24 variables, and 25 constraints, problems are : Problem set: 0 solved, 9 unsolved in 75 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 12/12 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 168ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 169ms
Finished structural reductions in LTL mode , in 1 iterations and 219 ms. Remains : 12/12 places, 12/12 transitions.
Stuttering acceptance computed with spot in 119 ms :[true, (OR (AND (NOT p0) p1) (AND (NOT p0) p2)), (OR (AND (NOT p0) p2) (AND (NOT p0) p1)), (OR p2 p1)]
Running random walk in product with property : CryptoMiner-COL-D03N010-LTLCardinality-15
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA CryptoMiner-COL-D03N010-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-COL-D03N010-LTLCardinality-15 finished in 351 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||G(F(p1)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((!p0||G(p0)))||F(G(!p1))))'
[2024-05-21 08:03:02] [INFO ] Flatten gal took : 5 ms
[2024-05-21 08:03:02] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-05-21 08:03:02] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 12 places, 12 transitions and 34 arcs took 2 ms.
Total runtime 15982 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running CryptoMiner-COL-D03N010

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/413/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 12
TRANSITIONS: 12
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.000s, Sys 0.001s]


SAVING FILE /home/mcc/execution/413/model (.net / .def) ...
EXPORT TIME: [User 0.000s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 1398
MODEL NAME: /home/mcc/execution/413/model
12 places, 12 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA CryptoMiner-COL-D03N010-LTLCardinality-12 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA CryptoMiner-COL-D03N010-LTLCardinality-04 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716278582830

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML

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-COL-D03N010"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is CryptoMiner-COL-D03N010, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r091-tall-171624187400299"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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