Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r114-smll-165264477400236.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is HexagonalGrid-PT-316, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r114-smll-165264477400236
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 532K
-rw-r--r-- 1 mcc users 7.4K Apr 29 11:30 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Apr 29 11:30 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Apr 29 11:29 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Apr 29 11:29 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.5K May 9 08:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 9 08:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 08:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 08:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 08:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 08:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rwxr-xr-x 1 mcc users 294K May 10 09:34 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 HexagonalGrid-PT-316-LTLFireability-00
FORMULA_NAME HexagonalGrid-PT-316-LTLFireability-01
FORMULA_NAME HexagonalGrid-PT-316-LTLFireability-02
FORMULA_NAME HexagonalGrid-PT-316-LTLFireability-03
FORMULA_NAME HexagonalGrid-PT-316-LTLFireability-04
FORMULA_NAME HexagonalGrid-PT-316-LTLFireability-05
FORMULA_NAME HexagonalGrid-PT-316-LTLFireability-06
FORMULA_NAME HexagonalGrid-PT-316-LTLFireability-07
FORMULA_NAME HexagonalGrid-PT-316-LTLFireability-08
FORMULA_NAME HexagonalGrid-PT-316-LTLFireability-09
FORMULA_NAME HexagonalGrid-PT-316-LTLFireability-10
FORMULA_NAME HexagonalGrid-PT-316-LTLFireability-11
FORMULA_NAME HexagonalGrid-PT-316-LTLFireability-12
FORMULA_NAME HexagonalGrid-PT-316-LTLFireability-13
FORMULA_NAME HexagonalGrid-PT-316-LTLFireability-14
FORMULA_NAME HexagonalGrid-PT-316-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652710628863

Running Version 202205111006
[2022-05-16 14:17:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-16 14:17:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 14:17:11] [INFO ] Load time of PNML (sax parser for PT used): 320 ms
[2022-05-16 14:17:11] [INFO ] Transformed 421 places.
[2022-05-16 14:17:11] [INFO ] Transformed 714 transitions.
[2022-05-16 14:17:11] [INFO ] Parsed PT model containing 421 places and 714 transitions in 567 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 32 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA HexagonalGrid-PT-316-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HexagonalGrid-PT-316-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 47 out of 421 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 421/421 places, 714/714 transitions.
Applied a total of 0 rules in 109 ms. Remains 421 /421 variables (removed 0) and now considering 714/714 (removed 0) transitions.
// Phase 1: matrix 714 rows 421 cols
[2022-05-16 14:17:12] [INFO ] Computed 164 place invariants in 79 ms
[2022-05-16 14:17:13] [INFO ] Implicit Places using invariants in 1168 ms returned []
// Phase 1: matrix 714 rows 421 cols
[2022-05-16 14:17:13] [INFO ] Computed 164 place invariants in 32 ms
[2022-05-16 14:17:14] [INFO ] Implicit Places using invariants and state equation in 1268 ms returned []
Implicit Place search using SMT with State Equation took 2504 ms to find 0 implicit places.
// Phase 1: matrix 714 rows 421 cols
[2022-05-16 14:17:14] [INFO ] Computed 164 place invariants in 22 ms
[2022-05-16 14:17:15] [INFO ] Dead Transitions using invariants and state equation in 1058 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 421/421 places, 714/714 transitions.
Support contains 47 out of 421 places after structural reductions.
[2022-05-16 14:17:16] [INFO ] Flatten gal took : 142 ms
[2022-05-16 14:17:16] [INFO ] Flatten gal took : 117 ms
[2022-05-16 14:17:16] [INFO ] Input system was already deterministic with 714 transitions.
Finished random walk after 332 steps, including 0 resets, run visited all 29 properties in 160 ms. (steps per millisecond=2 )
FORMULA HexagonalGrid-PT-316-LTLFireability-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F((X(p1)&&p0))||G((G(p2)||X(X(p3))))))'
Support contains 6 out of 421 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 421/421 places, 714/714 transitions.
Applied a total of 0 rules in 32 ms. Remains 421 /421 variables (removed 0) and now considering 714/714 (removed 0) transitions.
// Phase 1: matrix 714 rows 421 cols
[2022-05-16 14:17:17] [INFO ] Computed 164 place invariants in 8 ms
[2022-05-16 14:17:18] [INFO ] Implicit Places using invariants in 733 ms returned []
// Phase 1: matrix 714 rows 421 cols
[2022-05-16 14:17:18] [INFO ] Computed 164 place invariants in 12 ms
[2022-05-16 14:17:19] [INFO ] Implicit Places using invariants and state equation in 1175 ms returned []
Implicit Place search using SMT with State Equation took 1915 ms to find 0 implicit places.
// Phase 1: matrix 714 rows 421 cols
[2022-05-16 14:17:19] [INFO ] Computed 164 place invariants in 7 ms
[2022-05-16 14:17:20] [INFO ] Dead Transitions using invariants and state equation in 892 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 421/421 places, 714/714 transitions.
Stuttering acceptance computed with spot in 1074 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3))), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3))), (AND (NOT p1) (NOT p2) (NOT p3)), (OR (NOT p0) (NOT p1)), (NOT p1), (OR (AND (NOT p0) (NOT p2) p3) (AND (NOT p1) (NOT p2) p3)), (AND (NOT p1) (NOT p2) p3)]
Running random walk in product with property : HexagonalGrid-PT-316-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 4}, { cond=(AND p0 p2), acceptance={} source=0 dest: 5}], [{ cond=(NOT p0), acceptance={} source=1 dest: 6}, { cond=p0, acceptance={} source=1 dest: 7}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 6}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 7}, { cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 8}, { cond=(AND p0 p2), acceptance={} source=2 dest: 9}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 6}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 7}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=5 dest: 6}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=5 dest: 7}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=5 dest: 8}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=5 dest: 9}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=6 dest: 10}, { cond=(AND p0 (NOT p3)), acceptance={} source=6 dest: 11}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p3)), acceptance={} source=7 dest: 10}, { cond=(AND p0 (NOT p1) (NOT p3)), acceptance={} source=7 dest: 11}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p3)), acceptance={} source=8 dest: 10}, { cond=(AND p0 (NOT p2) (NOT p3)), acceptance={} source=8 dest: 11}, { cond=(AND (NOT p0) p2 (NOT p3)), acceptance={} source=8 dest: 12}, { cond=(AND p0 p2 (NOT p3)), acceptance={} source=8 dest: 13}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1) (NOT p3)), acceptance={} source=9 dest: 10}, { cond=(AND p0 (NOT p2) (NOT p1) (NOT p3)), acceptance={} source=9 dest: 11}, { cond=(AND (NOT p0) p2 (NOT p1) (NOT p3)), acceptance={} source=9 dest: 12}, { cond=(AND p0 p2 (NOT p1) (NOT p3)), acceptance={} source=9 dest: 13}], [{ cond=(NOT p0), acceptance={0} source=10 dest: 10}, { cond=p0, acceptance={0} source=10 dest: 11}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=11 dest: 10}, { cond=(AND p0 (NOT p1)), acceptance={0} source=11 dest: 11}], [{ cond=(AND (NOT p0) (NOT p2) p3), acceptance={} source=12 dest: 10}, { cond=(AND p0 (NOT p2) p3), acceptance={} source=12 dest: 11}, { cond=(AND (NOT p0) p2 p3), acceptance={} source=12 dest: 12}, { cond=(AND p0 p2 p3), acceptance={} source=12 dest: 13}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1) p3), acceptance={} source=13 dest: 10}, { cond=(AND p0 (NOT p2) (NOT p1) p3), acceptance={} source=13 dest: 11}, { cond=(AND (NOT p0) p2 (NOT p1) p3), acceptance={} source=13 dest: 12}, { cond=(AND p0 p2 (NOT p1) p3), acceptance={} source=13 dest: 13}]], initial=0, aps=[p0:(AND (GEQ s128 1) (GEQ s309 1)), p2:(AND (GEQ s47 1) (GEQ s396 1)), p1:(AND (GEQ s128 1) (GEQ s309 1)), p3:(AND (GEQ s72 1) (GEQ s223 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 24270 reset in 2978 ms.
Product exploration explored 100000 steps with 24291 reset in 3090 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1) p3), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p2 (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1) (NOT p3))))), (X (X (NOT (AND p0 (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) (NOT p3))))), (X (X (NOT (AND p0 p2 (NOT p1) (NOT p3))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p2 (NOT p1)))))]
False Knowledge obtained : [(X (AND (NOT p0) p2)), (X (NOT (AND (NOT p0) p2))), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT p0)), (X p0), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 p2)), (X (NOT (AND p0 p2))), (X (AND (NOT p0) p2 (NOT p1))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (AND (NOT p0) (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p0) (NOT p2) (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1) (NOT p3))))), (X (X (AND (NOT p0) (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), (X (X (AND p0 (NOT p3)))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p0) (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3))))), (X (X (AND (NOT p0) p2 (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1) (NOT p3))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p0) p2 (NOT p3)))), (X (X (NOT (AND (NOT p0) p2 (NOT p3))))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p2 (NOT p3)))), (X (X (NOT (AND p0 p2 (NOT p3))))), (X (X (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1)))))]
Knowledge based reduction with 12 factoid took 2706 ms. Reduced automaton from 14 states, 48 edges and 4 AP to 14 states, 48 edges and 4 AP.
Stuttering acceptance computed with spot in 818 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3))), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3))), (AND (NOT p1) (NOT p2) (NOT p3)), (OR (NOT p0) (NOT p1)), (NOT p1), (OR (AND (NOT p0) (NOT p2) p3) (AND (NOT p1) (NOT p2) p3)), (AND (NOT p1) (NOT p2) p3)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 871 ms. (steps per millisecond=11 ) properties (out of 31) seen :23
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 714 rows 421 cols
[2022-05-16 14:17:32] [INFO ] Computed 164 place invariants in 4 ms
[2022-05-16 14:17:32] [INFO ] After 107ms SMT Verify possible using all constraints in real domain returned unsat :8 sat :0
Fused 8 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Found 8 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1) p3), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p2 (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1) (NOT p3))))), (X (X (NOT (AND p0 (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) (NOT p3))))), (X (X (NOT (AND p0 p2 (NOT p1) (NOT p3))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p2 (NOT p1))))), (G (NOT (AND p0 (NOT p1) (NOT p2) p3))), (G (NOT (AND p0 (NOT p1) p2 (NOT p3)))), (G (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3)))), (G (NOT (AND p0 (NOT p1)))), (G (NOT (AND p0 (NOT p1) (NOT p2)))), (G (NOT (AND p0 (NOT p1) (NOT p3)))), (G (NOT (AND p0 (NOT p1) p2))), (G (NOT (AND p0 (NOT p1) p2 p3)))]
False Knowledge obtained : [(X (AND (NOT p0) p2)), (X (NOT (AND (NOT p0) p2))), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT p0)), (X p0), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 p2)), (X (NOT (AND p0 p2))), (X (AND (NOT p0) p2 (NOT p1))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (AND (NOT p0) (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p0) (NOT p2) (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1) (NOT p3))))), (X (X (AND (NOT p0) (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), (X (X (AND p0 (NOT p3)))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p0) (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3))))), (X (X (AND (NOT p0) p2 (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1) (NOT p3))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p0) p2 (NOT p3)))), (X (X (NOT (AND (NOT p0) p2 (NOT p3))))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p2 (NOT p3)))), (X (X (NOT (AND p0 p2 (NOT p3))))), (X (X (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (F (AND p0 p2 p3)), (F (AND p0 p2)), (F (NOT (AND (NOT p0) p2 p3))), (F (AND p0 (NOT p2))), (F (AND p0 (NOT p2) p3)), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND (NOT p0) (NOT p2) p3)), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F (NOT (AND (NOT p0) (NOT p1) p2 p3))), (F (NOT (AND (NOT p0) p2))), (F (AND (NOT p0) (NOT p1) (NOT p2) p3)), (F (AND (NOT p0) (NOT p2))), (F (AND (NOT p0) (NOT p1) p2 (NOT p3))), (F (NOT (AND (NOT p0) (NOT p1) p2))), (F (AND (NOT p0) (NOT p2) (NOT p3))), (F (AND (NOT p0) (NOT p1) (NOT p3))), (F (AND p0 (NOT p3))), (F (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3))), (F (AND p0 p2 (NOT p3))), (F (AND (NOT p0) p2 (NOT p3))), (F (AND p0 (NOT p2) (NOT p3))), (F (AND (NOT p0) (NOT p3)))]
Knowledge based reduction with 20 factoid took 4432 ms. Reduced automaton from 14 states, 48 edges and 4 AP to 14 states, 36 edges and 4 AP.
Stuttering acceptance computed with spot in 958 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3))), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3))), (AND (NOT p1) (NOT p2) (NOT p3)), (OR (NOT p0) (NOT p1)), (NOT p1), (OR (AND (NOT p0) (NOT p2) p3) (AND (NOT p1) (NOT p2) p3)), (AND (NOT p1) (NOT p2) p3)]
Stuttering acceptance computed with spot in 786 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3))), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3))), (AND (NOT p1) (NOT p2) (NOT p3)), (OR (NOT p0) (NOT p1)), (NOT p1), (OR (AND (NOT p0) (NOT p2) p3) (AND (NOT p1) (NOT p2) p3)), (AND (NOT p1) (NOT p2) p3)]
Support contains 6 out of 421 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 421/421 places, 714/714 transitions.
Applied a total of 0 rules in 30 ms. Remains 421 /421 variables (removed 0) and now considering 714/714 (removed 0) transitions.
// Phase 1: matrix 714 rows 421 cols
[2022-05-16 14:17:38] [INFO ] Computed 164 place invariants in 7 ms
[2022-05-16 14:17:39] [INFO ] Implicit Places using invariants in 792 ms returned []
// Phase 1: matrix 714 rows 421 cols
[2022-05-16 14:17:39] [INFO ] Computed 164 place invariants in 7 ms
[2022-05-16 14:17:40] [INFO ] Implicit Places using invariants and state equation in 1237 ms returned []
Implicit Place search using SMT with State Equation took 2041 ms to find 0 implicit places.
// Phase 1: matrix 714 rows 421 cols
[2022-05-16 14:17:41] [INFO ] Computed 164 place invariants in 10 ms
[2022-05-16 14:17:41] [INFO ] Dead Transitions using invariants and state equation in 953 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 421/421 places, 714/714 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1) p3), (X (NOT (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2) (NOT p3)))))]
False Knowledge obtained : [(X (AND (NOT p0) p2)), (X (NOT (AND (NOT p0) p2))), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT p1)), (X p1), (X (NOT p0)), (X p0), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) p2))), (X (AND p0 p2)), (X (NOT (AND p0 p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p3)))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (AND (NOT p1) (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (AND (NOT p0) (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p0) p2 (NOT p3)))), (X (X (NOT (AND (NOT p0) p2 (NOT p3))))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND p0 p2 (NOT p3)))), (X (X (NOT (AND p0 p2 (NOT p3))))), (X (X (AND (NOT p1) p2 (NOT p3)))), (X (X (NOT (AND (NOT p1) p2 (NOT p3)))))]
Knowledge based reduction with 3 factoid took 2076 ms. Reduced automaton from 14 states, 36 edges and 4 AP to 14 states, 36 edges and 4 AP.
Stuttering acceptance computed with spot in 781 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3))), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3))), (AND (NOT p1) (NOT p2) (NOT p3)), (OR (NOT p0) (NOT p1)), (NOT p1), (OR (AND (NOT p0) (NOT p2) p3) (AND (NOT p1) (NOT p2) p3)), (AND (NOT p1) (NOT p2) p3)]
Finished random walk after 1098 steps, including 0 resets, run visited all 23 properties in 73 ms. (steps per millisecond=15 )
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1) p3), (X (NOT (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2) (NOT p3)))))]
False Knowledge obtained : [(X (AND (NOT p0) p2)), (X (NOT (AND (NOT p0) p2))), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT p1)), (X p1), (X (NOT p0)), (X p0), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) p2))), (X (AND p0 p2)), (X (NOT (AND p0 p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p3)))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (AND (NOT p1) (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (AND (NOT p0) (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p0) p2 (NOT p3)))), (X (X (NOT (AND (NOT p0) p2 (NOT p3))))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND p0 p2 (NOT p3)))), (X (X (NOT (AND p0 p2 (NOT p3))))), (X (X (AND (NOT p1) p2 (NOT p3)))), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (F (AND (NOT p0) (NOT p3))), (F (NOT (AND p2 (NOT p1)))), (F (AND p0 (NOT p3))), (F (AND (NOT p2) (NOT p3) (NOT p1))), (F (AND p0 p2)), (F (AND p0 p2 (NOT p3))), (F (AND p0 (NOT p2))), (F (AND (NOT p0) p2 (NOT p3))), (F (AND (NOT p2) (NOT p1))), (F (AND p0 (NOT p2) (NOT p3))), (F p1), (F (NOT (AND (NOT p0) p2 p3))), (F p0), (F (AND p0 (NOT p2) p3)), (F (AND (NOT p0) (NOT p2) p3)), (F (NOT (AND (NOT p0) p2))), (F (AND p2 (NOT p3) (NOT p1))), (F (AND (NOT p0) (NOT p2))), (F (NOT (AND p2 p3 (NOT p1)))), (F (AND (NOT p0) (NOT p2) (NOT p3))), (F (AND (NOT p2) p3 (NOT p1))), (F (AND (NOT p3) (NOT p1))), (F (AND p0 p2 p3))]
Knowledge based reduction with 3 factoid took 2617 ms. Reduced automaton from 14 states, 36 edges and 4 AP to 14 states, 36 edges and 4 AP.
Stuttering acceptance computed with spot in 863 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3))), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3))), (AND (NOT p1) (NOT p2) (NOT p3)), (OR (NOT p0) (NOT p1)), (NOT p1), (OR (AND (NOT p0) (NOT p2) p3) (AND (NOT p1) (NOT p2) p3)), (AND (NOT p1) (NOT p2) p3)]
Stuttering acceptance computed with spot in 767 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3))), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3))), (AND (NOT p1) (NOT p2) (NOT p3)), (OR (NOT p0) (NOT p1)), (NOT p1), (OR (AND (NOT p0) (NOT p2) p3) (AND (NOT p1) (NOT p2) p3)), (AND (NOT p1) (NOT p2) p3)]
Stuttering acceptance computed with spot in 769 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3))), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3))), (AND (NOT p1) (NOT p2) (NOT p3)), (OR (NOT p0) (NOT p1)), (NOT p1), (OR (AND (NOT p0) (NOT p2) p3) (AND (NOT p1) (NOT p2) p3)), (AND (NOT p1) (NOT p2) p3)]
Product exploration explored 100000 steps with 24627 reset in 2351 ms.
Product exploration explored 100000 steps with 24398 reset in 2583 ms.
Built C files in :
/tmp/ltsmin3495932763821372277
[2022-05-16 14:17:55] [INFO ] Built C files in 85ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3495932763821372277
Running compilation step : cd /tmp/ltsmin3495932763821372277;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2526 ms.
Running link step : cd /tmp/ltsmin3495932763821372277;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 68 ms.
Running LTSmin : cd /tmp/ltsmin3495932763821372277;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased17757861972374189434.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 421 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 421/421 places, 714/714 transitions.
Applied a total of 0 rules in 23 ms. Remains 421 /421 variables (removed 0) and now considering 714/714 (removed 0) transitions.
// Phase 1: matrix 714 rows 421 cols
[2022-05-16 14:18:10] [INFO ] Computed 164 place invariants in 5 ms
[2022-05-16 14:18:10] [INFO ] Implicit Places using invariants in 520 ms returned []
// Phase 1: matrix 714 rows 421 cols
[2022-05-16 14:18:11] [INFO ] Computed 164 place invariants in 8 ms
[2022-05-16 14:18:12] [INFO ] Implicit Places using invariants and state equation in 1376 ms returned []
Implicit Place search using SMT with State Equation took 1905 ms to find 0 implicit places.
// Phase 1: matrix 714 rows 421 cols
[2022-05-16 14:18:12] [INFO ] Computed 164 place invariants in 6 ms
[2022-05-16 14:18:13] [INFO ] Dead Transitions using invariants and state equation in 1065 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 421/421 places, 714/714 transitions.
Built C files in :
/tmp/ltsmin8143195796476589660
[2022-05-16 14:18:13] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8143195796476589660
Running compilation step : cd /tmp/ltsmin8143195796476589660;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2421 ms.
Running link step : cd /tmp/ltsmin8143195796476589660;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin8143195796476589660;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15033469567254186099.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-16 14:18:28] [INFO ] Flatten gal took : 61 ms
[2022-05-16 14:18:28] [INFO ] Flatten gal took : 58 ms
[2022-05-16 14:18:28] [INFO ] Time to serialize gal into /tmp/LTL5991918838827947493.gal : 9 ms
[2022-05-16 14:18:28] [INFO ] Time to serialize properties into /tmp/LTL7723142952147802092.ltl : 112 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5991918838827947493.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7723142952147802092.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL5991918...266
Read 1 LTL properties
Checking formula 0 : !(((F(((X("((pbl_4_3>=1)&&(po2_4_2>=1))"))&&("(pbl_4_3>=1)"))&&("(po2_4_2>=1)")))||(G((G("((pb3_3_3>=1)&&(pol3_3_3>=1))"))||(X(X("((pb...188
Formula 0 simplified : !(F("(pbl_4_3>=1)" & "(po2_4_2>=1)" & X"((pbl_4_3>=1)&&(po2_4_2>=1))") | G(G"((pb3_3_3>=1)&&(pol3_3_3>=1))" | XX"((pb4_4_4>=1)&&(pil...168
Detected timeout of ITS tools.
[2022-05-16 14:18:44] [INFO ] Flatten gal took : 56 ms
[2022-05-16 14:18:44] [INFO ] Applying decomposition
[2022-05-16 14:18:44] [INFO ] Flatten gal took : 50 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph11549860028520481326.txt' '-o' '/tmp/graph11549860028520481326.bin' '-w' '/tmp/graph11549860028520481326.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph11549860028520481326.bin' '-l' '-1' '-v' '-w' '/tmp/graph11549860028520481326.weights' '-q' '0' '-e' '0.001'
[2022-05-16 14:18:44] [INFO ] Decomposing Gal with order
[2022-05-16 14:18:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 14:18:44] [INFO ] Removed a total of 912 redundant transitions.
[2022-05-16 14:18:44] [INFO ] Flatten gal took : 196 ms
[2022-05-16 14:18:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 12 ms.
[2022-05-16 14:18:44] [INFO ] Time to serialize gal into /tmp/LTL14919228221309032498.gal : 16 ms
[2022-05-16 14:18:44] [INFO ] Time to serialize properties into /tmp/LTL6141748903520556607.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14919228221309032498.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6141748903520556607.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1491922...246
Read 1 LTL properties
Checking formula 0 : !(((F(((X("((i13.u15.pbl_4_3>=1)&&(i13.u99.po2_4_2>=1))"))&&("(i13.u15.pbl_4_3>=1)"))&&("(i13.u99.po2_4_2>=1)")))||(G((G("((i9.u10.pb3...252
Formula 0 simplified : !(F("(i13.u15.pbl_4_3>=1)" & "(i13.u99.po2_4_2>=1)" & X"((i13.u15.pbl_4_3>=1)&&(i13.u99.po2_4_2>=1))") | G(G"((i9.u10.pb3_3_3>=1)&&(...232
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9073042879230312200
[2022-05-16 14:18:59] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9073042879230312200
Running compilation step : cd /tmp/ltsmin9073042879230312200;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2455 ms.
Running link step : cd /tmp/ltsmin9073042879230312200;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin9073042879230312200;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(<>((X((LTLAPp1==true))&&(LTLAPp0==true)))||[](([]((LTLAPp2==true))||X(X((LTLAPp3==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property HexagonalGrid-PT-316-LTLFireability-00 finished in 117469 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(!(p0 U p1)))&&(G(!p0)||G(X(p2)))))'
Support contains 6 out of 421 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 421/421 places, 714/714 transitions.
Applied a total of 0 rules in 7 ms. Remains 421 /421 variables (removed 0) and now considering 714/714 (removed 0) transitions.
// Phase 1: matrix 714 rows 421 cols
[2022-05-16 14:19:14] [INFO ] Computed 164 place invariants in 5 ms
[2022-05-16 14:19:15] [INFO ] Implicit Places using invariants in 469 ms returned []
// Phase 1: matrix 714 rows 421 cols
[2022-05-16 14:19:15] [INFO ] Computed 164 place invariants in 7 ms
[2022-05-16 14:19:16] [INFO ] Implicit Places using invariants and state equation in 1068 ms returned []
Implicit Place search using SMT with State Equation took 1540 ms to find 0 implicit places.
// Phase 1: matrix 714 rows 421 cols
[2022-05-16 14:19:16] [INFO ] Computed 164 place invariants in 5 ms
[2022-05-16 14:19:17] [INFO ] Dead Transitions using invariants and state equation in 850 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 421/421 places, 714/714 transitions.
Stuttering acceptance computed with spot in 327 ms :[(OR p1 (AND p0 (NOT p2))), p1, (NOT p2), (AND (NOT p2) p0), p1, true, p0]
Running random walk in product with property : HexagonalGrid-PT-316-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=p2, acceptance={} source=2 dest: 2}, { cond=(NOT p2), acceptance={} source=2 dest: 5}], [{ cond=(AND p0 p2), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 6}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}, { cond=p1, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=p0, acceptance={} source=6 dest: 5}, { cond=(NOT p0), acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(AND (GEQ s23 1) (GEQ s372 1)), p2:(AND (GEQ s121 1) (GEQ s178 1)), p1:(AND (GEQ s116 1) (GEQ s297 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA HexagonalGrid-PT-316-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HexagonalGrid-PT-316-LTLFireability-01 finished in 2762 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(((!(G(p2) U p3)||p1)&&p0))))'
Support contains 8 out of 421 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 421/421 places, 714/714 transitions.
Applied a total of 0 rules in 10 ms. Remains 421 /421 variables (removed 0) and now considering 714/714 (removed 0) transitions.
// Phase 1: matrix 714 rows 421 cols
[2022-05-16 14:19:17] [INFO ] Computed 164 place invariants in 6 ms
[2022-05-16 14:19:18] [INFO ] Implicit Places using invariants in 641 ms returned []
// Phase 1: matrix 714 rows 421 cols
[2022-05-16 14:19:18] [INFO ] Computed 164 place invariants in 7 ms
[2022-05-16 14:19:19] [INFO ] Implicit Places using invariants and state equation in 1267 ms returned []
Implicit Place search using SMT with State Equation took 1913 ms to find 0 implicit places.
// Phase 1: matrix 714 rows 421 cols
[2022-05-16 14:19:19] [INFO ] Computed 164 place invariants in 12 ms
[2022-05-16 14:19:20] [INFO ] Dead Transitions using invariants and state equation in 883 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 421/421 places, 714/714 transitions.
Stuttering acceptance computed with spot in 265 ms :[true, p2, (OR (NOT p0) (AND (NOT p1) p3)), (AND p2 p3), (OR (NOT p0) (AND (NOT p1) p3)), (OR (NOT p0) (AND (NOT p1) p3))]
Running random walk in product with property : HexagonalGrid-PT-316-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p2, acceptance={0} source=1 dest: 1}], [{ cond=(OR (NOT p0) (AND (NOT p1) p3)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1) p2 (NOT p3)), acceptance={} source=2 dest: 3}], [{ cond=(AND p2 p3), acceptance={} source=3 dest: 1}, { cond=(AND p2 (NOT p3)), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 2}]], initial=4, aps=[p2:(AND (GEQ s114 1) (GEQ s280 1)), p0:(AND (GEQ s117 1) (GEQ s174 1)), p1:(OR (LT s132 1) (LT s329 1)), p3:(AND (GEQ s129 1) (GEQ s325 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 2 steps with 0 reset in 1 ms.
FORMULA HexagonalGrid-PT-316-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HexagonalGrid-PT-316-LTLFireability-02 finished in 3108 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(G(G((F(p1)||p2))))&&p0)))'
Support contains 6 out of 421 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 421/421 places, 714/714 transitions.
Applied a total of 0 rules in 38 ms. Remains 421 /421 variables (removed 0) and now considering 714/714 (removed 0) transitions.
// Phase 1: matrix 714 rows 421 cols
[2022-05-16 14:19:20] [INFO ] Computed 164 place invariants in 5 ms
[2022-05-16 14:19:21] [INFO ] Implicit Places using invariants in 727 ms returned []
// Phase 1: matrix 714 rows 421 cols
[2022-05-16 14:19:21] [INFO ] Computed 164 place invariants in 6 ms
[2022-05-16 14:19:22] [INFO ] Implicit Places using invariants and state equation in 1195 ms returned []
Implicit Place search using SMT with State Equation took 1934 ms to find 0 implicit places.
[2022-05-16 14:19:22] [INFO ] Redundant transitions in 76 ms returned []
// Phase 1: matrix 714 rows 421 cols
[2022-05-16 14:19:22] [INFO ] Computed 164 place invariants in 5 ms
[2022-05-16 14:19:23] [INFO ] Dead Transitions using invariants and state equation in 958 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 421/421 places, 714/714 transitions.
Stuttering acceptance computed with spot in 210 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : HexagonalGrid-PT-316-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s125 1) (GEQ s321 1)), p2:(AND (GEQ s129 1) (GEQ s186 1)), p1:(OR (LT s126 1) (LT s164 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 284 reset in 2837 ms.
Product exploration explored 100000 steps with 299 reset in 2637 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT (AND p0 (NOT p2) (NOT p1)))), true, (X (X (NOT (AND p2 (NOT p1)))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (AND (NOT p0) (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))))]
Knowledge based reduction with 4 factoid took 543 ms. Reduced automaton from 4 states, 10 edges and 3 AP to 4 states, 10 edges and 3 AP.
Stuttering acceptance computed with spot in 207 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Finished random walk after 686 steps, including 0 resets, run visited all 6 properties in 65 ms. (steps per millisecond=10 )
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT (AND p0 (NOT p2) (NOT p1)))), true, (X (X (NOT (AND p2 (NOT p1)))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (AND (NOT p0) (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p1) p2)), (F p0), (F (AND p0 (NOT p1) (NOT p2))), (F (AND (NOT p0) (NOT p1) (NOT p2)))]
Knowledge based reduction with 4 factoid took 828 ms. Reduced automaton from 4 states, 10 edges and 3 AP to 4 states, 10 edges and 3 AP.
Stuttering acceptance computed with spot in 235 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 213 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
// Phase 1: matrix 714 rows 421 cols
[2022-05-16 14:19:31] [INFO ] Computed 164 place invariants in 7 ms
[2022-05-16 14:19:32] [INFO ] [Real]Absence check using 163 positive place invariants in 112 ms returned sat
[2022-05-16 14:19:32] [INFO ] [Real]Absence check using 163 positive and 1 generalized place invariants in 58 ms returned sat
[2022-05-16 14:19:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 14:19:33] [INFO ] [Real]Absence check using state equation in 519 ms returned sat
[2022-05-16 14:19:33] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 14:19:33] [INFO ] [Nat]Absence check using 163 positive place invariants in 112 ms returned sat
[2022-05-16 14:19:33] [INFO ] [Nat]Absence check using 163 positive and 1 generalized place invariants in 69 ms returned sat
[2022-05-16 14:19:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 14:19:34] [INFO ] [Nat]Absence check using state equation in 761 ms returned sat
[2022-05-16 14:19:34] [INFO ] Computed and/alt/rep : 600/600/600 causal constraints (skipped 0 transitions) in 132 ms.
[2022-05-16 14:19:37] [INFO ] Added : 140 causal constraints over 28 iterations in 2328 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 6 out of 421 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 421/421 places, 714/714 transitions.
Applied a total of 0 rules in 36 ms. Remains 421 /421 variables (removed 0) and now considering 714/714 (removed 0) transitions.
// Phase 1: matrix 714 rows 421 cols
[2022-05-16 14:19:37] [INFO ] Computed 164 place invariants in 6 ms
[2022-05-16 14:19:37] [INFO ] Implicit Places using invariants in 822 ms returned []
// Phase 1: matrix 714 rows 421 cols
[2022-05-16 14:19:37] [INFO ] Computed 164 place invariants in 7 ms
[2022-05-16 14:19:38] [INFO ] Implicit Places using invariants and state equation in 877 ms returned []
Implicit Place search using SMT with State Equation took 1702 ms to find 0 implicit places.
[2022-05-16 14:19:38] [INFO ] Redundant transitions in 9 ms returned []
// Phase 1: matrix 714 rows 421 cols
[2022-05-16 14:19:38] [INFO ] Computed 164 place invariants in 3 ms
[2022-05-16 14:19:39] [INFO ] Dead Transitions using invariants and state equation in 904 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 421/421 places, 714/714 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT (AND p0 (NOT p1) (NOT p2)))), true, (X (X (NOT (AND (NOT p1) p2))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT p0)), (X p0), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2)))))]
Knowledge based reduction with 4 factoid took 575 ms. Reduced automaton from 4 states, 10 edges and 3 AP to 4 states, 10 edges and 3 AP.
Stuttering acceptance computed with spot in 207 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Finished random walk after 6446 steps, including 1 resets, run visited all 6 properties in 379 ms. (steps per millisecond=17 )
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT (AND p0 (NOT p1) (NOT p2)))), true, (X (X (NOT (AND (NOT p1) p2))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT p0)), (X p0), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p1) p2)), (F p0), (F (AND p0 (NOT p1) (NOT p2))), (F (AND (NOT p0) (NOT p1) (NOT p2)))]
Knowledge based reduction with 4 factoid took 810 ms. Reduced automaton from 4 states, 10 edges and 3 AP to 4 states, 10 edges and 3 AP.
Stuttering acceptance computed with spot in 220 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 218 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
// Phase 1: matrix 714 rows 421 cols
[2022-05-16 14:19:42] [INFO ] Computed 164 place invariants in 6 ms
[2022-05-16 14:19:43] [INFO ] [Real]Absence check using 163 positive place invariants in 169 ms returned sat
[2022-05-16 14:19:43] [INFO ] [Real]Absence check using 163 positive and 1 generalized place invariants in 99 ms returned sat
[2022-05-16 14:19:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 14:19:44] [INFO ] [Real]Absence check using state equation in 832 ms returned sat
[2022-05-16 14:19:44] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 14:19:44] [INFO ] [Nat]Absence check using 163 positive place invariants in 86 ms returned sat
[2022-05-16 14:19:45] [INFO ] [Nat]Absence check using 163 positive and 1 generalized place invariants in 40 ms returned sat
[2022-05-16 14:19:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 14:19:45] [INFO ] [Nat]Absence check using state equation in 606 ms returned sat
[2022-05-16 14:19:45] [INFO ] Computed and/alt/rep : 600/600/600 causal constraints (skipped 0 transitions) in 75 ms.
[2022-05-16 14:19:47] [INFO ] Added : 140 causal constraints over 28 iterations in 2002 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 214 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 293 reset in 2815 ms.
Product exploration explored 100000 steps with 287 reset in 2598 ms.
Built C files in :
/tmp/ltsmin1477059875690267354
[2022-05-16 14:19:53] [INFO ] Computing symmetric may disable matrix : 714 transitions.
[2022-05-16 14:19:53] [INFO ] Computation of Complete disable matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 14:19:53] [INFO ] Computing symmetric may enable matrix : 714 transitions.
[2022-05-16 14:19:53] [INFO ] Computation of Complete enable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 14:19:53] [INFO ] Computing Do-Not-Accords matrix : 714 transitions.
[2022-05-16 14:19:53] [INFO ] Computation of Completed DNA matrix. took 46 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 14:19:53] [INFO ] Built C files in 204ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1477059875690267354
Running compilation step : cd /tmp/ltsmin1477059875690267354;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1477059875690267354;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1477059875690267354;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 6 out of 421 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 421/421 places, 714/714 transitions.
Applied a total of 0 rules in 34 ms. Remains 421 /421 variables (removed 0) and now considering 714/714 (removed 0) transitions.
// Phase 1: matrix 714 rows 421 cols
[2022-05-16 14:19:56] [INFO ] Computed 164 place invariants in 7 ms
[2022-05-16 14:19:57] [INFO ] Implicit Places using invariants in 807 ms returned []
// Phase 1: matrix 714 rows 421 cols
[2022-05-16 14:19:57] [INFO ] Computed 164 place invariants in 6 ms
[2022-05-16 14:19:58] [INFO ] Implicit Places using invariants and state equation in 1329 ms returned []
Implicit Place search using SMT with State Equation took 2165 ms to find 0 implicit places.
[2022-05-16 14:19:58] [INFO ] Redundant transitions in 11 ms returned []
// Phase 1: matrix 714 rows 421 cols
[2022-05-16 14:19:58] [INFO ] Computed 164 place invariants in 6 ms
[2022-05-16 14:19:59] [INFO ] Dead Transitions using invariants and state equation in 997 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 421/421 places, 714/714 transitions.
Built C files in :
/tmp/ltsmin8283155949175838042
[2022-05-16 14:19:59] [INFO ] Computing symmetric may disable matrix : 714 transitions.
[2022-05-16 14:19:59] [INFO ] Computation of Complete disable matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 14:19:59] [INFO ] Computing symmetric may enable matrix : 714 transitions.
[2022-05-16 14:19:59] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 14:19:59] [INFO ] Computing Do-Not-Accords matrix : 714 transitions.
[2022-05-16 14:19:59] [INFO ] Computation of Completed DNA matrix. took 14 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 14:19:59] [INFO ] Built C files in 142ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8283155949175838042
Running compilation step : cd /tmp/ltsmin8283155949175838042;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2985 ms.
Running link step : cd /tmp/ltsmin8283155949175838042;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 54 ms.
Running LTSmin : cd /tmp/ltsmin8283155949175838042;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased3877299500243336859.hoa' '--buchi-type=spotba'
LTSmin run took 5420 ms.
FORMULA HexagonalGrid-PT-316-LTLFireability-03 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property HexagonalGrid-PT-316-LTLFireability-03 finished in 47715 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((G(X(p0))||G(p1))))))'
Support contains 4 out of 421 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 421/421 places, 714/714 transitions.
Applied a total of 0 rules in 6 ms. Remains 421 /421 variables (removed 0) and now considering 714/714 (removed 0) transitions.
// Phase 1: matrix 714 rows 421 cols
[2022-05-16 14:20:08] [INFO ] Computed 164 place invariants in 3 ms
[2022-05-16 14:20:08] [INFO ] Implicit Places using invariants in 424 ms returned []
// Phase 1: matrix 714 rows 421 cols
[2022-05-16 14:20:08] [INFO ] Computed 164 place invariants in 7 ms
[2022-05-16 14:20:10] [INFO ] Implicit Places using invariants and state equation in 1344 ms returned []
Implicit Place search using SMT with State Equation took 1771 ms to find 0 implicit places.
// Phase 1: matrix 714 rows 421 cols
[2022-05-16 14:20:10] [INFO ] Computed 164 place invariants in 7 ms
[2022-05-16 14:20:11] [INFO ] Dead Transitions using invariants and state equation in 833 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 421/421 places, 714/714 transitions.
Stuttering acceptance computed with spot in 257 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : HexagonalGrid-PT-316-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 1}, { cond=(AND p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 1}, { cond=p1, acceptance={} source=4 dest: 2}], [{ cond=true, acceptance={} source=5 dest: 4}], [{ cond=true, acceptance={} source=6 dest: 7}], [{ cond=true, acceptance={} source=7 dest: 5}]], initial=6, aps=[p0:(AND (GEQ s120 1) (GEQ s158 1)), p1:(AND (GEQ s116 1) (GEQ s135 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, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA HexagonalGrid-PT-316-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HexagonalGrid-PT-316-LTLFireability-04 finished in 2889 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 4 out of 421 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 421/421 places, 714/714 transitions.
Applied a total of 0 rules in 19 ms. Remains 421 /421 variables (removed 0) and now considering 714/714 (removed 0) transitions.
// Phase 1: matrix 714 rows 421 cols
[2022-05-16 14:20:11] [INFO ] Computed 164 place invariants in 7 ms
[2022-05-16 14:20:11] [INFO ] Implicit Places using invariants in 607 ms returned []
// Phase 1: matrix 714 rows 421 cols
[2022-05-16 14:20:11] [INFO ] Computed 164 place invariants in 5 ms
[2022-05-16 14:20:12] [INFO ] Implicit Places using invariants and state equation in 971 ms returned []
Implicit Place search using SMT with State Equation took 1580 ms to find 0 implicit places.
[2022-05-16 14:20:12] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 714 rows 421 cols
[2022-05-16 14:20:12] [INFO ] Computed 164 place invariants in 4 ms
[2022-05-16 14:20:13] [INFO ] Dead Transitions using invariants and state equation in 647 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 421/421 places, 714/714 transitions.
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HexagonalGrid-PT-316-LTLFireability-05 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:(OR (AND (GEQ s99 1) (GEQ s243 1)) (AND (GEQ s129 1) (GEQ s295 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 458 reset in 2874 ms.
Product exploration explored 100000 steps with 453 reset in 2624 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 120 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Finished random walk after 97 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=24 )
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 145 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Support contains 4 out of 421 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 421/421 places, 714/714 transitions.
Applied a total of 0 rules in 18 ms. Remains 421 /421 variables (removed 0) and now considering 714/714 (removed 0) transitions.
// Phase 1: matrix 714 rows 421 cols
[2022-05-16 14:20:19] [INFO ] Computed 164 place invariants in 4 ms
[2022-05-16 14:20:20] [INFO ] Implicit Places using invariants in 676 ms returned []
// Phase 1: matrix 714 rows 421 cols
[2022-05-16 14:20:20] [INFO ] Computed 164 place invariants in 3 ms
[2022-05-16 14:20:21] [INFO ] Implicit Places using invariants and state equation in 989 ms returned []
Implicit Place search using SMT with State Equation took 1676 ms to find 0 implicit places.
[2022-05-16 14:20:21] [INFO ] Redundant transitions in 10 ms returned []
// Phase 1: matrix 714 rows 421 cols
[2022-05-16 14:20:21] [INFO ] Computed 164 place invariants in 5 ms
[2022-05-16 14:20:22] [INFO ] Dead Transitions using invariants and state equation in 791 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 421/421 places, 714/714 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 : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 114 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Finished random walk after 158 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=31 )
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 130 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 461 reset in 2705 ms.
Product exploration explored 100000 steps with 486 reset in 2728 ms.
Built C files in :
/tmp/ltsmin5889235469214062236
[2022-05-16 14:20:28] [INFO ] Computing symmetric may disable matrix : 714 transitions.
[2022-05-16 14:20:28] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 14:20:28] [INFO ] Computing symmetric may enable matrix : 714 transitions.
[2022-05-16 14:20:28] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 14:20:28] [INFO ] Computing Do-Not-Accords matrix : 714 transitions.
[2022-05-16 14:20:28] [INFO ] Computation of Completed DNA matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 14:20:28] [INFO ] Built C files in 85ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5889235469214062236
Running compilation step : cd /tmp/ltsmin5889235469214062236;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2776 ms.
Running link step : cd /tmp/ltsmin5889235469214062236;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin5889235469214062236;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11402764316709336427.hoa' '--buchi-type=spotba'
LTSmin run took 9266 ms.
FORMULA HexagonalGrid-PT-316-LTLFireability-05 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property HexagonalGrid-PT-316-LTLFireability-05 finished in 29253 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 421 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 421/421 places, 714/714 transitions.
Applied a total of 0 rules in 15 ms. Remains 421 /421 variables (removed 0) and now considering 714/714 (removed 0) transitions.
// Phase 1: matrix 714 rows 421 cols
[2022-05-16 14:20:40] [INFO ] Computed 164 place invariants in 3 ms
[2022-05-16 14:20:41] [INFO ] Implicit Places using invariants in 562 ms returned []
// Phase 1: matrix 714 rows 421 cols
[2022-05-16 14:20:41] [INFO ] Computed 164 place invariants in 5 ms
[2022-05-16 14:20:42] [INFO ] Implicit Places using invariants and state equation in 1286 ms returned []
Implicit Place search using SMT with State Equation took 1862 ms to find 0 implicit places.
[2022-05-16 14:20:42] [INFO ] Redundant transitions in 10 ms returned []
// Phase 1: matrix 714 rows 421 cols
[2022-05-16 14:20:42] [INFO ] Computed 164 place invariants in 5 ms
[2022-05-16 14:20:43] [INFO ] Dead Transitions using invariants and state equation in 1075 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 421/421 places, 714/714 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Running random walk in product with property : HexagonalGrid-PT-316-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s13 1) (LT s362 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 7 reset in 2033 ms.
Product exploration explored 100000 steps with 5 reset in 2065 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 : [(NOT p0)]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 1 factoid took 151 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Finished random walk after 165 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=27 )
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F p0)]
Knowledge based reduction with 1 factoid took 222 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
// Phase 1: matrix 714 rows 421 cols
[2022-05-16 14:20:48] [INFO ] Computed 164 place invariants in 6 ms
[2022-05-16 14:20:49] [INFO ] [Real]Absence check using 163 positive place invariants in 188 ms returned sat
[2022-05-16 14:20:49] [INFO ] [Real]Absence check using 163 positive and 1 generalized place invariants in 4 ms returned sat
[2022-05-16 14:20:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 14:20:50] [INFO ] [Real]Absence check using state equation in 1404 ms returned sat
[2022-05-16 14:20:50] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 14:20:51] [INFO ] [Nat]Absence check using 163 positive place invariants in 284 ms returned sat
[2022-05-16 14:20:51] [INFO ] [Nat]Absence check using 163 positive and 1 generalized place invariants in 158 ms returned sat
[2022-05-16 14:20:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 14:20:52] [INFO ] [Nat]Absence check using state equation in 770 ms returned sat
[2022-05-16 14:20:52] [INFO ] Computed and/alt/rep : 600/600/600 causal constraints (skipped 0 transitions) in 81 ms.
[2022-05-16 14:20:54] [INFO ] Added : 140 causal constraints over 28 iterations in 2039 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 421 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 421/421 places, 714/714 transitions.
Applied a total of 0 rules in 24 ms. Remains 421 /421 variables (removed 0) and now considering 714/714 (removed 0) transitions.
// Phase 1: matrix 714 rows 421 cols
[2022-05-16 14:20:54] [INFO ] Computed 164 place invariants in 5 ms
[2022-05-16 14:20:55] [INFO ] Implicit Places using invariants in 776 ms returned []
// Phase 1: matrix 714 rows 421 cols
[2022-05-16 14:20:55] [INFO ] Computed 164 place invariants in 8 ms
[2022-05-16 14:20:56] [INFO ] Implicit Places using invariants and state equation in 1408 ms returned []
Implicit Place search using SMT with State Equation took 2186 ms to find 0 implicit places.
[2022-05-16 14:20:56] [INFO ] Redundant transitions in 11 ms returned []
// Phase 1: matrix 714 rows 421 cols
[2022-05-16 14:20:56] [INFO ] Computed 164 place invariants in 5 ms
[2022-05-16 14:20:57] [INFO ] Dead Transitions using invariants and state equation in 1066 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 421/421 places, 714/714 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 : [(NOT p0)]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 1 factoid took 164 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Finished random walk after 229 steps, including 0 resets, run visited all 1 properties in 7 ms. (steps per millisecond=32 )
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F p0)]
Knowledge based reduction with 1 factoid took 193 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
// Phase 1: matrix 714 rows 421 cols
[2022-05-16 14:20:58] [INFO ] Computed 164 place invariants in 5 ms
[2022-05-16 14:20:59] [INFO ] [Real]Absence check using 163 positive place invariants in 273 ms returned sat
[2022-05-16 14:20:59] [INFO ] [Real]Absence check using 163 positive and 1 generalized place invariants in 13 ms returned sat
[2022-05-16 14:20:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 14:21:01] [INFO ] [Real]Absence check using state equation in 1438 ms returned sat
[2022-05-16 14:21:01] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 14:21:01] [INFO ] [Nat]Absence check using 163 positive place invariants in 179 ms returned sat
[2022-05-16 14:21:01] [INFO ] [Nat]Absence check using 163 positive and 1 generalized place invariants in 97 ms returned sat
[2022-05-16 14:21:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 14:21:02] [INFO ] [Nat]Absence check using state equation in 532 ms returned sat
[2022-05-16 14:21:02] [INFO ] Computed and/alt/rep : 600/600/600 causal constraints (skipped 0 transitions) in 71 ms.
[2022-05-16 14:21:04] [INFO ] Added : 140 causal constraints over 28 iterations in 1710 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Product exploration explored 100000 steps with 7 reset in 2054 ms.
Product exploration explored 100000 steps with 6 reset in 2243 ms.
Built C files in :
/tmp/ltsmin2402011152183437178
[2022-05-16 14:21:08] [INFO ] Computing symmetric may disable matrix : 714 transitions.
[2022-05-16 14:21:08] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 14:21:08] [INFO ] Computing symmetric may enable matrix : 714 transitions.
[2022-05-16 14:21:08] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 14:21:08] [INFO ] Computing Do-Not-Accords matrix : 714 transitions.
[2022-05-16 14:21:08] [INFO ] Computation of Completed DNA matrix. took 16 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 14:21:08] [INFO ] Built C files in 136ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2402011152183437178
Running compilation step : cd /tmp/ltsmin2402011152183437178;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2402011152183437178;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2402011152183437178;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 2 out of 421 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 421/421 places, 714/714 transitions.
Applied a total of 0 rules in 23 ms. Remains 421 /421 variables (removed 0) and now considering 714/714 (removed 0) transitions.
// Phase 1: matrix 714 rows 421 cols
[2022-05-16 14:21:11] [INFO ] Computed 164 place invariants in 5 ms
[2022-05-16 14:21:12] [INFO ] Implicit Places using invariants in 527 ms returned []
// Phase 1: matrix 714 rows 421 cols
[2022-05-16 14:21:12] [INFO ] Computed 164 place invariants in 4 ms
[2022-05-16 14:21:13] [INFO ] Implicit Places using invariants and state equation in 1308 ms returned []
Implicit Place search using SMT with State Equation took 1837 ms to find 0 implicit places.
[2022-05-16 14:21:13] [INFO ] Redundant transitions in 10 ms returned []
// Phase 1: matrix 714 rows 421 cols
[2022-05-16 14:21:13] [INFO ] Computed 164 place invariants in 6 ms
[2022-05-16 14:21:14] [INFO ] Dead Transitions using invariants and state equation in 986 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 421/421 places, 714/714 transitions.
Built C files in :
/tmp/ltsmin16042904981234593533
[2022-05-16 14:21:14] [INFO ] Computing symmetric may disable matrix : 714 transitions.
[2022-05-16 14:21:14] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 14:21:14] [INFO ] Computing symmetric may enable matrix : 714 transitions.
[2022-05-16 14:21:14] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 14:21:14] [INFO ] Computing Do-Not-Accords matrix : 714 transitions.
[2022-05-16 14:21:14] [INFO ] Computation of Completed DNA matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 14:21:14] [INFO ] Built C files in 86ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16042904981234593533
Running compilation step : cd /tmp/ltsmin16042904981234593533;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16042904981234593533;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16042904981234593533;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-16 14:21:17] [INFO ] Flatten gal took : 41 ms
[2022-05-16 14:21:17] [INFO ] Flatten gal took : 38 ms
[2022-05-16 14:21:17] [INFO ] Time to serialize gal into /tmp/LTL1914453927951196282.gal : 8 ms
[2022-05-16 14:21:17] [INFO ] Time to serialize properties into /tmp/LTL1877906777861662630.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1914453927951196282.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1877906777861662630.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1914453...266
Read 1 LTL properties
Checking formula 0 : !((F(G("((pb1_4_2<1)||(pol1_4_2<1))"))))
Formula 0 simplified : !FG"((pb1_4_2<1)||(pol1_4_2<1))"
Detected timeout of ITS tools.
[2022-05-16 14:21:32] [INFO ] Flatten gal took : 34 ms
[2022-05-16 14:21:32] [INFO ] Applying decomposition
[2022-05-16 14:21:32] [INFO ] Flatten gal took : 32 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph6456792180613479055.txt' '-o' '/tmp/graph6456792180613479055.bin' '-w' '/tmp/graph6456792180613479055.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph6456792180613479055.bin' '-l' '-1' '-v' '-w' '/tmp/graph6456792180613479055.weights' '-q' '0' '-e' '0.001'
[2022-05-16 14:21:32] [INFO ] Decomposing Gal with order
[2022-05-16 14:21:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 14:21:33] [INFO ] Removed a total of 912 redundant transitions.
[2022-05-16 14:21:33] [INFO ] Flatten gal took : 79 ms
[2022-05-16 14:21:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2022-05-16 14:21:33] [INFO ] Time to serialize gal into /tmp/LTL12335682210795294638.gal : 5 ms
[2022-05-16 14:21:33] [INFO ] Time to serialize properties into /tmp/LTL8770163167650135069.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12335682210795294638.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8770163167650135069.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1233568...246
Read 1 LTL properties
Checking formula 0 : !((F(G("((i18.u3.pb1_4_2<1)||(i10.u126.pol1_4_2<1))"))))
Formula 0 simplified : !FG"((i18.u3.pb1_4_2<1)||(i10.u126.pol1_4_2<1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4643816720715149541
[2022-05-16 14:21:48] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4643816720715149541
Running compilation step : cd /tmp/ltsmin4643816720715149541;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1802 ms.
Running link step : cd /tmp/ltsmin4643816720715149541;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin4643816720715149541;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
LTSmin run took 1423 ms.
FORMULA HexagonalGrid-PT-316-LTLFireability-07 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property HexagonalGrid-PT-316-LTLFireability-07 finished in 70830 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U !X((!p0 U !(p1 U X(X(p0)))))))'
Support contains 4 out of 421 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 421/421 places, 714/714 transitions.
Applied a total of 0 rules in 8 ms. Remains 421 /421 variables (removed 0) and now considering 714/714 (removed 0) transitions.
// Phase 1: matrix 714 rows 421 cols
[2022-05-16 14:21:51] [INFO ] Computed 164 place invariants in 3 ms
[2022-05-16 14:21:51] [INFO ] Implicit Places using invariants in 552 ms returned []
// Phase 1: matrix 714 rows 421 cols
[2022-05-16 14:21:51] [INFO ] Computed 164 place invariants in 3 ms
[2022-05-16 14:21:52] [INFO ] Implicit Places using invariants and state equation in 963 ms returned []
Implicit Place search using SMT with State Equation took 1517 ms to find 0 implicit places.
// Phase 1: matrix 714 rows 421 cols
[2022-05-16 14:21:52] [INFO ] Computed 164 place invariants in 4 ms
[2022-05-16 14:21:53] [INFO ] Dead Transitions using invariants and state equation in 593 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 421/421 places, 714/714 transitions.
Stuttering acceptance computed with spot in 900 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : HexagonalGrid-PT-316-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 3}, { cond=p1, acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 7}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 8}, { cond=(AND p0 p1), acceptance={} source=2 dest: 9}], [{ cond=true, acceptance={} source=3 dest: 5}], [{ cond=(NOT p1), acceptance={} source=4 dest: 10}, { cond=p1, acceptance={} source=4 dest: 11}], [{ cond=(NOT p0), acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(NOT p1), acceptance={} source=7 dest: 10}, { cond=p1, acceptance={} source=7 dest: 11}, { cond=(NOT p0), acceptance={} source=7 dest: 12}], [{ cond=(AND (NOT p0) p1), acceptance={} source=8 dest: 11}, { cond=(NOT p0), acceptance={} source=8 dest: 12}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=8 dest: 13}, { cond=(AND p0 (NOT p1)), acceptance={} source=8 dest: 14}, { cond=(AND p0 p1), acceptance={} source=8 dest: 15}], [{ cond=(AND (NOT p0) p1), acceptance={} source=9 dest: 11}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=9 dest: 13}, { cond=(AND p0 (NOT p1)), acceptance={} source=9 dest: 14}, { cond=(AND p0 p1), acceptance={} source=9 dest: 15}], [{ cond=(NOT p0), acceptance={} source=10 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=11 dest: 10}, { cond=(AND (NOT p0) p1), acceptance={0} source=11 dest: 11}], [{ cond=(NOT p0), acceptance={} source=12 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=12 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=12 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=13 dest: 10}, { cond=(AND (NOT p0) p1), acceptance={} source=13 dest: 11}, { cond=(NOT p0), acceptance={} source=13 dest: 12}], [{ cond=(AND (NOT p0) p1), acceptance={} source=14 dest: 11}, { cond=(NOT p0), acceptance={} source=14 dest: 12}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=14 dest: 13}], [{ cond=(AND (NOT p0) p1), acceptance={} source=15 dest: 11}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=15 dest: 13}]], initial=0, aps=[p0:(AND (GEQ s128 1) (GEQ s309 1)), p1:(AND (GEQ s129 1) (GEQ s295 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA HexagonalGrid-PT-316-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HexagonalGrid-PT-316-LTLFireability-08 finished in 3042 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(X(X(F(G(X(p0))))))&&X(p1))))'
Support contains 4 out of 421 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 421/421 places, 714/714 transitions.
Applied a total of 0 rules in 5 ms. Remains 421 /421 variables (removed 0) and now considering 714/714 (removed 0) transitions.
// Phase 1: matrix 714 rows 421 cols
[2022-05-16 14:21:54] [INFO ] Computed 164 place invariants in 26 ms
[2022-05-16 14:21:54] [INFO ] Implicit Places using invariants in 509 ms returned []
// Phase 1: matrix 714 rows 421 cols
[2022-05-16 14:21:54] [INFO ] Computed 164 place invariants in 4 ms
[2022-05-16 14:21:55] [INFO ] Implicit Places using invariants and state equation in 864 ms returned []
Implicit Place search using SMT with State Equation took 1376 ms to find 0 implicit places.
// Phase 1: matrix 714 rows 421 cols
[2022-05-16 14:21:55] [INFO ] Computed 164 place invariants in 4 ms
[2022-05-16 14:21:56] [INFO ] Dead Transitions using invariants and state equation in 915 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 421/421 places, 714/714 transitions.
Stuttering acceptance computed with spot in 152 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true, (NOT p0)]
Running random walk in product with property : HexagonalGrid-PT-316-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}, { cond=p1, acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=p0, acceptance={} source=4 dest: 4}, { cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(AND (GEQ s125 1) (GEQ s292 1)), p0:(OR (LT s120 1) (LT s139 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA HexagonalGrid-PT-316-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HexagonalGrid-PT-316-LTLFireability-09 finished in 2474 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 421 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 421/421 places, 714/714 transitions.
Applied a total of 0 rules in 12 ms. Remains 421 /421 variables (removed 0) and now considering 714/714 (removed 0) transitions.
// Phase 1: matrix 714 rows 421 cols
[2022-05-16 14:21:56] [INFO ] Computed 164 place invariants in 4 ms
[2022-05-16 14:21:57] [INFO ] Implicit Places using invariants in 460 ms returned []
// Phase 1: matrix 714 rows 421 cols
[2022-05-16 14:21:57] [INFO ] Computed 164 place invariants in 3 ms
[2022-05-16 14:21:58] [INFO ] Implicit Places using invariants and state equation in 853 ms returned []
Implicit Place search using SMT with State Equation took 1314 ms to find 0 implicit places.
[2022-05-16 14:21:58] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 714 rows 421 cols
[2022-05-16 14:21:58] [INFO ] Computed 164 place invariants in 3 ms
[2022-05-16 14:21:59] [INFO ] Dead Transitions using invariants and state equation in 777 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 421/421 places, 714/714 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : HexagonalGrid-PT-316-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s132 1) (GEQ s313 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 8688 steps with 0 reset in 239 ms.
FORMULA HexagonalGrid-PT-316-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HexagonalGrid-PT-316-LTLFireability-10 finished in 2411 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(F(G((p0 U p1)))))'
Support contains 4 out of 421 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 421/421 places, 714/714 transitions.
Applied a total of 0 rules in 13 ms. Remains 421 /421 variables (removed 0) and now considering 714/714 (removed 0) transitions.
// Phase 1: matrix 714 rows 421 cols
[2022-05-16 14:21:59] [INFO ] Computed 164 place invariants in 3 ms
[2022-05-16 14:21:59] [INFO ] Implicit Places using invariants in 471 ms returned []
// Phase 1: matrix 714 rows 421 cols
[2022-05-16 14:21:59] [INFO ] Computed 164 place invariants in 3 ms
[2022-05-16 14:22:00] [INFO ] Implicit Places using invariants and state equation in 887 ms returned []
Implicit Place search using SMT with State Equation took 1363 ms to find 0 implicit places.
[2022-05-16 14:22:00] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 714 rows 421 cols
[2022-05-16 14:22:00] [INFO ] Computed 164 place invariants in 3 ms
[2022-05-16 14:22:01] [INFO ] Dead Transitions using invariants and state equation in 795 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 421/421 places, 714/714 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : HexagonalGrid-PT-316-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (GEQ s122 1) (GEQ s141 1)), p0:(AND (GEQ s115 1) (GEQ s172 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 12542 steps with 0 reset in 228 ms.
FORMULA HexagonalGrid-PT-316-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HexagonalGrid-PT-316-LTLFireability-11 finished in 2504 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 421 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 421/421 places, 714/714 transitions.
Applied a total of 0 rules in 20 ms. Remains 421 /421 variables (removed 0) and now considering 714/714 (removed 0) transitions.
// Phase 1: matrix 714 rows 421 cols
[2022-05-16 14:22:01] [INFO ] Computed 164 place invariants in 4 ms
[2022-05-16 14:22:02] [INFO ] Implicit Places using invariants in 571 ms returned []
// Phase 1: matrix 714 rows 421 cols
[2022-05-16 14:22:02] [INFO ] Computed 164 place invariants in 6 ms
[2022-05-16 14:22:03] [INFO ] Implicit Places using invariants and state equation in 818 ms returned []
Implicit Place search using SMT with State Equation took 1393 ms to find 0 implicit places.
[2022-05-16 14:22:03] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 714 rows 421 cols
[2022-05-16 14:22:03] [INFO ] Computed 164 place invariants in 3 ms
[2022-05-16 14:22:04] [INFO ] Dead Transitions using invariants and state equation in 795 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 421/421 places, 714/714 transitions.
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HexagonalGrid-PT-316-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:(AND (GEQ s122 1) (GEQ s303 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 737 reset in 2464 ms.
Product exploration explored 100000 steps with 719 reset in 2868 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 : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 174 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0)]
Finished random walk after 149 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=29 )
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 137 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 714 rows 421 cols
[2022-05-16 14:22:10] [INFO ] Computed 164 place invariants in 5 ms
[2022-05-16 14:22:11] [INFO ] [Real]Absence check using 163 positive place invariants in 134 ms returned sat
[2022-05-16 14:22:11] [INFO ] [Real]Absence check using 163 positive and 1 generalized place invariants in 66 ms returned sat
[2022-05-16 14:22:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 14:22:11] [INFO ] [Real]Absence check using state equation in 622 ms returned sat
[2022-05-16 14:22:11] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 14:22:12] [INFO ] [Nat]Absence check using 163 positive place invariants in 102 ms returned sat
[2022-05-16 14:22:12] [INFO ] [Nat]Absence check using 163 positive and 1 generalized place invariants in 57 ms returned sat
[2022-05-16 14:22:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 14:22:13] [INFO ] [Nat]Absence check using state equation in 529 ms returned sat
[2022-05-16 14:22:13] [INFO ] Computed and/alt/rep : 600/600/600 causal constraints (skipped 0 transitions) in 67 ms.
[2022-05-16 14:22:14] [INFO ] Added : 141 causal constraints over 29 iterations in 1515 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 421 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 421/421 places, 714/714 transitions.
Applied a total of 0 rules in 12 ms. Remains 421 /421 variables (removed 0) and now considering 714/714 (removed 0) transitions.
// Phase 1: matrix 714 rows 421 cols
[2022-05-16 14:22:14] [INFO ] Computed 164 place invariants in 5 ms
[2022-05-16 14:22:15] [INFO ] Implicit Places using invariants in 501 ms returned []
// Phase 1: matrix 714 rows 421 cols
[2022-05-16 14:22:15] [INFO ] Computed 164 place invariants in 6 ms
[2022-05-16 14:22:16] [INFO ] Implicit Places using invariants and state equation in 898 ms returned []
Implicit Place search using SMT with State Equation took 1401 ms to find 0 implicit places.
[2022-05-16 14:22:16] [INFO ] Redundant transitions in 7 ms returned []
// Phase 1: matrix 714 rows 421 cols
[2022-05-16 14:22:16] [INFO ] Computed 164 place invariants in 5 ms
[2022-05-16 14:22:16] [INFO ] Dead Transitions using invariants and state equation in 627 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 421/421 places, 714/714 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 : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 166 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=4 )
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 140 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 714 rows 421 cols
[2022-05-16 14:22:17] [INFO ] Computed 164 place invariants in 3 ms
[2022-05-16 14:22:17] [INFO ] [Real]Absence check using 163 positive place invariants in 99 ms returned sat
[2022-05-16 14:22:18] [INFO ] [Real]Absence check using 163 positive and 1 generalized place invariants in 42 ms returned sat
[2022-05-16 14:22:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 14:22:18] [INFO ] [Real]Absence check using state equation in 555 ms returned sat
[2022-05-16 14:22:18] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 14:22:19] [INFO ] [Nat]Absence check using 163 positive place invariants in 96 ms returned sat
[2022-05-16 14:22:19] [INFO ] [Nat]Absence check using 163 positive and 1 generalized place invariants in 56 ms returned sat
[2022-05-16 14:22:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 14:22:19] [INFO ] [Nat]Absence check using state equation in 566 ms returned sat
[2022-05-16 14:22:19] [INFO ] Computed and/alt/rep : 600/600/600 causal constraints (skipped 0 transitions) in 69 ms.
[2022-05-16 14:22:21] [INFO ] Added : 141 causal constraints over 29 iterations in 1612 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 767 reset in 2512 ms.
Product exploration explored 100000 steps with 781 reset in 2574 ms.
Built C files in :
/tmp/ltsmin8191759367565255246
[2022-05-16 14:22:26] [INFO ] Computing symmetric may disable matrix : 714 transitions.
[2022-05-16 14:22:26] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 14:22:26] [INFO ] Computing symmetric may enable matrix : 714 transitions.
[2022-05-16 14:22:26] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 14:22:26] [INFO ] Computing Do-Not-Accords matrix : 714 transitions.
[2022-05-16 14:22:26] [INFO ] Computation of Completed DNA matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 14:22:26] [INFO ] Built C files in 82ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8191759367565255246
Running compilation step : cd /tmp/ltsmin8191759367565255246;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2786 ms.
Running link step : cd /tmp/ltsmin8191759367565255246;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin8191759367565255246;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1653433792532578738.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 421 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 421/421 places, 714/714 transitions.
Applied a total of 0 rules in 15 ms. Remains 421 /421 variables (removed 0) and now considering 714/714 (removed 0) transitions.
// Phase 1: matrix 714 rows 421 cols
[2022-05-16 14:22:41] [INFO ] Computed 164 place invariants in 4 ms
[2022-05-16 14:22:42] [INFO ] Implicit Places using invariants in 496 ms returned []
// Phase 1: matrix 714 rows 421 cols
[2022-05-16 14:22:42] [INFO ] Computed 164 place invariants in 5 ms
[2022-05-16 14:22:43] [INFO ] Implicit Places using invariants and state equation in 888 ms returned []
Implicit Place search using SMT with State Equation took 1386 ms to find 0 implicit places.
[2022-05-16 14:22:43] [INFO ] Redundant transitions in 7 ms returned []
// Phase 1: matrix 714 rows 421 cols
[2022-05-16 14:22:43] [INFO ] Computed 164 place invariants in 3 ms
[2022-05-16 14:22:43] [INFO ] Dead Transitions using invariants and state equation in 819 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 421/421 places, 714/714 transitions.
Built C files in :
/tmp/ltsmin15808356401995399880
[2022-05-16 14:22:43] [INFO ] Computing symmetric may disable matrix : 714 transitions.
[2022-05-16 14:22:43] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 14:22:43] [INFO ] Computing symmetric may enable matrix : 714 transitions.
[2022-05-16 14:22:43] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 14:22:44] [INFO ] Computing Do-Not-Accords matrix : 714 transitions.
[2022-05-16 14:22:44] [INFO ] Computation of Completed DNA matrix. took 14 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 14:22:44] [INFO ] Built C files in 130ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15808356401995399880
Running compilation step : cd /tmp/ltsmin15808356401995399880;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2813 ms.
Running link step : cd /tmp/ltsmin15808356401995399880;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin15808356401995399880;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased2787238171668761198.hoa' '--buchi-type=spotba'
LTSmin run took 7539 ms.
FORMULA HexagonalGrid-PT-316-LTLFireability-13 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property HexagonalGrid-PT-316-LTLFireability-13 finished in 52668 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(F(((p0 U p1)&&!p1)))&&(G(p2)||p0))))'
Support contains 6 out of 421 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 421/421 places, 714/714 transitions.
Applied a total of 0 rules in 4 ms. Remains 421 /421 variables (removed 0) and now considering 714/714 (removed 0) transitions.
// Phase 1: matrix 714 rows 421 cols
[2022-05-16 14:22:54] [INFO ] Computed 164 place invariants in 3 ms
[2022-05-16 14:22:55] [INFO ] Implicit Places using invariants in 502 ms returned []
// Phase 1: matrix 714 rows 421 cols
[2022-05-16 14:22:55] [INFO ] Computed 164 place invariants in 4 ms
[2022-05-16 14:22:55] [INFO ] Implicit Places using invariants and state equation in 864 ms returned []
Implicit Place search using SMT with State Equation took 1370 ms to find 0 implicit places.
// Phase 1: matrix 714 rows 421 cols
[2022-05-16 14:22:55] [INFO ] Computed 164 place invariants in 3 ms
[2022-05-16 14:22:56] [INFO ] Dead Transitions using invariants and state equation in 751 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 421/421 places, 714/714 transitions.
Stuttering acceptance computed with spot in 213 ms :[true, true, (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : HexagonalGrid-PT-316-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(OR p0 p2), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=0 dest: 2}], [{ cond=(OR (NOT p0) p1), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 0}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 2}, { cond=(AND p0 p2), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) p1)), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(OR (AND (NOT p0) p2) (AND p2 p1)), acceptance={} source=4 dest: 4}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=5 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(AND (GEQ s117 1) (GEQ s284 1)), p2:(AND (GEQ s126 1) (GEQ s145 1)), p1:(AND (GEQ s4 1) (GEQ s353 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 29256 steps with 8 reset in 530 ms.
FORMULA HexagonalGrid-PT-316-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HexagonalGrid-PT-316-LTLFireability-15 finished in 2898 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F((X(p1)&&p0))||G((G(p2)||X(X(p3))))))'
[2022-05-16 14:22:57] [INFO ] Flatten gal took : 31 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin5045743104198823407
[2022-05-16 14:22:57] [INFO ] Computing symmetric may disable matrix : 714 transitions.
[2022-05-16 14:22:57] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 14:22:57] [INFO ] Computing symmetric may enable matrix : 714 transitions.
[2022-05-16 14:22:57] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 14:22:57] [INFO ] Applying decomposition
[2022-05-16 14:22:57] [INFO ] Flatten gal took : 37 ms
[2022-05-16 14:22:57] [INFO ] Computing Do-Not-Accords matrix : 714 transitions.
[2022-05-16 14:22:57] [INFO ] Computation of Completed DNA matrix. took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 14:22:57] [INFO ] Built C files in 107ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5045743104198823407
Running compilation step : cd /tmp/ltsmin5045743104198823407;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph17482406556903536151.txt' '-o' '/tmp/graph17482406556903536151.bin' '-w' '/tmp/graph17482406556903536151.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph17482406556903536151.bin' '-l' '-1' '-v' '-w' '/tmp/graph17482406556903536151.weights' '-q' '0' '-e' '0.001'
[2022-05-16 14:22:57] [INFO ] Decomposing Gal with order
[2022-05-16 14:22:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 14:22:57] [INFO ] Removed a total of 912 redundant transitions.
[2022-05-16 14:22:57] [INFO ] Flatten gal took : 71 ms
[2022-05-16 14:22:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2022-05-16 14:22:57] [INFO ] Time to serialize gal into /tmp/LTLFireability13354521878392165330.gal : 6 ms
[2022-05-16 14:22:57] [INFO ] Time to serialize properties into /tmp/LTLFireability8841295923463525009.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability13354521878392165330.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability8841295923463525009.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...268
Read 1 LTL properties
Checking formula 0 : !(((F(((X("((i15.u3.pbl_4_3>=1)&&(i15.u139.po2_4_2>=1))"))&&("(i15.u3.pbl_4_3>=1)"))&&("(i15.u139.po2_4_2>=1)")))||(G((G("((i7.u13.pb3...250
Formula 0 simplified : !(F("(i15.u3.pbl_4_3>=1)" & "(i15.u139.po2_4_2>=1)" & X"((i15.u3.pbl_4_3>=1)&&(i15.u139.po2_4_2>=1))") | G(G"((i7.u13.pb3_3_3>=1)&&(...230
Compilation finished in 2819 ms.
Running link step : cd /tmp/ltsmin5045743104198823407;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin5045743104198823407;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(<>((X((LTLAPp1==true))&&(LTLAPp0==true)))||[](([]((LTLAPp2==true))||X(X((LTLAPp3==true))))))' '--buchi-type=spotba'
LTSmin run took 23383 ms.
FORMULA HexagonalGrid-PT-316-LTLFireability-00 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 372669 ms.

BK_STOP 1652711004198

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="HexagonalGrid-PT-316"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is HexagonalGrid-PT-316, 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 r114-smll-165264477400236"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/HexagonalGrid-PT-316.tgz
mv HexagonalGrid-PT-316 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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;