MCC'2024- Execution of r153-tall-171631151400222

About the Execution of 2023-gold for Diffusion2D-PT-D50N150

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
3828.071	144538.00	182987.00	542.20	FFFFFFFTFFFFFFFT	normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r153-tall-171631151400222.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is Diffusion2D-PT-D50N150, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r153-tall-171631151400222
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 7.8M
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.5K Apr 22 14:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Apr 22 14:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 11 14:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 127K Apr 11 14:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Apr 11 14:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Apr 11 14:17 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 22 14:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 22 14:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 8 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 7.3M May 18 16:42 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-D50N150-LTLCardinality-00
FORMULA_NAME Diffusion2D-PT-D50N150-LTLCardinality-01
FORMULA_NAME Diffusion2D-PT-D50N150-LTLCardinality-02
FORMULA_NAME Diffusion2D-PT-D50N150-LTLCardinality-03
FORMULA_NAME Diffusion2D-PT-D50N150-LTLCardinality-04
FORMULA_NAME Diffusion2D-PT-D50N150-LTLCardinality-05
FORMULA_NAME Diffusion2D-PT-D50N150-LTLCardinality-06
FORMULA_NAME Diffusion2D-PT-D50N150-LTLCardinality-07
FORMULA_NAME Diffusion2D-PT-D50N150-LTLCardinality-08
FORMULA_NAME Diffusion2D-PT-D50N150-LTLCardinality-09
FORMULA_NAME Diffusion2D-PT-D50N150-LTLCardinality-10
FORMULA_NAME Diffusion2D-PT-D50N150-LTLCardinality-11
FORMULA_NAME Diffusion2D-PT-D50N150-LTLCardinality-12
FORMULA_NAME Diffusion2D-PT-D50N150-LTLCardinality-13
FORMULA_NAME Diffusion2D-PT-D50N150-LTLCardinality-14
FORMULA_NAME Diffusion2D-PT-D50N150-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716420487977

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=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Diffusion2D-PT-D50N150
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-22 23:28:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-22 23:28:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 23:28:09] [INFO ] Load time of PNML (sax parser for PT used): 350 ms
[2024-05-22 23:28:09] [INFO ] Transformed 2500 places.
[2024-05-22 23:28:10] [INFO ] Transformed 19404 transitions.
[2024-05-22 23:28:10] [INFO ] Parsed PT model containing 2500 places and 19404 transitions and 38808 arcs in 498 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 17 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA Diffusion2D-PT-D50N150-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Diffusion2D-PT-D50N150-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 49 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 19404/19404 transitions.
Applied a total of 0 rules in 654 ms. Remains 2500 /2500 variables (removed 0) and now considering 19404/19404 (removed 0) transitions.
// Phase 1: matrix 19404 rows 2500 cols
[2024-05-22 23:28:11] [INFO ] Computed 1 invariants in 156 ms
[2024-05-22 23:28:11] [INFO ] Implicit Places using invariants in 696 ms returned []
Implicit Place search using SMT only with invariants took 720 ms to find 0 implicit places.
[2024-05-22 23:28:11] [INFO ] Invariant cache hit.
[2024-05-22 23:28:18] [INFO ] Dead Transitions using invariants and state equation in 7123 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8508 ms. Remains : 2500/2500 places, 19404/19404 transitions.
Support contains 49 out of 2500 places after structural reductions.
[2024-05-22 23:28:19] [INFO ] Flatten gal took : 500 ms
[2024-05-22 23:28:19] [INFO ] Flatten gal took : 349 ms
[2024-05-22 23:28:20] [INFO ] Input system was already deterministic with 19404 transitions.
Support contains 42 out of 2500 places (down from 49) after GAL structural reductions.
Incomplete random walk after 10119 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=235 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 30) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 29) seen :0
Interrupted probabilistic random walk after 157105 steps, run timeout after 3001 ms. (steps per millisecond=52 ) properties seen :{3=1, 23=1}
Probabilistic random walk after 157105 steps, saw 128456 distinct states, run finished after 3001 ms. (steps per millisecond=52 ) properties seen :2
Running SMT prover for 27 properties.
[2024-05-22 23:28:24] [INFO ] Invariant cache hit.
[2024-05-22 23:28:25] [INFO ] After 1363ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:27
[2024-05-22 23:28:26] [INFO ] [Nat]Absence check using 1 positive place invariants in 22 ms returned sat
[2024-05-22 23:28:45] [INFO ] After 17886ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :27
[2024-05-22 23:28:50] [INFO ] After 22976ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :27
Attempting to minimize the solution found.
Minimization took 6 ms.
[2024-05-22 23:28:50] [INFO ] After 25038ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :27
Fused 27 Parikh solutions to 26 different solutions.
Finished Parikh walk after 3736 steps, including 0 resets, run visited all 1 properties in 40 ms. (steps per millisecond=93 )
Parikh walk visited 27 properties in 5520 ms.
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.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U (p1||G(p0)))))'
Support contains 5 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 19404/19404 transitions.
Applied a total of 0 rules in 370 ms. Remains 2500 /2500 variables (removed 0) and now considering 19404/19404 (removed 0) transitions.
[2024-05-22 23:28:56] [INFO ] Invariant cache hit.
[2024-05-22 23:28:57] [INFO ] Implicit Places using invariants in 247 ms returned []
Implicit Place search using SMT only with invariants took 248 ms to find 0 implicit places.
[2024-05-22 23:28:57] [INFO ] Invariant cache hit.
[2024-05-22 23:29:04] [INFO ] Dead Transitions using invariants and state equation in 6853 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7476 ms. Remains : 2500/2500 places, 19404/19404 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 191 ms :[true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Diffusion2D-PT-D50N150-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(AND (GT s1773 s1735) (OR (LEQ s1032 s1518) (GT 2 s238))), p0:(OR (LEQ s1032 s1518) (GT 2 s238))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 10 reset in 3684 ms.
Product exploration explored 100000 steps with 13 reset in 2885 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 (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p0)), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 97 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 187 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10121 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1012 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 176105 steps, run timeout after 3001 ms. (steps per millisecond=58 ) properties seen :{}
Probabilistic random walk after 176105 steps, saw 142942 distinct states, run finished after 3001 ms. (steps per millisecond=58 ) properties seen :0
Running SMT prover for 4 properties.
[2024-05-22 23:29:14] [INFO ] Invariant cache hit.
[2024-05-22 23:29:14] [INFO ] After 347ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:3
[2024-05-22 23:29:15] [INFO ] [Nat]Absence check using 1 positive place invariants in 20 ms returned sat
[2024-05-22 23:29:23] [INFO ] After 8233ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2024-05-22 23:29:27] [INFO ] After 12364ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 1192 ms.
[2024-05-22 23:29:28] [INFO ] After 13976ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :3
Fused 4 Parikh solutions to 3 different solutions.
Finished Parikh walk after 28138 steps, including 0 resets, run visited all 3 properties in 359 ms. (steps per millisecond=78 )
Parikh walk visited 2 properties in 360 ms.
Support contains 5 out of 2500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 19404/19404 transitions.
Graph (trivial) has 19324 edges and 2500 vertex of which 2495 / 2500 are part of one of the 1 SCC in 15 ms
Free SCC test removed 2494 places
Drop transitions removed 19324 transitions
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 19394 transitions.
Applied a total of 1 rules in 43 ms. Remains 6 /2500 variables (removed 2494) and now considering 10/19404 (removed 19394) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 6/2500 places, 10/19404 transitions.
Finished random walk after 3323 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=1661 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p0)), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0)))]
False Knowledge obtained : [(F (AND p0 p1)), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 6 factoid took 201 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 176 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 149 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 19404/19404 transitions.
Graph (trivial) has 19324 edges and 2500 vertex of which 2495 / 2500 are part of one of the 1 SCC in 12 ms
Free SCC test removed 2494 places
Ensure Unique test removed 19393 transitions
Reduce isomorphic transitions removed 19393 transitions.
Applied a total of 1 rules in 32 ms. Remains 6 /2500 variables (removed 2494) and now considering 11/19404 (removed 19393) transitions.
// Phase 1: matrix 11 rows 6 cols
[2024-05-22 23:29:29] [INFO ] Computed 1 invariants in 1 ms
[2024-05-22 23:29:29] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-22 23:29:29] [INFO ] Invariant cache hit.
[2024-05-22 23:29:29] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2024-05-22 23:29:29] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-22 23:29:29] [INFO ] Invariant cache hit.
[2024-05-22 23:29:29] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/2500 places, 11/19404 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 103 ms. Remains : 6/2500 places, 11/19404 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 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 6 factoid took 362 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 175 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10121 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1012 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-22 23:29:30] [INFO ] Invariant cache hit.
[2024-05-22 23:29:30] [INFO ] After 20ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (G (NOT (AND (NOT p0) p1)))]
False Knowledge obtained : [(X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (AND p0 p1)), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 7 factoid took 362 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 109 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 104 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 91 ms :[true, (NOT p0), (NOT p0)]
Entered a terminal (fully accepting) state of product in 221 steps with 6 reset in 1 ms.
FORMULA Diffusion2D-PT-D50N150-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D50N150-LTLCardinality-00 finished in 34519 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&F(G(p1)))))'
Support contains 2 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 19404/19404 transitions.
Applied a total of 0 rules in 377 ms. Remains 2500 /2500 variables (removed 0) and now considering 19404/19404 (removed 0) transitions.
// Phase 1: matrix 19404 rows 2500 cols
[2024-05-22 23:29:31] [INFO ] Computed 1 invariants in 97 ms
[2024-05-22 23:29:31] [INFO ] Implicit Places using invariants in 388 ms returned []
Implicit Place search using SMT only with invariants took 389 ms to find 0 implicit places.
[2024-05-22 23:29:31] [INFO ] Invariant cache hit.
[2024-05-22 23:29:38] [INFO ] Dead Transitions using invariants and state equation in 7098 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7872 ms. Remains : 2500/2500 places, 19404/19404 transitions.
Stuttering acceptance computed with spot in 140 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : Diffusion2D-PT-D50N150-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ 3 s1375), p1:(LEQ 2 s2060)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Diffusion2D-PT-D50N150-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D50N150-LTLCardinality-01 finished in 8060 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 19404/19404 transitions.
Graph (trivial) has 19388 edges and 2500 vertex of which 2499 / 2500 are part of one of the 1 SCC in 9 ms
Free SCC test removed 2498 places
Ensure Unique test removed 19401 transitions
Reduce isomorphic transitions removed 19401 transitions.
Applied a total of 1 rules in 23 ms. Remains 2 /2500 variables (removed 2498) and now considering 3/19404 (removed 19401) transitions.
// Phase 1: matrix 3 rows 2 cols
[2024-05-22 23:29:39] [INFO ] Computed 1 invariants in 0 ms
[2024-05-22 23:29:39] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-22 23:29:39] [INFO ] Invariant cache hit.
[2024-05-22 23:29:39] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2024-05-22 23:29:39] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-22 23:29:39] [INFO ] Invariant cache hit.
[2024-05-22 23:29:39] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/2500 places, 3/19404 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 97 ms. Remains : 2/2500 places, 3/19404 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : Diffusion2D-PT-D50N150-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT 3 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 8 steps with 0 reset in 0 ms.
FORMULA Diffusion2D-PT-D50N150-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D50N150-LTLCardinality-02 finished in 153 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G((p0||G(p1))))||(G(p2)&&X(F(p1)))))'
Support contains 5 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 19404/19404 transitions.
Applied a total of 0 rules in 363 ms. Remains 2500 /2500 variables (removed 0) and now considering 19404/19404 (removed 0) transitions.
// Phase 1: matrix 19404 rows 2500 cols
[2024-05-22 23:29:39] [INFO ] Computed 1 invariants in 94 ms
[2024-05-22 23:29:40] [INFO ] Implicit Places using invariants in 339 ms returned []
Implicit Place search using SMT only with invariants took 343 ms to find 0 implicit places.
[2024-05-22 23:29:40] [INFO ] Invariant cache hit.
[2024-05-22 23:29:47] [INFO ] Dead Transitions using invariants and state equation in 7002 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7717 ms. Remains : 2500/2500 places, 19404/19404 transitions.
Stuttering acceptance computed with spot in 378 ms :[true, (OR (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p2)]
Running random walk in product with property : Diffusion2D-PT-D50N150-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 0}, { cond=(AND p2 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p2 p1), acceptance={0} source=1 dest: 8}], [{ cond=p2, acceptance={} source=2 dest: 4}, { cond=(NOT p2), acceptance={} source=2 dest: 7}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=4 dest: 0}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=4 dest: 3}, { cond=(AND p2 p0 (NOT p1)), acceptance={} source=4 dest: 4}, { cond=(AND p2 (NOT p0) p1), acceptance={} source=4 dest: 5}, { cond=(AND p2 p0 p1), acceptance={} source=4 dest: 6}, { cond=(AND (NOT p2) p0), acceptance={} source=4 dest: 7}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={} source=5 dest: 3}, { cond=(AND p2 p1), acceptance={} source=5 dest: 5}, { cond=(AND p2 (NOT p1)), acceptance={} source=5 dest: 8}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=6 dest: 0}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=6 dest: 3}, { cond=(AND p2 (NOT p0) p1), acceptance={} source=6 dest: 5}, { cond=(AND p2 p0), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p2) p0), acceptance={} source=6 dest: 7}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={} source=6 dest: 8}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=7 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=7 dest: 3}, { cond=p0, acceptance={} source=7 dest: 7}], [{ cond=(NOT p2), acceptance={} source=8 dest: 0}, { cond=p2, acceptance={} source=8 dest: 8}]], initial=2, aps=[p2:(LEQ s957 s742), p1:(GT s1256 s1729), p0:(LEQ 1 s1248)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1432 steps with 0 reset in 37 ms.
FORMULA Diffusion2D-PT-D50N150-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D50N150-LTLCardinality-03 finished in 8194 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(p0)||((p0||G(p2))&&p1))))'
Support contains 3 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 19404/19404 transitions.
Graph (trivial) has 19356 edges and 2500 vertex of which 2497 / 2500 are part of one of the 1 SCC in 7 ms
Free SCC test removed 2496 places
Ensure Unique test removed 19397 transitions
Reduce isomorphic transitions removed 19397 transitions.
Applied a total of 1 rules in 23 ms. Remains 4 /2500 variables (removed 2496) and now considering 7/19404 (removed 19397) transitions.
// Phase 1: matrix 7 rows 4 cols
[2024-05-22 23:29:47] [INFO ] Computed 1 invariants in 0 ms
[2024-05-22 23:29:47] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-22 23:29:47] [INFO ] Invariant cache hit.
[2024-05-22 23:29:47] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2024-05-22 23:29:47] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-22 23:29:47] [INFO ] Invariant cache hit.
[2024-05-22 23:29:47] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/2500 places, 7/19404 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 105 ms. Remains : 4/2500 places, 7/19404 transitions.
Stuttering acceptance computed with spot in 134 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true, (NOT p0), (NOT p2)]
Running random walk in product with property : Diffusion2D-PT-D50N150-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(OR (AND p0 p1) (AND p1 p2)), acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 1}, { cond=p2, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(GT 1 s2), p1:(AND (LEQ 1 s2) (LEQ 2 s1)), p2:(GT 1 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA Diffusion2D-PT-D50N150-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D50N150-LTLCardinality-04 finished in 269 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||F((p1&&X(p2))))))'
Support contains 4 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 19404/19404 transitions.
Applied a total of 0 rules in 377 ms. Remains 2500 /2500 variables (removed 0) and now considering 19404/19404 (removed 0) transitions.
// Phase 1: matrix 19404 rows 2500 cols
[2024-05-22 23:29:48] [INFO ] Computed 1 invariants in 79 ms
[2024-05-22 23:29:48] [INFO ] Implicit Places using invariants in 305 ms returned []
Implicit Place search using SMT only with invariants took 307 ms to find 0 implicit places.
[2024-05-22 23:29:48] [INFO ] Invariant cache hit.
[2024-05-22 23:29:55] [INFO ] Dead Transitions using invariants and state equation in 6608 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7295 ms. Remains : 2500/2500 places, 19404/19404 transitions.
Stuttering acceptance computed with spot in 179 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : Diffusion2D-PT-D50N150-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=(AND p1 (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=p1, acceptance={0} source=3 dest: 1}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(LEQ 3 s1964), p1:(GT s970 s1188), p2:(GT 3 s895)], 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][false, false, false, false]]
Product exploration explored 100000 steps with 489 reset in 1153 ms.
Stack based approach found an accepted trace after 15 steps with 0 reset with depth 16 and stack size 16 in 1 ms.
FORMULA Diffusion2D-PT-D50N150-LTLCardinality-05 FALSE TECHNIQUES STACK_TEST
Treatment of property Diffusion2D-PT-D50N150-LTLCardinality-05 finished in 8675 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&F(p1)))'
Support contains 3 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 19404/19404 transitions.
Graph (trivial) has 19362 edges and 2500 vertex of which 2497 / 2500 are part of one of the 1 SCC in 6 ms
Free SCC test removed 2496 places
Ensure Unique test removed 19397 transitions
Reduce isomorphic transitions removed 19397 transitions.
Applied a total of 1 rules in 18 ms. Remains 4 /2500 variables (removed 2496) and now considering 7/19404 (removed 19397) transitions.
// Phase 1: matrix 7 rows 4 cols
[2024-05-22 23:29:56] [INFO ] Computed 1 invariants in 0 ms
[2024-05-22 23:29:56] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-22 23:29:56] [INFO ] Invariant cache hit.
[2024-05-22 23:29:56] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2024-05-22 23:29:56] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-22 23:29:56] [INFO ] Invariant cache hit.
[2024-05-22 23:29:56] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/2500 places, 7/19404 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 121 ms. Remains : 4/2500 places, 7/19404 transitions.
Stuttering acceptance computed with spot in 108 ms :[(NOT p1), (NOT p0), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : Diffusion2D-PT-D50N150-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=2, aps=[p1:(OR (LEQ 2 s0) (LEQ s1 s2)), p0:(GT s1 s2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA Diffusion2D-PT-D50N150-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D50N150-LTLCardinality-06 finished in 253 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 19404/19404 transitions.
Applied a total of 0 rules in 342 ms. Remains 2500 /2500 variables (removed 0) and now considering 19404/19404 (removed 0) transitions.
// Phase 1: matrix 19404 rows 2500 cols
[2024-05-22 23:29:57] [INFO ] Computed 1 invariants in 79 ms
[2024-05-22 23:29:57] [INFO ] Implicit Places using invariants in 320 ms returned []
Implicit Place search using SMT only with invariants took 322 ms to find 0 implicit places.
[2024-05-22 23:29:57] [INFO ] Invariant cache hit.
[2024-05-22 23:30:03] [INFO ] Dead Transitions using invariants and state equation in 6580 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7248 ms. Remains : 2500/2500 places, 19404/19404 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Diffusion2D-PT-D50N150-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT 2 s880)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 2214 ms.
Product exploration explored 100000 steps with 50000 reset in 2216 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 20 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Diffusion2D-PT-D50N150-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Diffusion2D-PT-D50N150-LTLCardinality-07 finished in 11843 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0||X((G((p0||X(G((p1 U p2))))) U (p0&&G((p0||X(G((p1 U p2))))))))))))'
Support contains 4 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 19404/19404 transitions.
Graph (trivial) has 19340 edges and 2500 vertex of which 2496 / 2500 are part of one of the 1 SCC in 7 ms
Free SCC test removed 2495 places
Ensure Unique test removed 19395 transitions
Reduce isomorphic transitions removed 19395 transitions.
Applied a total of 1 rules in 21 ms. Remains 5 /2500 variables (removed 2495) and now considering 9/19404 (removed 19395) transitions.
// Phase 1: matrix 9 rows 5 cols
[2024-05-22 23:30:08] [INFO ] Computed 1 invariants in 0 ms
[2024-05-22 23:30:08] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-22 23:30:08] [INFO ] Invariant cache hit.
[2024-05-22 23:30:08] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
[2024-05-22 23:30:08] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-22 23:30:08] [INFO ] Invariant cache hit.
[2024-05-22 23:30:08] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5/2500 places, 9/19404 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 107 ms. Remains : 5/2500 places, 9/19404 transitions.
Stuttering acceptance computed with spot in 393 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : Diffusion2D-PT-D50N150-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={1, 2} source=0 dest: 0}, { cond=(NOT p0), acceptance={0, 1, 2} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0, 1, 2} source=1 dest: 1}, { cond=(NOT p0), acceptance={1, 2} source=1 dest: 2}, { cond=p0, acceptance={2} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={1, 2} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1, 2} source=2 dest: 1}, { cond=(OR p2 p1), acceptance={1} source=2 dest: 2}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p0) p1)), acceptance={0, 1} source=2 dest: 4}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0, 1, 2} source=2 dest: 5}, { cond=(AND (NOT p2) p1), acceptance={1, 2} source=2 dest: 6}], [{ cond=(NOT p0), acceptance={1, 2} source=3 dest: 2}, { cond=p0, acceptance={2} source=3 dest: 3}, { cond=(NOT p0), acceptance={0, 2} source=3 dest: 3}, { cond=(NOT p0), acceptance={0, 1, 2} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1, 2} source=4 dest: 1}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p0) p1)), acceptance={1} source=4 dest: 2}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={1, 2} source=4 dest: 2}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={2} source=4 dest: 3}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p0) p1)), acceptance={0, 1} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0, 1, 2} source=4 dest: 5}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={1, 2} source=4 dest: 6}, { cond=(AND p0 (NOT p2) p1), acceptance={2} source=4 dest: 7}, { cond=(OR (AND p0 p2) (AND p0 p1)), acceptance={} source=4 dest: 8}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1, 2} source=5 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={1, 2} source=5 dest: 2}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={2} source=5 dest: 3}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0, 1, 2} source=5 dest: 5}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={1, 2} source=5 dest: 6}, { cond=(AND p0 (NOT p2) p1), acceptance={2} source=5 dest: 7}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={1, 2} source=6 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1, 2} source=6 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0, 1, 2} source=6 dest: 5}, { cond=(AND (NOT p2) p1), acceptance={1, 2} source=6 dest: 6}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={1, 2} source=7 dest: 2}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={2} source=7 dest: 3}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 2} source=7 dest: 3}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1, 2} source=7 dest: 4}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0, 1, 2} source=7 dest: 5}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={1, 2} source=7 dest: 6}, { cond=(AND p0 (NOT p2) p1), acceptance={2} source=7 dest: 7}], [{ cond=(OR (AND (NOT p0) p2) (AND (NOT p0) p1)), acceptance={1} source=8 dest: 2}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={1, 2} source=8 dest: 2}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={2} source=8 dest: 3}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 2} source=8 dest: 3}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p0) p1)), acceptance={0, 1} source=8 dest: 4}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1, 2} source=8 dest: 4}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0, 1, 2} source=8 dest: 5}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={1, 2} source=8 dest: 6}, { cond=(AND p0 (NOT p2) p1), acceptance={2} source=8 dest: 7}, { cond=(OR (AND p0 p2) (AND p0 p1)), acceptance={} source=8 dest: 8}]], initial=0, aps=[p0:(LEQ 1 s1), p2:(LEQ 3 s3), p1:(LEQ s0 s2)], nbAcceptance=3, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null, null, null][true, true, true, true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA Diffusion2D-PT-D50N150-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D50N150-LTLCardinality-09 finished in 532 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(((p0&&(p1||F(p2))) U X(p3)))))'
Support contains 4 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 19404/19404 transitions.
Applied a total of 0 rules in 365 ms. Remains 2500 /2500 variables (removed 0) and now considering 19404/19404 (removed 0) transitions.
// Phase 1: matrix 19404 rows 2500 cols
[2024-05-22 23:30:09] [INFO ] Computed 1 invariants in 77 ms
[2024-05-22 23:30:09] [INFO ] Implicit Places using invariants in 314 ms returned []
Implicit Place search using SMT only with invariants took 315 ms to find 0 implicit places.
[2024-05-22 23:30:09] [INFO ] Invariant cache hit.
[2024-05-22 23:30:16] [INFO ] Dead Transitions using invariants and state equation in 6526 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7206 ms. Remains : 2500/2500 places, 19404/19404 transitions.
Stuttering acceptance computed with spot in 278 ms :[(NOT p3), (NOT p3), (NOT p3), (AND (NOT p2) (NOT p3)), (NOT p3), true, (NOT p2)]
Running random walk in product with property : Diffusion2D-PT-D50N150-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=(NOT p3), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={0} source=4 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2) (NOT p3)), acceptance={0} source=4 dest: 3}, { cond=(AND p0 (NOT p3)), acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(LEQ 2 s1072), p1:(LEQ 3 s888), p2:(OR (LEQ 2 s1072) (LEQ 3 s888)), p3:(AND (LEQ 2 s1072) (LEQ s1678 s2343))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA Diffusion2D-PT-D50N150-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D50N150-LTLCardinality-10 finished in 7539 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 4 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 19404/19404 transitions.
Graph (trivial) has 19340 edges and 2500 vertex of which 2496 / 2500 are part of one of the 1 SCC in 6 ms
Free SCC test removed 2495 places
Ensure Unique test removed 19395 transitions
Reduce isomorphic transitions removed 19395 transitions.
Applied a total of 1 rules in 17 ms. Remains 5 /2500 variables (removed 2495) and now considering 9/19404 (removed 19395) transitions.
// Phase 1: matrix 9 rows 5 cols
[2024-05-22 23:30:16] [INFO ] Computed 1 invariants in 0 ms
[2024-05-22 23:30:16] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-22 23:30:16] [INFO ] Invariant cache hit.
[2024-05-22 23:30:16] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2024-05-22 23:30:16] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-22 23:30:16] [INFO ] Invariant cache hit.
[2024-05-22 23:30:16] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5/2500 places, 9/19404 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 88 ms. Remains : 5/2500 places, 9/19404 transitions.
Stuttering acceptance computed with spot in 103 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Diffusion2D-PT-D50N150-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=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ 1 s2), p1:(AND (LEQ s0 s3) (LEQ 1 s1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA Diffusion2D-PT-D50N150-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D50N150-LTLCardinality-11 finished in 213 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 19404/19404 transitions.
Graph (trivial) has 19372 edges and 2500 vertex of which 2498 / 2500 are part of one of the 1 SCC in 5 ms
Free SCC test removed 2497 places
Ensure Unique test removed 19399 transitions
Reduce isomorphic transitions removed 19399 transitions.
Applied a total of 1 rules in 17 ms. Remains 3 /2500 variables (removed 2497) and now considering 5/19404 (removed 19399) transitions.
// Phase 1: matrix 5 rows 3 cols
[2024-05-22 23:30:16] [INFO ] Computed 1 invariants in 0 ms
[2024-05-22 23:30:16] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-05-22 23:30:16] [INFO ] Invariant cache hit.
[2024-05-22 23:30:16] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
[2024-05-22 23:30:16] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-22 23:30:16] [INFO ] Invariant cache hit.
[2024-05-22 23:30:16] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3/2500 places, 5/19404 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 79 ms. Remains : 3/2500 places, 5/19404 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : Diffusion2D-PT-D50N150-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 39 steps with 0 reset in 0 ms.
FORMULA Diffusion2D-PT-D50N150-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D50N150-LTLCardinality-12 finished in 132 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 19404/19404 transitions.
Applied a total of 0 rules in 337 ms. Remains 2500 /2500 variables (removed 0) and now considering 19404/19404 (removed 0) transitions.
// Phase 1: matrix 19404 rows 2500 cols
[2024-05-22 23:30:17] [INFO ] Computed 1 invariants in 78 ms
[2024-05-22 23:30:17] [INFO ] Implicit Places using invariants in 309 ms returned []
Implicit Place search using SMT only with invariants took 311 ms to find 0 implicit places.
[2024-05-22 23:30:17] [INFO ] Invariant cache hit.
[2024-05-22 23:30:24] [INFO ] Dead Transitions using invariants and state equation in 6566 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7215 ms. Remains : 2500/2500 places, 19404/19404 transitions.
Stuttering acceptance computed with spot in 83 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Diffusion2D-PT-D50N150-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ 2 s882)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Diffusion2D-PT-D50N150-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D50N150-LTLCardinality-13 finished in 7337 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(p0)&&F(p1))||X(G(p0))))'
Support contains 3 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 19404/19404 transitions.
Applied a total of 0 rules in 353 ms. Remains 2500 /2500 variables (removed 0) and now considering 19404/19404 (removed 0) transitions.
[2024-05-22 23:30:24] [INFO ] Invariant cache hit.
[2024-05-22 23:30:24] [INFO ] Implicit Places using invariants in 238 ms returned []
Implicit Place search using SMT only with invariants took 250 ms to find 0 implicit places.
[2024-05-22 23:30:24] [INFO ] Invariant cache hit.
[2024-05-22 23:30:31] [INFO ] Dead Transitions using invariants and state equation in 6503 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7110 ms. Remains : 2500/2500 places, 19404/19404 transitions.
Stuttering acceptance computed with spot in 143 ms :[(NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), true, (NOT p1)]
Running random walk in product with property : Diffusion2D-PT-D50N150-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(GT 3 s2108), p0:(GT s430 s1004)], 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Diffusion2D-PT-D50N150-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D50N150-LTLCardinality-14 finished in 7298 ms.
All properties solved by simple procedures.
Total runtime 142072 ms.

BK_STOP 1716420632515

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Diffusion2D-PT-D50N150"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is Diffusion2D-PT-D50N150, 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 r153-tall-171631151400222"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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