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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 456K
-rw-r--r-- 1 mcc users 6.3K Apr 12 12:42 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K Apr 12 12:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Apr 12 12:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Apr 12 12:36 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Apr 22 14:35 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 22 14:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 12:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K Apr 12 12:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Apr 12 12:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 104K Apr 12 12:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 22 14:35 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:35 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_pt
-rw-r--r-- 1 mcc users 8 May 18 16:42 instance
-rw-r--r-- 1 mcc users 5 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 13K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716313238926

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=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CryptoMiner-COL-D10N100
Not applying reductions.
Model is COL
LTLCardinality COL
Running Version 202304061127
[2024-05-21 17:40:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 17:40:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 17:40:40] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-21 17:40:40] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-21 17:40:40] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 384 ms
[2024-05-21 17:40:40] [INFO ] Imported 3 HL places and 5 HL transitions for a total of 33 PT places and 55.0 transition bindings in 15 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
[2024-05-21 17:40:41] [INFO ] Built PT skeleton of HLPN with 3 places and 5 transitions 14 arcs in 5 ms.
[2024-05-21 17:40:41] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 3 formulas.
FORMULA CryptoMiner-COL-D10N100-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CryptoMiner-COL-D10N100-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CryptoMiner-COL-D10N100-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CryptoMiner-COL-D10N100-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 3 stabilizing places and 3 stable transitions
Remains 12 properties that can be checked using skeleton over-approximation.
Computed a total of 3 stabilizing places and 3 stable transitions
Incomplete random walk after 10074 steps, including 189 resets, run finished after 40 ms. (steps per millisecond=251 ) properties (out of 15) seen :12
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-21 17:40:41] [INFO ] Flow matrix only has 4 transitions (discarded 1 similar events)
// Phase 1: matrix 4 rows 3 cols
[2024-05-21 17:40:41] [INFO ] Computed 0 invariants in 4 ms
[2024-05-21 17:40:41] [INFO ] After 97ms 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.
Successfully simplified 2 atomic propositions for a total of 12 simplifications.
[2024-05-21 17:40:41] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2024-05-21 17:40:41] [INFO ] Flatten gal took : 15 ms
FORMULA CryptoMiner-COL-D10N100-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 17:40:41] [INFO ] Flatten gal took : 2 ms
Arc [0:1*[(MOD (ADD $x 1) 11)]] contains successor/predecessor on variables of sort CD
[2024-05-21 17:40:41] [INFO ] Unfolded HLPN to a Petri net with 33 places and 33 transitions 97 arcs in 5 ms.
[2024-05-21 17:40:41] [INFO ] Unfolded 11 HLPN properties in 0 ms.
Support contains 33 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 33/33 transitions.
Applied a total of 0 rules in 5 ms. Remains 33 /33 variables (removed 0) and now considering 33/33 (removed 0) transitions.
// Phase 1: matrix 33 rows 33 cols
[2024-05-21 17:40:41] [INFO ] Computed 1 invariants in 1 ms
[2024-05-21 17:40:41] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-05-21 17:40:41] [INFO ] Invariant cache hit.
[2024-05-21 17:40:41] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-21 17:40:41] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
[2024-05-21 17:40:41] [INFO ] Invariant cache hit.
[2024-05-21 17:40:41] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 140 ms. Remains : 33/33 places, 33/33 transitions.
Support contains 33 out of 33 places after structural reductions.
[2024-05-21 17:40:41] [INFO ] Flatten gal took : 4 ms
[2024-05-21 17:40:41] [INFO ] Flatten gal took : 5 ms
[2024-05-21 17:40:41] [INFO ] Input system was already deterministic with 33 transitions.
Incomplete random walk after 10058 steps, including 4 resets, run finished after 11 ms. (steps per millisecond=914 ) properties (out of 13) seen :11
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
[2024-05-21 17:40:41] [INFO ] Invariant cache hit.
[2024-05-21 17:40:41] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-21 17:40:41] [INFO ] After 54ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
Computed a total of 21 stabilizing places and 21 stable transitions
Graph (complete) has 85 edges and 33 vertex of which 12 are kept as prefixes of interest. Removing 21 places using SCC suffix rule.1 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 11 out of 33 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33/33 places, 33/33 transitions.
Graph (complete) has 85 edges and 33 vertex of which 32 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 7 ms. Remains 32 /33 variables (removed 1) and now considering 33/33 (removed 0) transitions.
// Phase 1: matrix 33 rows 32 cols
[2024-05-21 17:40:41] [INFO ] Computed 0 invariants in 1 ms
[2024-05-21 17:40:42] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-21 17:40:42] [INFO ] Invariant cache hit.
[2024-05-21 17:40:42] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-21 17:40:42] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
[2024-05-21 17:40:42] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-21 17:40:42] [INFO ] Invariant cache hit.
[2024-05-21 17:40:42] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 32/33 places, 33/33 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 129 ms. Remains : 32/33 places, 33/33 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 135 ms :[(NOT p0)]
Running random walk in product with property : CryptoMiner-COL-D10N100-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT 1 (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10))], 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]]
Product exploration explored 100000 steps with 0 reset in 224 ms.
Stack based approach found an accepted trace after 3390 steps with 0 reset with depth 3391 and stack size 3391 in 7 ms.
FORMULA CryptoMiner-COL-D10N100-LTLCardinality-00 FALSE TECHNIQUES STACK_TEST
Treatment of property CryptoMiner-COL-D10N100-LTLCardinality-00 finished in 534 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 22 out of 33 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33/33 places, 33/33 transitions.
Graph (trivial) has 11 edges and 33 vertex of which 11 / 33 are part of one of the 1 SCC in 2 ms
Free SCC test removed 10 places
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Applied a total of 1 rules in 4 ms. Remains 23 /33 variables (removed 10) and now considering 23/33 (removed 10) transitions.
// Phase 1: matrix 23 rows 23 cols
[2024-05-21 17:40:42] [INFO ] Computed 1 invariants in 0 ms
[2024-05-21 17:40:42] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-21 17:40:42] [INFO ] Invariant cache hit.
[2024-05-21 17:40:42] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-21 17:40:42] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2024-05-21 17:40:42] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-21 17:40:42] [INFO ] Invariant cache hit.
[2024-05-21 17:40:42] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 23/33 places, 23/33 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 130 ms. Remains : 23/33 places, 23/33 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : CryptoMiner-COL-D10N100-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11) (ADD s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 26 steps with 0 reset in 4 ms.
FORMULA CryptoMiner-COL-D10N100-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-COL-D10N100-LTLCardinality-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' '!((p0 U X((p1&&X((!p2 U X((!p2&&X(!p2)))))))))'
Support contains 33 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 33/33 transitions.
Applied a total of 0 rules in 1 ms. Remains 33 /33 variables (removed 0) and now considering 33/33 (removed 0) transitions.
// Phase 1: matrix 33 rows 33 cols
[2024-05-21 17:40:42] [INFO ] Computed 1 invariants in 2 ms
[2024-05-21 17:40:42] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-21 17:40:42] [INFO ] Invariant cache hit.
[2024-05-21 17:40:42] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-21 17:40:42] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
[2024-05-21 17:40:42] [INFO ] Invariant cache hit.
[2024-05-21 17:40:42] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 123 ms. Remains : 33/33 places, 33/33 transitions.
Stuttering acceptance computed with spot in 775 ms :[p2, p2, p2, p2, p2, p2, p2, p2, (OR (NOT p1) p2), (OR (NOT p1) p2), p2, p2, p2, p2, p2, p2, p2, true, (OR (NOT p1) p2)]
Running random walk in product with property : CryptoMiner-COL-D10N100-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 4}, { cond=p2, acceptance={} source=0 dest: 17}], [{ cond=p2, acceptance={} source=1 dest: 0}], [{ cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 0}, { cond=(AND p1 p2), acceptance={} source=2 dest: 10}], [{ cond=(AND (NOT p0) p1 p2), acceptance={0} source=3 dest: 11}, { cond=(AND p0 p1 p2), acceptance={0} source=3 dest: 12}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={0} source=3 dest: 13}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=3 dest: 14}], [{ cond=p2, acceptance={} source=4 dest: 17}], [{ cond=p2, acceptance={} source=5 dest: 0}, { cond=(NOT p2), acceptance={} source=5 dest: 10}], [{ cond=(AND (NOT p1) p2), acceptance={} source=6 dest: 0}, { cond=(OR p1 (NOT p2)), acceptance={} source=6 dest: 10}], [{ cond=(OR (AND (NOT p0) p1) (AND (NOT p0) (NOT p2))), acceptance={0} source=7 dest: 11}, { cond=(OR (AND p0 p1) (AND p0 (NOT p2))), acceptance={0} source=7 dest: 12}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={0} source=7 dest: 13}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=7 dest: 14}], [{ cond=p1, acceptance={} source=8 dest: 5}, { cond=(NOT p1), acceptance={} source=8 dest: 17}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=9 dest: 6}, { cond=(AND p0 p1), acceptance={0} source=9 dest: 7}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=9 dest: 8}, { cond=(AND p0 (NOT p1)), acceptance={0} source=9 dest: 9}], [{ cond=p2, acceptance={} source=10 dest: 0}, { cond=(NOT p2), acceptance={} source=10 dest: 1}], [{ cond=(AND (NOT p1) p2), acceptance={} source=11 dest: 0}, { cond=(NOT p2), acceptance={} source=11 dest: 1}, { cond=(AND p1 p2), acceptance={} source=11 dest: 10}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=12 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={0} source=12 dest: 3}, { cond=(AND (NOT p0) p1 p2), acceptance={0} source=12 dest: 11}, { cond=(AND p0 p1 p2), acceptance={0} source=12 dest: 12}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={0} source=12 dest: 13}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=12 dest: 14}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=13 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=13 dest: 4}, { cond=(AND p1 p2), acceptance={} source=13 dest: 5}, { cond=(AND (NOT p1) p2), acceptance={} source=13 dest: 17}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=14 dest: 2}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=14 dest: 3}, { cond=(AND (NOT p0) p1 p2), acceptance={0} source=14 dest: 6}, { cond=(AND p0 p1 p2), acceptance={0} source=14 dest: 7}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={0} source=14 dest: 8}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=14 dest: 9}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=14 dest: 15}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=14 dest: 16}], [{ cond=(AND p1 p2), acceptance={} source=15 dest: 5}, { cond=(AND (NOT p1) p2), acceptance={} source=15 dest: 17}], [{ cond=(AND (NOT p0) p1 p2), acceptance={0} source=16 dest: 6}, { cond=(AND p0 p1 p2), acceptance={0} source=16 dest: 7}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={0} source=16 dest: 8}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=16 dest: 9}], [{ cond=true, acceptance={0} source=17 dest: 17}], [{ cond=(NOT p0), acceptance={} source=18 dest: 8}, { cond=p0, acceptance={} source=18 dest: 9}]], initial=18, aps=[p2:(GT 1 (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10)), p1:(LEQ (ADD s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32) (ADD s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 20000 reset in 325 ms.
Product exploration explored 100000 steps with 20000 reset in 247 ms.
Computed a total of 21 stabilizing places and 21 stable transitions
Graph (complete) has 85 edges and 33 vertex of which 12 are kept as prefixes of interest. Removing 21 places using SCC suffix rule.0 ms
Computed a total of 21 stabilizing places and 21 stable transitions
Knowledge obtained : [(AND (NOT p2) p1 p0), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X p1), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) (NOT p2)))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), true, (X (X (OR p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (OR (AND p0 p1) (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 16 factoid took 405 ms. Reduced automaton from 19 states, 56 edges and 3 AP (stutter sensitive) to 19 states, 55 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 715 ms :[p2, p2, p2, p2, p2, p2, p2, p2, (OR (NOT p1) p2), (OR (NOT p1) p2), p2, p2, p2, p2, p2, p2, p2, (OR (NOT p1) p2), true]
Incomplete random walk after 10034 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=557 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 23) seen :13
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
[2024-05-21 17:40:45] [INFO ] Invariant cache hit.
[2024-05-21 17:40:45] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-21 17:40:45] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2024-05-21 17:40:45] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-21 17:40:45] [INFO ] After 48ms SMT Verify possible using state equation in natural domain returned unsat :6 sat :4
[2024-05-21 17:40:45] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-21 17:40:45] [INFO ] After 26ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :6 sat :4
[2024-05-21 17:40:45] [INFO ] After 72ms SMT Verify possible using trap constraints in natural domain returned unsat :6 sat :4
Attempting to minimize the solution found.
Minimization took 47 ms.
[2024-05-21 17:40:45] [INFO ] After 215ms SMT Verify possible using all constraints in natural domain returned unsat :6 sat :4
Fused 10 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 26 ms.
Support contains 33 out of 33 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 33/33 places, 33/33 transitions.
Applied a total of 0 rules in 1 ms. Remains 33 /33 variables (removed 0) and now considering 33/33 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 33/33 places, 33/33 transitions.
Incomplete random walk after 10034 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1254 ) properties (out of 4) seen :0
Finished Best-First random walk after 400 steps, including 0 resets, run visited all 4 properties in 4 ms. (steps per millisecond=100 )
Parikh walk visited 0 properties in 0 ms.
Found 6 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) p1 p0), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X p1), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) (NOT p2)))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), true, (X (X (OR p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (OR (AND p0 p1) (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (G (NOT (AND p0 p1 p2))), (G (NOT (AND (NOT p0) p1 p2))), (G (NOT (AND p0 (NOT p1) p2))), (G (NOT (AND (NOT p0) p1 (NOT p2)))), (G (NOT (AND p1 p2))), (G (NOT (AND (NOT p0) p1)))]
False Knowledge obtained : [(X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F (OR (AND (NOT p0) p1) (AND (NOT p0) (NOT p2)))), (F (NOT (OR p1 (NOT p2)))), (F (NOT (OR (AND p0 p1) (AND p0 (NOT p2))))), (F (AND (NOT p0) (NOT p2))), (F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND p0 p1))), (F (AND (NOT p0) (NOT p1) p2)), (F p2), (F (AND (NOT p1) (NOT p2))), (F (NOT (AND p1 (NOT p2)))), (F (NOT (AND p0 (NOT p2)))), (F (AND (NOT p1) p2)), (F (AND p0 (NOT p1) (NOT p2))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (NOT p1)), (F (NOT (AND p0 p1 (NOT p2))))]
Knowledge based reduction with 22 factoid took 1697 ms. Reduced automaton from 19 states, 55 edges and 3 AP (stutter sensitive) to 10 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 450 ms :[p2, p2, p2, p2, p2, p2, p2, true, p2, p2]
Stuttering acceptance computed with spot in 339 ms :[p2, p2, p2, p2, p2, p2, p2, true, p2, p2]
Support contains 33 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 33/33 transitions.
Applied a total of 0 rules in 1 ms. Remains 33 /33 variables (removed 0) and now considering 33/33 (removed 0) transitions.
[2024-05-21 17:40:48] [INFO ] Invariant cache hit.
[2024-05-21 17:40:48] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-21 17:40:48] [INFO ] Invariant cache hit.
[2024-05-21 17:40:48] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-21 17:40:48] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
[2024-05-21 17:40:48] [INFO ] Invariant cache hit.
[2024-05-21 17:40:48] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 102 ms. Remains : 33/33 places, 33/33 transitions.
Computed a total of 21 stabilizing places and 21 stable transitions
Graph (complete) has 85 edges and 33 vertex of which 12 are kept as prefixes of interest. Removing 21 places using SCC suffix rule.1 ms
Computed a total of 21 stabilizing places and 21 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 82 ms. Reduced automaton from 10 states, 15 edges and 3 AP (stutter sensitive) to 10 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 337 ms :[p2, p2, p2, p2, p2, p2, p2, p2, p2, true]
Incomplete random walk after 10045 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=913 ) properties (out of 5) seen :3
Finished Best-First random walk after 200 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=200 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p2) p1), true]
False Knowledge obtained : [(F (NOT (AND p0 p1 (NOT p2)))), (F (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))), (F p2), (F (AND (NOT p0) (NOT p2))), (F (NOT (AND p0 (NOT p2))))]
Knowledge based reduction with 2 factoid took 165 ms. Reduced automaton from 10 states, 15 edges and 3 AP (stutter sensitive) to 10 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 346 ms :[p2, p2, p2, p2, p2, p2, p2, p2, p2, true]
Stuttering acceptance computed with spot in 363 ms :[p2, p2, p2, p2, p2, p2, p2, p2, p2, true]
Stuttering acceptance computed with spot in 349 ms :[p2, p2, p2, p2, p2, p2, p2, p2, p2, true]
Product exploration explored 100000 steps with 20000 reset in 79 ms.
Product exploration explored 100000 steps with 20000 reset in 79 ms.
Applying partial POR strategy [true, false, false, false, false, false, false, false, false, true]
Stuttering acceptance computed with spot in 378 ms :[p2, p2, p2, p2, p2, p2, p2, p2, p2, true]
Support contains 33 out of 33 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33/33 places, 33/33 transitions.
Applied a total of 0 rules in 3 ms. Remains 33 /33 variables (removed 0) and now considering 33/33 (removed 0) transitions.
[2024-05-21 17:40:50] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-21 17:40:50] [INFO ] Invariant cache hit.
[2024-05-21 17:40:50] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 40 ms. Remains : 33/33 places, 33/33 transitions.
Built C files in :
/tmp/ltsmin1016197350199200142
[2024-05-21 17:40:50] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1016197350199200142
Running compilation step : cd /tmp/ltsmin1016197350199200142;'/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 194 ms.
Running link step : cd /tmp/ltsmin1016197350199200142;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin1016197350199200142;'/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/stateBased13890095981223861780.hoa' '--buchi-type=spotba'
LTSmin run took 169 ms.
FORMULA CryptoMiner-COL-D10N100-LTLCardinality-03 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property CryptoMiner-COL-D10N100-LTLCardinality-03 finished in 8470 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((p0&&F((p1||X(p2)))))))'
Support contains 33 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 33/33 transitions.
Applied a total of 0 rules in 1 ms. Remains 33 /33 variables (removed 0) and now considering 33/33 (removed 0) transitions.
[2024-05-21 17:40:51] [INFO ] Invariant cache hit.
[2024-05-21 17:40:51] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-21 17:40:51] [INFO ] Invariant cache hit.
[2024-05-21 17:40:51] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-21 17:40:51] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
[2024-05-21 17:40:51] [INFO ] Invariant cache hit.
[2024-05-21 17:40:51] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 90 ms. Remains : 33/33 places, 33/33 transitions.
Stuttering acceptance computed with spot in 149 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true]
Running random walk in product with property : CryptoMiner-COL-D10N100-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p0:(LEQ (ADD s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32) (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10)), p1:(LEQ (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10) (ADD s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 82 ms.
Product exploration explored 100000 steps with 25000 reset in 89 ms.
Computed a total of 21 stabilizing places and 21 stable transitions
Graph (complete) has 85 edges and 33 vertex of which 12 are kept as prefixes of interest. Removing 21 places using SCC suffix rule.0 ms
Computed a total of 21 stabilizing places and 21 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (X (AND p0 (NOT p1)))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 63 ms. Reduced automaton from 5 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 131 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10034 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2006 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2830796 steps, run timeout after 3001 ms. (steps per millisecond=943 ) properties seen :{}
Probabilistic random walk after 2830796 steps, saw 1110308 distinct states, run finished after 3002 ms. (steps per millisecond=942 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-21 17:40:54] [INFO ] Invariant cache hit.
[2024-05-21 17:40:54] [INFO ] After 22ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (X (AND p0 (NOT p1)))), (X (X p0)), (G (NOT (AND (NOT p1) (NOT p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 15 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CryptoMiner-COL-D10N100-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CryptoMiner-COL-D10N100-LTLCardinality-05 finished in 3703 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(!p0)))'
Support contains 22 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 33/33 transitions.
Applied a total of 0 rules in 1 ms. Remains 33 /33 variables (removed 0) and now considering 33/33 (removed 0) transitions.
[2024-05-21 17:40:54] [INFO ] Invariant cache hit.
[2024-05-21 17:40:54] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-21 17:40:55] [INFO ] Invariant cache hit.
[2024-05-21 17:40:55] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-21 17:40:55] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
[2024-05-21 17:40:55] [INFO ] Invariant cache hit.
[2024-05-21 17:40:55] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 100 ms. Remains : 33/33 places, 33/33 transitions.
Stuttering acceptance computed with spot in 70 ms :[true, p0, p0]
Running random walk in product with property : CryptoMiner-COL-D10N100-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GT (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10) (ADD s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32))], 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CryptoMiner-COL-D10N100-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-COL-D10N100-LTLCardinality-07 finished in 179 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((p0&&F(p1)&&F(G(!p2))))))'
Support contains 33 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 33/33 transitions.
Applied a total of 0 rules in 1 ms. Remains 33 /33 variables (removed 0) and now considering 33/33 (removed 0) transitions.
[2024-05-21 17:40:55] [INFO ] Invariant cache hit.
[2024-05-21 17:40:55] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-21 17:40:55] [INFO ] Invariant cache hit.
[2024-05-21 17:40:55] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-21 17:40:55] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2024-05-21 17:40:55] [INFO ] Invariant cache hit.
[2024-05-21 17:40:55] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 86 ms. Remains : 33/33 places, 33/33 transitions.
Stuttering acceptance computed with spot in 155 ms :[(OR (NOT p1) (NOT p0) p2), (OR (NOT p1) (NOT p0) p2), true, (NOT p1), p2]
Running random walk in product with property : CryptoMiner-COL-D10N100-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND p0 p2), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 4}, { cond=p2, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(OR (LEQ 2 (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10)) (AND (GT 1 (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10)) (GT (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10) (AD...], 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 0 reset in 146 ms.
Stack based approach found an accepted trace after 3960 steps with 0 reset with depth 3961 and stack size 3961 in 10 ms.
FORMULA CryptoMiner-COL-D10N100-LTLCardinality-08 FALSE TECHNIQUES STACK_TEST
Treatment of property CryptoMiner-COL-D10N100-LTLCardinality-08 finished in 419 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(p0)))'
Support contains 22 out of 33 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33/33 places, 33/33 transitions.
Graph (trivial) has 11 edges and 33 vertex of which 11 / 33 are part of one of the 1 SCC in 0 ms
Free SCC test removed 10 places
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Applied a total of 1 rules in 4 ms. Remains 23 /33 variables (removed 10) and now considering 23/33 (removed 10) transitions.
// Phase 1: matrix 23 rows 23 cols
[2024-05-21 17:40:55] [INFO ] Computed 1 invariants in 2 ms
[2024-05-21 17:40:55] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-21 17:40:55] [INFO ] Invariant cache hit.
[2024-05-21 17:40:55] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-21 17:40:55] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2024-05-21 17:40:55] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-21 17:40:55] [INFO ] Invariant cache hit.
[2024-05-21 17:40:55] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 23/33 places, 23/33 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 89 ms. Remains : 23/33 places, 23/33 transitions.
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CryptoMiner-COL-D10N100-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LEQ 1 (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11)) (GT 2 (ADD s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22)))], 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 72 ms.
Product exploration explored 100000 steps with 0 reset in 108 ms.
Computed a total of 23 stabilizing places and 22 stable transitions
Graph (complete) has 75 edges and 23 vertex of which 1 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.0 ms
Computed a total of 23 stabilizing places and 22 stable transitions
Detected a total of 23/23 stabilizing places and 22/23 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 83 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 52 ms :[(NOT p0), (NOT p0)]
Finished random walk after 112 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=112 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 94 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Support contains 22 out of 23 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 23/23 places, 23/23 transitions.
Applied a total of 0 rules in 3 ms. Remains 23 /23 variables (removed 0) and now considering 23/23 (removed 0) transitions.
[2024-05-21 17:40:56] [INFO ] Invariant cache hit.
[2024-05-21 17:40:56] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-21 17:40:56] [INFO ] Invariant cache hit.
[2024-05-21 17:40:56] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-21 17:40:56] [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 17:40:56] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-21 17:40:56] [INFO ] Invariant cache hit.
[2024-05-21 17:40:56] [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 81 ms. Remains : 23/23 places, 23/23 transitions.
Computed a total of 23 stabilizing places and 22 stable transitions
Graph (complete) has 75 edges and 23 vertex of which 1 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.1 ms
Computed a total of 23 stabilizing places and 22 stable transitions
Detected a total of 23/23 stabilizing places and 22/23 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 104 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 46 ms :[(NOT p0), (NOT p0)]
Finished random walk after 112 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=112 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 98 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 71 ms.
Product exploration explored 100000 steps with 0 reset in 75 ms.
Built C files in :
/tmp/ltsmin10995256720721444355
[2024-05-21 17:40:57] [INFO ] Computing symmetric may disable matrix : 23 transitions.
[2024-05-21 17:40:57] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 17:40:57] [INFO ] Computing symmetric may enable matrix : 23 transitions.
[2024-05-21 17:40:57] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 17:40:57] [INFO ] Computing Do-Not-Accords matrix : 23 transitions.
[2024-05-21 17:40:57] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 17:40:57] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10995256720721444355
Running compilation step : cd /tmp/ltsmin10995256720721444355;'/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 100 ms.
Running link step : cd /tmp/ltsmin10995256720721444355;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin10995256720721444355;'/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/stateBased6795091110954063930.hoa' '--buchi-type=spotba'
LTSmin run took 51 ms.
FORMULA CryptoMiner-COL-D10N100-LTLCardinality-09 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CryptoMiner-COL-D10N100-LTLCardinality-09 finished in 1645 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)||(p0&&G(F(!p0)))))))'
Support contains 22 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 33/33 transitions.
Applied a total of 0 rules in 1 ms. Remains 33 /33 variables (removed 0) and now considering 33/33 (removed 0) transitions.
// Phase 1: matrix 33 rows 33 cols
[2024-05-21 17:40:57] [INFO ] Computed 1 invariants in 1 ms
[2024-05-21 17:40:57] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-05-21 17:40:57] [INFO ] Invariant cache hit.
[2024-05-21 17:40:57] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-21 17:40:57] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2024-05-21 17:40:57] [INFO ] Invariant cache hit.
[2024-05-21 17:40:57] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 84 ms. Remains : 33/33 places, 33/33 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CryptoMiner-COL-D10N100-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10) (ADD s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 54 ms.
Product exploration explored 100000 steps with 50000 reset in 61 ms.
Computed a total of 21 stabilizing places and 21 stable transitions
Graph (complete) has 85 edges and 33 vertex of which 12 are kept as prefixes of interest. Removing 21 places using SCC suffix rule.1 ms
Computed a total of 21 stabilizing places and 21 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 17 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CryptoMiner-COL-D10N100-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CryptoMiner-COL-D10N100-LTLCardinality-11 finished in 279 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 U (p1||G(!p0)))))'
Support contains 33 out of 33 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33/33 places, 33/33 transitions.
Applied a total of 0 rules in 2 ms. Remains 33 /33 variables (removed 0) and now considering 33/33 (removed 0) transitions.
[2024-05-21 17:40:57] [INFO ] Invariant cache hit.
[2024-05-21 17:40:57] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-21 17:40:57] [INFO ] Invariant cache hit.
[2024-05-21 17:40:57] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-21 17:40:57] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2024-05-21 17:40:57] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-21 17:40:57] [INFO ] Invariant cache hit.
[2024-05-21 17:40:57] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 94 ms. Remains : 33/33 places, 33/33 transitions.
Stuttering acceptance computed with spot in 29 ms :[(AND (NOT p1) p0)]
Running random walk in product with property : CryptoMiner-COL-D10N100-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(AND (LEQ 3 (ADD s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32)) (GT (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10) (ADD s11 s12 s13 s14 s15 s16 s17 s18 s19 s20...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 179 ms.
Product exploration explored 100000 steps with 0 reset in 197 ms.
Computed a total of 21 stabilizing places and 21 stable transitions
Graph (complete) has 85 edges and 33 vertex of which 12 are kept as prefixes of interest. Removing 21 places using SCC suffix rule.1 ms
Computed a total of 21 stabilizing places and 21 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 152 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(AND p0 (NOT p1))]
Incomplete random walk after 10034 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1433 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 2) seen :1
Finished Best-First random walk after 396 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=396 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 5 factoid took 101 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 25 ms :[(AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 25 ms :[(AND p0 (NOT p1))]
Support contains 33 out of 33 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33/33 places, 33/33 transitions.
Applied a total of 0 rules in 2 ms. Remains 33 /33 variables (removed 0) and now considering 33/33 (removed 0) transitions.
[2024-05-21 17:40:58] [INFO ] Invariant cache hit.
[2024-05-21 17:40:58] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-21 17:40:58] [INFO ] Invariant cache hit.
[2024-05-21 17:40:58] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-21 17:40:58] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2024-05-21 17:40:58] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-21 17:40:58] [INFO ] Invariant cache hit.
[2024-05-21 17:40:58] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 79 ms. Remains : 33/33 places, 33/33 transitions.
Computed a total of 21 stabilizing places and 21 stable transitions
Graph (complete) has 85 edges and 33 vertex of which 12 are kept as prefixes of interest. Removing 21 places using SCC suffix rule.0 ms
Computed a total of 21 stabilizing places and 21 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 73 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(AND p0 (NOT p1))]
Finished random walk after 3446 steps, including 1 resets, run visited all 2 properties in 2 ms. (steps per millisecond=1723 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 5 factoid took 112 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 26 ms :[(AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 45 ms :[(AND p0 (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 148 ms.
Product exploration explored 100000 steps with 0 reset in 190 ms.
Built C files in :
/tmp/ltsmin13445496448291441634
[2024-05-21 17:40:59] [INFO ] Computing symmetric may disable matrix : 33 transitions.
[2024-05-21 17:40:59] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 17:40:59] [INFO ] Computing symmetric may enable matrix : 33 transitions.
[2024-05-21 17:40:59] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 17:40:59] [INFO ] Computing Do-Not-Accords matrix : 33 transitions.
[2024-05-21 17:40:59] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 17:40:59] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13445496448291441634
Running compilation step : cd /tmp/ltsmin13445496448291441634;'/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 110 ms.
Running link step : cd /tmp/ltsmin13445496448291441634;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin13445496448291441634;'/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/stateBased7553128183369587688.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 33 out of 33 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33/33 places, 33/33 transitions.
Applied a total of 0 rules in 6 ms. Remains 33 /33 variables (removed 0) and now considering 33/33 (removed 0) transitions.
[2024-05-21 17:41:14] [INFO ] Invariant cache hit.
[2024-05-21 17:41:14] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-21 17:41:14] [INFO ] Invariant cache hit.
[2024-05-21 17:41:14] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-21 17:41:14] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2024-05-21 17:41:14] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-21 17:41:14] [INFO ] Invariant cache hit.
[2024-05-21 17:41:14] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 105 ms. Remains : 33/33 places, 33/33 transitions.
Built C files in :
/tmp/ltsmin7484160727733329696
[2024-05-21 17:41:14] [INFO ] Computing symmetric may disable matrix : 33 transitions.
[2024-05-21 17:41:14] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 17:41:14] [INFO ] Computing symmetric may enable matrix : 33 transitions.
[2024-05-21 17:41:14] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 17:41:14] [INFO ] Computing Do-Not-Accords matrix : 33 transitions.
[2024-05-21 17:41:14] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 17:41:14] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7484160727733329696
Running compilation step : cd /tmp/ltsmin7484160727733329696;'/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 106 ms.
Running link step : cd /tmp/ltsmin7484160727733329696;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin7484160727733329696;'/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/stateBased1207981281255472761.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 17:41:29] [INFO ] Flatten gal took : 3 ms
[2024-05-21 17:41:29] [INFO ] Flatten gal took : 3 ms
[2024-05-21 17:41:29] [INFO ] Time to serialize gal into /tmp/LTL17599050208101609196.gal : 1 ms
[2024-05-21 17:41:29] [INFO ] Time to serialize properties into /tmp/LTL9223427318349371679.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/LTL17599050208101609196.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17011767075313469575.hoa' '-atoms' '/tmp/LTL9223427318349371679.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/LTL9223427318349371679.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17011767075313469575.hoa
Reverse transition relation is NOT exact ! Due to transitions t22, t23, t24, t25, t26, t27, t28, t29, t30, t31, t32, Intersection with reachable at each s...215
Computing Next relation with stutter on 1.07187e+07 deadlock states
Detected timeout of ITS tools.
[2024-05-21 17:41:44] [INFO ] Flatten gal took : 3 ms
[2024-05-21 17:41:44] [INFO ] Flatten gal took : 2 ms
[2024-05-21 17:41:44] [INFO ] Time to serialize gal into /tmp/LTL9468257149414192859.gal : 1 ms
[2024-05-21 17:41:44] [INFO ] Time to serialize properties into /tmp/LTL14158639985309150787.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/LTL9468257149414192859.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14158639985309150787.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 : !((F(("(((((capacity_0+capacity_1)+(capacity_2+capacity_3))+((capacity_4+capacity_5)+(capacity_6+capacity_7)))+((capacity_8+capacity_9...955
Formula 0 simplified : G(!"(((((capacity_0+capacity_1)+(capacity_2+capacity_3))+((capacity_4+capacity_5)+(capacity_6+capacity_7)))+((capacity_8+capacity_9)...689
Reverse transition relation is NOT exact ! Due to transitions t22, t23, t24, t25, t26, t27, t28, t29, t30, t31, t32, Intersection with reachable at each s...215
Computing Next relation with stutter on 1.07187e+07 deadlock states
Detected timeout of ITS tools.
[2024-05-21 17:41:59] [INFO ] Flatten gal took : 2 ms
[2024-05-21 17:41:59] [INFO ] Applying decomposition
[2024-05-21 17:41:59] [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/graph3565873008277806316.txt' '-o' '/tmp/graph3565873008277806316.bin' '-w' '/tmp/graph3565873008277806316.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph3565873008277806316.bin' '-l' '-1' '-v' '-w' '/tmp/graph3565873008277806316.weights' '-q' '0' '-e' '0.001'
[2024-05-21 17:41:59] [INFO ] Decomposing Gal with order
[2024-05-21 17:41:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 17:41:59] [INFO ] Flatten gal took : 10 ms
[2024-05-21 17:41:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-21 17:41:59] [INFO ] Time to serialize gal into /tmp/LTL6787527811925692555.gal : 0 ms
[2024-05-21 17:41:59] [INFO ] Time to serialize properties into /tmp/LTL5983839036224511564.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/LTL6787527811925692555.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5983839036224511564.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 : !((F(("(((((gu0.capacity_0+gu0.capacity_1)+(gu0.capacity_2+gu0.capacity_3))+((gu0.capacity_4+gu0.capacity_5)+(gu0.capacity_6+gu0.capac...1263
Formula 0 simplified : G(!"(((((gu0.capacity_0+gu0.capacity_1)+(gu0.capacity_2+gu0.capacity_3))+((gu0.capacity_4+gu0.capacity_5)+(gu0.capacity_6+gu0.capaci...909
Reverse transition relation is NOT exact ! Due to transitions gu0.t22, gu0.t23, gu0.t24, gu0.t25, gu0.t26, gu0.t27, gu0.t28, gu0.t29, gu0.t30, gu0.t31, gu0...259
Computing Next relation with stutter on 1.07187e+07 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4382012018170815284
[2024-05-21 17:42:14] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4382012018170815284
Running compilation step : cd /tmp/ltsmin4382012018170815284;'/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 107 ms.
Running link step : cd /tmp/ltsmin4382012018170815284;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin4382012018170815284;'/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' '<>((!(LTLAPp0==true) U ([](!(LTLAPp0==true))||(LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property CryptoMiner-COL-D10N100-LTLCardinality-12 finished in 92339 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 11 out of 33 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33/33 places, 33/33 transitions.
Graph (trivial) has 21 edges and 33 vertex of which 11 / 33 are part of one of the 1 SCC in 0 ms
Free SCC test removed 10 places
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Applied a total of 1 rules in 3 ms. Remains 23 /33 variables (removed 10) and now considering 23/33 (removed 10) transitions.
// Phase 1: matrix 23 rows 23 cols
[2024-05-21 17:42:29] [INFO ] Computed 1 invariants in 1 ms
[2024-05-21 17:42:29] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-21 17:42:29] [INFO ] Invariant cache hit.
[2024-05-21 17:42:29] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-21 17:42:29] [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 17:42:29] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-21 17:42:29] [INFO ] Invariant cache hit.
[2024-05-21 17:42:29] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 23/33 places, 23/33 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 80 ms. Remains : 23/33 places, 23/33 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : CryptoMiner-COL-D10N100-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 2 (ADD s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA CryptoMiner-COL-D10N100-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-COL-D10N100-LTLCardinality-14 finished in 137 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(!p0)))'
Support contains 22 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 33/33 transitions.
Applied a total of 0 rules in 0 ms. Remains 33 /33 variables (removed 0) and now considering 33/33 (removed 0) transitions.
// Phase 1: matrix 33 rows 33 cols
[2024-05-21 17:42:29] [INFO ] Computed 1 invariants in 1 ms
[2024-05-21 17:42:29] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-21 17:42:29] [INFO ] Invariant cache hit.
[2024-05-21 17:42:30] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-21 17:42:30] [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 17:42:30] [INFO ] Invariant cache hit.
[2024-05-21 17:42:30] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 78 ms. Remains : 33/33 places, 33/33 transitions.
Stuttering acceptance computed with spot in 80 ms :[true, p0, p0]
Running random walk in product with property : CryptoMiner-COL-D10N100-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GT (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10) (ADD s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32))], 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CryptoMiner-COL-D10N100-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-COL-D10N100-LTLCardinality-15 finished in 169 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 U (p1||G(!p0)))))'
[2024-05-21 17:42:30] [INFO ] Flatten gal took : 10 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin775273254038719317
[2024-05-21 17:42:30] [INFO ] Computing symmetric may disable matrix : 33 transitions.
[2024-05-21 17:42:30] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 17:42:30] [INFO ] Computing symmetric may enable matrix : 33 transitions.
[2024-05-21 17:42:30] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 17:42:30] [INFO ] Applying decomposition
[2024-05-21 17:42:30] [INFO ] Computing Do-Not-Accords matrix : 33 transitions.
[2024-05-21 17:42:30] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 17:42:30] [INFO ] Flatten gal took : 2 ms
[2024-05-21 17:42:30] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin775273254038719317
Running compilation step : cd /tmp/ltsmin775273254038719317;'/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/graph16194442480803366770.txt' '-o' '/tmp/graph16194442480803366770.bin' '-w' '/tmp/graph16194442480803366770.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph16194442480803366770.bin' '-l' '-1' '-v' '-w' '/tmp/graph16194442480803366770.weights' '-q' '0' '-e' '0.001'
[2024-05-21 17:42:30] [INFO ] Decomposing Gal with order
[2024-05-21 17:42:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 17:42:30] [INFO ] Flatten gal took : 3 ms
[2024-05-21 17:42:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-21 17:42:30] [INFO ] Time to serialize gal into /tmp/LTLCardinality8531015744663071933.gal : 1 ms
[2024-05-21 17:42:30] [INFO ] Time to serialize properties into /tmp/LTLCardinality1306508139106133328.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/LTLCardinality8531015744663071933.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality1306508139106133328.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 : !((F(("(((((gu0.capacity_0+gu0.capacity_1)+(gu0.capacity_2+gu0.capacity_3))+((gu0.capacity_4+gu0.capacity_5)+(gu0.capacity_6+gu0.capac...1263
Formula 0 simplified : G(!"(((((gu0.capacity_0+gu0.capacity_1)+(gu0.capacity_2+gu0.capacity_3))+((gu0.capacity_4+gu0.capacity_5)+(gu0.capacity_6+gu0.capaci...909
Compilation finished in 107 ms.
Running link step : cd /tmp/ltsmin775273254038719317;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 22 ms.
Running LTSmin : cd /tmp/ltsmin775273254038719317;'/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' '--ltl' '<>((!(LTLAPp0==true) U ((LTLAPp1==true)||[](!(LTLAPp0==true)))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions gu0.t22, gu0.t23, gu0.t24, gu0.t25, gu0.t26, gu0.t27, gu0.t28, gu0.t29, gu0.t30, gu0.t31, gu0...259
Computing Next relation with stutter on 1.07187e+07 deadlock states
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 1/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.005: LTL layer: formula: <>((!(LTLAPp0==true) U ((LTLAPp1==true)||[](!(LTLAPp0==true)))))
pins2lts-mc-linux64( 1/ 8), 0.005: "<>((!(LTLAPp0==true) U ((LTLAPp1==true)||[](!(LTLAPp0==true)))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.005: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.012: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.012: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.012: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.012: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.012: Initializing POR dependencies: labels 35, guards 33
pins2lts-mc-linux64( 4/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.011: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.012: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.012: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.013: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.014: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.014: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.014: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.015: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.015: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.015: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.016: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.016: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.016: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.018: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.018: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.018: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.023: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 0.026: There are 36 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.026: State length is 34, there are 37 groups
pins2lts-mc-linux64( 0/ 8), 0.026: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.026: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.026: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.026: Visible groups: 0 / 37, labels: 2 / 36
pins2lts-mc-linux64( 0/ 8), 0.026: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 0.026: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 2/ 8), 0.069: [Blue] ~120 levels ~960 states ~4528 transitions
pins2lts-mc-linux64( 2/ 8), 0.108: [Blue] ~240 levels ~1920 states ~10096 transitions
pins2lts-mc-linux64( 3/ 8), 0.155: [Blue] ~316 levels ~3840 states ~14480 transitions
pins2lts-mc-linux64( 3/ 8), 0.222: [Blue] ~596 levels ~7680 states ~25360 transitions
pins2lts-mc-linux64( 1/ 8), 0.323: [Blue] ~1854 levels ~15360 states ~52240 transitions
pins2lts-mc-linux64( 1/ 8), 0.452: [Blue] ~3774 levels ~30720 states ~99144 transitions
pins2lts-mc-linux64( 4/ 8), 0.714: [Blue] ~7610 levels ~61440 states ~237224 transitions
pins2lts-mc-linux64( 4/ 8), 1.077: [Blue] ~15031 levels ~122880 states ~504760 transitions
pins2lts-mc-linux64( 5/ 8), 1.618: [Blue] ~30506 levels ~245760 states ~935032 transitions
pins2lts-mc-linux64( 5/ 8), 2.358: [Blue] ~60871 levels ~491520 states ~1994080 transitions
pins2lts-mc-linux64( 3/ 8), 3.550: [Blue] ~121455 levels ~983040 states ~4359240 transitions
pins2lts-mc-linux64( 3/ 8), 6.071: [Blue] ~243874 levels ~1966080 states ~9646072 transitions
pins2lts-mc-linux64( 3/ 8), 11.514: [Blue] ~488982 levels ~3932160 states ~20856312 transitions
pins2lts-mc-linux64( 3/ 8), 23.830: [Blue] ~979996 levels ~7864320 states ~45551192 transitions
pins2lts-mc-linux64( 4/ 8), 50.218: [Blue] ~1962396 levels ~15728640 states ~96461184 transitions
pins2lts-mc-linux64( 7/ 8), 59.553: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 59.576:
pins2lts-mc-linux64( 0/ 8), 59.576: Explored 17450349 states 110759925 transitions, fanout: 6.347
pins2lts-mc-linux64( 0/ 8), 59.576: Total exploration time 59.540 sec (59.490 sec minimum, 59.517 sec on average)
pins2lts-mc-linux64( 0/ 8), 59.576: States per second: 293086, Transitions per second: 1860261
pins2lts-mc-linux64( 0/ 8), 59.576:
pins2lts-mc-linux64( 0/ 8), 59.576: State space has 31127265 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 59.576: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 59.576: blue states: 17450349 (56.06%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 59.576: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 59.576: all-red states: 509 (0.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 59.576:
pins2lts-mc-linux64( 0/ 8), 59.576: Total memory used for local state coloring: 265.6MB
pins2lts-mc-linux64( 0/ 8), 59.576:
pins2lts-mc-linux64( 0/ 8), 59.576: Queue width: 8B, total height: 17406695, memory: 132.80MB
pins2lts-mc-linux64( 0/ 8), 59.576: Tree memory: 493.5MB, 16.6 B/state, compr.: 12.0%
pins2lts-mc-linux64( 0/ 8), 59.576: Tree fill ratio (roots/leafs): 23.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 59.576: Stored 33 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 59.577: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 59.577: Est. total memory use: 626.3MB (~1156.8MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin775273254038719317;'/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' '--ltl' '<>((!(LTLAPp0==true) U ((LTLAPp1==true)||[](!(LTLAPp0==true)))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin775273254038719317;'/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' '--ltl' '<>((!(LTLAPp0==true) U ((LTLAPp1==true)||[](!(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 18:03:06] [INFO ] Applying decomposition
[2024-05-21 18:03:06] [INFO ] Flatten gal took : 2 ms
[2024-05-21 18:03:06] [INFO ] Decomposing Gal with order
[2024-05-21 18:03:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 18:03:06] [INFO ] Flatten gal took : 4 ms
[2024-05-21 18:03:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-21 18:03:06] [INFO ] Time to serialize gal into /tmp/LTLCardinality8722116174236410883.gal : 1 ms
[2024-05-21 18:03:06] [INFO ] Time to serialize properties into /tmp/LTLCardinality9381800601768358865.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/LTLCardinality8722116174236410883.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality9381800601768358865.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 : !((F(("(((((gCD0.capacity_0+gCD1.capacity_1)+(gCD2.capacity_2+gCD3.capacity_3))+((gCD4.capacity_4+gCD5.capacity_5)+(gCD6.capacity_6+gC...1347
Formula 0 simplified : G(!"(((((gCD0.capacity_0+gCD1.capacity_1)+(gCD2.capacity_2+gCD3.capacity_3))+((gCD4.capacity_4+gCD5.capacity_5)+(gCD6.capacity_6+gCD...969
Reverse transition relation is NOT exact ! Due to transitions gCD10.t32, t22, t23, t24, t25, t26, t27, t28, t29, t30, t31, Intersection with reachable at ...221
Computing Next relation with stutter on 1.07187e+07 deadlock states
Detected timeout of ITS tools.
[2024-05-21 18:23:42] [INFO ] Flatten gal took : 2 ms
[2024-05-21 18:23:42] [INFO ] Input system was already deterministic with 33 transitions.
[2024-05-21 18:23:42] [INFO ] Transformed 33 places.
[2024-05-21 18:23:42] [INFO ] Transformed 33 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-21 18:23:42] [INFO ] Time to serialize gal into /tmp/LTLCardinality13642271064288520038.gal : 1 ms
[2024-05-21 18:23:42] [INFO ] Time to serialize properties into /tmp/LTLCardinality9203948472861421694.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/LTLCardinality13642271064288520038.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality9203948472861421694.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...343
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F(("(((((capacity_0+capacity_1)+(capacity_2+capacity_3))+((capacity_4+capacity_5)+(capacity_6+capacity_7)))+((capacity_8+capacity_9...955
Formula 0 simplified : G(!"(((((capacity_0+capacity_1)+(capacity_2+capacity_3))+((capacity_4+capacity_5)+(capacity_6+capacity_7)))+((capacity_8+capacity_9)...689
Reverse transition relation is NOT exact ! Due to transitions t22, t23, t24, t25, t26, t27, t28, t29, t30, t31, t32, Intersection with reachable at each s...215
Computing Next relation with stutter on 1.07187e+07 deadlock states
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 13144528 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16037184 kB

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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-COL-D10N100"
export BK_EXAMINATION="LTLCardinality"
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-COL-D10N100, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r109-tall-171624208100217"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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