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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
482.140 12619.00 19777.00 360.60 FFFFFTTTFFFTFFTF 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-167987243500188.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-D05N250, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r517-tall-167987243500188
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 708K
-rw-r--r-- 1 mcc users 20K Mar 23 15:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 149K Mar 23 15:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Mar 23 15:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Mar 23 15:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 7.5K Mar 23 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 36K Mar 23 07:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.4K Mar 23 07:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 22K Mar 23 07:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 24K Mar 23 15:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 172K Mar 23 15:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 19K Mar 23 15:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 141K Mar 23 15:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.3K Mar 23 07:06 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.2K Mar 23 07:06 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 26 22:42 equiv_col
-rw-r--r-- 1 mcc users 8 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 7.8K Mar 31 16:48 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1680881502996

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-D05N250
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2023-04-07 15:31:44] [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 15:31:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 15:31:44] [INFO ] Load time of PNML (sax parser for PT used): 23 ms
[2023-04-07 15:31:44] [INFO ] Transformed 18 places.
[2023-04-07 15:31:44] [INFO ] Transformed 18 transitions.
[2023-04-07 15:31:44] [INFO ] Parsed PT model containing 18 places and 18 transitions and 52 arcs in 84 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA CryptoMiner-PT-D05N250-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CryptoMiner-PT-D05N250-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CryptoMiner-PT-D05N250-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 12 out of 18 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 18/18 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 17 transition count 18
Applied a total of 1 rules in 14 ms. Remains 17 /18 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 17 cols
[2023-04-07 15:31:44] [INFO ] Computed 0 invariants in 9 ms
[2023-04-07 15:31:45] [INFO ] Implicit Places using invariants in 123 ms returned []
[2023-04-07 15:31:45] [INFO ] Invariant cache hit.
[2023-04-07 15:31:45] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 15:31:45] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 311 ms to find 0 implicit places.
[2023-04-07 15:31:45] [INFO ] Invariant cache hit.
[2023-04-07 15:31:45] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 17/18 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 355 ms. Remains : 17/18 places, 18/18 transitions.
Support contains 12 out of 17 places after structural reductions.
[2023-04-07 15:31:45] [INFO ] Flatten gal took : 14 ms
[2023-04-07 15:31:45] [INFO ] Flatten gal took : 4 ms
[2023-04-07 15:31:45] [INFO ] Input system was already deterministic with 18 transitions.
Incomplete random walk after 10067 steps, including 3 resets, run finished after 17 ms. (steps per millisecond=592 ) properties (out of 14) seen :13
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-04-07 15:31:45] [INFO ] Invariant cache hit.
[2023-04-07 15:31:45] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
FORMULA CryptoMiner-PT-D05N250-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 10 stabilizing places and 11 stable transitions
Graph (complete) has 42 edges and 17 vertex of which 7 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.2 ms
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 U !p1))))'
Support contains 6 out of 17 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 17/17 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 17 /17 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-04-07 15:31:45] [INFO ] Invariant cache hit.
[2023-04-07 15:31:45] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-04-07 15:31:45] [INFO ] Invariant cache hit.
[2023-04-07 15:31:45] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 15:31:45] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2023-04-07 15:31:45] [INFO ] Invariant cache hit.
[2023-04-07 15:31:45] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 80 ms. Remains : 17/17 places, 18/18 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 260 ms :[p1, p1, true, p1]
Running random walk in product with property : CryptoMiner-PT-D05N250-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 p0), acceptance={0} source=3 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (GEQ s0 1) (GEQ s11 1)), p0:(OR (GEQ s15 1) (GEQ s11 1) (GEQ s12 1) (GEQ s13 1) (GEQ s14 1) (AND (GEQ s0 1) (GEQ s11 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA CryptoMiner-PT-D05N250-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-PT-D05N250-LTLFireability-00 finished in 393 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((!p0&&X(p1))))'
Support contains 3 out of 17 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 17/17 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 17 /17 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-04-07 15:31:46] [INFO ] Invariant cache hit.
[2023-04-07 15:31:46] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-04-07 15:31:46] [INFO ] Invariant cache hit.
[2023-04-07 15:31:46] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 15:31:46] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
[2023-04-07 15:31:46] [INFO ] Invariant cache hit.
[2023-04-07 15:31:46] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 105 ms. Remains : 17/17 places, 18/18 transitions.
Stuttering acceptance computed with spot in 148 ms :[(NOT p1), (OR (NOT p1) p0), (OR (NOT p1) p0), true]
Running random walk in product with property : CryptoMiner-PT-D05N250-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(GEQ s16 1), p0:(AND (GEQ s0 1) (GEQ s11 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CryptoMiner-PT-D05N250-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-PT-D05N250-LTLFireability-01 finished in 266 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 17 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 17/17 places, 18/18 transitions.
Applied a total of 0 rules in 7 ms. Remains 17 /17 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-04-07 15:31:46] [INFO ] Invariant cache hit.
[2023-04-07 15:31:46] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-04-07 15:31:46] [INFO ] Invariant cache hit.
[2023-04-07 15:31:46] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 15:31:46] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
[2023-04-07 15:31:46] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 15:31:46] [INFO ] Invariant cache hit.
[2023-04-07 15:31:46] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 117 ms. Remains : 17/17 places, 18/18 transitions.
Stuttering acceptance computed with spot in 150 ms :[p0]
Running random walk in product with property : CryptoMiner-PT-D05N250-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s11 1))], 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 191 ms.
Product exploration explored 100000 steps with 0 reset in 196 ms.
Computed a total of 10 stabilizing places and 11 stable transitions
Graph (complete) has 42 edges and 17 vertex of which 7 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.0 ms
Computed a total of 10 stabilizing places and 11 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 158 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 40 ms :[p0]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 186 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 46 ms :[p0]
Stuttering acceptance computed with spot in 33 ms :[p0]
[2023-04-07 15:31:47] [INFO ] Invariant cache hit.
[2023-04-07 15:31:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 15:31:47] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-04-07 15:31:47] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 15:31:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 15:31:47] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2023-04-07 15:31:47] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 15:31:47] [INFO ] [Nat]Added 5 Read/Feed constraints in 1 ms returned sat
[2023-04-07 15:31:47] [INFO ] Computed and/alt/rep : 15/25/15 causal constraints (skipped 0 transitions) in 6 ms.
[2023-04-07 15:31:47] [INFO ] Added : 0 causal constraints over 0 iterations in 16 ms. Result :sat
Could not prove EG p0
Support contains 2 out of 17 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 17/17 places, 18/18 transitions.
Applied a total of 0 rules in 2 ms. Remains 17 /17 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-04-07 15:31:47] [INFO ] Invariant cache hit.
[2023-04-07 15:31:47] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-04-07 15:31:47] [INFO ] Invariant cache hit.
[2023-04-07 15:31:47] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 15:31:47] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2023-04-07 15:31:47] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 15:31:47] [INFO ] Invariant cache hit.
[2023-04-07 15:31:47] [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 85 ms. Remains : 17/17 places, 18/18 transitions.
Computed a total of 10 stabilizing places and 11 stable transitions
Graph (complete) has 42 edges and 17 vertex of which 7 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.0 ms
Computed a total of 10 stabilizing places and 11 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 155 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 35 ms :[p0]
Finished random walk after 251 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=125 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 197 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 :[p0]
Stuttering acceptance computed with spot in 32 ms :[p0]
[2023-04-07 15:31:48] [INFO ] Invariant cache hit.
[2023-04-07 15:31:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 15:31:48] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-04-07 15:31:48] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 15:31:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 15:31:48] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2023-04-07 15:31:48] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 15:31:48] [INFO ] [Nat]Added 5 Read/Feed constraints in 1 ms returned sat
[2023-04-07 15:31:48] [INFO ] Computed and/alt/rep : 15/25/15 causal constraints (skipped 0 transitions) in 2 ms.
[2023-04-07 15:31:48] [INFO ] Added : 0 causal constraints over 0 iterations in 5 ms. Result :sat
Could not prove EG p0
Stuttering acceptance computed with spot in 36 ms :[p0]
Product exploration explored 100000 steps with 0 reset in 91 ms.
Product exploration explored 100000 steps with 0 reset in 196 ms.
Built C files in :
/tmp/ltsmin11673284856107459509
[2023-04-07 15:31:48] [INFO ] Computing symmetric may disable matrix : 18 transitions.
[2023-04-07 15:31:48] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-07 15:31:48] [INFO ] Computing symmetric may enable matrix : 18 transitions.
[2023-04-07 15:31:48] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-07 15:31:48] [INFO ] Computing Do-Not-Accords matrix : 18 transitions.
[2023-04-07 15:31:48] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-07 15:31:48] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11673284856107459509
Running compilation step : cd /tmp/ltsmin11673284856107459509;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 177 ms.
Running link step : cd /tmp/ltsmin11673284856107459509;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin11673284856107459509;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased9994533931952077689.hoa' '--buchi-type=spotba'
LTSmin run took 354 ms.
FORMULA CryptoMiner-PT-D05N250-LTLFireability-02 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CryptoMiner-PT-D05N250-LTLFireability-02 finished in 2885 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))||G((F(!p1)&&F(G(p2))))))'
Support contains 8 out of 17 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 17/17 places, 18/18 transitions.
Applied a total of 0 rules in 2 ms. Remains 17 /17 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-04-07 15:31:49] [INFO ] Invariant cache hit.
[2023-04-07 15:31:49] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-04-07 15:31:49] [INFO ] Invariant cache hit.
[2023-04-07 15:31:49] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 15:31:49] [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 15:31:49] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 15:31:49] [INFO ] Invariant cache hit.
[2023-04-07 15:31:49] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 84 ms. Remains : 17/17 places, 18/18 transitions.
Stuttering acceptance computed with spot in 145 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1)]
Running random walk in product with property : CryptoMiner-PT-D05N250-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s11 1)), p2:(AND (LT s16 1) (LT s0 1) (LT s1 1) (LT s2 1) (LT s3 1) (LT s4 1) (LT s5 1)), p1:(GEQ s16 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 0 reset in 89 ms.
Stack based approach found an accepted trace after 52 steps with 0 reset with depth 53 and stack size 53 in 0 ms.
FORMULA CryptoMiner-PT-D05N250-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property CryptoMiner-PT-D05N250-LTLFireability-03 finished in 335 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||X(G(!p1))))))'
Support contains 3 out of 17 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 17/17 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 17 /17 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-04-07 15:31:49] [INFO ] Invariant cache hit.
[2023-04-07 15:31:49] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-04-07 15:31:49] [INFO ] Invariant cache hit.
[2023-04-07 15:31:49] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 15:31:49] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2023-04-07 15:31:49] [INFO ] Invariant cache hit.
[2023-04-07 15:31:49] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 79 ms. Remains : 17/17 places, 18/18 transitions.
Stuttering acceptance computed with spot in 175 ms :[true, (AND (NOT p0) p1), p1, (AND (NOT p0) p1), (AND (NOT p0) p1)]
Running random walk in product with property : CryptoMiner-PT-D05N250-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=3, aps=[p0:(AND (GEQ s0 1) (GEQ s11 1)), p1:(GEQ s16 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 15 steps with 0 reset in 1 ms.
FORMULA CryptoMiner-PT-D05N250-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-PT-D05N250-LTLFireability-04 finished in 274 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(((!p1 U p2)||p0))))'
Support contains 12 out of 17 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 17/17 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 17 /17 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-04-07 15:31:49] [INFO ] Invariant cache hit.
[2023-04-07 15:31:49] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-04-07 15:31:49] [INFO ] Invariant cache hit.
[2023-04-07 15:31:49] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 15:31:49] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2023-04-07 15:31:49] [INFO ] Invariant cache hit.
[2023-04-07 15:31:49] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 83 ms. Remains : 17/17 places, 18/18 transitions.
Stuttering acceptance computed with spot in 95 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : CryptoMiner-PT-D05N250-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (GEQ s0 1) (GEQ s1 1) (GEQ s2 1) (GEQ s3 1) (GEQ s4 1) (GEQ s5 1) (AND (LT s15 1) (LT s11 1) (LT s12 1) (LT s13 1) (LT s14 1))), p2:(GEQ s16 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 109 ms.
Product exploration explored 100000 steps with 50000 reset in 87 ms.
Computed a total of 10 stabilizing places and 11 stable transitions
Graph (complete) has 42 edges and 17 vertex of which 7 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.1 ms
Computed a total of 10 stabilizing places and 11 stable transitions
Detected a total of 10/17 stabilizing places and 11/18 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 24 ms. Reduced automaton from 2 states, 2 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CryptoMiner-PT-D05N250-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CryptoMiner-PT-D05N250-LTLFireability-06 finished in 420 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 1 out of 17 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 17/17 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 17 /17 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-04-07 15:31:50] [INFO ] Invariant cache hit.
[2023-04-07 15:31:50] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-04-07 15:31:50] [INFO ] Invariant cache hit.
[2023-04-07 15:31:50] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 15:31:50] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2023-04-07 15:31:50] [INFO ] Invariant cache hit.
[2023-04-07 15:31:50] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 88 ms. Remains : 17/17 places, 18/18 transitions.
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CryptoMiner-PT-D05N250-LTLFireability-08 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:(GEQ s13 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][false, false, false]]
Product exploration explored 100000 steps with 12399 reset in 73 ms.
Stack based approach found an accepted trace after 514 steps with 70 reset with depth 9 and stack size 9 in 1 ms.
FORMULA CryptoMiner-PT-D05N250-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property CryptoMiner-PT-D05N250-LTLFireability-08 finished in 280 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(F(((X(p0) U p1)&&p2))))))'
Support contains 4 out of 17 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 17/17 places, 18/18 transitions.
Applied a total of 0 rules in 2 ms. Remains 17 /17 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-04-07 15:31:50] [INFO ] Invariant cache hit.
[2023-04-07 15:31:50] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-04-07 15:31:50] [INFO ] Invariant cache hit.
[2023-04-07 15:31:50] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 15:31:50] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2023-04-07 15:31:50] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 15:31:50] [INFO ] Invariant cache hit.
[2023-04-07 15:31:50] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 103 ms. Remains : 17/17 places, 18/18 transitions.
Stuttering acceptance computed with spot in 143 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : CryptoMiner-PT-D05N250-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(OR (AND (NOT p1) p2) (AND (NOT p1) p0)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(LT s15 1), p1:(GEQ s3 1), p0:(AND (GEQ s0 1) (GEQ s11 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 8754 reset in 88 ms.
Stack based approach found an accepted trace after 1252 steps with 118 reset with depth 14 and stack size 14 in 2 ms.
FORMULA CryptoMiner-PT-D05N250-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property CryptoMiner-PT-D05N250-LTLFireability-09 finished in 357 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&&F(p1)))&&X(F(p2)))||G((F(p1)&&F(!p0)))))))'
Support contains 4 out of 17 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 17/17 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 17 /17 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-04-07 15:31:50] [INFO ] Invariant cache hit.
[2023-04-07 15:31:50] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-04-07 15:31:50] [INFO ] Invariant cache hit.
[2023-04-07 15:31:51] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 15:31:51] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
[2023-04-07 15:31:51] [INFO ] Invariant cache hit.
[2023-04-07 15:31:51] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 95 ms. Remains : 17/17 places, 18/18 transitions.
Stuttering acceptance computed with spot in 383 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p1), p0, (AND p0 (NOT p2))]
Running random walk in product with property : CryptoMiner-PT-D05N250-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}, { cond=(NOT p1), acceptance={} source=2 dest: 4}, { cond=p0, acceptance={} source=2 dest: 6}, { cond=p0, acceptance={} source=2 dest: 7}], [{ cond=(NOT p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 5}, { cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 8}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={} source=6 dest: 4}, { cond=p0, acceptance={} source=6 dest: 6}], [{ cond=p0, acceptance={0} source=7 dest: 7}], [{ cond=(AND p0 (NOT p2)), acceptance={0} source=8 dest: 8}]], initial=0, aps=[p1:(GEQ s4 1), p0:(GEQ s3 1), p2:(AND (GEQ s0 1) (GEQ s11 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, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 7842 reset in 73 ms.
Stack based approach found an accepted trace after 11301 steps with 888 reset with depth 21 and stack size 21 in 9 ms.
FORMULA CryptoMiner-PT-D05N250-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property CryptoMiner-PT-D05N250-LTLFireability-10 finished in 587 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(X(F(!p0)))))'
Support contains 2 out of 17 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 17/17 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 17 /17 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-04-07 15:31:51] [INFO ] Invariant cache hit.
[2023-04-07 15:31:51] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-04-07 15:31:51] [INFO ] Invariant cache hit.
[2023-04-07 15:31:51] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 15:31:51] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2023-04-07 15:31:51] [INFO ] Invariant cache hit.
[2023-04-07 15:31:51] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 83 ms. Remains : 17/17 places, 18/18 transitions.
Stuttering acceptance computed with spot in 308 ms :[p0, p0, p0, p0]
Running random walk in product with property : CryptoMiner-PT-D05N250-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(AND (GEQ s0 1) (GEQ s11 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 18105 reset in 69 ms.
Stack based approach found an accepted trace after 1378 steps with 242 reset with depth 10 and stack size 10 in 1 ms.
FORMULA CryptoMiner-PT-D05N250-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property CryptoMiner-PT-D05N250-LTLFireability-12 finished in 482 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 3 out of 17 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 17/17 places, 18/18 transitions.
Applied a total of 0 rules in 3 ms. Remains 17 /17 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-04-07 15:31:52] [INFO ] Invariant cache hit.
[2023-04-07 15:31:52] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-04-07 15:31:52] [INFO ] Invariant cache hit.
[2023-04-07 15:31:52] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 15:31:52] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
[2023-04-07 15:31:52] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 15:31:52] [INFO ] Invariant cache hit.
[2023-04-07 15:31:52] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 96 ms. Remains : 17/17 places, 18/18 transitions.
Stuttering acceptance computed with spot in 30 ms :[(AND p0 (NOT p1))]
Running random walk in product with property : CryptoMiner-PT-D05N250-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s11 1)), p1:(AND (OR (LT s0 1) (LT s11 1)) (LT s4 1))], nbAcceptance=2, 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 100 ms.
Product exploration explored 100000 steps with 0 reset in 167 ms.
Computed a total of 10 stabilizing places and 11 stable transitions
Graph (complete) has 42 edges and 17 vertex of which 7 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.0 ms
Computed a total of 10 stabilizing places and 11 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Knowledge based reduction with 5 factoid took 247 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[(AND p0 (NOT p1))]
Incomplete random walk after 10074 steps, including 4 resets, run finished after 8 ms. (steps per millisecond=1259 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-04-07 15:31:52] [INFO ] Invariant cache hit.
[2023-04-07 15:31:52] [INFO ] After 19ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (G (NOT (AND p0 p1)))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 6 factoid took 354 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[p0]
Stuttering acceptance computed with spot in 37 ms :[p0]
[2023-04-07 15:31:53] [INFO ] Invariant cache hit.
[2023-04-07 15:31:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 15:31:53] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-04-07 15:31:53] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 15:31:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 15:31:53] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2023-04-07 15:31:53] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 15:31:53] [INFO ] [Nat]Added 5 Read/Feed constraints in 0 ms returned sat
[2023-04-07 15:31:53] [INFO ] Computed and/alt/rep : 15/25/15 causal constraints (skipped 0 transitions) in 1 ms.
[2023-04-07 15:31:53] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Could not prove EG p0
Support contains 2 out of 17 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 17/17 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 17 /17 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-04-07 15:31:53] [INFO ] Invariant cache hit.
[2023-04-07 15:31:53] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-04-07 15:31:53] [INFO ] Invariant cache hit.
[2023-04-07 15:31:53] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 15:31:53] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2023-04-07 15:31:53] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 15:31:53] [INFO ] Invariant cache hit.
[2023-04-07 15:31:53] [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 74 ms. Remains : 17/17 places, 18/18 transitions.
Computed a total of 10 stabilizing places and 11 stable transitions
Graph (complete) has 42 edges and 17 vertex of which 7 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.0 ms
Computed a total of 10 stabilizing places and 11 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 142 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 47 ms :[p0]
Finished random walk after 251 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=251 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 166 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 25 ms :[p0]
Stuttering acceptance computed with spot in 25 ms :[p0]
[2023-04-07 15:31:53] [INFO ] Invariant cache hit.
[2023-04-07 15:31:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 15:31:53] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-04-07 15:31:53] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 15:31:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 15:31:53] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2023-04-07 15:31:53] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 15:31:53] [INFO ] [Nat]Added 5 Read/Feed constraints in 0 ms returned sat
[2023-04-07 15:31:53] [INFO ] Computed and/alt/rep : 15/25/15 causal constraints (skipped 0 transitions) in 1 ms.
[2023-04-07 15:31:53] [INFO ] Added : 0 causal constraints over 0 iterations in 7 ms. Result :sat
Could not prove EG p0
Stuttering acceptance computed with spot in 36 ms :[p0]
Product exploration explored 100000 steps with 0 reset in 63 ms.
Product exploration explored 100000 steps with 0 reset in 91 ms.
Built C files in :
/tmp/ltsmin641672247460608285
[2023-04-07 15:31:54] [INFO ] Computing symmetric may disable matrix : 18 transitions.
[2023-04-07 15:31:54] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-07 15:31:54] [INFO ] Computing symmetric may enable matrix : 18 transitions.
[2023-04-07 15:31:54] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-07 15:31:54] [INFO ] Computing Do-Not-Accords matrix : 18 transitions.
[2023-04-07 15:31:54] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-07 15:31:54] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin641672247460608285
Running compilation step : cd /tmp/ltsmin641672247460608285;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 96 ms.
Running link step : cd /tmp/ltsmin641672247460608285;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin641672247460608285;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8182827793607969176.hoa' '--buchi-type=spotba'
LTSmin run took 60 ms.
FORMULA CryptoMiner-PT-D05N250-LTLFireability-13 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CryptoMiner-PT-D05N250-LTLFireability-13 finished in 2281 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 U X(p0)))))'
Support contains 1 out of 17 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 17/17 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 17 /17 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-04-07 15:31:54] [INFO ] Invariant cache hit.
[2023-04-07 15:31:54] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-04-07 15:31:54] [INFO ] Invariant cache hit.
[2023-04-07 15:31:54] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 15:31:54] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2023-04-07 15:31:54] [INFO ] Invariant cache hit.
[2023-04-07 15:31:54] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 81 ms. Remains : 17/17 places, 18/18 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CryptoMiner-PT-D05N250-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s16 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 0 reset in 61 ms.
Stack based approach found an accepted trace after 15 steps with 0 reset with depth 16 and stack size 16 in 0 ms.
FORMULA CryptoMiner-PT-D05N250-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property CryptoMiner-PT-D05N250-LTLFireability-15 finished in 226 ms.
All properties solved by simple procedures.
Total runtime 9993 ms.

BK_STOP 1680881515615

--------------------
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-D05N250"
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-D05N250, 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-167987243500188"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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