fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r517-tall-167987243500156
Last Updated
May 14, 2023

About the Execution of ITS-Tools for CryptoMiner-PT-D03N010

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
370.840 7448.00 13139.00 281.50 TFFFTTTFFFFTTFFF normal

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.r517-tall-167987243500156.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 itstools
Input is CryptoMiner-PT-D03N010, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r517-tall-167987243500156
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 604K
-rw-r--r-- 1 mcc users 13K Mar 23 15:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 103K Mar 23 15:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Mar 23 15:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K Mar 23 15:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.7K 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 18K Mar 23 07:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 19K Mar 23 15:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 157K Mar 23 15:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 16K Mar 23 15:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 116K 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-D03N010-LTLFireability-00
FORMULA_NAME CryptoMiner-PT-D03N010-LTLFireability-01
FORMULA_NAME CryptoMiner-PT-D03N010-LTLFireability-02
FORMULA_NAME CryptoMiner-PT-D03N010-LTLFireability-03
FORMULA_NAME CryptoMiner-PT-D03N010-LTLFireability-04
FORMULA_NAME CryptoMiner-PT-D03N010-LTLFireability-05
FORMULA_NAME CryptoMiner-PT-D03N010-LTLFireability-06
FORMULA_NAME CryptoMiner-PT-D03N010-LTLFireability-07
FORMULA_NAME CryptoMiner-PT-D03N010-LTLFireability-08
FORMULA_NAME CryptoMiner-PT-D03N010-LTLFireability-09
FORMULA_NAME CryptoMiner-PT-D03N010-LTLFireability-10
FORMULA_NAME CryptoMiner-PT-D03N010-LTLFireability-11
FORMULA_NAME CryptoMiner-PT-D03N010-LTLFireability-12
FORMULA_NAME CryptoMiner-PT-D03N010-LTLFireability-13
FORMULA_NAME CryptoMiner-PT-D03N010-LTLFireability-14
FORMULA_NAME CryptoMiner-PT-D03N010-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1680874785864

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=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CryptoMiner-PT-D03N010
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2023-04-07 13:39:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-04-07 13:39:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 13:39:47] [INFO ] Load time of PNML (sax parser for PT used): 18 ms
[2023-04-07 13:39:47] [INFO ] Transformed 12 places.
[2023-04-07 13:39:47] [INFO ] Transformed 12 transitions.
[2023-04-07 13:39:47] [INFO ] Parsed PT model containing 12 places and 12 transitions and 34 arcs in 76 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA CryptoMiner-PT-D03N010-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CryptoMiner-PT-D03N010-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CryptoMiner-PT-D03N010-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CryptoMiner-PT-D03N010-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CryptoMiner-PT-D03N010-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Initial state reduction rules removed 1 formulas.
FORMULA CryptoMiner-PT-D03N010-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 8 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 11 transition count 12
Applied a total of 1 rules in 8 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 13:39:47] [INFO ] Computed 0 invariants in 4 ms
[2023-04-07 13:39:47] [INFO ] Implicit Places using invariants in 102 ms returned []
[2023-04-07 13:39:47] [INFO ] Invariant cache hit.
[2023-04-07 13:39:47] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 13:39:47] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
[2023-04-07 13:39:47] [INFO ] Invariant cache hit.
[2023-04-07 13:39:47] [INFO ] Dead Transitions using invariants and state equation in 33 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 211 ms. Remains : 11/12 places, 12/12 transitions.
Support contains 8 out of 11 places after structural reductions.
[2023-04-07 13:39:48] [INFO ] Flatten gal took : 12 ms
[2023-04-07 13:39:48] [INFO ] Flatten gal took : 3 ms
[2023-04-07 13:39:48] [INFO ] Input system was already deterministic with 12 transitions.
Incomplete random walk after 10002 steps, including 3 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 12) seen :11
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-04-07 13:39:48] [INFO ] Invariant cache hit.
[2023-04-07 13:39:48] [INFO ] After 50ms 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 1 ms.
Successfully simplified 1 atomic propositions for a total of 10 simplifications.
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
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||(!p1 U (p2||G(!p1)))))))'
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 13 ms. Remains 11 /11 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-04-07 13:39:48] [INFO ] Invariant cache hit.
[2023-04-07 13:39:48] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-04-07 13:39:48] [INFO ] Invariant cache hit.
[2023-04-07 13:39:48] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 13:39:48] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
[2023-04-07 13:39:48] [INFO ] Redundant transitions in 1 ms returned []
[2023-04-07 13:39:48] [INFO ] Invariant cache hit.
[2023-04-07 13:39:48] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 140 ms. Remains : 11/11 places, 12/12 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 271 ms :[(AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1)]
Running random walk in product with property : CryptoMiner-PT-D03N010-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p2:(AND (LT s10 1) (NOT (OR (GEQ s0 1) (GEQ s1 1) (GEQ s2 1) (GEQ s3 1)))), p0:(AND (LT s7 1) (LT s8 1) (LT s9 1)), p1:(OR (GEQ s0 1) (GEQ s1 1) (GEQ s2 1...], 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 124 reset in 227 ms.
Stack based approach found an accepted trace after 53 steps with 5 reset with depth 9 and stack size 9 in 0 ms.
FORMULA CryptoMiner-PT-D03N010-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property CryptoMiner-PT-D03N010-LTLFireability-01 finished in 711 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)||G(p1)))||F(p1)))'
Support contains 4 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-04-07 13:39:49] [INFO ] Invariant cache hit.
[2023-04-07 13:39:49] [INFO ] Implicit Places using invariants in 41 ms returned []
[2023-04-07 13:39:49] [INFO ] Invariant cache hit.
[2023-04-07 13:39:49] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 13:39:49] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
[2023-04-07 13:39:49] [INFO ] Invariant cache hit.
[2023-04-07 13:39:49] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 149 ms. Remains : 11/11 places, 12/12 transitions.
Stuttering acceptance computed with spot in 282 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CryptoMiner-PT-D03N010-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}]], initial=3, aps=[p1:(AND (LT s7 1) (LT s8 1) (LT s9 1)), p0:(OR (LT s0 1) (LT s7 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 11908 reset in 134 ms.
Stack based approach found an accepted trace after 51 steps with 3 reset with depth 21 and stack size 21 in 1 ms.
FORMULA CryptoMiner-PT-D03N010-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property CryptoMiner-PT-D03N010-LTLFireability-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' '!(X(F(p0)))'
Support contains 4 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 12/12 transitions.
Applied a total of 0 rules in 2 ms. Remains 11 /11 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-04-07 13:39:49] [INFO ] Invariant cache hit.
[2023-04-07 13:39:49] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-04-07 13:39:49] [INFO ] Invariant cache hit.
[2023-04-07 13:39:49] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 13:39:49] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
[2023-04-07 13:39:49] [INFO ] Invariant cache hit.
[2023-04-07 13:39:49] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 171 ms. Remains : 11/11 places, 12/12 transitions.
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CryptoMiner-PT-D03N010-LTLFireability-04 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 (GEQ s0 1) (GEQ s1 1) (GEQ s2 1) (GEQ s3 1))], 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 116 ms.
Product exploration explored 100000 steps with 50000 reset in 128 ms.
Computed a total of 6 stabilizing places and 7 stable transitions
Graph (complete) has 26 edges and 11 vertex of which 5 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Computed a total of 6 stabilizing places and 7 stable transitions
Knowledge obtained : [p0, (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 19 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-D03N010-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CryptoMiner-PT-D03N010-LTLFireability-04 finished in 549 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||G(F(p1))))))'
Support contains 4 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-04-07 13:39:50] [INFO ] Invariant cache hit.
[2023-04-07 13:39:50] [INFO ] Implicit Places using invariants in 43 ms returned []
[2023-04-07 13:39:50] [INFO ] Invariant cache hit.
[2023-04-07 13:39:50] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 13:39:50] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
[2023-04-07 13:39:50] [INFO ] Invariant cache hit.
[2023-04-07 13:39:50] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 121 ms. Remains : 11/11 places, 12/12 transitions.
Stuttering acceptance computed with spot in 123 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CryptoMiner-PT-D03N010-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (LT s10 1) (OR (GEQ s7 1) (GEQ s8 1) (GEQ s9 1))), p1:(GEQ s10 1)], 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 50000 reset in 66 ms.
Product exploration explored 100000 steps with 50000 reset in 74 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
Detected a total of 6/11 stabilizing places and 7/12 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 21 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CryptoMiner-PT-D03N010-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CryptoMiner-PT-D03N010-LTLFireability-05 finished in 440 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 4 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-04-07 13:39:50] [INFO ] Invariant cache hit.
[2023-04-07 13:39:50] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-04-07 13:39:50] [INFO ] Invariant cache hit.
[2023-04-07 13:39:50] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 13:39:50] [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 13:39:50] [INFO ] Invariant cache hit.
[2023-04-07 13:39:50] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 79 ms. Remains : 11/11 places, 12/12 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CryptoMiner-PT-D03N010-LTLFireability-06 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 (GEQ s0 1) (GEQ s1 1) (GEQ s2 1) (GEQ s3 1))], 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 51 ms.
Product exploration explored 100000 steps with 50000 reset in 59 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 : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 18 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-D03N010-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CryptoMiner-PT-D03N010-LTLFireability-06 finished in 295 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)&&F(p1))))'
Support contains 4 out of 11 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 11/11 places, 12/12 transitions.
Applied a total of 0 rules in 5 ms. Remains 11 /11 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-04-07 13:39:51] [INFO ] Invariant cache hit.
[2023-04-07 13:39:51] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-04-07 13:39:51] [INFO ] Invariant cache hit.
[2023-04-07 13:39:51] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 13:39:51] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2023-04-07 13:39:51] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 13:39:51] [INFO ] Invariant cache hit.
[2023-04-07 13:39:51] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 93 ms. Remains : 11/11 places, 12/12 transitions.
Stuttering acceptance computed with spot in 138 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : CryptoMiner-PT-D03N010-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (LT s7 1) (LT s8 1) (LT s9 1)), p1:(OR (LT s0 1) (LT s7 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 51 reset in 74 ms.
Stack based approach found an accepted trace after 142 steps with 14 reset with depth 34 and stack size 34 in 0 ms.
FORMULA CryptoMiner-PT-D03N010-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property CryptoMiner-PT-D03N010-LTLFireability-07 finished in 322 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)) U G(!p1)))'
Support contains 3 out of 11 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 11/11 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-04-07 13:39:51] [INFO ] Invariant cache hit.
[2023-04-07 13:39:51] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-04-07 13:39:51] [INFO ] Invariant cache hit.
[2023-04-07 13:39:51] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 13:39:51] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2023-04-07 13:39:51] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 13:39:51] [INFO ] Invariant cache hit.
[2023-04-07 13:39:51] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 84 ms. Remains : 11/11 places, 12/12 transitions.
Stuttering acceptance computed with spot in 131 ms :[p1, p0, (AND p0 (NOT p1))]
Running random walk in product with property : CryptoMiner-PT-D03N010-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=p1, acceptance={0} source=0 dest: 0}, { cond=(AND p1 p0), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(OR (LT s0 1) (LT s7 1)), p0:(GEQ s10 1)], 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 15099 reset in 88 ms.
Stack based approach found an accepted trace after 1142 steps with 172 reset with depth 11 and stack size 11 in 1 ms.
FORMULA CryptoMiner-PT-D03N010-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property CryptoMiner-PT-D03N010-LTLFireability-09 finished in 325 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)||G(p1))))'
Support contains 2 out of 11 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 11/11 places, 12/12 transitions.
Graph (trivial) has 4 edges and 11 vertex of which 4 / 11 are part of one of the 1 SCC in 3 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 6 ms. Remains 8 /11 variables (removed 3) and now considering 9/12 (removed 3) transitions.
// Phase 1: matrix 9 rows 8 cols
[2023-04-07 13:39:51] [INFO ] Computed 0 invariants in 1 ms
[2023-04-07 13:39:51] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-04-07 13:39:51] [INFO ] Invariant cache hit.
[2023-04-07 13:39:51] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 13:39:51] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2023-04-07 13:39:51] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 13:39:51] [INFO ] Invariant cache hit.
[2023-04-07 13:39:51] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/11 places, 9/12 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 88 ms. Remains : 8/11 places, 9/12 transitions.
Stuttering acceptance computed with spot in 44 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : CryptoMiner-PT-D03N010-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(LT s6 1), p1:(GEQ s4 1)], nbAcceptance=2, 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 9 steps with 0 reset in 0 ms.
FORMULA CryptoMiner-PT-D03N010-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-PT-D03N010-LTLFireability-10 finished in 148 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 12/12 (removed 0) transitions.
// Phase 1: matrix 12 rows 11 cols
[2023-04-07 13:39:51] [INFO ] Computed 0 invariants in 1 ms
[2023-04-07 13:39:51] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-04-07 13:39:51] [INFO ] Invariant cache hit.
[2023-04-07 13:39:51] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 13:39:51] [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 13:39:51] [INFO ] Invariant cache hit.
[2023-04-07 13:39:51] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59 ms. Remains : 11/11 places, 12/12 transitions.
Stuttering acceptance computed with spot in 92 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CryptoMiner-PT-D03N010-LTLFireability-13 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: 2}]], initial=1, aps=[p0:(GEQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA CryptoMiner-PT-D03N010-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-PT-D03N010-LTLFireability-13 finished in 161 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(X((((X(p1) U p2)||X(!p1))&&p0))))'
Support contains 2 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-04-07 13:39:52] [INFO ] Invariant cache hit.
[2023-04-07 13:39:52] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-04-07 13:39:52] [INFO ] Invariant cache hit.
[2023-04-07 13:39:52] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 13:39:52] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
[2023-04-07 13:39:52] [INFO ] Invariant cache hit.
[2023-04-07 13:39:52] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 70 ms. Remains : 11/11 places, 12/12 transitions.
Stuttering acceptance computed with spot in 207 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), true, (AND (NOT p2) p1), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : CryptoMiner-PT-D03N010-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s7 1)), p2:(GEQ s0 1), p1:(OR (LT s0 1) (LT s7 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA CryptoMiner-PT-D03N010-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-PT-D03N010-LTLFireability-14 finished in 299 ms.
All properties solved by simple procedures.
Total runtime 4928 ms.

BK_STOP 1680874793312

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CryptoMiner-PT-D03N010"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
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 itstools"
echo " Input is CryptoMiner-PT-D03N010, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r517-tall-167987243500156"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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