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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
460.632 10930.00 18032.00 479.70 FFFFFFFFFFTFFTTT 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-167987244800075.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-D03N000, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r519-tall-167987244800075
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 428K
-rw-r--r-- 1 mcc users 8.4K Mar 23 15:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K Mar 23 15:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Mar 23 15:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Mar 23 15:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 23 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 23 07:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 23 07:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 23 07:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 9.8K Mar 23 15:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 92K Mar 23 15:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Mar 23 15:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Mar 23 15:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 23 07:06 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 23 07:06 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.2K 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-D03N000-LTLCardinality-00
FORMULA_NAME CryptoMiner-COL-D03N000-LTLCardinality-01
FORMULA_NAME CryptoMiner-COL-D03N000-LTLCardinality-02
FORMULA_NAME CryptoMiner-COL-D03N000-LTLCardinality-03
FORMULA_NAME CryptoMiner-COL-D03N000-LTLCardinality-04
FORMULA_NAME CryptoMiner-COL-D03N000-LTLCardinality-05
FORMULA_NAME CryptoMiner-COL-D03N000-LTLCardinality-06
FORMULA_NAME CryptoMiner-COL-D03N000-LTLCardinality-07
FORMULA_NAME CryptoMiner-COL-D03N000-LTLCardinality-08
FORMULA_NAME CryptoMiner-COL-D03N000-LTLCardinality-09
FORMULA_NAME CryptoMiner-COL-D03N000-LTLCardinality-10
FORMULA_NAME CryptoMiner-COL-D03N000-LTLCardinality-11
FORMULA_NAME CryptoMiner-COL-D03N000-LTLCardinality-12
FORMULA_NAME CryptoMiner-COL-D03N000-LTLCardinality-13
FORMULA_NAME CryptoMiner-COL-D03N000-LTLCardinality-14
FORMULA_NAME CryptoMiner-COL-D03N000-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1680834771613

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-D03N000
Applying reductions before tool lola
Invoking reducer
Running Version 202304061127
[2023-04-07 02:32:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-04-07 02:32:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 02:32:53] [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 02:32:53] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-04-07 02:32:53] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 414 ms
[2023-04-07 02:32:53] [INFO ] Imported 2 HL places and 4 HL transitions for a total of 8 PT places and 16.0 transition bindings in 16 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
[2023-04-07 02:32:53] [INFO ] Built PT skeleton of HLPN with 2 places and 4 transitions 10 arcs in 4 ms.
[2023-04-07 02:32:53] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 3 formulas.
FORMULA CryptoMiner-COL-D03N000-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CryptoMiner-COL-D03N000-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CryptoMiner-COL-D03N000-LTLCardinality-14 TRUE 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 3329 resets, run finished after 292 ms. (steps per millisecond=34 ) properties (out of 12) seen :8
Incomplete Best-First random walk after 10001 steps, including 765 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-04-07 02:32:54] [INFO ] Flow matrix only has 3 transitions (discarded 1 similar events)
// Phase 1: matrix 3 rows 2 cols
[2023-04-07 02:32:54] [INFO ] Computed 0 invariants in 4 ms
[2023-04-07 02:32:54] [INFO ] After 124ms 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-D03N000-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CryptoMiner-COL-D03N000-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CryptoMiner-COL-D03N000-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-04-07 02:32:54] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2023-04-07 02:32:54] [INFO ] Flatten gal took : 11 ms
[2023-04-07 02:32:54] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
FORMULA CryptoMiner-COL-D03N000-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CryptoMiner-COL-D03N000-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CryptoMiner-COL-D03N000-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-04-07 02:32:54] [INFO ] Flatten gal took : 1 ms
Arc [1:1*[(MOD (ADD $x 1) 4)]] contains successor/predecessor on variables of sort CD
[2023-04-07 02:32:54] [INFO ] Unfolded HLPN to a Petri net with 8 places and 8 transitions 22 arcs in 4 ms.
[2023-04-07 02:32:54] [INFO ] Unfolded 7 HLPN properties in 0 ms.
Support contains 8 out of 8 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8/8 places, 8/8 transitions.
Applied a total of 0 rules in 6 ms. Remains 8 /8 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 8 cols
[2023-04-07 02:32:54] [INFO ] Computed 0 invariants in 1 ms
[2023-04-07 02:32:54] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-04-07 02:32:54] [INFO ] Invariant cache hit.
[2023-04-07 02:32:54] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 02:32:54] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
[2023-04-07 02:32:54] [INFO ] Invariant cache hit.
[2023-04-07 02:32:54] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 94 ms. Remains : 8/8 places, 8/8 transitions.
Support contains 8 out of 8 places after structural reductions.
[2023-04-07 02:32:54] [INFO ] Flatten gal took : 1 ms
[2023-04-07 02:32:54] [INFO ] Flatten gal took : 2 ms
[2023-04-07 02:32:54] [INFO ] Input system was already deterministic with 8 transitions.
Incomplete random walk after 10000 steps, including 1425 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 7) seen :6
Incomplete Best-First random walk after 10001 steps, including 597 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-04-07 02:32:54] [INFO ] Invariant cache hit.
[2023-04-07 02:32:54] [INFO ] After 31ms 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 7 simplifications.
Computed a total of 4 stabilizing places and 4 stable transitions
Graph (complete) has 17 edges and 8 vertex of which 7 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' '!(X(X(F(p0))))'
Support contains 8 out of 8 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8/8 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-04-07 02:32:54] [INFO ] Invariant cache hit.
[2023-04-07 02:32:54] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-04-07 02:32:54] [INFO ] Invariant cache hit.
[2023-04-07 02:32:55] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 02:32:55] [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 02:32:55] [INFO ] Invariant cache hit.
[2023-04-07 02:32:55] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 76 ms. Remains : 8/8 places, 8/8 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 243 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CryptoMiner-COL-D03N000-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(GT (ADD s0 s1 s2 s3) (ADD s4 s5 s6 s7))], 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]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 3 ms.
FORMULA CryptoMiner-COL-D03N000-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-COL-D03N000-LTLCardinality-00 finished in 373 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 8 out of 8 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8/8 places, 8/8 transitions.
Applied a total of 0 rules in 3 ms. Remains 8 /8 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-04-07 02:32:55] [INFO ] Invariant cache hit.
[2023-04-07 02:32:55] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-04-07 02:32:55] [INFO ] Invariant cache hit.
[2023-04-07 02:32:55] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 02:32:55] [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 02:32:55] [INFO ] Redundant transitions in 1 ms returned []
[2023-04-07 02:32:55] [INFO ] Invariant cache hit.
[2023-04-07 02:32:55] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 84 ms. Remains : 8/8 places, 8/8 transitions.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Running random walk in product with property : CryptoMiner-COL-D03N000-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GT 1 (ADD s4 s5 s6 s7)) (LEQ (ADD s4 s5 s6 s7) (ADD s0 s1 s2 s3)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 0 ms.
FORMULA CryptoMiner-COL-D03N000-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-COL-D03N000-LTLCardinality-02 finished in 129 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 8 out of 8 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8/8 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-04-07 02:32:55] [INFO ] Invariant cache hit.
[2023-04-07 02:32:55] [INFO ] Implicit Places using invariants in 13 ms returned []
[2023-04-07 02:32:55] [INFO ] Invariant cache hit.
[2023-04-07 02:32:55] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 02:32:55] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
[2023-04-07 02:32:55] [INFO ] Invariant cache hit.
[2023-04-07 02:32:55] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60 ms. Remains : 8/8 places, 8/8 transitions.
Stuttering acceptance computed with spot in 127 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CryptoMiner-COL-D03N000-LTLCardinality-03 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:(AND (GT 2 (ADD s4 s5 s6 s7)) (GT 2 (ADD s0 s1 s2 s3)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA CryptoMiner-COL-D03N000-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-COL-D03N000-LTLCardinality-03 finished in 198 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 4 out of 8 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8/8 places, 8/8 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 7 transition count 8
Applied a total of 1 rules in 1 ms. Remains 7 /8 variables (removed 1) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 7 cols
[2023-04-07 02:32:55] [INFO ] Computed 0 invariants in 0 ms
[2023-04-07 02:32:55] [INFO ] Implicit Places using invariants in 16 ms returned []
[2023-04-07 02:32:55] [INFO ] Invariant cache hit.
[2023-04-07 02:32:55] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 02:32:55] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2023-04-07 02:32:55] [INFO ] Invariant cache hit.
[2023-04-07 02:32:55] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 7/8 places, 8/8 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 71 ms. Remains : 7/8 places, 8/8 transitions.
Stuttering acceptance computed with spot in 74 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CryptoMiner-COL-D03N000-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ 1 (ADD s0 s1 s2 s3))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 8 steps with 0 reset in 0 ms.
FORMULA CryptoMiner-COL-D03N000-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-COL-D03N000-LTLCardinality-07 finished in 154 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(!p0))'
Support contains 8 out of 8 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8/8 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 8 cols
[2023-04-07 02:32:55] [INFO ] Computed 0 invariants in 0 ms
[2023-04-07 02:32:55] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-04-07 02:32:55] [INFO ] Invariant cache hit.
[2023-04-07 02:32:55] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 02:32:55] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2023-04-07 02:32:55] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 02:32:55] [INFO ] Invariant cache hit.
[2023-04-07 02:32:55] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 83 ms. Remains : 8/8 places, 8/8 transitions.
Stuttering acceptance computed with spot in 31 ms :[p0]
Running random walk in product with property : CryptoMiner-COL-D03N000-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT (ADD s0 s1 s2 s3) (ADD s4 s5 s6 s7))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 28527 reset in 140 ms.
Product exploration explored 100000 steps with 28458 reset in 105 ms.
Computed a total of 4 stabilizing places and 4 stable transitions
Graph (complete) has 17 edges and 8 vertex of which 7 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 4 stabilizing places and 4 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 1 factoid took 137 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 :[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 p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 170 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 30 ms :[p0]
Stuttering acceptance computed with spot in 24 ms :[p0]
[2023-04-07 02:32:56] [INFO ] Invariant cache hit.
[2023-04-07 02:32:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 02:32:56] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-04-07 02:32:56] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 02:32:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 02:32:56] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2023-04-07 02:32:56] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 02:32:56] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2023-04-07 02:32:56] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 4 ms.
[2023-04-07 02:32:56] [INFO ] Added : 2 causal constraints over 1 iterations in 11 ms. Result :sat
Could not prove EG p0
Support contains 8 out of 8 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8/8 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 8 /8 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-04-07 02:32:56] [INFO ] Invariant cache hit.
[2023-04-07 02:32:56] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-04-07 02:32:56] [INFO ] Invariant cache hit.
[2023-04-07 02:32:56] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 02:32:56] [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 02:32:56] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 02:32:56] [INFO ] Invariant cache hit.
[2023-04-07 02:32:56] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 80 ms. Remains : 8/8 places, 8/8 transitions.
Computed a total of 4 stabilizing places and 4 stable transitions
Graph (complete) has 17 edges and 8 vertex of which 7 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 4 stabilizing places and 4 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 1 factoid took 259 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 122 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 p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 153 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 38 ms :[p0]
Stuttering acceptance computed with spot in 29 ms :[p0]
[2023-04-07 02:32:57] [INFO ] Invariant cache hit.
[2023-04-07 02:32:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 02:32:57] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2023-04-07 02:32:57] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 02:32:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 02:32:57] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-04-07 02:32:57] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 02:32:57] [INFO ] [Nat]Added 3 Read/Feed constraints in 0 ms returned sat
[2023-04-07 02:32:57] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 1 ms.
[2023-04-07 02:32:57] [INFO ] Added : 2 causal constraints over 1 iterations in 4 ms. Result :sat
Could not prove EG p0
Stuttering acceptance computed with spot in 28 ms :[p0]
Product exploration explored 100000 steps with 28504 reset in 86 ms.
Product exploration explored 100000 steps with 28589 reset in 75 ms.
Support contains 8 out of 8 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8/8 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-04-07 02:32:57] [INFO ] Invariant cache hit.
[2023-04-07 02:32:57] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-04-07 02:32:57] [INFO ] Invariant cache hit.
[2023-04-07 02:32:57] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 02:32:57] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2023-04-07 02:32:57] [INFO ] Redundant transitions in 1 ms returned []
[2023-04-07 02:32:57] [INFO ] Invariant cache hit.
[2023-04-07 02:32:57] [INFO ] Dead Transitions using invariants and state equation in 16 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 63 ms. Remains : 8/8 places, 8/8 transitions.
Treatment of property CryptoMiner-COL-D03N000-LTLCardinality-10 finished in 1913 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 8 out of 8 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8/8 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 8 /8 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-04-07 02:32:57] [INFO ] Invariant cache hit.
[2023-04-07 02:32:57] [INFO ] Implicit Places using invariants in 14 ms returned []
[2023-04-07 02:32:57] [INFO ] Invariant cache hit.
[2023-04-07 02:32:57] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 02:32:57] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 33 ms to find 0 implicit places.
[2023-04-07 02:32:57] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 02:32:57] [INFO ] Invariant cache hit.
[2023-04-07 02:32:57] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 59 ms. Remains : 8/8 places, 8/8 transitions.
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CryptoMiner-COL-D03N000-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT (ADD s4 s5 s6 s7) (ADD s0 s1 s2 s3))], 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 7 steps with 1 reset in 1 ms.
FORMULA CryptoMiner-COL-D03N000-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-COL-D03N000-LTLCardinality-12 finished in 157 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(X((X(G(F(X(X(p0)))))||(X(!p1) U p0)))))'
Support contains 8 out of 8 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8/8 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-04-07 02:32:57] [INFO ] Invariant cache hit.
[2023-04-07 02:32:57] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-04-07 02:32:57] [INFO ] Invariant cache hit.
[2023-04-07 02:32:57] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 02:32:57] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2023-04-07 02:32:57] [INFO ] Invariant cache hit.
[2023-04-07 02:32:57] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 80 ms. Remains : 8/8 places, 8/8 transitions.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CryptoMiner-COL-D03N000-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ (ADD s0 s1 s2 s3) (ADD s4 s5 s6 s7))], 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 28634 reset in 64 ms.
Product exploration explored 100000 steps with 28532 reset in 80 ms.
Computed a total of 4 stabilizing places and 4 stable transitions
Graph (complete) has 17 edges and 8 vertex of which 7 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 4 stabilizing places and 4 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 1 factoid took 137 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 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 177 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 28 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
[2023-04-07 02:32:58] [INFO ] Invariant cache hit.
[2023-04-07 02:32:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 02:32:58] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2023-04-07 02:32:58] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 02:32:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 02:32:58] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2023-04-07 02:32:58] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 02:32:58] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2023-04-07 02:32:58] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 1 ms.
[2023-04-07 02:32:58] [INFO ] Added : 2 causal constraints over 1 iterations in 6 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 8 out of 8 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8/8 places, 8/8 transitions.
Applied a total of 0 rules in 2 ms. Remains 8 /8 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-04-07 02:32:58] [INFO ] Invariant cache hit.
[2023-04-07 02:32:58] [INFO ] Implicit Places using invariants in 16 ms returned []
[2023-04-07 02:32:58] [INFO ] Invariant cache hit.
[2023-04-07 02:32:58] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 02:32:58] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2023-04-07 02:32:58] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 02:32:58] [INFO ] Invariant cache hit.
[2023-04-07 02:32:58] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 78 ms. Remains : 8/8 places, 8/8 transitions.
Computed a total of 4 stabilizing places and 4 stable transitions
Graph (complete) has 17 edges and 8 vertex of which 7 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 4 stabilizing places and 4 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 148 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 35 ms :[(NOT p0)]
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=4 )
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 168 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 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
[2023-04-07 02:32:59] [INFO ] Invariant cache hit.
[2023-04-07 02:32:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 02:32:59] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2023-04-07 02:32:59] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 02:32:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 02:32:59] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-04-07 02:32:59] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 02:32:59] [INFO ] [Nat]Added 3 Read/Feed constraints in 3 ms returned sat
[2023-04-07 02:32:59] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 1 ms.
[2023-04-07 02:32:59] [INFO ] Added : 2 causal constraints over 1 iterations in 5 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Product exploration explored 100000 steps with 28661 reset in 75 ms.
Product exploration explored 100000 steps with 28572 reset in 61 ms.
Support contains 8 out of 8 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8/8 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-04-07 02:32:59] [INFO ] Invariant cache hit.
[2023-04-07 02:32:59] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-04-07 02:32:59] [INFO ] Invariant cache hit.
[2023-04-07 02:32:59] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 02:32:59] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
[2023-04-07 02:32:59] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 02:32:59] [INFO ] Invariant cache hit.
[2023-04-07 02:32:59] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 98 ms. Remains : 8/8 places, 8/8 transitions.
Treatment of property CryptoMiner-COL-D03N000-LTLCardinality-15 finished in 1781 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))'
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(X((X(G(F(X(X(p0)))))||(X(!p1) U p0)))))'
Found a Shortening insensitive property : CryptoMiner-COL-D03N000-LTLCardinality-15
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Support contains 8 out of 8 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 8/8 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-04-07 02:32:59] [INFO ] Invariant cache hit.
[2023-04-07 02:32:59] [INFO ] Implicit Places using invariants in 16 ms returned []
[2023-04-07 02:32:59] [INFO ] Invariant cache hit.
[2023-04-07 02:33:00] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 02:33:00] [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 02:33:00] [INFO ] Invariant cache hit.
[2023-04-07 02:33:00] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 68 ms. Remains : 8/8 places, 8/8 transitions.
Running random walk in product with property : CryptoMiner-COL-D03N000-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ (ADD s0 s1 s2 s3) (ADD s4 s5 s6 s7))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 28566 reset in 48 ms.
Product exploration explored 100000 steps with 28584 reset in 55 ms.
Computed a total of 4 stabilizing places and 4 stable transitions
Graph (complete) has 17 edges and 8 vertex of which 7 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 4 stabilizing places and 4 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 1 factoid took 134 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=4 )
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 180 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 38 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
[2023-04-07 02:33:00] [INFO ] Invariant cache hit.
[2023-04-07 02:33:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 02:33:00] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-04-07 02:33:00] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 02:33:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 02:33:00] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-04-07 02:33:00] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 02:33:00] [INFO ] [Nat]Added 3 Read/Feed constraints in 0 ms returned sat
[2023-04-07 02:33:00] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 2 ms.
[2023-04-07 02:33:00] [INFO ] Added : 2 causal constraints over 1 iterations in 4 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 8 out of 8 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8/8 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 8 /8 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-04-07 02:33:00] [INFO ] Invariant cache hit.
[2023-04-07 02:33:00] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-04-07 02:33:00] [INFO ] Invariant cache hit.
[2023-04-07 02:33:00] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 02:33:00] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
[2023-04-07 02:33:00] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 02:33:00] [INFO ] Invariant cache hit.
[2023-04-07 02:33:00] [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 73 ms. Remains : 8/8 places, 8/8 transitions.
Computed a total of 4 stabilizing places and 4 stable transitions
Graph (complete) has 17 edges and 8 vertex of which 7 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 4 stabilizing places and 4 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 136 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)]
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=4 )
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 165 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 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
[2023-04-07 02:33:01] [INFO ] Invariant cache hit.
[2023-04-07 02:33:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 02:33:01] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2023-04-07 02:33:01] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 02:33:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 02:33:01] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-04-07 02:33:01] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 02:33:01] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2023-04-07 02:33:01] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 1 ms.
[2023-04-07 02:33:01] [INFO ] Added : 2 causal constraints over 1 iterations in 3 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Product exploration explored 100000 steps with 28487 reset in 51 ms.
Product exploration explored 100000 steps with 28701 reset in 51 ms.
Support contains 8 out of 8 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8/8 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-04-07 02:33:01] [INFO ] Invariant cache hit.
[2023-04-07 02:33:01] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-04-07 02:33:01] [INFO ] Invariant cache hit.
[2023-04-07 02:33:01] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 02:33:01] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2023-04-07 02:33:01] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 02:33:01] [INFO ] Invariant cache hit.
[2023-04-07 02:33:01] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 72 ms. Remains : 8/8 places, 8/8 transitions.
Treatment of property CryptoMiner-COL-D03N000-LTLCardinality-15 finished in 1592 ms.
[2023-04-07 02:33:01] [INFO ] Flatten gal took : 4 ms
[2023-04-07 02:33:01] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2023-04-07 02:33:01] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 8 places, 8 transitions and 22 arcs took 0 ms.
Total runtime 8379 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT CryptoMiner-COL-D03N000
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/376
LTLCardinality

FORMULA CryptoMiner-COL-D03N000-LTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CryptoMiner-COL-D03N000-LTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1680834782543

--------------------
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/376/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/376/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/376/LTLCardinality.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:355
lola: rewrite Frontend/Parser/formula_rewrite.k:355
lola: rewrite Frontend/Parser/formula_rewrite.k:352
lola: rewrite Frontend/Parser/formula_rewrite.k:352
lola: rewrite Frontend/Parser/formula_rewrite.k:376
lola: rewrite Frontend/Parser/formula_rewrite.k:376
lola: rewrite Frontend/Parser/formula_rewrite.k:376
lola: rewrite Frontend/Parser/formula_rewrite.k:355
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: LAUNCH task # 6 (type EXCL) for 0 CryptoMiner-COL-D03N000-LTLCardinality-10
lola: time limit : 1800 sec
lola: memory limit: 32 pages
lola: FINISHED task # 6 (type EXCL) for CryptoMiner-COL-D03N000-LTLCardinality-10
lola: result : false
lola: markings : 4
lola: fired transitions : 3
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 4 (type EXCL) for 3 CryptoMiner-COL-D03N000-LTLCardinality-15
lola: time limit : 3600 sec
lola: memory limit: 32 pages
lola: FINISHED task # 4 (type EXCL) for CryptoMiner-COL-D03N000-LTLCardinality-15
lola: result : true
lola: markings : 15
lola: fired transitions : 18
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-D03N000-LTLCardinality-10: F true state space / EG
CryptoMiner-COL-D03N000-LTLCardinality-15: 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-D03N000"
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-D03N000, 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-167987244800075"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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