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

About the Execution of LoLa+red for CryptoMiner-COL-D10N000

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
419.983 10627.00 18674.00 332.80 FTTTFFFFFFFFFTFF 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.r519-tall-167987244800123.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 lolaxred
Input is CryptoMiner-COL-D10N000, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r519-tall-167987244800123
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 444K
-rw-r--r-- 1 mcc users 12K Mar 23 15:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 135K Mar 23 15:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Mar 23 15:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Mar 23 15:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 23 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 23 07:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 23 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 23 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 7.1K Mar 23 15:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 60K Mar 23 15:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Mar 23 15:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K Mar 23 15:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 23 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 23 07:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 26 22:42 equiv_pt
-rw-r--r-- 1 mcc users 8 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 5 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 9.4K Mar 31 16:48 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1680837741926

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=lolaxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CryptoMiner-COL-D10N000
Applying reductions before tool lola
Invoking reducer
Running Version 202304061127
[2023-04-07 03:22:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-04-07 03:22:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 03:22:23] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-04-07 03:22:23] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-04-07 03:22:23] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 378 ms
[2023-04-07 03:22:23] [INFO ] Imported 2 HL places and 4 HL transitions for a total of 22 PT places and 44.0 transition bindings in 17 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
[2023-04-07 03:22:24] [INFO ] Built PT skeleton of HLPN with 2 places and 4 transitions 10 arcs in 5 ms.
[2023-04-07 03:22:24] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 2 formulas.
FORMULA CryptoMiner-COL-D10N000-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CryptoMiner-COL-D10N000-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CryptoMiner-COL-D10N000-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 1 stabilizing places and 1 stable transitions
Remains 13 properties that can be checked using skeleton over-approximation.
Computed a total of 1 stabilizing places and 1 stable transitions
Incomplete random walk after 10000 steps, including 3343 resets, run finished after 296 ms. (steps per millisecond=33 ) properties (out of 12) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-04-07 03:22:24] [INFO ] Flow matrix only has 3 transitions (discarded 1 similar events)
// Phase 1: matrix 3 rows 2 cols
[2023-04-07 03:22:24] [INFO ] Computed 0 invariants in 4 ms
[2023-04-07 03:22:24] [INFO ] After 111ms SMT Verify possible using all constraints in real domain returned unsat :4 sat :0
Fused 4 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 4 atomic propositions for a total of 13 simplifications.
FORMULA CryptoMiner-COL-D10N000-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CryptoMiner-COL-D10N000-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CryptoMiner-COL-D10N000-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CryptoMiner-COL-D10N000-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CryptoMiner-COL-D10N000-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-04-07 03:22:24] [INFO ] Flatten gal took : 14 ms
[2023-04-07 03:22:24] [INFO ] Flatten gal took : 2 ms
Arc [1:1*[(MOD (ADD $x 1) 11)]] contains successor/predecessor on variables of sort CD
[2023-04-07 03:22:24] [INFO ] Unfolded HLPN to a Petri net with 22 places and 22 transitions 64 arcs in 6 ms.
[2023-04-07 03:22:24] [INFO ] Unfolded 8 HLPN properties in 1 ms.
Support contains 22 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 22/22 transitions.
Applied a total of 0 rules in 5 ms. Remains 22 /22 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 22 cols
[2023-04-07 03:22:24] [INFO ] Computed 0 invariants in 0 ms
[2023-04-07 03:22:24] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-04-07 03:22:24] [INFO ] Invariant cache hit.
[2023-04-07 03:22:24] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 03:22:24] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
[2023-04-07 03:22:24] [INFO ] Invariant cache hit.
[2023-04-07 03:22:24] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 117 ms. Remains : 22/22 places, 22/22 transitions.
Support contains 22 out of 22 places after structural reductions.
[2023-04-07 03:22:24] [INFO ] Flatten gal took : 3 ms
[2023-04-07 03:22:24] [INFO ] Flatten gal took : 3 ms
[2023-04-07 03:22:24] [INFO ] Input system was already deterministic with 22 transitions.
Finished random walk after 16 steps, including 0 resets, run visited all 7 properties in 1 ms. (steps per millisecond=16 )
Parikh walk visited 0 properties in 0 ms.
FORMULA CryptoMiner-COL-D10N000-LTLCardinality-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 11 stabilizing places and 11 stable transitions
Graph (complete) has 52 edges and 22 vertex of which 21 are kept as prefixes of interest. Removing 1 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' '!((F(p0)||X(X(G(p1)))))'
Support contains 22 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 22/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2023-04-07 03:22:25] [INFO ] Invariant cache hit.
[2023-04-07 03:22:25] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-04-07 03:22:25] [INFO ] Invariant cache hit.
[2023-04-07 03:22:25] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 03:22:25] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
[2023-04-07 03:22:25] [INFO ] Invariant cache hit.
[2023-04-07 03:22:25] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 106 ms. Remains : 22/22 places, 22/22 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 380 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CryptoMiner-COL-D10N000-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(LEQ (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10) (ADD s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21)), p1:(AND (OR (LEQ 3 (ADD s11 s12 s13 s14 s15 s16 s17 s1...], 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 14225 reset in 209 ms.
Product exploration explored 100000 steps with 14431 reset in 124 ms.
Computed a total of 11 stabilizing places and 11 stable transitions
Graph (complete) has 52 edges and 22 vertex of which 21 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 11 stabilizing places and 11 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 2 factoid took 198 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Finished random walk after 11 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=11 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F p0)]
Knowledge based reduction with 2 factoid took 159 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
[2023-04-07 03:22:26] [INFO ] Invariant cache hit.
[2023-04-07 03:22:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 03:22:26] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-04-07 03:22:26] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 03:22:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 03:22:26] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2023-04-07 03:22:26] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 03:22:26] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2023-04-07 03:22:26] [INFO ] Computed and/alt/rep : 20/30/20 causal constraints (skipped 0 transitions) in 2 ms.
[2023-04-07 03:22:26] [INFO ] Added : 9 causal constraints over 2 iterations in 14 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 22 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 22/22 transitions.
Applied a total of 0 rules in 3 ms. Remains 22 /22 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2023-04-07 03:22:26] [INFO ] Invariant cache hit.
[2023-04-07 03:22:26] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-04-07 03:22:26] [INFO ] Invariant cache hit.
[2023-04-07 03:22:26] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 03:22:26] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2023-04-07 03:22:26] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 03:22:26] [INFO ] Invariant cache hit.
[2023-04-07 03:22:26] [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 92 ms. Remains : 22/22 places, 22/22 transitions.
Computed a total of 11 stabilizing places and 11 stable transitions
Graph (complete) has 52 edges and 22 vertex of which 21 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 11 stabilizing places and 11 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 115 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Finished random walk after 11 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=11 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 151 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
[2023-04-07 03:22:27] [INFO ] Invariant cache hit.
[2023-04-07 03:22:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 03:22:27] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-04-07 03:22:27] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 03:22:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 03:22:27] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2023-04-07 03:22:27] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 03:22:27] [INFO ] [Nat]Added 10 Read/Feed constraints in 4 ms returned sat
[2023-04-07 03:22:27] [INFO ] Computed and/alt/rep : 20/30/20 causal constraints (skipped 0 transitions) in 3 ms.
[2023-04-07 03:22:27] [INFO ] Added : 9 causal constraints over 2 iterations in 16 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Product exploration explored 100000 steps with 14425 reset in 79 ms.
Product exploration explored 100000 steps with 14406 reset in 124 ms.
Support contains 22 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 22 /22 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2023-04-07 03:22:27] [INFO ] Invariant cache hit.
[2023-04-07 03:22:27] [INFO ] Implicit Places using invariants in 46 ms returned []
[2023-04-07 03:22:27] [INFO ] Invariant cache hit.
[2023-04-07 03:22:27] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 03:22:27] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
[2023-04-07 03:22:27] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 03:22:27] [INFO ] Invariant cache hit.
[2023-04-07 03:22:27] [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 124 ms. Remains : 22/22 places, 22/22 transitions.
Treatment of property CryptoMiner-COL-D10N000-LTLCardinality-02 finished in 2447 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(p1)))'
Support contains 22 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2023-04-07 03:22:27] [INFO ] Invariant cache hit.
[2023-04-07 03:22:27] [INFO ] Implicit Places using invariants in 15 ms returned []
[2023-04-07 03:22:27] [INFO ] Invariant cache hit.
[2023-04-07 03:22:27] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 03:22:27] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2023-04-07 03:22:27] [INFO ] Invariant cache hit.
[2023-04-07 03:22:27] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 72 ms. Remains : 22/22 places, 22/22 transitions.
Stuttering acceptance computed with spot in 125 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), true]
Running random walk in product with property : CryptoMiner-COL-D10N000-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ (ADD s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21) (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10)), p1:(LEQ 1 (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 172 ms.
Product exploration explored 100000 steps with 50000 reset in 71 ms.
Computed a total of 11 stabilizing places and 11 stable transitions
Graph (complete) has 52 edges and 22 vertex of which 21 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 11 stabilizing places and 11 stable transitions
Detected a total of 11/22 stabilizing places and 11/22 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), true, (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 14 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CryptoMiner-COL-D10N000-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CryptoMiner-COL-D10N000-LTLCardinality-03 finished in 470 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(p0))||G(p1))))'
Support contains 22 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2023-04-07 03:22:28] [INFO ] Invariant cache hit.
[2023-04-07 03:22:28] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-04-07 03:22:28] [INFO ] Invariant cache hit.
[2023-04-07 03:22:28] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 03:22:28] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2023-04-07 03:22:28] [INFO ] Invariant cache hit.
[2023-04-07 03:22:28] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 79 ms. Remains : 22/22 places, 22/22 transitions.
Stuttering acceptance computed with spot in 146 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : CryptoMiner-COL-D10N000-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(OR (LEQ (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10) (ADD s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21)) (LEQ 3 (ADD s11 s12 s13 s14 s15 s16 s17 s18 s19 s20...], 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]]
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 1 ms.
FORMULA CryptoMiner-COL-D10N000-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-COL-D10N000-LTLCardinality-05 finished in 239 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 11 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 22/22 transitions.
Applied a total of 0 rules in 7 ms. Remains 22 /22 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2023-04-07 03:22:28] [INFO ] Invariant cache hit.
[2023-04-07 03:22:28] [INFO ] Implicit Places using invariants in 16 ms returned []
[2023-04-07 03:22:28] [INFO ] Invariant cache hit.
[2023-04-07 03:22:28] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 03:22:28] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2023-04-07 03:22:28] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 03:22:28] [INFO ] Invariant cache hit.
[2023-04-07 03:22:28] [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 84 ms. Remains : 22/22 places, 22/22 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CryptoMiner-COL-D10N000-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 1 (ADD s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 0 ms.
FORMULA CryptoMiner-COL-D10N000-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-COL-D10N000-LTLCardinality-06 finished in 171 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(!p0)&&G((p1||(p1 U p2)))))'
Support contains 22 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 22 /22 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2023-04-07 03:22:28] [INFO ] Invariant cache hit.
[2023-04-07 03:22:28] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-04-07 03:22:28] [INFO ] Invariant cache hit.
[2023-04-07 03:22:28] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 03:22:28] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2023-04-07 03:22:28] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 03:22:28] [INFO ] Invariant cache hit.
[2023-04-07 03:22:28] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 81 ms. Remains : 22/22 places, 22/22 transitions.
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p1) (NOT p2)), true, (OR p0 (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : CryptoMiner-COL-D10N000-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(OR p1 p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(OR (AND (NOT p0) p1) (AND (NOT p0) p2)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(OR (AND p0 p1) (AND p0 p2)), acceptance={0} source=2 dest: 2}]], initial=2, aps=[p1:(LEQ 1 (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10)), p2:(LEQ 2 (ADD s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21)), p0:(LEQ (ADD s11 s12 s13 s14 s15 s16 s17...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 30 steps with 1 reset in 1 ms.
FORMULA CryptoMiner-COL-D10N000-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-COL-D10N000-LTLCardinality-07 finished in 186 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(G(p0)) U (!p0 U G(p1)))))'
Support contains 22 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2023-04-07 03:22:28] [INFO ] Invariant cache hit.
[2023-04-07 03:22:28] [INFO ] Implicit Places using invariants in 14 ms returned []
[2023-04-07 03:22:28] [INFO ] Invariant cache hit.
[2023-04-07 03:22:28] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 03:22:28] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2023-04-07 03:22:28] [INFO ] Invariant cache hit.
[2023-04-07 03:22:28] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65 ms. Remains : 22/22 places, 22/22 transitions.
Stuttering acceptance computed with spot in 143 ms :[(NOT p1), (NOT p1), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CryptoMiner-COL-D10N000-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 2}, { cond=(AND p1 p0), acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(LEQ 1 (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10)), p0:(LEQ (ADD s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21) (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 22 steps with 0 reset in 0 ms.
FORMULA CryptoMiner-COL-D10N000-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-COL-D10N000-LTLCardinality-14 finished in 225 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X((p0||X(p0)))))'
Support contains 22 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 22/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2023-04-07 03:22:28] [INFO ] Invariant cache hit.
[2023-04-07 03:22:28] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-04-07 03:22:28] [INFO ] Invariant cache hit.
[2023-04-07 03:22:29] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 03:22:29] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2023-04-07 03:22:29] [INFO ] Invariant cache hit.
[2023-04-07 03:22:29] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 83 ms. Remains : 22/22 places, 22/22 transitions.
Stuttering acceptance computed with spot in 165 ms :[(NOT p0), true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CryptoMiner-COL-D10N000-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 3}, { cond=p0, acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}]], initial=0, aps=[p0:(LEQ (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10) (ADD s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21))], 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, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 1 reset in 0 ms.
FORMULA CryptoMiner-COL-D10N000-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-COL-D10N000-LTLCardinality-15 finished in 268 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X(X(G(p1)))))'
Found a Lengthening insensitive property : CryptoMiner-COL-D10N000-LTLCardinality-02
Stuttering acceptance computed with spot in 145 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 22 out of 22 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 22/22 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 22 /22 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2023-04-07 03:22:29] [INFO ] Invariant cache hit.
[2023-04-07 03:22:29] [INFO ] Implicit Places using invariants in 16 ms returned []
[2023-04-07 03:22:29] [INFO ] Invariant cache hit.
[2023-04-07 03:22:29] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 03:22:29] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2023-04-07 03:22:29] [INFO ] Invariant cache hit.
[2023-04-07 03:22:29] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 76 ms. Remains : 22/22 places, 22/22 transitions.
Running random walk in product with property : CryptoMiner-COL-D10N000-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(LEQ (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10) (ADD s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21)), p1:(AND (OR (LEQ 3 (ADD s11 s12 s13 s14 s15 s16 s17 s1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 14342 reset in 89 ms.
Product exploration explored 100000 steps with 14342 reset in 85 ms.
Computed a total of 11 stabilizing places and 11 stable transitions
Graph (complete) has 52 edges and 22 vertex of which 21 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 11 stabilizing places and 11 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 2 factoid took 155 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT 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 : [(AND (NOT p0) (NOT p1)), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F p0)]
Knowledge based reduction with 2 factoid took 154 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
[2023-04-07 03:22:30] [INFO ] Invariant cache hit.
[2023-04-07 03:22:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 03:22:30] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2023-04-07 03:22:30] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 03:22:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 03:22:30] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2023-04-07 03:22:30] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 03:22:30] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2023-04-07 03:22:30] [INFO ] Computed and/alt/rep : 20/30/20 causal constraints (skipped 0 transitions) in 1 ms.
[2023-04-07 03:22:30] [INFO ] Added : 9 causal constraints over 2 iterations in 24 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 22 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 22/22 transitions.
Applied a total of 0 rules in 3 ms. Remains 22 /22 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2023-04-07 03:22:30] [INFO ] Invariant cache hit.
[2023-04-07 03:22:30] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-04-07 03:22:30] [INFO ] Invariant cache hit.
[2023-04-07 03:22:30] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 03:22:30] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2023-04-07 03:22:30] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 03:22:30] [INFO ] Invariant cache hit.
[2023-04-07 03:22:30] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 97 ms. Remains : 22/22 places, 22/22 transitions.
Computed a total of 11 stabilizing places and 11 stable transitions
Graph (complete) has 52 edges and 22 vertex of which 21 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 11 stabilizing places and 11 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 229 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT 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 : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 238 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
[2023-04-07 03:22:30] [INFO ] Invariant cache hit.
[2023-04-07 03:22:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 03:22:31] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-04-07 03:22:31] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 03:22:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 03:22:31] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2023-04-07 03:22:31] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 03:22:31] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2023-04-07 03:22:31] [INFO ] Computed and/alt/rep : 20/30/20 causal constraints (skipped 0 transitions) in 2 ms.
[2023-04-07 03:22:31] [INFO ] Added : 9 causal constraints over 2 iterations in 9 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Product exploration explored 100000 steps with 14283 reset in 80 ms.
Product exploration explored 100000 steps with 14212 reset in 87 ms.
Support contains 22 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2023-04-07 03:22:31] [INFO ] Invariant cache hit.
[2023-04-07 03:22:31] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-04-07 03:22:31] [INFO ] Invariant cache hit.
[2023-04-07 03:22:31] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 03:22:31] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2023-04-07 03:22:31] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 03:22:31] [INFO ] Invariant cache hit.
[2023-04-07 03:22:31] [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 75 ms. Remains : 22/22 places, 22/22 transitions.
Treatment of property CryptoMiner-COL-D10N000-LTLCardinality-02 finished in 2154 ms.
[2023-04-07 03:22:31] [INFO ] Flatten gal took : 2 ms
[2023-04-07 03:22:31] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-04-07 03:22:31] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 22 places, 22 transitions and 64 arcs took 0 ms.
Total runtime 8034 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT CryptoMiner-COL-D10N000
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/374
LTLCardinality

FORMULA CryptoMiner-COL-D10N000-LTLCardinality-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1680837752553

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/374/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/374/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/374/LTLCardinality.xml
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: LAUNCH task # 1 (type EXCL) for 0 CryptoMiner-COL-D10N000-LTLCardinality-02
lola: time limit : 3600 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for CryptoMiner-COL-D10N000-LTLCardinality-02
lola: result : true
lola: markings : 22
lola: fired transitions : 29
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CryptoMiner-COL-D10N000-LTLCardinality-02: LTL true LTL model checker


Time elapsed: 0 secs. Pages in use: 1

Sequence of Actions to be Executed by the VM

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

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

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

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