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.r109-tall-171624208100238.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 gold2023
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 r109-tall-171624208100238
=====================================================================

--------------------
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 1716317795031

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CryptoMiner-PT-D03N100
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-21 18:56:36] [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 18:56:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 18:56:36] [INFO ] Load time of PNML (sax parser for PT used): 20 ms
[2024-05-21 18:56:36] [INFO ] Transformed 12 places.
[2024-05-21 18:56:36] [INFO ] Transformed 12 transitions.
[2024-05-21 18:56:36] [INFO ] Parsed PT model containing 12 places and 12 transitions and 34 arcs in 76 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 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 263 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 18:56:36] [INFO ] Computed 0 invariants in 5 ms
[2024-05-21 18:56:37] [INFO ] Implicit Places using invariants in 102 ms returned []
[2024-05-21 18:56:37] [INFO ] Invariant cache hit.
[2024-05-21 18:56:37] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 18:56:37] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 201 ms to find 0 implicit places.
[2024-05-21 18:56:37] [INFO ] Invariant cache hit.
[2024-05-21 18:56:37] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 11/12 places, 12/12 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 529 ms. Remains : 11/12 places, 12/12 transitions.
Support contains 8 out of 11 places after structural reductions.
[2024-05-21 18:56:37] [INFO ] Flatten gal took : 11 ms
[2024-05-21 18:56:37] [INFO ] Flatten gal took : 3 ms
[2024-05-21 18:56:37] [INFO ] Input system was already deterministic with 12 transitions.
Finished random walk after 3439 steps, including 1 resets, run visited all 12 properties in 13 ms. (steps per millisecond=264 )
Parikh walk visited 0 properties in 1 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.2 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/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 18:56:37] [INFO ] Invariant cache hit.
[2024-05-21 18:56:37] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-21 18:56:37] [INFO ] Invariant cache hit.
[2024-05-21 18:56:37] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 18:56:37] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2024-05-21 18:56:37] [INFO ] Invariant cache hit.
[2024-05-21 18:56:37] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 84 ms. Remains : 11/11 places, 12/12 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 384 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 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (AND (NOT p1) (NOT p2))), acceptance={0, 1} source=1 dest: 1}, { cond=(OR (AND p0 p1) (AND p0 p2)), acceptance={1} source=1 dest: 2}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0, 1} source=2 dest: 1}, { cond=p0, acceptance={1} source=2 dest: 2}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), acceptance={0, 1} source=3 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={1} source=3 dest: 2}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p1) p2)), acceptance={0} source=3 dest: 3}, { cond=(AND p0 p1 p2), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=4 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={1} source=4 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={0} source=4 dest: 3}, { cond=(AND p0 p2), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (LT s7 1) (LT s8 1) (LT s9 1)), p1:(OR (GEQ s7 1) (GEQ s8 1) (GEQ s9 1) (AND (LT s0 1) (LT s1 1) (LT s2 1) (LT s3 1))), p2:(OR (LT s0 1) (LT s7 1)...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 219 ms.
Product exploration explored 100000 steps with 0 reset in 278 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 (NOT p0) p1 (NOT p2)), (X (OR (NOT p0) (AND (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (OR (AND p0 p1) (AND p0 p2)))), (X (X (OR (NOT p0) (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (OR (AND p0 p1) (AND p0 p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(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 11 factoid took 457 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 426 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]
Incomplete random walk after 10023 steps, including 4 resets, run finished after 20 ms. (steps per millisecond=501 ) properties (out of 12) seen :10
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-21 18:56:39] [INFO ] Invariant cache hit.
[2024-05-21 18:56:39] [INFO ] After 21ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (OR (NOT p0) (AND (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (OR (AND p0 p1) (AND p0 p2)))), (X (X (OR (NOT p0) (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (OR (AND p0 p1) (AND p0 p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND (NOT p2) p0))), (G (NOT (AND p1 (NOT p2) p0)))]
False Knowledge obtained : [(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 (AND (NOT p2) (NOT p0)))), (F (OR (AND (NOT p1) p2) (AND p2 (NOT p0)))), (F (NOT (OR (AND (NOT p1) (NOT p2)) (NOT p0)))), (F (AND p1 p2 p0)), (F (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p2) (NOT p0))))), (F p0), (F (OR (AND p1 p0) (AND p2 p0))), (F (AND (NOT p1) p2 p0)), (F (AND p2 p0)), (F (AND p2 (NOT p0)))]
Knowledge based reduction with 13 factoid took 1224 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 390 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 385 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 18:56:41] [INFO ] Invariant cache hit.
[2024-05-21 18:56:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 18:56:41] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-21 18:56:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 18:56:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 18:56:41] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-05-21 18:56:41] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 18:56:41] [INFO ] [Nat]Added 3 Read/Feed constraints in 0 ms returned sat
[2024-05-21 18:56:41] [INFO ] Computed and/alt/rep : 9/15/9 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-21 18:56:41] [INFO ] Added : 2 causal constraints over 1 iterations in 8 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 4 ms. Remains 11 /11 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2024-05-21 18:56:41] [INFO ] Invariant cache hit.
[2024-05-21 18:56:41] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-21 18:56:41] [INFO ] Invariant cache hit.
[2024-05-21 18:56:41] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 18:56:41] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2024-05-21 18:56:41] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-21 18:56:41] [INFO ] Invariant cache hit.
[2024-05-21 18:56:42] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 88 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 p0))), (X (NOT (OR (AND p1 p0) (AND p2 p0)))), (X (NOT (AND p1 (NOT p2) p0))), (X (OR (AND (NOT p1) (NOT p2)) (NOT p0))), (X (NOT (AND (NOT p1) p2 p0))), (X (NOT (AND p1 p2 p0))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT p0)), (X (X (NOT (AND p1 p0)))), (X (X (NOT (OR (AND p1 p0) (AND p2 p0))))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (OR (AND (NOT p1) (NOT p2)) (NOT p0)))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND p1 p2 p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (OR (AND (NOT p1) p2) (AND p2 (NOT p0)))), (X (NOT (OR (AND (NOT p1) p2) (AND p2 (NOT p0))))), (X (X (NOT p2))), (X (X 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 18 factoid took 913 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 409 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]
Incomplete random walk after 10013 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=770 ) properties (out of 12) seen :10
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-21 18:56:43] [INFO ] Invariant cache hit.
[2024-05-21 18:56:43] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p0) (NOT p2)), (X (NOT (AND p1 p0))), (X (NOT (OR (AND p1 p0) (AND p2 p0)))), (X (NOT (AND p1 (NOT p2) p0))), (X (OR (AND (NOT p1) (NOT p2)) (NOT p0))), (X (NOT (AND (NOT p1) p2 p0))), (X (NOT (AND p1 p2 p0))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT p0)), (X (X (NOT (AND p1 p0)))), (X (X (NOT (OR (AND p1 p0) (AND p2 p0))))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (OR (AND (NOT p1) (NOT p2)) (NOT p0)))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND p1 p2 p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND (NOT p1) (NOT p2) p0))), (G (NOT (AND p1 (NOT p2) p0)))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (OR (AND (NOT p1) p2) (AND p2 (NOT p0)))), (X (NOT (OR (AND (NOT p1) p2) (AND p2 (NOT p0))))), (X (X (NOT p2))), (X (X 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 p2), (F p0), (F (OR (AND (NOT p1) p2) (AND p2 (NOT p0)))), (F (AND p1 p2 p0)), (F (AND (NOT p1) p2 p0)), (F (NOT (OR (AND (NOT p1) (NOT p2)) (NOT p0)))), (F (OR (AND p1 p0) (AND p2 p0))), (F (AND (NOT p1) p0)), (F (AND p2 (NOT p0))), (F (AND p1 p0))]
Knowledge based reduction with 20 factoid took 2566 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 369 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 352 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 18:56:46] [INFO ] Invariant cache hit.
[2024-05-21 18:56:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 18:56:46] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-05-21 18:56:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 18:56:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 18:56:46] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-21 18:56:46] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 18:56:46] [INFO ] [Nat]Added 3 Read/Feed constraints in 0 ms returned sat
[2024-05-21 18:56:46] [INFO ] Computed and/alt/rep : 9/15/9 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-21 18:56:46] [INFO ] Added : 2 causal constraints over 1 iterations in 5 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 351 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 147 ms.
Product exploration explored 100000 steps with 0 reset in 229 ms.
Built C files in :
/tmp/ltsmin5949154906482840857
[2024-05-21 18:56:47] [INFO ] Computing symmetric may disable matrix : 12 transitions.
[2024-05-21 18:56:47] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 18:56:47] [INFO ] Computing symmetric may enable matrix : 12 transitions.
[2024-05-21 18:56:47] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 18:56:47] [INFO ] Computing Do-Not-Accords matrix : 12 transitions.
[2024-05-21 18:56:47] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 18:56:47] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5949154906482840857
Running compilation step : cd /tmp/ltsmin5949154906482840857;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 170 ms.
Running link step : cd /tmp/ltsmin5949154906482840857;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin5949154906482840857;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased2585467971706582628.hoa' '--buchi-type=spotba'
LTSmin run took 108 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 10385 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/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 0 ms. Remains 11 /11 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2024-05-21 18:56:48] [INFO ] Invariant cache hit.
[2024-05-21 18:56:48] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-21 18:56:48] [INFO ] Invariant cache hit.
[2024-05-21 18:56:48] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 18:56:48] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
[2024-05-21 18:56:48] [INFO ] Invariant cache hit.
[2024-05-21 18:56:48] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 88 ms. Remains : 11/11 places, 12/12 transitions.
Stuttering acceptance computed with spot in 213 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 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 5}], [{ cond=(AND (NOT p1) p2), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=p1, acceptance={0} source=1 dest: 5}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 5}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(OR (NOT p0) p1), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=4, aps=[p1:(OR (LT s0 1) (LT s7 1)), p2:(GEQ s10 1), p0:(AND (GEQ s0 1) (GEQ s7 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 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 321 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/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 18:56:48] [INFO ] Invariant cache hit.
[2024-05-21 18:56:48] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-21 18:56:48] [INFO ] Invariant cache hit.
[2024-05-21 18:56:48] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 18:56:48] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
[2024-05-21 18:56:48] [INFO ] Invariant cache hit.
[2024-05-21 18:56:48] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 90 ms. Remains : 11/11 places, 12/12 transitions.
Stuttering acceptance computed with spot in 242 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 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 3}, { cond=p0, acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND p1 p2), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p1) p2), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(AND (LT s7 1) (LT s8 1) (LT s9 1)), p1:(OR (GEQ s7 1) (GEQ s8 1) (GEQ s9 1)), p2:(OR (LT s0 1) (LT s7 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 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 357 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/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 18:56:48] [INFO ] Invariant cache hit.
[2024-05-21 18:56:48] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-21 18:56:48] [INFO ] Invariant cache hit.
[2024-05-21 18:56:48] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 18:56:48] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
[2024-05-21 18:56:48] [INFO ] Invariant cache hit.
[2024-05-21 18:56:48] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 95 ms. Remains : 11/11 places, 12/12 transitions.
Stuttering acceptance computed with spot in 243 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CryptoMiner-PT-D03N100-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(OR (GEQ s0 1) (GEQ s1 1) (GEQ s2 1) (GEQ s3 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 77 ms.
Product exploration explored 100000 steps with 0 reset in 112 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, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 69 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 163 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 3439 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=1719 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 87 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 171 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 172 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 18:56:49] [INFO ] Invariant cache hit.
[2024-05-21 18:56:49] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-21 18:56:49] [INFO ] Invariant cache hit.
[2024-05-21 18:56:50] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 18:56:50] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
[2024-05-21 18:56:50] [INFO ] Invariant cache hit.
[2024-05-21 18:56:50] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 89 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, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 68 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 185 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 101 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=101 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 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 164 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 145 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 195 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 87 ms.
Product exploration explored 100000 steps with 0 reset in 80 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 159 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 18:56:51] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-21 18:56:51] [INFO ] Invariant cache hit.
[2024-05-21 18:56:51] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 37 ms. Remains : 11/11 places, 12/12 transitions.
Built C files in :
/tmp/ltsmin28480906933178618
[2024-05-21 18:56:51] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin28480906933178618
Running compilation step : cd /tmp/ltsmin28480906933178618;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 77 ms.
Running link step : cd /tmp/ltsmin28480906933178618;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin28480906933178618;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased10996935613448706245.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 18:57:06] [INFO ] Invariant cache hit.
[2024-05-21 18:57:06] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-21 18:57:06] [INFO ] Invariant cache hit.
[2024-05-21 18:57:06] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 18:57:06] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2024-05-21 18:57:06] [INFO ] Invariant cache hit.
[2024-05-21 18:57:06] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 72 ms. Remains : 11/11 places, 12/12 transitions.
Built C files in :
/tmp/ltsmin16599024573733246118
[2024-05-21 18:57:06] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16599024573733246118
Running compilation step : cd /tmp/ltsmin16599024573733246118;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 83 ms.
Running link step : cd /tmp/ltsmin16599024573733246118;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin16599024573733246118;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased13264748070315239384.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 18:57:21] [INFO ] Flatten gal took : 2 ms
[2024-05-21 18:57:21] [INFO ] Flatten gal took : 2 ms
[2024-05-21 18:57:21] [INFO ] Time to serialize gal into /tmp/LTL1788203678673057480.gal : 1 ms
[2024-05-21 18:57:21] [INFO ] Time to serialize properties into /tmp/LTL3373371074734668827.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1788203678673057480.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3795789824565351407.hoa' '-atoms' '/tmp/LTL3373371074734668827.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL3373371074734668827.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3795789824565351407.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 18:57:36] [INFO ] Flatten gal took : 2 ms
[2024-05-21 18:57:36] [INFO ] Flatten gal took : 2 ms
[2024-05-21 18:57:36] [INFO ] Time to serialize gal into /tmp/LTL345285521018695478.gal : 3 ms
[2024-05-21 18:57:36] [INFO ] Time to serialize properties into /tmp/LTL10592288627811560562.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL345285521018695478.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10592288627811560562.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.202304061127/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 18:57:51] [INFO ] Flatten gal took : 4 ms
[2024-05-21 18:57:51] [INFO ] Applying decomposition
[2024-05-21 18:57:51] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph8752213099767792247.txt' '-o' '/tmp/graph8752213099767792247.bin' '-w' '/tmp/graph8752213099767792247.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph8752213099767792247.bin' '-l' '-1' '-v' '-w' '/tmp/graph8752213099767792247.weights' '-q' '0' '-e' '0.001'
[2024-05-21 18:57:51] [INFO ] Decomposing Gal with order
[2024-05-21 18:57:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 18:57:51] [INFO ] Removed a total of 2 redundant transitions.
[2024-05-21 18:57:51] [INFO ] Flatten gal took : 20 ms
[2024-05-21 18:57:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-21 18:57:51] [INFO ] Time to serialize gal into /tmp/LTL5334777974838948424.gal : 1 ms
[2024-05-21 18:57:51] [INFO ] Time to serialize properties into /tmp/LTL4785812946582039754.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5334777974838948424.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4785812946582039754.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
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)))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12236426883767850522
[2024-05-21 18:58:06] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12236426883767850522
Running compilation step : cd /tmp/ltsmin12236426883767850522;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 74 ms.
Running link step : cd /tmp/ltsmin12236426883767850522;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin12236426883767850522;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(X([]((LTLAPp0==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property CryptoMiner-PT-D03N100-LTLFireability-03 finished in 93355 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/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 1 ms. Remains 11 /11 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2024-05-21 18:58:22] [INFO ] Invariant cache hit.
[2024-05-21 18:58:22] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-21 18:58:22] [INFO ] Invariant cache hit.
[2024-05-21 18:58:22] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 18:58:22] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2024-05-21 18:58:22] [INFO ] Invariant cache hit.
[2024-05-21 18:58:22] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 89 ms. Remains : 11/11 places, 12/12 transitions.
Stuttering acceptance computed with spot in 192 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 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}, { cond=(AND p0 p1), acceptance={} source=1 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={0} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=p0, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (LT s7 1) (LT s8 1) (LT s9 1)), p1:(GEQ s10 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 81 ms.
Stack based approach found an accepted trace after 23 steps with 0 reset with depth 24 and stack size 24 in 1 ms.
FORMULA CryptoMiner-PT-D03N100-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property CryptoMiner-PT-D03N100-LTLFireability-04 finished in 392 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/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 18:58:22] [INFO ] Invariant cache hit.
[2024-05-21 18:58:22] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-05-21 18:58:22] [INFO ] Invariant cache hit.
[2024-05-21 18:58:22] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 18:58:22] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2024-05-21 18:58:22] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-21 18:58:22] [INFO ] Invariant cache hit.
[2024-05-21 18:58:22] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 70 ms. Remains : 11/11 places, 12/12 transitions.
Stuttering acceptance computed with spot in 87 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : CryptoMiner-PT-D03N100-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s0 1) (LT s7 1)), p1:(GEQ s10 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 65 ms.
Product exploration explored 100000 steps with 2 reset in 90 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 89 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 63 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Finished random walk after 508 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=254 )
Parikh walk visited 0 properties in 0 ms.
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)]
Knowledge based reduction with 4 factoid took 145 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 64 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
[2024-05-21 18:58:23] [INFO ] Invariant cache hit.
[2024-05-21 18:58:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 18:58:23] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-21 18:58:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 18:58:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 18:58:23] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-05-21 18:58:23] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 18:58:23] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2024-05-21 18:58:23] [INFO ] Computed and/alt/rep : 9/15/9 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-21 18:58:23] [INFO ] Added : 0 causal constraints over 0 iterations in 7 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 0 ms. Remains 11 /11 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2024-05-21 18:58:23] [INFO ] Invariant cache hit.
[2024-05-21 18:58:23] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-21 18:58:23] [INFO ] Invariant cache hit.
[2024-05-21 18:58:23] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 18:58:23] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2024-05-21 18:58:23] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-21 18:58:23] [INFO ] Invariant cache hit.
[2024-05-21 18:58:23] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 71 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 78 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 64 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Finished random walk after 3 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=3 )
Parikh walk visited 0 properties in 0 ms.
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)]
Knowledge based reduction with 4 factoid took 123 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 63 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 95 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
[2024-05-21 18:58:23] [INFO ] Invariant cache hit.
[2024-05-21 18:58:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 18:58:23] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-21 18:58:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 18:58:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 18:58:23] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2024-05-21 18:58:23] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 18:58:23] [INFO ] [Nat]Added 3 Read/Feed constraints in 0 ms returned sat
[2024-05-21 18:58:23] [INFO ] Computed and/alt/rep : 9/15/9 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-21 18:58:23] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 1 reset in 54 ms.
Product exploration explored 100000 steps with 0 reset in 91 ms.
Built C files in :
/tmp/ltsmin829541440851246461
[2024-05-21 18:58:24] [INFO ] Computing symmetric may disable matrix : 12 transitions.
[2024-05-21 18:58:24] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 18:58:24] [INFO ] Computing symmetric may enable matrix : 12 transitions.
[2024-05-21 18:58:24] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 18:58:24] [INFO ] Computing Do-Not-Accords matrix : 12 transitions.
[2024-05-21 18:58:24] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 18:58:24] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin829541440851246461
Running compilation step : cd /tmp/ltsmin829541440851246461;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 81 ms.
Running link step : cd /tmp/ltsmin829541440851246461;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin829541440851246461;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4688116735908046023.hoa' '--buchi-type=spotba'
LTSmin run took 48 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 1866 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/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 1 ms. Remains 11 /11 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2024-05-21 18:58:24] [INFO ] Invariant cache hit.
[2024-05-21 18:58:24] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-05-21 18:58:24] [INFO ] Invariant cache hit.
[2024-05-21 18:58:24] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 18:58:24] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2024-05-21 18:58:24] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-21 18:58:24] [INFO ] Invariant cache hit.
[2024-05-21 18:58:24] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 74 ms. Remains : 11/11 places, 12/12 transitions.
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p1) p2), true, (NOT p1), p2]
Running random walk in product with property : CryptoMiner-PT-D03N100-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(OR p1 (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 3}, { cond=p2, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(OR (GEQ s0 1) (GEQ s1 1) (GEQ s2 1) (GEQ s3 1)), p0:(OR (LT s0 1) (LT s7 1)), p2:(GEQ s10 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 51 ms.
Stack based approach found an accepted trace after 11 steps with 0 reset with depth 12 and stack size 12 in 0 ms.
FORMULA CryptoMiner-PT-D03N100-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property CryptoMiner-PT-D03N100-LTLFireability-06 finished in 250 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/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 18:58:24] [INFO ] Invariant cache hit.
[2024-05-21 18:58:24] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-21 18:58:24] [INFO ] Invariant cache hit.
[2024-05-21 18:58:24] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 18:58:24] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2024-05-21 18:58:24] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-21 18:58:24] [INFO ] Invariant cache hit.
[2024-05-21 18:58:24] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 79 ms. Remains : 11/11 places, 12/12 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Running random walk in product with property : CryptoMiner-PT-D03N100-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (LT s7 1) (LT s8 1) (LT s9 1) (OR (GEQ s0 1) (GEQ s1 1) (GEQ s2 1) (GEQ s3 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 70 ms.
Stack based approach found an accepted trace after 8 steps with 0 reset with depth 9 and stack size 9 in 0 ms.
FORMULA CryptoMiner-PT-D03N100-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property CryptoMiner-PT-D03N100-LTLFireability-07 finished in 210 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/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 18:58:24] [INFO ] Invariant cache hit.
[2024-05-21 18:58:24] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-21 18:58:24] [INFO ] Invariant cache hit.
[2024-05-21 18:58:24] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 18:58:24] [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 18:58:24] [INFO ] Invariant cache hit.
[2024-05-21 18:58:24] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 66 ms. Remains : 11/11 places, 12/12 transitions.
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : CryptoMiner-PT-D03N100-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(GEQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
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 180 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/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 1 ms. Remains 11 /11 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2024-05-21 18:58:25] [INFO ] Invariant cache hit.
[2024-05-21 18:58:25] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-21 18:58:25] [INFO ] Invariant cache hit.
[2024-05-21 18:58:25] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 18:58:25] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2024-05-21 18:58:25] [INFO ] Invariant cache hit.
[2024-05-21 18:58:25] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 70 ms. Remains : 11/11 places, 12/12 transitions.
Stuttering acceptance computed with spot in 263 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 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p0) p1), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=(OR (NOT p0) p1), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=p1, acceptance={0} source=3 dest: 1}, { cond=(NOT p1), acceptance={} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(LT s0 1), p1:(GEQ s10 1), p2:(OR (LT s0 1) (LT s7 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 1 reset in 61 ms.
Stack based approach found an accepted trace after 19 steps with 0 reset with depth 20 and stack size 20 in 0 ms.
FORMULA CryptoMiner-PT-D03N100-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property CryptoMiner-PT-D03N100-LTLFireability-10 finished in 410 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/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 0 ms. Remains 11 /11 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2024-05-21 18:58:25] [INFO ] Invariant cache hit.
[2024-05-21 18:58:25] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-05-21 18:58:25] [INFO ] Invariant cache hit.
[2024-05-21 18:58:25] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 18:58:25] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2024-05-21 18:58:25] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-21 18:58:25] [INFO ] Invariant cache hit.
[2024-05-21 18:58:25] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 74 ms. Remains : 11/11 places, 12/12 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : CryptoMiner-PT-D03N100-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p1:(LT s0 1), p0:(GEQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 16 reset in 131 ms.
Stack based approach found an accepted trace after 18 steps with 0 reset with depth 19 and stack size 19 in 0 ms.
FORMULA CryptoMiner-PT-D03N100-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property CryptoMiner-PT-D03N100-LTLFireability-13 finished in 307 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/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 4 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 7 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 18:58:25] [INFO ] Computed 0 invariants in 0 ms
[2024-05-21 18:58:25] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-05-21 18:58:25] [INFO ] Invariant cache hit.
[2024-05-21 18:58:25] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 18:58:25] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2024-05-21 18:58:25] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-21 18:58:25] [INFO ] Invariant cache hit.
[2024-05-21 18:58:25] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
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 84 ms. Remains : 8/11 places, 9/12 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : CryptoMiner-PT-D03N100-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (GEQ s7 1) (GEQ s6 1) (LT s4 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
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 146 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/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 18:58:25] [INFO ] Computed 0 invariants in 1 ms
[2024-05-21 18:58:25] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-21 18:58:25] [INFO ] Invariant cache hit.
[2024-05-21 18:58:25] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 18:58:25] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2024-05-21 18:58:25] [INFO ] Invariant cache hit.
[2024-05-21 18:58:25] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 71 ms. Remains : 11/11 places, 12/12 transitions.
Stuttering acceptance computed with spot in 122 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : CryptoMiner-PT-D03N100-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(LT s0 1), p0:(GEQ s1 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 26 reset in 62 ms.
Stack based approach found an accepted trace after 15 steps with 0 reset with depth 16 and stack size 16 in 1 ms.
FORMULA CryptoMiner-PT-D03N100-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property CryptoMiner-PT-D03N100-LTLFireability-15 finished in 274 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/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 189 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 18:58:26] [INFO ] Invariant cache hit.
[2024-05-21 18:58:26] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-21 18:58:26] [INFO ] Invariant cache hit.
[2024-05-21 18:58:26] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 18:58:26] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
[2024-05-21 18:58:26] [INFO ] Invariant cache hit.
[2024-05-21 18:58:26] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 85 ms. Remains : 11/11 places, 12/12 transitions.
Running random walk in product with property : CryptoMiner-PT-D03N100-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(OR (GEQ s0 1) (GEQ s1 1) (GEQ s2 1) (GEQ s3 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 49 ms.
Product exploration explored 100000 steps with 0 reset in 87 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, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 73 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 166 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10017 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=3339 ) properties (out of 1) seen :0
Finished Best-First random walk after 400 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=400 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 81 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 138 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 163 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 18:58:27] [INFO ] Invariant cache hit.
[2024-05-21 18:58:27] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-21 18:58:27] [INFO ] Invariant cache hit.
[2024-05-21 18:58:27] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 18:58:27] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2024-05-21 18:58:27] [INFO ] Invariant cache hit.
[2024-05-21 18:58:27] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 76 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, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 78 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)]
Finished random walk after 6785 steps, including 2 resets, run visited all 1 properties in 4 ms. (steps per millisecond=1696 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 81 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 150 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 167 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 170 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 56 ms.
Product exploration explored 100000 steps with 0 reset in 117 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 167 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 1 ms. Remains 11 /11 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2024-05-21 18:58:28] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-21 18:58:28] [INFO ] Invariant cache hit.
[2024-05-21 18:58:28] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 37 ms. Remains : 11/11 places, 12/12 transitions.
Built C files in :
/tmp/ltsmin3564737398540343844
[2024-05-21 18:58:28] [INFO ] Built C files in 0ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3564737398540343844
Running compilation step : cd /tmp/ltsmin3564737398540343844;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 81 ms.
Running link step : cd /tmp/ltsmin3564737398540343844;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin3564737398540343844;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased7773215466218644328.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 11 ms. Remains 11 /11 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2024-05-21 18:58:43] [INFO ] Invariant cache hit.
[2024-05-21 18:58:43] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-21 18:58:43] [INFO ] Invariant cache hit.
[2024-05-21 18:58:43] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 18:58:43] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2024-05-21 18:58:43] [INFO ] Invariant cache hit.
[2024-05-21 18:58:43] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 87 ms. Remains : 11/11 places, 12/12 transitions.
Built C files in :
/tmp/ltsmin9356853553794295321
[2024-05-21 18:58:43] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9356853553794295321
Running compilation step : cd /tmp/ltsmin9356853553794295321;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 75 ms.
Running link step : cd /tmp/ltsmin9356853553794295321;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin9356853553794295321;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased7062460279557177903.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 18:58:59] [INFO ] Flatten gal took : 3 ms
[2024-05-21 18:58:59] [INFO ] Flatten gal took : 3 ms
[2024-05-21 18:58:59] [INFO ] Time to serialize gal into /tmp/LTL1981468577674931676.gal : 2 ms
[2024-05-21 18:58:59] [INFO ] Time to serialize properties into /tmp/LTL12626710632876720888.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1981468577674931676.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11371659387298274993.hoa' '-atoms' '/tmp/LTL12626710632876720888.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL12626710632876720888.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11371659387298274993.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 18:59:14] [INFO ] Flatten gal took : 1 ms
[2024-05-21 18:59:14] [INFO ] Flatten gal took : 1 ms
[2024-05-21 18:59:14] [INFO ] Time to serialize gal into /tmp/LTL7264711377169637027.gal : 0 ms
[2024-05-21 18:59:14] [INFO ] Time to serialize properties into /tmp/LTL16465860620156280447.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7264711377169637027.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16465860620156280447.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
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 18:59:29] [INFO ] Flatten gal took : 1 ms
[2024-05-21 18:59:29] [INFO ] Applying decomposition
[2024-05-21 18:59:29] [INFO ] Flatten gal took : 1 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph10537828496512289693.txt' '-o' '/tmp/graph10537828496512289693.bin' '-w' '/tmp/graph10537828496512289693.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph10537828496512289693.bin' '-l' '-1' '-v' '-w' '/tmp/graph10537828496512289693.weights' '-q' '0' '-e' '0.001'
[2024-05-21 18:59:29] [INFO ] Decomposing Gal with order
[2024-05-21 18:59:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 18:59:29] [INFO ] Removed a total of 2 redundant transitions.
[2024-05-21 18:59:29] [INFO ] Flatten gal took : 2 ms
[2024-05-21 18:59:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-21 18:59:29] [INFO ] Time to serialize gal into /tmp/LTL17238424007725730147.gal : 0 ms
[2024-05-21 18:59:29] [INFO ] Time to serialize properties into /tmp/LTL17008892672610605933.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17238424007725730147.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17008892672610605933.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
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.
Built C files in :
/tmp/ltsmin14401010781026612232
[2024-05-21 18:59:44] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14401010781026612232
Running compilation step : cd /tmp/ltsmin14401010781026612232;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 78 ms.
Running link step : cd /tmp/ltsmin14401010781026612232;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin14401010781026612232;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(X([]((LTLAPp0==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property CryptoMiner-PT-D03N100-LTLFireability-03 finished in 93114 ms.
[2024-05-21 18:59:59] [INFO ] Flatten gal took : 3 ms
Using solver Z3 to compute partial order matrices.
[2024-05-21 18:59:59] [INFO ] Applying decomposition
[2024-05-21 18:59:59] [INFO ] Flatten gal took : 2 ms
Built C files in :
/tmp/ltsmin13269712326173224468
[2024-05-21 18:59:59] [INFO ] Computing symmetric may disable matrix : 12 transitions.
[2024-05-21 18:59:59] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 18:59:59] [INFO ] Computing symmetric may enable matrix : 12 transitions.
[2024-05-21 18:59:59] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 18:59:59] [INFO ] Computing Do-Not-Accords matrix : 12 transitions.
[2024-05-21 18:59:59] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 18:59:59] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13269712326173224468
Running compilation step : cd /tmp/ltsmin13269712326173224468;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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.202304061127/bin/convert-linux64' '-i' '/tmp/graph17320187035729014461.txt' '-o' '/tmp/graph17320187035729014461.bin' '-w' '/tmp/graph17320187035729014461.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph17320187035729014461.bin' '-l' '-1' '-v' '-w' '/tmp/graph17320187035729014461.weights' '-q' '0' '-e' '0.001'
[2024-05-21 18:59:59] [INFO ] Decomposing Gal with order
[2024-05-21 18:59:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 18:59:59] [INFO ] Removed a total of 2 redundant transitions.
[2024-05-21 18:59:59] [INFO ] Flatten gal took : 2 ms
[2024-05-21 18:59:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-21 18:59:59] [INFO ] Time to serialize gal into /tmp/LTLFireability5633138957524015965.gal : 0 ms
[2024-05-21 18:59:59] [INFO ] Time to serialize properties into /tmp/LTLFireability7431574989052651590.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability5633138957524015965.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability7431574989052651590.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
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)))"
Compilation finished in 74 ms.
Running link step : cd /tmp/ltsmin13269712326173224468;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin13269712326173224468;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.001: LTL layer: formula: X(X(X([]((LTLAPp0==true)))))
pins2lts-mc-linux64( 5/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.001: "X(X(X([]((LTLAPp0==true)))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.001: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.006: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.010: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.049: DFS-FIFO for weak LTL, using special progress label 14
pins2lts-mc-linux64( 0/ 8), 0.049: There are 15 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.049: State length is 12, there are 18 groups
pins2lts-mc-linux64( 0/ 8), 0.049: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.049: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.049: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.049: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 0/ 8), 0.058: ~1 levels ~960 states ~3368 transitions
pins2lts-mc-linux64( 0/ 8), 0.061: ~1 levels ~1920 states ~6552 transitions
pins2lts-mc-linux64( 0/ 8), 0.084: ~1 levels ~3840 states ~13688 transitions
pins2lts-mc-linux64( 0/ 8), 0.122: ~1 levels ~7680 states ~28616 transitions
pins2lts-mc-linux64( 7/ 8), 0.165: ~1 levels ~15360 states ~62152 transitions
pins2lts-mc-linux64( 7/ 8), 0.236: ~1 levels ~30720 states ~127256 transitions
pins2lts-mc-linux64( 7/ 8), 0.359: ~1 levels ~61440 states ~261320 transitions
pins2lts-mc-linux64( 7/ 8), 0.588: ~1 levels ~122880 states ~533568 transitions
pins2lts-mc-linux64( 7/ 8), 0.993: ~1 levels ~245760 states ~1093984 transitions
pins2lts-mc-linux64( 0/ 8), 1.580: ~1 levels ~491520 states ~2159304 transitions
pins2lts-mc-linux64( 4/ 8), 2.200: ~1 levels ~983040 states ~4043600 transitions
pins2lts-mc-linux64( 3/ 8), 3.011: ~1 levels ~1966080 states ~8958248 transitions
pins2lts-mc-linux64( 2/ 8), 4.511: ~1 levels ~3932160 states ~17820528 transitions
pins2lts-mc-linux64( 2/ 8), 7.675: ~1 levels ~7864320 states ~36052528 transitions
pins2lts-mc-linux64( 3/ 8), 13.625: ~1 levels ~15728640 states ~74459712 transitions
pins2lts-mc-linux64( 3/ 8), 25.571: ~1 levels ~31457280 states ~150466608 transitions
pins2lts-mc-linux64( 3/ 8), 51.362: ~1 levels ~62914560 states ~303343080 transitions
pins2lts-mc-linux64( 2/ 8), 108.175: ~1 levels ~125829120 states ~595878176 transitions
pins2lts-mc-linux64( 4/ 8), 126.785: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 126.811:
pins2lts-mc-linux64( 0/ 8), 126.811: mean standard work distribution: 1.8% (states) 2.0% (transitions)
pins2lts-mc-linux64( 0/ 8), 126.812:
pins2lts-mc-linux64( 0/ 8), 126.812: Explored 128722175 states 615049928 transitions, fanout: 4.778
pins2lts-mc-linux64( 0/ 8), 126.812: Total exploration time 126.750 sec (126.720 sec minimum, 126.730 sec on average)
pins2lts-mc-linux64( 0/ 8), 126.812: States per second: 1015560, Transitions per second: 4852465
pins2lts-mc-linux64( 0/ 8), 126.812:
pins2lts-mc-linux64( 0/ 8), 126.812: Progress states detected: 134217293
pins2lts-mc-linux64( 0/ 8), 126.812: Redundant explorations: -4.0942
pins2lts-mc-linux64( 0/ 8), 126.812:
pins2lts-mc-linux64( 0/ 8), 126.812: Queue width: 8B, total height: 11723648, memory: 89.44MB
pins2lts-mc-linux64( 0/ 8), 126.812: Tree memory: 1028.0MB, 8.0 B/state, compr.: 16.1%
pins2lts-mc-linux64( 0/ 8), 126.812: Tree fill ratio (roots/leafs): 99.0%/1.0%
pins2lts-mc-linux64( 0/ 8), 126.812: Stored 12 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 126.812: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 126.812: Est. total memory use: 1117.4MB (~1113.4MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin13269712326173224468;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin13269712326173224468;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2024-05-21 19:21:06] [INFO ] Flatten gal took : 6 ms
[2024-05-21 19:21:06] [INFO ] Time to serialize gal into /tmp/LTLFireability7129014550680165996.gal : 1 ms
[2024-05-21 19:21:06] [INFO ] Time to serialize properties into /tmp/LTLFireability3551568211008809413.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability7129014550680165996.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability3551568211008809413.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.202304061127/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
6273 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,62.7376,933088,1,0,556,5.01944e+06,53,630,908,5.87379e+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
Total runtime 1538130 ms.

BK_STOP 1716319335570

--------------------
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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /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="gold2023"
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 gold2023"
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 r109-tall-171624208100238"
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 ;