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-171624187500355.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-D20N100, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r091-tall-171624187500355
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 456K
-rw-r--r-- 1 mcc users 7.9K Apr 12 12:31 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Apr 12 12:31 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Apr 12 12:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Apr 12 12:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:35 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K 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 17K Apr 22 14:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.9K Apr 12 12:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 80K Apr 12 12:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Apr 12 12:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 114K Apr 12 12:33 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-D20N100-LTLCardinality-00
FORMULA_NAME CryptoMiner-COL-D20N100-LTLCardinality-01
FORMULA_NAME CryptoMiner-COL-D20N100-LTLCardinality-02
FORMULA_NAME CryptoMiner-COL-D20N100-LTLCardinality-03
FORMULA_NAME CryptoMiner-COL-D20N100-LTLCardinality-04
FORMULA_NAME CryptoMiner-COL-D20N100-LTLCardinality-05
FORMULA_NAME CryptoMiner-COL-D20N100-LTLCardinality-06
FORMULA_NAME CryptoMiner-COL-D20N100-LTLCardinality-07
FORMULA_NAME CryptoMiner-COL-D20N100-LTLCardinality-08
FORMULA_NAME CryptoMiner-COL-D20N100-LTLCardinality-09
FORMULA_NAME CryptoMiner-COL-D20N100-LTLCardinality-10
FORMULA_NAME CryptoMiner-COL-D20N100-LTLCardinality-11
FORMULA_NAME CryptoMiner-COL-D20N100-LTLCardinality-12
FORMULA_NAME CryptoMiner-COL-D20N100-LTLCardinality-13
FORMULA_NAME CryptoMiner-COL-D20N100-LTLCardinality-14
FORMULA_NAME CryptoMiner-COL-D20N100-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716280935095

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-D20N100
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 08:42:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-21 08:42:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 08:42:16] [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:42:16] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-21 08:42:16] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 529 ms
[2024-05-21 08:42:16] [INFO ] Imported 3 HL places and 5 HL transitions for a total of 63 PT places and 105.0 transition bindings in 18 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 19 ms.
Working with output stream class java.io.PrintStream
[2024-05-21 08:42:17] [INFO ] Built PT skeleton of HLPN with 3 places and 5 transitions 14 arcs in 4 ms.
[2024-05-21 08:42:17] [INFO ] Skeletonized 16 HLPN properties in 8 ms.
Initial state reduction rules removed 2 formulas.
FORMULA CryptoMiner-COL-D20N100-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CryptoMiner-COL-D20N100-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 3 stabilizing places and 3 stable transitions
Remains 14 properties that can be checked using skeleton over-approximation.
Computed a total of 3 stabilizing places and 3 stable transitions
RANDOM walk for 40239 steps (727 resets) in 231 ms. (173 steps per ms) remains 3/18 properties
BEST_FIRST walk for 40004 steps (96 resets) in 305 ms. (130 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (96 resets) in 260 ms. (153 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (96 resets) in 294 ms. (135 steps per ms) remains 3/3 properties
[2024-05-21 08:42:17] [INFO ] Flow matrix only has 4 transitions (discarded 1 similar events)
// Phase 1: matrix 4 rows 3 cols
[2024-05-21 08:42:17] [INFO ] Computed 0 invariants in 3 ms
[2024-05-21 08:42:17] [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 AtomicPropp3 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp11 is UNSAT
After SMT solving in domain Real declared 4/7 variables, and 2 constraints, problems are : Problem set: 3 solved, 0 unsolved in 114 ms.
Refiners :[State Equation: 2/3 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 146ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 3 atomic propositions for a total of 14 simplifications.
FORMULA CryptoMiner-COL-D20N100-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CryptoMiner-COL-D20N100-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 08:42:17] [INFO ] Flatten gal took : 13 ms
[2024-05-21 08:42:17] [INFO ] Flatten gal took : 2 ms
Arc [0:1*[(MOD (ADD $x 1) 21)]] contains successor/predecessor on variables of sort CD
[2024-05-21 08:42:17] [INFO ] Unfolded HLPN to a Petri net with 63 places and 63 transitions 187 arcs in 13 ms.
[2024-05-21 08:42:17] [INFO ] Unfolded 12 HLPN properties in 1 ms.
Support contains 63 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 63/63 transitions.
Applied a total of 0 rules in 5 ms. Remains 63 /63 variables (removed 0) and now considering 63/63 (removed 0) transitions.
// Phase 1: matrix 63 rows 63 cols
[2024-05-21 08:42:17] [INFO ] Computed 1 invariants in 5 ms
[2024-05-21 08:42:17] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-21 08:42:17] [INFO ] Invariant cache hit.
[2024-05-21 08:42:17] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 08:42:17] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
Running 60 sub problems to find dead transitions.
[2024-05-21 08:42:17] [INFO ] Invariant cache hit.
[2024-05-21 08:42:17] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 2/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 63/125 variables, 62/63 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 1/126 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (OVERLAPS) 0/126 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 126/126 variables, and 84 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1465 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 2/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 63/125 variables, 62/63 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 59/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 1/126 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/126 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/126 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (OVERLAPS) 0/126 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 126/126 variables, and 144 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1783 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
After SMT, in 3269ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 3274ms
Finished structural reductions in LTL mode , in 1 iterations and 3415 ms. Remains : 63/63 places, 63/63 transitions.
Support contains 63 out of 63 places after structural reductions.
[2024-05-21 08:42:21] [INFO ] Flatten gal took : 9 ms
[2024-05-21 08:42:21] [INFO ] Flatten gal took : 8 ms
[2024-05-21 08:42:21] [INFO ] Input system was already deterministic with 63 transitions.
RANDOM walk for 40227 steps (11 resets) in 145 ms. (275 steps per ms) remains 2/17 properties
BEST_FIRST walk for 40003 steps (8 resets) in 352 ms. (113 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 491 ms. (81 steps per ms) remains 2/2 properties
[2024-05-21 08:42:21] [INFO ] Invariant cache hit.
[2024-05-21 08:42:21] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 21/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp10 is UNSAT
After SMT solving in domain Real declared 126/126 variables, and 64 constraints, problems are : Problem set: 2 solved, 0 unsolved in 65 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 71ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA CryptoMiner-COL-D20N100-LTLCardinality-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 11 simplifications.
Computed a total of 41 stabilizing places and 41 stable transitions
Graph (complete) has 165 edges and 63 vertex of which 22 are kept as prefixes of interest. Removing 41 places using SCC suffix rule.1 ms
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)&&F((G(p2)&&p1)))))'
Support contains 42 out of 63 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 63/63 transitions.
Graph (complete) has 165 edges and 63 vertex of which 62 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 6 ms. Remains 62 /63 variables (removed 1) and now considering 63/63 (removed 0) transitions.
// Phase 1: matrix 63 rows 62 cols
[2024-05-21 08:42:21] [INFO ] Computed 0 invariants in 1 ms
[2024-05-21 08:42:22] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-21 08:42:22] [INFO ] Invariant cache hit.
[2024-05-21 08:42:22] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 08:42:22] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 97 ms to find 0 implicit places.
[2024-05-21 08:42:22] [INFO ] Redundant transitions in 1 ms returned []
Running 60 sub problems to find dead transitions.
[2024-05-21 08:42:22] [INFO ] Invariant cache hit.
[2024-05-21 08:42:22] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 63/123 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 2/125 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 0/125 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 125/125 variables, and 82 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1282 ms.
Refiners :[State Equation: 62/62 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 63/123 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 57/137 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (OVERLAPS) 2/125 variables, 2/139 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 3/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (OVERLAPS) 0/125 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 125/125 variables, and 142 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1695 ms.
Refiners :[State Equation: 62/62 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
After SMT, in 2988ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 2989ms
Starting structural reductions in SI_LTL mode, iteration 1 : 62/63 places, 63/63 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3099 ms. Remains : 62/63 places, 63/63 transitions.
Stuttering acceptance computed with spot in 279 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (OR (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : CryptoMiner-COL-D20N100-LTLCardinality-01
Product exploration explored 100000 steps with 0 reset in 426 ms.
Product exploration explored 100000 steps with 0 reset in 372 ms.
Computed a total of 40 stabilizing places and 41 stable transitions
Graph (complete) has 162 edges and 62 vertex of which 22 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.1 ms
Computed a total of 40 stabilizing places and 41 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT p2)), (X p0), (X (NOT (AND p1 p2))), (X (OR (NOT p1) (NOT p2))), (X (NOT p1)), (X (X (NOT p2))), (X (X p0)), (X (X (NOT (AND p1 p2)))), (X (X (OR (NOT p1) (NOT p2)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 117 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter insensitive) to 4 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 155 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (OR (NOT p2) (NOT p1)), (NOT p2)]
Reduction of identical properties reduced properties to check from 5 to 3
RANDOM walk for 30321 steps (6 resets) in 26 ms. (1123 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT p2)), (X p0), (X (NOT (AND p1 p2))), (X (OR (NOT p1) (NOT p2))), (X (NOT p1)), (X (X (NOT p2))), (X (X p0)), (X (X (NOT (AND p1 p2)))), (X (X (OR (NOT p1) (NOT p2)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR (NOT p1) (NOT p2)))), (F p2), (F (NOT (OR (NOT p1) (NOT p2)))), (F (NOT p0))]
Knowledge based reduction with 11 factoid took 240 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter insensitive) to 4 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 152 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (OR (NOT p2) (NOT p1)), (NOT p2)]
Stuttering acceptance computed with spot in 157 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (OR (NOT p2) (NOT p1)), (NOT p2)]
[2024-05-21 08:42:27] [INFO ] Invariant cache hit.
[2024-05-21 08:42:27] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2024-05-21 08:42:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 08:42:27] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2024-05-21 08:42:27] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 08:42:27] [INFO ] [Nat]Added 20 Read/Feed constraints in 5 ms returned sat
[2024-05-21 08:42:27] [INFO ] Computed and/alt/rep : 60/100/60 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-21 08:42:27] [INFO ] Added : 19 causal constraints over 4 iterations in 31 ms. Result :sat
Could not prove EG (NOT p1)
[2024-05-21 08:42:27] [INFO ] Invariant cache hit.
Proved EG (NOT p2)
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT p2)), (X p0), (X (NOT (AND p1 p2))), (X (OR (NOT p1) (NOT p2))), (X (NOT p1)), (X (X (NOT p2))), (X (X p0)), (X (X (NOT (AND p1 p2)))), (X (X (OR (NOT p1) (NOT p2)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR (NOT p1) (NOT p2)))), (F p2), (F (NOT (OR (NOT p1) (NOT p2)))), (F (NOT p0)), (G (NOT p2))]
Property proved to be false thanks to negative knowledge :(G (NOT p2))
Knowledge based reduction with 11 factoid took 281 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CryptoMiner-COL-D20N100-LTLCardinality-01 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CryptoMiner-COL-D20N100-LTLCardinality-01 finished in 5640 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(p1)||G(!p1))))'
Support contains 63 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 63/63 transitions.
Applied a total of 0 rules in 1 ms. Remains 63 /63 variables (removed 0) and now considering 63/63 (removed 0) transitions.
// Phase 1: matrix 63 rows 63 cols
[2024-05-21 08:42:27] [INFO ] Computed 1 invariants in 0 ms
[2024-05-21 08:42:27] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-21 08:42:27] [INFO ] Invariant cache hit.
[2024-05-21 08:42:27] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 08:42:27] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
Running 60 sub problems to find dead transitions.
[2024-05-21 08:42:27] [INFO ] Invariant cache hit.
[2024-05-21 08:42:27] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 2/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 63/125 variables, 62/63 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 1/126 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (OVERLAPS) 0/126 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 126/126 variables, and 84 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1214 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 2/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 63/125 variables, 62/63 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 59/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 1/126 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/126 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/126 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (OVERLAPS) 0/126 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 126/126 variables, and 144 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1636 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
After SMT, in 2860ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 2861ms
Finished structural reductions in LTL mode , in 1 iterations and 2927 ms. Remains : 63/63 places, 63/63 transitions.
Stuttering acceptance computed with spot in 157 ms :[true, false, false, (NOT p1), p1]
Running random walk in product with property : CryptoMiner-COL-D20N100-LTLCardinality-03
Product exploration explored 100000 steps with 50000 reset in 163 ms.
Product exploration explored 100000 steps with 50000 reset in 126 ms.
Computed a total of 41 stabilizing places and 41 stable transitions
Graph (complete) has 165 edges and 63 vertex of which 22 are kept as prefixes of interest. Removing 41 places using SCC suffix rule.1 ms
Computed a total of 41 stabilizing places and 41 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 19 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CryptoMiner-COL-D20N100-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CryptoMiner-COL-D20N100-LTLCardinality-03 finished in 3415 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))'
Support contains 42 out of 63 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 63/63 transitions.
Applied a total of 0 rules in 7 ms. Remains 63 /63 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2024-05-21 08:42:30] [INFO ] Invariant cache hit.
[2024-05-21 08:42:31] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-21 08:42:31] [INFO ] Invariant cache hit.
[2024-05-21 08:42:31] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 08:42:31] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2024-05-21 08:42:31] [INFO ] Redundant transitions in 0 ms returned []
Running 60 sub problems to find dead transitions.
[2024-05-21 08:42:31] [INFO ] Invariant cache hit.
[2024-05-21 08:42:31] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 2/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 63/125 variables, 62/63 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 1/126 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (OVERLAPS) 0/126 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 126/126 variables, and 84 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1190 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 2/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 63/125 variables, 62/63 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 59/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 1/126 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/126 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/126 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (OVERLAPS) 0/126 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 126/126 variables, and 144 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1742 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
After SMT, in 2943ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 2944ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 3016 ms. Remains : 63/63 places, 63/63 transitions.
Stuttering acceptance computed with spot in 36 ms :[p0]
Running random walk in product with property : CryptoMiner-COL-D20N100-LTLCardinality-04
Product exploration explored 100000 steps with 0 reset in 187 ms.
Product exploration explored 100000 steps with 0 reset in 236 ms.
Computed a total of 41 stabilizing places and 41 stable transitions
Graph (complete) has 165 edges and 63 vertex of which 22 are kept as prefixes of interest. Removing 41 places using SCC suffix rule.1 ms
Computed a total of 41 stabilizing places and 41 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 81 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 45 ms :[p0]
RANDOM walk for 33750 steps (8 resets) in 27 ms. (1205 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 84 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[p0]
Stuttering acceptance computed with spot in 28 ms :[p0]
[2024-05-21 08:42:34] [INFO ] Invariant cache hit.
Proved EG p0
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (G p0)]
Property proved to be false thanks to negative knowledge :(G p0)
Knowledge based reduction with 3 factoid took 104 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CryptoMiner-COL-D20N100-LTLCardinality-04 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CryptoMiner-COL-D20N100-LTLCardinality-04 finished in 3933 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(X(X(F(p0))))))'
Support contains 21 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 63/63 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 62 transition count 63
Applied a total of 1 rules in 8 ms. Remains 62 /63 variables (removed 1) and now considering 63/63 (removed 0) transitions.
// Phase 1: matrix 63 rows 62 cols
[2024-05-21 08:42:34] [INFO ] Computed 0 invariants in 3 ms
[2024-05-21 08:42:34] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-21 08:42:34] [INFO ] Invariant cache hit.
[2024-05-21 08:42:34] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 08:42:35] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
Running 60 sub problems to find dead transitions.
[2024-05-21 08:42:35] [INFO ] Invariant cache hit.
[2024-05-21 08:42:35] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 63/123 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 2/125 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 0/125 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 125/125 variables, and 82 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1191 ms.
Refiners :[State Equation: 62/62 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 63/123 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 57/137 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (OVERLAPS) 2/125 variables, 2/139 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 3/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (OVERLAPS) 0/125 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 125/125 variables, and 142 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1615 ms.
Refiners :[State Equation: 62/62 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
After SMT, in 2814ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 2816ms
Starting structural reductions in LTL mode, iteration 1 : 62/63 places, 63/63 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2909 ms. Remains : 62/63 places, 63/63 transitions.
Stuttering acceptance computed with spot in 202 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CryptoMiner-COL-D20N100-LTLCardinality-05
Product exploration explored 100000 steps with 0 reset in 155 ms.
Product exploration explored 100000 steps with 0 reset in 203 ms.
Computed a total of 40 stabilizing places and 41 stable transitions
Graph (complete) has 162 edges and 62 vertex of which 22 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.1 ms
Computed a total of 40 stabilizing places and 41 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 79 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 173 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 20338 steps (4 resets) in 8 ms. (2259 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 1 factoid took 71 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 186 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 194 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
[2024-05-21 08:42:39] [INFO ] Invariant cache hit.
Proved EG (NOT p0)
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(F p0), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 1 factoid took 101 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CryptoMiner-COL-D20N100-LTLCardinality-05 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CryptoMiner-COL-D20N100-LTLCardinality-05 finished in 4353 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||X(p0)) U (G((p0||X(p0)))||((p0||X(p0))&&(!p0 U p1))))))'
Support contains 63 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 63/63 transitions.
Applied a total of 0 rules in 1 ms. Remains 63 /63 variables (removed 0) and now considering 63/63 (removed 0) transitions.
// Phase 1: matrix 63 rows 63 cols
[2024-05-21 08:42:39] [INFO ] Computed 1 invariants in 1 ms
[2024-05-21 08:42:39] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-05-21 08:42:39] [INFO ] Invariant cache hit.
[2024-05-21 08:42:39] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 08:42:39] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
Running 60 sub problems to find dead transitions.
[2024-05-21 08:42:39] [INFO ] Invariant cache hit.
[2024-05-21 08:42:39] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 2/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 63/125 variables, 62/63 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 1/126 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (OVERLAPS) 0/126 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 126/126 variables, and 84 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1267 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 2/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 63/125 variables, 62/63 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 59/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 1/126 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/126 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/126 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (OVERLAPS) 0/126 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 126/126 variables, and 144 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1740 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
After SMT, in 3015ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 3016ms
Finished structural reductions in LTL mode , in 1 iterations and 3090 ms. Remains : 63/63 places, 63/63 transitions.
Stuttering acceptance computed with spot in 184 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CryptoMiner-COL-D20N100-LTLCardinality-06
Product exploration explored 100000 steps with 0 reset in 477 ms.
Product exploration explored 100000 steps with 0 reset in 539 ms.
Computed a total of 41 stabilizing places and 41 stable transitions
Graph (complete) has 165 edges and 63 vertex of which 22 are kept as prefixes of interest. Removing 41 places using SCC suffix rule.1 ms
Computed a total of 41 stabilizing places and 41 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 121 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 162 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40206 steps (10 resets) in 17 ms. (2233 steps per ms) remains 1/5 properties
BEST_FIRST walk for 800 steps (0 resets) in 6 ms. (114 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR p0 p1))), (F (NOT (AND p0 (NOT p1)))), (F (NOT (OR p0 (NOT p1)))), (F (NOT p0))]
Knowledge based reduction with 11 factoid took 231 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 163 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 167 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 63 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 63/63 transitions.
Applied a total of 0 rules in 1 ms. Remains 63 /63 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2024-05-21 08:42:44] [INFO ] Invariant cache hit.
[2024-05-21 08:42:44] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-21 08:42:44] [INFO ] Invariant cache hit.
[2024-05-21 08:42:44] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 08:42:44] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
Running 60 sub problems to find dead transitions.
[2024-05-21 08:42:44] [INFO ] Invariant cache hit.
[2024-05-21 08:42:44] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 2/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 63/125 variables, 62/63 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 1/126 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (OVERLAPS) 0/126 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 126/126 variables, and 84 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1233 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 2/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 63/125 variables, 62/63 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 59/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 1/126 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/126 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/126 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (OVERLAPS) 0/126 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 126/126 variables, and 144 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1720 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
After SMT, in 2962ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 2962ms
Finished structural reductions in LTL mode , in 1 iterations and 3046 ms. Remains : 63/63 places, 63/63 transitions.
Computed a total of 41 stabilizing places and 41 stable transitions
Graph (complete) has 165 edges and 63 vertex of which 22 are kept as prefixes of interest. Removing 41 places using SCC suffix rule.1 ms
Computed a total of 41 stabilizing places and 41 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 97 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 188 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40227 steps (11 resets) in 29 ms. (1340 steps per ms) remains 1/5 properties
BEST_FIRST walk for 800 steps (0 resets) in 5 ms. (133 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR p0 p1))), (F (NOT (AND p0 (NOT p1)))), (F (NOT (OR p0 (NOT p1)))), (F (NOT p0))]
Knowledge based reduction with 11 factoid took 266 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 335 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 181 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 167 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 411 ms.
Product exploration explored 100000 steps with 0 reset in 454 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 183 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 63 out of 63 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 63/63 transitions.
Applied a total of 0 rules in 4 ms. Remains 63 /63 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2024-05-21 08:42:50] [INFO ] Redundant transitions in 1 ms returned []
Running 60 sub problems to find dead transitions.
[2024-05-21 08:42:50] [INFO ] Invariant cache hit.
[2024-05-21 08:42:50] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 2/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 63/125 variables, 62/63 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 1/126 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (OVERLAPS) 0/126 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 126/126 variables, and 84 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1236 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 2/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 63/125 variables, 62/63 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 59/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 1/126 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/126 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/126 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (OVERLAPS) 0/126 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 126/126 variables, and 144 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1805 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
After SMT, in 3052ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 3053ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 3066 ms. Remains : 63/63 places, 63/63 transitions.
Support contains 63 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 63/63 transitions.
Applied a total of 0 rules in 2 ms. Remains 63 /63 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2024-05-21 08:42:53] [INFO ] Invariant cache hit.
[2024-05-21 08:42:53] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-21 08:42:53] [INFO ] Invariant cache hit.
[2024-05-21 08:42:53] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 08:42:53] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
Running 60 sub problems to find dead transitions.
[2024-05-21 08:42:53] [INFO ] Invariant cache hit.
[2024-05-21 08:42:53] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 2/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 63/125 variables, 62/63 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 1/126 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (OVERLAPS) 0/126 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 126/126 variables, and 84 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1233 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 2/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 63/125 variables, 62/63 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 59/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 1/126 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/126 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/126 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (OVERLAPS) 0/126 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 126/126 variables, and 144 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1735 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
After SMT, in 2976ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 2977ms
Finished structural reductions in LTL mode , in 1 iterations and 3055 ms. Remains : 63/63 places, 63/63 transitions.
Treatment of property CryptoMiner-COL-D20N100-LTLCardinality-06 finished in 16942 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(F((p0&&X(F(p1)))))))'
Support contains 63 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 63/63 transitions.
Applied a total of 0 rules in 1 ms. Remains 63 /63 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2024-05-21 08:42:56] [INFO ] Invariant cache hit.
[2024-05-21 08:42:56] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-21 08:42:56] [INFO ] Invariant cache hit.
[2024-05-21 08:42:56] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 08:42:56] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
Running 60 sub problems to find dead transitions.
[2024-05-21 08:42:56] [INFO ] Invariant cache hit.
[2024-05-21 08:42:56] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 2/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 63/125 variables, 62/63 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 1/126 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (OVERLAPS) 0/126 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 126/126 variables, and 84 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1226 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 2/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 63/125 variables, 62/63 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 59/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 1/126 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/126 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/126 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (OVERLAPS) 0/126 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 126/126 variables, and 144 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1759 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
After SMT, in 2998ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 2999ms
Finished structural reductions in LTL mode , in 1 iterations and 3064 ms. Remains : 63/63 places, 63/63 transitions.
Stuttering acceptance computed with spot in 162 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : CryptoMiner-COL-D20N100-LTLCardinality-07
Product exploration explored 100000 steps with 0 reset in 188 ms.
Product exploration explored 100000 steps with 0 reset in 241 ms.
Computed a total of 41 stabilizing places and 41 stable transitions
Graph (complete) has 165 edges and 63 vertex of which 22 are kept as prefixes of interest. Removing 41 places using SCC suffix rule.1 ms
Computed a total of 41 stabilizing places and 41 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 93 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 164 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
RANDOM walk for 7116 steps (2 resets) in 6 ms. (1016 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p1), (F p0)]
Knowledge based reduction with 2 factoid took 136 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 168 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 149 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
[2024-05-21 08:43:00] [INFO ] Invariant cache hit.
Proved EG (NOT p0)
[2024-05-21 08:43:00] [INFO ] Invariant cache hit.
[2024-05-21 08:43:00] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-21 08:43:00] [INFO ] [Real]Absence check using state equation in 11 ms returned unsat
Proved EG (NOT p1)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p1), (F p0), (G (NOT p0)), (G (NOT p1))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 2 factoid took 130 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CryptoMiner-COL-D20N100-LTLCardinality-07 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CryptoMiner-COL-D20N100-LTLCardinality-07 finished in 4631 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 42 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 63/63 transitions.
Applied a total of 0 rules in 3 ms. Remains 63 /63 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2024-05-21 08:43:00] [INFO ] Invariant cache hit.
[2024-05-21 08:43:00] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-21 08:43:00] [INFO ] Invariant cache hit.
[2024-05-21 08:43:00] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 08:43:00] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
Running 60 sub problems to find dead transitions.
[2024-05-21 08:43:00] [INFO ] Invariant cache hit.
[2024-05-21 08:43:00] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 2/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 63/125 variables, 62/63 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 1/126 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (OVERLAPS) 0/126 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 126/126 variables, and 84 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1237 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 2/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 63/125 variables, 62/63 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 59/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 1/126 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/126 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/126 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (OVERLAPS) 0/126 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 126/126 variables, and 144 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1704 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
After SMT, in 2951ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 2952ms
Finished structural reductions in LTL mode , in 1 iterations and 3017 ms. Remains : 63/63 places, 63/63 transitions.
Stuttering acceptance computed with spot in 121 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : CryptoMiner-COL-D20N100-LTLCardinality-08
Product exploration explored 100000 steps with 0 reset in 210 ms.
Product exploration explored 100000 steps with 0 reset in 459 ms.
Computed a total of 41 stabilizing places and 41 stable transitions
Graph (complete) has 165 edges and 63 vertex of which 22 are kept as prefixes of interest. Removing 41 places using SCC suffix rule.1 ms
Computed a total of 41 stabilizing places and 41 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X p1)]
False Knowledge obtained : [(X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (AND p1 p0)), (X (NOT (AND p1 p0))), (X p0), (X (NOT p0)), (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))), (X (X p1)), (X (X (NOT p1)))]
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be false thanks to negative knowledge :(X (X (NOT p1)))
Knowledge based reduction with 2 factoid took 412 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CryptoMiner-COL-D20N100-LTLCardinality-08 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CryptoMiner-COL-D20N100-LTLCardinality-08 finished in 4241 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))&&F(p1)))'
Support contains 63 out of 63 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 63/63 transitions.
Applied a total of 0 rules in 4 ms. Remains 63 /63 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2024-05-21 08:43:05] [INFO ] Invariant cache hit.
[2024-05-21 08:43:05] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-21 08:43:05] [INFO ] Invariant cache hit.
[2024-05-21 08:43:05] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 08:43:05] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2024-05-21 08:43:05] [INFO ] Redundant transitions in 1 ms returned []
Running 60 sub problems to find dead transitions.
[2024-05-21 08:43:05] [INFO ] Invariant cache hit.
[2024-05-21 08:43:05] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 2/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 63/125 variables, 62/63 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 1/126 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (OVERLAPS) 0/126 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 126/126 variables, and 84 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1228 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 2/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 63/125 variables, 62/63 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 59/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 1/126 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/126 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/126 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (OVERLAPS) 0/126 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 126/126 variables, and 144 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1776 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
After SMT, in 3019ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 3020ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 3092 ms. Remains : 63/63 places, 63/63 transitions.
Stuttering acceptance computed with spot in 116 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : CryptoMiner-COL-D20N100-LTLCardinality-10
Product exploration explored 100000 steps with 0 reset in 282 ms.
Product exploration explored 100000 steps with 0 reset in 472 ms.
Computed a total of 41 stabilizing places and 41 stable transitions
Graph (complete) has 165 edges and 63 vertex of which 22 are kept as prefixes of interest. Removing 41 places using SCC suffix rule.0 ms
Computed a total of 41 stabilizing places and 41 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (NOT p0)), (X (X p1))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 4 factoid took 226 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
RANDOM walk for 27026 steps (6 resets) in 10 ms. (2456 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (NOT p0)), (X (X p1))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F p0)]
Knowledge based reduction with 4 factoid took 117 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
[2024-05-21 08:43:09] [INFO ] Invariant cache hit.
[2024-05-21 08:43:09] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned unsat
Proved EG (NOT p0)
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (NOT p0)), (X (X p1))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F p0), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 4 factoid took 170 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CryptoMiner-COL-D20N100-LTLCardinality-10 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CryptoMiner-COL-D20N100-LTLCardinality-10 finished in 4710 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 !p1)||F((p2&&F(p3)))))'
Support contains 63 out of 63 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 63/63 transitions.
Applied a total of 0 rules in 5 ms. Remains 63 /63 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2024-05-21 08:43:09] [INFO ] Invariant cache hit.
[2024-05-21 08:43:09] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-21 08:43:09] [INFO ] Invariant cache hit.
[2024-05-21 08:43:09] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 08:43:09] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
[2024-05-21 08:43:09] [INFO ] Redundant transitions in 0 ms returned []
Running 60 sub problems to find dead transitions.
[2024-05-21 08:43:09] [INFO ] Invariant cache hit.
[2024-05-21 08:43:09] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 2/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 63/125 variables, 62/63 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 1/126 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (OVERLAPS) 0/126 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 126/126 variables, and 84 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1212 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 2/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 63/125 variables, 62/63 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 59/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 1/126 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/126 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/126 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (OVERLAPS) 0/126 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 126/126 variables, and 144 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1729 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
After SMT, in 2948ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 2949ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 3028 ms. Remains : 63/63 places, 63/63 transitions.
Stuttering acceptance computed with spot in 264 ms :[(OR (AND p1 (NOT p2)) (AND p1 (NOT p3))), (OR (NOT p2) (NOT p3)), (NOT p3), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (AND (NOT p3) (NOT p0)), (AND p1 (NOT p3))]
Running random walk in product with property : CryptoMiner-COL-D20N100-LTLCardinality-11
Product exploration explored 100000 steps with 0 reset in 486 ms.
Product exploration explored 100000 steps with 0 reset in 532 ms.
Computed a total of 41 stabilizing places and 41 stable transitions
Graph (complete) has 165 edges and 63 vertex of which 22 are kept as prefixes of interest. Removing 41 places using SCC suffix rule.1 ms
Computed a total of 41 stabilizing places and 41 stable transitions
Knowledge obtained : [(AND p1 p0 (NOT p2) (NOT p3)), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND p1 (NOT p0) (NOT p3)))), (X (NOT (AND p2 (NOT p3)))), (X (NOT (AND p0 p2 (NOT p3)))), (X (NOT (AND p1 p0 p2 (NOT p3)))), (X (NOT (AND p1 (NOT p0) p2 (NOT p3)))), (X (NOT (AND (NOT p0) p2 (NOT p3)))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X p0), (X p1), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND p1 (NOT p0) (NOT p3))))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT (AND p0 p2 (NOT p3))))), (X (X (NOT (AND p1 p0 p2 (NOT p3))))), (X (X (NOT (AND p1 (NOT p0) p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) p2 (NOT p3))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X p0)), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X p3), (X (NOT p3)), (X (AND p1 p0 (NOT p3))), (X (NOT (AND p1 p0 (NOT p3)))), (X (AND p0 (NOT p3))), (X (NOT (AND p0 (NOT p3)))), (X (AND p1 p0 (NOT p2))), (X (NOT (AND p1 p0 (NOT p2)))), (X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (X p2)), (X (X (NOT p2))), (X (X p3)), (X (X (NOT p3))), (X (X (AND p1 p0 (NOT p3)))), (X (X (NOT (AND p1 p0 (NOT p3))))), (X (X (AND p0 (NOT p3)))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (AND p1 p0 (NOT p2)))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2)))))]
Knowledge based reduction with 23 factoid took 1109 ms. Reduced automaton from 6 states, 18 edges and 4 AP (stutter insensitive) to 6 states, 18 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 269 ms :[(OR (AND p1 (NOT p2)) (AND p1 (NOT p3))), (OR (NOT p2) (NOT p3)), (NOT p3), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (AND (NOT p3) (NOT p0)), (AND p1 (NOT p3))]
RANDOM walk for 40206 steps (15 resets) in 40 ms. (980 steps per ms) remains 9/17 properties
BEST_FIRST walk for 40004 steps (8 resets) in 203 ms. (196 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 257 ms. (155 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 143 ms. (277 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 94 ms. (421 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 118 ms. (336 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 153 ms. (259 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 138 ms. (287 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 114 ms. (347 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 97 ms. (408 steps per ms) remains 9/9 properties
[2024-05-21 08:43:15] [INFO ] Invariant cache hit.
[2024-05-21 08:43:15] [INFO ] State equation strengthened by 20 read => feed constraints.
Problem apf3 is UNSAT
Problem apf7 is UNSAT
Problem apf9 is UNSAT
Problem apf16 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 1/1 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 0/1 constraints. Problems are: Problem set: 4 solved, 5 unsolved
Problem apf2 is UNSAT
Problem apf4 is UNSAT
Problem apf5 is UNSAT
Problem apf10 is UNSAT
Problem apf12 is UNSAT
After SMT solving in domain Real declared 126/126 variables, and 64 constraints, problems are : Problem set: 9 solved, 0 unsolved in 78 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 98ms problems are : Problem set: 9 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 9 invariant AP formulas.
Knowledge obtained : [(AND p1 p0 (NOT p2) (NOT p3)), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND p1 (NOT p0) (NOT p3)))), (X (NOT (AND p2 (NOT p3)))), (X (NOT (AND p0 p2 (NOT p3)))), (X (NOT (AND p1 p0 p2 (NOT p3)))), (X (NOT (AND p1 (NOT p0) p2 (NOT p3)))), (X (NOT (AND (NOT p0) p2 (NOT p3)))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X p0), (X p1), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND p1 (NOT p0) (NOT p3))))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT (AND p0 p2 (NOT p3))))), (X (X (NOT (AND p1 p0 p2 (NOT p3))))), (X (X (NOT (AND p1 (NOT p0) p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) p2 (NOT p3))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X p0)), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (G (OR p0 p3 (NOT p1))), (G (OR p0 (NOT p1) p2)), (G (OR p0 p3)), (G (OR p0 p3 (NOT p1) (NOT p2))), (G (OR p3 (NOT p2))), (G (OR p0 p3 (NOT p2))), (G (OR (NOT p0) p3 (NOT p2))), (G (OR p0 p2)), (G (OR (NOT p0) p3 (NOT p1) (NOT p2)))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X p3), (X (NOT p3)), (X (AND p1 p0 (NOT p3))), (X (NOT (AND p1 p0 (NOT p3)))), (X (AND p0 (NOT p3))), (X (NOT (AND p0 (NOT p3)))), (X (AND p1 p0 (NOT p2))), (X (NOT (AND p1 p0 (NOT p2)))), (X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (X p2)), (X (X (NOT p2))), (X (X p3)), (X (X (NOT p3))), (X (X (AND p1 p0 (NOT p3)))), (X (X (NOT (AND p1 p0 (NOT p3))))), (X (X (AND p0 (NOT p3)))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (AND p1 p0 (NOT p2)))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (F (NOT (AND p0 (NOT p3) p1))), (F (NOT p1)), (F (NOT p0)), (F (NOT (AND p0 (NOT p2)))), (F (NOT (AND p0 (NOT p3)))), (F p2), (F p3), (F (NOT (AND p0 p1 (NOT p2))))]
Knowledge based reduction with 32 factoid took 1373 ms. Reduced automaton from 6 states, 18 edges and 4 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 54 ms :[(AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 34 ms :[(AND p1 (NOT p2))]
[2024-05-21 08:43:17] [INFO ] Invariant cache hit.
Proved EG (AND p1 (NOT p2))
Knowledge obtained : [(AND p1 p0 (NOT p2) (NOT p3)), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND p1 (NOT p0) (NOT p3)))), (X (NOT (AND p2 (NOT p3)))), (X (NOT (AND p0 p2 (NOT p3)))), (X (NOT (AND p1 p0 p2 (NOT p3)))), (X (NOT (AND p1 (NOT p0) p2 (NOT p3)))), (X (NOT (AND (NOT p0) p2 (NOT p3)))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X p0), (X p1), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND p1 (NOT p0) (NOT p3))))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT (AND p0 p2 (NOT p3))))), (X (X (NOT (AND p1 p0 p2 (NOT p3))))), (X (X (NOT (AND p1 (NOT p0) p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) p2 (NOT p3))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X p0)), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (G (OR p0 p3 (NOT p1))), (G (OR p0 (NOT p1) p2)), (G (OR p0 p3)), (G (OR p0 p3 (NOT p1) (NOT p2))), (G (OR p3 (NOT p2))), (G (OR p0 p3 (NOT p2))), (G (OR (NOT p0) p3 (NOT p2))), (G (OR p0 p2)), (G (OR (NOT p0) p3 (NOT p1) (NOT p2)))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X p3), (X (NOT p3)), (X (AND p1 p0 (NOT p3))), (X (NOT (AND p1 p0 (NOT p3)))), (X (AND p0 (NOT p3))), (X (NOT (AND p0 (NOT p3)))), (X (AND p1 p0 (NOT p2))), (X (NOT (AND p1 p0 (NOT p2)))), (X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (X p2)), (X (X (NOT p2))), (X (X p3)), (X (X (NOT p3))), (X (X (AND p1 p0 (NOT p3)))), (X (X (NOT (AND p1 p0 (NOT p3))))), (X (X (AND p0 (NOT p3)))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (AND p1 p0 (NOT p2)))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (F (NOT (AND p0 (NOT p3) p1))), (F (NOT p1)), (F (NOT p0)), (F (NOT (AND p0 (NOT p2)))), (F (NOT (AND p0 (NOT p3)))), (F p2), (F p3), (F (NOT (AND p0 p1 (NOT p2)))), (G (AND p1 (NOT p2)))]
Property proved to be false thanks to negative knowledge :(G (AND p1 (NOT p2)))
Knowledge based reduction with 32 factoid took 1450 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CryptoMiner-COL-D20N100-LTLCardinality-11 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CryptoMiner-COL-D20N100-LTLCardinality-11 finished in 9208 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||X((X((G(!p1)||(!p1&&F(!p0)))) U (p0&&X((G(!p1)||(!p1&&F(!p0)))))))))))'
Support contains 42 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 63/63 transitions.
Applied a total of 0 rules in 2 ms. Remains 63 /63 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2024-05-21 08:43:19] [INFO ] Invariant cache hit.
[2024-05-21 08:43:19] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-21 08:43:19] [INFO ] Invariant cache hit.
[2024-05-21 08:43:19] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 08:43:19] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
Running 60 sub problems to find dead transitions.
[2024-05-21 08:43:19] [INFO ] Invariant cache hit.
[2024-05-21 08:43:19] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 2/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 63/125 variables, 62/63 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 1/126 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (OVERLAPS) 0/126 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 126/126 variables, and 84 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1247 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 2/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 63/125 variables, 62/63 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 59/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 1/126 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/126 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/126 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (OVERLAPS) 0/126 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 126/126 variables, and 144 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1747 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
After SMT, in 3002ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 3003ms
Finished structural reductions in LTL mode , in 1 iterations and 3086 ms. Remains : 63/63 places, 63/63 transitions.
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (NOT p0), (AND (NOT p0) p1)]
Running random walk in product with property : CryptoMiner-COL-D20N100-LTLCardinality-13
Product exploration explored 100000 steps with 0 reset in 197 ms.
Product exploration explored 100000 steps with 0 reset in 253 ms.
Computed a total of 41 stabilizing places and 41 stable transitions
Graph (complete) has 165 edges and 63 vertex of which 22 are kept as prefixes of interest. Removing 41 places using SCC suffix rule.0 ms
Computed a total of 41 stabilizing places and 41 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X p0)), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 4 factoid took 130 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 113 ms :[(NOT p0), (NOT p0), (AND (NOT p0) p1)]
RANDOM walk for 3759 steps (1 resets) in 7 ms. (469 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X p0)), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (F (NOT (OR (NOT p1) p0))), (F p1), (F (NOT p0))]
Knowledge based reduction with 4 factoid took 169 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 124 ms :[(NOT p0), (NOT p0), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 118 ms :[(NOT p0), (NOT p0), (AND (NOT p0) p1)]
Support contains 42 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 63/63 transitions.
Applied a total of 0 rules in 0 ms. Remains 63 /63 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2024-05-21 08:43:23] [INFO ] Invariant cache hit.
[2024-05-21 08:43:23] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-21 08:43:23] [INFO ] Invariant cache hit.
[2024-05-21 08:43:23] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 08:43:23] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
Running 60 sub problems to find dead transitions.
[2024-05-21 08:43:23] [INFO ] Invariant cache hit.
[2024-05-21 08:43:23] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 2/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 63/125 variables, 62/63 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 1/126 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (OVERLAPS) 0/126 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 126/126 variables, and 84 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1246 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 2/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 63/125 variables, 62/63 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 59/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 1/126 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/126 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/126 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (OVERLAPS) 0/126 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 126/126 variables, and 144 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1744 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
After SMT, in 2997ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 2999ms
Finished structural reductions in LTL mode , in 1 iterations and 3060 ms. Remains : 63/63 places, 63/63 transitions.
Computed a total of 41 stabilizing places and 41 stable transitions
Graph (complete) has 165 edges and 63 vertex of which 22 are kept as prefixes of interest. Removing 41 places using SCC suffix rule.2 ms
Computed a total of 41 stabilizing places and 41 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 4 factoid took 163 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 116 ms :[(NOT p0), (NOT p0), (AND (NOT p0) p1)]
RANDOM walk for 20439 steps (5 resets) in 9 ms. (2043 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (F (NOT (OR (NOT p1) p0))), (F p1), (F (NOT p0))]
Knowledge based reduction with 4 factoid took 202 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p0), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 116 ms :[(NOT p0), (NOT p0), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 117 ms :[(NOT p0), (NOT p0), (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 0 reset in 199 ms.
Product exploration explored 100000 steps with 0 reset in 250 ms.
Support contains 42 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 63/63 transitions.
Applied a total of 0 rules in 2 ms. Remains 63 /63 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2024-05-21 08:43:27] [INFO ] Invariant cache hit.
[2024-05-21 08:43:27] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-21 08:43:27] [INFO ] Invariant cache hit.
[2024-05-21 08:43:27] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 08:43:27] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
Running 60 sub problems to find dead transitions.
[2024-05-21 08:43:27] [INFO ] Invariant cache hit.
[2024-05-21 08:43:27] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 2/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 63/125 variables, 62/63 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 1/126 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (OVERLAPS) 0/126 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 126/126 variables, and 84 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1298 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 2/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 63/125 variables, 62/63 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 59/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 1/126 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/126 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/126 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (OVERLAPS) 0/126 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 126/126 variables, and 144 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1757 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
After SMT, in 3064ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 3064ms
Finished structural reductions in LTL mode , in 1 iterations and 3131 ms. Remains : 63/63 places, 63/63 transitions.
Treatment of property CryptoMiner-COL-D20N100-LTLCardinality-13 finished in 11992 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)))'
Support contains 42 out of 63 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 63/63 transitions.
Applied a total of 0 rules in 3 ms. Remains 63 /63 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2024-05-21 08:43:30] [INFO ] Invariant cache hit.
[2024-05-21 08:43:31] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-05-21 08:43:31] [INFO ] Invariant cache hit.
[2024-05-21 08:43:31] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 08:43:31] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
[2024-05-21 08:43:31] [INFO ] Redundant transitions in 1 ms returned []
Running 60 sub problems to find dead transitions.
[2024-05-21 08:43:31] [INFO ] Invariant cache hit.
[2024-05-21 08:43:31] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 2/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 63/125 variables, 62/63 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 1/126 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (OVERLAPS) 0/126 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 126/126 variables, and 84 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1295 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 2/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 63/125 variables, 62/63 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 59/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 1/126 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/126 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/126 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (OVERLAPS) 0/126 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 126/126 variables, and 144 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1742 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
After SMT, in 3044ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 3045ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 3118 ms. Remains : 63/63 places, 63/63 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CryptoMiner-COL-D20N100-LTLCardinality-15
Product exploration explored 100000 steps with 0 reset in 195 ms.
Product exploration explored 100000 steps with 0 reset in 228 ms.
Computed a total of 41 stabilizing places and 41 stable transitions
Graph (complete) has 165 edges and 63 vertex of which 22 are kept as prefixes of interest. Removing 41 places using SCC suffix rule.6 ms
Computed a total of 41 stabilizing places and 41 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 86 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 13824 steps (4 resets) in 6 ms. (1974 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 114 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Support contains 42 out of 63 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 63/63 transitions.
Applied a total of 0 rules in 5 ms. Remains 63 /63 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2024-05-21 08:43:35] [INFO ] Invariant cache hit.
[2024-05-21 08:43:35] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-21 08:43:35] [INFO ] Invariant cache hit.
[2024-05-21 08:43:35] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 08:43:35] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
[2024-05-21 08:43:35] [INFO ] Redundant transitions in 1 ms returned []
Running 60 sub problems to find dead transitions.
[2024-05-21 08:43:35] [INFO ] Invariant cache hit.
[2024-05-21 08:43:35] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 2/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 63/125 variables, 62/63 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 1/126 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (OVERLAPS) 0/126 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 126/126 variables, and 84 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1270 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 2/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 63/125 variables, 62/63 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 59/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 1/126 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/126 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/126 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (OVERLAPS) 0/126 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 126/126 variables, and 144 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1785 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
After SMT, in 3063ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 3064ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 3147 ms. Remains : 63/63 places, 63/63 transitions.
Computed a total of 41 stabilizing places and 41 stable transitions
Graph (complete) has 165 edges and 63 vertex of which 22 are kept as prefixes of interest. Removing 41 places using SCC suffix rule.2 ms
Computed a total of 41 stabilizing places and 41 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 81 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 13718 steps (3 resets) in 8 ms. (1524 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 96 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 197 ms.
Product exploration explored 100000 steps with 0 reset in 226 ms.
Support contains 42 out of 63 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 63/63 transitions.
Applied a total of 0 rules in 2 ms. Remains 63 /63 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2024-05-21 08:43:39] [INFO ] Invariant cache hit.
[2024-05-21 08:43:39] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-21 08:43:39] [INFO ] Invariant cache hit.
[2024-05-21 08:43:39] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 08:43:39] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
[2024-05-21 08:43:39] [INFO ] Redundant transitions in 1 ms returned []
Running 60 sub problems to find dead transitions.
[2024-05-21 08:43:39] [INFO ] Invariant cache hit.
[2024-05-21 08:43:39] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 2/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 63/125 variables, 62/63 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 1/126 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (OVERLAPS) 0/126 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 126/126 variables, and 84 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1278 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 2/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 63/125 variables, 62/63 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 59/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 1/126 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/126 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/126 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (OVERLAPS) 0/126 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 126/126 variables, and 144 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1727 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
After SMT, in 3017ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 3018ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 3101 ms. Remains : 63/63 places, 63/63 transitions.
Treatment of property CryptoMiner-COL-D20N100-LTLCardinality-15 finished in 11284 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||X(p0)) U (G((p0||X(p0)))||((p0||X(p0))&&(!p0 U 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' '!(F(G((p0||X((X((G(!p1)||(!p1&&F(!p0)))) U (p0&&X((G(!p1)||(!p1&&F(!p0)))))))))))'
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)))'
[2024-05-21 08:43:42] [INFO ] Flatten gal took : 13 ms
[2024-05-21 08:43:42] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2024-05-21 08:43:42] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 63 places, 63 transitions and 187 arcs took 3 ms.
Total runtime 86391 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running CryptoMiner-COL-D20N100

IS_COLORED=
IS_NUPN=

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


SAVING FILE /home/mcc/execution/411/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: 2105
MODEL NAME: /home/mcc/execution/411/model
63 places, 63 transitions.

Creating all event NSFs..
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.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA CryptoMiner-COL-D20N100-LTLCardinality-06 CANNOT_COMPUTE
FORMULA CryptoMiner-COL-D20N100-LTLCardinality-13 CANNOT_COMPUTE
FORMULA CryptoMiner-COL-D20N100-LTLCardinality-15 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716281646983

--------------------
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
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

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-D20N100"
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-D20N100, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r091-tall-171624187500355"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.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 ;