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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 472K
-rw-r--r-- 1 mcc users 12K Mar 23 15:24 CTLCardinality.txt
-rw-r--r-- 1 mcc users 98K Mar 23 15:24 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Mar 23 15:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Mar 23 15:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.2K Mar 23 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 32K Mar 23 07:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Mar 23 07:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 23 07:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 12K Mar 23 15:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 81K Mar 23 15:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Mar 23 15:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K Mar 23 15:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K Mar 23 07:06 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.6K 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 5.3K 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-D03N100-LTLCardinality-00
FORMULA_NAME CryptoMiner-PT-D03N100-LTLCardinality-01
FORMULA_NAME CryptoMiner-PT-D03N100-LTLCardinality-02
FORMULA_NAME CryptoMiner-PT-D03N100-LTLCardinality-03
FORMULA_NAME CryptoMiner-PT-D03N100-LTLCardinality-04
FORMULA_NAME CryptoMiner-PT-D03N100-LTLCardinality-05
FORMULA_NAME CryptoMiner-PT-D03N100-LTLCardinality-06
FORMULA_NAME CryptoMiner-PT-D03N100-LTLCardinality-07
FORMULA_NAME CryptoMiner-PT-D03N100-LTLCardinality-08
FORMULA_NAME CryptoMiner-PT-D03N100-LTLCardinality-09
FORMULA_NAME CryptoMiner-PT-D03N100-LTLCardinality-10
FORMULA_NAME CryptoMiner-PT-D03N100-LTLCardinality-11
FORMULA_NAME CryptoMiner-PT-D03N100-LTLCardinality-12
FORMULA_NAME CryptoMiner-PT-D03N100-LTLCardinality-13
FORMULA_NAME CryptoMiner-PT-D03N100-LTLCardinality-14
FORMULA_NAME CryptoMiner-PT-D03N100-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1680884412902

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-D03N100
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202304061127
[2023-04-07 16:20:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-04-07 16:20:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 16:20:15] [INFO ] Load time of PNML (sax parser for PT used): 19 ms
[2023-04-07 16:20:15] [INFO ] Transformed 12 places.
[2023-04-07 16:20:15] [INFO ] Transformed 12 transitions.
[2023-04-07 16:20:15] [INFO ] Parsed PT model containing 12 places and 12 transitions and 34 arcs in 124 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-D03N100-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CryptoMiner-PT-D03N100-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 12 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Applied a total of 0 rules in 10 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
// Phase 1: matrix 12 rows 12 cols
[2023-04-07 16:20:15] [INFO ] Computed 1 invariants in 3 ms
[2023-04-07 16:20:15] [INFO ] Implicit Places using invariants in 123 ms returned []
[2023-04-07 16:20:15] [INFO ] Invariant cache hit.
[2023-04-07 16:20:15] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 16:20:15] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 181 ms to find 0 implicit places.
[2023-04-07 16:20:15] [INFO ] Invariant cache hit.
[2023-04-07 16:20:15] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 246 ms. Remains : 12/12 places, 12/12 transitions.
Support contains 12 out of 12 places after structural reductions.
[2023-04-07 16:20:15] [INFO ] Flatten gal took : 12 ms
[2023-04-07 16:20:15] [INFO ] Flatten gal took : 23 ms
[2023-04-07 16:20:15] [INFO ] Input system was already deterministic with 12 transitions.
Incomplete random walk after 10018 steps, including 3 resets, run finished after 82 ms. (steps per millisecond=122 ) properties (out of 25) seen :19
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 6) seen :2
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-04-07 16:20:16] [INFO ] Invariant cache hit.
[2023-04-07 16:20:16] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-04-07 16:20:16] [INFO ] After 161ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-04-07 16:20:16] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-04-07 16:20:16] [INFO ] After 14ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :1
[2023-04-07 16:20:16] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 16:20:16] [INFO ] After 19ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :3 sat :1
[2023-04-07 16:20:16] [INFO ] After 41ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-04-07 16:20:16] [INFO ] After 142ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :1
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 12 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 12/12 places, 12/12 transitions.
Graph (trivial) has 7 edges and 12 vertex of which 4 / 12 are part of one of the 1 SCC in 2 ms
Free SCC test removed 3 places
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 14 edges and 9 vertex of which 8 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 7 ms. Remains 8 /12 variables (removed 4) and now considering 7/12 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 8/12 places, 7/12 transitions.
Incomplete random walk after 10000 steps, including 227 resets, run finished after 4 ms. (steps per millisecond=2500 ) properties (out of 1) seen :0
Finished Best-First random walk after 72 steps, including 5 resets, run visited all 1 properties in 2 ms. (steps per millisecond=36 )
Parikh walk visited 0 properties in 0 ms.
FORMULA CryptoMiner-PT-D03N100-LTLCardinality-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 3 atomic propositions for a total of 13 simplifications.
FORMULA CryptoMiner-PT-D03N100-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 29 edges and 12 vertex of which 5 are kept as prefixes of interest. Removing 7 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(F(p0))))'
Support contains 4 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 11 transition count 12
Applied a total of 1 rules in 0 ms. Remains 11 /12 variables (removed 1) and now considering 12/12 (removed 0) transitions.
// Phase 1: matrix 12 rows 11 cols
[2023-04-07 16:20:17] [INFO ] Computed 0 invariants in 0 ms
[2023-04-07 16:20:17] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-04-07 16:20:17] [INFO ] Invariant cache hit.
[2023-04-07 16:20:17] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 16:20:17] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
[2023-04-07 16:20:17] [INFO ] Invariant cache hit.
[2023-04-07 16:20:17] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 11/12 places, 12/12 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 101 ms. Remains : 11/12 places, 12/12 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 186 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CryptoMiner-PT-D03N100-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(GT 1 (ADD s7 s8 s9 s10))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 6808 reset in 349 ms.
Stack based approach found an accepted trace after 8 steps with 0 reset with depth 9 and stack size 9 in 10 ms.
FORMULA CryptoMiner-PT-D03N100-LTLCardinality-01 FALSE TECHNIQUES STACK_TEST
Treatment of property CryptoMiner-PT-D03N100-LTLCardinality-01 finished in 691 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 12 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
// Phase 1: matrix 12 rows 12 cols
[2023-04-07 16:20:17] [INFO ] Computed 1 invariants in 1 ms
[2023-04-07 16:20:17] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-04-07 16:20:17] [INFO ] Invariant cache hit.
[2023-04-07 16:20:17] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 16:20:17] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
[2023-04-07 16:20:17] [INFO ] Invariant cache hit.
[2023-04-07 16:20:17] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 101 ms. Remains : 12/12 places, 12/12 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CryptoMiner-PT-D03N100-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LEQ (ADD s4 s5 s6 s7) (ADD s0 s1 s2 s3)) (LEQ 3 (ADD s8 s9 s10 s11)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 128 ms.
Product exploration explored 100000 steps with 50000 reset in 140 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 29 edges and 12 vertex of which 5 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.0 ms
Computed a total of 7 stabilizing places and 7 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 45 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CryptoMiner-PT-D03N100-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CryptoMiner-PT-D03N100-LTLCardinality-03 finished in 516 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(p1)&&p0) U (!p2 U (G(!p2)||(!p2&&(p3||G(!p1)))))))'
Support contains 8 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-04-07 16:20:18] [INFO ] Invariant cache hit.
[2023-04-07 16:20:18] [INFO ] Implicit Places using invariants in 60 ms returned []
[2023-04-07 16:20:18] [INFO ] Invariant cache hit.
[2023-04-07 16:20:18] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 16:20:18] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
[2023-04-07 16:20:18] [INFO ] Invariant cache hit.
[2023-04-07 16:20:18] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 163 ms. Remains : 12/12 places, 12/12 transitions.
Stuttering acceptance computed with spot in 404 ms :[p2, true, (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1))), p2, (AND p1 p2), false, (AND p1 p2), (AND p0 (NOT p1) p2), p1, false]
Running random walk in product with property : CryptoMiner-PT-D03N100-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p3) p1 (NOT p2) p0), acceptance={0} source=0 dest: 0}, { cond=(AND p2 p0), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p2 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p2 p0), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p3) p1 (NOT p2) (NOT p0)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p3) (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=0 dest: 4}, { cond=(AND (NOT p3) (NOT p1) (NOT p2) p0), acceptance={} source=0 dest: 5}, { cond=(AND (NOT p3) (NOT p1) (NOT p2) p0), acceptance={} source=0 dest: 6}, { cond=(AND (NOT p3) p1 (NOT p2) p0), acceptance={} source=0 dest: 7}], [{ cond=true, acceptance={0, 1} source=1 dest: 1}], [{ cond=(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) p0)), acceptance={} source=2 dest: 1}], [{ cond=p2, acceptance={} source=3 dest: 1}, { cond=(AND (NOT p3) p1 (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p3) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(AND p1 p2), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p3) p1 (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p3) (NOT p1) (NOT p2)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) p2), acceptance={} source=4 dest: 8}], [{ cond=(AND (NOT p3) (NOT p1) (NOT p2) p0), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p1) p2 p0), acceptance={} source=5 dest: 8}], [{ cond=(AND (NOT p3) p1 (NOT p2) p0), acceptance={0} source=6 dest: 0}, { cond=(AND p1 p2 p0), acceptance={0, 1} source=6 dest: 0}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=6 dest: 1}, { cond=(AND p1 p2 p0), acceptance={} source=6 dest: 2}, { cond=(AND (NOT p3) p1 (NOT p2) (NOT p0)), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p3) (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p3) (NOT p1) (NOT p2) p0), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p3) (NOT p1) (NOT p2) p0), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p1) p2 p0), acceptance={1} source=6 dest: 6}, { cond=(AND (NOT p3) p1 (NOT p2) p0), acceptance={} source=6 dest: 7}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=6 dest: 8}, { cond=(AND (NOT p1) p2 p0), acceptance={} source=6 dest: 9}], [{ cond=(AND (NOT p1) p2 p0), acceptance={} source=7 dest: 1}, { cond=(AND (NOT p3) (NOT p1) (NOT p2) p0), acceptance={} source=7 dest: 4}], [{ cond=p1, acceptance={} source=8 dest: 1}, { cond=(NOT p1), acceptance={} source=8 dest: 8}], [{ cond=(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) p0)), acceptance={} source=9 dest: 8}]], initial=0, aps=[p3:(GT (ADD s0 s1 s2 s3) (ADD s4 s5 s6 s7)), p1:(LEQ 2 (ADD s0 s1 s2 s3)), p2:(LEQ (ADD s4 s5 s6 s7) (ADD s0 s1 s2 s3)), p0:(AND (LEQ (ADD s4 s5 s6 s7) (A...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33309 reset in 339 ms.
Stack based approach found an accepted trace after 549 steps with 175 reset with depth 6 and stack size 6 in 1 ms.
FORMULA CryptoMiner-PT-D03N100-LTLCardinality-04 FALSE TECHNIQUES STACK_TEST
Treatment of property CryptoMiner-PT-D03N100-LTLCardinality-04 finished in 941 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 8 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Applied a total of 0 rules in 2 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-04-07 16:20:19] [INFO ] Invariant cache hit.
[2023-04-07 16:20:19] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-04-07 16:20:19] [INFO ] Invariant cache hit.
[2023-04-07 16:20:19] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 16:20:19] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
[2023-04-07 16:20:19] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 16:20:19] [INFO ] Invariant cache hit.
[2023-04-07 16:20:19] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 95 ms. Remains : 12/12 places, 12/12 transitions.
Stuttering acceptance computed with spot in 136 ms :[(OR (NOT p1) p0), p0, (NOT p1)]
Running random walk in product with property : CryptoMiner-PT-D03N100-LTLCardinality-05 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:(LEQ (ADD s4 s5 s6 s7) (ADD s0 s1 s2 s3)), p1:(OR (LEQ (ADD s4 s5 s6 s7) (ADD s0 s1 s2 s3)) (AND (LEQ (ADD s4 s5 s6 s7) (ADD s0 s1 s2 s3)) (GT (ADD s0 ...], 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 72 ms.
Stack based approach found an accepted trace after 32 steps with 0 reset with depth 33 and stack size 33 in 0 ms.
FORMULA CryptoMiner-PT-D03N100-LTLCardinality-05 FALSE TECHNIQUES STACK_TEST
Treatment of property CryptoMiner-PT-D03N100-LTLCardinality-05 finished in 339 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 8 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Graph (complete) has 29 edges and 12 vertex of which 11 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 11 /12 variables (removed 1) and now considering 12/12 (removed 0) transitions.
// Phase 1: matrix 12 rows 11 cols
[2023-04-07 16:20:19] [INFO ] Computed 0 invariants in 0 ms
[2023-04-07 16:20:19] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-04-07 16:20:19] [INFO ] Invariant cache hit.
[2023-04-07 16:20:19] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 16:20:19] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
[2023-04-07 16:20:19] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 16:20:19] [INFO ] Invariant cache hit.
[2023-04-07 16:20:19] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/12 places, 12/12 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 120 ms. Remains : 11/12 places, 12/12 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : CryptoMiner-PT-D03N100-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT (ADD s0 s1 s2 s3) (ADD s7 s8 s9 s10))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 79 ms.
Product exploration explored 100000 steps with 0 reset in 147 ms.
Computed a total of 6 stabilizing places and 7 stable transitions
Graph (complete) has 26 edges and 11 vertex of which 5 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Computed a total of 6 stabilizing places and 7 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 70 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Incomplete random walk after 10015 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=2503 ) properties (out of 1) seen :0
Finished Best-First random walk after 396 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=198 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 153 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Support contains 8 out of 11 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 11/11 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-04-07 16:20:20] [INFO ] Invariant cache hit.
[2023-04-07 16:20:20] [INFO ] Implicit Places using invariants in 142 ms returned []
[2023-04-07 16:20:20] [INFO ] Invariant cache hit.
[2023-04-07 16:20:20] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 16:20:20] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 224 ms to find 0 implicit places.
[2023-04-07 16:20:20] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 16:20:20] [INFO ] Invariant cache hit.
[2023-04-07 16:20:20] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 251 ms. Remains : 11/11 places, 12/12 transitions.
Computed a total of 6 stabilizing places and 7 stable transitions
Graph (complete) has 26 edges and 11 vertex of which 5 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Computed a total of 6 stabilizing places and 7 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 87 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Finished random walk after 3439 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=1719 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 93 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 86 ms.
Product exploration explored 100000 steps with 0 reset in 94 ms.
Support contains 8 out of 11 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 11/11 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-04-07 16:20:21] [INFO ] Invariant cache hit.
[2023-04-07 16:20:21] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-04-07 16:20:21] [INFO ] Invariant cache hit.
[2023-04-07 16:20:21] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 16:20:21] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2023-04-07 16:20:21] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 16:20:21] [INFO ] Invariant cache hit.
[2023-04-07 16:20:21] [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 103 ms. Remains : 11/11 places, 12/12 transitions.
Treatment of property CryptoMiner-PT-D03N100-LTLCardinality-06 finished in 1634 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0) U G((!p1&&X(!p0))))))'
Support contains 8 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
// Phase 1: matrix 12 rows 12 cols
[2023-04-07 16:20:21] [INFO ] Computed 1 invariants in 0 ms
[2023-04-07 16:20:21] [INFO ] Implicit Places using invariants in 14 ms returned []
[2023-04-07 16:20:21] [INFO ] Invariant cache hit.
[2023-04-07 16:20:21] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 16:20:21] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2023-04-07 16:20:21] [INFO ] Invariant cache hit.
[2023-04-07 16:20:21] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 100 ms. Remains : 12/12 places, 12/12 transitions.
Stuttering acceptance computed with spot in 123 ms :[(OR p0 p1), (OR p1 p0), (NOT p0), p0]
Running random walk in product with property : CryptoMiner-PT-D03N100-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=p1, acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={0} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 1}, { cond=(AND p1 p0), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(LEQ (ADD s4 s5 s6 s7) (ADD s0 s1 s2 s3)), p0:(LEQ 3 (ADD s0 s1 s2 s3))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 112 ms.
Stack based approach found an accepted trace after 9 steps with 0 reset with depth 10 and stack size 10 in 0 ms.
FORMULA CryptoMiner-PT-D03N100-LTLCardinality-07 FALSE TECHNIQUES STACK_TEST
Treatment of property CryptoMiner-PT-D03N100-LTLCardinality-07 finished in 352 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 1 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Graph (trivial) has 7 edges and 12 vertex of which 4 / 12 are part of one of the 1 SCC in 0 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (complete) has 26 edges and 9 vertex of which 8 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 3 ms. Remains 8 /12 variables (removed 4) and now considering 9/12 (removed 3) transitions.
// Phase 1: matrix 9 rows 8 cols
[2023-04-07 16:20:21] [INFO ] Computed 0 invariants in 1 ms
[2023-04-07 16:20:21] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-04-07 16:20:21] [INFO ] Invariant cache hit.
[2023-04-07 16:20:21] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 16:20:21] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2023-04-07 16:20:21] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 16:20:21] [INFO ] Invariant cache hit.
[2023-04-07 16:20:21] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/12 places, 9/12 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 89 ms. Remains : 8/12 places, 9/12 transitions.
Stuttering acceptance computed with spot in 55 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CryptoMiner-PT-D03N100-LTLCardinality-08 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 s1)], 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 84 ms.
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA CryptoMiner-PT-D03N100-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-PT-D03N100-LTLCardinality-08 finished in 262 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||G(p1)))||F(p1))))'
Support contains 3 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
// Phase 1: matrix 12 rows 12 cols
[2023-04-07 16:20:21] [INFO ] Computed 1 invariants in 2 ms
[2023-04-07 16:20:21] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-04-07 16:20:21] [INFO ] Invariant cache hit.
[2023-04-07 16:20:22] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 16:20:22] [INFO ] Implicit Places using invariants and state equation in 346 ms returned []
Implicit Place search using SMT with State Equation took 376 ms to find 0 implicit places.
[2023-04-07 16:20:22] [INFO ] Invariant cache hit.
[2023-04-07 16:20:22] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 417 ms. Remains : 12/12 places, 12/12 transitions.
Stuttering acceptance computed with spot in 96 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CryptoMiner-PT-D03N100-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(GT s9 s3), p0:(LEQ s4 s3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 46 reset in 74 ms.
Product exploration explored 100000 steps with 24 reset in 110 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 29 edges and 12 vertex of which 5 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.0 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT p1))), (X (X p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 210 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 163 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Incomplete random walk after 10014 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1669 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-04-07 16:20:22] [INFO ] Invariant cache hit.
[2023-04-07 16:20:23] [INFO ] After 163ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-04-07 16:20:23] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-04-07 16:20:23] [INFO ] After 8ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-04-07 16:20:23] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 16:20:23] [INFO ] After 3ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2023-04-07 16:20:23] [INFO ] After 7ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2023-04-07 16:20:23] [INFO ] After 142ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 155 steps, including 3 resets, run visited all 1 properties in 1 ms. (steps per millisecond=155 )
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 12 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 12/12 places, 12/12 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 12 transition count 11
Free-agglomeration rule applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 3 place count 12 transition count 9
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 10 transition count 9
Applied a total of 5 rules in 4 ms. Remains 10 /12 variables (removed 2) and now considering 9/12 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 10/12 places, 9/12 transitions.
Incomplete random walk after 10016 steps, including 3 resets, run finished after 3 ms. (steps per millisecond=3338 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 24 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 2298 steps, run visited all 1 properties in 22 ms. (steps per millisecond=104 )
Probabilistic random walk after 2298 steps, saw 1001 distinct states, run finished after 37 ms. (steps per millisecond=62 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT p1))), (X (X p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F p1), (F (AND p0 p1)), (F (AND (NOT p0) p1)), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 3 factoid took 406 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 229 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 164 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Support contains 3 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-04-07 16:20:24] [INFO ] Invariant cache hit.
[2023-04-07 16:20:24] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-04-07 16:20:24] [INFO ] Invariant cache hit.
[2023-04-07 16:20:24] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 16:20:24] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
[2023-04-07 16:20:24] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 16:20:24] [INFO ] Invariant cache hit.
[2023-04-07 16:20:24] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 106 ms. Remains : 12/12 places, 12/12 transitions.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 29 edges and 12 vertex of which 5 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.0 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (NOT p1)), (X p1), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT p1))), (X (X p1)), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 5 factoid took 330 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Incomplete random walk after 10013 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=5006 ) properties (out of 5) seen :3
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
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-04-07 16:20:24] [INFO ] Invariant cache hit.
[2023-04-07 16:20:24] [INFO ] After 62ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-04-07 16:20:24] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-04-07 16:20:24] [INFO ] After 13ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-04-07 16:20:24] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 16:20:24] [INFO ] After 5ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2023-04-07 16:20:24] [INFO ] After 7ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-04-07 16:20:24] [INFO ] After 58ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 15 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=15 )
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 12 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 12/12 places, 12/12 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 12 transition count 11
Free-agglomeration rule applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 3 place count 12 transition count 9
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 10 transition count 9
Applied a total of 5 rules in 2 ms. Remains 10 /12 variables (removed 2) and now considering 9/12 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 10/12 places, 9/12 transitions.
Incomplete random walk after 10014 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=5007 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 24 resets, run finished after 4 ms. (steps per millisecond=2500 ) properties (out of 1) seen :0
Finished probabilistic random walk after 2298 steps, run visited all 1 properties in 5 ms. (steps per millisecond=459 )
Probabilistic random walk after 2298 steps, saw 1001 distinct states, run finished after 6 ms. (steps per millisecond=383 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (NOT p1)), (X p1), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT p1))), (X (X p1)), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F p1), (F (AND p0 p1)), (F (AND (NOT p0) p1)), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 5 factoid took 625 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 146 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 161 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 149 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Product exploration explored 100000 steps with 8 reset in 61 ms.
Product exploration explored 100000 steps with 7 reset in 91 ms.
Support contains 3 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-04-07 16:20:26] [INFO ] Invariant cache hit.
[2023-04-07 16:20:26] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-04-07 16:20:26] [INFO ] Invariant cache hit.
[2023-04-07 16:20:26] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 16:20:26] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2023-04-07 16:20:26] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 16:20:26] [INFO ] Invariant cache hit.
[2023-04-07 16:20:26] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 96 ms. Remains : 12/12 places, 12/12 transitions.
Treatment of property CryptoMiner-PT-D03N100-LTLCardinality-09 finished in 4534 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(F(p1))))'
Support contains 5 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 11 transition count 12
Applied a total of 1 rules in 1 ms. Remains 11 /12 variables (removed 1) and now considering 12/12 (removed 0) transitions.
// Phase 1: matrix 12 rows 11 cols
[2023-04-07 16:20:26] [INFO ] Computed 0 invariants in 1 ms
[2023-04-07 16:20:26] [INFO ] Implicit Places using invariants in 15 ms returned []
[2023-04-07 16:20:26] [INFO ] Invariant cache hit.
[2023-04-07 16:20:26] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 16:20:26] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2023-04-07 16:20:26] [INFO ] Invariant cache hit.
[2023-04-07 16:20:26] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 11/12 places, 12/12 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 104 ms. Remains : 11/12 places, 12/12 transitions.
Stuttering acceptance computed with spot in 95 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CryptoMiner-PT-D03N100-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(LEQ 2 s6), p0:(OR (GT s5 s7) (GT s8 s2))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 48 ms.
Stack based approach found an accepted trace after 27 steps with 0 reset with depth 28 and stack size 28 in 0 ms.
FORMULA CryptoMiner-PT-D03N100-LTLCardinality-10 FALSE TECHNIQUES STACK_TEST
Treatment of property CryptoMiner-PT-D03N100-LTLCardinality-10 finished in 259 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0&&(p1 U p2)))))'
Support contains 6 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Graph (complete) has 29 edges and 12 vertex of which 11 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 11 /12 variables (removed 1) and now considering 12/12 (removed 0) transitions.
[2023-04-07 16:20:26] [INFO ] Invariant cache hit.
[2023-04-07 16:20:26] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-04-07 16:20:26] [INFO ] Invariant cache hit.
[2023-04-07 16:20:26] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 16:20:26] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2023-04-07 16:20:26] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 16:20:26] [INFO ] Invariant cache hit.
[2023-04-07 16:20:26] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/12 places, 12/12 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 81 ms. Remains : 11/12 places, 12/12 transitions.
Stuttering acceptance computed with spot in 69 ms :[(OR (NOT p0) (NOT p2)), (NOT p2)]
Running random walk in product with property : CryptoMiner-PT-D03N100-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(OR (AND p2 p0) (AND p0 p1)), acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p2) (NOT p1)) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) p0 p1), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p2:(LEQ s2 s10), p0:(LEQ s0 s5), p1:(LEQ s4 s7)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 80 ms.
Stack based approach found an accepted trace after 16 steps with 0 reset with depth 17 and stack size 17 in 0 ms.
FORMULA CryptoMiner-PT-D03N100-LTLCardinality-12 FALSE TECHNIQUES STACK_TEST
Treatment of property CryptoMiner-PT-D03N100-LTLCardinality-12 finished in 252 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 1 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Graph (trivial) has 7 edges and 12 vertex of which 4 / 12 are part of one of the 1 SCC in 0 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (complete) has 26 edges and 9 vertex of which 8 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 2 ms. Remains 8 /12 variables (removed 4) and now considering 9/12 (removed 3) transitions.
// Phase 1: matrix 9 rows 8 cols
[2023-04-07 16:20:26] [INFO ] Computed 0 invariants in 1 ms
[2023-04-07 16:20:26] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-04-07 16:20:26] [INFO ] Invariant cache hit.
[2023-04-07 16:20:26] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 16:20:26] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
[2023-04-07 16:20:26] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 16:20:26] [INFO ] Invariant cache hit.
[2023-04-07 16:20:26] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/12 places, 9/12 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 72 ms. Remains : 8/12 places, 9/12 transitions.
Stuttering acceptance computed with spot in 57 ms :[p0, p0]
Running random walk in product with property : CryptoMiner-PT-D03N100-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 1 s2)], 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 142 ms.
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA CryptoMiner-PT-D03N100-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-PT-D03N100-LTLCardinality-13 finished in 288 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Graph (trivial) has 5 edges and 12 vertex of which 4 / 12 are part of one of the 1 SCC in 0 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Applied a total of 1 rules in 1 ms. Remains 9 /12 variables (removed 3) and now considering 9/12 (removed 3) transitions.
// Phase 1: matrix 9 rows 9 cols
[2023-04-07 16:20:27] [INFO ] Computed 1 invariants in 0 ms
[2023-04-07 16:20:27] [INFO ] Implicit Places using invariants in 62 ms returned []
[2023-04-07 16:20:27] [INFO ] Invariant cache hit.
[2023-04-07 16:20:27] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 16:20:27] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
[2023-04-07 16:20:27] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 16:20:27] [INFO ] Invariant cache hit.
[2023-04-07 16:20:27] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/12 places, 9/12 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 185 ms. Remains : 9/12 places, 9/12 transitions.
Stuttering acceptance computed with spot in 60 ms :[(NOT p0)]
Running random walk in product with property : CryptoMiner-PT-D03N100-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT s7 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA CryptoMiner-PT-D03N100-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-PT-D03N100-LTLCardinality-15 finished in 279 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
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||G(p1)))||F(p1))))'
[2023-04-07 16:20:27] [INFO ] Flatten gal took : 5 ms
[2023-04-07 16:20:27] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2023-04-07 16:20:27] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 12 places, 12 transitions and 34 arcs took 1 ms.
Total runtime 12621 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1203/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1203/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : CryptoMiner-PT-D03N100-LTLCardinality-06
Could not compute solution for formula : CryptoMiner-PT-D03N100-LTLCardinality-09

BK_STOP 1680884428833

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2023
ltl formula name CryptoMiner-PT-D03N100-LTLCardinality-06
ltl formula formula --ltl=/tmp/1203/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 12 places, 12 transitions and 34 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1203/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1203/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1203/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1203/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
free(): double free detected in tcache 2
ltl formula name CryptoMiner-PT-D03N100-LTLCardinality-09
ltl formula formula --ltl=/tmp/1203/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
pnml2lts-mc( 0/ 4): Petri net has 12 places, 12 transitions and 34 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
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): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1203/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1203/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1203/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1203/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
free(): double free detected in tcache 2

Sequence of Actions to be Executed by the VM

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

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

tar xzf /home/mcc/BenchKit/INPUTS/CryptoMiner-PT-D03N100.tgz
mv CryptoMiner-PT-D03N100 execution
cd execution
if [ "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 ;