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.r092-tall-171624189200380.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 itstools
Input is CryptoMiner-PT-D03N100, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r092-tall-171624189200380
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 604K
-rw-r--r-- 1 mcc users 9.7K Apr 12 12:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Apr 12 12:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Apr 12 12:35 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K Apr 12 12:35 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.5K Apr 22 14:35 LTLCardinality.txt
-rw-r--r-- 1 mcc users 35K Apr 22 14:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 22 14:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 21K Apr 12 12:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 156K Apr 12 12:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 18K Apr 12 12:43 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 137K Apr 12 12:43 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K Apr 22 14:35 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.6K Apr 22 14:35 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 8 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 5.3K 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-PT-D03N100-LTLFireability-00
FORMULA_NAME CryptoMiner-PT-D03N100-LTLFireability-01
FORMULA_NAME CryptoMiner-PT-D03N100-LTLFireability-02
FORMULA_NAME CryptoMiner-PT-D03N100-LTLFireability-03
FORMULA_NAME CryptoMiner-PT-D03N100-LTLFireability-04
FORMULA_NAME CryptoMiner-PT-D03N100-LTLFireability-05
FORMULA_NAME CryptoMiner-PT-D03N100-LTLFireability-06
FORMULA_NAME CryptoMiner-PT-D03N100-LTLFireability-07
FORMULA_NAME CryptoMiner-PT-D03N100-LTLFireability-08
FORMULA_NAME CryptoMiner-PT-D03N100-LTLFireability-09
FORMULA_NAME CryptoMiner-PT-D03N100-LTLFireability-10
FORMULA_NAME CryptoMiner-PT-D03N100-LTLFireability-11
FORMULA_NAME CryptoMiner-PT-D03N100-LTLFireability-12
FORMULA_NAME CryptoMiner-PT-D03N100-LTLFireability-13
FORMULA_NAME CryptoMiner-PT-D03N100-LTLFireability-14
FORMULA_NAME CryptoMiner-PT-D03N100-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716305979162

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CryptoMiner-PT-D03N100
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-21 15:39:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 15:39:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 15:39:40] [INFO ] Load time of PNML (sax parser for PT used): 27 ms
[2024-05-21 15:39:40] [INFO ] Transformed 12 places.
[2024-05-21 15:39:40] [INFO ] Transformed 12 transitions.
[2024-05-21 15:39:40] [INFO ] Parsed PT model containing 12 places and 12 transitions and 34 arcs in 119 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA CryptoMiner-PT-D03N100-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CryptoMiner-PT-D03N100-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CryptoMiner-PT-D03N100-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 8 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 11 transition count 12
Applied a total of 1 rules in 20 ms. Remains 11 /12 variables (removed 1) and now considering 12/12 (removed 0) transitions.
// Phase 1: matrix 12 rows 11 cols
[2024-05-21 15:39:40] [INFO ] Computed 0 invariants in 4 ms
[2024-05-21 15:39:40] [INFO ] Implicit Places using invariants in 118 ms returned []
[2024-05-21 15:39:40] [INFO ] Invariant cache hit.
[2024-05-21 15:39:40] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 15:39:40] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 201 ms to find 0 implicit places.
Running 9 sub problems to find dead transitions.
[2024-05-21 15:39:40] [INFO ] Invariant cache hit.
[2024-05-21 15:39:40] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 12/21 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 2/23 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 0/23 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 23/23 variables, and 14 constraints, problems are : Problem set: 0 solved, 9 unsolved in 135 ms.
Refiners :[State Equation: 11/11 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 12/21 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 2/23 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/23 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/23 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 0/23 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 23/23 variables, and 23 constraints, problems are : Problem set: 0 solved, 9 unsolved in 109 ms.
Refiners :[State Equation: 11/11 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 268ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 277ms
Starting structural reductions in LTL mode, iteration 1 : 11/12 places, 12/12 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 524 ms. Remains : 11/12 places, 12/12 transitions.
Support contains 8 out of 11 places after structural reductions.
[2024-05-21 15:39:41] [INFO ] Flatten gal took : 13 ms
[2024-05-21 15:39:41] [INFO ] Flatten gal took : 3 ms
[2024-05-21 15:39:41] [INFO ] Input system was already deterministic with 12 transitions.
Reduction of identical properties reduced properties to check from 12 to 8
RANDOM walk for 30252 steps (7 resets) in 113 ms. (265 steps per ms) remains 0/8 properties
Computed a total of 6 stabilizing places and 7 stable transitions
Graph (complete) has 26 edges and 11 vertex of which 5 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 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((G(p0)&&(G(p2)||p1)))))'
Support contains 7 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2024-05-21 15:39:41] [INFO ] Invariant cache hit.
[2024-05-21 15:39:41] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-21 15:39:41] [INFO ] Invariant cache hit.
[2024-05-21 15:39:41] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 15:39:41] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
Running 9 sub problems to find dead transitions.
[2024-05-21 15:39:41] [INFO ] Invariant cache hit.
[2024-05-21 15:39:41] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 12/21 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 2/23 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 0/23 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 23/23 variables, and 14 constraints, problems are : Problem set: 0 solved, 9 unsolved in 87 ms.
Refiners :[State Equation: 11/11 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 12/21 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 2/23 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/23 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/23 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 0/23 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 23/23 variables, and 23 constraints, problems are : Problem set: 0 solved, 9 unsolved in 79 ms.
Refiners :[State Equation: 11/11 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 173ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 174ms
Finished structural reductions in LTL mode , in 1 iterations and 236 ms. Remains : 11/11 places, 12/12 transitions.
Stuttering acceptance computed with spot in 563 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : CryptoMiner-PT-D03N100-LTLFireability-00
Product exploration explored 100000 steps with 0 reset in 263 ms.
Product exploration explored 100000 steps with 0 reset in 320 ms.
Computed a total of 6 stabilizing places and 7 stable transitions
Graph (complete) has 26 edges and 11 vertex of which 5 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Computed a total of 6 stabilizing places and 7 stable transitions
Detected a total of 6/11 stabilizing places and 7/12 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (OR (AND p0 p1) (AND p0 p2)))), (X (OR (NOT p0) (AND (NOT p1) (NOT p2)))), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (OR (AND p0 p1) (AND p0 p2))))), (X (X (OR (NOT p0) (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (X p2)), (X (X (NOT p2))), (X (X (OR (AND (NOT p0) p2) (AND (NOT p1) p2)))), (X (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p1) p2))))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 14 factoid took 542 ms. Reduced automaton from 5 states, 14 edges and 3 AP (stutter sensitive) to 8 states, 25 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 381 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), false, false, false]
Reduction of identical properties reduced properties to check from 14 to 9
RANDOM walk for 40052 steps (8 resets) in 44 ms. (890 steps per ms) remains 1/9 properties
BEST_FIRST walk for 40002 steps (9 resets) in 185 ms. (215 steps per ms) remains 1/1 properties
[2024-05-21 15:39:44] [INFO ] Invariant cache hit.
[2024-05-21 15:39:44] [INFO ] State equation strengthened by 3 read => feed constraints.
Problem apf1 is UNSAT
After SMT solving in domain Real declared 4/23 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 16 ms.
Refiners :[State Equation: 0/11 constraints, ReadFeed: 0/3 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 20ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (OR (AND p0 p1) (AND p0 p2)))), (X (OR (NOT p0) (AND (NOT p1) (NOT p2)))), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (OR (AND p0 p1) (AND p0 p2))))), (X (X (OR (NOT p0) (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (G (OR p2 (NOT p0))), (G (OR (NOT p1) p2 (NOT p0)))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (X p2)), (X (X (NOT p2))), (X (X (OR (AND (NOT p0) p2) (AND (NOT p1) p2)))), (X (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p1) p2))))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))))), (F (NOT (OR p1 (NOT p2) (NOT p0)))), (F (NOT (AND (OR (NOT p1) (NOT p0)) (OR (NOT p2) (NOT p0))))), (F (NOT (OR (AND (NOT p1) (NOT p2)) (NOT p0)))), (F (NOT (AND (NOT p2) (NOT p0)))), (F (NOT (OR (NOT p2) p0))), (F (NOT p1)), (F (NOT (OR (NOT p1) (NOT p2) (NOT p0)))), (F (NOT (OR (NOT p2) (NOT p0)))), (F p0), (F p2), (F (NOT (AND (OR p1 (NOT p2)) (OR (NOT p2) p0)))), (F (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p2) (NOT p0)))))]
Knowledge based reduction with 16 factoid took 1009 ms. Reduced automaton from 8 states, 25 edges and 3 AP (stutter insensitive) to 8 states, 27 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 379 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), false, false, false]
Stuttering acceptance computed with spot in 380 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), false, false, false]
[2024-05-21 15:39:45] [INFO ] Invariant cache hit.
[2024-05-21 15:39:46] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2024-05-21 15:39:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 15:39:46] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2024-05-21 15:39:46] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 15:39:46] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2024-05-21 15:39:46] [INFO ] Computed and/alt/rep : 9/15/9 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-21 15:39:46] [INFO ] Added : 2 causal constraints over 1 iterations in 5 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 7 out of 11 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 11/11 places, 12/12 transitions.
Applied a total of 0 rules in 12 ms. Remains 11 /11 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2024-05-21 15:39:46] [INFO ] Invariant cache hit.
[2024-05-21 15:39:46] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-21 15:39:46] [INFO ] Invariant cache hit.
[2024-05-21 15:39:46] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 15:39:46] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2024-05-21 15:39:46] [INFO ] Redundant transitions in 0 ms returned []
Running 9 sub problems to find dead transitions.
[2024-05-21 15:39:46] [INFO ] Invariant cache hit.
[2024-05-21 15:39:46] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 12/21 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 2/23 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 0/23 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 23/23 variables, and 14 constraints, problems are : Problem set: 0 solved, 9 unsolved in 76 ms.
Refiners :[State Equation: 11/11 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 12/21 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 2/23 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/23 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/23 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 0/23 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 23/23 variables, and 23 constraints, problems are : Problem set: 0 solved, 9 unsolved in 76 ms.
Refiners :[State Equation: 11/11 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 156ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 156ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 227 ms. Remains : 11/11 places, 12/12 transitions.
Computed a total of 6 stabilizing places and 7 stable transitions
Graph (complete) has 26 edges and 11 vertex of which 5 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Computed a total of 6 stabilizing places and 7 stable transitions
Detected a total of 6/11 stabilizing places and 7/12 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0) (NOT p2)), (X (NOT (AND p1 p2 p0))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (OR (AND (NOT p1) (NOT p2)) (NOT p0))), (X (NOT (OR (AND p1 p0) (AND p2 p0)))), (X (NOT (AND (NOT p1) p2 p0))), (X (NOT (AND p1 (NOT p2) p0))), (X (NOT p0)), (X (NOT (AND p1 p0))), (X p1), (X (X (NOT (AND p1 p2 p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (OR (AND (NOT p1) (NOT p2)) (NOT p0)))), (X (X (NOT (OR (AND p1 p0) (AND p2 p0))))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT p0))), (X (X (NOT (AND p1 p0)))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (OR (AND (NOT p1) p2) (AND p2 (NOT p0)))), (X (NOT (OR (AND (NOT p1) p2) (AND p2 (NOT p0))))), (X (X p2)), (X (X (NOT p2))), (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (OR (AND (NOT p1) p2) (AND p2 (NOT p0))))), (X (X (NOT (OR (AND (NOT p1) p2) (AND p2 (NOT p0))))))]
Knowledge based reduction with 20 factoid took 564 ms. Reduced automaton from 8 states, 27 edges and 3 AP (stutter insensitive) to 8 states, 27 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 507 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), false, false, false]
Reduction of identical properties reduced properties to check from 13 to 9
RANDOM walk for 40065 steps (9 resets) in 112 ms. (354 steps per ms) remains 2/9 properties
BEST_FIRST walk for 40001 steps (9 resets) in 114 ms. (347 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (8 resets) in 97 ms. (408 steps per ms) remains 2/2 properties
[2024-05-21 15:39:47] [INFO ] Invariant cache hit.
[2024-05-21 15:39:47] [INFO ] State equation strengthened by 3 read => feed constraints.
Problem apf1 is UNSAT
Problem apf2 is UNSAT
After SMT solving in domain Real declared 4/23 variables, and 0 constraints, problems are : Problem set: 2 solved, 0 unsolved in 14 ms.
Refiners :[State Equation: 0/11 constraints, ReadFeed: 0/3 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 17ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p0) (NOT p2)), (X (NOT (AND p1 p2 p0))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (OR (AND (NOT p1) (NOT p2)) (NOT p0))), (X (NOT (OR (AND p1 p0) (AND p2 p0)))), (X (NOT (AND (NOT p1) p2 p0))), (X (NOT (AND p1 (NOT p2) p0))), (X (NOT p0)), (X (NOT (AND p1 p0))), (X p1), (X (X (NOT (AND p1 p2 p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (OR (AND (NOT p1) (NOT p2)) (NOT p0)))), (X (X (NOT (OR (AND p1 p0) (AND p2 p0))))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT p0))), (X (X (NOT (AND p1 p0)))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (G (OR (NOT p1) p2 (NOT p0))), (G (OR p1 p2 (NOT p0)))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (OR (AND (NOT p1) p2) (AND p2 (NOT p0)))), (X (NOT (OR (AND (NOT p1) p2) (AND p2 (NOT p0))))), (X (X p2)), (X (X (NOT p2))), (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (OR (AND (NOT p1) p2) (AND p2 (NOT p0))))), (X (X (NOT (OR (AND (NOT p1) p2) (AND p2 (NOT p0)))))), (F (NOT (OR p1 (NOT p2) (NOT p0)))), (F (NOT (AND (OR (NOT p1) (NOT p0)) (OR (NOT p2) (NOT p0))))), (F (NOT (OR (AND (NOT p1) (NOT p2)) (NOT p0)))), (F (NOT (OR (NOT p1) (NOT p0)))), (F (NOT (OR (NOT p2) p0))), (F (NOT (OR p1 (NOT p0)))), (F (NOT p1)), (F (NOT (OR (NOT p1) (NOT p2) (NOT p0)))), (F p2), (F p0), (F (NOT (AND (OR p1 (NOT p2)) (OR (NOT p2) p0))))]
Knowledge based reduction with 22 factoid took 940 ms. Reduced automaton from 8 states, 27 edges and 3 AP (stutter insensitive) to 8 states, 27 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 388 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), false, false, false]
Stuttering acceptance computed with spot in 361 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), false, false, false]
[2024-05-21 15:39:49] [INFO ] Invariant cache hit.
[2024-05-21 15:39:49] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-21 15:39:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 15:39:49] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2024-05-21 15:39:49] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 15:39:49] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2024-05-21 15:39:49] [INFO ] Computed and/alt/rep : 9/15/9 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-21 15:39:49] [INFO ] Added : 2 causal constraints over 1 iterations in 6 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 387 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), false, false, false]
Product exploration explored 100000 steps with 0 reset in 133 ms.
Product exploration explored 100000 steps with 0 reset in 152 ms.
Built C files in :
/tmp/ltsmin15121858067215920351
[2024-05-21 15:39:50] [INFO ] Computing symmetric may disable matrix : 12 transitions.
[2024-05-21 15:39:50] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 15:39:50] [INFO ] Computing symmetric may enable matrix : 12 transitions.
[2024-05-21 15:39:50] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 15:39:50] [INFO ] Computing Do-Not-Accords matrix : 12 transitions.
[2024-05-21 15:39:50] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 15:39:50] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15121858067215920351
Running compilation step : cd /tmp/ltsmin15121858067215920351;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 231 ms.
Running link step : cd /tmp/ltsmin15121858067215920351;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin15121858067215920351;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16412183051143009629.hoa' '--buchi-type=spotba'
LTSmin run took 205 ms.
FORMULA CryptoMiner-PT-D03N100-LTLFireability-00 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CryptoMiner-PT-D03N100-LTLFireability-00 finished in 8833 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(!p1)&&X(X(F(p2)))&&p0)))'
Support contains 3 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2024-05-21 15:39:50] [INFO ] Invariant cache hit.
[2024-05-21 15:39:50] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-21 15:39:50] [INFO ] Invariant cache hit.
[2024-05-21 15:39:50] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 15:39:50] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
Running 9 sub problems to find dead transitions.
[2024-05-21 15:39:50] [INFO ] Invariant cache hit.
[2024-05-21 15:39:50] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 12/21 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 2/23 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 0/23 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 23/23 variables, and 14 constraints, problems are : Problem set: 0 solved, 9 unsolved in 75 ms.
Refiners :[State Equation: 11/11 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 12/21 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 2/23 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/23 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/23 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 0/23 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 23/23 variables, and 23 constraints, problems are : Problem set: 0 solved, 9 unsolved in 83 ms.
Refiners :[State Equation: 11/11 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 165ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 166ms
Finished structural reductions in LTL mode , in 1 iterations and 222 ms. Remains : 11/11 places, 12/12 transitions.
Stuttering acceptance computed with spot in 231 ms :[p1, (OR (NOT p2) p1), (OR (NOT p2) p1), (OR (NOT p0) (NOT p2) p1), (OR (NOT p2) (NOT p0) p1), true]
Running random walk in product with property : CryptoMiner-PT-D03N100-LTLFireability-01
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA CryptoMiner-PT-D03N100-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-PT-D03N100-LTLFireability-01 finished in 479 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(G((!p0&&F(G((F(!p2)||p1)))))))))'
Support contains 4 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2024-05-21 15:39:51] [INFO ] Invariant cache hit.
[2024-05-21 15:39:51] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-21 15:39:51] [INFO ] Invariant cache hit.
[2024-05-21 15:39:51] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 15:39:51] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
Running 9 sub problems to find dead transitions.
[2024-05-21 15:39:51] [INFO ] Invariant cache hit.
[2024-05-21 15:39:51] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 12/21 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 2/23 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 0/23 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 23/23 variables, and 14 constraints, problems are : Problem set: 0 solved, 9 unsolved in 74 ms.
Refiners :[State Equation: 11/11 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 12/21 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 2/23 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/23 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/23 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 0/23 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 23/23 variables, and 23 constraints, problems are : Problem set: 0 solved, 9 unsolved in 69 ms.
Refiners :[State Equation: 11/11 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 147ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 148ms
Finished structural reductions in LTL mode , in 1 iterations and 203 ms. Remains : 11/11 places, 12/12 transitions.
Stuttering acceptance computed with spot in 245 ms :[(OR p0 (AND (NOT p1) p2)), (OR p0 (AND (NOT p1) p2)), (OR p0 (AND (NOT p1) p2)), (OR p0 (AND (NOT p1) p2)), true, (AND (NOT p1) p2)]
Running random walk in product with property : CryptoMiner-PT-D03N100-LTLFireability-02
Entered a terminal (fully accepting) state of product in 7 steps with 0 reset in 0 ms.
FORMULA CryptoMiner-PT-D03N100-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-PT-D03N100-LTLFireability-02 finished in 471 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(G(p0)))))'
Support contains 4 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2024-05-21 15:39:51] [INFO ] Invariant cache hit.
[2024-05-21 15:39:51] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-21 15:39:51] [INFO ] Invariant cache hit.
[2024-05-21 15:39:51] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 15:39:51] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
Running 9 sub problems to find dead transitions.
[2024-05-21 15:39:51] [INFO ] Invariant cache hit.
[2024-05-21 15:39:51] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 12/21 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 2/23 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 0/23 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 23/23 variables, and 14 constraints, problems are : Problem set: 0 solved, 9 unsolved in 69 ms.
Refiners :[State Equation: 11/11 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 12/21 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 2/23 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/23 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/23 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 0/23 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 23/23 variables, and 23 constraints, problems are : Problem set: 0 solved, 9 unsolved in 88 ms.
Refiners :[State Equation: 11/11 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 165ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 165ms
Finished structural reductions in LTL mode , in 1 iterations and 233 ms. Remains : 11/11 places, 12/12 transitions.
Stuttering acceptance computed with spot in 185 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CryptoMiner-PT-D03N100-LTLFireability-03
Product exploration explored 100000 steps with 0 reset in 59 ms.
Product exploration explored 100000 steps with 0 reset in 113 ms.
Computed a total of 6 stabilizing places and 7 stable transitions
Graph (complete) has 26 edges and 11 vertex of which 5 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Computed a total of 6 stabilizing places and 7 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 220 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 205 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 13757 steps (4 resets) in 13 ms. (982 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 114 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 167 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 182 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 4 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2024-05-21 15:39:53] [INFO ] Invariant cache hit.
[2024-05-21 15:39:53] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-21 15:39:53] [INFO ] Invariant cache hit.
[2024-05-21 15:39:53] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 15:39:53] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
Running 9 sub problems to find dead transitions.
[2024-05-21 15:39:53] [INFO ] Invariant cache hit.
[2024-05-21 15:39:53] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 12/21 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 2/23 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 0/23 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 23/23 variables, and 14 constraints, problems are : Problem set: 0 solved, 9 unsolved in 79 ms.
Refiners :[State Equation: 11/11 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 12/21 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 2/23 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/23 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/23 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 0/23 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 23/23 variables, and 23 constraints, problems are : Problem set: 0 solved, 9 unsolved in 63 ms.
Refiners :[State Equation: 11/11 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 162ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 162ms
Finished structural reductions in LTL mode , in 1 iterations and 217 ms. Remains : 11/11 places, 12/12 transitions.
Computed a total of 6 stabilizing places and 7 stable transitions
Graph (complete) has 26 edges and 11 vertex of which 5 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Computed a total of 6 stabilizing places and 7 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 60 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 179 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 7488 steps (2 resets) in 7 ms. (936 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 101 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 164 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 179 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 184 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 62 ms.
Product exploration explored 100000 steps with 0 reset in 89 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 152 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 4 out of 11 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 11/11 places, 12/12 transitions.
Applied a total of 0 rules in 2 ms. Remains 11 /11 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2024-05-21 15:39:54] [INFO ] Redundant transitions in 0 ms returned []
Running 9 sub problems to find dead transitions.
[2024-05-21 15:39:54] [INFO ] Invariant cache hit.
[2024-05-21 15:39:54] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 12/21 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 2/23 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 0/23 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 23/23 variables, and 14 constraints, problems are : Problem set: 0 solved, 9 unsolved in 74 ms.
Refiners :[State Equation: 11/11 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 12/21 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 2/23 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/23 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/23 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 0/23 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 23/23 variables, and 23 constraints, problems are : Problem set: 0 solved, 9 unsolved in 64 ms.
Refiners :[State Equation: 11/11 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 146ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 146ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 157 ms. Remains : 11/11 places, 12/12 transitions.
Built C files in :
/tmp/ltsmin12653373745024805966
[2024-05-21 15:39:54] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12653373745024805966
Running compilation step : cd /tmp/ltsmin12653373745024805966;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 88 ms.
Running link step : cd /tmp/ltsmin12653373745024805966;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin12653373745024805966;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased14744229059599054271.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2024-05-21 15:40:09] [INFO ] Invariant cache hit.
[2024-05-21 15:40:09] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-21 15:40:09] [INFO ] Invariant cache hit.
[2024-05-21 15:40:09] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 15:40:09] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
Running 9 sub problems to find dead transitions.
[2024-05-21 15:40:09] [INFO ] Invariant cache hit.
[2024-05-21 15:40:09] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 12/21 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 2/23 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 0/23 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 23/23 variables, and 14 constraints, problems are : Problem set: 0 solved, 9 unsolved in 77 ms.
Refiners :[State Equation: 11/11 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 12/21 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 2/23 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/23 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/23 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 0/23 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 23/23 variables, and 23 constraints, problems are : Problem set: 0 solved, 9 unsolved in 69 ms.
Refiners :[State Equation: 11/11 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 149ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 150ms
Finished structural reductions in LTL mode , in 1 iterations and 211 ms. Remains : 11/11 places, 12/12 transitions.
Built C files in :
/tmp/ltsmin12068328337680025408
[2024-05-21 15:40:10] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12068328337680025408
Running compilation step : cd /tmp/ltsmin12068328337680025408;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 103 ms.
Running link step : cd /tmp/ltsmin12068328337680025408;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin12068328337680025408;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased17539398728213544652.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 15:40:25] [INFO ] Flatten gal took : 2 ms
[2024-05-21 15:40:25] [INFO ] Flatten gal took : 1 ms
[2024-05-21 15:40:25] [INFO ] Time to serialize gal into /tmp/LTL9184366652248444340.gal : 1 ms
[2024-05-21 15:40:25] [INFO ] Time to serialize properties into /tmp/LTL13410883078938017188.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9184366652248444340.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5529178921581408754.hoa' '-atoms' '/tmp/LTL13410883078938017188.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL13410883078938017188.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5529178921581408754.hoa
Reverse transition relation is NOT exact ! Due to transitions t2, t4, t5, t6, t7, Intersection with reachable at each step enabled. (destroyed/reverse/int...178
Computing Next relation with stutter on 8037 deadlock states
Detected timeout of ITS tools.
[2024-05-21 15:40:40] [INFO ] Flatten gal took : 2 ms
[2024-05-21 15:40:40] [INFO ] Flatten gal took : 2 ms
[2024-05-21 15:40:40] [INFO ] Time to serialize gal into /tmp/LTL12767928498016334132.gal : 4 ms
[2024-05-21 15:40:40] [INFO ] Time to serialize properties into /tmp/LTL450128416338543456.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12767928498016334132.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL450128416338543456.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(X(X(G("(((capacity_c0>=1)||(capacity_c1>=1))||((capacity_c2>=1)||(capacity_c3>=1)))"))))))
Formula 0 simplified : XXXF!"(((capacity_c0>=1)||(capacity_c1>=1))||((capacity_c2>=1)||(capacity_c3>=1)))"
Reverse transition relation is NOT exact ! Due to transitions t2, t4, t5, t6, t7, Intersection with reachable at each step enabled. (destroyed/reverse/int...178
Computing Next relation with stutter on 8037 deadlock states
Detected timeout of ITS tools.
[2024-05-21 15:40:55] [INFO ] Flatten gal took : 2 ms
[2024-05-21 15:40:55] [INFO ] Applying decomposition
[2024-05-21 15:40:55] [INFO ] Flatten gal took : 2 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph857418803168457482.txt' '-o' '/tmp/graph857418803168457482.bin' '-w' '/tmp/graph857418803168457482.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph857418803168457482.bin' '-l' '-1' '-v' '-w' '/tmp/graph857418803168457482.weights' '-q' '0' '-e' '0.001'
[2024-05-21 15:40:55] [INFO ] Decomposing Gal with order
[2024-05-21 15:40:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 15:40:55] [INFO ] Removed a total of 2 redundant transitions.
[2024-05-21 15:40:55] [INFO ] Flatten gal took : 24 ms
[2024-05-21 15:40:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-21 15:40:55] [INFO ] Time to serialize gal into /tmp/LTL12547417997810207971.gal : 1 ms
[2024-05-21 15:40:55] [INFO ] Time to serialize properties into /tmp/LTL8661297807012564651.ltl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12547417997810207971.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8661297807012564651.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(X(X(G("(((i0.u0.capacity_c0>=1)||(i0.u0.capacity_c1>=1))||((i0.u1.capacity_c2>=1)||(i0.u1.capacity_c3>=1)))"))))))
Formula 0 simplified : XXXF!"(((i0.u0.capacity_c0>=1)||(i0.u0.capacity_c1>=1))||((i0.u1.capacity_c2>=1)||(i0.u1.capacity_c3>=1)))"
Detected timeout of ITS tools.
Treatment of property CryptoMiner-PT-D03N100-LTLFireability-03 finished in 78982 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 X((p1&&F(!p0))))))'
Support contains 4 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2024-05-21 15:41:10] [INFO ] Invariant cache hit.
[2024-05-21 15:41:10] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-21 15:41:10] [INFO ] Invariant cache hit.
[2024-05-21 15:41:10] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 15:41:10] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
Running 9 sub problems to find dead transitions.
[2024-05-21 15:41:10] [INFO ] Invariant cache hit.
[2024-05-21 15:41:10] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 12/21 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 2/23 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 0/23 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 23/23 variables, and 14 constraints, problems are : Problem set: 0 solved, 9 unsolved in 65 ms.
Refiners :[State Equation: 11/11 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 12/21 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 2/23 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/23 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/23 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 0/23 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 23/23 variables, and 23 constraints, problems are : Problem set: 0 solved, 9 unsolved in 66 ms.
Refiners :[State Equation: 11/11 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 135ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 136ms
Finished structural reductions in LTL mode , in 1 iterations and 187 ms. Remains : 11/11 places, 12/12 transitions.
Stuttering acceptance computed with spot in 156 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), true, p0]
Running random walk in product with property : CryptoMiner-PT-D03N100-LTLFireability-04
Product exploration explored 100000 steps with 0 reset in 66 ms.
Stack based approach found an accepted trace after 23 steps with 0 reset with depth 24 and stack size 24 in 0 ms.
FORMULA CryptoMiner-PT-D03N100-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property CryptoMiner-PT-D03N100-LTLFireability-04 finished in 424 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(p1)||p0)))'
Support contains 3 out of 11 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 11/11 places, 12/12 transitions.
Applied a total of 0 rules in 2 ms. Remains 11 /11 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2024-05-21 15:41:10] [INFO ] Invariant cache hit.
[2024-05-21 15:41:10] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-05-21 15:41:10] [INFO ] Invariant cache hit.
[2024-05-21 15:41:10] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 15:41:10] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2024-05-21 15:41:10] [INFO ] Redundant transitions in 0 ms returned []
Running 9 sub problems to find dead transitions.
[2024-05-21 15:41:10] [INFO ] Invariant cache hit.
[2024-05-21 15:41:10] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 12/21 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 2/23 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 0/23 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 23/23 variables, and 14 constraints, problems are : Problem set: 0 solved, 9 unsolved in 82 ms.
Refiners :[State Equation: 11/11 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 12/21 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 2/23 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/23 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/23 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 0/23 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 23/23 variables, and 23 constraints, problems are : Problem set: 0 solved, 9 unsolved in 123 ms.
Refiners :[State Equation: 11/11 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 208ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 208ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 266 ms. Remains : 11/11 places, 12/12 transitions.
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : CryptoMiner-PT-D03N100-LTLFireability-05
Product exploration explored 100000 steps with 0 reset in 63 ms.
Product exploration explored 100000 steps with 2 reset in 79 ms.
Computed a total of 6 stabilizing places and 7 stable transitions
Graph (complete) has 26 edges and 11 vertex of which 5 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Computed a total of 6 stabilizing places and 7 stable transitions
Detected a total of 6/11 stabilizing places and 7/12 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p1)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 99 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 922 steps (0 resets) in 6 ms. (131 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p1)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F p0)]
Knowledge based reduction with 4 factoid took 149 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 61 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
[2024-05-21 15:41:11] [INFO ] Invariant cache hit.
[2024-05-21 15:41:11] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-21 15:41:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 15:41:11] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2024-05-21 15:41:11] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 15:41:11] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2024-05-21 15:41:11] [INFO ] Computed and/alt/rep : 9/15/9 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-21 15:41:11] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 3 out of 11 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 11/11 places, 12/12 transitions.
Applied a total of 0 rules in 2 ms. Remains 11 /11 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2024-05-21 15:41:11] [INFO ] Invariant cache hit.
[2024-05-21 15:41:11] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-05-21 15:41:11] [INFO ] Invariant cache hit.
[2024-05-21 15:41:11] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 15:41:12] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2024-05-21 15:41:12] [INFO ] Redundant transitions in 0 ms returned []
Running 9 sub problems to find dead transitions.
[2024-05-21 15:41:12] [INFO ] Invariant cache hit.
[2024-05-21 15:41:12] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 12/21 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 2/23 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 0/23 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 23/23 variables, and 14 constraints, problems are : Problem set: 0 solved, 9 unsolved in 68 ms.
Refiners :[State Equation: 11/11 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 12/21 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 2/23 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/23 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/23 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 0/23 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 23/23 variables, and 23 constraints, problems are : Problem set: 0 solved, 9 unsolved in 72 ms.
Refiners :[State Equation: 11/11 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 144ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 145ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 192 ms. Remains : 11/11 places, 12/12 transitions.
Computed a total of 6 stabilizing places and 7 stable transitions
Graph (complete) has 26 edges and 11 vertex of which 5 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Computed a total of 6 stabilizing places and 7 stable transitions
Detected a total of 6/11 stabilizing places and 7/12 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p1)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 188 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 1628 steps (0 resets) in 4 ms. (325 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p1)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F p0)]
Knowledge based reduction with 4 factoid took 186 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
[2024-05-21 15:41:12] [INFO ] Invariant cache hit.
[2024-05-21 15:41:12] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2024-05-21 15:41:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 15:41:12] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2024-05-21 15:41:12] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 15:41:12] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2024-05-21 15:41:12] [INFO ] Computed and/alt/rep : 9/15/9 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-21 15:41:12] [INFO ] Added : 0 causal constraints over 0 iterations in 2 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 2 reset in 53 ms.
Product exploration explored 100000 steps with 4 reset in 92 ms.
Built C files in :
/tmp/ltsmin753870318573592497
[2024-05-21 15:41:13] [INFO ] Computing symmetric may disable matrix : 12 transitions.
[2024-05-21 15:41:13] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 15:41:13] [INFO ] Computing symmetric may enable matrix : 12 transitions.
[2024-05-21 15:41:13] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 15:41:13] [INFO ] Computing Do-Not-Accords matrix : 12 transitions.
[2024-05-21 15:41:13] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 15:41:13] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin753870318573592497
Running compilation step : cd /tmp/ltsmin753870318573592497;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 81 ms.
Running link step : cd /tmp/ltsmin753870318573592497;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin753870318573592497;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13340949813087473170.hoa' '--buchi-type=spotba'
LTSmin run took 72 ms.
FORMULA CryptoMiner-PT-D03N100-LTLFireability-05 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CryptoMiner-PT-D03N100-LTLFireability-05 finished in 2378 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' '!(((!p0 U p1)&&F(G(!p2))))'
Support contains 6 out of 11 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 11/11 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2024-05-21 15:41:13] [INFO ] Invariant cache hit.
[2024-05-21 15:41:13] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-21 15:41:13] [INFO ] Invariant cache hit.
[2024-05-21 15:41:13] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 15:41:13] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2024-05-21 15:41:13] [INFO ] Redundant transitions in 0 ms returned []
Running 9 sub problems to find dead transitions.
[2024-05-21 15:41:13] [INFO ] Invariant cache hit.
[2024-05-21 15:41:13] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 12/21 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 2/23 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 0/23 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 23/23 variables, and 14 constraints, problems are : Problem set: 0 solved, 9 unsolved in 60 ms.
Refiners :[State Equation: 11/11 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 12/21 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 2/23 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/23 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/23 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 0/23 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 23/23 variables, and 23 constraints, problems are : Problem set: 0 solved, 9 unsolved in 66 ms.
Refiners :[State Equation: 11/11 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 140ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 140ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 189 ms. Remains : 11/11 places, 12/12 transitions.
Stuttering acceptance computed with spot in 121 ms :[(OR (NOT p1) p2), true, (NOT p1), p2]
Running random walk in product with property : CryptoMiner-PT-D03N100-LTLFireability-06
Product exploration explored 100000 steps with 0 reset in 57 ms.
Product exploration explored 100000 steps with 0 reset in 68 ms.
Computed a total of 6 stabilizing places and 7 stable transitions
Graph (complete) has 26 edges and 11 vertex of which 5 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Computed a total of 6 stabilizing places and 7 stable transitions
Detected a total of 6/11 stabilizing places and 7/12 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0) (NOT p2)), (X (NOT (AND (NOT p1) p0))), (X p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p2)), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p2))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 10 factoid took 272 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[p2]
RANDOM walk for 416 steps (0 resets) in 4 ms. (83 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 (NOT p0) (NOT p2)), (X (NOT (AND (NOT p1) p0))), (X p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p2)), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p2))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F p2)]
Knowledge based reduction with 10 factoid took 306 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 40 ms :[p2]
Stuttering acceptance computed with spot in 41 ms :[p2]
Support contains 1 out of 11 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 11/11 places, 12/12 transitions.
Applied a total of 0 rules in 2 ms. Remains 11 /11 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2024-05-21 15:41:14] [INFO ] Invariant cache hit.
[2024-05-21 15:41:14] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-21 15:41:14] [INFO ] Invariant cache hit.
[2024-05-21 15:41:14] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 15:41:14] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2024-05-21 15:41:14] [INFO ] Redundant transitions in 0 ms returned []
Running 9 sub problems to find dead transitions.
[2024-05-21 15:41:14] [INFO ] Invariant cache hit.
[2024-05-21 15:41:14] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 12/21 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 2/23 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 0/23 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 23/23 variables, and 14 constraints, problems are : Problem set: 0 solved, 9 unsolved in 63 ms.
Refiners :[State Equation: 11/11 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 12/21 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 2/23 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/23 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/23 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 0/23 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 23/23 variables, and 23 constraints, problems are : Problem set: 0 solved, 9 unsolved in 65 ms.
Refiners :[State Equation: 11/11 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 142ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 142ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 200 ms. Remains : 11/11 places, 12/12 transitions.
Computed a total of 6 stabilizing places and 7 stable transitions
Graph (complete) has 26 edges and 11 vertex of which 5 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Computed a total of 6 stabilizing places and 7 stable transitions
Detected a total of 6/11 stabilizing places and 7/12 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p2), (X (NOT p2)), (X (X (NOT p2))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 69 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 42 ms :[p2]
RANDOM walk for 921 steps (0 resets) in 4 ms. (184 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p2), (X (NOT p2)), (X (X (NOT p2))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F p2)]
Knowledge based reduction with 4 factoid took 114 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 41 ms :[p2]
Stuttering acceptance computed with spot in 28 ms :[p2]
Stuttering acceptance computed with spot in 28 ms :[p2]
Product exploration explored 100000 steps with 0 reset in 54 ms.
Product exploration explored 100000 steps with 0 reset in 75 ms.
Built C files in :
/tmp/ltsmin7842559038952003805
[2024-05-21 15:41:15] [INFO ] Computing symmetric may disable matrix : 12 transitions.
[2024-05-21 15:41:15] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 15:41:15] [INFO ] Computing symmetric may enable matrix : 12 transitions.
[2024-05-21 15:41:15] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 15:41:15] [INFO ] Computing Do-Not-Accords matrix : 12 transitions.
[2024-05-21 15:41:15] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 15:41:15] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7842559038952003805
Running compilation step : cd /tmp/ltsmin7842559038952003805;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 82 ms.
Running link step : cd /tmp/ltsmin7842559038952003805;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin7842559038952003805;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6814554918256985776.hoa' '--buchi-type=spotba'
LTSmin run took 81 ms.
FORMULA CryptoMiner-PT-D03N100-LTLFireability-06 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CryptoMiner-PT-D03N100-LTLFireability-06 finished in 2063 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)))'
Support contains 7 out of 11 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 11/11 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2024-05-21 15:41:15] [INFO ] Invariant cache hit.
[2024-05-21 15:41:15] [INFO ] Implicit Places using invariants in 15 ms returned []
[2024-05-21 15:41:15] [INFO ] Invariant cache hit.
[2024-05-21 15:41:15] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 15:41:15] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2024-05-21 15:41:15] [INFO ] Redundant transitions in 0 ms returned []
Running 9 sub problems to find dead transitions.
[2024-05-21 15:41:15] [INFO ] Invariant cache hit.
[2024-05-21 15:41:15] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 12/21 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 2/23 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 0/23 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 23/23 variables, and 14 constraints, problems are : Problem set: 0 solved, 9 unsolved in 66 ms.
Refiners :[State Equation: 11/11 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 12/21 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 2/23 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/23 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/23 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 0/23 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 23/23 variables, and 23 constraints, problems are : Problem set: 0 solved, 9 unsolved in 75 ms.
Refiners :[State Equation: 11/11 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 144ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 144ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 204 ms. Remains : 11/11 places, 12/12 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : CryptoMiner-PT-D03N100-LTLFireability-07
Product exploration explored 100000 steps with 0 reset in 81 ms.
Product exploration explored 100000 steps with 0 reset in 102 ms.
Computed a total of 6 stabilizing places and 7 stable transitions
Graph (complete) has 26 edges and 11 vertex of which 5 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Computed a total of 6 stabilizing places and 7 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 84 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 45 ms :[(NOT p0)]
RANDOM walk for 1138 steps (3 resets) in 4 ms. (227 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 108 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 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
[2024-05-21 15:41:16] [INFO ] Invariant cache hit.
[2024-05-21 15:41:16] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2024-05-21 15:41:16] [INFO ] Solution in real domain found non-integer solution.
Proved EG (NOT p0)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (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 3 factoid took 122 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CryptoMiner-PT-D03N100-LTLFireability-07 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CryptoMiner-PT-D03N100-LTLFireability-07 finished in 944 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))'
Support contains 1 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2024-05-21 15:41:16] [INFO ] Invariant cache hit.
[2024-05-21 15:41:16] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-21 15:41:16] [INFO ] Invariant cache hit.
[2024-05-21 15:41:16] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 15:41:16] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
Running 9 sub problems to find dead transitions.
[2024-05-21 15:41:16] [INFO ] Invariant cache hit.
[2024-05-21 15:41:16] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 12/21 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 2/23 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 0/23 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 23/23 variables, and 14 constraints, problems are : Problem set: 0 solved, 9 unsolved in 68 ms.
Refiners :[State Equation: 11/11 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 12/21 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 2/23 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/23 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/23 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 0/23 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 23/23 variables, and 23 constraints, problems are : Problem set: 0 solved, 9 unsolved in 67 ms.
Refiners :[State Equation: 11/11 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 148ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 148ms
Finished structural reductions in LTL mode , in 1 iterations and 197 ms. Remains : 11/11 places, 12/12 transitions.
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : CryptoMiner-PT-D03N100-LTLFireability-09
Entered a terminal (fully accepting) state of product in 3 steps with 1 reset in 0 ms.
FORMULA CryptoMiner-PT-D03N100-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-PT-D03N100-LTLFireability-09 finished in 293 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&&G(!p1)))&&X(X(F(p2)))))'
Support contains 3 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2024-05-21 15:41:16] [INFO ] Invariant cache hit.
[2024-05-21 15:41:16] [INFO ] Implicit Places using invariants in 15 ms returned []
[2024-05-21 15:41:16] [INFO ] Invariant cache hit.
[2024-05-21 15:41:16] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 15:41:16] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
Running 9 sub problems to find dead transitions.
[2024-05-21 15:41:16] [INFO ] Invariant cache hit.
[2024-05-21 15:41:16] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 12/21 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 2/23 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 0/23 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 23/23 variables, and 14 constraints, problems are : Problem set: 0 solved, 9 unsolved in 76 ms.
Refiners :[State Equation: 11/11 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 12/21 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 2/23 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/23 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/23 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 0/23 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 23/23 variables, and 23 constraints, problems are : Problem set: 0 solved, 9 unsolved in 65 ms.
Refiners :[State Equation: 11/11 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 167ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 167ms
Finished structural reductions in LTL mode , in 1 iterations and 204 ms. Remains : 11/11 places, 12/12 transitions.
Stuttering acceptance computed with spot in 182 ms :[(OR (NOT p2) (NOT p0) p1), (OR (NOT p0) p1), (NOT p2), p1, (NOT p2)]
Running random walk in product with property : CryptoMiner-PT-D03N100-LTLFireability-10
Product exploration explored 100000 steps with 0 reset in 59 ms.
Stack based approach found an accepted trace after 35 steps with 4 reset with depth 10 and stack size 10 in 0 ms.
FORMULA CryptoMiner-PT-D03N100-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property CryptoMiner-PT-D03N100-LTLFireability-10 finished in 460 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&F(p1))))'
Support contains 2 out of 11 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 11/11 places, 12/12 transitions.
Applied a total of 0 rules in 3 ms. Remains 11 /11 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2024-05-21 15:41:17] [INFO ] Invariant cache hit.
[2024-05-21 15:41:17] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-21 15:41:17] [INFO ] Invariant cache hit.
[2024-05-21 15:41:17] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 15:41:17] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2024-05-21 15:41:17] [INFO ] Redundant transitions in 0 ms returned []
Running 9 sub problems to find dead transitions.
[2024-05-21 15:41:17] [INFO ] Invariant cache hit.
[2024-05-21 15:41:17] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 12/21 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 2/23 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 0/23 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 23/23 variables, and 14 constraints, problems are : Problem set: 0 solved, 9 unsolved in 69 ms.
Refiners :[State Equation: 11/11 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 12/21 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 2/23 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/23 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/23 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 0/23 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 23/23 variables, and 23 constraints, problems are : Problem set: 0 solved, 9 unsolved in 85 ms.
Refiners :[State Equation: 11/11 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 171ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 172ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 236 ms. Remains : 11/11 places, 12/12 transitions.
Stuttering acceptance computed with spot in 169 ms :[(NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : CryptoMiner-PT-D03N100-LTLFireability-13
Product exploration explored 100000 steps with 16 reset in 55 ms.
Stack based approach found an accepted trace after 21 steps with 0 reset with depth 22 and stack size 22 in 0 ms.
FORMULA CryptoMiner-PT-D03N100-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property CryptoMiner-PT-D03N100-LTLFireability-13 finished in 479 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 3 out of 11 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 11/11 places, 12/12 transitions.
Graph (trivial) has 4 edges and 11 vertex of which 4 / 11 are part of one of the 1 SCC in 2 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Applied a total of 1 rules in 11 ms. Remains 8 /11 variables (removed 3) and now considering 9/12 (removed 3) transitions.
// Phase 1: matrix 9 rows 8 cols
[2024-05-21 15:41:17] [INFO ] Computed 0 invariants in 2 ms
[2024-05-21 15:41:17] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-21 15:41:17] [INFO ] Invariant cache hit.
[2024-05-21 15:41:17] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 15:41:17] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2024-05-21 15:41:17] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2024-05-21 15:41:17] [INFO ] Invariant cache hit.
[2024-05-21 15:41:17] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 8/15 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 1/16 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/16 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/16 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 16/17 variables, and 11 constraints, problems are : Problem set: 0 solved, 6 unsolved in 43 ms.
Refiners :[State Equation: 8/8 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 8/15 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 1/16 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/16 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/16 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 0/16 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 16/17 variables, and 17 constraints, problems are : Problem set: 0 solved, 6 unsolved in 44 ms.
Refiners :[State Equation: 8/8 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 103ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 104ms
Starting structural reductions in SI_LTL mode, iteration 1 : 8/11 places, 9/12 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 176 ms. Remains : 8/11 places, 9/12 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : CryptoMiner-PT-D03N100-LTLFireability-14
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA CryptoMiner-PT-D03N100-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-PT-D03N100-LTLFireability-14 finished in 222 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((X(p0)&&F(p1))))'
Support contains 2 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 12/12 (removed 0) transitions.
// Phase 1: matrix 12 rows 11 cols
[2024-05-21 15:41:17] [INFO ] Computed 0 invariants in 1 ms
[2024-05-21 15:41:17] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-05-21 15:41:17] [INFO ] Invariant cache hit.
[2024-05-21 15:41:17] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 15:41:17] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
Running 9 sub problems to find dead transitions.
[2024-05-21 15:41:17] [INFO ] Invariant cache hit.
[2024-05-21 15:41:17] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 12/21 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 2/23 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 0/23 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 23/23 variables, and 14 constraints, problems are : Problem set: 0 solved, 9 unsolved in 69 ms.
Refiners :[State Equation: 11/11 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 12/21 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 2/23 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/23 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/23 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 0/23 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 23/23 variables, and 23 constraints, problems are : Problem set: 0 solved, 9 unsolved in 72 ms.
Refiners :[State Equation: 11/11 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 146ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 146ms
Finished structural reductions in LTL mode , in 1 iterations and 194 ms. Remains : 11/11 places, 12/12 transitions.
Stuttering acceptance computed with spot in 84 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : CryptoMiner-PT-D03N100-LTLFireability-15
Product exploration explored 100000 steps with 28 reset in 125 ms.
Stack based approach found an accepted trace after 11 steps with 0 reset with depth 12 and stack size 12 in 1 ms.
FORMULA CryptoMiner-PT-D03N100-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property CryptoMiner-PT-D03N100-LTLFireability-15 finished in 428 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(G(p0)))))'
Found a Lengthening insensitive property : CryptoMiner-PT-D03N100-LTLFireability-03
Stuttering acceptance computed with spot in 145 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 4 out of 11 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 11/11 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2024-05-21 15:41:18] [INFO ] Invariant cache hit.
[2024-05-21 15:41:18] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-21 15:41:18] [INFO ] Invariant cache hit.
[2024-05-21 15:41:18] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 15:41:18] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
Running 9 sub problems to find dead transitions.
[2024-05-21 15:41:18] [INFO ] Invariant cache hit.
[2024-05-21 15:41:18] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 12/21 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 2/23 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 0/23 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 23/23 variables, and 14 constraints, problems are : Problem set: 0 solved, 9 unsolved in 65 ms.
Refiners :[State Equation: 11/11 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 12/21 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 2/23 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/23 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/23 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 0/23 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 23/23 variables, and 23 constraints, problems are : Problem set: 0 solved, 9 unsolved in 68 ms.
Refiners :[State Equation: 11/11 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 137ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 139ms
Finished structural reductions in LI_LTL mode , in 1 iterations and 205 ms. Remains : 11/11 places, 12/12 transitions.
Running random walk in product with property : CryptoMiner-PT-D03N100-LTLFireability-03
Product exploration explored 100000 steps with 0 reset in 79 ms.
Product exploration explored 100000 steps with 0 reset in 91 ms.
Computed a total of 6 stabilizing places and 7 stable transitions
Graph (complete) has 26 edges and 11 vertex of which 5 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Computed a total of 6 stabilizing places and 7 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 75 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 145 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 16992 steps (4 resets) in 5 ms. (2832 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 85 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 154 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 157 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 4 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2024-05-21 15:41:19] [INFO ] Invariant cache hit.
[2024-05-21 15:41:19] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-05-21 15:41:19] [INFO ] Invariant cache hit.
[2024-05-21 15:41:19] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 15:41:19] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
Running 9 sub problems to find dead transitions.
[2024-05-21 15:41:19] [INFO ] Invariant cache hit.
[2024-05-21 15:41:19] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 12/21 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 2/23 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 0/23 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 23/23 variables, and 14 constraints, problems are : Problem set: 0 solved, 9 unsolved in 73 ms.
Refiners :[State Equation: 11/11 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 12/21 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 2/23 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/23 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/23 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 0/23 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 23/23 variables, and 23 constraints, problems are : Problem set: 0 solved, 9 unsolved in 80 ms.
Refiners :[State Equation: 11/11 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 157ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 158ms
Finished structural reductions in LTL mode , in 1 iterations and 207 ms. Remains : 11/11 places, 12/12 transitions.
Computed a total of 6 stabilizing places and 7 stable transitions
Graph (complete) has 26 edges and 11 vertex of which 5 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Computed a total of 6 stabilizing places and 7 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 84 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 157 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 17068 steps (4 resets) in 6 ms. (2438 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 88 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 148 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 148 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 156 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 51 ms.
Product exploration explored 100000 steps with 0 reset in 72 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 161 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 4 out of 11 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 11/11 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2024-05-21 15:41:20] [INFO ] Redundant transitions in 0 ms returned []
Running 9 sub problems to find dead transitions.
[2024-05-21 15:41:20] [INFO ] Invariant cache hit.
[2024-05-21 15:41:20] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 12/21 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 2/23 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 0/23 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 23/23 variables, and 14 constraints, problems are : Problem set: 0 solved, 9 unsolved in 71 ms.
Refiners :[State Equation: 11/11 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 12/21 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 2/23 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/23 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/23 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 0/23 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 23/23 variables, and 23 constraints, problems are : Problem set: 0 solved, 9 unsolved in 61 ms.
Refiners :[State Equation: 11/11 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 137ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 137ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 142 ms. Remains : 11/11 places, 12/12 transitions.
Built C files in :
/tmp/ltsmin17085471848390166463
[2024-05-21 15:41:20] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17085471848390166463
Running compilation step : cd /tmp/ltsmin17085471848390166463;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 90 ms.
Running link step : cd /tmp/ltsmin17085471848390166463;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin17085471848390166463;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased16456650028610436001.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2024-05-21 15:41:36] [INFO ] Invariant cache hit.
[2024-05-21 15:41:36] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-05-21 15:41:36] [INFO ] Invariant cache hit.
[2024-05-21 15:41:36] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 15:41:36] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
Running 9 sub problems to find dead transitions.
[2024-05-21 15:41:36] [INFO ] Invariant cache hit.
[2024-05-21 15:41:36] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 12/21 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 2/23 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 0/23 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 23/23 variables, and 14 constraints, problems are : Problem set: 0 solved, 9 unsolved in 69 ms.
Refiners :[State Equation: 11/11 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 12/21 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 2/23 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/23 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/23 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 0/23 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 23/23 variables, and 23 constraints, problems are : Problem set: 0 solved, 9 unsolved in 67 ms.
Refiners :[State Equation: 11/11 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 142ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 145ms
Finished structural reductions in LTL mode , in 1 iterations and 205 ms. Remains : 11/11 places, 12/12 transitions.
Built C files in :
/tmp/ltsmin14602682998949876467
[2024-05-21 15:41:36] [INFO ] Built C files in 0ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14602682998949876467
Running compilation step : cd /tmp/ltsmin14602682998949876467;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 96 ms.
Running link step : cd /tmp/ltsmin14602682998949876467;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin14602682998949876467;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased13426812540913637406.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 15:41:51] [INFO ] Flatten gal took : 2 ms
[2024-05-21 15:41:51] [INFO ] Flatten gal took : 1 ms
[2024-05-21 15:41:51] [INFO ] Time to serialize gal into /tmp/LTL14276423037295261055.gal : 0 ms
[2024-05-21 15:41:51] [INFO ] Time to serialize properties into /tmp/LTL17037464514130793865.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14276423037295261055.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7622087817573136389.hoa' '-atoms' '/tmp/LTL17037464514130793865.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL17037464514130793865.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7622087817573136389.hoa
Reverse transition relation is NOT exact ! Due to transitions t2, t4, t5, t6, t7, Intersection with reachable at each step enabled. (destroyed/reverse/int...178
Computing Next relation with stutter on 8037 deadlock states
Detected timeout of ITS tools.
[2024-05-21 15:42:06] [INFO ] Flatten gal took : 1 ms
[2024-05-21 15:42:06] [INFO ] Flatten gal took : 1 ms
[2024-05-21 15:42:06] [INFO ] Time to serialize gal into /tmp/LTL16985078234981475254.gal : 0 ms
[2024-05-21 15:42:06] [INFO ] Time to serialize properties into /tmp/LTL18067422602719781890.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16985078234981475254.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18067422602719781890.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(X(X(G("(((capacity_c0>=1)||(capacity_c1>=1))||((capacity_c2>=1)||(capacity_c3>=1)))"))))))
Formula 0 simplified : XXXF!"(((capacity_c0>=1)||(capacity_c1>=1))||((capacity_c2>=1)||(capacity_c3>=1)))"
Reverse transition relation is NOT exact ! Due to transitions t2, t4, t5, t6, t7, Intersection with reachable at each step enabled. (destroyed/reverse/int...178
Computing Next relation with stutter on 8037 deadlock states
Detected timeout of ITS tools.
[2024-05-21 15:42:21] [INFO ] Flatten gal took : 3 ms
[2024-05-21 15:42:21] [INFO ] Applying decomposition
[2024-05-21 15:42:21] [INFO ] Flatten gal took : 2 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph18443136660983839880.txt' '-o' '/tmp/graph18443136660983839880.bin' '-w' '/tmp/graph18443136660983839880.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph18443136660983839880.bin' '-l' '-1' '-v' '-w' '/tmp/graph18443136660983839880.weights' '-q' '0' '-e' '0.001'
[2024-05-21 15:42:21] [INFO ] Decomposing Gal with order
[2024-05-21 15:42:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 15:42:21] [INFO ] Removed a total of 2 redundant transitions.
[2024-05-21 15:42:21] [INFO ] Flatten gal took : 2 ms
[2024-05-21 15:42:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-21 15:42:21] [INFO ] Time to serialize gal into /tmp/LTL16822844665693559443.gal : 1 ms
[2024-05-21 15:42:21] [INFO ] Time to serialize properties into /tmp/LTL2616492623066659101.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16822844665693559443.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2616492623066659101.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(X(X(G("(((i0.u0.capacity_c0>=1)||(i0.u0.capacity_c1>=1))||((i0.u1.capacity_c2>=1)||(i0.u1.capacity_c3>=1)))"))))))
Formula 0 simplified : XXXF!"(((i0.u0.capacity_c0>=1)||(i0.u0.capacity_c1>=1))||((i0.u1.capacity_c2>=1)||(i0.u1.capacity_c3>=1)))"
Detected timeout of ITS tools.
Treatment of property CryptoMiner-PT-D03N100-LTLFireability-03 finished in 78385 ms.
[2024-05-21 15:42:36] [INFO ] Flatten gal took : 2 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin771447513295269090
[2024-05-21 15:42:36] [INFO ] Computing symmetric may disable matrix : 12 transitions.
[2024-05-21 15:42:36] [INFO ] Applying decomposition
[2024-05-21 15:42:36] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 15:42:36] [INFO ] Computing symmetric may enable matrix : 12 transitions.
[2024-05-21 15:42:36] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 15:42:36] [INFO ] Flatten gal took : 1 ms
[2024-05-21 15:42:36] [INFO ] Computing Do-Not-Accords matrix : 12 transitions.
[2024-05-21 15:42:36] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 15:42:36] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin771447513295269090
Running compilation step : cd /tmp/ltsmin771447513295269090;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph11895054317031835519.txt' '-o' '/tmp/graph11895054317031835519.bin' '-w' '/tmp/graph11895054317031835519.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11895054317031835519.bin' '-l' '-1' '-v' '-w' '/tmp/graph11895054317031835519.weights' '-q' '0' '-e' '0.001'
[2024-05-21 15:42:36] [INFO ] Decomposing Gal with order
[2024-05-21 15:42:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 15:42:36] [INFO ] Removed a total of 2 redundant transitions.
[2024-05-21 15:42:36] [INFO ] Flatten gal took : 2 ms
[2024-05-21 15:42:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-21 15:42:36] [INFO ] Time to serialize gal into /tmp/LTLFireability4571517494175441868.gal : 1 ms
[2024-05-21 15:42:36] [INFO ] Time to serialize properties into /tmp/LTLFireability11510823651989257820.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability4571517494175441868.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability11510823651989257820.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(X(X(G("(((i0.u1.capacity_c0>=1)||(i0.u0.capacity_c1>=1))||((i0.u0.capacity_c2>=1)||(i0.u1.capacity_c3>=1)))"))))))
Formula 0 simplified : XXXF!"(((i0.u1.capacity_c0>=1)||(i0.u0.capacity_c1>=1))||((i0.u0.capacity_c2>=1)||(i0.u1.capacity_c3>=1)))"
Compilation finished in 93 ms.
Running link step : cd /tmp/ltsmin771447513295269090;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin771447513295269090;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(X([]((LTLAPp0==true)))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t2, t6, u2.t5, u3.t4, u3.t7, Intersection with reachable at each step enabled. (destroyed/re...187
Computing Next relation with stutter on 8037 deadlock states
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 2/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.003: Loading model from ./gal.so
pins2lts-mc-linux64( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.002: LTL layer: formula: X(X(X([]((LTLAPp0==true)))))
pins2lts-mc-linux64( 2/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.002: "X(X(X([]((LTLAPp0==true)))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.002: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.006: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.012: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.182: DFS-FIFO for weak LTL, using special progress label 14
pins2lts-mc-linux64( 0/ 8), 0.182: There are 15 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.182: State length is 12, there are 18 groups
pins2lts-mc-linux64( 0/ 8), 0.182: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.182: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.182: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.182: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 3/ 8), 0.188: ~1 levels ~960 states ~3288 transitions
pins2lts-mc-linux64( 3/ 8), 0.208: ~1 levels ~1920 states ~6984 transitions
pins2lts-mc-linux64( 3/ 8), 0.214: ~1 levels ~3840 states ~14696 transitions
pins2lts-mc-linux64( 3/ 8), 0.254: ~1 levels ~7680 states ~30272 transitions
pins2lts-mc-linux64( 3/ 8), 0.307: ~1 levels ~15360 states ~63984 transitions
pins2lts-mc-linux64( 3/ 8), 0.383: ~1 levels ~30720 states ~132968 transitions
pins2lts-mc-linux64( 0/ 8), 0.525: ~1 levels ~61440 states ~238328 transitions
pins2lts-mc-linux64( 0/ 8), 0.807: ~1 levels ~122880 states ~490896 transitions
pins2lts-mc-linux64( 0/ 8), 1.203: ~1 levels ~245760 states ~1005224 transitions
pins2lts-mc-linux64( 0/ 8), 1.845: ~1 levels ~491520 states ~2062480 transitions
pins2lts-mc-linux64( 0/ 8), 2.520: ~1 levels ~983040 states ~4269160 transitions
pins2lts-mc-linux64( 3/ 8), 3.366: ~1 levels ~1966080 states ~9181848 transitions
pins2lts-mc-linux64( 3/ 8), 4.761: ~1 levels ~3932160 states ~18217896 transitions
pins2lts-mc-linux64( 3/ 8), 7.722: ~1 levels ~7864320 states ~36648632 transitions
pins2lts-mc-linux64( 3/ 8), 13.602: ~1 levels ~15728640 states ~73929912 transitions
pins2lts-mc-linux64( 3/ 8), 26.080: ~1 levels ~31457280 states ~149268640 transitions
pins2lts-mc-linux64( 3/ 8), 51.949: ~1 levels ~62914560 states ~301513184 transitions
pins2lts-mc-linux64( 5/ 8), 107.964: ~1 levels ~125829120 states ~583489160 transitions
pins2lts-mc-linux64( 4/ 8), 129.366: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 129.403:
pins2lts-mc-linux64( 0/ 8), 129.403: mean standard work distribution: 3.7% (states) 4.3% (transitions)
pins2lts-mc-linux64( 0/ 8), 129.403:
pins2lts-mc-linux64( 0/ 8), 129.403: Explored 127396705 states 605557654 transitions, fanout: 4.753
pins2lts-mc-linux64( 0/ 8), 129.403: Total exploration time 129.220 sec (129.180 sec minimum, 129.193 sec on average)
pins2lts-mc-linux64( 0/ 8), 129.403: States per second: 985890, Transitions per second: 4686253
pins2lts-mc-linux64( 0/ 8), 129.403:
pins2lts-mc-linux64( 0/ 8), 129.403: Progress states detected: 134217192
pins2lts-mc-linux64( 0/ 8), 129.403: Redundant explorations: -5.0817
pins2lts-mc-linux64( 0/ 8), 129.403:
pins2lts-mc-linux64( 0/ 8), 129.403: Queue width: 8B, total height: 13333735, memory: 101.73MB
pins2lts-mc-linux64( 0/ 8), 129.403: Tree memory: 1028.3MB, 8.0 B/state, compr.: 16.1%
pins2lts-mc-linux64( 0/ 8), 129.403: Tree fill ratio (roots/leafs): 99.0%/1.0%
pins2lts-mc-linux64( 0/ 8), 129.403: Stored 12 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 129.403: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 129.403: Est. total memory use: 1130.1MB (~1125.7MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin771447513295269090;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(X([]((LTLAPp0==true)))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin771447513295269090;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(X([]((LTLAPp0==true)))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:241)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:176)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:114)
at java.base/java.lang.Thread.run(Thread.java:840)
Detected timeout of ITS tools.
[2024-05-21 16:03:34] [INFO ] Flatten gal took : 4 ms
[2024-05-21 16:03:34] [INFO ] Time to serialize gal into /tmp/LTLFireability7306182790170525071.gal : 1 ms
[2024-05-21 16:03:34] [INFO ] Time to serialize properties into /tmp/LTLFireability3610512526898181246.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability7306182790170525071.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability3610512526898181246.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...297
Read 1 LTL properties
Checking formula 0 : !((X(X(X(G("(((capacity_c0>=1)||(capacity_c1>=1))||((capacity_c2>=1)||(capacity_c3>=1)))"))))))
Formula 0 simplified : XXXF!"(((capacity_c0>=1)||(capacity_c1>=1))||((capacity_c2>=1)||(capacity_c3>=1)))"
Reverse transition relation is NOT exact ! Due to transitions t2, t4, t5, t6, t7, Intersection with reachable at each step enabled. (destroyed/reverse/int...178
Computing Next relation with stutter on 8037 deadlock states
6 unique states visited
6 strongly connected components in search stack
6 transitions explored
6 items max in DFS search stack
7017 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,70.1843,934504,1,0,556,5.01944e+06,53,630,908,5.87376e+06,1578
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA CryptoMiner-PT-D03N100-LTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 1510782 ms.

BK_STOP 1716307491167

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CryptoMiner-PT-D03N100"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is CryptoMiner-PT-D03N100, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r092-tall-171624189200380"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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