Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 512K
-rw-r--r-- 1 mcc users 9.8K Mar 23 15:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 104K Mar 23 15:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Mar 23 15:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Mar 23 15:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.3K Mar 23 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 23 07:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 23 07:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 23 07:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 12K Mar 23 15:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 106K Mar 23 15:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Mar 23 15:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 99K Mar 23 15:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 23 07:06 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 23 07:06 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 26 22:42 equiv_pt
-rw-r--r-- 1 mcc users 8 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 5 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 13K Mar 31 16:48 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-D05N250-LTLCardinality-00
FORMULA_NAME CryptoMiner-COL-D05N250-LTLCardinality-01
FORMULA_NAME CryptoMiner-COL-D05N250-LTLCardinality-02
FORMULA_NAME CryptoMiner-COL-D05N250-LTLCardinality-03
FORMULA_NAME CryptoMiner-COL-D05N250-LTLCardinality-04
FORMULA_NAME CryptoMiner-COL-D05N250-LTLCardinality-05
FORMULA_NAME CryptoMiner-COL-D05N250-LTLCardinality-06
FORMULA_NAME CryptoMiner-COL-D05N250-LTLCardinality-07
FORMULA_NAME CryptoMiner-COL-D05N250-LTLCardinality-08
FORMULA_NAME CryptoMiner-COL-D05N250-LTLCardinality-09
FORMULA_NAME CryptoMiner-COL-D05N250-LTLCardinality-10
FORMULA_NAME CryptoMiner-COL-D05N250-LTLCardinality-11
FORMULA_NAME CryptoMiner-COL-D05N250-LTLCardinality-12
FORMULA_NAME CryptoMiner-COL-D05N250-LTLCardinality-13
FORMULA_NAME CryptoMiner-COL-D05N250-LTLCardinality-14
FORMULA_NAME CryptoMiner-COL-D05N250-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1680877087032

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=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CryptoMiner-COL-D05N250
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202304061127
[2023-04-07 14:18:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-04-07 14:18:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 14:18:08] [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.
[2023-04-07 14:18:08] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-04-07 14:18:09] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 515 ms
[2023-04-07 14:18:09] [INFO ] Imported 3 HL places and 5 HL transitions for a total of 18 PT places and 30.0 transition bindings in 18 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 17 ms.
Working with output stream class java.io.PrintStream
[2023-04-07 14:18:09] [INFO ] Built PT skeleton of HLPN with 3 places and 5 transitions 14 arcs in 5 ms.
[2023-04-07 14:18:09] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 4 formulas.
FORMULA CryptoMiner-COL-D05N250-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CryptoMiner-COL-D05N250-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CryptoMiner-COL-D05N250-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CryptoMiner-COL-D05N250-LTLCardinality-14 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 10180 steps, including 70 resets, run finished after 24 ms. (steps per millisecond=424 ) properties (out of 19) seen :17
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-04-07 14:18:09] [INFO ] Flow matrix only has 4 transitions (discarded 1 similar events)
// Phase 1: matrix 4 rows 3 cols
[2023-04-07 14:18:09] [INFO ] Computed 0 invariants in 4 ms
[2023-04-07 14:18:09] [INFO ] After 89ms 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 12 simplifications.
FORMULA CryptoMiner-COL-D05N250-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-04-07 14:18:09] [INFO ] Flatten gal took : 12 ms
[2023-04-07 14:18:09] [INFO ] Flatten gal took : 1 ms
Arc [0:1*[(MOD (ADD $x 1) 6)]] contains successor/predecessor on variables of sort CD
[2023-04-07 14:18:09] [INFO ] Unfolded HLPN to a Petri net with 18 places and 18 transitions 52 arcs in 5 ms.
[2023-04-07 14:18:09] [INFO ] Unfolded 11 HLPN properties in 1 ms.
Support contains 18 out of 18 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 18/18 transitions.
Applied a total of 0 rules in 4 ms. Remains 18 /18 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 18 cols
[2023-04-07 14:18:09] [INFO ] Computed 1 invariants in 1 ms
[2023-04-07 14:18:09] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-04-07 14:18:09] [INFO ] Invariant cache hit.
[2023-04-07 14:18:09] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 14:18:09] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
[2023-04-07 14:18:09] [INFO ] Invariant cache hit.
[2023-04-07 14:18:09] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 110 ms. Remains : 18/18 places, 18/18 transitions.
Support contains 18 out of 18 places after structural reductions.
[2023-04-07 14:18:09] [INFO ] Flatten gal took : 3 ms
[2023-04-07 14:18:09] [INFO ] Flatten gal took : 2 ms
[2023-04-07 14:18:09] [INFO ] Input system was already deterministic with 18 transitions.
Incomplete random walk after 10060 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=670 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 14) seen :9
Finished Best-First random walk after 1007 steps, including 0 resets, run visited all 5 properties in 8 ms. (steps per millisecond=125 )
Parikh walk visited 0 properties in 0 ms.
FORMULA CryptoMiner-COL-D05N250-LTLCardinality-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 11 stabilizing places and 11 stable transitions
Graph (complete) has 45 edges and 18 vertex of which 7 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.2 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(p0) U (p1||X(G(p2))))))'
Support contains 18 out of 18 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-04-07 14:18:10] [INFO ] Invariant cache hit.
[2023-04-07 14:18:10] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-04-07 14:18:10] [INFO ] Invariant cache hit.
[2023-04-07 14:18:10] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 14:18:10] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
[2023-04-07 14:18:10] [INFO ] Invariant cache hit.
[2023-04-07 14:18:10] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 93 ms. Remains : 18/18 places, 18/18 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 287 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0)), true, (NOT p2)]
Running random walk in product with property : CryptoMiner-COL-D05N250-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND p2 (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=p2, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(LEQ (ADD s0 s1 s2 s3 s4 s5) (ADD s6 s7 s8 s9 s10 s11)), p2:(GT 1 (ADD s0 s1 s2 s3 s4 s5)), p0:(GT (ADD s12 s13 s14 s15 s16 s17) (ADD s0 s1 s2 s3 s4 s5...], 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]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 2 ms.
FORMULA CryptoMiner-COL-D05N250-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-COL-D05N250-LTLCardinality-00 finished in 440 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 18 out of 18 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 18/18 places, 18/18 transitions.
Applied a total of 0 rules in 3 ms. Remains 18 /18 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-04-07 14:18:10] [INFO ] Invariant cache hit.
[2023-04-07 14:18:10] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-04-07 14:18:10] [INFO ] Invariant cache hit.
[2023-04-07 14:18:10] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 14:18:10] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
[2023-04-07 14:18:10] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 14:18:10] [INFO ] Invariant cache hit.
[2023-04-07 14:18:10] [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 101 ms. Remains : 18/18 places, 18/18 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : CryptoMiner-COL-D05N250-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LEQ (ADD s0 s1 s2 s3 s4 s5) (ADD s12 s13 s14 s15 s16 s17)) (LEQ 2 (ADD s6 s7 s8 s9 s10 s11)))], 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 218 ms.
Stack based approach found an accepted trace after 42 steps with 0 reset with depth 43 and stack size 43 in 0 ms.
FORMULA CryptoMiner-COL-D05N250-LTLCardinality-02 FALSE TECHNIQUES STACK_TEST
Treatment of property CryptoMiner-COL-D05N250-LTLCardinality-02 finished in 367 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (p1||F(p2))))'
Support contains 18 out of 18 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 18/18 places, 18/18 transitions.
Applied a total of 0 rules in 2 ms. Remains 18 /18 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-04-07 14:18:10] [INFO ] Invariant cache hit.
[2023-04-07 14:18:10] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-04-07 14:18:10] [INFO ] Invariant cache hit.
[2023-04-07 14:18:10] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 14:18:10] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2023-04-07 14:18:10] [INFO ] Redundant transitions in 1 ms returned []
[2023-04-07 14:18:10] [INFO ] Invariant cache hit.
[2023-04-07 14:18:10] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 77 ms. Remains : 18/18 places, 18/18 transitions.
Stuttering acceptance computed with spot in 88 ms :[(NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : CryptoMiner-COL-D05N250-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p2:(GT 1 (ADD s0 s1 s2 s3 s4 s5)), p1:(AND (LEQ (ADD s12 s13 s14 s15 s16 s17) (ADD s0 s1 s2 s3 s4 s5)) (LEQ (ADD s0 s1 s2 s3 s4 s5) (ADD s12 s13 s14 s15 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 147 ms.
Stack based approach found an accepted trace after 64 steps with 0 reset with depth 65 and stack size 65 in 0 ms.
FORMULA CryptoMiner-COL-D05N250-LTLCardinality-03 FALSE TECHNIQUES STACK_TEST
Treatment of property CryptoMiner-COL-D05N250-LTLCardinality-03 finished in 331 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&F(G(p1))))'
Support contains 12 out of 18 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 18/18 places, 18/18 transitions.
Applied a total of 0 rules in 4 ms. Remains 18 /18 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-04-07 14:18:11] [INFO ] Invariant cache hit.
[2023-04-07 14:18:11] [INFO ] Implicit Places using invariants in 67 ms returned []
[2023-04-07 14:18:11] [INFO ] Invariant cache hit.
[2023-04-07 14:18:11] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 14:18:11] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
[2023-04-07 14:18:11] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 14:18:11] [INFO ] Invariant cache hit.
[2023-04-07 14:18:11] [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 153 ms. Remains : 18/18 places, 18/18 transitions.
Stuttering acceptance computed with spot in 117 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : CryptoMiner-COL-D05N250-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GT 2 (ADD s0 s1 s2 s3 s4 s5)), p1:(LEQ 1 (ADD s12 s13 s14 s15 s16 s17))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 99 ms.
Product exploration explored 100000 steps with 0 reset in 257 ms.
Computed a total of 11 stabilizing places and 11 stable transitions
Graph (complete) has 45 edges and 18 vertex of which 7 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.0 ms
Computed a total of 11 stabilizing places and 11 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 3 factoid took 177 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 198 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), false, false]
Incomplete random walk after 10060 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1257 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-04-07 14:18:12] [INFO ] Invariant cache hit.
[2023-04-07 14:18:12] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-04-07 14:18:12] [INFO ] After 38ms 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 (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT p0))), (G (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X p1)), (X (X (NOT p1))), (F p1), (F p0), (F (AND p0 p1))]
Knowledge based reduction with 4 factoid took 315 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 166 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), false, false]
Stuttering acceptance computed with spot in 197 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), false, false]
[2023-04-07 14:18:13] [INFO ] Invariant cache hit.
Proved EG (NOT p1)
[2023-04-07 14:18:13] [INFO ] Invariant cache hit.
Proved EG (NOT p0)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT p0))), (G (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X p1)), (X (X (NOT p1))), (F p1), (F p0), (F (AND p0 p1)), (G (NOT p1)), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p1))
Knowledge based reduction with 4 factoid took 253 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CryptoMiner-COL-D05N250-LTLCardinality-06 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CryptoMiner-COL-D05N250-LTLCardinality-06 finished in 2107 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(G(!p0))&&F(p1))))'
Support contains 12 out of 18 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 18/18 places, 18/18 transitions.
Graph (complete) has 45 edges and 18 vertex of which 17 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 5 ms. Remains 17 /18 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 17 cols
[2023-04-07 14:18:13] [INFO ] Computed 0 invariants in 1 ms
[2023-04-07 14:18:13] [INFO ] Implicit Places using invariants in 33 ms returned []
[2023-04-07 14:18:13] [INFO ] Invariant cache hit.
[2023-04-07 14:18:13] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 14:18:13] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
[2023-04-07 14:18:13] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 14:18:13] [INFO ] Invariant cache hit.
[2023-04-07 14:18:13] [INFO ] Dead Transitions using invariants and state equation in 178 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 17/18 places, 18/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 259 ms. Remains : 17/18 places, 18/18 transitions.
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p1) p0), p0, (NOT p1)]
Running random walk in product with property : CryptoMiner-COL-D05N250-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GT 2 (ADD s0 s1 s2 s3 s4 s5)), p1:(LEQ (ADD s6 s7 s8 s9 s10 s11) (ADD s0 s1 s2 s3 s4 s5))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 97 ms.
Product exploration explored 100000 steps with 0 reset in 128 ms.
Computed a total of 10 stabilizing places and 11 stable transitions
Graph (complete) has 42 edges and 17 vertex of which 7 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.0 ms
Computed a total of 10 stabilizing places and 11 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (NOT p0)), (X (X p1)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 72 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 87 ms :[(OR (NOT p1) p0), p0, (NOT p1)]
Finished random walk after 7042 steps, including 2 resets, run visited all 2 properties in 3 ms. (steps per millisecond=2347 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (NOT p0)), (X (X p1)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 124 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 98 ms :[(OR (NOT p1) p0), p0, (NOT p1)]
Stuttering acceptance computed with spot in 83 ms :[(OR (NOT p1) p0), p0, (NOT p1)]
Support contains 12 out of 17 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 17/17 places, 18/18 transitions.
Applied a total of 0 rules in 3 ms. Remains 17 /17 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-04-07 14:18:14] [INFO ] Invariant cache hit.
[2023-04-07 14:18:14] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-04-07 14:18:14] [INFO ] Invariant cache hit.
[2023-04-07 14:18:14] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 14:18:14] [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.
[2023-04-07 14:18:14] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 14:18:14] [INFO ] Invariant cache hit.
[2023-04-07 14:18:14] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 91 ms. Remains : 17/17 places, 18/18 transitions.
Computed a total of 10 stabilizing places and 11 stable transitions
Graph (complete) has 42 edges and 17 vertex of which 7 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.1 ms
Computed a total of 10 stabilizing places and 11 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (NOT p0)), (X (X p1)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 74 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 100 ms :[(OR (NOT p1) p0), p0, (NOT p1)]
Incomplete random walk after 10060 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=2515 ) properties (out of 2) seen :0
Finished Best-First random walk after 1000 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=500 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (NOT p0)), (X (X p1)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 144 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 107 ms :[(OR (NOT p1) p0), p0, (NOT p1)]
Stuttering acceptance computed with spot in 117 ms :[(OR (NOT p1) p0), p0, (NOT p1)]
Stuttering acceptance computed with spot in 109 ms :[(OR (NOT p1) p0), p0, (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 158 ms.
Product exploration explored 100000 steps with 0 reset in 128 ms.
Support contains 12 out of 17 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 17/17 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 17 /17 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-04-07 14:18:15] [INFO ] Invariant cache hit.
[2023-04-07 14:18:15] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-04-07 14:18:15] [INFO ] Invariant cache hit.
[2023-04-07 14:18:15] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 14:18:15] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
[2023-04-07 14:18:15] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 14:18:15] [INFO ] Invariant cache hit.
[2023-04-07 14:18:15] [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 116 ms. Remains : 17/17 places, 18/18 transitions.
Treatment of property CryptoMiner-COL-D05N250-LTLCardinality-07 finished in 2283 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(F(!p0)) U p1)))'
Support contains 12 out of 18 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 18 cols
[2023-04-07 14:18:15] [INFO ] Computed 1 invariants in 0 ms
[2023-04-07 14:18:15] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-04-07 14:18:15] [INFO ] Invariant cache hit.
[2023-04-07 14:18:15] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 14:18:15] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2023-04-07 14:18:15] [INFO ] Invariant cache hit.
[2023-04-07 14:18:15] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 83 ms. Remains : 18/18 places, 18/18 transitions.
Stuttering acceptance computed with spot in 286 ms :[(NOT p1), (NOT p1), p0, p0]
Running random walk in product with property : CryptoMiner-COL-D05N250-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 2}, { cond=(NOT p1), acceptance={0} source=1 dest: 3}], [{ cond=p0, acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(LEQ (ADD s0 s1 s2 s3 s4 s5) (ADD s12 s13 s14 s15 s16 s17)), p0:(GT (ADD s12 s13 s14 s15 s16 s17) (ADD s0 s1 s2 s3 s4 s5))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 89 ms.
Product exploration explored 100000 steps with 0 reset in 99 ms.
Computed a total of 11 stabilizing places and 11 stable transitions
Graph (complete) has 45 edges and 18 vertex of which 7 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.1 ms
Computed a total of 11 stabilizing places and 11 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT (AND (NOT p1) p0))), true, (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 75 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 15 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 227 ms :[(OR (NOT p1) p0), (NOT p1), p0, p0, false, false]
Incomplete random walk after 10060 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1676 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-04-07 14:18:16] [INFO ] Invariant cache hit.
[2023-04-07 14:18:16] [INFO ] After 16ms 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 (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT (AND (NOT p1) p0))), true, (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (G (NOT (AND (NOT p1) p0)))]
False Knowledge obtained : [(F p1), (F p0), (F (AND p1 p0)), (F (AND p1 (NOT p0)))]
Knowledge based reduction with 8 factoid took 176 ms. Reduced automaton from 6 states, 15 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 102 ms :[(NOT p1), p0, p0]
Stuttering acceptance computed with spot in 94 ms :[(NOT p1), p0, p0]
[2023-04-07 14:18:16] [INFO ] Invariant cache hit.
Proved EG (NOT p1)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT (AND (NOT p1) p0))), true, (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (G (NOT (AND (NOT p1) p0)))]
False Knowledge obtained : [(F p1), (F p0), (F (AND p1 p0)), (F (AND p1 (NOT p0))), (G (NOT p1))]
Property proved to be false thanks to negative knowledge :(G (NOT p1))
Knowledge based reduction with 8 factoid took 204 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CryptoMiner-COL-D05N250-LTLCardinality-09 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CryptoMiner-COL-D05N250-LTLCardinality-09 finished in 1545 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 6 out of 18 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 18/18 places, 18/18 transitions.
Graph (trivial) has 11 edges and 18 vertex of which 6 / 18 are part of one of the 1 SCC in 2 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Applied a total of 1 rules in 4 ms. Remains 13 /18 variables (removed 5) and now considering 13/18 (removed 5) transitions.
// Phase 1: matrix 13 rows 13 cols
[2023-04-07 14:18:17] [INFO ] Computed 1 invariants in 1 ms
[2023-04-07 14:18:17] [INFO ] Implicit Places using invariants in 16 ms returned []
[2023-04-07 14:18:17] [INFO ] Invariant cache hit.
[2023-04-07 14:18:17] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 14:18:17] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2023-04-07 14:18:17] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 14:18:17] [INFO ] Invariant cache hit.
[2023-04-07 14:18:17] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 13/18 places, 13/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 89 ms. Remains : 13/18 places, 13/18 transitions.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Running random walk in product with property : CryptoMiner-COL-D05N250-LTLCardinality-10 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 3 (ADD s7 s8 s9 s10 s11 s12))], 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-D05N250-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-COL-D05N250-LTLCardinality-10 finished in 146 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X((G(p0)||F(p1))))&&F(p2)))'
Support contains 18 out of 18 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 18 cols
[2023-04-07 14:18:17] [INFO ] Computed 1 invariants in 1 ms
[2023-04-07 14:18:17] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-04-07 14:18:17] [INFO ] Invariant cache hit.
[2023-04-07 14:18:17] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 14:18:17] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2023-04-07 14:18:17] [INFO ] Invariant cache hit.
[2023-04-07 14:18:17] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 93 ms. Remains : 18/18 places, 18/18 transitions.
Stuttering acceptance computed with spot in 173 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : CryptoMiner-COL-D05N250-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(LEQ (ADD s0 s1 s2 s3 s4 s5) (ADD s12 s13 s14 s15 s16 s17)), p0:(LEQ (ADD s6 s7 s8 s9 s10 s11) (ADD s12 s13 s14 s15 s16 s17)), p1:(AND (LEQ (ADD s12 s1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 89 ms.
Stack based approach found an accepted trace after 51 steps with 0 reset with depth 52 and stack size 52 in 0 ms.
FORMULA CryptoMiner-COL-D05N250-LTLCardinality-12 FALSE TECHNIQUES STACK_TEST
Treatment of property CryptoMiner-COL-D05N250-LTLCardinality-12 finished in 378 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X((p1&&X(X(p2))))))'
Support contains 18 out of 18 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-04-07 14:18:17] [INFO ] Invariant cache hit.
[2023-04-07 14:18:17] [INFO ] Implicit Places using invariants in 16 ms returned []
[2023-04-07 14:18:17] [INFO ] Invariant cache hit.
[2023-04-07 14:18:17] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 14:18:17] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
[2023-04-07 14:18:17] [INFO ] Invariant cache hit.
[2023-04-07 14:18:17] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63 ms. Remains : 18/18 places, 18/18 transitions.
Stuttering acceptance computed with spot in 277 ms :[(NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true, (OR (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0)]
Running random walk in product with property : CryptoMiner-COL-D05N250-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 5}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 5}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 8}], [{ cond=true, acceptance={} source=3 dest: 0}], [{ cond=(AND p0 p1), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 8}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=p1, acceptance={} source=6 dest: 3}, { cond=(NOT p1), acceptance={} source=6 dest: 5}], [{ cond=p0, acceptance={} source=7 dest: 4}, { cond=(NOT p0), acceptance={} source=7 dest: 6}], [{ cond=(NOT p0), acceptance={} source=8 dest: 5}, { cond=p0, acceptance={} source=8 dest: 8}]], initial=7, aps=[p2:(LEQ (ADD s0 s1 s2 s3 s4 s5) (ADD s12 s13 s14 s15 s16 s17)), p0:(OR (LEQ (ADD s0 s1 s2 s3 s4 s5) (ADD s6 s7 s8 s9 s10 s11)) (LEQ 2 (ADD s6 s7 s8 s9 s10...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CryptoMiner-COL-D05N250-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-COL-D05N250-LTLCardinality-13 finished in 353 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(F(p0))||(p1&&F(G(!p1))))))'
Support contains 12 out of 18 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 18/18 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-04-07 14:18:18] [INFO ] Invariant cache hit.
[2023-04-07 14:18:18] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-04-07 14:18:18] [INFO ] Invariant cache hit.
[2023-04-07 14:18:18] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 14:18:18] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2023-04-07 14:18:18] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 14:18:18] [INFO ] Invariant cache hit.
[2023-04-07 14:18:18] [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 88 ms. Remains : 18/18 places, 18/18 transitions.
Stuttering acceptance computed with spot in 141 ms :[(NOT p0), (NOT p0), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Running random walk in product with property : CryptoMiner-COL-D05N250-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(GT 2 (ADD s12 s13 s14 s15 s16 s17)), p0:(GT (ADD s12 s13 s14 s15 s16 s17) (ADD s0 s1 s2 s3 s4 s5))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 109 ms.
Stack based approach found an accepted trace after 50 steps with 0 reset with depth 51 and stack size 51 in 1 ms.
FORMULA CryptoMiner-COL-D05N250-LTLCardinality-15 FALSE TECHNIQUES STACK_TEST
Treatment of property CryptoMiner-COL-D05N250-LTLCardinality-15 finished in 359 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(G(!p0))&&F(p1))))'
[2023-04-07 14:18:18] [INFO ] Flatten gal took : 4 ms
[2023-04-07 14:18:18] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2023-04-07 14:18:18] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 18 places, 18 transitions and 52 arcs took 1 ms.
Total runtime 9971 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1153/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : CryptoMiner-COL-D05N250-LTLCardinality-07

BK_STOP 1680877099666

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2023
ltl formula name CryptoMiner-COL-D05N250-LTLCardinality-07
ltl formula formula --ltl=/tmp/1153/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 18 places, 18 transitions and 52 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1153/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1153/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1153/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1153/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
free(): double free detected in tcache 2

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-D05N250"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
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-5348"
echo " Executing tool ltsminxred"
echo " Input is CryptoMiner-COL-D05N250, 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 r521-tall-167987246200115"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CryptoMiner-COL-D05N250.tgz
mv CryptoMiner-COL-D05N250 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 ;