About the Execution of ITS-Tools for Diffusion2D-PT-D50N050
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 7614.476 | 972623.00 | 2897502.00 | 1298.80 | FFFFFFFFFTFTTFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2022-input.r060-tall-165254772600852.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is Diffusion2D-PT-D50N050, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r060-tall-165254772600852
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 7.6M
-rw-r--r-- 1 mcc users 9.2K Apr 30 05:12 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K Apr 30 05:12 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Apr 30 05:11 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Apr 30 05:11 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K May 9 07:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 9 07:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 9 07:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 9 07:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 9 07:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 9 07:39 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 8 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 7.3M May 10 09:33 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-D50N050-LTLFireability-00
FORMULA_NAME Diffusion2D-PT-D50N050-LTLFireability-01
FORMULA_NAME Diffusion2D-PT-D50N050-LTLFireability-02
FORMULA_NAME Diffusion2D-PT-D50N050-LTLFireability-03
FORMULA_NAME Diffusion2D-PT-D50N050-LTLFireability-04
FORMULA_NAME Diffusion2D-PT-D50N050-LTLFireability-05
FORMULA_NAME Diffusion2D-PT-D50N050-LTLFireability-06
FORMULA_NAME Diffusion2D-PT-D50N050-LTLFireability-07
FORMULA_NAME Diffusion2D-PT-D50N050-LTLFireability-08
FORMULA_NAME Diffusion2D-PT-D50N050-LTLFireability-09
FORMULA_NAME Diffusion2D-PT-D50N050-LTLFireability-10
FORMULA_NAME Diffusion2D-PT-D50N050-LTLFireability-11
FORMULA_NAME Diffusion2D-PT-D50N050-LTLFireability-12
FORMULA_NAME Diffusion2D-PT-D50N050-LTLFireability-13
FORMULA_NAME Diffusion2D-PT-D50N050-LTLFireability-14
FORMULA_NAME Diffusion2D-PT-D50N050-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1652667397784
Running Version 202205111006
[2022-05-16 02:16:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-16 02:16:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 02:16:39] [INFO ] Load time of PNML (sax parser for PT used): 525 ms
[2022-05-16 02:16:39] [INFO ] Transformed 2500 places.
[2022-05-16 02:16:39] [INFO ] Transformed 19404 transitions.
[2022-05-16 02:16:39] [INFO ] Parsed PT model containing 2500 places and 19404 transitions in 676 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA Diffusion2D-PT-D50N050-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 35 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 745 ms. Remains 2500 /2500 variables (removed 0) and now considering 19404/19404 (removed 0) transitions.
// Phase 1: matrix 19404 rows 2500 cols
[2022-05-16 02:16:40] [INFO ] Computed 1 place invariants in 166 ms
[2022-05-16 02:16:41] [INFO ] Implicit Places using invariants in 549 ms returned []
Implicit Place search using SMT only with invariants took 578 ms to find 0 implicit places.
// Phase 1: matrix 19404 rows 2500 cols
[2022-05-16 02:16:41] [INFO ] Computed 1 place invariants in 99 ms
[2022-05-16 02:16:47] [INFO ] Dead Transitions using invariants and state equation in 6769 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 19404/19404 transitions.
Support contains 35 out of 2500 places after structural reductions.
[2022-05-16 02:16:48] [INFO ] Flatten gal took : 569 ms
[2022-05-16 02:16:49] [INFO ] Flatten gal took : 369 ms
[2022-05-16 02:16:50] [INFO ] Input system was already deterministic with 19404 transitions.
Incomplete random walk after 10002 steps, including 2 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 34) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 32) 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 32) 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 32) 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 32) 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 32) 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 32) 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 32) 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 32) 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 32) 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 32) 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 32) 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 32) 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 32) 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 32) 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 32) 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 32) 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 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 32) 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 32) 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 32) 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 32) 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 32) 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 32) 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 32) 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 32) 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 32) 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 32) 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 32) 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 32) 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 32) seen :0
Interrupted probabilistic random walk after 110608 steps, run timeout after 3001 ms. (steps per millisecond=36 ) properties seen :{0=1, 3=1, 7=1, 26=1}
Probabilistic random walk after 110608 steps, saw 92371 distinct states, run finished after 3003 ms. (steps per millisecond=36 ) properties seen :4
Running SMT prover for 28 properties.
// Phase 1: matrix 19404 rows 2500 cols
[2022-05-16 02:16:53] [INFO ] Computed 1 place invariants in 87 ms
[2022-05-16 02:16:55] [INFO ] [Real]Absence check using 1 positive place invariants in 20 ms returned sat
[2022-05-16 02:17:12] [INFO ] After 16823ms SMT Verify possible using state equation in real domain returned unsat :1 sat :3 real:24
[2022-05-16 02:17:15] [INFO ] After 18850ms SMT Verify possible using trap constraints in real domain returned unsat :1 sat :0 real:27
[2022-05-16 02:17:15] [INFO ] After 21339ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:27
[2022-05-16 02:17:16] [INFO ] [Nat]Absence check using 1 positive place invariants in 21 ms returned sat
[2022-05-16 02:17:34] [INFO ] After 16967ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :27
[2022-05-16 02:17:41] [INFO ] Deduced a trap composed of 2500 places in 1449 ms of which 8 ms to minimize.
[2022-05-16 02:17:41] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-16 02:17:41] [INFO ] After 26482ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0 real:27
Fused 28 Parikh solutions to 22 different solutions.
Finished Parikh walk after 37442 steps, including 0 resets, run visited all 9 properties in 1186 ms. (steps per millisecond=31 )
Parikh walk visited 27 properties in 11220 ms.
FORMULA Diffusion2D-PT-D50N050-LTLFireability-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((G((G((F(p0)&&p1))||G(p2)))&&X(p1))))'
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 500 ms. Remains 2500 /2500 variables (removed 0) and now considering 19404/19404 (removed 0) transitions.
// Phase 1: matrix 19404 rows 2500 cols
[2022-05-16 02:17:53] [INFO ] Computed 1 place invariants in 89 ms
[2022-05-16 02:17:53] [INFO ] Implicit Places using invariants in 328 ms returned []
Implicit Place search using SMT only with invariants took 329 ms to find 0 implicit places.
// Phase 1: matrix 19404 rows 2500 cols
[2022-05-16 02:17:54] [INFO ] Computed 1 place invariants in 77 ms
[2022-05-16 02:18:00] [INFO ] Dead Transitions using invariants and state equation in 6828 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 19404/19404 transitions.
Stuttering acceptance computed with spot in 342 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2))), true, (AND p2 (NOT p1)), (NOT p0), (OR (NOT p0) (NOT p1)), (AND (NOT p2) p1)]
Running random walk in product with property : Diffusion2D-PT-D50N050-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=p2, acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=0 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 4}, { cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 5}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=5 dest: 1}, { cond=(AND p1 p2), acceptance={} source=5 dest: 5}]], initial=0, aps=[p2:(LT s1636 1), p1:(LT s1086 1), p0:(LT s1833 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33479 reset in 1805 ms.
Product exploration explored 100000 steps with 33283 reset in 1733 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 p2 p1 p0), (X p2), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (AND p1 p2)), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X p1), (X p0), (X (NOT (AND p1 (NOT p0)))), (X (X p2)), (X (X (NOT (AND (NOT p1) p2)))), true, (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (AND p1 p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p1)), (X (X p0)), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 20 factoid took 899 ms. Reduced automaton from 6 states, 14 edges and 3 AP to 6 states, 14 edges and 3 AP.
Stuttering acceptance computed with spot in 256 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2))), true, (AND p2 (NOT p1)), (NOT p0), (OR (NOT p0) (NOT p1)), (AND (NOT p2) p1)]
Incomplete random walk after 10023 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=455 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 9) 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 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 9) 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 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 9) 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 9) 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 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 9) seen :0
Interrupted probabilistic random walk after 113054 steps, run timeout after 3001 ms. (steps per millisecond=37 ) properties seen :{5=1, 7=1}
Probabilistic random walk after 113054 steps, saw 94198 distinct states, run finished after 3001 ms. (steps per millisecond=37 ) properties seen :2
Running SMT prover for 7 properties.
// Phase 1: matrix 19404 rows 2500 cols
[2022-05-16 02:18:09] [INFO ] Computed 1 place invariants in 78 ms
[2022-05-16 02:18:09] [INFO ] [Real]Absence check using 1 positive place invariants in 21 ms returned sat
[2022-05-16 02:18:17] [INFO ] After 7208ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:5
[2022-05-16 02:18:18] [INFO ] After 8622ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2 real:5
Attempting to minimize the solution found.
Minimization took 838 ms.
[2022-05-16 02:18:19] [INFO ] After 10055ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:6
[2022-05-16 02:18:19] [INFO ] [Nat]Absence check using 1 positive place invariants in 19 ms returned sat
[2022-05-16 02:18:28] [INFO ] After 8578ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2022-05-16 02:18:33] [INFO ] After 13139ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 2473 ms.
[2022-05-16 02:18:35] [INFO ] After 16387ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Fused 7 Parikh solutions to 6 different solutions.
Finished Parikh walk after 24895 steps, including 0 resets, run visited all 1 properties in 285 ms. (steps per millisecond=87 )
Parikh walk visited 7 properties in 1296 ms.
Knowledge obtained : [(AND p2 p1 p0), (X p2), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (AND p1 p2)), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X p1), (X p0), (X (NOT (AND p1 (NOT p0)))), (X (X p2)), (X (X (NOT (AND (NOT p1) p2)))), true, (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (AND p1 p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p1)), (X (X p0)), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : [(F (AND p2 (NOT p1))), (F (AND (NOT p2) p1)), (F (NOT p1)), (F (NOT p0)), (F (NOT p2)), (F (AND (NOT p2) (NOT p0) p1)), (F (AND (NOT p2) (NOT p1))), (F (NOT (AND p2 p1))), (F (AND (NOT p0) p1))]
Property proved to be false thanks to negative knowledge :(F (AND (NOT p2) (NOT p1)))
Knowledge based reduction with 20 factoid took 538 ms. Reduced automaton from 6 states, 14 edges and 3 AP to 1 states, 1 edges and 0 AP.
FORMULA Diffusion2D-PT-D50N050-LTLFireability-00 FALSE TECHNIQUES KNOWLEDGE
Treatment of property Diffusion2D-PT-D50N050-LTLFireability-00 finished in 44443 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(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 398 ms. Remains 2500 /2500 variables (removed 0) and now considering 19404/19404 (removed 0) transitions.
// Phase 1: matrix 19404 rows 2500 cols
[2022-05-16 02:18:38] [INFO ] Computed 1 place invariants in 86 ms
[2022-05-16 02:18:38] [INFO ] Implicit Places using invariants in 329 ms returned []
Implicit Place search using SMT only with invariants took 329 ms to find 0 implicit places.
// Phase 1: matrix 19404 rows 2500 cols
[2022-05-16 02:18:38] [INFO ] Computed 1 place invariants in 82 ms
[2022-05-16 02:18:45] [INFO ] Dead Transitions using invariants and state equation in 6805 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 19404/19404 transitions.
Stuttering acceptance computed with spot in 94 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Diffusion2D-PT-D50N050-LTLFireability-01 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:(GEQ s2141 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Diffusion2D-PT-D50N050-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D50N050-LTLFireability-01 finished in 7698 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0)) U 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 393 ms. Remains 2500 /2500 variables (removed 0) and now considering 19404/19404 (removed 0) transitions.
// Phase 1: matrix 19404 rows 2500 cols
[2022-05-16 02:18:45] [INFO ] Computed 1 place invariants in 77 ms
[2022-05-16 02:18:45] [INFO ] Implicit Places using invariants in 301 ms returned []
Implicit Place search using SMT only with invariants took 302 ms to find 0 implicit places.
// Phase 1: matrix 19404 rows 2500 cols
[2022-05-16 02:18:46] [INFO ] Computed 1 place invariants in 95 ms
[2022-05-16 02:18:53] [INFO ] Dead Transitions using invariants and state equation in 7119 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 19404/19404 transitions.
Stuttering acceptance computed with spot in 131 ms :[(NOT p0), true, (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : Diffusion2D-PT-D50N050-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 p0), acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(GEQ s313 1), p1:(GEQ s1027 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Diffusion2D-PT-D50N050-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D50N050-LTLFireability-02 finished in 8002 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(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 19 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 47 ms. Remains 2 /2500 variables (removed 2498) and now considering 3/19404 (removed 19401) transitions.
// Phase 1: matrix 3 rows 2 cols
[2022-05-16 02:18:53] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 02:18:53] [INFO ] Implicit Places using invariants in 15 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2022-05-16 02:18:53] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 02:18:53] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
[2022-05-16 02:18:53] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2022-05-16 02:18:53] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 02:18:53] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/2500 places, 3/19404 transitions.
Finished structural reductions, in 1 iterations. Remains : 2/2500 places, 3/19404 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : Diffusion2D-PT-D50N050-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA Diffusion2D-PT-D50N050-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D50N050-LTLFireability-03 finished in 168 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(!(G(p0) U ((p1 U p2) U X(p2)))))'
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 380 ms. Remains 2500 /2500 variables (removed 0) and now considering 19404/19404 (removed 0) transitions.
// Phase 1: matrix 19404 rows 2500 cols
[2022-05-16 02:18:53] [INFO ] Computed 1 place invariants in 87 ms
[2022-05-16 02:18:54] [INFO ] Implicit Places using invariants in 354 ms returned []
Implicit Place search using SMT only with invariants took 355 ms to find 0 implicit places.
// Phase 1: matrix 19404 rows 2500 cols
[2022-05-16 02:18:54] [INFO ] Computed 1 place invariants in 88 ms
[2022-05-16 02:19:01] [INFO ] Dead Transitions using invariants and state equation in 7119 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 19404/19404 transitions.
Stuttering acceptance computed with spot in 239 ms :[p2, p2, false, false, (AND p0 p2), (AND p2 p0)]
Running random walk in product with property : Diffusion2D-PT-D50N050-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=p2, acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 3}, { cond=p0, acceptance={} source=0 dest: 4}], [{ cond=p2, acceptance={0, 1} source=1 dest: 1}, { cond=p2, acceptance={0} source=1 dest: 2}, { cond=(AND p0 p2), acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={0, 1} source=2 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 (NOT p2)), acceptance={1} source=3 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 3}], [{ cond=p0, acceptance={0} source=4 dest: 4}, { cond=p0, acceptance={0, 1} source=4 dest: 5}], [{ cond=(AND p0 p2), acceptance={0} source=5 dest: 4}, { cond=(AND p0 p2), acceptance={0, 1} source=5 dest: 5}]], initial=0, aps=[p2:(GEQ s515 1), p1:(OR (LT s1284 1) (LT s1376 1)), p0:(GEQ s1376 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33414 reset in 2191 ms.
Product exploration explored 100000 steps with 33293 reset in 2301 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 p2) p1 (NOT p0)), (X (NOT p2)), (X (NOT (AND p0 p2))), (X (AND p1 (NOT p2))), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT (AND p0 p2)))), (X (X (AND p1 (NOT p2)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 439 ms. Reduced automaton from 6 states, 15 edges and 3 AP to 6 states, 12 edges and 3 AP.
Stuttering acceptance computed with spot in 199 ms :[false, p2, false, false, (AND p0 p2), (AND p2 p0)]
Incomplete random walk after 10007 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 164343 steps, run timeout after 3001 ms. (steps per millisecond=54 ) properties seen :{3=1}
Probabilistic random walk after 164343 steps, saw 133917 distinct states, run finished after 3001 ms. (steps per millisecond=54 ) properties seen :1
Running SMT prover for 3 properties.
// Phase 1: matrix 19404 rows 2500 cols
[2022-05-16 02:19:09] [INFO ] Computed 1 place invariants in 78 ms
[2022-05-16 02:19:10] [INFO ] [Real]Absence check using 1 positive place invariants in 20 ms returned sat
[2022-05-16 02:19:17] [INFO ] After 7203ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:1
[2022-05-16 02:19:19] [INFO ] After 8592ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2 real:1
Attempting to minimize the solution found.
Minimization took 756 ms.
[2022-05-16 02:19:19] [INFO ] After 9821ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2 real:1
[2022-05-16 02:19:20] [INFO ] [Nat]Absence check using 1 positive place invariants in 21 ms returned sat
[2022-05-16 02:19:27] [INFO ] After 7680ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-16 02:19:35] [INFO ] After 14736ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 1188 ms.
[2022-05-16 02:19:36] [INFO ] After 16378ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 6149 steps, including 0 resets, run visited all 3 properties in 167 ms. (steps per millisecond=36 )
Parikh walk visited 3 properties in 169 ms.
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (NOT p2)), (X (NOT (AND p0 p2))), (X (AND p1 (NOT p2))), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT (AND p0 p2)))), (X (X (AND p1 (NOT p2)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F p2), (F (NOT (AND (NOT p2) p1))), (F (AND p2 p0))]
Knowledge based reduction with 9 factoid took 493 ms. Reduced automaton from 6 states, 12 edges and 3 AP to 6 states, 12 edges and 3 AP.
Stuttering acceptance computed with spot in 285 ms :[false, p2, false, false, (AND p0 p2), (AND p2 p0)]
Stuttering acceptance computed with spot in 294 ms :[false, p2, false, false, (AND p0 p2), (AND p2 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 494 ms. Remains 2500 /2500 variables (removed 0) and now considering 19404/19404 (removed 0) transitions.
// Phase 1: matrix 19404 rows 2500 cols
[2022-05-16 02:19:38] [INFO ] Computed 1 place invariants in 85 ms
[2022-05-16 02:19:38] [INFO ] Implicit Places using invariants in 341 ms returned []
Implicit Place search using SMT only with invariants took 342 ms to find 0 implicit places.
// Phase 1: matrix 19404 rows 2500 cols
[2022-05-16 02:19:38] [INFO ] Computed 1 place invariants in 76 ms
[2022-05-16 02:19:45] [INFO ] Dead Transitions using invariants and state equation in 7065 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 19404/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 (NOT p2) (NOT p0) p1), (X (AND (NOT p2) p1)), (X (X (NOT p2))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND p2 p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 216 ms. Reduced automaton from 6 states, 12 edges and 3 AP to 6 states, 12 edges and 3 AP.
Stuttering acceptance computed with spot in 202 ms :[false, p2, false, false, (AND p0 p2), (AND p2 p0)]
Incomplete random walk after 10012 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=770 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 190575 steps, run timeout after 3001 ms. (steps per millisecond=63 ) properties seen :{3=1}
Probabilistic random walk after 190575 steps, saw 154341 distinct states, run finished after 3001 ms. (steps per millisecond=63 ) properties seen :1
Running SMT prover for 3 properties.
// Phase 1: matrix 19404 rows 2500 cols
[2022-05-16 02:19:49] [INFO ] Computed 1 place invariants in 79 ms
[2022-05-16 02:19:49] [INFO ] [Real]Absence check using 1 positive place invariants in 19 ms returned sat
[2022-05-16 02:19:56] [INFO ] After 6651ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:1
[2022-05-16 02:19:57] [INFO ] After 7973ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2 real:1
Attempting to minimize the solution found.
Minimization took 739 ms.
[2022-05-16 02:19:58] [INFO ] After 9130ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2 real:1
[2022-05-16 02:19:58] [INFO ] [Nat]Absence check using 1 positive place invariants in 21 ms returned sat
[2022-05-16 02:20:06] [INFO ] After 7812ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-16 02:20:13] [INFO ] After 15235ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 5270 ms.
[2022-05-16 02:20:19] [INFO ] After 20942ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 5282 steps, including 0 resets, run visited all 3 properties in 133 ms. (steps per millisecond=39 )
Parikh walk visited 3 properties in 135 ms.
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (AND (NOT p2) p1)), (X (X (NOT p2))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND p2 p0))))]
False Knowledge obtained : [(F p0), (F p2), (F (NOT (AND p1 (NOT p2)))), (F (AND p0 p2))]
Knowledge based reduction with 5 factoid took 297 ms. Reduced automaton from 6 states, 12 edges and 3 AP to 6 states, 12 edges and 3 AP.
Stuttering acceptance computed with spot in 318 ms :[false, p2, false, false, (AND p0 p2), (AND p2 p0)]
Stuttering acceptance computed with spot in 224 ms :[false, p2, false, false, (AND p0 p2), (AND p2 p0)]
Stuttering acceptance computed with spot in 218 ms :[false, p2, false, false, (AND p0 p2), (AND p2 p0)]
Product exploration explored 100000 steps with 25080 reset in 1745 ms.
Product exploration explored 100000 steps with 24941 reset in 1686 ms.
Applying partial POR strategy [false, false, false, false, true, true]
Stuttering acceptance computed with spot in 241 ms :[false, p2, false, false, (AND p0 p2), (AND p2 p0)]
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 11 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 26 ms. Remains 4 /2500 variables (removed 2496) and now considering 7/19404 (removed 19397) transitions.
[2022-05-16 02:20:24] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 7 rows 4 cols
[2022-05-16 02:20:24] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 02:20:24] [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 1 iterations. Remains : 4/2500 places, 7/19404 transitions.
Product exploration explored 100000 steps with 24966 reset in 1943 ms.
Product exploration explored 100000 steps with 25012 reset in 1692 ms.
Built C files in :
/tmp/ltsmin1860081020874247511
[2022-05-16 02:20:28] [INFO ] Built C files in 208ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1860081020874247511
Running compilation step : cd /tmp/ltsmin1860081020874247511;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1860081020874247511;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1860081020874247511;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
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 497 ms. Remains 2500 /2500 variables (removed 0) and now considering 19404/19404 (removed 0) transitions.
// Phase 1: matrix 19404 rows 2500 cols
[2022-05-16 02:20:31] [INFO ] Computed 1 place invariants in 95 ms
[2022-05-16 02:20:32] [INFO ] Implicit Places using invariants in 378 ms returned []
Implicit Place search using SMT only with invariants took 380 ms to find 0 implicit places.
// Phase 1: matrix 19404 rows 2500 cols
[2022-05-16 02:20:32] [INFO ] Computed 1 place invariants in 77 ms
[2022-05-16 02:20:40] [INFO ] Dead Transitions using invariants and state equation in 8239 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 19404/19404 transitions.
Built C files in :
/tmp/ltsmin5724870528755970189
[2022-05-16 02:20:40] [INFO ] Built C files in 144ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5724870528755970189
Running compilation step : cd /tmp/ltsmin5724870528755970189;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5724870528755970189;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5724870528755970189;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-16 02:20:44] [INFO ] Flatten gal took : 326 ms
[2022-05-16 02:20:44] [INFO ] Flatten gal took : 329 ms
[2022-05-16 02:20:44] [INFO ] Time to serialize gal into /tmp/LTL12669562317302536952.gal : 80 ms
[2022-05-16 02:20:44] [INFO ] Time to serialize properties into /tmp/LTL15444573038372884101.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12669562317302536952.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15444573038372884101.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1266956...268
Read 1 LTL properties
Checking formula 0 : !((F(!((G("(cAMP__35_34_>=1)"))U((("((cAMP__33_41_<1)||(cAMP__35_34_<1))")U("(cAMP__1_24_>=1)"))U(X("(cAMP__1_24_>=1)")))))))
Formula 0 simplified : !F!(G"(cAMP__35_34_>=1)" U (("((cAMP__33_41_<1)||(cAMP__35_34_<1))" U "(cAMP__1_24_>=1)") U X"(cAMP__1_24_>=1)"))
Detected timeout of ITS tools.
[2022-05-16 02:21:00] [INFO ] Flatten gal took : 300 ms
[2022-05-16 02:21:00] [INFO ] Applying decomposition
[2022-05-16 02:21:00] [INFO ] Flatten gal took : 315 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph17657427528176964730.txt' '-o' '/tmp/graph17657427528176964730.bin' '-w' '/tmp/graph17657427528176964730.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph17657427528176964730.bin' '-l' '-1' '-v' '-w' '/tmp/graph17657427528176964730.weights' '-q' '0' '-e' '0.001'
[2022-05-16 02:21:01] [INFO ] Decomposing Gal with order
[2022-05-16 02:21:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 02:21:03] [INFO ] Removed a total of 13658 redundant transitions.
[2022-05-16 02:21:03] [INFO ] Flatten gal took : 1341 ms
[2022-05-16 02:21:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 86 labels/synchronizations in 152 ms.
[2022-05-16 02:21:03] [INFO ] Time to serialize gal into /tmp/LTL10425626131927010318.gal : 67 ms
[2022-05-16 02:21:03] [INFO ] Time to serialize properties into /tmp/LTL12101936976517547317.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10425626131927010318.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12101936976517547317.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1042562...247
Read 1 LTL properties
Checking formula 0 : !((F(!((G("(i12.u212.cAMP__35_34_>=1)"))U((("((i9.u208.cAMP__33_41_<1)||(i12.u212.cAMP__35_34_<1))")U("(i3.u87.cAMP__1_24_>=1)"))U(X("...186
Formula 0 simplified : !F!(G"(i12.u212.cAMP__35_34_>=1)" U (("((i9.u208.cAMP__33_41_<1)||(i12.u212.cAMP__35_34_<1))" U "(i3.u87.cAMP__1_24_>=1)") U X"(i3.u...176
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11524557440430604241
[2022-05-16 02:21:18] [INFO ] Built C files in 120ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11524557440430604241
Running compilation step : cd /tmp/ltsmin11524557440430604241;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11524557440430604241;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11524557440430604241;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property Diffusion2D-PT-D50N050-LTLFireability-04 finished in 148492 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p1)&&p0)))'
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 16 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 50 ms. Remains 4 /2500 variables (removed 2496) and now considering 7/19404 (removed 19397) transitions.
// Phase 1: matrix 7 rows 4 cols
[2022-05-16 02:21:21] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 02:21:22] [INFO ] Implicit Places using invariants in 73 ms returned []
// Phase 1: matrix 7 rows 4 cols
[2022-05-16 02:21:22] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:21:22] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 144 ms to find 0 implicit places.
[2022-05-16 02:21:22] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 7 rows 4 cols
[2022-05-16 02:21:22] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 02:21:22] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/2500 places, 7/19404 transitions.
Finished structural reductions, in 1 iterations. Remains : 4/2500 places, 7/19404 transitions.
Stuttering acceptance computed with spot in 131 ms :[(OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : Diffusion2D-PT-D50N050-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s2 1)), p1:(GEQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA Diffusion2D-PT-D50N050-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D50N050-LTLFireability-07 finished in 444 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((!F(p0) U p1) U G(X(p2))))'
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 502 ms. Remains 2500 /2500 variables (removed 0) and now considering 19404/19404 (removed 0) transitions.
// Phase 1: matrix 19404 rows 2500 cols
[2022-05-16 02:21:22] [INFO ] Computed 1 place invariants in 106 ms
[2022-05-16 02:21:23] [INFO ] Implicit Places using invariants in 452 ms returned []
Implicit Place search using SMT only with invariants took 460 ms to find 0 implicit places.
// Phase 1: matrix 19404 rows 2500 cols
[2022-05-16 02:21:23] [INFO ] Computed 1 place invariants in 114 ms
[2022-05-16 02:21:30] [INFO ] Dead Transitions using invariants and state equation in 6847 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 19404/19404 transitions.
Stuttering acceptance computed with spot in 180 ms :[(NOT p2), (AND p0 (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), true, p0, (NOT p1)]
Running random walk in product with property : Diffusion2D-PT-D50N050-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 4}], [{ cond=(AND p1 p0 p2), acceptance={} source=1 dest: 0}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(OR (AND p1 p2) (AND (NOT p0) p2)), acceptance={} source=3 dest: 3}, { cond=(OR (AND p1 (NOT p2)) (AND (NOT p0) (NOT p2))), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=p0, acceptance={} source=5 dest: 4}, { cond=(NOT p0), acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p1) p0), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=6 dest: 6}]], initial=3, aps=[p2:(GEQ s1254 1), p1:(OR (NOT (OR (GEQ s1289 1) (GEQ s2163 1))) (GEQ s1289 1)), p0:(GEQ s2163 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4187 steps with 0 reset in 95 ms.
FORMULA Diffusion2D-PT-D50N050-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D50N050-LTLFireability-08 finished in 8129 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(X(F(p0)))||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 492 ms. Remains 2500 /2500 variables (removed 0) and now considering 19404/19404 (removed 0) transitions.
// Phase 1: matrix 19404 rows 2500 cols
[2022-05-16 02:21:31] [INFO ] Computed 1 place invariants in 75 ms
[2022-05-16 02:21:31] [INFO ] Implicit Places using invariants in 281 ms returned []
Implicit Place search using SMT only with invariants took 282 ms to find 0 implicit places.
// Phase 1: matrix 19404 rows 2500 cols
[2022-05-16 02:21:31] [INFO ] Computed 1 place invariants in 76 ms
[2022-05-16 02:21:38] [INFO ] Dead Transitions using invariants and state equation in 6739 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 19404/19404 transitions.
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Diffusion2D-PT-D50N050-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (LT s1355 1) (LT s2049 1)), p1:(GEQ s1355 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 2087 ms.
Product exploration explored 100000 steps with 50000 reset in 1957 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 p0 (NOT p1)), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 7 factoid took 95 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA Diffusion2D-PT-D50N050-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Diffusion2D-PT-D50N050-LTLFireability-09 finished in 11856 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0)||(X(!p0)&&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 484 ms. Remains 2500 /2500 variables (removed 0) and now considering 19404/19404 (removed 0) transitions.
// Phase 1: matrix 19404 rows 2500 cols
[2022-05-16 02:21:42] [INFO ] Computed 1 place invariants in 73 ms
[2022-05-16 02:21:43] [INFO ] Implicit Places using invariants in 274 ms returned []
Implicit Place search using SMT only with invariants took 274 ms to find 0 implicit places.
// Phase 1: matrix 19404 rows 2500 cols
[2022-05-16 02:21:43] [INFO ] Computed 1 place invariants in 78 ms
[2022-05-16 02:21:53] [INFO ] Dead Transitions using invariants and state equation in 10216 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 19404/19404 transitions.
Stuttering acceptance computed with spot in 55 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Diffusion2D-PT-D50N050-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 1}]], initial=1, aps=[p0:(LT s722 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 253 steps with 0 reset in 3 ms.
FORMULA Diffusion2D-PT-D50N050-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D50N050-LTLFireability-10 finished in 11072 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(p1)))'
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 1071 ms. Remains 2500 /2500 variables (removed 0) and now considering 19404/19404 (removed 0) transitions.
// Phase 1: matrix 19404 rows 2500 cols
[2022-05-16 02:21:54] [INFO ] Computed 1 place invariants in 169 ms
[2022-05-16 02:21:55] [INFO ] Implicit Places using invariants in 633 ms returned []
Implicit Place search using SMT only with invariants took 634 ms to find 0 implicit places.
// Phase 1: matrix 19404 rows 2500 cols
[2022-05-16 02:21:55] [INFO ] Computed 1 place invariants in 216 ms
[2022-05-16 02:22:06] [INFO ] Dead Transitions using invariants and state equation in 11455 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 19404/19404 transitions.
Stuttering acceptance computed with spot in 162 ms :[(NOT p1), true, (NOT p1), (NOT p1)]
Running random walk in product with property : Diffusion2D-PT-D50N050-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s908 1) (GEQ s66 1)), p1:(LT s1131 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1997 ms.
Product exploration explored 100000 steps with 50000 reset in 2008 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 p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (NOT (AND p0 (NOT p1)))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p1)
Knowledge based reduction with 8 factoid took 172 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA Diffusion2D-PT-D50N050-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Diffusion2D-PT-D50N050-LTLFireability-11 finished in 17575 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(F((X(X(X(p0)))||F(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 431 ms. Remains 2500 /2500 variables (removed 0) and now considering 19404/19404 (removed 0) transitions.
// Phase 1: matrix 19404 rows 2500 cols
[2022-05-16 02:22:11] [INFO ] Computed 1 place invariants in 79 ms
[2022-05-16 02:22:11] [INFO ] Implicit Places using invariants in 284 ms returned []
Implicit Place search using SMT only with invariants took 285 ms to find 0 implicit places.
// Phase 1: matrix 19404 rows 2500 cols
[2022-05-16 02:22:11] [INFO ] Computed 1 place invariants in 80 ms
[2022-05-16 02:22:18] [INFO ] Dead Transitions using invariants and state equation in 6836 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 19404/19404 transitions.
Stuttering acceptance computed with spot in 201 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Diffusion2D-PT-D50N050-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}], [{ cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 2}]], initial=0, aps=[p1:(LT s1264 1), p0:(GEQ s322 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1995 ms.
Product exploration explored 100000 steps with 50000 reset in 2018 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 p0)), (X p1), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p1)
Knowledge based reduction with 3 factoid took 89 ms. Reduced automaton from 5 states, 5 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA Diffusion2D-PT-D50N050-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Diffusion2D-PT-D50N050-LTLFireability-12 finished in 11943 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!(F(p0) U G(p1)) U X((F((G(p2)&&p3))||p0))))'
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 418 ms. Remains 2500 /2500 variables (removed 0) and now considering 19404/19404 (removed 0) transitions.
// Phase 1: matrix 19404 rows 2500 cols
[2022-05-16 02:22:23] [INFO ] Computed 1 place invariants in 79 ms
[2022-05-16 02:22:23] [INFO ] Implicit Places using invariants in 287 ms returned []
Implicit Place search using SMT only with invariants took 288 ms to find 0 implicit places.
// Phase 1: matrix 19404 rows 2500 cols
[2022-05-16 02:22:23] [INFO ] Computed 1 place invariants in 81 ms
[2022-05-16 02:22:30] [INFO ] Dead Transitions using invariants and state equation in 6880 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 19404/19404 transitions.
Stuttering acceptance computed with spot in 548 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), false, (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) p1 (NOT p3)) (AND (NOT p0) p1 (NOT p2))), (OR (AND (NOT p0) p1 (NOT p3)) (AND (NOT p0) p1 (NOT p2))), (OR (AND p0 p1 (NOT p3)) (AND p0 p1 (NOT p2))), (AND p0 p1 (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (OR (AND p1 (NOT p3)) (AND p1 (NOT p2))), (AND p1 (NOT p2)), (OR (AND p1 (NOT p3)) (AND p1 (NOT p2))), (AND p1 (NOT p2))]
Running random walk in product with property : Diffusion2D-PT-D50N050-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 3}, { cond=p0, acceptance={} source=0 dest: 4}], [{ cond=(OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), acceptance={} source=1 dest: 5}, { cond=(AND (NOT p0) p3 p2), acceptance={} source=1 dest: 6}], [{ cond=(OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), acceptance={} source=2 dest: 1}, { cond=(OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), acceptance={0} source=2 dest: 2}, { cond=(OR (AND (NOT p0) p1 (NOT p3)) (AND (NOT p0) p1 (NOT p2))), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) p3 p2), acceptance={} source=2 dest: 7}, { cond=(AND (NOT p0) p1 p3 p2), acceptance={} source=2 dest: 8}], [{ cond=(OR (AND (NOT p0) p1 (NOT p3)) (AND (NOT p0) p1 (NOT p2))), acceptance={} source=3 dest: 9}, { cond=(AND (NOT p0) p1 p3 p2), acceptance={} source=3 dest: 10}], [{ cond=(OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p0) p3 p2), acceptance={} source=4 dest: 6}, { cond=(OR (AND (NOT p0) p1 (NOT p3)) (AND (NOT p0) p1 (NOT p2))), acceptance={} source=4 dest: 9}, { cond=(AND (NOT p0) p1 p3 p2), acceptance={} source=4 dest: 10}], [{ cond=(OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p0) p3 p2), acceptance={} source=5 dest: 6}, { cond=(OR (AND p0 p1 (NOT p3)) (AND p0 p1 (NOT p2))), acceptance={} source=5 dest: 9}, { cond=(OR (AND p0 (NOT p3)) (AND p0 (NOT p2))), acceptance={} source=5 dest: 11}, { cond=(AND p0 p3 p2), acceptance={} source=5 dest: 12}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p0) p2), acceptance={} source=6 dest: 6}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=6 dest: 9}, { cond=(AND p0 (NOT p2)), acceptance={} source=6 dest: 11}, { cond=(AND p0 p2), acceptance={} source=6 dest: 12}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=7 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=7 dest: 3}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=7 dest: 5}, { cond=(AND (NOT p0) p2), acceptance={} source=7 dest: 6}, { cond=(AND (NOT p0) p2), acceptance={} source=7 dest: 7}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=7 dest: 8}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=8 dest: 9}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=8 dest: 10}], [{ cond=(OR (AND p1 (NOT p3)) (AND p1 (NOT p2))), acceptance={0} source=9 dest: 9}, { cond=(AND p1 p3 p2), acceptance={} source=9 dest: 10}], [{ cond=(AND p1 (NOT p2)), acceptance={0} source=10 dest: 9}, { cond=(AND p1 p2), acceptance={} source=10 dest: 10}], [{ cond=(OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), acceptance={} source=11 dest: 5}, { cond=(AND (NOT p0) p3 p2), acceptance={} source=11 dest: 6}, { cond=(OR (AND p1 (NOT p3)) (AND p1 (NOT p2))), acceptance={} source=11 dest: 9}, { cond=(AND (NOT p0) p1 p3 p2), acceptance={} source=11 dest: 10}, { cond=(OR (AND p0 (NOT p3)) (AND p0 (NOT p2))), acceptance={} source=11 dest: 11}, { cond=(AND p0 p3 p2), acceptance={} source=11 dest: 12}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=12 dest: 5}, { cond=(AND (NOT p0) p2), acceptance={} source=12 dest: 6}, { cond=(AND p1 (NOT p2)), acceptance={} source=12 dest: 9}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=12 dest: 10}, { cond=(AND p0 (NOT p2)), acceptance={} source=12 dest: 11}, { cond=(AND p0 p2), acceptance={} source=12 dest: 12}]], initial=0, aps=[p0:(GEQ s1091 1), p1:(GEQ s1266 1), p3:(GEQ s347 1), p2:(GEQ s1885 1)], nbAcceptance=1, 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][false, false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1 reset in 3106 ms.
Product exploration explored 100000 steps with 0 reset in 3429 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 p0) (NOT p1) (NOT p3) (NOT p2)), (X (NOT (AND (NOT p0) p1 p3 p2))), (X (NOT (AND (NOT p0) p3 p2))), (X (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2)))), (X (NOT (OR (AND (NOT p0) p1 (NOT p3)) (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (OR (AND p0 (NOT p3)) (AND p0 (NOT p2)))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 p3 p2)))), (X (X (NOT (AND (NOT p0) p3 p2)))), (X (X (NOT (OR (AND p0 p1 (NOT p3)) (AND p0 p1 (NOT p2)))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 p3 p2)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p1 p3 p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (OR (AND p1 (NOT p3)) (AND p1 (NOT p2)))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (OR (AND (NOT p0) p1 (NOT p3)) (AND (NOT p0) p1 (NOT p2))))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 23 factoid took 1147 ms. Reduced automaton from 13 states, 51 edges and 4 AP to 9 states, 38 edges and 4 AP.
Stuttering acceptance computed with spot in 505 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2)) (AND p1 (NOT p3)) (AND p1 (NOT p2))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (OR (AND p0 p1 (NOT p3)) (AND p0 p1 (NOT p2))), (AND p0 p1 (NOT p2)), (AND (NOT p0) (NOT p2)), (OR (AND p1 (NOT p3)) (AND p1 (NOT p2))), (AND p1 (NOT p2)), (OR (AND p1 (NOT p3)) (AND p1 (NOT p2))), (AND p1 (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 18) 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 18) 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 18) 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 18) 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 18) 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 18) 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 18) 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 18) 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 18) 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 18) 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 18) 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 18) 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 18) 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 18) 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 18) 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 18) 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 18) 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 18) 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 18) seen :0
Interrupted probabilistic random walk after 73582 steps, run timeout after 3002 ms. (steps per millisecond=24 ) properties seen :{7=1, 8=1}
Probabilistic random walk after 73582 steps, saw 61130 distinct states, run finished after 3003 ms. (steps per millisecond=24 ) properties seen :2
Running SMT prover for 16 properties.
// Phase 1: matrix 19404 rows 2500 cols
[2022-05-16 02:22:42] [INFO ] Computed 1 place invariants in 77 ms
[2022-05-16 02:22:43] [INFO ] [Real]Absence check using 1 positive place invariants in 14 ms returned sat
[2022-05-16 02:22:50] [INFO ] After 7176ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:15
[2022-05-16 02:22:51] [INFO ] After 7873ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:16
[2022-05-16 02:22:51] [INFO ] After 8651ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:16
[2022-05-16 02:22:51] [INFO ] [Nat]Absence check using 1 positive place invariants in 13 ms returned sat
[2022-05-16 02:23:10] [INFO ] After 18223ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :16
[2022-05-16 02:23:16] [INFO ] After 23960ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 7 ms.
[2022-05-16 02:23:16] [INFO ] After 25049ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Finished Parikh walk after 9966 steps, including 0 resets, run visited all 2 properties in 224 ms. (steps per millisecond=44 )
Parikh walk visited 16 properties in 3071 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), (X (NOT (AND (NOT p0) p1 p3 p2))), (X (NOT (AND (NOT p0) p3 p2))), (X (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2)))), (X (NOT (OR (AND (NOT p0) p1 (NOT p3)) (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (OR (AND p0 (NOT p3)) (AND p0 (NOT p2)))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 p3 p2)))), (X (X (NOT (AND (NOT p0) p3 p2)))), (X (X (NOT (OR (AND p0 p1 (NOT p3)) (AND p0 p1 (NOT p2)))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 p3 p2)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p1 p3 p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (OR (AND p1 (NOT p3)) (AND p1 (NOT p2)))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (OR (AND (NOT p0) p1 (NOT p3)) (AND (NOT p0) p1 (NOT p2))))))]
False Knowledge obtained : [(F (AND (NOT p0) p2)), (F (NOT (AND (NOT p0) (NOT p2)))), (F (AND p1 p0 (NOT p2))), (F (AND p1 p3 p2)), (F (OR (AND p1 (NOT p3) p0) (AND p1 p0 (NOT p2)))), (F (OR (AND p1 (NOT p3)) (AND p1 (NOT p2)))), (F (AND p1 p3 (NOT p0) p2)), (F (AND p1 (NOT p0) p2)), (F (AND p3 p0 p2)), (F (AND p1 (NOT p0) (NOT p2))), (F (OR (AND (NOT p3) p0) (AND p0 (NOT p2)))), (F (NOT (OR (AND (NOT p3) (NOT p0)) (AND (NOT p0) (NOT p2))))), (F (AND p1 p2)), (F (OR (AND p1 (NOT p3) (NOT p0)) (AND p1 (NOT p0) (NOT p2)))), (F (AND p1 (NOT p2))), (F (AND p3 (NOT p0) p2)), (F (AND p0 p2)), (F (AND p0 (NOT p2)))]
Knowledge based reduction with 23 factoid took 1487 ms. Reduced automaton from 9 states, 38 edges and 4 AP to 9 states, 38 edges and 4 AP.
Stuttering acceptance computed with spot in 420 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2)) (AND p1 (NOT p3)) (AND p1 (NOT p2))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (OR (AND p0 p1 (NOT p3)) (AND p0 p1 (NOT p2))), (AND p0 p1 (NOT p2)), (AND (NOT p0) (NOT p2)), (OR (AND p1 (NOT p3)) (AND p1 (NOT p2))), (AND p1 (NOT p2)), (OR (AND p1 (NOT p3)) (AND p1 (NOT p2))), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 382 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2)) (AND p1 (NOT p3)) (AND p1 (NOT p2))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (OR (AND p0 p1 (NOT p3)) (AND p0 p1 (NOT p2))), (AND p0 p1 (NOT p2)), (AND (NOT p0) (NOT p2)), (OR (AND p1 (NOT p3)) (AND p1 (NOT p2))), (AND p1 (NOT p2)), (OR (AND p1 (NOT p3)) (AND p1 (NOT p2))), (AND p1 (NOT p2))]
// Phase 1: matrix 19404 rows 2500 cols
[2022-05-16 02:23:21] [INFO ] Computed 1 place invariants in 79 ms
Proved EG (AND (NOT p0) (NOT p3))
// Phase 1: matrix 19404 rows 2500 cols
[2022-05-16 02:23:26] [INFO ] Computed 1 place invariants in 126 ms
Proved EG (AND (NOT p0) (NOT p2))
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), (X (NOT (AND (NOT p0) p1 p3 p2))), (X (NOT (AND (NOT p0) p3 p2))), (X (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2)))), (X (NOT (OR (AND (NOT p0) p1 (NOT p3)) (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (OR (AND p0 (NOT p3)) (AND p0 (NOT p2)))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 p3 p2)))), (X (X (NOT (AND (NOT p0) p3 p2)))), (X (X (NOT (OR (AND p0 p1 (NOT p3)) (AND p0 p1 (NOT p2)))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 p3 p2)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p1 p3 p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (OR (AND p1 (NOT p3)) (AND p1 (NOT p2)))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (OR (AND (NOT p0) p1 (NOT p3)) (AND (NOT p0) p1 (NOT p2))))))]
False Knowledge obtained : [(F (AND (NOT p0) p2)), (F (NOT (AND (NOT p0) (NOT p2)))), (F (AND p1 p0 (NOT p2))), (F (AND p1 p3 p2)), (F (OR (AND p1 (NOT p3) p0) (AND p1 p0 (NOT p2)))), (F (OR (AND p1 (NOT p3)) (AND p1 (NOT p2)))), (F (AND p1 p3 (NOT p0) p2)), (F (AND p1 (NOT p0) p2)), (F (AND p3 p0 p2)), (F (AND p1 (NOT p0) (NOT p2))), (F (OR (AND (NOT p3) p0) (AND p0 (NOT p2)))), (F (NOT (OR (AND (NOT p3) (NOT p0)) (AND (NOT p0) (NOT p2))))), (F (AND p1 p2)), (F (OR (AND p1 (NOT p3) (NOT p0)) (AND p1 (NOT p0) (NOT p2)))), (F (AND p1 (NOT p2))), (F (AND p3 (NOT p0) p2)), (F (AND p0 p2)), (F (AND p0 (NOT p2))), (G (AND (NOT p0) (NOT p3))), (G (AND (NOT p0) (NOT p2)))]
Property proved to be false thanks to negative knowledge :(G (AND (NOT p0) (NOT p3)))
Knowledge based reduction with 23 factoid took 806 ms. Reduced automaton from 9 states, 38 edges and 4 AP to 1 states, 1 edges and 0 AP.
FORMULA Diffusion2D-PT-D50N050-LTLFireability-13 FALSE TECHNIQUES KNOWLEDGE
Treatment of property Diffusion2D-PT-D50N050-LTLFireability-13 finished in 68492 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&G(F(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 3 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 37 ms. Remains 2 /2500 variables (removed 2498) and now considering 3/19404 (removed 19401) transitions.
// Phase 1: matrix 3 rows 2 cols
[2022-05-16 02:23:31] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 02:23:31] [INFO ] Implicit Places using invariants in 63 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2022-05-16 02:23:31] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:23:31] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 133 ms to find 0 implicit places.
[2022-05-16 02:23:31] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2022-05-16 02:23:31] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 02:23:31] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/2500 places, 3/19404 transitions.
Finished structural reductions, in 1 iterations. Remains : 2/2500 places, 3/19404 transitions.
Stuttering acceptance computed with spot in 147 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Diffusion2D-PT-D50N050-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LT s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA Diffusion2D-PT-D50N050-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D50N050-LTLFireability-14 finished in 428 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(G(X(F(G((X((p0 U (p0 U p1))) U p2))))))))'
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 429 ms. Remains 2500 /2500 variables (removed 0) and now considering 19404/19404 (removed 0) transitions.
// Phase 1: matrix 19404 rows 2500 cols
[2022-05-16 02:23:32] [INFO ] Computed 1 place invariants in 78 ms
[2022-05-16 02:23:32] [INFO ] Implicit Places using invariants in 302 ms returned []
Implicit Place search using SMT only with invariants took 303 ms to find 0 implicit places.
// Phase 1: matrix 19404 rows 2500 cols
[2022-05-16 02:23:32] [INFO ] Computed 1 place invariants in 81 ms
[2022-05-16 02:23:39] [INFO ] Dead Transitions using invariants and state equation in 6904 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 19404/19404 transitions.
Stuttering acceptance computed with spot in 97 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : Diffusion2D-PT-D50N050-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 0}, { cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(LT s517 1), p1:(GEQ s2371 1), p0:(GEQ s236 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 3040 ms.
Stack based approach found an accepted trace after 72579 steps with 0 reset with depth 72580 and stack size 9108 in 2273 ms.
FORMULA Diffusion2D-PT-D50N050-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property Diffusion2D-PT-D50N050-LTLFireability-15 finished in 13113 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(!(G(p0) U ((p1 U p2) U X(p2)))))'
Found a CL insensitive property : Diffusion2D-PT-D50N050-LTLFireability-04
Stuttering acceptance computed with spot in 189 ms :[p2, p2, false, false, (AND p0 p2), (AND p2 p0)]
Support contains 3 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SLCL_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 3 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 15 ms. Remains 4 /2500 variables (removed 2496) and now considering 7/19404 (removed 19397) transitions.
// Phase 1: matrix 7 rows 4 cols
[2022-05-16 02:23:45] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 02:23:45] [INFO ] Implicit Places using invariants in 29 ms returned []
// Phase 1: matrix 7 rows 4 cols
[2022-05-16 02:23:45] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 02:23:45] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
// Phase 1: matrix 7 rows 4 cols
[2022-05-16 02:23:45] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 02:23:45] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 4/2500 places, 7/19404 transitions.
Finished structural reductions, in 1 iterations. Remains : 4/2500 places, 7/19404 transitions.
Running random walk in product with property : Diffusion2D-PT-D50N050-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=p2, acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 3}, { cond=p0, acceptance={} source=0 dest: 4}], [{ cond=p2, acceptance={0, 1} source=1 dest: 1}, { cond=p2, acceptance={0} source=1 dest: 2}, { cond=(AND p0 p2), acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={0, 1} source=2 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 (NOT p2)), acceptance={1} source=3 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 3}], [{ cond=p0, acceptance={0} source=4 dest: 4}, { cond=p0, acceptance={0, 1} source=4 dest: 5}], [{ cond=(AND p0 p2), acceptance={0} source=5 dest: 4}, { cond=(AND p0 p2), acceptance={0, 1} source=5 dest: 5}]], initial=0, aps=[p2:(GEQ s0 1), p1:(OR (LT s1 1) (LT s2 1)), p0:(GEQ s2 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 24 steps with 10 reset in 1 ms.
Treatment of property Diffusion2D-PT-D50N050-LTLFireability-04 finished in 420 ms.
CL/SL decision was in the wrong direction : CL + false
[2022-05-16 02:23:45] [INFO ] Flatten gal took : 306 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin15870267696635245219
[2022-05-16 02:23:46] [INFO ] Too many transitions (19404) to apply POR reductions. Disabling POR matrices.
[2022-05-16 02:23:46] [INFO ] Built C files in 171ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15870267696635245219
Running compilation step : cd /tmp/ltsmin15870267696635245219;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-05-16 02:23:46] [INFO ] Applying decomposition
[2022-05-16 02:23:46] [INFO ] Flatten gal took : 515 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph10776421417648936330.txt' '-o' '/tmp/graph10776421417648936330.bin' '-w' '/tmp/graph10776421417648936330.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph10776421417648936330.bin' '-l' '-1' '-v' '-w' '/tmp/graph10776421417648936330.weights' '-q' '0' '-e' '0.001'
[2022-05-16 02:23:47] [INFO ] Decomposing Gal with order
[2022-05-16 02:23:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 02:23:49] [INFO ] Removed a total of 13606 redundant transitions.
[2022-05-16 02:23:49] [INFO ] Flatten gal took : 890 ms
[2022-05-16 02:23:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 102 labels/synchronizations in 203 ms.
[2022-05-16 02:23:50] [INFO ] Time to serialize gal into /tmp/LTLFireability12446679268923870021.gal : 67 ms
[2022-05-16 02:23:50] [INFO ] Time to serialize properties into /tmp/LTLFireability14724631471379670259.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability12446679268923870021.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability14724631471379670259.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...269
Read 1 LTL properties
Checking formula 0 : !((F(!((G("(i9.i1.i0.u196.cAMP__35_34_>=1)"))U((("((i9.i1.i0.u197.cAMP__33_41_<1)||(i9.i1.i0.u196.cAMP__35_34_<1))")U("(i15.u91.cAMP__...204
Formula 0 simplified : !F!(G"(i9.i1.i0.u196.cAMP__35_34_>=1)" U (("((i9.i1.i0.u197.cAMP__33_41_<1)||(i9.i1.i0.u196.cAMP__35_34_<1))" U "(i15.u91.cAMP__1_24...194
Compilation finished in 180431 ms.
Running link step : cd /tmp/ltsmin15870267696635245219;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 139 ms.
Running LTSmin : cd /tmp/ltsmin15870267696635245219;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(!([]((LTLAPp0==true)) U (((LTLAPp1==true) U (LTLAPp2==true)) U X((LTLAPp2==true)))))' '--buchi-type=spotba'
LTSmin run took 363364 ms.
FORMULA Diffusion2D-PT-D50N050-LTLFireability-04 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 971321 ms.
BK_STOP 1652668370407
--------------------
content from stderr:
+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m
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-D50N050"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is Diffusion2D-PT-D50N050, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r060-tall-165254772600852"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Diffusion2D-PT-D50N050.tgz
mv Diffusion2D-PT-D50N050 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;