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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 708K
-rw-r--r-- 1 mcc users 20K Mar 23 15:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 149K Mar 23 15:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Mar 23 15:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Mar 23 15:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 7.5K Mar 23 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 36K Mar 23 07:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.4K Mar 23 07:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 22K Mar 23 07:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 24K Mar 23 15:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 172K Mar 23 15:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 19K Mar 23 15:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 141K Mar 23 15:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.3K Mar 23 07:06 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.2K Mar 23 07:06 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 26 22:42 equiv_col
-rw-r--r-- 1 mcc users 8 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 7.8K 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-PT-D05N250-LTLCardinality-00
FORMULA_NAME CryptoMiner-PT-D05N250-LTLCardinality-01
FORMULA_NAME CryptoMiner-PT-D05N250-LTLCardinality-02
FORMULA_NAME CryptoMiner-PT-D05N250-LTLCardinality-03
FORMULA_NAME CryptoMiner-PT-D05N250-LTLCardinality-04
FORMULA_NAME CryptoMiner-PT-D05N250-LTLCardinality-05
FORMULA_NAME CryptoMiner-PT-D05N250-LTLCardinality-06
FORMULA_NAME CryptoMiner-PT-D05N250-LTLCardinality-07
FORMULA_NAME CryptoMiner-PT-D05N250-LTLCardinality-08
FORMULA_NAME CryptoMiner-PT-D05N250-LTLCardinality-09
FORMULA_NAME CryptoMiner-PT-D05N250-LTLCardinality-10
FORMULA_NAME CryptoMiner-PT-D05N250-LTLCardinality-11
FORMULA_NAME CryptoMiner-PT-D05N250-LTLCardinality-12
FORMULA_NAME CryptoMiner-PT-D05N250-LTLCardinality-13
FORMULA_NAME CryptoMiner-PT-D05N250-LTLCardinality-14
FORMULA_NAME CryptoMiner-PT-D05N250-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1680887874650

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-PT-D05N250
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202304061127
[2023-04-07 17:17:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-04-07 17:17:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 17:17:56] [INFO ] Load time of PNML (sax parser for PT used): 23 ms
[2023-04-07 17:17:56] [INFO ] Transformed 18 places.
[2023-04-07 17:17:56] [INFO ] Transformed 18 transitions.
[2023-04-07 17:17:56] [INFO ] Parsed PT model containing 18 places and 18 transitions and 52 arcs in 87 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA CryptoMiner-PT-D05N250-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CryptoMiner-PT-D05N250-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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 5 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 17:17:56] [INFO ] Computed 1 invariants in 5 ms
[2023-04-07 17:17:56] [INFO ] Implicit Places using invariants in 96 ms returned []
[2023-04-07 17:17:56] [INFO ] Invariant cache hit.
[2023-04-07 17:17:56] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 17:17:56] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 189 ms to find 0 implicit places.
[2023-04-07 17:17:56] [INFO ] Invariant cache hit.
[2023-04-07 17:17:57] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 275 ms. Remains : 18/18 places, 18/18 transitions.
Support contains 18 out of 18 places after structural reductions.
[2023-04-07 17:17:57] [INFO ] Flatten gal took : 12 ms
[2023-04-07 17:17:57] [INFO ] Flatten gal took : 5 ms
[2023-04-07 17:17:57] [INFO ] Input system was already deterministic with 18 transitions.
Incomplete random walk after 10059 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=110 ) properties (out of 28) seen :21
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 206 ms. (steps per millisecond=48 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-04-07 17:17:57] [INFO ] Invariant cache hit.
[2023-04-07 17:17:58] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-04-07 17:17:58] [INFO ] After 70ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-04-07 17:17:58] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-04-07 17:17:58] [INFO ] After 29ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :4
[2023-04-07 17:17:58] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 17:17:58] [INFO ] After 28ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :2 sat :4
[2023-04-07 17:17:58] [INFO ] After 177ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :4
Attempting to minimize the solution found.
Minimization took 22 ms.
[2023-04-07 17:17:58] [INFO ] After 292ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :4
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 1 properties in 15 ms.
Support contains 8 out of 18 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 18/18 places, 18/18 transitions.
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 18 transition count 17
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 17 transition count 17
Applied a total of 2 rules in 10 ms. Remains 17 /18 variables (removed 1) and now considering 17/18 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 17/18 places, 17/18 transitions.
Incomplete random walk after 10060 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2012 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 1270197 steps, run timeout after 3001 ms. (steps per millisecond=423 ) properties seen :{}
Probabilistic random walk after 1270197 steps, saw 538939 distinct states, run finished after 3003 ms. (steps per millisecond=422 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 17 rows 17 cols
[2023-04-07 17:18:01] [INFO ] Computed 1 invariants in 0 ms
[2023-04-07 17:18:01] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-04-07 17:18:01] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-04-07 17:18:01] [INFO ] After 12ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-04-07 17:18:01] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 17:18:01] [INFO ] After 6ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-04-07 17:18:01] [INFO ] After 20ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-04-07 17:18:01] [INFO ] After 80ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 3 ms.
Support contains 8 out of 17 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 17/17 places, 17/17 transitions.
Applied a total of 0 rules in 1 ms. Remains 17 /17 variables (removed 0) and now considering 17/17 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 17/17 places, 17/17 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 17/17 places, 17/17 transitions.
Applied a total of 0 rules in 1 ms. Remains 17 /17 variables (removed 0) and now considering 17/17 (removed 0) transitions.
[2023-04-07 17:18:01] [INFO ] Invariant cache hit.
[2023-04-07 17:18:01] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-04-07 17:18:01] [INFO ] Invariant cache hit.
[2023-04-07 17:18:01] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 17:18:01] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 165 ms to find 0 implicit places.
[2023-04-07 17:18:01] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 17:18:01] [INFO ] Invariant cache hit.
[2023-04-07 17:18:01] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 241 ms. Remains : 17/17 places, 17/17 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 17 transition count 16
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 16 transition count 16
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 16 transition count 15
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 15 transition count 15
Applied a total of 4 rules in 2 ms. Remains 15 /17 variables (removed 2) and now considering 15/17 (removed 2) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 15 rows 15 cols
[2023-04-07 17:18:01] [INFO ] Computed 1 invariants in 0 ms
[2023-04-07 17:18:01] [INFO ] After 36ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-04-07 17:18:01] [INFO ] [Nat]Absence check using 1 positive place invariants in 11 ms returned sat
[2023-04-07 17:18:01] [INFO ] After 18ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-04-07 17:18:01] [INFO ] After 25ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 76 ms.
[2023-04-07 17:18:01] [INFO ] After 151ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
FORMULA CryptoMiner-PT-D05N250-LTLCardinality-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA CryptoMiner-PT-D05N250-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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
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.
// Phase 1: matrix 18 rows 18 cols
[2023-04-07 17:18:02] [INFO ] Computed 1 invariants in 1 ms
[2023-04-07 17:18:02] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-04-07 17:18:02] [INFO ] Invariant cache hit.
[2023-04-07 17:18:02] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 17:18:02] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2023-04-07 17:18:02] [INFO ] Invariant cache hit.
[2023-04-07 17:18:02] [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 : 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 270 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-PT-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 s12 s13 s14 s15 s16 s17)), p2:(GT 1 (ADD s0 s1 s2 s3 s4 s5)), p0:(GT (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-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 7 steps with 0 reset in 2 ms.
FORMULA CryptoMiner-PT-D05N250-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-PT-D05N250-LTLCardinality-00 finished in 411 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 2 ms. Remains 18 /18 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-04-07 17:18:02] [INFO ] Invariant cache hit.
[2023-04-07 17:18:02] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-04-07 17:18:02] [INFO ] Invariant cache hit.
[2023-04-07 17:18:02] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 17:18:02] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
[2023-04-07 17:18:02] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 17:18:02] [INFO ] Invariant cache hit.
[2023-04-07 17:18:02] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 150 ms. Remains : 18/18 places, 18/18 transitions.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Running random walk in product with property : CryptoMiner-PT-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 s6 s7 s8 s9 s10 s11)) (LEQ 2 (ADD s12 s13 s14 s15 s16 s17)))], 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 381 ms.
Stack based approach found an accepted trace after 91 steps with 0 reset with depth 92 and stack size 92 in 1 ms.
FORMULA CryptoMiner-PT-D05N250-LTLCardinality-02 FALSE TECHNIQUES STACK_TEST
Treatment of property CryptoMiner-PT-D05N250-LTLCardinality-02 finished in 600 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 17:18:03] [INFO ] Invariant cache hit.
[2023-04-07 17:18:03] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-04-07 17:18:03] [INFO ] Invariant cache hit.
[2023-04-07 17:18:03] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 17:18:03] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
[2023-04-07 17:18:03] [INFO ] Redundant transitions in 1 ms returned []
[2023-04-07 17:18:03] [INFO ] Invariant cache hit.
[2023-04-07 17:18:03] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 148 ms. Remains : 18/18 places, 18/18 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : CryptoMiner-PT-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 s6 s7 s8 s9 s10 s11) (ADD s0 s1 s2 s3 s4 s5)) (LEQ (ADD s0 s1 s2 s3 s4 s5) (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, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 147 ms.
Stack based approach found an accepted trace after 79 steps with 0 reset with depth 80 and stack size 80 in 10 ms.
FORMULA CryptoMiner-PT-D05N250-LTLCardinality-03 FALSE TECHNIQUES STACK_TEST
Treatment of property CryptoMiner-PT-D05N250-LTLCardinality-03 finished in 388 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 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 6 edges and 18 vertex of which 6 / 18 are part of one of the 1 SCC in 4 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 40 edges and 13 vertex of which 12 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 2 rules in 6 ms. Remains 12 /18 variables (removed 6) and now considering 13/18 (removed 5) transitions.
// Phase 1: matrix 13 rows 12 cols
[2023-04-07 17:18:03] [INFO ] Computed 0 invariants in 1 ms
[2023-04-07 17:18:03] [INFO ] Implicit Places using invariants in 51 ms returned []
[2023-04-07 17:18:03] [INFO ] Invariant cache hit.
[2023-04-07 17:18:03] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 17:18:03] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
[2023-04-07 17:18:03] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 17:18:03] [INFO ] Invariant cache hit.
[2023-04-07 17:18:03] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 12/18 places, 13/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 156 ms. Remains : 12/18 places, 13/18 transitions.
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CryptoMiner-PT-D05N250-LTLCardinality-04 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:(GT 2 (ADD s6 s7 s8 s9 s10 s11))], 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 239 ms.
Product exploration explored 100000 steps with 0 reset in 72 ms.
Computed a total of 12 stabilizing places and 12 stable transitions
Graph (complete) has 37 edges and 12 vertex of which 1 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.0 ms
Computed a total of 12 stabilizing places and 12 stable transitions
Detected a total of 12/12 stabilizing places and 12/13 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 88 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 73 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10120 steps, including 83 resets, run finished after 4 ms. (steps per millisecond=2530 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 683 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 4589484 steps, run timeout after 3001 ms. (steps per millisecond=1529 ) properties seen :{}
Probabilistic random walk after 4589484 steps, saw 1529766 distinct states, run finished after 3002 ms. (steps per millisecond=1528 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-07 17:18:07] [INFO ] Invariant cache hit.
[2023-04-07 17:18:07] [INFO ] After 32ms 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 : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (G p0)]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 14 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CryptoMiner-PT-D05N250-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CryptoMiner-PT-D05N250-LTLCardinality-04 finished in 3812 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 2 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 17:18:07] [INFO ] Computed 1 invariants in 1 ms
[2023-04-07 17:18:07] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-04-07 17:18:07] [INFO ] Invariant cache hit.
[2023-04-07 17:18:07] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 17:18:07] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2023-04-07 17:18:07] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 17:18:07] [INFO ] Invariant cache hit.
[2023-04-07 17:18:07] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 79 ms. Remains : 18/18 places, 18/18 transitions.
Stuttering acceptance computed with spot in 114 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : CryptoMiner-PT-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 s6 s7 s8 s9 s10 s11))], 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 77 ms.
Product exploration explored 100000 steps with 0 reset in 243 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 193 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 237 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), false, false]
Incomplete random walk after 10060 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1437 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 3) seen :2
Running SMT prover for 1 properties.
[2023-04-07 17:18:08] [INFO ] Invariant cache hit.
[2023-04-07 17:18:08] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-04-07 17:18:08] [INFO ] After 28ms 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 332 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 201 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), false, false]
Stuttering acceptance computed with spot in 225 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), false, false]
[2023-04-07 17:18:09] [INFO ] Invariant cache hit.
Proved EG (NOT p1)
[2023-04-07 17:18:09] [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 342 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-PT-D05N250-LTLCardinality-06 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CryptoMiner-PT-D05N250-LTLCardinality-06 finished in 2288 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 1 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 17:18:09] [INFO ] Computed 0 invariants in 2 ms
[2023-04-07 17:18:09] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-04-07 17:18:09] [INFO ] Invariant cache hit.
[2023-04-07 17:18:09] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 17:18:09] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2023-04-07 17:18:09] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 17:18:09] [INFO ] Invariant cache hit.
[2023-04-07 17:18:09] [INFO ] Dead Transitions using invariants and state equation in 29 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 100 ms. Remains : 17/18 places, 18/18 transitions.
Stuttering acceptance computed with spot in 121 ms :[(OR (NOT p1) p0), p0, (NOT p1)]
Running random walk in product with property : CryptoMiner-PT-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 s11 s12 s13 s14 s15 s16) (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 85 ms.
Product exploration explored 100000 steps with 0 reset in 99 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 (NOT p0)), (X p1), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 86 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 123 ms :[(OR (NOT p1) p0), p0, (NOT p1)]
Incomplete random walk after 10054 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=2513 ) properties (out of 2) seen :0
Finished Best-First random walk after 1000 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=333 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X p1), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 121 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 125 ms :[(OR (NOT p1) p0), p0, (NOT p1)]
Stuttering acceptance computed with spot in 103 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 1 ms. Remains 17 /17 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-04-07 17:18:10] [INFO ] Invariant cache hit.
[2023-04-07 17:18:10] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-04-07 17:18:10] [INFO ] Invariant cache hit.
[2023-04-07 17:18:10] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 17:18:10] [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.
[2023-04-07 17:18:10] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 17:18:10] [INFO ] Invariant cache hit.
[2023-04-07 17:18:10] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 85 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 (NOT p0)), (X p1), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 86 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 113 ms :[(OR (NOT p1) p0), p0, (NOT p1)]
Incomplete random walk after 10060 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1117 ) properties (out of 2) seen :0
Finished Best-First random walk after 1000 steps, including 0 resets, run visited all 2 properties in 7 ms. (steps per millisecond=142 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X p1), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 112 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 95 ms :[(OR (NOT p1) p0), p0, (NOT p1)]
Stuttering acceptance computed with spot in 112 ms :[(OR (NOT p1) p0), p0, (NOT p1)]
Stuttering acceptance computed with spot in 128 ms :[(OR (NOT p1) p0), p0, (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 163 ms.
Product exploration explored 100000 steps with 0 reset in 95 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 17:18:11] [INFO ] Invariant cache hit.
[2023-04-07 17:18:11] [INFO ] Implicit Places using invariants in 34 ms returned []
[2023-04-07 17:18:11] [INFO ] Invariant cache hit.
[2023-04-07 17:18:11] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 17:18:11] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
[2023-04-07 17:18:11] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 17:18:11] [INFO ] Invariant cache hit.
[2023-04-07 17:18:11] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 128 ms. Remains : 17/17 places, 18/18 transitions.
Treatment of property CryptoMiner-PT-D05N250-LTLCardinality-07 finished in 2223 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&G(F(p1)))))'
Support contains 3 out of 18 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 18/18 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 17 transition count 18
Applied a total of 1 rules in 2 ms. Remains 17 /18 variables (removed 1) and now considering 18/18 (removed 0) transitions.
[2023-04-07 17:18:12] [INFO ] Invariant cache hit.
[2023-04-07 17:18:12] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-04-07 17:18:12] [INFO ] Invariant cache hit.
[2023-04-07 17:18:12] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 17:18:12] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
[2023-04-07 17:18:12] [INFO ] Invariant cache hit.
[2023-04-07 17:18:12] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 17/18 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 88 ms. Remains : 17/18 places, 18/18 transitions.
Stuttering acceptance computed with spot in 167 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1), (NOT p1)]
Running random walk in product with property : CryptoMiner-PT-D05N250-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(GT 2 s4), p1:(LEQ s3 s7)], 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 2872 reset in 110 ms.
Stack based approach found an accepted trace after 199 steps with 9 reset with depth 31 and stack size 31 in 1 ms.
FORMULA CryptoMiner-PT-D05N250-LTLCardinality-09 FALSE TECHNIQUES STACK_TEST
Treatment of property CryptoMiner-PT-D05N250-LTLCardinality-09 finished in 381 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||F(G(!p0)))))'
Support contains 2 out of 18 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 18/18 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 17 transition count 18
Applied a total of 1 rules in 0 ms. Remains 17 /18 variables (removed 1) and now considering 18/18 (removed 0) transitions.
[2023-04-07 17:18:12] [INFO ] Invariant cache hit.
[2023-04-07 17:18:12] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-04-07 17:18:12] [INFO ] Invariant cache hit.
[2023-04-07 17:18:12] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 17:18:12] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
[2023-04-07 17:18:12] [INFO ] Invariant cache hit.
[2023-04-07 17:18:12] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 17/18 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 114 ms. Remains : 17/18 places, 18/18 transitions.
Stuttering acceptance computed with spot in 95 ms :[false, p0, false]
Running random walk in product with property : CryptoMiner-PT-D05N250-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p0:(LEQ s15 s3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 61 ms.
Product exploration explored 100000 steps with 50000 reset in 77 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 : [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 26 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CryptoMiner-PT-D05N250-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CryptoMiner-PT-D05N250-LTLCardinality-10 finished in 395 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0||X(G((p1||X(p2))))) U p1)))'
Support contains 5 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 17:18:12] [INFO ] Computed 1 invariants in 3 ms
[2023-04-07 17:18:12] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-04-07 17:18:12] [INFO ] Invariant cache hit.
[2023-04-07 17:18:12] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 17:18:12] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2023-04-07 17:18:12] [INFO ] Invariant cache hit.
[2023-04-07 17:18:12] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 79 ms. Remains : 18/18 places, 18/18 transitions.
Stuttering acceptance computed with spot in 174 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p2), true]
Running random walk in product with property : CryptoMiner-PT-D05N250-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(NOT p2), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(GT s12 s3), p0:(GT s6 s4), p2:(LEQ 1 s0)], 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 30189 reset in 57 ms.
Stack based approach found an accepted trace after 2222 steps with 652 reset with depth 7 and stack size 7 in 2 ms.
FORMULA CryptoMiner-PT-D05N250-LTLCardinality-11 FALSE TECHNIQUES STACK_TEST
Treatment of property CryptoMiner-PT-D05N250-LTLCardinality-11 finished in 344 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||X(p1)))&&F(p2))))'
Support contains 5 out of 18 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 18/18 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 17 transition count 18
Applied a total of 1 rules in 1 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 17:18:13] [INFO ] Computed 0 invariants in 1 ms
[2023-04-07 17:18:13] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-04-07 17:18:13] [INFO ] Invariant cache hit.
[2023-04-07 17:18:13] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 17:18:13] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
[2023-04-07 17:18:13] [INFO ] Invariant cache hit.
[2023-04-07 17:18:13] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 17/18 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 92 ms. Remains : 17/18 places, 18/18 transitions.
Stuttering acceptance computed with spot in 331 ms :[(OR (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (NOT p1), true, (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : CryptoMiner-PT-D05N250-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 p2 p1), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p0) p2 p1), acceptance={0} source=0 dest: 2}, { cond=(NOT p1), acceptance={0} source=0 dest: 3}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=0 dest: 5}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 p1), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=5 dest: 0}, { cond=(AND p0 p2), acceptance={0} source=5 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={0} source=5 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={0} source=5 dest: 5}]], initial=4, aps=[p0:(GT s8 s1), p2:(LEQ s3 s12), p1:(GT 3 s5)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 94 steps with 0 reset in 0 ms.
FORMULA CryptoMiner-PT-D05N250-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-PT-D05N250-LTLCardinality-12 finished in 448 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&X(G(p1)))))'
Support contains 3 out of 18 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 18/18 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 17 transition count 18
Applied a total of 1 rules in 1 ms. Remains 17 /18 variables (removed 1) and now considering 18/18 (removed 0) transitions.
[2023-04-07 17:18:13] [INFO ] Invariant cache hit.
[2023-04-07 17:18:13] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-04-07 17:18:13] [INFO ] Invariant cache hit.
[2023-04-07 17:18:13] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 17:18:13] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2023-04-07 17:18:13] [INFO ] Invariant cache hit.
[2023-04-07 17:18:13] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 17/18 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 90 ms. Remains : 17/18 places, 18/18 transitions.
Stuttering acceptance computed with spot in 131 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : CryptoMiner-PT-D05N250-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(LEQ s11 s8), p1:(LEQ s13 s8)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CryptoMiner-PT-D05N250-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-PT-D05N250-LTLCardinality-14 finished in 234 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&&X(p1))||G(p1)))))'
Support contains 6 out of 18 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 18/18 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 17 transition count 18
Applied a total of 1 rules in 1 ms. Remains 17 /18 variables (removed 1) and now considering 18/18 (removed 0) transitions.
[2023-04-07 17:18:13] [INFO ] Invariant cache hit.
[2023-04-07 17:18:13] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-04-07 17:18:13] [INFO ] Invariant cache hit.
[2023-04-07 17:18:13] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 17:18:13] [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.
[2023-04-07 17:18:13] [INFO ] Invariant cache hit.
[2023-04-07 17:18:13] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 17/18 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 101 ms. Remains : 17/18 places, 18/18 transitions.
Stuttering acceptance computed with spot in 111 ms :[(NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : CryptoMiner-PT-D05N250-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LEQ s10 s16) (LEQ s6 s13)), p1:(GT s0 s8)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 3 reset in 70 ms.
Product exploration explored 100000 steps with 4 reset in 86 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.2 ms
Computed a total of 10 stabilizing places and 11 stable transitions
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 88 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter sensitive) to 3 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 129 ms :[(NOT p1), (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-04-07 17:18:14] [INFO ] Invariant cache hit.
[2023-04-07 17:18:14] [INFO ] After 54ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-04-07 17:18:14] [INFO ] After 10ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-04-07 17:18:14] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 17:18:14] [INFO ] After 5ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-04-07 17:18:14] [INFO ] After 13ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 19 ms.
[2023-04-07 17:18:14] [INFO ] After 88ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 60 ms.
Support contains 6 out of 17 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 17/17 places, 18/18 transitions.
Free-agglomeration rule applied 4 times.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 17 transition count 14
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 8 place count 13 transition count 14
Applied a total of 8 rules in 2 ms. Remains 13 /17 variables (removed 4) and now considering 14/18 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 13/17 places, 14/18 transitions.
Incomplete random walk after 10060 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=5030 ) properties (out of 2) seen :0
Finished Best-First random walk after 1302 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=651 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(F (NOT (AND p0 p1))), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1)), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 9 factoid took 335 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter sensitive) to 3 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 152 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 132 ms :[(NOT p1), (NOT p1), (NOT p1)]
Support contains 6 out of 17 places. Attempting structural reductions.
Starting structural reductions in 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 17:18:15] [INFO ] Invariant cache hit.
[2023-04-07 17:18:15] [INFO ] Implicit Places using invariants in 38 ms returned []
[2023-04-07 17:18:15] [INFO ] Invariant cache hit.
[2023-04-07 17:18:15] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 17:18:15] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
[2023-04-07 17:18:15] [INFO ] Invariant cache hit.
[2023-04-07 17:18:15] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 119 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.0 ms
Computed a total of 10 stabilizing places and 11 stable transitions
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 121 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter sensitive) to 3 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[(NOT p1), (NOT p1), (NOT p1)]
Incomplete random walk after 10060 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2012 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-04-07 17:18:15] [INFO ] Invariant cache hit.
[2023-04-07 17:18:15] [INFO ] After 21ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-04-07 17:18:16] [INFO ] After 9ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-04-07 17:18:16] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 17:18:16] [INFO ] After 5ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-04-07 17:18:16] [INFO ] After 11ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-04-07 17:18:16] [INFO ] After 59ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 26 ms.
Support contains 6 out of 17 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 17/17 places, 18/18 transitions.
Free-agglomeration rule applied 4 times.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 17 transition count 14
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 8 place count 13 transition count 14
Applied a total of 8 rules in 2 ms. Remains 13 /17 variables (removed 4) and now considering 14/18 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 13/17 places, 14/18 transitions.
Incomplete random walk after 10067 steps, including 3 resets, run finished after 15 ms. (steps per millisecond=671 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 2) seen :0
Finished probabilistic random walk after 25599 steps, run visited all 2 properties in 178 ms. (steps per millisecond=143 )
Probabilistic random walk after 25599 steps, saw 9450 distinct states, run finished after 179 ms. (steps per millisecond=143 ) properties seen :2
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(F (NOT (AND p0 p1))), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1)), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 9 factoid took 208 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter sensitive) to 3 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 104 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 106 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 124 ms :[(NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 3 reset in 78 ms.
Product exploration explored 100000 steps with 3 reset in 89 ms.
Support contains 6 out of 17 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 17/17 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 17 /17 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-04-07 17:18:17] [INFO ] Invariant cache hit.
[2023-04-07 17:18:17] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-04-07 17:18:17] [INFO ] Invariant cache hit.
[2023-04-07 17:18:17] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 17:18:17] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2023-04-07 17:18:17] [INFO ] Invariant cache hit.
[2023-04-07 17:18:17] [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 : 17/17 places, 18/18 transitions.
Treatment of property CryptoMiner-PT-D05N250-LTLCardinality-15 finished in 3487 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))))'
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&&X(p1))||G(p1)))))'
Found a Shortening insensitive property : CryptoMiner-PT-D05N250-LTLCardinality-15
Stuttering acceptance computed with spot in 106 ms :[(NOT p1), (NOT p1), (NOT p1)]
Support contains 6 out of 18 places. Attempting structural reductions.
Starting structural reductions in LI_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 2 ms. Remains 17 /18 variables (removed 1) and now considering 18/18 (removed 0) transitions.
[2023-04-07 17:18:17] [INFO ] Invariant cache hit.
[2023-04-07 17:18:17] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-04-07 17:18:17] [INFO ] Invariant cache hit.
[2023-04-07 17:18:17] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 17:18:17] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2023-04-07 17:18:17] [INFO ] Invariant cache hit.
[2023-04-07 17:18:17] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 17/18 places, 18/18 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 77 ms. Remains : 17/18 places, 18/18 transitions.
Running random walk in product with property : CryptoMiner-PT-D05N250-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LEQ s10 s16) (LEQ s6 s13)), p1:(GT s0 s8)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 4 reset in 74 ms.
Product exploration explored 100000 steps with 1 reset in 124 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 p0 p1), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 99 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter sensitive) to 3 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 102 ms :[(NOT p1), (NOT p1), (NOT p1)]
Incomplete random walk after 10065 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=2516 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-04-07 17:18:18] [INFO ] Invariant cache hit.
[2023-04-07 17:18:18] [INFO ] After 16ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 17:18:18] [INFO ] After 6ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 17:18:18] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 17:18:18] [INFO ] After 2ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 17:18:18] [INFO ] After 5ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-04-07 17:18:18] [INFO ] After 35ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 6 out of 17 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 17/17 places, 18/18 transitions.
Free-agglomeration rule applied 4 times.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 17 transition count 14
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 8 place count 13 transition count 14
Applied a total of 8 rules in 3 ms. Remains 13 /17 variables (removed 4) and now considering 14/18 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 13/17 places, 14/18 transitions.
Incomplete random walk after 10074 steps, including 4 resets, run finished after 3 ms. (steps per millisecond=3358 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=2500 ) properties (out of 1) seen :0
Finished probabilistic random walk after 24624 steps, run visited all 1 properties in 21 ms. (steps per millisecond=1172 )
Probabilistic random walk after 24624 steps, saw 8962 distinct states, run finished after 22 ms. (steps per millisecond=1119 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(F (NOT (AND p0 p1))), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1)), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 9 factoid took 298 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter sensitive) to 3 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 95 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 93 ms :[(NOT p1), (NOT p1), (NOT p1)]
Support contains 6 out of 17 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 17/17 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 17 /17 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-04-07 17:18:18] [INFO ] Invariant cache hit.
[2023-04-07 17:18:18] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-04-07 17:18:18] [INFO ] Invariant cache hit.
[2023-04-07 17:18:18] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 17:18:18] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2023-04-07 17:18:18] [INFO ] Invariant cache hit.
[2023-04-07 17:18:18] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 73 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 p0 p1), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 89 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter sensitive) to 3 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 87 ms :[(NOT p1), (NOT p1), (NOT p1)]
Incomplete random walk after 10060 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=5030 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) 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 :0
Running SMT prover for 2 properties.
[2023-04-07 17:18:18] [INFO ] Invariant cache hit.
[2023-04-07 17:18:19] [INFO ] After 23ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-04-07 17:18:19] [INFO ] After 9ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-04-07 17:18:19] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 17:18:19] [INFO ] After 4ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-04-07 17:18:19] [INFO ] After 10ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-04-07 17:18:19] [INFO ] After 60ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 38 ms.
Support contains 6 out of 17 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 17/17 places, 18/18 transitions.
Free-agglomeration rule applied 4 times.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 17 transition count 14
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 8 place count 13 transition count 14
Applied a total of 8 rules in 2 ms. Remains 13 /17 variables (removed 4) and now considering 14/18 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 13/17 places, 14/18 transitions.
Incomplete random walk after 10060 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=3353 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=2500 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 14 rows 13 cols
[2023-04-07 17:18:19] [INFO ] Computed 0 invariants in 0 ms
[2023-04-07 17:18:19] [INFO ] After 27ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 17:18:19] [INFO ] After 7ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 17:18:19] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 17:18:19] [INFO ] After 3ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 17:18:19] [INFO ] After 5ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-04-07 17:18:19] [INFO ] After 48ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 6 out of 13 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 13/13 places, 14/14 transitions.
Applied a total of 0 rules in 1 ms. Remains 13 /13 variables (removed 0) and now considering 14/14 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 13/13 places, 14/14 transitions.
Incomplete random walk after 10062 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=5031 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=2500 ) properties (out of 1) seen :0
Finished probabilistic random walk after 24624 steps, run visited all 1 properties in 19 ms. (steps per millisecond=1296 )
Probabilistic random walk after 24624 steps, saw 8962 distinct states, run finished after 19 ms. (steps per millisecond=1296 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(F (NOT (AND p0 p1))), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1)), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 9 factoid took 184 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter sensitive) to 3 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 89 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 104 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 113 ms :[(NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 4 reset in 80 ms.
Product exploration explored 100000 steps with 5 reset in 87 ms.
Support contains 6 out of 17 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 17/17 places, 18/18 transitions.
Applied a total of 0 rules in 2 ms. Remains 17 /17 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 17 cols
[2023-04-07 17:18:19] [INFO ] Computed 0 invariants in 0 ms
[2023-04-07 17:18:20] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-04-07 17:18:20] [INFO ] Invariant cache hit.
[2023-04-07 17:18:20] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 17:18:20] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2023-04-07 17:18:20] [INFO ] Invariant cache hit.
[2023-04-07 17:18:20] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 83 ms. Remains : 17/17 places, 18/18 transitions.
Treatment of property CryptoMiner-PT-D05N250-LTLCardinality-15 finished in 2670 ms.
[2023-04-07 17:18:20] [INFO ] Flatten gal took : 2 ms
[2023-04-07 17:18:20] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-04-07 17:18:20] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 18 places, 18 transitions and 52 arcs took 0 ms.
Total runtime 23615 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1523/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1523/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : CryptoMiner-PT-D05N250-LTLCardinality-07
Could not compute solution for formula : CryptoMiner-PT-D05N250-LTLCardinality-15

BK_STOP 1680887901279

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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-PT-D05N250-LTLCardinality-07
ltl formula formula --ltl=/tmp/1523/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.010 real 0.000 user 0.010 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1523/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1523/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1523/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1523/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
ltl formula name CryptoMiner-PT-D05N250-LTLCardinality-15
ltl formula formula --ltl=/tmp/1523/ltl_1_
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
pnml2lts-mc( 0/ 4): Petri net has 18 places, 18 transitions and 52 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1523/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1523/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1523/ltl_1_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1523/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
0: pnml2lts-mc(+0xa23f4) [0x55ffec2773f4]
1: pnml2lts-mc(+0xa2496) [0x55ffec277496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7f3919971140]
3: pnml2lts-mc(+0x405b30) [0x55ffec5dab30]
4: pnml2lts-mc(+0x16b3f9) [0x55ffec3403f9]
5: pnml2lts-mc(+0x164ac4) [0x55ffec339ac4]
6: pnml2lts-mc(+0x272e0a) [0x55ffec447e0a]
7: pnml2lts-mc(+0xb61f0) [0x55ffec28b1f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7f39197c44d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7f39197c467a]
10: pnml2lts-mc(+0xa1581) [0x55ffec276581]
11: pnml2lts-mc(+0xa1910) [0x55ffec276910]
12: pnml2lts-mc(+0xa32a2) [0x55ffec2782a2]
13: pnml2lts-mc(+0xa50f4) [0x55ffec27a0f4]
14: pnml2lts-mc(+0xa516b) [0x55ffec27a16b]
15: pnml2lts-mc(+0x3f34b3) [0x55ffec5c84b3]
16: pnml2lts-mc(+0x7c63d) [0x55ffec25163d]
17: pnml2lts-mc(+0x67d86) [0x55ffec23cd86]
18: pnml2lts-mc(+0x60a8a) [0x55ffec235a8a]
19: pnml2lts-mc(+0x5eb15) [0x55ffec233b15]
20: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7f39197acd0a]
21: pnml2lts-mc(+0x6075e) [0x55ffec23575e]

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CryptoMiner-PT-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-PT-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-167987246300187"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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