About the Execution of LoLa+red for Diffusion2D-PT-D05N250
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 415.367 | 18495.00 | 29339.00 | 549.50 | TFTFFFFFFFFFFFTF | 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.r135-smll-167819413500091.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is Diffusion2D-PT-D05N250, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r135-smll-167819413500091
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 512K
-rw-r--r-- 1 mcc users 6.5K Feb 26 03:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Feb 26 03:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 26 03:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 36K Feb 26 03:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.4K Feb 25 15:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 15:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Feb 25 15:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 26 03:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 143K Feb 26 03:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Feb 26 03:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Feb 26 03:58 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 15:57 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:57 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 8 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 55K Mar 5 18:22 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 Diffusion2D-PT-D05N250-LTLCardinality-00
FORMULA_NAME Diffusion2D-PT-D05N250-LTLCardinality-01
FORMULA_NAME Diffusion2D-PT-D05N250-LTLCardinality-02
FORMULA_NAME Diffusion2D-PT-D05N250-LTLCardinality-03
FORMULA_NAME Diffusion2D-PT-D05N250-LTLCardinality-04
FORMULA_NAME Diffusion2D-PT-D05N250-LTLCardinality-05
FORMULA_NAME Diffusion2D-PT-D05N250-LTLCardinality-06
FORMULA_NAME Diffusion2D-PT-D05N250-LTLCardinality-07
FORMULA_NAME Diffusion2D-PT-D05N250-LTLCardinality-08
FORMULA_NAME Diffusion2D-PT-D05N250-LTLCardinality-09
FORMULA_NAME Diffusion2D-PT-D05N250-LTLCardinality-10
FORMULA_NAME Diffusion2D-PT-D05N250-LTLCardinality-11
FORMULA_NAME Diffusion2D-PT-D05N250-LTLCardinality-12
FORMULA_NAME Diffusion2D-PT-D05N250-LTLCardinality-13
FORMULA_NAME Diffusion2D-PT-D05N250-LTLCardinality-14
FORMULA_NAME Diffusion2D-PT-D05N250-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1678278340678
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Diffusion2D-PT-D05N250
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-08 12:25:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-08 12:25:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 12:25:43] [INFO ] Load time of PNML (sax parser for PT used): 62 ms
[2023-03-08 12:25:43] [INFO ] Transformed 25 places.
[2023-03-08 12:25:43] [INFO ] Transformed 144 transitions.
[2023-03-08 12:25:43] [INFO ] Parsed PT model containing 25 places and 144 transitions and 288 arcs in 157 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA Diffusion2D-PT-D05N250-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Diffusion2D-PT-D05N250-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Diffusion2D-PT-D05N250-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 19 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 144/144 transitions.
Applied a total of 0 rules in 16 ms. Remains 25 /25 variables (removed 0) and now considering 144/144 (removed 0) transitions.
// Phase 1: matrix 144 rows 25 cols
[2023-03-08 12:25:43] [INFO ] Computed 1 place invariants in 13 ms
[2023-03-08 12:25:43] [INFO ] Implicit Places using invariants in 161 ms returned []
[2023-03-08 12:25:43] [INFO ] Invariant cache hit.
[2023-03-08 12:25:43] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 311 ms to find 0 implicit places.
[2023-03-08 12:25:43] [INFO ] Invariant cache hit.
[2023-03-08 12:25:43] [INFO ] Dead Transitions using invariants and state equation in 148 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 478 ms. Remains : 25/25 places, 144/144 transitions.
Support contains 19 out of 25 places after structural reductions.
[2023-03-08 12:25:43] [INFO ] Flatten gal took : 45 ms
[2023-03-08 12:25:44] [INFO ] Flatten gal took : 17 ms
[2023-03-08 12:25:44] [INFO ] Input system was already deterministic with 144 transitions.
Incomplete random walk after 10049 steps, including 2 resets, run finished after 185 ms. (steps per millisecond=54 ) properties (out of 31) seen :22
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 9) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
[2023-03-08 12:25:44] [INFO ] Invariant cache hit.
[2023-03-08 12:25:44] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(p0)||X(p1))))'
Support contains 2 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 144/144 transitions.
Applied a total of 0 rules in 3 ms. Remains 25 /25 variables (removed 0) and now considering 144/144 (removed 0) transitions.
[2023-03-08 12:25:44] [INFO ] Invariant cache hit.
[2023-03-08 12:25:44] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-08 12:25:44] [INFO ] Invariant cache hit.
[2023-03-08 12:25:45] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
[2023-03-08 12:25:45] [INFO ] Invariant cache hit.
[2023-03-08 12:25:45] [INFO ] Dead Transitions using invariants and state equation in 117 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 224 ms. Remains : 25/25 places, 144/144 transitions.
Stuttering acceptance computed with spot in 343 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : Diffusion2D-PT-D05N250-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(LEQ 2 s14), p1:(LEQ 2 s11)], 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA Diffusion2D-PT-D05N250-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D05N250-LTLCardinality-01 finished in 653 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(X(X((p0 U p1))))&&F(p2))))'
Support contains 5 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 144/144 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 144/144 (removed 0) transitions.
[2023-03-08 12:25:45] [INFO ] Invariant cache hit.
[2023-03-08 12:25:45] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-08 12:25:45] [INFO ] Invariant cache hit.
[2023-03-08 12:25:45] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 127 ms to find 0 implicit places.
[2023-03-08 12:25:45] [INFO ] Invariant cache hit.
[2023-03-08 12:25:45] [INFO ] Dead Transitions using invariants and state equation in 142 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 272 ms. Remains : 25/25 places, 144/144 transitions.
Stuttering acceptance computed with spot in 348 ms :[(OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Running random walk in product with property : Diffusion2D-PT-D05N250-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}, { cond=(NOT p2), acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 5}, { cond=(NOT p2), acceptance={} source=3 dest: 6}], [{ cond=(NOT p2), acceptance={} source=4 dest: 7}], [{ cond=(NOT p1), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=6 dest: 7}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=7 dest: 2}]], initial=0, aps=[p2:(LEQ s19 s23), p1:(LEQ s11 s13), p0:(LEQ s0 s11)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 21843 reset in 369 ms.
Stack based approach found an accepted trace after 103 steps with 23 reset with depth 11 and stack size 11 in 1 ms.
FORMULA Diffusion2D-PT-D05N250-LTLCardinality-03 FALSE TECHNIQUES STACK_TEST
Treatment of property Diffusion2D-PT-D05N250-LTLCardinality-03 finished in 1014 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(p0)||(p1&&F(G(p2))))))'
Support contains 6 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 144/144 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 144/144 (removed 0) transitions.
[2023-03-08 12:25:46] [INFO ] Invariant cache hit.
[2023-03-08 12:25:46] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-08 12:25:46] [INFO ] Invariant cache hit.
[2023-03-08 12:25:46] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
[2023-03-08 12:25:46] [INFO ] Invariant cache hit.
[2023-03-08 12:25:46] [INFO ] Dead Transitions using invariants and state equation in 107 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 186 ms. Remains : 25/25 places, 144/144 transitions.
Stuttering acceptance computed with spot in 367 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : Diffusion2D-PT-D05N250-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(AND p2 (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(OR (LEQ s6 s20) (LEQ s3 s11)), p0:(LEQ s6 s20), p2:(GT s12 s17)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 41168 reset in 208 ms.
Product exploration explored 100000 steps with 41044 reset in 280 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0 p2), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0)))))]
False Knowledge obtained : [(X (AND p2 (NOT p0))), (X (NOT (AND p2 (NOT p0)))), (X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
Knowledge based reduction with 5 factoid took 429 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Finished random walk after 6781 steps, including 2 resets, run visited all 2 properties in 5 ms. (steps per millisecond=1356 )
Knowledge obtained : [(AND p1 p0 p2), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0)))))]
False Knowledge obtained : [(X (AND p2 (NOT p0))), (X (NOT (AND p2 (NOT p0)))), (X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (AND (NOT p0) p2)), (F (AND (NOT p0) (NOT p2)))]
Knowledge based reduction with 5 factoid took 419 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 4 out of 25 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 144/144 transitions.
Applied a total of 0 rules in 2 ms. Remains 25 /25 variables (removed 0) and now considering 144/144 (removed 0) transitions.
[2023-03-08 12:25:48] [INFO ] Invariant cache hit.
[2023-03-08 12:25:48] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-08 12:25:48] [INFO ] Invariant cache hit.
[2023-03-08 12:25:48] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
[2023-03-08 12:25:48] [INFO ] Invariant cache hit.
[2023-03-08 12:25:48] [INFO ] Dead Transitions using invariants and state equation in 98 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 187 ms. Remains : 25/25 places, 144/144 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(X (AND (NOT p0) p2)), (X (NOT (AND (NOT p0) p2))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2))))]
Knowledge based reduction with 3 factoid took 216 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 188 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10043 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1255 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 2) seen :1
Finished Best-First random walk after 3118 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=779 )
Knowledge obtained : [(AND p0 p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(X (AND (NOT p0) p2)), (X (NOT (AND (NOT p0) p2))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (F (AND (NOT p0) p2)), (F (AND (NOT p0) (NOT p2)))]
Knowledge based reduction with 3 factoid took 257 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 41059 reset in 119 ms.
Product exploration explored 100000 steps with 40520 reset in 134 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 4 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 144/144 transitions.
Graph (trivial) has 94 edges and 25 vertex of which 21 / 25 are part of one of the 1 SCC in 4 ms
Free SCC test removed 20 places
Ensure Unique test removed 131 transitions
Reduce isomorphic transitions removed 131 transitions.
Applied a total of 1 rules in 10 ms. Remains 5 /25 variables (removed 20) and now considering 13/144 (removed 131) transitions.
[2023-03-08 12:25:50] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 13 rows 5 cols
[2023-03-08 12:25:50] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-08 12:25:50] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5/25 places, 13/144 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 44 ms. Remains : 5/25 places, 13/144 transitions.
Support contains 4 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 144/144 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 144/144 (removed 0) transitions.
// Phase 1: matrix 144 rows 25 cols
[2023-03-08 12:25:50] [INFO ] Computed 1 place invariants in 3 ms
[2023-03-08 12:25:50] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-08 12:25:50] [INFO ] Invariant cache hit.
[2023-03-08 12:25:50] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
[2023-03-08 12:25:50] [INFO ] Invariant cache hit.
[2023-03-08 12:25:50] [INFO ] Dead Transitions using invariants and state equation in 107 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 188 ms. Remains : 25/25 places, 144/144 transitions.
Treatment of property Diffusion2D-PT-D05N250-LTLCardinality-04 finished in 4116 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U G((X((p1||X(p2)))||G(p3)))))'
Support contains 6 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 144/144 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 144/144 (removed 0) transitions.
[2023-03-08 12:25:50] [INFO ] Invariant cache hit.
[2023-03-08 12:25:50] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-08 12:25:50] [INFO ] Invariant cache hit.
[2023-03-08 12:25:50] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
[2023-03-08 12:25:50] [INFO ] Invariant cache hit.
[2023-03-08 12:25:50] [INFO ] Dead Transitions using invariants and state equation in 89 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 173 ms. Remains : 25/25 places, 144/144 transitions.
Stuttering acceptance computed with spot in 717 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p3) (NOT p2)), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p3) (NOT p1)), (AND (NOT p1) (NOT p2) (NOT p3)), (NOT p2), true, (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2))), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p2)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3))), (NOT p0), (NOT p3), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3)))]
Running random walk in product with property : Diffusion2D-PT-D05N250-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p3) p0), acceptance={0, 1} source=0 dest: 3}, { cond=(AND p3 (NOT p0)), acceptance={} source=0 dest: 4}, { cond=(AND p3 p0), acceptance={1} source=0 dest: 5}], [{ cond=(NOT p1), acceptance={} source=1 dest: 6}], [{ cond=(NOT p3), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}, { cond=p3, acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 6}, { cond=(AND (NOT p3) p0 (NOT p1)), acceptance={0, 1} source=3 dest: 8}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 9}, { cond=(AND p3 p0 (NOT p1)), acceptance={1} source=3 dest: 10}], [{ cond=(AND (NOT p3) (NOT p1)), acceptance={} source=4 dest: 6}, { cond=(AND p3 (NOT p1)), acceptance={} source=4 dest: 11}], [{ cond=(AND (NOT p3) (NOT p0) (NOT p1)), acceptance={} source=5 dest: 6}, { cond=(AND (NOT p3) p0 (NOT p1)), acceptance={0, 1} source=5 dest: 8}, { cond=(AND (NOT p3) p0 (NOT p1)), acceptance={0} source=5 dest: 9}, { cond=(AND p3 p0 (NOT p1)), acceptance={1} source=5 dest: 10}, { cond=(AND p3 (NOT p0) (NOT p1)), acceptance={} source=5 dest: 11}, { cond=(AND p3 p0 (NOT p1)), acceptance={} source=5 dest: 12}], [{ cond=(NOT p2), acceptance={} source=6 dest: 7}], [{ cond=true, acceptance={0, 1} source=7 dest: 7}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=8 dest: 6}, { cond=(AND (NOT p3) p0 (NOT p1) (NOT p2)), acceptance={0, 1} source=8 dest: 8}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=8 dest: 9}, { cond=(AND p3 p0 (NOT p1) (NOT p2)), acceptance={1} source=8 dest: 10}], [{ cond=(AND p0 (NOT p2)), acceptance={0} source=9 dest: 0}, { cond=(AND (NOT p3) p0 (NOT p2)), acceptance={0, 1} source=9 dest: 3}, { cond=(AND p3 p0 (NOT p2)), acceptance={1} source=9 dest: 5}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=9 dest: 7}, { cond=(AND p0 (NOT p2)), acceptance={} source=9 dest: 13}], [{ cond=(AND (NOT p3) (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=10 dest: 6}, { cond=(AND (NOT p3) p0 (NOT p1) (NOT p2)), acceptance={0, 1} source=10 dest: 8}, { cond=(AND (NOT p3) p0 (NOT p1) (NOT p2)), acceptance={0} source=10 dest: 9}, { cond=(AND p3 p0 (NOT p1) (NOT p2)), acceptance={1} source=10 dest: 10}, { cond=(AND p3 (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=10 dest: 11}, { cond=(AND p3 p0 (NOT p1) (NOT p2)), acceptance={} source=10 dest: 12}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=11 dest: 7}, { cond=(AND p3 (NOT p2)), acceptance={} source=11 dest: 14}], [{ cond=(AND (NOT p3) p0 (NOT p2)), acceptance={0} source=12 dest: 0}, { cond=(AND (NOT p3) p0 (NOT p2)), acceptance={0, 1} source=12 dest: 3}, { cond=(AND p3 p0 (NOT p2)), acceptance={1} source=12 dest: 5}, { cond=(AND (NOT p3) (NOT p0) (NOT p2)), acceptance={} source=12 dest: 7}, { cond=(AND (NOT p3) p0 (NOT p2)), acceptance={} source=12 dest: 13}, { cond=(AND p3 (NOT p0) (NOT p2)), acceptance={} source=12 dest: 14}, { cond=(AND p3 p0 (NOT p2)), acceptance={} source=12 dest: 15}], [{ cond=(NOT p0), acceptance={} source=13 dest: 7}, { cond=p0, acceptance={} source=13 dest: 13}], [{ cond=(NOT p3), acceptance={} source=14 dest: 7}, { cond=p3, acceptance={} source=14 dest: 14}], [{ cond=(AND (NOT p3) p0), acceptance={0} source=15 dest: 0}, { cond=(AND (NOT p3) p0), acceptance={0, 1} source=15 dest: 3}, { cond=(AND p3 p0), acceptance={1} source=15 dest: 5}, { cond=(AND (NOT p3) (NOT p0)), acceptance={} source=15 dest: 7}, { cond=(AND (NOT p3) p0), acceptance={} source=15 dest: 13}, { cond=(AND p3 (NOT p0)), acceptance={} source=15 dest: 14}, { cond=(AND p3 p0), acceptance={} source=15 dest: 15}]], initial=0, aps=[p0:(LEQ s23 s13), p3:(LEQ 2 s18), p1:(LEQ s8 s24), p2:(OR (LEQ s23 s13) (LEQ 2 s21))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4257 steps with 1347 reset in 12 ms.
FORMULA Diffusion2D-PT-D05N250-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D05N250-LTLCardinality-05 finished in 947 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 144/144 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 144/144 (removed 0) transitions.
[2023-03-08 12:25:51] [INFO ] Invariant cache hit.
[2023-03-08 12:25:51] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-08 12:25:51] [INFO ] Invariant cache hit.
[2023-03-08 12:25:51] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
[2023-03-08 12:25:51] [INFO ] Invariant cache hit.
[2023-03-08 12:25:51] [INFO ] Dead Transitions using invariants and state equation in 105 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 203 ms. Remains : 25/25 places, 144/144 transitions.
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Diffusion2D-PT-D05N250-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 2 s20)], 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 373 reset in 471 ms.
Stack based approach found an accepted trace after 8 steps with 0 reset with depth 9 and stack size 9 in 1 ms.
FORMULA Diffusion2D-PT-D05N250-LTLCardinality-06 FALSE TECHNIQUES STACK_TEST
Treatment of property Diffusion2D-PT-D05N250-LTLCardinality-06 finished in 785 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 144/144 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 144/144 (removed 0) transitions.
[2023-03-08 12:25:52] [INFO ] Invariant cache hit.
[2023-03-08 12:25:52] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-08 12:25:52] [INFO ] Invariant cache hit.
[2023-03-08 12:25:52] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
[2023-03-08 12:25:52] [INFO ] Invariant cache hit.
[2023-03-08 12:25:52] [INFO ] Dead Transitions using invariants and state equation in 106 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 200 ms. Remains : 25/25 places, 144/144 transitions.
Stuttering acceptance computed with spot in 179 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Diffusion2D-PT-D05N250-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (LEQ 2 s24) (LEQ 3 s22))], 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, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA Diffusion2D-PT-D05N250-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D05N250-LTLCardinality-07 finished in 394 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0 U !((((X(!p0)||p1) U p2) U p1)&&p0))))'
Support contains 5 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 144/144 transitions.
Graph (trivial) has 98 edges and 25 vertex of which 20 / 25 are part of one of the 1 SCC in 0 ms
Free SCC test removed 19 places
Ensure Unique test removed 121 transitions
Reduce isomorphic transitions removed 121 transitions.
Applied a total of 1 rules in 3 ms. Remains 6 /25 variables (removed 19) and now considering 23/144 (removed 121) transitions.
// Phase 1: matrix 23 rows 6 cols
[2023-03-08 12:25:52] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-08 12:25:52] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-08 12:25:52] [INFO ] Invariant cache hit.
[2023-03-08 12:25:52] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
[2023-03-08 12:25:52] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 12:25:52] [INFO ] Invariant cache hit.
[2023-03-08 12:25:52] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/25 places, 23/144 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 148 ms. Remains : 6/25 places, 23/144 transitions.
Stuttering acceptance computed with spot in 158 ms :[(AND p0 p1), (AND p0 p1)]
Running random walk in product with property : Diffusion2D-PT-D05N250-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1) p2), acceptance={} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s4 s3), p1:(LEQ s2 s0), p2:(LEQ s3 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA Diffusion2D-PT-D05N250-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D05N250-LTLCardinality-08 finished in 331 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0||G(F(!p0))))))'
Support contains 2 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 144/144 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 144/144 (removed 0) transitions.
// Phase 1: matrix 144 rows 25 cols
[2023-03-08 12:25:53] [INFO ] Computed 1 place invariants in 2 ms
[2023-03-08 12:25:53] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-08 12:25:53] [INFO ] Invariant cache hit.
[2023-03-08 12:25:53] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 142 ms to find 0 implicit places.
[2023-03-08 12:25:53] [INFO ] Invariant cache hit.
[2023-03-08 12:25:53] [INFO ] Dead Transitions using invariants and state equation in 100 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 246 ms. Remains : 25/25 places, 144/144 transitions.
Stuttering acceptance computed with spot in 176 ms :[false, false, false, p0, p0]
Running random walk in product with property : Diffusion2D-PT-D05N250-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=p0, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(GT s22 s19)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 1604 reset in 326 ms.
Stack based approach found an accepted trace after 122 steps with 1 reset with depth 40 and stack size 34 in 0 ms.
FORMULA Diffusion2D-PT-D05N250-LTLCardinality-10 FALSE TECHNIQUES STACK_TEST
Treatment of property Diffusion2D-PT-D05N250-LTLCardinality-10 finished in 777 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))&&F((p1&&X((F(!p0)||G(p1))))))))'
Support contains 2 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 144/144 transitions.
Graph (trivial) has 118 edges and 25 vertex of which 23 / 25 are part of one of the 1 SCC in 1 ms
Free SCC test removed 22 places
Ensure Unique test removed 139 transitions
Reduce isomorphic transitions removed 139 transitions.
Applied a total of 1 rules in 2 ms. Remains 3 /25 variables (removed 22) and now considering 5/144 (removed 139) transitions.
// Phase 1: matrix 5 rows 3 cols
[2023-03-08 12:25:53] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-08 12:25:53] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-03-08 12:25:53] [INFO ] Invariant cache hit.
[2023-03-08 12:25:53] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2023-03-08 12:25:53] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 12:25:53] [INFO ] Invariant cache hit.
[2023-03-08 12:25:53] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3/25 places, 5/144 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 70 ms. Remains : 3/25 places, 5/144 transitions.
Stuttering acceptance computed with spot in 302 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : Diffusion2D-PT-D05N250-LTLCardinality-11 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=p1, acceptance={} source=0 dest: 3}], [{ 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}, { cond=p1, acceptance={} source=2 dest: 3}], [{ cond=(AND p0 p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 4}], [{ cond=(AND p0 p1), acceptance={0} source=4 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ 2 s1), p1:(GT 3 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA Diffusion2D-PT-D05N250-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D05N250-LTLCardinality-11 finished in 397 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 144/144 transitions.
Graph (trivial) has 112 edges and 25 vertex of which 23 / 25 are part of one of the 1 SCC in 1 ms
Free SCC test removed 22 places
Ensure Unique test removed 139 transitions
Reduce isomorphic transitions removed 139 transitions.
Applied a total of 1 rules in 2 ms. Remains 3 /25 variables (removed 22) and now considering 5/144 (removed 139) transitions.
[2023-03-08 12:25:54] [INFO ] Invariant cache hit.
[2023-03-08 12:25:54] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-03-08 12:25:54] [INFO ] Invariant cache hit.
[2023-03-08 12:25:54] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
[2023-03-08 12:25:54] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 12:25:54] [INFO ] Invariant cache hit.
[2023-03-08 12:25:54] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3/25 places, 5/144 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 68 ms. Remains : 3/25 places, 5/144 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : Diffusion2D-PT-D05N250-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s1 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 180 steps with 0 reset in 0 ms.
FORMULA Diffusion2D-PT-D05N250-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D05N250-LTLCardinality-12 finished in 119 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U G(p1)) U (!p0||F(p2)))))'
Support contains 3 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 144/144 transitions.
Applied a total of 0 rules in 0 ms. Remains 25 /25 variables (removed 0) and now considering 144/144 (removed 0) transitions.
// Phase 1: matrix 144 rows 25 cols
[2023-03-08 12:25:54] [INFO ] Computed 1 place invariants in 4 ms
[2023-03-08 12:25:54] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-08 12:25:54] [INFO ] Invariant cache hit.
[2023-03-08 12:25:54] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
[2023-03-08 12:25:54] [INFO ] Invariant cache hit.
[2023-03-08 12:25:54] [INFO ] Dead Transitions using invariants and state equation in 94 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 171 ms. Remains : 25/25 places, 144/144 transitions.
Stuttering acceptance computed with spot in 194 ms :[(AND (NOT p2) (NOT p1)), (AND p0 (NOT p2)), (NOT p2), (AND p0 (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2)))]
Running random walk in product with property : Diffusion2D-PT-D05N250-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=4 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={0} source=4 dest: 4}]], initial=1, aps=[p2:(LEQ 1 s3), p1:(LEQ 1 s18), p0:(GT 3 s11)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 2344 reset in 362 ms.
Stack based approach found an accepted trace after 32 steps with 0 reset with depth 33 and stack size 33 in 0 ms.
FORMULA Diffusion2D-PT-D05N250-LTLCardinality-13 FALSE TECHNIQUES STACK_TEST
Treatment of property Diffusion2D-PT-D05N250-LTLCardinality-13 finished in 756 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||F(p1)||(p2 U (G(p2)||(p2&&(p3 U !p2)))))))'
Support contains 6 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 144/144 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 144/144 (removed 0) transitions.
[2023-03-08 12:25:55] [INFO ] Invariant cache hit.
[2023-03-08 12:25:55] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-08 12:25:55] [INFO ] Invariant cache hit.
[2023-03-08 12:25:55] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
[2023-03-08 12:25:55] [INFO ] Invariant cache hit.
[2023-03-08 12:25:55] [INFO ] Dead Transitions using invariants and state equation in 92 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 170 ms. Remains : 25/25 places, 144/144 transitions.
Stuttering acceptance computed with spot in 301 ms :[(NOT p1), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0)), false, false]
Running random walk in product with property : Diffusion2D-PT-D05N250-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p2 (NOT p3)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p2 p3), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2 (NOT p3)), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p1) p2 (NOT p3)), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) (NOT p1) p2 p3), acceptance={} source=3 dest: 5}, { cond=(AND p0 (NOT p1) p2 p3), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) p2 (NOT p3)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p1) p2 p3), acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1) p2 (NOT p3)), acceptance={} source=6 dest: 2}, { cond=(AND p0 (NOT p1) p2 (NOT p3)), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p0) (NOT p1) p2 p3), acceptance={} source=6 dest: 5}, { cond=(AND p0 (NOT p1) p2 p3), acceptance={} source=6 dest: 6}]], initial=1, aps=[p1:(LEQ s9 s17), p2:(GT s20 s6), p3:(LEQ 2 s17), p0:(GT s19 s18)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 121 ms.
Product exploration explored 100000 steps with 50000 reset in 130 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p2) (NOT p3) (NOT p0)), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) p2 p3))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) p2 p3))), (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3)))), (X (NOT (AND p0 (NOT p1) p2 (NOT p3)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2 p3)))), (X (X (NOT (AND p0 (NOT p1) p2 p3)))), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p1) p2 p3)))), (X (X (NOT (AND p0 (NOT p1) p2 (NOT p3)))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT p1))), (X (X p1))]
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p1 (NOT p2) (NOT p3) (NOT p0))
Knowledge based reduction with 15 factoid took 665 ms. Reduced automaton from 7 states, 19 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Diffusion2D-PT-D05N250-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Diffusion2D-PT-D05N250-LTLCardinality-14 finished in 1423 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||(p1&&X(p2))))))'
Support contains 3 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 144/144 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 144/144 (removed 0) transitions.
[2023-03-08 12:25:56] [INFO ] Invariant cache hit.
[2023-03-08 12:25:56] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-08 12:25:56] [INFO ] Invariant cache hit.
[2023-03-08 12:25:56] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
[2023-03-08 12:25:56] [INFO ] Invariant cache hit.
[2023-03-08 12:25:56] [INFO ] Dead Transitions using invariants and state equation in 97 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 181 ms. Remains : 25/25 places, 144/144 transitions.
Stuttering acceptance computed with spot in 119 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : Diffusion2D-PT-D05N250-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(LEQ 3 s18), p0:(LEQ s12 s18), p2:(LEQ 3 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 100 reset in 572 ms.
Stack based approach found an accepted trace after 10 steps with 0 reset with depth 11 and stack size 11 in 0 ms.
FORMULA Diffusion2D-PT-D05N250-LTLCardinality-15 FALSE TECHNIQUES STACK_TEST
Treatment of property Diffusion2D-PT-D05N250-LTLCardinality-15 finished in 890 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(p0)||(p1&&F(G(p2))))))'
Found a Shortening insensitive property : Diffusion2D-PT-D05N250-LTLCardinality-04
Stuttering acceptance computed with spot in 117 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Support contains 6 out of 25 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 25/25 places, 144/144 transitions.
Graph (trivial) has 74 edges and 25 vertex of which 19 / 25 are part of one of the 1 SCC in 0 ms
Free SCC test removed 18 places
Ensure Unique test removed 121 transitions
Reduce isomorphic transitions removed 121 transitions.
Applied a total of 1 rules in 2 ms. Remains 7 /25 variables (removed 18) and now considering 23/144 (removed 121) transitions.
// Phase 1: matrix 23 rows 7 cols
[2023-03-08 12:25:57] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-08 12:25:57] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-03-08 12:25:57] [INFO ] Invariant cache hit.
[2023-03-08 12:25:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-08 12:25:57] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2023-03-08 12:25:57] [INFO ] Invariant cache hit.
[2023-03-08 12:25:57] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 7/25 places, 23/144 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 78 ms. Remains : 7/25 places, 23/144 transitions.
Running random walk in product with property : Diffusion2D-PT-D05N250-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(AND p2 (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(OR (LEQ s1 s5) (LEQ s0 s2)), p0:(LEQ s1 s5), p2:(GT s3 s4)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 32382 steps with 3802 reset in 129 ms.
Treatment of property Diffusion2D-PT-D05N250-LTLCardinality-04 finished in 445 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
[2023-03-08 12:25:57] [INFO ] Flatten gal took : 9 ms
[2023-03-08 12:25:57] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2023-03-08 12:25:57] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 25 places, 144 transitions and 288 arcs took 1 ms.
Total runtime 15059 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT Diffusion2D-PT-D05N250
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/372
LTLCardinality
FORMULA Diffusion2D-PT-D05N250-LTLCardinality-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
BK_STOP 1678278359173
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/372/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/372/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/372/LTLCardinality.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 1 (type EXCL) for 0 Diffusion2D-PT-D05N250-LTLCardinality-04
lola: time limit : 3600 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for Diffusion2D-PT-D05N250-LTLCardinality-04
lola: result : false
lola: markings : 2487
lola: fired transitions : 5949
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open formulas
FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Diffusion2D-PT-D05N250-LTLCardinality-04: LTL false LTL model checker
Time elapsed: 0 secs. Pages in use: 1
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Diffusion2D-PT-D05N250"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="lolaxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
echo " Input is Diffusion2D-PT-D05N250, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r135-smll-167819413500091"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Diffusion2D-PT-D05N250.tgz
mv Diffusion2D-PT-D05N250 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;