About the Execution of ITS-Tools for Diffusion2D-PT-D50N100
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 9677.056 | 3600000.00 | 6373015.00 | 8695.80 | FFFF?FFTFF?FFFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r133-smll-167819410600268.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is Diffusion2D-PT-D50N100, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r133-smll-167819410600268
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 7.7M
-rw-r--r-- 1 mcc users 7.3K Feb 26 04:11 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Feb 26 04:11 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Feb 26 04:09 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 26 04:09 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.4K Feb 25 15:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Feb 25 15:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 04:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 104K Feb 26 04:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Feb 26 04:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 26 04:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 15:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:59 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 8 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 7.3M Mar 5 18:22 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME Diffusion2D-PT-D50N100-LTLFireability-00
FORMULA_NAME Diffusion2D-PT-D50N100-LTLFireability-01
FORMULA_NAME Diffusion2D-PT-D50N100-LTLFireability-02
FORMULA_NAME Diffusion2D-PT-D50N100-LTLFireability-03
FORMULA_NAME Diffusion2D-PT-D50N100-LTLFireability-04
FORMULA_NAME Diffusion2D-PT-D50N100-LTLFireability-05
FORMULA_NAME Diffusion2D-PT-D50N100-LTLFireability-06
FORMULA_NAME Diffusion2D-PT-D50N100-LTLFireability-07
FORMULA_NAME Diffusion2D-PT-D50N100-LTLFireability-08
FORMULA_NAME Diffusion2D-PT-D50N100-LTLFireability-09
FORMULA_NAME Diffusion2D-PT-D50N100-LTLFireability-10
FORMULA_NAME Diffusion2D-PT-D50N100-LTLFireability-11
FORMULA_NAME Diffusion2D-PT-D50N100-LTLFireability-12
FORMULA_NAME Diffusion2D-PT-D50N100-LTLFireability-13
FORMULA_NAME Diffusion2D-PT-D50N100-LTLFireability-14
FORMULA_NAME Diffusion2D-PT-D50N100-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1678401248884
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Diffusion2D-PT-D50N100
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-09 22:34:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-09 22:34:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 22:34:13] [INFO ] Load time of PNML (sax parser for PT used): 924 ms
[2023-03-09 22:34:13] [INFO ] Transformed 2500 places.
[2023-03-09 22:34:13] [INFO ] Transformed 19404 transitions.
[2023-03-09 22:34:13] [INFO ] Parsed PT model containing 2500 places and 19404 transitions and 38808 arcs in 1167 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 23 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA Diffusion2D-PT-D50N100-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Diffusion2D-PT-D50N100-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Diffusion2D-PT-D50N100-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Diffusion2D-PT-D50N100-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 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 1230 ms. Remains 2500 /2500 variables (removed 0) and now considering 19404/19404 (removed 0) transitions.
// Phase 1: matrix 19404 rows 2500 cols
[2023-03-09 22:34:15] [INFO ] Computed 1 place invariants in 194 ms
[2023-03-09 22:34:16] [INFO ] Implicit Places using invariants in 1219 ms returned []
Implicit Place search using SMT only with invariants took 1271 ms to find 0 implicit places.
[2023-03-09 22:34:16] [INFO ] Invariant cache hit.
[2023-03-09 22:34:34] [INFO ] Dead Transitions using invariants and state equation in 18156 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20672 ms. Remains : 2500/2500 places, 19404/19404 transitions.
Support contains 28 out of 2500 places after structural reductions.
[2023-03-09 22:34:35] [INFO ] Flatten gal took : 862 ms
[2023-03-09 22:34:36] [INFO ] Flatten gal took : 420 ms
[2023-03-09 22:34:37] [INFO ] Input system was already deterministic with 19404 transitions.
Support contains 23 out of 2500 places (down from 28) after GAL structural reductions.
Incomplete random walk after 10001 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 23) 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 23) 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 23) 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 23) 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 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 23) 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 23) 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 23) 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 23) 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 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) seen :0
Interrupted probabilistic random walk after 126468 steps, run timeout after 3001 ms. (steps per millisecond=42 ) properties seen :{1=1, 4=1, 5=1, 6=1}
Probabilistic random walk after 126468 steps, saw 104689 distinct states, run finished after 3003 ms. (steps per millisecond=42 ) properties seen :4
Running SMT prover for 19 properties.
[2023-03-09 22:34:41] [INFO ] Invariant cache hit.
[2023-03-09 22:34:43] [INFO ] [Real]Absence check using 1 positive place invariants in 36 ms returned sat
[2023-03-09 22:35:06] [INFO ] After 21685ms SMT Verify possible using state equation in real domain returned unsat :0 sat :9 real:10
[2023-03-09 22:35:06] [INFO ] After 21736ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :9 real:10
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-09 22:35:06] [INFO ] After 25155ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :9 real:10
[2023-03-09 22:35:08] [INFO ] [Nat]Absence check using 1 positive place invariants in 31 ms returned sat
[2023-03-09 22:35:31] [INFO ] After 22227ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :18
[2023-03-09 22:35:31] [INFO ] After 22230ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :18
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-09 22:35:31] [INFO ] After 25049ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :18
Fused 19 Parikh solutions to 14 different solutions.
Finished Parikh walk after 34484 steps, including 0 resets, run visited all 1 properties in 411 ms. (steps per millisecond=83 )
Parikh walk visited 19 properties in 8531 ms.
FORMULA Diffusion2D-PT-D50N100-LTLFireability-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&F((F(G(p1))&&G(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 590 ms. Remains 2500 /2500 variables (removed 0) and now considering 19404/19404 (removed 0) transitions.
[2023-03-09 22:35:41] [INFO ] Invariant cache hit.
[2023-03-09 22:35:41] [INFO ] Implicit Places using invariants in 520 ms returned []
Implicit Place search using SMT only with invariants took 522 ms to find 0 implicit places.
[2023-03-09 22:35:41] [INFO ] Invariant cache hit.
[2023-03-09 22:35:57] [INFO ] Dead Transitions using invariants and state equation in 16222 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17343 ms. Remains : 2500/2500 places, 19404/19404 transitions.
Stuttering acceptance computed with spot in 506 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1)), true, (OR (NOT p2) (NOT p1)), (NOT p1)]
Running random walk in product with property : Diffusion2D-PT-D50N100-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}, { cond=(AND p2 p0 (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p2, acceptance={} source=3 dest: 3}, { cond=(NOT p2), acceptance={0} source=3 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=p1, acceptance={} source=4 dest: 4}, { cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(LT s254 1), p2:(LT s1395 1), p1:(LT s2240 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 7314 ms.
Stack based approach found an accepted trace after 29688 steps with 0 reset with depth 29689 and stack size 12743 in 1868 ms.
FORMULA Diffusion2D-PT-D50N100-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property Diffusion2D-PT-D50N100-LTLFireability-00 finished in 27193 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
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 48 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 97 ms. Remains 2 /2500 variables (removed 2498) and now considering 3/19404 (removed 19401) transitions.
// Phase 1: matrix 3 rows 2 cols
[2023-03-09 22:36:07] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-09 22:36:07] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-09 22:36:07] [INFO ] Invariant cache hit.
[2023-03-09 22:36:07] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2023-03-09 22:36:07] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 22:36:07] [INFO ] Invariant cache hit.
[2023-03-09 22:36:07] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/2500 places, 3/19404 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 175 ms. Remains : 2/2500 places, 3/19404 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Diffusion2D-PT-D50N100-LTLFireability-01 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 1 ms.
FORMULA Diffusion2D-PT-D50N100-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D50N100-LTLFireability-01 finished in 275 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||(p1&&F(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 605 ms. Remains 2500 /2500 variables (removed 0) and now considering 19404/19404 (removed 0) transitions.
// Phase 1: matrix 19404 rows 2500 cols
[2023-03-09 22:36:08] [INFO ] Computed 1 place invariants in 143 ms
[2023-03-09 22:36:09] [INFO ] Implicit Places using invariants in 626 ms returned []
Implicit Place search using SMT only with invariants took 629 ms to find 0 implicit places.
[2023-03-09 22:36:09] [INFO ] Invariant cache hit.
[2023-03-09 22:36:24] [INFO ] Dead Transitions using invariants and state equation in 15738 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16977 ms. Remains : 2500/2500 places, 19404/19404 transitions.
Stuttering acceptance computed with spot in 314 ms :[true, (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : Diffusion2D-PT-D50N100-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=5 dest: 5}]], initial=2, aps=[p2:(GEQ s1939 1), p0:(AND (LT s666 1) (GEQ s1939 1)), p1:(GEQ s2051 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, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA Diffusion2D-PT-D50N100-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D50N100-LTLFireability-02 finished in 17357 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(p0)&&(G(p1)||F(((X(p2)&&G(p0))||G(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 854 ms. Remains 2500 /2500 variables (removed 0) and now considering 19404/19404 (removed 0) transitions.
[2023-03-09 22:36:26] [INFO ] Invariant cache hit.
[2023-03-09 22:36:26] [INFO ] Implicit Places using invariants in 491 ms returned []
Implicit Place search using SMT only with invariants took 497 ms to find 0 implicit places.
[2023-03-09 22:36:26] [INFO ] Invariant cache hit.
[2023-03-09 22:36:40] [INFO ] Dead Transitions using invariants and state equation in 14176 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15531 ms. Remains : 2500/2500 places, 19404/19404 transitions.
Stuttering acceptance computed with spot in 660 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : Diffusion2D-PT-D50N100-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 5}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 6}, { cond=(AND p1 p0), acceptance={} source=1 dest: 7}, { cond=(AND p1 p0), acceptance={} source=1 dest: 8}], [{ cond=(NOT p0), acceptance={0, 1, 2} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p1) p2 (NOT p0)), acceptance={0, 2} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0, 1, 2} source=3 dest: 3}, { cond=(AND (NOT p1) p2 p0), acceptance={0, 2} source=3 dest: 4}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0, 1, 2} source=3 dest: 4}, { cond=(AND (NOT p1) p2 p0), acceptance={0} source=3 dest: 5}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0, 1} source=3 dest: 5}, { cond=(AND p1 p2 (NOT p0)), acceptance={2} source=3 dest: 6}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={1, 2} source=3 dest: 6}, { cond=(AND p1 p2 p0), acceptance={2} source=3 dest: 7}, { cond=(AND p1 (NOT p2) p0), acceptance={1, 2} source=3 dest: 7}, { cond=(AND p1 p2 p0), acceptance={} source=3 dest: 8}, { cond=(AND p1 (NOT p2) p0), acceptance={1} source=3 dest: 8}, { cond=(AND p1 p2 p0), acceptance={0} source=3 dest: 9}, { cond=(AND p1 (NOT p2) p0), acceptance={0, 1} source=3 dest: 9}, { cond=(AND p1 p2 (NOT p0)), acceptance={0, 2} source=3 dest: 9}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={0, 1, 2} source=3 dest: 9}, { cond=(AND p1 p2 p0), acceptance={0, 2} source=3 dest: 10}, { cond=(AND p1 (NOT p2) p0), acceptance={0, 1, 2} source=3 dest: 10}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0, 1, 2} source=4 dest: 3}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0, 1, 2} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0, 1} source=4 dest: 5}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={1, 2} source=4 dest: 6}, { cond=(AND p1 (NOT p2) p0), acceptance={1, 2} source=4 dest: 7}, { cond=(AND p1 (NOT p2) p0), acceptance={1} source=4 dest: 8}, { cond=(AND p1 (NOT p2) p0), acceptance={0, 1} source=4 dest: 9}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={0, 1, 2} source=4 dest: 9}, { cond=(AND p1 (NOT p2) p0), acceptance={0, 1, 2} source=4 dest: 10}], [{ cond=(AND (NOT p1) p2 (NOT p0)), acceptance={0, 2} source=5 dest: 3}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0, 1, 2} source=5 dest: 3}, { cond=(AND (NOT p1) p2 p0), acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0, 1} source=5 dest: 5}, { cond=(AND p1 p2 (NOT p0)), acceptance={2} source=5 dest: 6}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={1, 2} source=5 dest: 6}, { cond=(AND p1 p2 p0), acceptance={} source=5 dest: 8}, { cond=(AND p1 (NOT p2) p0), acceptance={1} source=5 dest: 8}, { cond=(AND p1 p2 p0), acceptance={0} source=5 dest: 9}, { cond=(AND p1 (NOT p2) p0), acceptance={0, 1} source=5 dest: 9}, { cond=(AND p1 p2 (NOT p0)), acceptance={0, 2} source=5 dest: 9}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={0, 1, 2} source=5 dest: 9}], [{ cond=(AND (NOT p1) p2 (NOT p0)), acceptance={0, 2} source=6 dest: 3}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0, 1, 2} source=6 dest: 3}, { cond=(AND (NOT p1) p2 p0), acceptance={0, 2} source=6 dest: 4}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0, 1, 2} source=6 dest: 4}, { cond=(AND (NOT p1) p2 p0), acceptance={0} source=6 dest: 5}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0, 1} source=6 dest: 5}, { cond=(AND p1 p2 (NOT p0)), acceptance={2} source=6 dest: 6}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={1, 2} source=6 dest: 6}, { cond=(AND p1 p2 p0), acceptance={2} source=6 dest: 7}, { cond=(AND p1 (NOT p2) p0), acceptance={1, 2} source=6 dest: 7}, { cond=(AND p1 p2 p0), acceptance={} source=6 dest: 8}, { cond=(AND p1 (NOT p2) p0), acceptance={1} source=6 dest: 8}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0, 1, 2} source=7 dest: 3}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0, 1, 2} source=7 dest: 4}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0, 1} source=7 dest: 5}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={1, 2} source=7 dest: 6}, { cond=(AND p1 (NOT p2) p0), acceptance={1, 2} source=7 dest: 7}, { cond=(AND p1 (NOT p2) p0), acceptance={1} source=7 dest: 8}], [{ cond=(AND (NOT p1) p2 (NOT p0)), acceptance={0, 2} source=8 dest: 3}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0, 1, 2} source=8 dest: 3}, { cond=(AND (NOT p1) p2 p0), acceptance={0} source=8 dest: 5}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0, 1} source=8 dest: 5}, { cond=(AND p1 p2 (NOT p0)), acceptance={2} source=8 dest: 6}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={1, 2} source=8 dest: 6}, { cond=(AND p1 p2 p0), acceptance={} source=8 dest: 8}, { cond=(AND p1 (NOT p2) p0), acceptance={1} source=8 dest: 8}], [{ cond=(AND (NOT p1) p2 (NOT p0)), acceptance={0, 2} source=9 dest: 3}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0, 1, 2} source=9 dest: 3}, { cond=(AND p1 p2 (NOT p0)), acceptance={2} source=9 dest: 6}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={1, 2} source=9 dest: 6}, { cond=(AND p1 p2 (NOT p0)), acceptance={0, 2} source=9 dest: 9}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={0, 1, 2} source=9 dest: 9}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0, 1, 2} source=10 dest: 3}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={1, 2} source=10 dest: 6}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={0, 1, 2} source=10 dest: 9}]], initial=0, aps=[p1:(LT s298 1), p0:(LT s1474 1), p2:(LT s949 1)], nbAcceptance=3, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 44 reset in 3140 ms.
Product exploration explored 100000 steps with 70 reset in 3076 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0 p2), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 p0)), (X (X p0)), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (AND p1 p2 p0))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) p0))))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 1439 ms. Reduced automaton from 11 states, 85 edges and 3 AP (stutter sensitive) to 10 states, 76 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 615 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10003 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 8) 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 8) seen :0
Interrupted probabilistic random walk after 138948 steps, run timeout after 3001 ms. (steps per millisecond=46 ) properties seen :{}
Probabilistic random walk after 138948 steps, saw 114114 distinct states, run finished after 3001 ms. (steps per millisecond=46 ) properties seen :0
Running SMT prover for 8 properties.
[2023-03-09 22:36:53] [INFO ] Invariant cache hit.
[2023-03-09 22:36:54] [INFO ] [Real]Absence check using 1 positive place invariants in 23 ms returned sat
[2023-03-09 22:37:07] [INFO ] After 13283ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:7
[2023-03-09 22:37:08] [INFO ] After 14776ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-09 22:37:08] [INFO ] After 15604ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-09 22:37:09] [INFO ] [Nat]Absence check using 1 positive place invariants in 31 ms returned sat
[2023-03-09 22:37:33] [INFO ] After 23686ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-09 22:37:33] [INFO ] After 23688ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 11 ms.
[2023-03-09 22:37:33] [INFO ] After 25054ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 8 Parikh solutions to 7 different solutions.
Finished Parikh walk after 11628 steps, including 0 resets, run visited all 2 properties in 213 ms. (steps per millisecond=54 )
Parikh walk visited 8 properties in 919 ms.
Knowledge obtained : [(AND p1 p0 p2), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 p0)), (X (X p0)), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (AND p1 p2 p0))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) p0))))]
False Knowledge obtained : [(F (AND (NOT p0) p1 p2)), (F (AND p0 (NOT p1) (NOT p2))), (F (NOT (AND p0 p1 p2))), (F (AND (NOT p0) p1 (NOT p2))), (F (AND (NOT p0) (NOT p1) p2)), (F (AND p0 (NOT p1) p2)), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND p0 p1 (NOT p2)))]
Knowledge based reduction with 16 factoid took 1785 ms. Reduced automaton from 10 states, 76 edges and 3 AP (stutter sensitive) to 10 states, 76 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 702 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 643 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT 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 792 ms. Remains 2500 /2500 variables (removed 0) and now considering 19404/19404 (removed 0) transitions.
[2023-03-09 22:37:38] [INFO ] Invariant cache hit.
[2023-03-09 22:37:39] [INFO ] Implicit Places using invariants in 376 ms returned []
Implicit Place search using SMT only with invariants took 378 ms to find 0 implicit places.
[2023-03-09 22:37:39] [INFO ] Invariant cache hit.
[2023-03-09 22:37:39] [INFO ] Dead Transitions using invariants and state equation in 561 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1739 ms. 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 p0 p1 p2), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND p0 p1 p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 p1 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 727 ms. Reduced automaton from 10 states, 76 edges and 3 AP (stutter sensitive) to 10 states, 76 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 648 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 142825 steps, run timeout after 3001 ms. (steps per millisecond=47 ) properties seen :{}
Probabilistic random walk after 142825 steps, saw 117371 distinct states, run finished after 3001 ms. (steps per millisecond=47 ) properties seen :0
Running SMT prover for 8 properties.
[2023-03-09 22:37:44] [INFO ] Invariant cache hit.
[2023-03-09 22:37:45] [INFO ] [Real]Absence check using 1 positive place invariants in 21 ms returned sat
[2023-03-09 22:37:59] [INFO ] After 13912ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:7
[2023-03-09 22:38:01] [INFO ] After 15492ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-09 22:38:01] [INFO ] After 16668ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-09 22:38:02] [INFO ] [Nat]Absence check using 1 positive place invariants in 20 ms returned sat
[2023-03-09 22:38:26] [INFO ] After 23763ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-09 22:38:26] [INFO ] After 23765ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-09 22:38:26] [INFO ] After 25047ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Fused 8 Parikh solutions to 6 different solutions.
Finished Parikh walk after 11691 steps, including 0 resets, run visited all 1 properties in 178 ms. (steps per millisecond=65 )
Parikh walk visited 8 properties in 772 ms.
Knowledge obtained : [(AND p0 p1 p2), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND p0 p1 p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 p1 (NOT p2)))))]
False Knowledge obtained : [(F (AND (NOT p0) p1 p2)), (F (AND p0 (NOT p1) (NOT p2))), (F (NOT (AND p0 p1 p2))), (F (AND (NOT p0) p1 (NOT p2))), (F (AND (NOT p0) (NOT p1) p2)), (F (AND p0 (NOT p1) p2)), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND p0 p1 (NOT p2)))]
Knowledge based reduction with 9 factoid took 1305 ms. Reduced automaton from 10 states, 76 edges and 3 AP (stutter sensitive) to 10 states, 76 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 643 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 653 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 638 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 18 reset in 3432 ms.
Product exploration explored 100000 steps with 16 reset in 3670 ms.
Built C files in :
/tmp/ltsmin1802596615880539177
[2023-03-09 22:38:38] [INFO ] Built C files in 401ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1802596615880539177
Running compilation step : cd /tmp/ltsmin1802596615880539177;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin1802596615880539177;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin1802596615880539177;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
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 680 ms. Remains 2500 /2500 variables (removed 0) and now considering 19404/19404 (removed 0) transitions.
[2023-03-09 22:38:42] [INFO ] Invariant cache hit.
[2023-03-09 22:38:42] [INFO ] Implicit Places using invariants in 365 ms returned []
Implicit Place search using SMT only with invariants took 366 ms to find 0 implicit places.
[2023-03-09 22:38:42] [INFO ] Invariant cache hit.
[2023-03-09 22:38:58] [INFO ] Dead Transitions using invariants and state equation in 15890 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16937 ms. Remains : 2500/2500 places, 19404/19404 transitions.
Built C files in :
/tmp/ltsmin6958010344772745072
[2023-03-09 22:38:58] [INFO ] Built C files in 293ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6958010344772745072
Running compilation step : cd /tmp/ltsmin6958010344772745072;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin6958010344772745072;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin6958010344772745072;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-09 22:39:02] [INFO ] Flatten gal took : 340 ms
[2023-03-09 22:39:03] [INFO ] Flatten gal took : 347 ms
[2023-03-09 22:39:03] [INFO ] Time to serialize gal into /tmp/LTL7182923781056631707.gal : 137 ms
[2023-03-09 22:39:03] [INFO ] Time to serialize properties into /tmp/LTL3871271815068996896.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7182923781056631707.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11484712067280058505.hoa' '-atoms' '/tmp/LTL3871271815068996896.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL3871271815068996896.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11484712067280058505.hoa
Detected timeout of ITS tools.
[2023-03-09 22:39:19] [INFO ] Flatten gal took : 363 ms
[2023-03-09 22:39:19] [INFO ] Flatten gal took : 306 ms
[2023-03-09 22:39:19] [INFO ] Time to serialize gal into /tmp/LTL17801561158281685158.gal : 58 ms
[2023-03-09 22:39:19] [INFO ] Time to serialize properties into /tmp/LTL16953483168934223497.ltl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17801561158281685158.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16953483168934223497.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(F((X("(cAMP__37_32_<1)"))&&((G("(cAMP__15_8_<1)"))||(F((G("(cAMP__27_9_<1)"))||((X("(cAMP__27_9_<1)"))&&(G("(cAMP__37_32_<1)"))))...161
Formula 0 simplified : XG(X!"(cAMP__37_32_<1)" | (F!"(cAMP__15_8_<1)" & G(F!"(cAMP__27_9_<1)" & (X!"(cAMP__27_9_<1)" | F!"(cAMP__37_32_<1)"))))
Detected timeout of ITS tools.
[2023-03-09 22:39:34] [INFO ] Flatten gal took : 281 ms
[2023-03-09 22:39:34] [INFO ] Applying decomposition
[2023-03-09 22:39:35] [INFO ] Flatten gal took : 329 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph8613866507060001329.txt' '-o' '/tmp/graph8613866507060001329.bin' '-w' '/tmp/graph8613866507060001329.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph8613866507060001329.bin' '-l' '-1' '-v' '-w' '/tmp/graph8613866507060001329.weights' '-q' '0' '-e' '0.001'
[2023-03-09 22:39:35] [INFO ] Decomposing Gal with order
[2023-03-09 22:39:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-09 22:39:38] [INFO ] Removed a total of 13660 redundant transitions.
[2023-03-09 22:39:38] [INFO ] Flatten gal took : 1436 ms
[2023-03-09 22:39:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 62 labels/synchronizations in 197 ms.
[2023-03-09 22:39:38] [INFO ] Time to serialize gal into /tmp/LTL16433957223428132643.gal : 117 ms
[2023-03-09 22:39:38] [INFO ] Time to serialize properties into /tmp/LTL8296344049676389439.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16433957223428132643.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8296344049676389439.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(F((X("(i10.i1.i0.u225.cAMP__37_32_<1)"))&&((G("(i3.u48.cAMP__15_8_<1)"))||(F((G("(i6.u140.cAMP__27_9_<1)"))||((X("(i6.u140.cAMP__...214
Formula 0 simplified : XG(X!"(i10.i1.i0.u225.cAMP__37_32_<1)" | (F!"(i3.u48.cAMP__15_8_<1)" & G(F!"(i6.u140.cAMP__27_9_<1)" & (X!"(i6.u140.cAMP__27_9_<1)" ...196
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10704977963398833618
[2023-03-09 22:39:54] [INFO ] Built C files in 156ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10704977963398833618
Running compilation step : cd /tmp/ltsmin10704977963398833618;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin10704977963398833618;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin10704977963398833618;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property Diffusion2D-PT-D50N100-LTLFireability-04 finished in 211820 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(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 14 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 31 ms. Remains 2 /2500 variables (removed 2498) and now considering 3/19404 (removed 19401) transitions.
// Phase 1: matrix 3 rows 2 cols
[2023-03-09 22:39:57] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-09 22:39:57] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-03-09 22:39:57] [INFO ] Invariant cache hit.
[2023-03-09 22:39:57] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2023-03-09 22:39:57] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 22:39:57] [INFO ] Invariant cache hit.
[2023-03-09 22:39:57] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/2500 places, 3/19404 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 98 ms. Remains : 2/2500 places, 3/19404 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : Diffusion2D-PT-D50N100-LTLFireability-06 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-D50N100-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D50N100-LTLFireability-06 finished in 153 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 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 577 ms. Remains 2500 /2500 variables (removed 0) and now considering 19404/19404 (removed 0) transitions.
// Phase 1: matrix 19404 rows 2500 cols
[2023-03-09 22:39:57] [INFO ] Computed 1 place invariants in 104 ms
[2023-03-09 22:39:58] [INFO ] Implicit Places using invariants in 485 ms returned []
Implicit Place search using SMT only with invariants took 486 ms to find 0 implicit places.
[2023-03-09 22:39:58] [INFO ] Invariant cache hit.
[2023-03-09 22:40:13] [INFO ] Dead Transitions using invariants and state equation in 15377 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16441 ms. Remains : 2500/2500 places, 19404/19404 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Diffusion2D-PT-D50N100-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s1255 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 21 reset in 2972 ms.
Stack based approach found an accepted trace after 2 steps with 0 reset with depth 3 and stack size 3 in 1 ms.
FORMULA Diffusion2D-PT-D50N100-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property Diffusion2D-PT-D50N100-LTLFireability-08 finished in 19521 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)||(p2&&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 513 ms. Remains 2500 /2500 variables (removed 0) and now considering 19404/19404 (removed 0) transitions.
[2023-03-09 22:40:17] [INFO ] Invariant cache hit.
[2023-03-09 22:40:17] [INFO ] Implicit Places using invariants in 364 ms returned []
Implicit Place search using SMT only with invariants took 365 ms to find 0 implicit places.
[2023-03-09 22:40:17] [INFO ] Invariant cache hit.
[2023-03-09 22:40:33] [INFO ] Dead Transitions using invariants and state equation in 15869 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16753 ms. Remains : 2500/2500 places, 19404/19404 transitions.
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Running random walk in product with property : Diffusion2D-PT-D50N100-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=0 dest: 2}], [{ cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={0} source=1 dest: 2}], [{ cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 1}]], initial=0, aps=[p1:(GEQ s2348 1), p0:(LT s798 1), p2:(LT s646 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 6 reset in 4443 ms.
Product exploration explored 100000 steps with 8 reset in 4167 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0 p2), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND p1 (NOT p0) p2))), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) p2))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 388 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter sensitive) to 3 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 154 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) 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
Interrupted probabilistic random walk after 186381 steps, run timeout after 3001 ms. (steps per millisecond=62 ) properties seen :{}
Probabilistic random walk after 186381 steps, saw 150881 distinct states, run finished after 3002 ms. (steps per millisecond=62 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-09 22:40:46] [INFO ] Invariant cache hit.
[2023-03-09 22:40:46] [INFO ] [Real]Absence check using 1 positive place invariants in 33 ms returned sat
[2023-03-09 22:40:57] [INFO ] After 10841ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:3
[2023-03-09 22:40:59] [INFO ] After 12039ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-09 22:40:59] [INFO ] After 12950ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-09 22:40:59] [INFO ] [Nat]Absence check using 1 positive place invariants in 22 ms returned sat
[2023-03-09 22:41:13] [INFO ] After 13932ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-09 22:41:19] [INFO ] After 19713ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 2537 ms.
[2023-03-09 22:41:22] [INFO ] After 23052ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Finished Parikh walk after 40437 steps, including 1 resets, run visited all 4 properties in 983 ms. (steps per millisecond=41 )
Parikh walk visited 4 properties in 983 ms.
Knowledge obtained : [(AND (NOT p1) p0 p2), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND p1 (NOT p0) p2))), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) p2))))]
False Knowledge obtained : [(F (AND (NOT p0) p1 p2)), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND (NOT p0) p1 (NOT p2))), (F (AND (NOT p0) (NOT p1) p2))]
Knowledge based reduction with 9 factoid took 620 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter sensitive) to 3 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 214 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 171 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT 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 763 ms. Remains 2500 /2500 variables (removed 0) and now considering 19404/19404 (removed 0) transitions.
[2023-03-09 22:41:24] [INFO ] Invariant cache hit.
[2023-03-09 22:41:25] [INFO ] Implicit Places using invariants in 370 ms returned []
Implicit Place search using SMT only with invariants took 371 ms to find 0 implicit places.
[2023-03-09 22:41:25] [INFO ] Invariant cache hit.
[2023-03-09 22:41:39] [INFO ] Dead Transitions using invariants and state equation in 14433 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15570 ms. 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 p0 (NOT p1) p2), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 524 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter sensitive) to 3 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 164 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Incomplete random walk after 10002 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 163558 steps, run timeout after 3001 ms. (steps per millisecond=54 ) properties seen :{}
Probabilistic random walk after 163558 steps, saw 133342 distinct states, run finished after 3001 ms. (steps per millisecond=54 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-09 22:41:43] [INFO ] Invariant cache hit.
[2023-03-09 22:41:44] [INFO ] [Real]Absence check using 1 positive place invariants in 31 ms returned sat
[2023-03-09 22:41:56] [INFO ] After 11497ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:3
[2023-03-09 22:41:57] [INFO ] After 13085ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-09 22:41:57] [INFO ] After 13950ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-09 22:41:58] [INFO ] [Nat]Absence check using 1 positive place invariants in 31 ms returned sat
[2023-03-09 22:42:12] [INFO ] After 13967ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-09 22:42:16] [INFO ] After 17968ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 2794 ms.
[2023-03-09 22:42:19] [INFO ] After 21808ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Finished Parikh walk after 22108 steps, including 0 resets, run visited all 1 properties in 250 ms. (steps per millisecond=88 )
Parikh walk visited 4 properties in 1300 ms.
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(F (AND (NOT p0) p1 p2)), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND (NOT p0) p1 (NOT p2))), (F (AND (NOT p0) (NOT p1) p2))]
Knowledge based reduction with 9 factoid took 670 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter sensitive) to 3 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 163 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 165 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 166 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 10 reset in 4108 ms.
Product exploration explored 100000 steps with 7 reset in 4303 ms.
Built C files in :
/tmp/ltsmin8858859157863590793
[2023-03-09 22:42:30] [INFO ] Built C files in 138ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8858859157863590793
Running compilation step : cd /tmp/ltsmin8858859157863590793;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin8858859157863590793;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin8858859157863590793;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
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 704 ms. Remains 2500 /2500 variables (removed 0) and now considering 19404/19404 (removed 0) transitions.
[2023-03-09 22:42:34] [INFO ] Invariant cache hit.
[2023-03-09 22:42:34] [INFO ] Implicit Places using invariants in 529 ms returned []
Implicit Place search using SMT only with invariants took 530 ms to find 0 implicit places.
[2023-03-09 22:42:34] [INFO ] Invariant cache hit.
[2023-03-09 22:42:49] [INFO ] Dead Transitions using invariants and state equation in 14577 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15815 ms. Remains : 2500/2500 places, 19404/19404 transitions.
Built C files in :
/tmp/ltsmin5593063343674719619
[2023-03-09 22:42:49] [INFO ] Built C files in 132ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5593063343674719619
Running compilation step : cd /tmp/ltsmin5593063343674719619;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin5593063343674719619;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin5593063343674719619;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-09 22:42:53] [INFO ] Flatten gal took : 511 ms
[2023-03-09 22:42:53] [INFO ] Flatten gal took : 358 ms
[2023-03-09 22:42:53] [INFO ] Time to serialize gal into /tmp/LTL17574034609460419886.gal : 53 ms
[2023-03-09 22:42:53] [INFO ] Time to serialize properties into /tmp/LTL15296793045664356542.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17574034609460419886.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17439198827794955576.hoa' '-atoms' '/tmp/LTL15296793045664356542.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL15296793045664356542.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17439198827794955576.hoa
Detected timeout of ITS tools.
[2023-03-09 22:43:09] [INFO ] Flatten gal took : 364 ms
[2023-03-09 22:43:09] [INFO ] Flatten gal took : 314 ms
[2023-03-09 22:43:09] [INFO ] Time to serialize gal into /tmp/LTL13240967517585908554.gal : 56 ms
[2023-03-09 22:43:09] [INFO ] Time to serialize properties into /tmp/LTL3214249800938772853.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13240967517585908554.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3214249800938772853.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F((("(cAMP__24_8_<1)")||(G("(cAMP__6_8_>=1)")))||(("(cAMP__21_6_<1)")&&(X("(cAMP__21_6_<1)")))))))
Formula 0 simplified : G(F!"(cAMP__6_8_>=1)" & FG(!"(cAMP__24_8_<1)" & (!"(cAMP__21_6_<1)" | X!"(cAMP__21_6_<1)")))
Detected timeout of ITS tools.
[2023-03-09 22:43:25] [INFO ] Flatten gal took : 334 ms
[2023-03-09 22:43:25] [INFO ] Applying decomposition
[2023-03-09 22:43:25] [INFO ] Flatten gal took : 352 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph14178258905490296098.txt' '-o' '/tmp/graph14178258905490296098.bin' '-w' '/tmp/graph14178258905490296098.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph14178258905490296098.bin' '-l' '-1' '-v' '-w' '/tmp/graph14178258905490296098.weights' '-q' '0' '-e' '0.001'
[2023-03-09 22:43:26] [INFO ] Decomposing Gal with order
[2023-03-09 22:43:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-09 22:43:27] [INFO ] Removed a total of 14052 redundant transitions.
[2023-03-09 22:43:27] [INFO ] Flatten gal took : 679 ms
[2023-03-09 22:43:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 110 labels/synchronizations in 115 ms.
[2023-03-09 22:43:28] [INFO ] Time to serialize gal into /tmp/LTL12160758966865634816.gal : 81 ms
[2023-03-09 22:43:28] [INFO ] Time to serialize properties into /tmp/LTL10859625532496367673.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12160758966865634816.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10859625532496367673.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((G(F((("(i7.i0.u149.cAMP__24_8_<1)")||(G("(i15.i2.u351.cAMP__6_8_>=1)")))||(("(i1.i1.u91.cAMP__21_6_<1)")&&(X("(i1.i1.u91.cAMP__21_6...167
Formula 0 simplified : G(F!"(i15.i2.u351.cAMP__6_8_>=1)" & FG(!"(i7.i0.u149.cAMP__24_8_<1)" & (!"(i1.i1.u91.cAMP__21_6_<1)" | X!"(i1.i1.u91.cAMP__21_6_<1)"...158
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5860519647726201476
[2023-03-09 22:43:43] [INFO ] Built C files in 147ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5860519647726201476
Running compilation step : cd /tmp/ltsmin5860519647726201476;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin5860519647726201476;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin5860519647726201476;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property Diffusion2D-PT-D50N100-LTLFireability-10 finished in 209583 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
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 498 ms. Remains 2500 /2500 variables (removed 0) and now considering 19404/19404 (removed 0) transitions.
[2023-03-09 22:43:46] [INFO ] Invariant cache hit.
[2023-03-09 22:43:47] [INFO ] Implicit Places using invariants in 374 ms returned []
Implicit Place search using SMT only with invariants took 375 ms to find 0 implicit places.
[2023-03-09 22:43:47] [INFO ] Invariant cache hit.
[2023-03-09 22:44:05] [INFO ] Dead Transitions using invariants and state equation in 18145 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19019 ms. Remains : 2500/2500 places, 19404/19404 transitions.
Stuttering acceptance computed with spot in 82 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Diffusion2D-PT-D50N100-LTLFireability-11 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:(LT s1447 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 7343 steps with 0 reset in 261 ms.
FORMULA Diffusion2D-PT-D50N100-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D50N100-LTLFireability-11 finished in 19404 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
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 7 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 32 ms. Remains 2 /2500 variables (removed 2498) and now considering 3/19404 (removed 19401) transitions.
// Phase 1: matrix 3 rows 2 cols
[2023-03-09 22:44:05] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-09 22:44:05] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-09 22:44:05] [INFO ] Invariant cache hit.
[2023-03-09 22:44:05] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2023-03-09 22:44:05] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 22:44:05] [INFO ] Invariant cache hit.
[2023-03-09 22:44:05] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/2500 places, 3/19404 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 136 ms. Remains : 2/2500 places, 3/19404 transitions.
Stuttering acceptance computed with spot in 115 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Diffusion2D-PT-D50N100-LTLFireability-13 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:(GEQ 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 0 steps with 0 reset in 0 ms.
FORMULA Diffusion2D-PT-D50N100-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D50N100-LTLFireability-13 finished in 274 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U p1))'
Support contains 2 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 19404/19404 transitions.
Graph (trivial) has 19372 edges and 2500 vertex of which 2498 / 2500 are part of one of the 1 SCC in 10 ms
Free SCC test removed 2497 places
Ensure Unique test removed 19399 transitions
Reduce isomorphic transitions removed 19399 transitions.
Applied a total of 1 rules in 34 ms. Remains 3 /2500 variables (removed 2497) and now considering 5/19404 (removed 19399) transitions.
// Phase 1: matrix 5 rows 3 cols
[2023-03-09 22:44:06] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-09 22:44:06] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-09 22:44:06] [INFO ] Invariant cache hit.
[2023-03-09 22:44:06] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
[2023-03-09 22:44:06] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 22:44:06] [INFO ] Invariant cache hit.
[2023-03-09 22:44:06] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3/2500 places, 5/19404 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 135 ms. Remains : 3/2500 places, 5/19404 transitions.
Stuttering acceptance computed with spot in 137 ms :[(NOT p1), true, (NOT p0)]
Running random walk in product with property : Diffusion2D-PT-D50N100-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(GEQ s1 1), 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, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA Diffusion2D-PT-D50N100-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D50N100-LTLFireability-14 finished in 301 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F((p0||G(p1)))&&F(p2))))'
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 15 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 36 ms. Remains 4 /2500 variables (removed 2496) and now considering 7/19404 (removed 19397) transitions.
// Phase 1: matrix 7 rows 4 cols
[2023-03-09 22:44:06] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-09 22:44:06] [INFO ] Implicit Places using invariants in 42 ms returned []
[2023-03-09 22:44:06] [INFO ] Invariant cache hit.
[2023-03-09 22:44:06] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
[2023-03-09 22:44:06] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 22:44:06] [INFO ] Invariant cache hit.
[2023-03-09 22:44:06] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/2500 places, 7/19404 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 158 ms. Remains : 4/2500 places, 7/19404 transitions.
Stuttering acceptance computed with spot in 136 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (NOT p2)]
Running random walk in product with property : Diffusion2D-PT-D50N100-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GEQ s0 1), p1:(GEQ s2 1), p2:(GEQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA Diffusion2D-PT-D50N100-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D50N100-LTLFireability-15 finished in 329 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(p0)&&(G(p1)||F(((X(p2)&&G(p0))||G(p2))))))))'
Found a Shortening insensitive property : Diffusion2D-PT-D50N100-LTLFireability-04
Stuttering acceptance computed with spot in 698 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 3 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LI_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 8 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 30 ms. Remains 4 /2500 variables (removed 2496) and now considering 7/19404 (removed 19397) transitions.
[2023-03-09 22:44:07] [INFO ] Invariant cache hit.
[2023-03-09 22:44:07] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-09 22:44:07] [INFO ] Invariant cache hit.
[2023-03-09 22:44:07] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
[2023-03-09 22:44:07] [INFO ] Invariant cache hit.
[2023-03-09 22:44:08] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 4/2500 places, 7/19404 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 132 ms. Remains : 4/2500 places, 7/19404 transitions.
Running random walk in product with property : Diffusion2D-PT-D50N100-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 5}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 6}, { cond=(AND p1 p0), acceptance={} source=1 dest: 7}, { cond=(AND p1 p0), acceptance={} source=1 dest: 8}], [{ cond=(NOT p0), acceptance={0, 1, 2} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p1) p2 (NOT p0)), acceptance={0, 2} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0, 1, 2} source=3 dest: 3}, { cond=(AND (NOT p1) p2 p0), acceptance={0, 2} source=3 dest: 4}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0, 1, 2} source=3 dest: 4}, { cond=(AND (NOT p1) p2 p0), acceptance={0} source=3 dest: 5}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0, 1} source=3 dest: 5}, { cond=(AND p1 p2 (NOT p0)), acceptance={2} source=3 dest: 6}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={1, 2} source=3 dest: 6}, { cond=(AND p1 p2 p0), acceptance={2} source=3 dest: 7}, { cond=(AND p1 (NOT p2) p0), acceptance={1, 2} source=3 dest: 7}, { cond=(AND p1 p2 p0), acceptance={} source=3 dest: 8}, { cond=(AND p1 (NOT p2) p0), acceptance={1} source=3 dest: 8}, { cond=(AND p1 p2 p0), acceptance={0} source=3 dest: 9}, { cond=(AND p1 (NOT p2) p0), acceptance={0, 1} source=3 dest: 9}, { cond=(AND p1 p2 (NOT p0)), acceptance={0, 2} source=3 dest: 9}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={0, 1, 2} source=3 dest: 9}, { cond=(AND p1 p2 p0), acceptance={0, 2} source=3 dest: 10}, { cond=(AND p1 (NOT p2) p0), acceptance={0, 1, 2} source=3 dest: 10}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0, 1, 2} source=4 dest: 3}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0, 1, 2} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0, 1} source=4 dest: 5}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={1, 2} source=4 dest: 6}, { cond=(AND p1 (NOT p2) p0), acceptance={1, 2} source=4 dest: 7}, { cond=(AND p1 (NOT p2) p0), acceptance={1} source=4 dest: 8}, { cond=(AND p1 (NOT p2) p0), acceptance={0, 1} source=4 dest: 9}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={0, 1, 2} source=4 dest: 9}, { cond=(AND p1 (NOT p2) p0), acceptance={0, 1, 2} source=4 dest: 10}], [{ cond=(AND (NOT p1) p2 (NOT p0)), acceptance={0, 2} source=5 dest: 3}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0, 1, 2} source=5 dest: 3}, { cond=(AND (NOT p1) p2 p0), acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0, 1} source=5 dest: 5}, { cond=(AND p1 p2 (NOT p0)), acceptance={2} source=5 dest: 6}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={1, 2} source=5 dest: 6}, { cond=(AND p1 p2 p0), acceptance={} source=5 dest: 8}, { cond=(AND p1 (NOT p2) p0), acceptance={1} source=5 dest: 8}, { cond=(AND p1 p2 p0), acceptance={0} source=5 dest: 9}, { cond=(AND p1 (NOT p2) p0), acceptance={0, 1} source=5 dest: 9}, { cond=(AND p1 p2 (NOT p0)), acceptance={0, 2} source=5 dest: 9}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={0, 1, 2} source=5 dest: 9}], [{ cond=(AND (NOT p1) p2 (NOT p0)), acceptance={0, 2} source=6 dest: 3}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0, 1, 2} source=6 dest: 3}, { cond=(AND (NOT p1) p2 p0), acceptance={0, 2} source=6 dest: 4}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0, 1, 2} source=6 dest: 4}, { cond=(AND (NOT p1) p2 p0), acceptance={0} source=6 dest: 5}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0, 1} source=6 dest: 5}, { cond=(AND p1 p2 (NOT p0)), acceptance={2} source=6 dest: 6}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={1, 2} source=6 dest: 6}, { cond=(AND p1 p2 p0), acceptance={2} source=6 dest: 7}, { cond=(AND p1 (NOT p2) p0), acceptance={1, 2} source=6 dest: 7}, { cond=(AND p1 p2 p0), acceptance={} source=6 dest: 8}, { cond=(AND p1 (NOT p2) p0), acceptance={1} source=6 dest: 8}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0, 1, 2} source=7 dest: 3}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0, 1, 2} source=7 dest: 4}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0, 1} source=7 dest: 5}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={1, 2} source=7 dest: 6}, { cond=(AND p1 (NOT p2) p0), acceptance={1, 2} source=7 dest: 7}, { cond=(AND p1 (NOT p2) p0), acceptance={1} source=7 dest: 8}], [{ cond=(AND (NOT p1) p2 (NOT p0)), acceptance={0, 2} source=8 dest: 3}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0, 1, 2} source=8 dest: 3}, { cond=(AND (NOT p1) p2 p0), acceptance={0} source=8 dest: 5}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0, 1} source=8 dest: 5}, { cond=(AND p1 p2 (NOT p0)), acceptance={2} source=8 dest: 6}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={1, 2} source=8 dest: 6}, { cond=(AND p1 p2 p0), acceptance={} source=8 dest: 8}, { cond=(AND p1 (NOT p2) p0), acceptance={1} source=8 dest: 8}], [{ cond=(AND (NOT p1) p2 (NOT p0)), acceptance={0, 2} source=9 dest: 3}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0, 1, 2} source=9 dest: 3}, { cond=(AND p1 p2 (NOT p0)), acceptance={2} source=9 dest: 6}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={1, 2} source=9 dest: 6}, { cond=(AND p1 p2 (NOT p0)), acceptance={0, 2} source=9 dest: 9}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={0, 1, 2} source=9 dest: 9}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0, 1, 2} source=10 dest: 3}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={1, 2} source=10 dest: 6}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={0, 1, 2} source=10 dest: 9}]], initial=0, aps=[p1:(LT s0 1), p0:(LT s2 1), p2:(LT s1 1)], nbAcceptance=3, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
Treatment of property Diffusion2D-PT-D50N100-LTLFireability-04 finished in 1309 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)||(p2&&X(p2))))))'
Found a Shortening insensitive property : Diffusion2D-PT-D50N100-LTLFireability-10
Stuttering acceptance computed with spot in 164 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Support contains 3 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 2500/2500 places, 19404/19404 transitions.
Graph (trivial) has 19356 edges and 2500 vertex of which 2497 / 2500 are part of one of the 1 SCC in 7 ms
Free SCC test removed 2496 places
Ensure Unique test removed 19397 transitions
Reduce isomorphic transitions removed 19397 transitions.
Applied a total of 1 rules in 29 ms. Remains 4 /2500 variables (removed 2496) and now considering 7/19404 (removed 19397) transitions.
[2023-03-09 22:44:08] [INFO ] Invariant cache hit.
[2023-03-09 22:44:08] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-09 22:44:08] [INFO ] Invariant cache hit.
[2023-03-09 22:44:08] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2023-03-09 22:44:08] [INFO ] Invariant cache hit.
[2023-03-09 22:44:08] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 4/2500 places, 7/19404 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 115 ms. Remains : 4/2500 places, 7/19404 transitions.
Running random walk in product with property : Diffusion2D-PT-D50N100-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=0 dest: 2}], [{ cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={0} source=1 dest: 2}], [{ cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 1}]], initial=0, aps=[p1:(GEQ s2 1), p0:(LT s1 1), p2:(LT s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 0 ms.
Treatment of property Diffusion2D-PT-D50N100-LTLFireability-10 finished in 459 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
[2023-03-09 22:44:08] [INFO ] Flatten gal took : 460 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin853277113022626203
[2023-03-09 22:44:09] [INFO ] Too many transitions (19404) to apply POR reductions. Disabling POR matrices.
[2023-03-09 22:44:09] [INFO ] Built C files in 189ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin853277113022626203
Running compilation step : cd /tmp/ltsmin853277113022626203;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2023-03-09 22:44:09] [INFO ] Applying decomposition
[2023-03-09 22:44:09] [INFO ] Flatten gal took : 312 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph6656927171325592428.txt' '-o' '/tmp/graph6656927171325592428.bin' '-w' '/tmp/graph6656927171325592428.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph6656927171325592428.bin' '-l' '-1' '-v' '-w' '/tmp/graph6656927171325592428.weights' '-q' '0' '-e' '0.001'
[2023-03-09 22:44:10] [INFO ] Decomposing Gal with order
[2023-03-09 22:44:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-09 22:44:11] [INFO ] Removed a total of 13566 redundant transitions.
[2023-03-09 22:44:11] [INFO ] Flatten gal took : 656 ms
[2023-03-09 22:44:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 130 labels/synchronizations in 95 ms.
[2023-03-09 22:44:12] [INFO ] Time to serialize gal into /tmp/LTLFireability9065147978181162584.gal : 76 ms
[2023-03-09 22:44:12] [INFO ] Time to serialize properties into /tmp/LTLFireability5604742844404384183.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability9065147978181162584.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability5604742844404384183.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 2 LTL properties
Checking formula 0 : !((X(F((X("(i14.i1.u226.cAMP__37_32_<1)"))&&((G("(i1.i1.u50.cAMP__15_8_<1)"))||(F(((X("(i7.i2.u143.cAMP__27_9_<1)"))&&(G("(i14.i1.u226...217
Formula 0 simplified : XG(X!"(i14.i1.u226.cAMP__37_32_<1)" | (F!"(i1.i1.u50.cAMP__15_8_<1)" & G(F!"(i7.i2.u143.cAMP__27_9_<1)" & (X!"(i7.i2.u143.cAMP__27_9...199
Compilation finished in 287022 ms.
Running link step : cd /tmp/ltsmin853277113022626203;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 188 ms.
Running LTSmin : cd /tmp/ltsmin853277113022626203;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>((X((LTLAPp0==true))&&([]((LTLAPp1==true))||<>(((X((LTLAPp2==true))&&[]((LTLAPp0==true)))||[]((LTLAPp2==true))))))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.001: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.000: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.017: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.017: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.017: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.017: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.019: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.019: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.392: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.393: LTL layer: formula: X(<>((X((LTLAPp0==true))&&([]((LTLAPp1==true))||<>(((X((LTLAPp2==true))&&[]((LTLAPp0==true)))||[]((LTLAPp2==true))))))))
pins2lts-mc-linux64( 3/ 8), 0.395: "X(<>((X((LTLAPp0==true))&&([]((LTLAPp1==true))||<>(((X((LTLAPp2==true))&&[]((LTLAPp0==true)))||[]((LTLAPp2==true))))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 3/ 8), 0.431: Using Spin LTL semantics
pins2lts-mc-linux64( 2/ 8), 0.492: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.514: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.532: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.534: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.536: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.538: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.541: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 14.654: There are 19411 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 14.654: State length is 2501, there are 19527 groups
pins2lts-mc-linux64( 0/ 8), 14.654: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 14.654: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 14.654: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 14.654: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 2/ 8), 16.937: [Blue] ~120 levels ~960 states ~23296 transitions
pins2lts-mc-linux64( 2/ 8), 19.191: [Blue] ~240 levels ~1920 states ~48064 transitions
pins2lts-mc-linux64( 4/ 8), 23.527: [Blue] ~480 levels ~3840 states ~83480 transitions
pins2lts-mc-linux64( 2/ 8), 31.669: [Blue] ~960 levels ~7680 states ~198208 transitions
pins2lts-mc-linux64( 2/ 8), 47.497: [Blue] ~1920 levels ~15360 states ~400000 transitions
pins2lts-mc-linux64( 2/ 8), 78.752: [Blue] ~3840 levels ~30720 states ~805504 transitions
pins2lts-mc-linux64( 2/ 8), 139.831: [Blue] ~7680 levels ~61440 states ~1664512 transitions
pins2lts-mc-linux64( 2/ 8), 264.369: [Blue] ~15360 levels ~122880 states ~3995264 transitions
pins2lts-mc-linux64( 2/ 8), 512.539: [Blue] ~30720 levels ~245760 states ~8670080 transitions
pins2lts-mc-linux64( 2/ 8), 790.391: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 795.599:
pins2lts-mc-linux64( 0/ 8), 795.599: Explored 363099 states 31868468 transitions, fanout: 87.768
pins2lts-mc-linux64( 0/ 8), 795.599: Total exploration time 780.930 sec (776.420 sec minimum, 778.705 sec on average)
pins2lts-mc-linux64( 0/ 8), 795.599: States per second: 465, Transitions per second: 40808
pins2lts-mc-linux64( 0/ 8), 795.599:
pins2lts-mc-linux64( 0/ 8), 795.599: State space has 27379957 states, 2 are accepting
pins2lts-mc-linux64( 0/ 8), 795.599: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 795.599: blue states: 363099 (1.33%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 795.599: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 795.599: all-red states: 42 (0.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 795.599:
pins2lts-mc-linux64( 0/ 8), 795.599: Total memory used for local state coloring: 5.5MB
pins2lts-mc-linux64( 0/ 8), 795.599:
pins2lts-mc-linux64( 0/ 8), 795.599: Queue width: 8B, total height: 363057, memory: 2.77MB
pins2lts-mc-linux64( 0/ 8), 795.599: Tree memory: 464.9MB, 17.8 B/state, compr.: 0.2%
pins2lts-mc-linux64( 0/ 8), 795.599: Tree fill ratio (roots/leafs): 20.0%/100.0%
pins2lts-mc-linux64( 0/ 8), 795.599: Stored 20643 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 795.599: Total memory used for chunk indexing: 1MB
pins2lts-mc-linux64( 0/ 8), 795.599: Est. total memory use: 468.7MB (~1027.8MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin853277113022626203;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>((X((LTLAPp0==true))&&([]((LTLAPp1==true))||<>(((X((LTLAPp2==true))&&[]((LTLAPp0==true)))||[]((LTLAPp2==true))))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin853277113022626203;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>((X((LTLAPp0==true))&&([]((LTLAPp1==true))||<>(((X((LTLAPp2==true))&&[]((LTLAPp0==true)))||[]((LTLAPp2==true))))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2023-03-09 23:07:31] [INFO ] Flatten gal took : 349 ms
[2023-03-09 23:07:31] [INFO ] Time to serialize gal into /tmp/LTLFireability13906276297753262000.gal : 67 ms
[2023-03-09 23:07:31] [INFO ] Time to serialize properties into /tmp/LTLFireability1288035725553404518.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability13906276297753262000.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability1288035725553404518.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 2 LTL properties
Checking formula 0 : !((X(F((X("(cAMP__37_32_<1)"))&&((G("(cAMP__15_8_<1)"))||(F(((X("(cAMP__27_9_<1)"))&&(G("(cAMP__37_32_<1)")))||(G("(cAMP__27_9_<1)")))...161
Formula 0 simplified : XG(X!"(cAMP__37_32_<1)" | (F!"(cAMP__15_8_<1)" & G(F!"(cAMP__27_9_<1)" & (X!"(cAMP__27_9_<1)" | F!"(cAMP__37_32_<1)"))))
Detected timeout of ITS tools.
[2023-03-09 23:30:51] [INFO ] Flatten gal took : 348 ms
[2023-03-09 23:30:52] [INFO ] Input system was already deterministic with 19404 transitions.
[2023-03-09 23:30:52] [INFO ] Transformed 2500 places.
[2023-03-09 23:30:52] [INFO ] Transformed 19404 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2023-03-09 23:30:56] [INFO ] Time to serialize gal into /tmp/LTLFireability7722362375759656712.gal : 49 ms
[2023-03-09 23:30:56] [INFO ] Time to serialize properties into /tmp/LTLFireability8861479984772210546.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability7722362375759656712.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability8861479984772210546.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...342
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(F((X("(cAMP__37_32_<1)"))&&((G("(cAMP__15_8_<1)"))||(F(((X("(cAMP__27_9_<1)"))&&(G("(cAMP__37_32_<1)")))||(G("(cAMP__27_9_<1)")))...161
Formula 0 simplified : XG(X!"(cAMP__37_32_<1)" | (F!"(cAMP__15_8_<1)" & G(F!"(cAMP__27_9_<1)" & (X!"(cAMP__27_9_<1)" | F!"(cAMP__37_32_<1)"))))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 12765820 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16024472 kB
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Diffusion2D-PT-D50N100"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is Diffusion2D-PT-D50N100, 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 r133-smll-167819410600268"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Diffusion2D-PT-D50N100.tgz
mv Diffusion2D-PT-D50N100 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 ;