About the Execution of ITS-Tools for CryptoMiner-PT-D20N100
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 4438.556 | 3600000.00 | 4735298.00 | 9133.70 | FFFFFTFTFTTF??FF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r517-tall-167987243600212.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is CryptoMiner-PT-D20N100, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r517-tall-167987243600212
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 884K
-rw-r--r-- 1 mcc users 24K Mar 23 15:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 146K Mar 23 15:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 15K Mar 23 15:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 98K Mar 23 15:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 17K Mar 23 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Mar 23 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K Mar 23 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 26K Mar 23 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 28K Mar 23 15:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 160K Mar 23 15:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 29K Mar 23 15:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 191K Mar 23 15:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 23 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 9.3K Mar 23 07:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 26 22:42 equiv_col
-rw-r--r-- 1 mcc users 8 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 27K Mar 31 16:48 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME CryptoMiner-PT-D20N100-LTLFireability-00
FORMULA_NAME CryptoMiner-PT-D20N100-LTLFireability-01
FORMULA_NAME CryptoMiner-PT-D20N100-LTLFireability-02
FORMULA_NAME CryptoMiner-PT-D20N100-LTLFireability-03
FORMULA_NAME CryptoMiner-PT-D20N100-LTLFireability-04
FORMULA_NAME CryptoMiner-PT-D20N100-LTLFireability-05
FORMULA_NAME CryptoMiner-PT-D20N100-LTLFireability-06
FORMULA_NAME CryptoMiner-PT-D20N100-LTLFireability-07
FORMULA_NAME CryptoMiner-PT-D20N100-LTLFireability-08
FORMULA_NAME CryptoMiner-PT-D20N100-LTLFireability-09
FORMULA_NAME CryptoMiner-PT-D20N100-LTLFireability-10
FORMULA_NAME CryptoMiner-PT-D20N100-LTLFireability-11
FORMULA_NAME CryptoMiner-PT-D20N100-LTLFireability-12
FORMULA_NAME CryptoMiner-PT-D20N100-LTLFireability-13
FORMULA_NAME CryptoMiner-PT-D20N100-LTLFireability-14
FORMULA_NAME CryptoMiner-PT-D20N100-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1680888437855
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CryptoMiner-PT-D20N100
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2023-04-07 17:27:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-04-07 17:27:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 17:27:19] [INFO ] Load time of PNML (sax parser for PT used): 32 ms
[2023-04-07 17:27:19] [INFO ] Transformed 63 places.
[2023-04-07 17:27:19] [INFO ] Transformed 63 transitions.
[2023-04-07 17:27:19] [INFO ] Parsed PT model containing 63 places and 63 transitions and 187 arcs in 92 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA CryptoMiner-PT-D20N100-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CryptoMiner-PT-D20N100-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CryptoMiner-PT-D20N100-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CryptoMiner-PT-D20N100-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CryptoMiner-PT-D20N100-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 42 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 63/63 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 62 transition count 63
Applied a total of 1 rules in 11 ms. Remains 62 /63 variables (removed 1) and now considering 63/63 (removed 0) transitions.
// Phase 1: matrix 63 rows 62 cols
[2023-04-07 17:27:19] [INFO ] Computed 0 invariants in 11 ms
[2023-04-07 17:27:19] [INFO ] Implicit Places using invariants in 134 ms returned []
[2023-04-07 17:27:19] [INFO ] Invariant cache hit.
[2023-04-07 17:27:19] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 17:27:19] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 257 ms to find 0 implicit places.
[2023-04-07 17:27:19] [INFO ] Invariant cache hit.
[2023-04-07 17:27:19] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 62/63 places, 63/63 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 321 ms. Remains : 62/63 places, 63/63 transitions.
Support contains 42 out of 62 places after structural reductions.
[2023-04-07 17:27:20] [INFO ] Flatten gal took : 18 ms
[2023-04-07 17:27:20] [INFO ] Flatten gal took : 7 ms
[2023-04-07 17:27:20] [INFO ] Input system was already deterministic with 63 transitions.
Incomplete random walk after 10064 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=228 ) properties (out of 18) seen :12
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-04-07 17:27:20] [INFO ] Invariant cache hit.
[2023-04-07 17:27:20] [INFO ] After 85ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:2
[2023-04-07 17:27:20] [INFO ] After 64ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :0
Fused 3 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 3 atomic propositions for a total of 11 simplifications.
FORMULA CryptoMiner-PT-D20N100-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 40 stabilizing places and 41 stable transitions
Graph (complete) has 162 edges and 62 vertex of which 22 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.2 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0&&F(p1)))))'
Support contains 3 out of 62 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 63/63 transitions.
Applied a total of 0 rules in 3 ms. Remains 62 /62 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2023-04-07 17:27:20] [INFO ] Invariant cache hit.
[2023-04-07 17:27:20] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-04-07 17:27:20] [INFO ] Invariant cache hit.
[2023-04-07 17:27:20] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 17:27:20] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
[2023-04-07 17:27:20] [INFO ] Invariant cache hit.
[2023-04-07 17:27:20] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 134 ms. Remains : 62/62 places, 63/63 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 233 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : CryptoMiner-PT-D20N100-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (LT s0 1) (LT s41 1)), p1:(LT s54 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA CryptoMiner-PT-D20N100-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-PT-D20N100-LTLFireability-01 finished in 412 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 2 out of 62 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 62/62 places, 63/63 transitions.
Applied a total of 0 rules in 11 ms. Remains 62 /62 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2023-04-07 17:27:21] [INFO ] Invariant cache hit.
[2023-04-07 17:27:21] [INFO ] Implicit Places using invariants in 47 ms returned []
[2023-04-07 17:27:21] [INFO ] Invariant cache hit.
[2023-04-07 17:27:21] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 17:27:21] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
[2023-04-07 17:27:21] [INFO ] Redundant transitions in 1 ms returned []
[2023-04-07 17:27:21] [INFO ] Invariant cache hit.
[2023-04-07 17:27:21] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 173 ms. Remains : 62/62 places, 63/63 transitions.
Stuttering acceptance computed with spot in 70 ms :[p0, p0]
Running random walk in product with property : CryptoMiner-PT-D20N100-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s0 1) (LT s41 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 293 ms.
Product exploration explored 100000 steps with 0 reset in 278 ms.
Computed a total of 40 stabilizing places and 41 stable transitions
Graph (complete) has 162 edges and 62 vertex of which 22 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.1 ms
Computed a total of 40 stabilizing places and 41 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 1 factoid took 171 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[p0, p0]
Finished random walk after 101 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=50 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F p0)]
Knowledge based reduction with 1 factoid took 141 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[p0, p0]
Stuttering acceptance computed with spot in 64 ms :[p0, p0]
Support contains 2 out of 62 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 62/62 places, 63/63 transitions.
Applied a total of 0 rules in 8 ms. Remains 62 /62 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2023-04-07 17:27:22] [INFO ] Invariant cache hit.
[2023-04-07 17:27:22] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-04-07 17:27:22] [INFO ] Invariant cache hit.
[2023-04-07 17:27:22] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 17:27:22] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
[2023-04-07 17:27:22] [INFO ] Redundant transitions in 1 ms returned []
[2023-04-07 17:27:22] [INFO ] Invariant cache hit.
[2023-04-07 17:27:22] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 128 ms. Remains : 62/62 places, 63/63 transitions.
Computed a total of 40 stabilizing places and 41 stable transitions
Graph (complete) has 162 edges and 62 vertex of which 22 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.1 ms
Computed a total of 40 stabilizing places and 41 stable transitions
Knowledge obtained : [(NOT 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 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[p0, 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 p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F p0)]
Knowledge based reduction with 1 factoid took 188 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 86 ms :[p0, p0]
Stuttering acceptance computed with spot in 62 ms :[p0, p0]
Stuttering acceptance computed with spot in 70 ms :[p0, p0]
Product exploration explored 100000 steps with 0 reset in 145 ms.
Product exploration explored 100000 steps with 0 reset in 184 ms.
Built C files in :
/tmp/ltsmin15687377232424415629
[2023-04-07 17:27:23] [INFO ] Computing symmetric may disable matrix : 63 transitions.
[2023-04-07 17:27:23] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-07 17:27:23] [INFO ] Computing symmetric may enable matrix : 63 transitions.
[2023-04-07 17:27:23] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-07 17:27:23] [INFO ] Computing Do-Not-Accords matrix : 63 transitions.
[2023-04-07 17:27:23] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-07 17:27:23] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15687377232424415629
Running compilation step : cd /tmp/ltsmin15687377232424415629;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 239 ms.
Running link step : cd /tmp/ltsmin15687377232424415629;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin15687377232424415629;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1789921136954773431.hoa' '--buchi-type=spotba'
LTSmin run took 416 ms.
FORMULA CryptoMiner-PT-D20N100-LTLFireability-02 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CryptoMiner-PT-D20N100-LTLFireability-02 finished in 3197 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 21 out of 62 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 63/63 transitions.
Applied a total of 0 rules in 1 ms. Remains 62 /62 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2023-04-07 17:27:24] [INFO ] Invariant cache hit.
[2023-04-07 17:27:24] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-04-07 17:27:24] [INFO ] Invariant cache hit.
[2023-04-07 17:27:24] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 17:27:24] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
[2023-04-07 17:27:24] [INFO ] Invariant cache hit.
[2023-04-07 17:27:24] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 127 ms. Remains : 62/62 places, 63/63 transitions.
Stuttering acceptance computed with spot in 72 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CryptoMiner-PT-D20N100-LTLFireability-04 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:(OR (GEQ s0 1) (GEQ s1 1) (GEQ s2 1) (GEQ s3 1) (GEQ s4 1) (GEQ s5 1) (GEQ s6 1) (GEQ s7 1) (GEQ s8 1) (GEQ s9 1) (GEQ s10 1) (GEQ s11 1) (GEQ s12 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 147 ms.
Product exploration explored 100000 steps with 0 reset in 179 ms.
Computed a total of 40 stabilizing places and 41 stable transitions
Graph (complete) has 162 edges and 62 vertex of which 22 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.1 ms
Computed a total of 40 stabilizing places and 41 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 76 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 46 ms :[true, (NOT p0)]
Finished random walk after 6845 steps, including 2 resets, run visited all 1 properties in 3 ms. (steps per millisecond=2281 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 4 factoid took 88 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CryptoMiner-PT-D20N100-LTLFireability-04 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CryptoMiner-PT-D20N100-LTLFireability-04 finished in 763 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 21 out of 62 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 63/63 transitions.
Applied a total of 0 rules in 2 ms. Remains 62 /62 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2023-04-07 17:27:25] [INFO ] Invariant cache hit.
[2023-04-07 17:27:25] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-04-07 17:27:25] [INFO ] Invariant cache hit.
[2023-04-07 17:27:25] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 17:27:25] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
[2023-04-07 17:27:25] [INFO ] Invariant cache hit.
[2023-04-07 17:27:25] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 167 ms. Remains : 62/62 places, 63/63 transitions.
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CryptoMiner-PT-D20N100-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (GEQ s0 1) (GEQ s1 1) (GEQ s2 1) (GEQ s3 1) (GEQ s4 1) (GEQ s5 1) (GEQ s6 1) (GEQ s7 1) (GEQ s8 1) (GEQ s9 1) (GEQ s10 1) (GEQ s11 1) (GEQ s12 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 120 ms.
Product exploration explored 100000 steps with 50000 reset in 115 ms.
Computed a total of 40 stabilizing places and 41 stable transitions
Graph (complete) has 162 edges and 62 vertex of which 22 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.1 ms
Computed a total of 40 stabilizing places and 41 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 18 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CryptoMiner-PT-D20N100-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CryptoMiner-PT-D20N100-LTLFireability-07 finished in 498 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))&&F(p1))))'
Support contains 3 out of 62 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 62/62 places, 63/63 transitions.
Applied a total of 0 rules in 9 ms. Remains 62 /62 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2023-04-07 17:27:25] [INFO ] Invariant cache hit.
[2023-04-07 17:27:25] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-04-07 17:27:25] [INFO ] Invariant cache hit.
[2023-04-07 17:27:25] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 17:27:25] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
[2023-04-07 17:27:25] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 17:27:25] [INFO ] Invariant cache hit.
[2023-04-07 17:27:25] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 150 ms. Remains : 62/62 places, 63/63 transitions.
Stuttering acceptance computed with spot in 101 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : CryptoMiner-PT-D20N100-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LT s0 1) (LT s41 1)), p1:(LT s18 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 142 ms.
Product exploration explored 100000 steps with 1 reset in 170 ms.
Computed a total of 40 stabilizing places and 41 stable transitions
Graph (complete) has 162 edges and 62 vertex of which 22 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.1 ms
Computed a total of 40 stabilizing places and 41 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (X p1))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 3 factoid took 168 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 190 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 617 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=308 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (X p1))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F p0), (F (NOT p1))]
Knowledge based reduction with 3 factoid took 330 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 117 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 108 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2023-04-07 17:27:27] [INFO ] Invariant cache hit.
[2023-04-07 17:27:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 17:27:27] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2023-04-07 17:27:27] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 17:27:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 17:27:27] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2023-04-07 17:27:27] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 17:27:27] [INFO ] [Nat]Added 20 Read/Feed constraints in 3 ms returned sat
[2023-04-07 17:27:27] [INFO ] Computed and/alt/rep : 60/100/60 causal constraints (skipped 0 transitions) in 4 ms.
[2023-04-07 17:27:27] [INFO ] Added : 0 causal constraints over 0 iterations in 13 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 3 out of 62 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 62/62 places, 63/63 transitions.
Applied a total of 0 rules in 4 ms. Remains 62 /62 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2023-04-07 17:27:27] [INFO ] Invariant cache hit.
[2023-04-07 17:27:27] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-04-07 17:27:27] [INFO ] Invariant cache hit.
[2023-04-07 17:27:27] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 17:27:27] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
[2023-04-07 17:27:27] [INFO ] Redundant transitions in 1 ms returned []
[2023-04-07 17:27:27] [INFO ] Invariant cache hit.
[2023-04-07 17:27:27] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 161 ms. Remains : 62/62 places, 63/63 transitions.
Computed a total of 40 stabilizing places and 41 stable transitions
Graph (complete) has 162 edges and 62 vertex of which 22 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.1 ms
Computed a total of 40 stabilizing places and 41 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (X p1))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 3 factoid took 128 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 92 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 746 steps, including 1 resets, run visited all 2 properties in 2 ms. (steps per millisecond=373 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (X p1))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F p0), (F (NOT p1))]
Knowledge based reduction with 3 factoid took 164 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 103 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 103 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2023-04-07 17:27:28] [INFO ] Invariant cache hit.
[2023-04-07 17:27:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 17:27:28] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2023-04-07 17:27:28] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 17:27:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 17:27:28] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2023-04-07 17:27:28] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 17:27:28] [INFO ] [Nat]Added 20 Read/Feed constraints in 7 ms returned sat
[2023-04-07 17:27:28] [INFO ] Computed and/alt/rep : 60/100/60 causal constraints (skipped 0 transitions) in 6 ms.
[2023-04-07 17:27:28] [INFO ] Added : 0 causal constraints over 0 iterations in 11 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 102 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 143 ms.
Product exploration explored 100000 steps with 1 reset in 165 ms.
Built C files in :
/tmp/ltsmin5144802326606250671
[2023-04-07 17:27:28] [INFO ] Computing symmetric may disable matrix : 63 transitions.
[2023-04-07 17:27:28] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-07 17:27:28] [INFO ] Computing symmetric may enable matrix : 63 transitions.
[2023-04-07 17:27:28] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-07 17:27:28] [INFO ] Computing Do-Not-Accords matrix : 63 transitions.
[2023-04-07 17:27:28] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-07 17:27:28] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5144802326606250671
Running compilation step : cd /tmp/ltsmin5144802326606250671;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 144 ms.
Running link step : cd /tmp/ltsmin5144802326606250671;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin5144802326606250671;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased17731885507754361922.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 62 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 62/62 places, 63/63 transitions.
Applied a total of 0 rules in 12 ms. Remains 62 /62 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2023-04-07 17:27:43] [INFO ] Invariant cache hit.
[2023-04-07 17:27:43] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-04-07 17:27:43] [INFO ] Invariant cache hit.
[2023-04-07 17:27:43] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 17:27:43] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
[2023-04-07 17:27:43] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 17:27:43] [INFO ] Invariant cache hit.
[2023-04-07 17:27:43] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 141 ms. Remains : 62/62 places, 63/63 transitions.
Built C files in :
/tmp/ltsmin14820702897769762993
[2023-04-07 17:27:43] [INFO ] Computing symmetric may disable matrix : 63 transitions.
[2023-04-07 17:27:43] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-07 17:27:43] [INFO ] Computing symmetric may enable matrix : 63 transitions.
[2023-04-07 17:27:43] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-07 17:27:43] [INFO ] Computing Do-Not-Accords matrix : 63 transitions.
[2023-04-07 17:27:43] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-07 17:27:43] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14820702897769762993
Running compilation step : cd /tmp/ltsmin14820702897769762993;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 138 ms.
Running link step : cd /tmp/ltsmin14820702897769762993;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin14820702897769762993;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4029806920228043550.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-04-07 17:27:59] [INFO ] Flatten gal took : 5 ms
[2023-04-07 17:27:59] [INFO ] Flatten gal took : 4 ms
[2023-04-07 17:27:59] [INFO ] Time to serialize gal into /tmp/LTL12631803133426923113.gal : 1 ms
[2023-04-07 17:27:59] [INFO ] Time to serialize properties into /tmp/LTL2726198906232349028.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12631803133426923113.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4760744226526423251.hoa' '-atoms' '/tmp/LTL2726198906232349028.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL2726198906232349028.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4760744226526423251.hoa
Detected timeout of ITS tools.
[2023-04-07 17:28:14] [INFO ] Flatten gal took : 3 ms
[2023-04-07 17:28:14] [INFO ] Flatten gal took : 3 ms
[2023-04-07 17:28:14] [INFO ] Time to serialize gal into /tmp/LTL2196314157452393851.gal : 2 ms
[2023-04-07 17:28:14] [INFO ] Time to serialize properties into /tmp/LTL8946092813027042740.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2196314157452393851.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8946092813027042740.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G((F(G("((capacity_c0<1)||(state_c0<1))")))&&(F("(capacity_c7<1)")))))
Formula 0 simplified : F(GF!"((capacity_c0<1)||(state_c0<1))" | G!"(capacity_c7<1)")
Detected timeout of ITS tools.
[2023-04-07 17:28:29] [INFO ] Flatten gal took : 4 ms
[2023-04-07 17:28:29] [INFO ] Applying decomposition
[2023-04-07 17:28:29] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph4964590328893807089.txt' '-o' '/tmp/graph4964590328893807089.bin' '-w' '/tmp/graph4964590328893807089.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph4964590328893807089.bin' '-l' '-1' '-v' '-w' '/tmp/graph4964590328893807089.weights' '-q' '0' '-e' '0.001'
[2023-04-07 17:28:29] [INFO ] Decomposing Gal with order
[2023-04-07 17:28:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-04-07 17:28:29] [INFO ] Removed a total of 9 redundant transitions.
[2023-04-07 17:28:29] [INFO ] Flatten gal took : 26 ms
[2023-04-07 17:28:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2023-04-07 17:28:29] [INFO ] Time to serialize gal into /tmp/LTL322601722656764132.gal : 2 ms
[2023-04-07 17:28:29] [INFO ] Time to serialize properties into /tmp/LTL1077095861945199145.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL322601722656764132.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1077095861945199145.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...253
Read 1 LTL properties
Checking formula 0 : !((G((F(G("((i3.u4.capacity_c0<1)||(i6.u16.state_c0<1))")))&&(F("(i1.u8.capacity_c7<1)")))))
Formula 0 simplified : F(GF!"((i3.u4.capacity_c0<1)||(i6.u16.state_c0<1))" | G!"(i1.u8.capacity_c7<1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin998209595846756385
[2023-04-07 17:28:44] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin998209595846756385
Running compilation step : cd /tmp/ltsmin998209595846756385;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 125 ms.
Running link step : cd /tmp/ltsmin998209595846756385;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin998209595846756385;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((<>([]((LTLAPp0==true)))&&<>((LTLAPp1==true))))' '--buchi-type=spotba'
LTSmin run took 364 ms.
FORMULA CryptoMiner-PT-D20N100-LTLFireability-08 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property CryptoMiner-PT-D20N100-LTLFireability-08 finished in 79240 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 1 out of 62 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 63/63 transitions.
Applied a total of 0 rules in 3 ms. Remains 62 /62 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2023-04-07 17:28:44] [INFO ] Invariant cache hit.
[2023-04-07 17:28:44] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-04-07 17:28:44] [INFO ] Invariant cache hit.
[2023-04-07 17:28:44] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 17:28:44] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
[2023-04-07 17:28:44] [INFO ] Invariant cache hit.
[2023-04-07 17:28:44] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 156 ms. Remains : 62/62 places, 63/63 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : CryptoMiner-PT-D20N100-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(LT s5 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 86 ms.
Product exploration explored 100000 steps with 50000 reset in 73 ms.
Computed a total of 40 stabilizing places and 41 stable transitions
Graph (complete) has 162 edges and 62 vertex of which 22 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.1 ms
Computed a total of 40 stabilizing places and 41 stable transitions
Knowledge obtained : [p0, (X p0), true]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 14 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CryptoMiner-PT-D20N100-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CryptoMiner-PT-D20N100-LTLFireability-09 finished in 422 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((!p1 U p2)))&&X(G(p3))))'
Support contains 5 out of 62 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 63/63 transitions.
Applied a total of 0 rules in 2 ms. Remains 62 /62 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2023-04-07 17:28:45] [INFO ] Invariant cache hit.
[2023-04-07 17:28:45] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-04-07 17:28:45] [INFO ] Invariant cache hit.
[2023-04-07 17:28:45] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 17:28:45] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
[2023-04-07 17:28:45] [INFO ] Invariant cache hit.
[2023-04-07 17:28:45] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 125 ms. Remains : 62/62 places, 63/63 transitions.
Stuttering acceptance computed with spot in 156 ms :[(NOT p3), (OR (NOT p3) (NOT p2)), true, (OR (NOT p3) (NOT p2)), (OR (NOT p2) (NOT p3))]
Running random walk in product with property : CryptoMiner-PT-D20N100-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p3, acceptance={} source=0 dest: 0}, { cond=(NOT p3), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p2 p3), acceptance={0} source=3 dest: 0}, { cond=(NOT p3), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p3), acceptance={0} source=3 dest: 3}, { cond=(AND p0 (NOT p2) p3), acceptance={0} source=3 dest: 4}], [{ cond=(AND p2 p3), acceptance={0} source=4 dest: 0}, { cond=(OR (AND (NOT p2) p1) (NOT p3)), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p2) (NOT p1) p3), acceptance={0} source=4 dest: 4}]], initial=1, aps=[p3:(LT s45 1), p0:(LT s54 1), p2:(GEQ s48 1), p1:(OR (LT s0 1) (LT s41 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, 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 1 steps with 0 reset in 0 ms.
FORMULA CryptoMiner-PT-D20N100-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-PT-D20N100-LTLFireability-11 finished in 297 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0))||(G(F(p1))&&F(!p2))))'
Support contains 3 out of 62 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 62/62 places, 63/63 transitions.
Applied a total of 0 rules in 8 ms. Remains 62 /62 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2023-04-07 17:28:45] [INFO ] Invariant cache hit.
[2023-04-07 17:28:45] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-04-07 17:28:45] [INFO ] Invariant cache hit.
[2023-04-07 17:28:45] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 17:28:45] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
[2023-04-07 17:28:45] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 17:28:45] [INFO ] Invariant cache hit.
[2023-04-07 17:28:45] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 140 ms. Remains : 62/62 places, 63/63 transitions.
Stuttering acceptance computed with spot in 126 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) p2)]
Running random walk in product with property : CryptoMiner-PT-D20N100-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=p2, acceptance={} source=0 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND p0 p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (LT s54 1) (LT s15 1)), p1:(GEQ s15 1), p2:(LT s5 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 1 reset in 144 ms.
Product exploration explored 100000 steps with 0 reset in 164 ms.
Computed a total of 40 stabilizing places and 41 stable transitions
Graph (complete) has 162 edges and 62 vertex of which 22 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.1 ms
Computed a total of 40 stabilizing places and 41 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (AND p0 (NOT p1))), (X (AND p0 p2)), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (AND p0 (NOT p1)))), (X (X (AND p0 p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 126 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter insensitive) to 8 states, 21 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 284 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) p2), false, false, false, false]
Incomplete random walk after 10064 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=559 ) properties (out of 8) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-04-07 17:28:46] [INFO ] Invariant cache hit.
[2023-04-07 17:28:46] [INFO ] After 21ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (AND p0 (NOT p1))), (X (AND p0 p2)), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (AND p0 (NOT p1)))), (X (X (AND p0 p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (G (NOT (AND (NOT p0) (NOT p1)))), (G (NOT (AND (NOT p0) (NOT p1) (NOT p2))))]
False Knowledge obtained : [(F (AND p0 p1 (NOT p2))), (F (AND p0 (NOT p1) (NOT p2))), (F (NOT (AND p0 p2))), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) p1 (NOT p2))), (F (AND (NOT p0) p2))]
Knowledge based reduction with 12 factoid took 353 ms. Reduced automaton from 8 states, 21 edges and 3 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 134 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), false, false]
Stuttering acceptance computed with spot in 125 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), false, false]
Support contains 3 out of 62 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 62/62 places, 63/63 transitions.
Applied a total of 0 rules in 8 ms. Remains 62 /62 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2023-04-07 17:28:47] [INFO ] Invariant cache hit.
[2023-04-07 17:28:47] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-04-07 17:28:47] [INFO ] Invariant cache hit.
[2023-04-07 17:28:47] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 17:28:47] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
[2023-04-07 17:28:47] [INFO ] Redundant transitions in 1 ms returned []
[2023-04-07 17:28:47] [INFO ] Invariant cache hit.
[2023-04-07 17:28:47] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 159 ms. Remains : 62/62 places, 63/63 transitions.
Computed a total of 40 stabilizing places and 41 stable transitions
Graph (complete) has 162 edges and 62 vertex of which 22 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.1 ms
Computed a total of 40 stabilizing places and 41 stable transitions
Knowledge obtained : [(AND p0 p2), (X (AND p0 p2)), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 94 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 144 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), false, false]
Incomplete random walk after 10008 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 4) seen :2
Finished Best-First random walk after 7110 steps, including 2 resets, run visited all 2 properties in 9 ms. (steps per millisecond=790 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p2), (X (AND p0 p2)), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(F (AND (NOT p0) p2)), (F (AND (NOT p0) (NOT p2))), (F (NOT (AND p0 p2))), (F (AND p0 (NOT p2)))]
Knowledge based reduction with 9 factoid took 177 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 122 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), false, false]
Stuttering acceptance computed with spot in 124 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), false, false]
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), false, false]
Product exploration explored 100000 steps with 1371 reset in 101 ms.
Product exploration explored 100000 steps with 1391 reset in 102 ms.
Built C files in :
/tmp/ltsmin1110055601877335563
[2023-04-07 17:28:48] [INFO ] Computing symmetric may disable matrix : 63 transitions.
[2023-04-07 17:28:48] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-07 17:28:48] [INFO ] Computing symmetric may enable matrix : 63 transitions.
[2023-04-07 17:28:48] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-07 17:28:48] [INFO ] Computing Do-Not-Accords matrix : 63 transitions.
[2023-04-07 17:28:48] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-07 17:28:48] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1110055601877335563
Running compilation step : cd /tmp/ltsmin1110055601877335563;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 145 ms.
Running link step : cd /tmp/ltsmin1110055601877335563;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin1110055601877335563;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16789564827969942734.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 62 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 62/62 places, 63/63 transitions.
Applied a total of 0 rules in 3 ms. Remains 62 /62 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2023-04-07 17:29:03] [INFO ] Invariant cache hit.
[2023-04-07 17:29:03] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-04-07 17:29:03] [INFO ] Invariant cache hit.
[2023-04-07 17:29:03] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 17:29:03] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
[2023-04-07 17:29:03] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 17:29:03] [INFO ] Invariant cache hit.
[2023-04-07 17:29:03] [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 126 ms. Remains : 62/62 places, 63/63 transitions.
Built C files in :
/tmp/ltsmin2370061130568424345
[2023-04-07 17:29:03] [INFO ] Computing symmetric may disable matrix : 63 transitions.
[2023-04-07 17:29:03] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-07 17:29:03] [INFO ] Computing symmetric may enable matrix : 63 transitions.
[2023-04-07 17:29:03] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-07 17:29:03] [INFO ] Computing Do-Not-Accords matrix : 63 transitions.
[2023-04-07 17:29:03] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-07 17:29:03] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2370061130568424345
Running compilation step : cd /tmp/ltsmin2370061130568424345;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 144 ms.
Running link step : cd /tmp/ltsmin2370061130568424345;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin2370061130568424345;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased792245997460905858.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-04-07 17:29:18] [INFO ] Flatten gal took : 4 ms
[2023-04-07 17:29:18] [INFO ] Flatten gal took : 3 ms
[2023-04-07 17:29:18] [INFO ] Time to serialize gal into /tmp/LTL2401162025424124389.gal : 2 ms
[2023-04-07 17:29:18] [INFO ] Time to serialize properties into /tmp/LTL9528453052839895030.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2401162025424124389.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11393524099930248067.hoa' '-atoms' '/tmp/LTL9528453052839895030.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL9528453052839895030.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11393524099930248067.hoa
Detected timeout of ITS tools.
[2023-04-07 17:29:33] [INFO ] Flatten gal took : 3 ms
[2023-04-07 17:29:33] [INFO ] Flatten gal took : 4 ms
[2023-04-07 17:29:33] [INFO ] Time to serialize gal into /tmp/LTL9684851511900132463.gal : 2 ms
[2023-04-07 17:29:33] [INFO ] Time to serialize properties into /tmp/LTL13682022686429423139.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9684851511900132463.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13682022686429423139.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((F(G("((state_c20<1)||(capacity_c4<1))")))||((G(F("(capacity_c4>=1)")))&&(F("(capacity_c13>=1)")))))
Formula 0 simplified : GF!"((state_c20<1)||(capacity_c4<1))" & (FG!"(capacity_c4>=1)" | G!"(capacity_c13>=1)")
Detected timeout of ITS tools.
[2023-04-07 17:29:48] [INFO ] Flatten gal took : 5 ms
[2023-04-07 17:29:48] [INFO ] Applying decomposition
[2023-04-07 17:29:48] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph3419550001830145277.txt' '-o' '/tmp/graph3419550001830145277.bin' '-w' '/tmp/graph3419550001830145277.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph3419550001830145277.bin' '-l' '-1' '-v' '-w' '/tmp/graph3419550001830145277.weights' '-q' '0' '-e' '0.001'
[2023-04-07 17:29:48] [INFO ] Decomposing Gal with order
[2023-04-07 17:29:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-04-07 17:29:48] [INFO ] Removed a total of 8 redundant transitions.
[2023-04-07 17:29:48] [INFO ] Flatten gal took : 6 ms
[2023-04-07 17:29:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2023-04-07 17:29:49] [INFO ] Time to serialize gal into /tmp/LTL12564041674765937290.gal : 2 ms
[2023-04-07 17:29:49] [INFO ] Time to serialize properties into /tmp/LTL17641910723304861474.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12564041674765937290.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17641910723304861474.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !(((F(G("((i5.i1.u22.state_c20<1)||(i2.u6.capacity_c4<1))")))||((G(F("(i2.u6.capacity_c4>=1)")))&&(F("(i0.u1.capacity_c13>=1)")))))
Formula 0 simplified : GF!"((i5.i1.u22.state_c20<1)||(i2.u6.capacity_c4<1))" & (FG!"(i2.u6.capacity_c4>=1)" | G!"(i0.u1.capacity_c13>=1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13709972439768886290
[2023-04-07 17:30:04] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13709972439768886290
Running compilation step : cd /tmp/ltsmin13709972439768886290;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 129 ms.
Running link step : cd /tmp/ltsmin13709972439768886290;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin13709972439768886290;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(<>([]((LTLAPp0==true)))||([](<>((LTLAPp1==true)))&&<>((LTLAPp2==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property CryptoMiner-PT-D20N100-LTLFireability-12 finished in 93583 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((G(p0)||(X(p1) U ((p2&&X(p1))||X(G(p1)))))))))'
Support contains 5 out of 62 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 63/63 transitions.
Applied a total of 0 rules in 2 ms. Remains 62 /62 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2023-04-07 17:30:19] [INFO ] Invariant cache hit.
[2023-04-07 17:30:19] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-04-07 17:30:19] [INFO ] Invariant cache hit.
[2023-04-07 17:30:19] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 17:30:19] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
[2023-04-07 17:30:19] [INFO ] Invariant cache hit.
[2023-04-07 17:30:19] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 130 ms. Remains : 62/62 places, 63/63 transitions.
Stuttering acceptance computed with spot in 187 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CryptoMiner-PT-D20N100-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p2) p1), acceptance={} source=0 dest: 0}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p0 p2 p1), acceptance={} source=0 dest: 1}, { cond=(AND p0 p2 (NOT p1)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p0) p2 p1), acceptance={1} source=0 dest: 1}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={0, 1} source=0 dest: 1}], [{ cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1} source=1 dest: 0}, { cond=(AND p0 p2 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={0, 1} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (GEQ s4 1) (GEQ s0 1) (GEQ s41 1)), p2:(LT s42 1), p1:(LT s54 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 19391 reset in 104 ms.
Product exploration explored 100000 steps with 19363 reset in 110 ms.
Computed a total of 40 stabilizing places and 41 stable transitions
Graph (complete) has 162 edges and 62 vertex of which 22 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.1 ms
Computed a total of 40 stabilizing places and 41 stable transitions
Detected a total of 40/62 stabilizing places and 41/63 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 p2 p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (AND (NOT p0) p2 p1))), (X (X (NOT (AND (NOT p0) p2 p1))))]
Knowledge based reduction with 9 factoid took 375 ms. Reduced automaton from 4 states, 14 edges and 3 AP (stutter sensitive) to 4 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 168 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10058 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1005 ) properties (out of 8) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-04-07 17:30:20] [INFO ] Invariant cache hit.
[2023-04-07 17:30:20] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:3
[2023-04-07 17:30:20] [INFO ] After 44ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :0
Fused 4 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 4 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 p2 p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (G (NOT (AND p2 (NOT p1) p0))), (G (NOT (AND (NOT p2) p1 p0))), (G (NOT (AND (NOT p2) (NOT p1) p0)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (AND (NOT p0) p2 p1))), (X (X (NOT (AND (NOT p0) p2 p1)))), (F (AND p2 p1 p0)), (F (NOT (AND p2 p1 (NOT p0)))), (F (AND (NOT p2) p1 (NOT p0))), (F (AND p2 (NOT p1) (NOT p0)))]
Knowledge based reduction with 13 factoid took 1211 ms. Reduced automaton from 4 states, 14 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 289 ms :[(NOT p1), (AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2)]
Stuttering acceptance computed with spot in 155 ms :[(NOT p1), (AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2)]
Support contains 2 out of 62 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 63/63 transitions.
Applied a total of 0 rules in 3 ms. Remains 62 /62 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2023-04-07 17:30:22] [INFO ] Invariant cache hit.
[2023-04-07 17:30:22] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-04-07 17:30:22] [INFO ] Invariant cache hit.
[2023-04-07 17:30:22] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 17:30:22] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
[2023-04-07 17:30:22] [INFO ] Invariant cache hit.
[2023-04-07 17:30:22] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 131 ms. Remains : 62/62 places, 63/63 transitions.
Computed a total of 40 stabilizing places and 41 stable transitions
Graph (complete) has 162 edges and 62 vertex of which 22 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.1 ms
Computed a total of 40 stabilizing places and 41 stable transitions
Detected a total of 40/62 stabilizing places and 41/63 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 p2), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2)))]
Knowledge based reduction with 3 factoid took 160 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 171 ms :[(NOT p1), (AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2)]
Finished random walk after 2141 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=2141 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p2), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (F (NOT p1)), (F (NOT p2))]
Knowledge based reduction with 3 factoid took 204 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 147 ms :[(NOT p1), (AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2)]
Stuttering acceptance computed with spot in 157 ms :[(NOT p1), (AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2)]
Stuttering acceptance computed with spot in 157 ms :[(NOT p1), (AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2)]
Product exploration explored 100000 steps with 19442 reset in 70 ms.
Product exploration explored 100000 steps with 19387 reset in 71 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 136 ms :[(NOT p1), (AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2)]
Support contains 2 out of 62 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 62/62 places, 63/63 transitions.
Graph (trivial) has 38 edges and 62 vertex of which 21 / 62 are part of one of the 1 SCC in 6 ms
Free SCC test removed 20 places
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Applied a total of 1 rules in 9 ms. Remains 42 /62 variables (removed 20) and now considering 43/63 (removed 20) transitions.
[2023-04-07 17:30:23] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 43 rows 42 cols
[2023-04-07 17:30:23] [INFO ] Computed 0 invariants in 2 ms
[2023-04-07 17:30:23] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 42/62 places, 43/63 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 55 ms. Remains : 42/62 places, 43/63 transitions.
Built C files in :
/tmp/ltsmin6596748928949949220
[2023-04-07 17:30:23] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6596748928949949220
Running compilation step : cd /tmp/ltsmin6596748928949949220;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 126 ms.
Running link step : cd /tmp/ltsmin6596748928949949220;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin6596748928949949220;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased6353408461252625603.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 62 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 63/63 transitions.
Applied a total of 0 rules in 4 ms. Remains 62 /62 variables (removed 0) and now considering 63/63 (removed 0) transitions.
// Phase 1: matrix 63 rows 62 cols
[2023-04-07 17:30:38] [INFO ] Computed 0 invariants in 10 ms
[2023-04-07 17:30:38] [INFO ] Implicit Places using invariants in 50 ms returned []
[2023-04-07 17:30:38] [INFO ] Invariant cache hit.
[2023-04-07 17:30:39] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 17:30:39] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
[2023-04-07 17:30:39] [INFO ] Invariant cache hit.
[2023-04-07 17:30:39] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 147 ms. Remains : 62/62 places, 63/63 transitions.
Built C files in :
/tmp/ltsmin9716409990078716092
[2023-04-07 17:30:39] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9716409990078716092
Running compilation step : cd /tmp/ltsmin9716409990078716092;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 132 ms.
Running link step : cd /tmp/ltsmin9716409990078716092;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin9716409990078716092;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased5120749027998227553.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-04-07 17:30:54] [INFO ] Flatten gal took : 11 ms
[2023-04-07 17:30:54] [INFO ] Flatten gal took : 2 ms
[2023-04-07 17:30:54] [INFO ] Time to serialize gal into /tmp/LTL2097061420784214046.gal : 0 ms
[2023-04-07 17:30:54] [INFO ] Time to serialize properties into /tmp/LTL5114752507020059732.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2097061420784214046.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13482635782000557504.hoa' '-atoms' '/tmp/LTL5114752507020059732.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL5114752507020059732.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13482635782000557504.hoa
Detected timeout of ITS tools.
[2023-04-07 17:31:09] [INFO ] Flatten gal took : 2 ms
[2023-04-07 17:31:09] [INFO ] Flatten gal took : 2 ms
[2023-04-07 17:31:09] [INFO ] Time to serialize gal into /tmp/LTL10395248389690568278.gal : 1 ms
[2023-04-07 17:31:09] [INFO ] Time to serialize properties into /tmp/LTL2118975188777607319.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10395248389690568278.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2118975188777607319.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(F((G("(((capacity_c12>=1)&&(capacity_c0>=1))&&(state_c0>=1))"))||((X("(state_c20<1)"))U((X(G("(state_c20<1)")))||(("(state_c1<1...188
Formula 0 simplified : XXG(F!"(((capacity_c12>=1)&&(capacity_c0>=1))&&(state_c0>=1))" & (X!"(state_c20<1)" R (XF!"(state_c20<1)" & (!"(state_c1<1)" | X!"(s...171
Detected timeout of ITS tools.
[2023-04-07 17:31:24] [INFO ] Flatten gal took : 5 ms
[2023-04-07 17:31:24] [INFO ] Applying decomposition
[2023-04-07 17:31:24] [INFO ] Flatten gal took : 2 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph7649895215317217318.txt' '-o' '/tmp/graph7649895215317217318.bin' '-w' '/tmp/graph7649895215317217318.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph7649895215317217318.bin' '-l' '-1' '-v' '-w' '/tmp/graph7649895215317217318.weights' '-q' '0' '-e' '0.001'
[2023-04-07 17:31:24] [INFO ] Decomposing Gal with order
[2023-04-07 17:31:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-04-07 17:31:24] [INFO ] Removed a total of 9 redundant transitions.
[2023-04-07 17:31:24] [INFO ] Flatten gal took : 10 ms
[2023-04-07 17:31:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2023-04-07 17:31:24] [INFO ] Time to serialize gal into /tmp/LTL6200982207097295857.gal : 3 ms
[2023-04-07 17:31:24] [INFO ] Time to serialize properties into /tmp/LTL4814441466161267936.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6200982207097295857.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4814441466161267936.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(X(F((G("(((i1.u1.capacity_c12>=1)&&(i2.u5.capacity_c0>=1))&&(i6.u17.state_c0>=1))"))||((X("(i5.u22.state_c20<1)"))U((X(G("(i5.u22...235
Formula 0 simplified : XXG(F!"(((i1.u1.capacity_c12>=1)&&(i2.u5.capacity_c0>=1))&&(i6.u17.state_c0>=1))" & (X!"(i5.u22.state_c20<1)" R (XF!"(i5.u22.state_c...218
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2632781286211207790
[2023-04-07 17:31:39] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2632781286211207790
Running compilation step : cd /tmp/ltsmin2632781286211207790;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 129 ms.
Running link step : cd /tmp/ltsmin2632781286211207790;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 22 ms.
Running LTSmin : cd /tmp/ltsmin2632781286211207790;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(<>(([]((LTLAPp0==true))||(X((LTLAPp1==true)) U (X([]((LTLAPp1==true)))||((LTLAPp2==true)&&X((LTLAPp1==true)))))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property CryptoMiner-PT-D20N100-LTLFireability-13 finished in 95356 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((!p0 U (G(!p0)||(G(p2)&&p1)))))'
Support contains 5 out of 62 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 63/63 transitions.
Applied a total of 0 rules in 2 ms. Remains 62 /62 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2023-04-07 17:31:54] [INFO ] Invariant cache hit.
[2023-04-07 17:31:54] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-04-07 17:31:54] [INFO ] Invariant cache hit.
[2023-04-07 17:31:54] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 17:31:54] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
[2023-04-07 17:31:54] [INFO ] Invariant cache hit.
[2023-04-07 17:31:54] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 113 ms. Remains : 62/62 places, 63/63 transitions.
Stuttering acceptance computed with spot in 152 ms :[true, (OR (AND p0 (NOT p2)) (AND p0 (NOT p1))), (AND p0 (NOT p2)), (OR (AND p0 (NOT p2)) (AND p0 (NOT p1))), (NOT p2)]
Running random walk in product with property : CryptoMiner-PT-D20N100-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) p0), acceptance={} source=2 dest: 0}, { cond=(AND p2 (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND p2 p0), acceptance={} source=2 dest: 4}], [{ cond=(OR (AND (NOT p1) p0) (AND (NOT p2) p0)), acceptance={} source=3 dest: 0}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0))), acceptance={} source=3 dest: 3}, { cond=(AND p1 p2 p0), acceptance={} source=3 dest: 4}], [{ cond=(NOT p2), acceptance={} source=4 dest: 0}, { cond=p2, acceptance={} source=4 dest: 4}]], initial=1, aps=[p2:(OR (LT s0 1) (LT s41 1)), p0:(OR (GEQ s53 1) (GEQ s13 1)), p1:(AND (LT s19 1) (NOT (OR (GEQ s53 1) (GEQ s13 1))))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 146 ms.
Product exploration explored 100000 steps with 0 reset in 178 ms.
Computed a total of 40 stabilizing places and 41 stable transitions
Graph (complete) has 162 edges and 62 vertex of which 22 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.1 ms
Computed a total of 40 stabilizing places and 41 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT (AND p1 p2 p0))), (X (NOT (OR (AND (NOT p1) p0) (AND (NOT p2) p0)))), true, (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND p1 p2 p0))))]
False Knowledge obtained : [(X (OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0)))), (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0))))), (X (AND p1 p2 (NOT p0))), (X (NOT (AND p1 p2 (NOT p0)))), (X (X (AND p2 p0))), (X (X (NOT (AND p2 p0)))), (X (X (OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0))))), (X (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0)))))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (OR (AND (NOT p1) p0) (AND (NOT p2) p0)))), (X (X (NOT (OR (AND (NOT p1) p0) (AND (NOT p2) p0))))), (X (X (NOT p2))), (X (X p2)), (X (X (AND p1 p2 (NOT p0)))), (X (X (NOT (AND p1 p2 (NOT p0)))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 590 ms. Reduced automaton from 5 states, 12 edges and 3 AP (stutter sensitive) to 7 states, 20 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 226 ms :[true, (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (NOT p2), (AND p0 (NOT p2)), (OR (AND p0 (NOT p2)) (AND p0 (NOT p1))), false, false]
Incomplete random walk after 10086 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=1008 ) properties (out of 10) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
[2023-04-07 17:31:55] [INFO ] Invariant cache hit.
[2023-04-07 17:31:55] [INFO ] After 16ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT (AND p1 p2 p0))), (X (NOT (OR (AND (NOT p1) p0) (AND (NOT p2) p0)))), true, (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND p1 p2 p0)))), (G (NOT (AND p0 p1 p2)))]
False Knowledge obtained : [(X (OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0)))), (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0))))), (X (AND p1 p2 (NOT p0))), (X (NOT (AND p1 p2 (NOT p0)))), (X (X (AND p2 p0))), (X (X (NOT (AND p2 p0)))), (X (X (OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0))))), (X (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0)))))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (OR (AND (NOT p1) p0) (AND (NOT p2) p0)))), (X (X (NOT (OR (AND (NOT p1) p0) (AND (NOT p2) p0))))), (X (X (NOT p2))), (X (X p2)), (X (X (AND p1 p2 (NOT p0)))), (X (X (NOT (AND p1 p2 (NOT p0))))), (F p2), (F (AND (NOT p0) p1 p2)), (F (AND p0 p2)), (F (AND p0 (NOT p2))), (F (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))), (F (NOT (OR (NOT p0) (AND p1 p2)))), (F (NOT (AND (NOT p0) (NOT p2)))), (F (AND (NOT p0) p2)), (F (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))))]
Property proved to be false thanks to negative knowledge :(F (AND p0 (NOT p2)))
Knowledge based reduction with 7 factoid took 665 ms. Reduced automaton from 7 states, 20 edges and 3 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CryptoMiner-PT-D20N100-LTLFireability-15 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CryptoMiner-PT-D20N100-LTLFireability-15 finished in 2161 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0))||(G(F(p1))&&F(!p2))))'
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((G(p0)||(X(p1) U ((p2&&X(p1))||X(G(p1)))))))))'
Found a Shortening insensitive property : CryptoMiner-PT-D20N100-LTLFireability-13
Stuttering acceptance computed with spot in 134 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 62 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 62/62 places, 63/63 transitions.
Applied a total of 0 rules in 7 ms. Remains 62 /62 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2023-04-07 17:31:56] [INFO ] Invariant cache hit.
[2023-04-07 17:31:57] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-04-07 17:31:57] [INFO ] Invariant cache hit.
[2023-04-07 17:31:57] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 17:31:57] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
[2023-04-07 17:31:57] [INFO ] Invariant cache hit.
[2023-04-07 17:31:57] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 117 ms. Remains : 62/62 places, 63/63 transitions.
Running random walk in product with property : CryptoMiner-PT-D20N100-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p2) p1), acceptance={} source=0 dest: 0}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p0 p2 p1), acceptance={} source=0 dest: 1}, { cond=(AND p0 p2 (NOT p1)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p0) p2 p1), acceptance={1} source=0 dest: 1}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={0, 1} source=0 dest: 1}], [{ cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1} source=1 dest: 0}, { cond=(AND p0 p2 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={0, 1} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (GEQ s4 1) (GEQ s0 1) (GEQ s41 1)), p2:(LT s42 1), p1:(LT s54 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 19371 reset in 98 ms.
Product exploration explored 100000 steps with 19399 reset in 104 ms.
Computed a total of 40 stabilizing places and 41 stable transitions
Graph (complete) has 162 edges and 62 vertex of which 22 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.2 ms
Computed a total of 40 stabilizing places and 41 stable transitions
Detected a total of 40/62 stabilizing places and 41/63 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 p2 p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (AND (NOT p0) p2 p1))), (X (X (NOT (AND (NOT p0) p2 p1))))]
Knowledge based reduction with 9 factoid took 390 ms. Reduced automaton from 4 states, 14 edges and 3 AP (stutter sensitive) to 4 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 143 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10071 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1258 ) properties (out of 8) seen :3
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-04-07 17:31:57] [INFO ] Invariant cache hit.
[2023-04-07 17:31:57] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:3
[2023-04-07 17:31:58] [INFO ] After 42ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :0
Fused 4 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 4 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 p2 p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (G (NOT (AND p2 (NOT p1) p0))), (G (NOT (AND (NOT p2) p1 p0))), (G (NOT (AND (NOT p2) (NOT p1) p0)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (AND (NOT p0) p2 p1))), (X (X (NOT (AND (NOT p0) p2 p1)))), (F (AND p2 p1 p0)), (F (NOT (AND p2 p1 (NOT p0)))), (F (AND (NOT p2) p1 (NOT p0))), (F (AND p2 (NOT p1) (NOT p0)))]
Knowledge based reduction with 13 factoid took 1203 ms. Reduced automaton from 4 states, 14 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 134 ms :[(NOT p1), (AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2)]
Stuttering acceptance computed with spot in 142 ms :[(NOT p1), (AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2)]
Support contains 2 out of 62 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 63/63 transitions.
Applied a total of 0 rules in 1 ms. Remains 62 /62 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2023-04-07 17:31:59] [INFO ] Invariant cache hit.
[2023-04-07 17:31:59] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-04-07 17:31:59] [INFO ] Invariant cache hit.
[2023-04-07 17:31:59] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 17:31:59] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
[2023-04-07 17:31:59] [INFO ] Invariant cache hit.
[2023-04-07 17:31:59] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 110 ms. Remains : 62/62 places, 63/63 transitions.
Computed a total of 40 stabilizing places and 41 stable transitions
Graph (complete) has 162 edges and 62 vertex of which 22 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.0 ms
Computed a total of 40 stabilizing places and 41 stable transitions
Detected a total of 40/62 stabilizing places and 41/63 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 p2), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2)))]
Knowledge based reduction with 3 factoid took 147 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 139 ms :[(NOT p1), (AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2)]
Finished random walk after 2848 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=1424 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p2), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (F (NOT p1)), (F (NOT p2))]
Knowledge based reduction with 3 factoid took 181 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 140 ms :[(NOT p1), (AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2)]
Stuttering acceptance computed with spot in 130 ms :[(NOT p1), (AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2)]
Stuttering acceptance computed with spot in 228 ms :[(NOT p1), (AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2)]
Product exploration explored 100000 steps with 19255 reset in 73 ms.
Product exploration explored 100000 steps with 19376 reset in 77 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 154 ms :[(NOT p1), (AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2)]
Support contains 2 out of 62 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 62/62 places, 63/63 transitions.
Graph (trivial) has 38 edges and 62 vertex of which 21 / 62 are part of one of the 1 SCC in 0 ms
Free SCC test removed 20 places
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Applied a total of 1 rules in 5 ms. Remains 42 /62 variables (removed 20) and now considering 43/63 (removed 20) transitions.
[2023-04-07 17:32:00] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 43 rows 42 cols
[2023-04-07 17:32:00] [INFO ] Computed 0 invariants in 0 ms
[2023-04-07 17:32:01] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 42/62 places, 43/63 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 40 ms. Remains : 42/62 places, 43/63 transitions.
Built C files in :
/tmp/ltsmin13581296981503270086
[2023-04-07 17:32:01] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13581296981503270086
Running compilation step : cd /tmp/ltsmin13581296981503270086;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 117 ms.
Running link step : cd /tmp/ltsmin13581296981503270086;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 24 ms.
Running LTSmin : cd /tmp/ltsmin13581296981503270086;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased5789043437171570898.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 62 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 63/63 transitions.
Applied a total of 0 rules in 2 ms. Remains 62 /62 variables (removed 0) and now considering 63/63 (removed 0) transitions.
// Phase 1: matrix 63 rows 62 cols
[2023-04-07 17:32:16] [INFO ] Computed 0 invariants in 1 ms
[2023-04-07 17:32:16] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-04-07 17:32:16] [INFO ] Invariant cache hit.
[2023-04-07 17:32:16] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 17:32:16] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
[2023-04-07 17:32:16] [INFO ] Invariant cache hit.
[2023-04-07 17:32:16] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 118 ms. Remains : 62/62 places, 63/63 transitions.
Built C files in :
/tmp/ltsmin3285681115009187214
[2023-04-07 17:32:16] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3285681115009187214
Running compilation step : cd /tmp/ltsmin3285681115009187214;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 120 ms.
Running link step : cd /tmp/ltsmin3285681115009187214;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin3285681115009187214;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased9984036329892849287.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-04-07 17:32:31] [INFO ] Flatten gal took : 5 ms
[2023-04-07 17:32:31] [INFO ] Flatten gal took : 5 ms
[2023-04-07 17:32:31] [INFO ] Time to serialize gal into /tmp/LTL17779873571084782648.gal : 1 ms
[2023-04-07 17:32:31] [INFO ] Time to serialize properties into /tmp/LTL16962814622197111698.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17779873571084782648.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9342890486215773069.hoa' '-atoms' '/tmp/LTL16962814622197111698.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL16962814622197111698.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9342890486215773069.hoa
Detected timeout of ITS tools.
[2023-04-07 17:32:46] [INFO ] Flatten gal took : 4 ms
[2023-04-07 17:32:46] [INFO ] Flatten gal took : 3 ms
[2023-04-07 17:32:46] [INFO ] Time to serialize gal into /tmp/LTL513129365182398711.gal : 1 ms
[2023-04-07 17:32:46] [INFO ] Time to serialize properties into /tmp/LTL15911838539155745837.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL513129365182398711.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15911838539155745837.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(X(F((G("(((capacity_c12>=1)&&(capacity_c0>=1))&&(state_c0>=1))"))||((X("(state_c20<1)"))U((X(G("(state_c20<1)")))||(("(state_c1<1...188
Formula 0 simplified : XXG(F!"(((capacity_c12>=1)&&(capacity_c0>=1))&&(state_c0>=1))" & (X!"(state_c20<1)" R (XF!"(state_c20<1)" & (!"(state_c1<1)" | X!"(s...171
Detected timeout of ITS tools.
[2023-04-07 17:33:01] [INFO ] Flatten gal took : 4 ms
[2023-04-07 17:33:01] [INFO ] Applying decomposition
[2023-04-07 17:33:01] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph6593210109090207902.txt' '-o' '/tmp/graph6593210109090207902.bin' '-w' '/tmp/graph6593210109090207902.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph6593210109090207902.bin' '-l' '-1' '-v' '-w' '/tmp/graph6593210109090207902.weights' '-q' '0' '-e' '0.001'
[2023-04-07 17:33:01] [INFO ] Decomposing Gal with order
[2023-04-07 17:33:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-04-07 17:33:01] [INFO ] Removed a total of 9 redundant transitions.
[2023-04-07 17:33:01] [INFO ] Flatten gal took : 5 ms
[2023-04-07 17:33:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2023-04-07 17:33:01] [INFO ] Time to serialize gal into /tmp/LTL5176013267660777041.gal : 1 ms
[2023-04-07 17:33:01] [INFO ] Time to serialize properties into /tmp/LTL9061739225282971344.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5176013267660777041.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9061739225282971344.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(X(F((G("(((i0.u2.capacity_c12>=1)&&(i2.u0.capacity_c0>=1))&&(i5.u17.state_c0>=1))"))||((X("(i4.i1.u22.state_c20<1)"))U((X(G("(i4....244
Formula 0 simplified : XXG(F!"(((i0.u2.capacity_c12>=1)&&(i2.u0.capacity_c0>=1))&&(i5.u17.state_c0>=1))" & (X!"(i4.i1.u22.state_c20<1)" R (XF!"(i4.i1.u22.s...227
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2691514472763833363
[2023-04-07 17:33:16] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2691514472763833363
Running compilation step : cd /tmp/ltsmin2691514472763833363;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 132 ms.
Running link step : cd /tmp/ltsmin2691514472763833363;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin2691514472763833363;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(<>(([]((LTLAPp0==true))||(X((LTLAPp1==true)) U (X([]((LTLAPp1==true)))||((LTLAPp2==true)&&X((LTLAPp1==true)))))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property CryptoMiner-PT-D20N100-LTLFireability-13 finished in 94882 ms.
[2023-04-07 17:33:31] [INFO ] Flatten gal took : 2 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin261416542028090119
[2023-04-07 17:33:31] [INFO ] Computing symmetric may disable matrix : 63 transitions.
[2023-04-07 17:33:31] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-07 17:33:31] [INFO ] Computing symmetric may enable matrix : 63 transitions.
[2023-04-07 17:33:31] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-07 17:33:31] [INFO ] Computing Do-Not-Accords matrix : 63 transitions.
[2023-04-07 17:33:31] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-07 17:33:31] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin261416542028090119
Running compilation step : cd /tmp/ltsmin261416542028090119;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2023-04-07 17:33:31] [INFO ] Applying decomposition
[2023-04-07 17:33:31] [INFO ] Flatten gal took : 2 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph17806045393227561477.txt' '-o' '/tmp/graph17806045393227561477.bin' '-w' '/tmp/graph17806045393227561477.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph17806045393227561477.bin' '-l' '-1' '-v' '-w' '/tmp/graph17806045393227561477.weights' '-q' '0' '-e' '0.001'
[2023-04-07 17:33:31] [INFO ] Decomposing Gal with order
[2023-04-07 17:33:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-04-07 17:33:31] [INFO ] Removed a total of 9 redundant transitions.
[2023-04-07 17:33:31] [INFO ] Flatten gal took : 5 ms
[2023-04-07 17:33:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2023-04-07 17:33:31] [INFO ] Time to serialize gal into /tmp/LTLFireability15776867389796143378.gal : 1 ms
[2023-04-07 17:33:31] [INFO ] Time to serialize properties into /tmp/LTLFireability3540188471862942129.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability15776867389796143378.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability3540188471862942129.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 2 LTL properties
Checking formula 0 : !(((F(G("((i5.u24.state_c20<1)||(i2.i1.u7.capacity_c4<1))")))||((G(F("(i2.i1.u7.capacity_c4>=1)")))&&(F("(i0.u3.capacity_c13>=1)")))))
Formula 0 simplified : GF!"((i5.u24.state_c20<1)||(i2.i1.u7.capacity_c4<1))" & (FG!"(i2.i1.u7.capacity_c4>=1)" | G!"(i0.u3.capacity_c13>=1)")
Compilation finished in 146 ms.
Running link step : cd /tmp/ltsmin261416542028090119;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 22 ms.
Running LTSmin : cd /tmp/ltsmin261416542028090119;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '(<>([]((LTLAPp0==true)))||([](<>((LTLAPp1==true)))&&<>(!(LTLAPp2==true))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.003: Loading model from ./gal.so
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.004: Initializing POR dependencies: labels 69, guards 63
pins2lts-mc-linux64( 1/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.010: LTL layer: formula: (<>([]((LTLAPp0==true)))||([](<>((LTLAPp1==true)))&&<>(!(LTLAPp2==true))))
pins2lts-mc-linux64( 0/ 8), 0.010: "(<>([]((LTLAPp0==true)))||([](<>((LTLAPp1==true)))&&<>(!(LTLAPp2==true))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.010: Using Spin LTL semantics
pins2lts-mc-linux64( 5/ 8), 0.013: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.012: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.013: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.013: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.014: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.013: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.017: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.017: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.017: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.020: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.020: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.020: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.020: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.022: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.023: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.023: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.032: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.032: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.046: buchi has 6 states
pins2lts-mc-linux64( 0/ 8), 0.048: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 0.063: There are 70 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.063: State length is 63, there are 76 groups
pins2lts-mc-linux64( 0/ 8), 0.063: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.063: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.063: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.063: Visible groups: 0 / 76, labels: 3 / 70
pins2lts-mc-linux64( 0/ 8), 0.063: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 0.063: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 2/ 8), 0.097: [Blue] ~120 levels ~960 states ~2264 transitions
pins2lts-mc-linux64( 3/ 8), 0.161: [Blue] ~134 levels ~1920 states ~4008 transitions
pins2lts-mc-linux64( 3/ 8), 0.185: [Blue] ~145 levels ~3840 states ~6792 transitions
pins2lts-mc-linux64( 3/ 8), 0.215: [Blue] ~145 levels ~7680 states ~13416 transitions
pins2lts-mc-linux64( 3/ 8), 0.288: [Blue] ~145 levels ~15360 states ~31288 transitions
pins2lts-mc-linux64( 3/ 8), 0.570: [Blue] ~156 levels ~30720 states ~61224 transitions
pins2lts-mc-linux64( 3/ 8), 1.086: [Blue] ~156 levels ~61440 states ~139248 transitions
pins2lts-mc-linux64( 3/ 8), 1.531: [Blue] ~156 levels ~122880 states ~312696 transitions
pins2lts-mc-linux64( 3/ 8), 2.224: [Blue] ~167 levels ~245760 states ~587512 transitions
pins2lts-mc-linux64( 3/ 8), 3.340: [Blue] ~167 levels ~491520 states ~1475104 transitions
pins2lts-mc-linux64( 3/ 8), 5.114: [Blue] ~178 levels ~983040 states ~2756952 transitions
pins2lts-mc-linux64( 3/ 8), 8.535: [Blue] ~178 levels ~1966080 states ~6597984 transitions
pins2lts-mc-linux64( 3/ 8), 14.346: [Blue] ~189 levels ~3932160 states ~12311496 transitions
pins2lts-mc-linux64( 2/ 8), 26.220: [Blue] ~1222 levels ~7864320 states ~19006640 transitions
pins2lts-mc-linux64( 2/ 8), 49.611: [Blue] ~1222 levels ~15728640 states ~38056608 transitions
pins2lts-mc-linux64( 2/ 8), 96.086: [Blue] ~1222 levels ~31457280 states ~76320872 transitions
pins2lts-mc-linux64( 7/ 8), 199.820: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 199.843:
pins2lts-mc-linux64( 0/ 8), 199.843: Explored 52767960 states 175341525 transitions, fanout: 3.323
pins2lts-mc-linux64( 0/ 8), 199.843: Total exploration time 199.770 sec (199.710 sec minimum, 199.744 sec on average)
pins2lts-mc-linux64( 0/ 8), 199.843: States per second: 264144, Transitions per second: 877717
pins2lts-mc-linux64( 0/ 8), 199.843:
pins2lts-mc-linux64( 0/ 8), 199.843: State space has 46251474 states, 277644 are accepting
pins2lts-mc-linux64( 0/ 8), 199.843: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 199.843: blue states: 52767960 (114.09%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 199.843: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 199.843: all-red states: 28571030 (61.77%), bogus 2856563 (6.18%)
pins2lts-mc-linux64( 0/ 8), 199.843:
pins2lts-mc-linux64( 0/ 8), 199.843: Total memory used for local state coloring: 0.1MB
pins2lts-mc-linux64( 0/ 8), 199.843:
pins2lts-mc-linux64( 0/ 8), 199.843: Queue width: 8B, total height: 8733, memory: 0.07MB
pins2lts-mc-linux64( 0/ 8), 199.843: Tree memory: 608.9MB, 13.8 B/state, compr.: 5.4%
pins2lts-mc-linux64( 0/ 8), 199.843: Tree fill ratio (roots/leafs): 34.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 199.843: Stored 63 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 199.843: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 199.843: Est. total memory use: 608.9MB (~1024.1MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin261416542028090119;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '(<>([]((LTLAPp0==true)))||([](<>((LTLAPp1==true)))&&<>(!(LTLAPp2==true))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin261416542028090119;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '(<>([]((LTLAPp0==true)))||([](<>((LTLAPp1==true)))&&<>(!(LTLAPp2==true))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2023-04-07 17:55:35] [INFO ] Flatten gal took : 3 ms
[2023-04-07 17:55:35] [INFO ] Time to serialize gal into /tmp/LTLFireability193861297427144887.gal : 1 ms
[2023-04-07 17:55:35] [INFO ] Time to serialize properties into /tmp/LTLFireability6458805407451472665.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability193861297427144887.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability6458805407451472665.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...296
Read 2 LTL properties
Checking formula 0 : !(((F(G("((state_c20<1)||(capacity_c4<1))")))||((G(F("(capacity_c4>=1)")))&&(F("(capacity_c13>=1)")))))
Formula 0 simplified : GF!"((state_c20<1)||(capacity_c4<1))" & (FG!"(capacity_c4>=1)" | G!"(capacity_c13>=1)")
Reverse transition relation is NOT exact ! Due to transitions t12, t21, t22, t23, t24, t25, t26, t27, t28, t29, t30, t31, t32, t33, t34, t35, t36, t37, t38...270
Computing Next relation with stutter on 1.07042e+08 deadlock states
Detected timeout of ITS tools.
[2023-04-07 18:17:39] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:17:39] [INFO ] Input system was already deterministic with 63 transitions.
[2023-04-07 18:17:39] [INFO ] Transformed 62 places.
[2023-04-07 18:17:39] [INFO ] Transformed 63 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2023-04-07 18:17:39] [INFO ] Time to serialize gal into /tmp/LTLFireability10101782241925720591.gal : 2 ms
[2023-04-07 18:17:39] [INFO ] Time to serialize properties into /tmp/LTLFireability692321295522294918.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability10101782241925720591.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability692321295522294918.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...342
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !(((F(G("((state_c20<1)||(capacity_c4<1))")))||((G(F("(capacity_c4>=1)")))&&(F("(capacity_c13>=1)")))))
Formula 0 simplified : GF!"((state_c20<1)||(capacity_c4<1))" & (FG!"(capacity_c4>=1)" | G!"(capacity_c13>=1)")
Reverse transition relation is NOT exact ! Due to transitions t12, t21, t22, t23, t24, t25, t26, t27, t28, t29, t30, t31, t32, t33, t34, t35, t36, t37, t38...270
Computing Next relation with stutter on 1.07042e+08 deadlock states
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 12969720 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16041740 kB
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CryptoMiner-PT-D20N100"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is CryptoMiner-PT-D20N100, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r517-tall-167987243600212"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CryptoMiner-PT-D20N100.tgz
mv CryptoMiner-PT-D20N100 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;