Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 600K
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K May 19 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 15:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 12 08:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 178K Apr 12 08:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Apr 12 08:43 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Apr 12 08:43 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Apr 22 14:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 110K May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME DES-PT-60a-LTLFireability-00
FORMULA_NAME DES-PT-60a-LTLFireability-01
FORMULA_NAME DES-PT-60a-LTLFireability-02
FORMULA_NAME DES-PT-60a-LTLFireability-03
FORMULA_NAME DES-PT-60a-LTLFireability-04
FORMULA_NAME DES-PT-60a-LTLFireability-05
FORMULA_NAME DES-PT-60a-LTLFireability-06
FORMULA_NAME DES-PT-60a-LTLFireability-07
FORMULA_NAME DES-PT-60a-LTLFireability-08
FORMULA_NAME DES-PT-60a-LTLFireability-09
FORMULA_NAME DES-PT-60a-LTLFireability-10
FORMULA_NAME DES-PT-60a-LTLFireability-11
FORMULA_NAME DES-PT-60a-LTLFireability-12
FORMULA_NAME DES-PT-60a-LTLFireability-13
FORMULA_NAME DES-PT-60a-LTLFireability-14
FORMULA_NAME DES-PT-60a-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716341791869

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-60a
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-22 01:36:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-22 01:36:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 01:36:34] [INFO ] Load time of PNML (sax parser for PT used): 112 ms
[2024-05-22 01:36:34] [INFO ] Transformed 354 places.
[2024-05-22 01:36:34] [INFO ] Transformed 311 transitions.
[2024-05-22 01:36:34] [INFO ] Found NUPN structural information;
[2024-05-22 01:36:34] [INFO ] Parsed PT model containing 354 places and 311 transitions and 1496 arcs in 243 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 18 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
FORMULA DES-PT-60a-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-60a-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-60a-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 45 out of 354 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 354/354 places, 297/297 transitions.
Applied a total of 0 rules in 55 ms. Remains 354 /354 variables (removed 0) and now considering 297/297 (removed 0) transitions.
// Phase 1: matrix 297 rows 354 cols
[2024-05-22 01:36:35] [INFO ] Computed 59 invariants in 45 ms
[2024-05-22 01:36:35] [INFO ] Implicit Places using invariants in 799 ms returned [251]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 833 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 353/354 places, 297/297 transitions.
Applied a total of 0 rules in 21 ms. Remains 353 /353 variables (removed 0) and now considering 297/297 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 910 ms. Remains : 353/354 places, 297/297 transitions.
Support contains 45 out of 353 places after structural reductions.
[2024-05-22 01:36:36] [INFO ] Flatten gal took : 114 ms
[2024-05-22 01:36:36] [INFO ] Flatten gal took : 52 ms
[2024-05-22 01:36:36] [INFO ] Input system was already deterministic with 297 transitions.
Support contains 43 out of 353 places (down from 45) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 222 resets, run finished after 701 ms. (steps per millisecond=14 ) properties (out of 31) seen :8
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 6 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 6 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 23) seen :0
Running SMT prover for 23 properties.
// Phase 1: matrix 297 rows 353 cols
[2024-05-22 01:36:37] [INFO ] Computed 58 invariants in 12 ms
[2024-05-22 01:36:37] [INFO ] [Real]Absence check using 33 positive place invariants in 14 ms returned sat
[2024-05-22 01:36:38] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 36 ms returned sat
[2024-05-22 01:36:38] [INFO ] After 839ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:23
[2024-05-22 01:36:38] [INFO ] [Nat]Absence check using 33 positive place invariants in 7 ms returned sat
[2024-05-22 01:36:38] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 263 ms returned sat
[2024-05-22 01:37:00] [INFO ] After 20815ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :23
[2024-05-22 01:37:02] [INFO ] Deduced a trap composed of 10 places in 99 ms of which 6 ms to minimize.
[2024-05-22 01:37:02] [INFO ] Deduced a trap composed of 9 places in 122 ms of which 1 ms to minimize.
[2024-05-22 01:37:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 337 ms
[2024-05-22 01:37:03] [INFO ] After 23160ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :22
Attempting to minimize the solution found.
Minimization took 0 ms.
[2024-05-22 01:37:03] [INFO ] After 25020ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :22
Parikh walk visited 19 properties in 1456 ms.
Support contains 9 out of 353 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 353/353 places, 297/297 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 353 transition count 295
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 352 transition count 294
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 352 transition count 294
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 8 place count 352 transition count 294
Applied a total of 8 rules in 91 ms. Remains 352 /353 variables (removed 1) and now considering 294/297 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 91 ms. Remains : 352/353 places, 294/297 transitions.
Incomplete random walk after 10000 steps, including 137 resets, run finished after 289 ms. (steps per millisecond=34 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 74 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 759038 steps, run timeout after 3001 ms. (steps per millisecond=252 ) properties seen :{}
Probabilistic random walk after 759038 steps, saw 108932 distinct states, run finished after 3003 ms. (steps per millisecond=252 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 294 rows 352 cols
[2024-05-22 01:37:08] [INFO ] Computed 60 invariants in 9 ms
[2024-05-22 01:37:08] [INFO ] [Real]Absence check using 36 positive place invariants in 28 ms returned sat
[2024-05-22 01:37:08] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 13 ms returned sat
[2024-05-22 01:37:08] [INFO ] After 388ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-22 01:37:08] [INFO ] [Nat]Absence check using 36 positive place invariants in 20 ms returned sat
[2024-05-22 01:37:09] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 180 ms returned sat
[2024-05-22 01:37:10] [INFO ] After 866ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-22 01:37:10] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 01:37:10] [INFO ] After 249ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-22 01:37:10] [INFO ] After 559ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 330 ms.
[2024-05-22 01:37:10] [INFO ] After 2123ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 151 ms.
Support contains 9 out of 352 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 294/294 transitions.
Applied a total of 0 rules in 22 ms. Remains 352 /352 variables (removed 0) and now considering 294/294 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 352/352 places, 294/294 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 294/294 transitions.
Applied a total of 0 rules in 11 ms. Remains 352 /352 variables (removed 0) and now considering 294/294 (removed 0) transitions.
[2024-05-22 01:37:11] [INFO ] Invariant cache hit.
[2024-05-22 01:37:11] [INFO ] Implicit Places using invariants in 502 ms returned []
[2024-05-22 01:37:11] [INFO ] Invariant cache hit.
[2024-05-22 01:37:11] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 01:37:12] [INFO ] Implicit Places using invariants and state equation in 514 ms returned []
Implicit Place search using SMT with State Equation took 1032 ms to find 0 implicit places.
[2024-05-22 01:37:12] [INFO ] Redundant transitions in 21 ms returned []
[2024-05-22 01:37:12] [INFO ] Invariant cache hit.
[2024-05-22 01:37:12] [INFO ] Dead Transitions using invariants and state equation in 186 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1270 ms. Remains : 352/352 places, 294/294 transitions.
Applied a total of 0 rules in 21 ms. Remains 352 /352 variables (removed 0) and now considering 294/294 (removed 0) transitions.
Running SMT prover for 4 properties.
[2024-05-22 01:37:12] [INFO ] Invariant cache hit.
[2024-05-22 01:37:12] [INFO ] [Real]Absence check using 36 positive place invariants in 6 ms returned sat
[2024-05-22 01:37:12] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 44 ms returned sat
[2024-05-22 01:37:12] [INFO ] After 310ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-22 01:37:12] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-22 01:37:12] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 119 ms returned sat
[2024-05-22 01:37:13] [INFO ] After 991ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-22 01:37:14] [INFO ] After 1371ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 273 ms.
[2024-05-22 01:37:14] [INFO ] After 1864ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Computed a total of 256 stabilizing places and 251 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(X(F(p0)))&&G(p1))))'
Support contains 6 out of 353 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 353/353 places, 297/297 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 352 transition count 296
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 352 transition count 296
Applied a total of 2 rules in 10 ms. Remains 352 /353 variables (removed 1) and now considering 296/297 (removed 1) transitions.
// Phase 1: matrix 296 rows 352 cols
[2024-05-22 01:37:14] [INFO ] Computed 58 invariants in 5 ms
[2024-05-22 01:37:15] [INFO ] Implicit Places using invariants in 352 ms returned []
[2024-05-22 01:37:15] [INFO ] Invariant cache hit.
[2024-05-22 01:37:15] [INFO ] Implicit Places using invariants and state equation in 445 ms returned []
Implicit Place search using SMT with State Equation took 813 ms to find 0 implicit places.
[2024-05-22 01:37:15] [INFO ] Invariant cache hit.
[2024-05-22 01:37:15] [INFO ] Dead Transitions using invariants and state equation in 189 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 352/353 places, 296/297 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1013 ms. Remains : 352/353 places, 296/297 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 334 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p0)]
Running random walk in product with property : DES-PT-60a-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(OR (NEQ s199 1) (NEQ s244 1)), p0:(OR (EQ s188 0) (EQ s244 0) (EQ s10 0) (EQ s271 0) (EQ s273 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 4227 reset in 482 ms.
Product exploration explored 100000 steps with 4174 reset in 459 ms.
Computed a total of 255 stabilizing places and 250 stable transitions
Computed a total of 255 stabilizing places and 250 stable transitions
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p1)), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 181 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 173 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p0)]
Incomplete random walk after 10000 steps, including 232 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 65 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 63 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 864321 steps, run timeout after 3001 ms. (steps per millisecond=288 ) properties seen :{}
Probabilistic random walk after 864321 steps, saw 127866 distinct states, run finished after 3001 ms. (steps per millisecond=288 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-22 01:37:20] [INFO ] Invariant cache hit.
[2024-05-22 01:37:21] [INFO ] [Real]Absence check using 33 positive place invariants in 7 ms returned sat
[2024-05-22 01:37:21] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 27 ms returned sat
[2024-05-22 01:37:21] [INFO ] After 161ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-22 01:37:21] [INFO ] [Nat]Absence check using 33 positive place invariants in 5 ms returned sat
[2024-05-22 01:37:21] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 120 ms returned sat
[2024-05-22 01:37:21] [INFO ] After 569ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-22 01:37:22] [INFO ] After 824ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 386 ms.
[2024-05-22 01:37:22] [INFO ] After 1459ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 74 ms.
Support contains 6 out of 352 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 296/296 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 352 transition count 294
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 7 place count 352 transition count 294
Applied a total of 7 rules in 36 ms. Remains 352 /352 variables (removed 0) and now considering 294/296 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 352/352 places, 294/296 transitions.
Incomplete random walk after 10000 steps, including 133 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 72 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 72 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1022496 steps, run timeout after 3001 ms. (steps per millisecond=340 ) properties seen :{}
Probabilistic random walk after 1022496 steps, saw 144489 distinct states, run finished after 3001 ms. (steps per millisecond=340 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 294 rows 352 cols
[2024-05-22 01:37:25] [INFO ] Computed 60 invariants in 6 ms
[2024-05-22 01:37:26] [INFO ] [Real]Absence check using 36 positive place invariants in 7 ms returned sat
[2024-05-22 01:37:26] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 128 ms returned sat
[2024-05-22 01:37:26] [INFO ] After 246ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-22 01:37:26] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-22 01:37:26] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 161 ms returned sat
[2024-05-22 01:37:27] [INFO ] After 517ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-22 01:37:27] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-22 01:37:27] [INFO ] After 129ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-22 01:37:27] [INFO ] After 426ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 157 ms.
[2024-05-22 01:37:27] [INFO ] After 1408ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 68 ms.
Support contains 6 out of 352 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 294/294 transitions.
Applied a total of 0 rules in 9 ms. Remains 352 /352 variables (removed 0) and now considering 294/294 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 352/352 places, 294/294 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 294/294 transitions.
Applied a total of 0 rules in 9 ms. Remains 352 /352 variables (removed 0) and now considering 294/294 (removed 0) transitions.
[2024-05-22 01:37:27] [INFO ] Invariant cache hit.
[2024-05-22 01:37:27] [INFO ] Implicit Places using invariants in 193 ms returned []
[2024-05-22 01:37:27] [INFO ] Invariant cache hit.
[2024-05-22 01:37:28] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-22 01:37:28] [INFO ] Implicit Places using invariants and state equation in 531 ms returned []
Implicit Place search using SMT with State Equation took 746 ms to find 0 implicit places.
[2024-05-22 01:37:28] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-22 01:37:28] [INFO ] Invariant cache hit.
[2024-05-22 01:37:28] [INFO ] Dead Transitions using invariants and state equation in 251 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1032 ms. Remains : 352/352 places, 294/294 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 352 transition count 294
Applied a total of 1 rules in 24 ms. Remains 352 /352 variables (removed 0) and now considering 294/294 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 294 rows 352 cols
[2024-05-22 01:37:28] [INFO ] Computed 60 invariants in 4 ms
[2024-05-22 01:37:28] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-22 01:37:28] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 14 ms returned sat
[2024-05-22 01:37:28] [INFO ] After 96ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-22 01:37:28] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2024-05-22 01:37:29] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 168 ms returned sat
[2024-05-22 01:37:29] [INFO ] After 348ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-22 01:37:29] [INFO ] After 494ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 184 ms.
[2024-05-22 01:37:29] [INFO ] After 964ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p1)), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 179 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 133 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 156 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p0)]
Support contains 6 out of 352 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 352/352 places, 296/296 transitions.
Applied a total of 0 rules in 4 ms. Remains 352 /352 variables (removed 0) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 352 cols
[2024-05-22 01:37:30] [INFO ] Computed 58 invariants in 4 ms
[2024-05-22 01:37:30] [INFO ] Implicit Places using invariants in 192 ms returned []
[2024-05-22 01:37:30] [INFO ] Invariant cache hit.
[2024-05-22 01:37:30] [INFO ] Implicit Places using invariants and state equation in 354 ms returned []
Implicit Place search using SMT with State Equation took 547 ms to find 0 implicit places.
[2024-05-22 01:37:30] [INFO ] Invariant cache hit.
[2024-05-22 01:37:31] [INFO ] Dead Transitions using invariants and state equation in 189 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 741 ms. Remains : 352/352 places, 296/296 transitions.
Computed a total of 255 stabilizing places and 250 stable transitions
Computed a total of 255 stabilizing places and 250 stable transitions
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p1)), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 138 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 128 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p0)]
Incomplete random walk after 10000 steps, including 217 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 62 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 64 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1037067 steps, run timeout after 3001 ms. (steps per millisecond=345 ) properties seen :{}
Probabilistic random walk after 1037067 steps, saw 147805 distinct states, run finished after 3001 ms. (steps per millisecond=345 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-22 01:37:34] [INFO ] Invariant cache hit.
[2024-05-22 01:37:34] [INFO ] [Real]Absence check using 33 positive place invariants in 4 ms returned sat
[2024-05-22 01:37:34] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 14 ms returned sat
[2024-05-22 01:37:34] [INFO ] After 77ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-22 01:37:34] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2024-05-22 01:37:34] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 120 ms returned sat
[2024-05-22 01:37:35] [INFO ] After 578ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-22 01:37:35] [INFO ] After 836ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 384 ms.
[2024-05-22 01:37:35] [INFO ] After 1444ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 77 ms.
Support contains 6 out of 352 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 296/296 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 352 transition count 294
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 7 place count 352 transition count 294
Applied a total of 7 rules in 20 ms. Remains 352 /352 variables (removed 0) and now considering 294/296 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 352/352 places, 294/296 transitions.
Incomplete random walk after 10000 steps, including 134 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 73 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 72 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1078663 steps, run timeout after 3001 ms. (steps per millisecond=359 ) properties seen :{}
Probabilistic random walk after 1078663 steps, saw 151304 distinct states, run finished after 3001 ms. (steps per millisecond=359 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 294 rows 352 cols
[2024-05-22 01:37:39] [INFO ] Computed 60 invariants in 3 ms
[2024-05-22 01:37:39] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-22 01:37:39] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 14 ms returned sat
[2024-05-22 01:37:39] [INFO ] After 136ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-22 01:37:39] [INFO ] [Nat]Absence check using 36 positive place invariants in 6 ms returned sat
[2024-05-22 01:37:39] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 169 ms returned sat
[2024-05-22 01:37:40] [INFO ] After 505ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-22 01:37:40] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-22 01:37:40] [INFO ] After 124ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-22 01:37:40] [INFO ] After 377ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 157 ms.
[2024-05-22 01:37:40] [INFO ] After 1345ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 105 ms.
Support contains 6 out of 352 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 294/294 transitions.
Applied a total of 0 rules in 9 ms. Remains 352 /352 variables (removed 0) and now considering 294/294 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 352/352 places, 294/294 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 294/294 transitions.
Applied a total of 0 rules in 9 ms. Remains 352 /352 variables (removed 0) and now considering 294/294 (removed 0) transitions.
[2024-05-22 01:37:40] [INFO ] Invariant cache hit.
[2024-05-22 01:37:41] [INFO ] Implicit Places using invariants in 212 ms returned []
[2024-05-22 01:37:41] [INFO ] Invariant cache hit.
[2024-05-22 01:37:41] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-22 01:37:41] [INFO ] Implicit Places using invariants and state equation in 607 ms returned []
Implicit Place search using SMT with State Equation took 833 ms to find 0 implicit places.
[2024-05-22 01:37:41] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-22 01:37:41] [INFO ] Invariant cache hit.
[2024-05-22 01:37:41] [INFO ] Dead Transitions using invariants and state equation in 207 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1067 ms. Remains : 352/352 places, 294/294 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 352 transition count 294
Applied a total of 1 rules in 17 ms. Remains 352 /352 variables (removed 0) and now considering 294/294 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 294 rows 352 cols
[2024-05-22 01:37:41] [INFO ] Computed 60 invariants in 6 ms
[2024-05-22 01:37:41] [INFO ] [Real]Absence check using 36 positive place invariants in 4 ms returned sat
[2024-05-22 01:37:41] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 14 ms returned sat
[2024-05-22 01:37:41] [INFO ] After 75ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-22 01:37:42] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-22 01:37:42] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 167 ms returned sat
[2024-05-22 01:37:42] [INFO ] After 350ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-22 01:37:42] [INFO ] After 479ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 158 ms.
[2024-05-22 01:37:42] [INFO ] After 908ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p1)), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 85 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 162 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 148 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 136 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p0)]
Product exploration explored 100000 steps with 4205 reset in 253 ms.
Product exploration explored 100000 steps with 4162 reset in 275 ms.
Applying partial POR strategy [false, false, false, true]
Stuttering acceptance computed with spot in 162 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p0)]
Support contains 6 out of 352 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 352/352 places, 296/296 transitions.
Applied a total of 0 rules in 39 ms. Remains 352 /352 variables (removed 0) and now considering 296/296 (removed 0) transitions.
[2024-05-22 01:37:44] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 296 rows 352 cols
[2024-05-22 01:37:44] [INFO ] Computed 58 invariants in 5 ms
[2024-05-22 01:37:44] [INFO ] Dead Transitions using invariants and state equation in 190 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 258 ms. Remains : 352/352 places, 296/296 transitions.
Built C files in :
/tmp/ltsmin9176292064075333256
[2024-05-22 01:37:44] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9176292064075333256
Running compilation step : cd /tmp/ltsmin9176292064075333256;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 676 ms.
Running link step : cd /tmp/ltsmin9176292064075333256;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin9176292064075333256;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased17784975125856379567.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 352 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 352/352 places, 296/296 transitions.
Applied a total of 0 rules in 21 ms. Remains 352 /352 variables (removed 0) and now considering 296/296 (removed 0) transitions.
[2024-05-22 01:37:59] [INFO ] Invariant cache hit.
[2024-05-22 01:37:59] [INFO ] Implicit Places using invariants in 253 ms returned []
[2024-05-22 01:37:59] [INFO ] Invariant cache hit.
[2024-05-22 01:38:00] [INFO ] Implicit Places using invariants and state equation in 402 ms returned []
Implicit Place search using SMT with State Equation took 657 ms to find 0 implicit places.
[2024-05-22 01:38:00] [INFO ] Invariant cache hit.
[2024-05-22 01:38:00] [INFO ] Dead Transitions using invariants and state equation in 162 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 840 ms. Remains : 352/352 places, 296/296 transitions.
Built C files in :
/tmp/ltsmin17151122257292934841
[2024-05-22 01:38:00] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17151122257292934841
Running compilation step : cd /tmp/ltsmin17151122257292934841;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 508 ms.
Running link step : cd /tmp/ltsmin17151122257292934841;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin17151122257292934841;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased9564329831322345635.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-22 01:38:15] [INFO ] Flatten gal took : 59 ms
[2024-05-22 01:38:15] [INFO ] Flatten gal took : 42 ms
[2024-05-22 01:38:15] [INFO ] Time to serialize gal into /tmp/LTL15034013129319704159.gal : 20 ms
[2024-05-22 01:38:15] [INFO ] Time to serialize properties into /tmp/LTL3383914200133432960.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15034013129319704159.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6053917902731359463.hoa' '-atoms' '/tmp/LTL3383914200133432960.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL3383914200133432960.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6053917902731359463.hoa
Detected timeout of ITS tools.
[2024-05-22 01:38:31] [INFO ] Flatten gal took : 21 ms
[2024-05-22 01:38:31] [INFO ] Flatten gal took : 32 ms
[2024-05-22 01:38:31] [INFO ] Time to serialize gal into /tmp/LTL15970253186055253795.gal : 10 ms
[2024-05-22 01:38:31] [INFO ] Time to serialize properties into /tmp/LTL5664551127957701252.ltl : 10 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15970253186055253795.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5664551127957701252.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F((X(X(F("((((p188==0)||(p244==0))||((p10==0)||(p272==0)))||(p274==0))"))))&&(G("((p199!=1)||(p244!=1))")))))
Formula 0 simplified : G(XXG!"((((p188==0)||(p244==0))||((p10==0)||(p272==0)))||(p274==0))" | F!"((p199!=1)||(p244!=1))")
Detected timeout of ITS tools.
[2024-05-22 01:38:46] [INFO ] Flatten gal took : 18 ms
[2024-05-22 01:38:46] [INFO ] Applying decomposition
[2024-05-22 01:38:46] [INFO ] Flatten gal took : 18 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph8971976921757381672.txt' '-o' '/tmp/graph8971976921757381672.bin' '-w' '/tmp/graph8971976921757381672.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph8971976921757381672.bin' '-l' '-1' '-v' '-w' '/tmp/graph8971976921757381672.weights' '-q' '0' '-e' '0.001'
[2024-05-22 01:38:46] [INFO ] Decomposing Gal with order
[2024-05-22 01:38:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 01:38:46] [INFO ] Removed a total of 14 redundant transitions.
[2024-05-22 01:38:46] [INFO ] Flatten gal took : 82 ms
[2024-05-22 01:38:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2024-05-22 01:38:46] [INFO ] Time to serialize gal into /tmp/LTL1270857947384058762.gal : 10 ms
[2024-05-22 01:38:46] [INFO ] Time to serialize properties into /tmp/LTL15737837782168189123.ltl : 8 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1270857947384058762.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15737837782168189123.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F((X(X(F("((((u2.p188==0)||(u2.p244==0))||((u13.p10==0)||(u13.p272==0)))||(u13.p274==0))"))))&&(G("((u2.p199!=1)||(u2.p244!=1))")))...157
Formula 0 simplified : G(XXG!"((((u2.p188==0)||(u2.p244==0))||((u13.p10==0)||(u13.p272==0)))||(u13.p274==0))" | F!"((u2.p199!=1)||(u2.p244!=1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6149918501443261397
[2024-05-22 01:39:01] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6149918501443261397
Running compilation step : cd /tmp/ltsmin6149918501443261397;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 478 ms.
Running link step : cd /tmp/ltsmin6149918501443261397;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin6149918501443261397;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>((X(X(<>((LTLAPp0==true))))&&[]((LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DES-PT-60a-LTLFireability-00 finished in 122026 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 3 out of 353 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 353/353 places, 297/297 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 351 transition count 295
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 351 transition count 295
Applied a total of 2 rules in 18 ms. Remains 351 /353 variables (removed 2) and now considering 295/297 (removed 2) transitions.
// Phase 1: matrix 295 rows 351 cols
[2024-05-22 01:39:16] [INFO ] Computed 58 invariants in 4 ms
[2024-05-22 01:39:17] [INFO ] Implicit Places using invariants in 297 ms returned []
[2024-05-22 01:39:17] [INFO ] Invariant cache hit.
[2024-05-22 01:39:17] [INFO ] Implicit Places using invariants and state equation in 396 ms returned []
Implicit Place search using SMT with State Equation took 725 ms to find 0 implicit places.
[2024-05-22 01:39:17] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-22 01:39:17] [INFO ] Invariant cache hit.
[2024-05-22 01:39:17] [INFO ] Dead Transitions using invariants and state equation in 141 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 351/353 places, 295/297 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 915 ms. Remains : 351/353 places, 295/297 transitions.
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-60a-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s9 0) (EQ s270 0) (EQ s272 0))], 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 2267 reset in 199 ms.
Product exploration explored 100000 steps with 2297 reset in 209 ms.
Computed a total of 254 stabilizing places and 249 stable transitions
Computed a total of 254 stabilizing places and 249 stable transitions
Detected a total of 254/351 stabilizing places and 249/295 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 155 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 222 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1522341 steps, run timeout after 3001 ms. (steps per millisecond=507 ) properties seen :{}
Probabilistic random walk after 1522341 steps, saw 211879 distinct states, run finished after 3001 ms. (steps per millisecond=507 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-22 01:39:21] [INFO ] Invariant cache hit.
[2024-05-22 01:39:21] [INFO ] After 71ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 01:39:21] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2024-05-22 01:39:21] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 25 ms returned sat
[2024-05-22 01:39:22] [INFO ] After 484ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 01:39:22] [INFO ] After 537ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 52 ms.
[2024-05-22 01:39:22] [INFO ] After 709ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 13 ms.
Support contains 3 out of 351 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 295/295 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 351 transition count 293
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 4 place count 351 transition count 293
Applied a total of 4 rules in 16 ms. Remains 351 /351 variables (removed 0) and now considering 293/295 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 351/351 places, 293/295 transitions.
Incomplete random walk after 10000 steps, including 159 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1510532 steps, run timeout after 3001 ms. (steps per millisecond=503 ) properties seen :{}
Probabilistic random walk after 1510532 steps, saw 212479 distinct states, run finished after 3001 ms. (steps per millisecond=503 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 293 rows 351 cols
[2024-05-22 01:39:25] [INFO ] Computed 60 invariants in 13 ms
[2024-05-22 01:39:25] [INFO ] After 66ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 01:39:25] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-22 01:39:25] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 156 ms returned sat
[2024-05-22 01:39:26] [INFO ] After 187ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 01:39:26] [INFO ] After 216ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 19 ms.
[2024-05-22 01:39:26] [INFO ] After 560ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 16 ms.
Support contains 3 out of 351 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 14 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 351/351 places, 293/293 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 7 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
[2024-05-22 01:39:26] [INFO ] Invariant cache hit.
[2024-05-22 01:39:26] [INFO ] Implicit Places using invariants in 164 ms returned []
[2024-05-22 01:39:26] [INFO ] Invariant cache hit.
[2024-05-22 01:39:26] [INFO ] Implicit Places using invariants and state equation in 359 ms returned []
Implicit Place search using SMT with State Equation took 545 ms to find 0 implicit places.
[2024-05-22 01:39:26] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-22 01:39:26] [INFO ] Invariant cache hit.
[2024-05-22 01:39:26] [INFO ] Dead Transitions using invariants and state equation in 157 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 744 ms. Remains : 351/351 places, 293/293 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 351 transition count 293
Applied a total of 1 rules in 14 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 293 rows 351 cols
[2024-05-22 01:39:26] [INFO ] Computed 60 invariants in 4 ms
[2024-05-22 01:39:27] [INFO ] After 110ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 01:39:27] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-22 01:39:27] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 155 ms returned sat
[2024-05-22 01:39:27] [INFO ] After 183ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 01:39:27] [INFO ] After 211ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2024-05-22 01:39:27] [INFO ] After 566ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 74 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Support contains 3 out of 351 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 351/351 places, 295/295 transitions.
Applied a total of 0 rules in 15 ms. Remains 351 /351 variables (removed 0) and now considering 295/295 (removed 0) transitions.
// Phase 1: matrix 295 rows 351 cols
[2024-05-22 01:39:27] [INFO ] Computed 58 invariants in 5 ms
[2024-05-22 01:39:28] [INFO ] Implicit Places using invariants in 209 ms returned []
[2024-05-22 01:39:28] [INFO ] Invariant cache hit.
[2024-05-22 01:39:28] [INFO ] Implicit Places using invariants and state equation in 363 ms returned []
Implicit Place search using SMT with State Equation took 601 ms to find 0 implicit places.
[2024-05-22 01:39:28] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-22 01:39:28] [INFO ] Invariant cache hit.
[2024-05-22 01:39:28] [INFO ] Dead Transitions using invariants and state equation in 146 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 781 ms. Remains : 351/351 places, 295/295 transitions.
Computed a total of 254 stabilizing places and 249 stable transitions
Computed a total of 254 stabilizing places and 249 stable transitions
Detected a total of 254/351 stabilizing places and 249/295 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 94 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 224 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1522691 steps, run timeout after 3001 ms. (steps per millisecond=507 ) properties seen :{}
Probabilistic random walk after 1522691 steps, saw 211925 distinct states, run finished after 3001 ms. (steps per millisecond=507 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-22 01:39:31] [INFO ] Invariant cache hit.
[2024-05-22 01:39:31] [INFO ] After 77ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 01:39:31] [INFO ] [Nat]Absence check using 33 positive place invariants in 3 ms returned sat
[2024-05-22 01:39:32] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 24 ms returned sat
[2024-05-22 01:39:32] [INFO ] After 490ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 01:39:32] [INFO ] After 545ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 26 ms.
[2024-05-22 01:39:32] [INFO ] After 704ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 13 ms.
Support contains 3 out of 351 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 295/295 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 351 transition count 293
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 4 place count 351 transition count 293
Applied a total of 4 rules in 13 ms. Remains 351 /351 variables (removed 0) and now considering 293/295 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 351/351 places, 293/295 transitions.
Incomplete random walk after 10000 steps, including 178 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1507112 steps, run timeout after 3001 ms. (steps per millisecond=502 ) properties seen :{}
Probabilistic random walk after 1507112 steps, saw 212028 distinct states, run finished after 3001 ms. (steps per millisecond=502 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 293 rows 351 cols
[2024-05-22 01:39:35] [INFO ] Computed 60 invariants in 14 ms
[2024-05-22 01:39:35] [INFO ] After 75ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 01:39:35] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-22 01:39:36] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 163 ms returned sat
[2024-05-22 01:39:36] [INFO ] After 181ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 01:39:36] [INFO ] After 212ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 22 ms.
[2024-05-22 01:39:36] [INFO ] After 573ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 13 ms.
Support contains 3 out of 351 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 7 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 351/351 places, 293/293 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 6 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
[2024-05-22 01:39:36] [INFO ] Invariant cache hit.
[2024-05-22 01:39:36] [INFO ] Implicit Places using invariants in 252 ms returned []
[2024-05-22 01:39:36] [INFO ] Invariant cache hit.
[2024-05-22 01:39:37] [INFO ] Implicit Places using invariants and state equation in 395 ms returned []
Implicit Place search using SMT with State Equation took 673 ms to find 0 implicit places.
[2024-05-22 01:39:37] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-22 01:39:37] [INFO ] Invariant cache hit.
[2024-05-22 01:39:37] [INFO ] Dead Transitions using invariants and state equation in 150 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 838 ms. Remains : 351/351 places, 293/293 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 351 transition count 293
Applied a total of 1 rules in 12 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 293 rows 351 cols
[2024-05-22 01:39:37] [INFO ] Computed 60 invariants in 4 ms
[2024-05-22 01:39:37] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 01:39:37] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-22 01:39:37] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 151 ms returned sat
[2024-05-22 01:39:37] [INFO ] After 188ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 01:39:37] [INFO ] After 220ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 19 ms.
[2024-05-22 01:39:37] [INFO ] After 543ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 76 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2314 reset in 217 ms.
Product exploration explored 100000 steps with 2211 reset in 237 ms.
Built C files in :
/tmp/ltsmin16190919527669285245
[2024-05-22 01:39:38] [INFO ] Computing symmetric may disable matrix : 295 transitions.
[2024-05-22 01:39:38] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:39:38] [INFO ] Computing symmetric may enable matrix : 295 transitions.
[2024-05-22 01:39:38] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:39:38] [INFO ] Computing Do-Not-Accords matrix : 295 transitions.
[2024-05-22 01:39:38] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:39:38] [INFO ] Built C files in 43ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16190919527669285245
Running compilation step : cd /tmp/ltsmin16190919527669285245;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 634 ms.
Running link step : cd /tmp/ltsmin16190919527669285245;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin16190919527669285245;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8650247398845433570.hoa' '--buchi-type=spotba'
LTSmin run took 12746 ms.
FORMULA DES-PT-60a-LTLFireability-01 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DES-PT-60a-LTLFireability-01 finished in 35133 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 353 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 353/353 places, 297/297 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 352 transition count 296
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 352 transition count 296
Applied a total of 2 rules in 11 ms. Remains 352 /353 variables (removed 1) and now considering 296/297 (removed 1) transitions.
// Phase 1: matrix 296 rows 352 cols
[2024-05-22 01:39:52] [INFO ] Computed 58 invariants in 5 ms
[2024-05-22 01:39:52] [INFO ] Implicit Places using invariants in 216 ms returned []
[2024-05-22 01:39:52] [INFO ] Invariant cache hit.
[2024-05-22 01:39:52] [INFO ] Implicit Places using invariants and state equation in 395 ms returned []
Implicit Place search using SMT with State Equation took 622 ms to find 0 implicit places.
[2024-05-22 01:39:52] [INFO ] Invariant cache hit.
[2024-05-22 01:39:52] [INFO ] Dead Transitions using invariants and state equation in 153 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 352/353 places, 296/297 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 798 ms. Remains : 352/353 places, 296/297 transitions.
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-60a-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (EQ s176 1) (EQ s268 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 58 steps with 0 reset in 1 ms.
FORMULA DES-PT-60a-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-60a-LTLFireability-04 finished in 903 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(((p1 U (p2||G(p1)))||p0))))'
Support contains 6 out of 353 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 353/353 places, 297/297 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 352 transition count 296
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 352 transition count 296
Applied a total of 2 rules in 9 ms. Remains 352 /353 variables (removed 1) and now considering 296/297 (removed 1) transitions.
[2024-05-22 01:39:53] [INFO ] Invariant cache hit.
[2024-05-22 01:39:53] [INFO ] Implicit Places using invariants in 193 ms returned []
[2024-05-22 01:39:53] [INFO ] Invariant cache hit.
[2024-05-22 01:39:53] [INFO ] Implicit Places using invariants and state equation in 385 ms returned []
Implicit Place search using SMT with State Equation took 624 ms to find 0 implicit places.
[2024-05-22 01:39:53] [INFO ] Invariant cache hit.
[2024-05-22 01:39:53] [INFO ] Dead Transitions using invariants and state equation in 151 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 352/353 places, 296/297 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 807 ms. Remains : 352/353 places, 296/297 transitions.
Stuttering acceptance computed with spot in 136 ms :[true, (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0))]
Running random walk in product with property : DES-PT-60a-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 2}, { cond=p2, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=3 dest: 2}, { cond=(OR p0 p2), acceptance={} source=3 dest: 3}]], initial=1, aps=[p2:(AND (NOT (AND (EQ s155 1) (EQ s268 1))) (EQ s36 1) (EQ s271 1) (EQ s273 1)), p1:(AND (EQ s36 1) (EQ s271 1) (EQ s273 1)), p0:(OR (EQ s160 0) (EQ s268 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 2233 reset in 247 ms.
Product exploration explored 100000 steps with 2238 reset in 269 ms.
Computed a total of 255 stabilizing places and 250 stable transitions
Computed a total of 255 stabilizing places and 250 stable transitions
Detected a total of 255/352 stabilizing places and 250/296 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (OR p0 p2)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT p2))), true, (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (OR p0 p2))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND (NOT p2) (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 14 factoid took 1000 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[true, (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 207 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 55 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 49 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 51 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 51 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 729257 steps, run timeout after 3001 ms. (steps per millisecond=243 ) properties seen :{}
Probabilistic random walk after 729257 steps, saw 111508 distinct states, run finished after 3003 ms. (steps per millisecond=242 ) properties seen :0
Running SMT prover for 6 properties.
[2024-05-22 01:39:58] [INFO ] Invariant cache hit.
[2024-05-22 01:39:59] [INFO ] [Real]Absence check using 33 positive place invariants in 5 ms returned sat
[2024-05-22 01:39:59] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 14 ms returned sat
[2024-05-22 01:39:59] [INFO ] After 191ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-22 01:39:59] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2024-05-22 01:39:59] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 14 ms returned sat
[2024-05-22 01:40:00] [INFO ] After 841ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :5
[2024-05-22 01:40:00] [INFO ] After 1218ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :5
Attempting to minimize the solution found.
Minimization took 270 ms.
[2024-05-22 01:40:00] [INFO ] After 1682ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :5
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 2 properties in 64 ms.
Support contains 6 out of 352 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 296/296 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 352 transition count 294
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 7 place count 352 transition count 294
Applied a total of 7 rules in 14 ms. Remains 352 /352 variables (removed 0) and now considering 294/296 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 352/352 places, 294/296 transitions.
Incomplete random walk after 10000 steps, including 133 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 841986 steps, run timeout after 3011 ms. (steps per millisecond=279 ) properties seen :{}
Probabilistic random walk after 841986 steps, saw 119952 distinct states, run finished after 3012 ms. (steps per millisecond=279 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 294 rows 352 cols
[2024-05-22 01:40:04] [INFO ] Computed 60 invariants in 3 ms
[2024-05-22 01:40:04] [INFO ] [Real]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-22 01:40:04] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 17 ms returned sat
[2024-05-22 01:40:04] [INFO ] After 126ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-22 01:40:04] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-22 01:40:04] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 153 ms returned sat
[2024-05-22 01:40:27] [INFO ] After 23229ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-22 01:40:27] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 01:40:28] [INFO ] After 547ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-22 01:40:29] [INFO ] After 1531ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 0 ms.
[2024-05-22 01:40:29] [INFO ] After 25019ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 14 ms.
Support contains 6 out of 352 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 294/294 transitions.
Applied a total of 0 rules in 7 ms. Remains 352 /352 variables (removed 0) and now considering 294/294 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 352/352 places, 294/294 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 294/294 transitions.
Applied a total of 0 rules in 6 ms. Remains 352 /352 variables (removed 0) and now considering 294/294 (removed 0) transitions.
[2024-05-22 01:40:29] [INFO ] Invariant cache hit.
[2024-05-22 01:40:29] [INFO ] Implicit Places using invariants in 184 ms returned []
[2024-05-22 01:40:29] [INFO ] Invariant cache hit.
[2024-05-22 01:40:29] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 01:40:29] [INFO ] Implicit Places using invariants and state equation in 515 ms returned []
Implicit Place search using SMT with State Equation took 702 ms to find 0 implicit places.
[2024-05-22 01:40:29] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-22 01:40:29] [INFO ] Invariant cache hit.
[2024-05-22 01:40:30] [INFO ] Dead Transitions using invariants and state equation in 157 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 880 ms. Remains : 352/352 places, 294/294 transitions.
Applied a total of 0 rules in 6 ms. Remains 352 /352 variables (removed 0) and now considering 294/294 (removed 0) transitions.
Running SMT prover for 3 properties.
[2024-05-22 01:40:30] [INFO ] Invariant cache hit.
[2024-05-22 01:40:30] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-22 01:40:30] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 15 ms returned sat
[2024-05-22 01:40:30] [INFO ] After 92ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-22 01:40:30] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-22 01:40:30] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 68 ms returned sat
[2024-05-22 01:40:30] [INFO ] After 312ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-22 01:40:30] [INFO ] After 469ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 127 ms.
[2024-05-22 01:40:31] [INFO ] After 789ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (OR p0 p2)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT p2))), true, (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (OR p0 p2))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND (NOT p2) (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND (NOT p0) (NOT p2) p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p2) (NOT p1)))), (F p2)]
Knowledge based reduction with 15 factoid took 1878 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 46 ms :[true, (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 40 ms :[true, (AND (NOT p0) (NOT p2))]
Support contains 6 out of 352 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 352/352 places, 296/296 transitions.
Applied a total of 0 rules in 18 ms. Remains 352 /352 variables (removed 0) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 352 cols
[2024-05-22 01:40:33] [INFO ] Computed 58 invariants in 3 ms
[2024-05-22 01:40:33] [INFO ] Implicit Places using invariants in 271 ms returned []
[2024-05-22 01:40:33] [INFO ] Invariant cache hit.
[2024-05-22 01:40:33] [INFO ] Implicit Places using invariants and state equation in 375 ms returned []
Implicit Place search using SMT with State Equation took 661 ms to find 0 implicit places.
[2024-05-22 01:40:33] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-22 01:40:33] [INFO ] Invariant cache hit.
[2024-05-22 01:40:33] [INFO ] Dead Transitions using invariants and state equation in 144 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 843 ms. Remains : 352/352 places, 296/296 transitions.
Computed a total of 255 stabilizing places and 250 stable transitions
Computed a total of 255 stabilizing places and 250 stable transitions
Detected a total of 255/352 stabilizing places and 250/296 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (OR p0 p2)), true, (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (OR p0 p2))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 127 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[true, (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 226 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 50 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 51 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 949482 steps, run timeout after 3001 ms. (steps per millisecond=316 ) properties seen :{}
Probabilistic random walk after 949482 steps, saw 137110 distinct states, run finished after 3001 ms. (steps per millisecond=316 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-22 01:40:37] [INFO ] Invariant cache hit.
[2024-05-22 01:40:37] [INFO ] After 66ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-22 01:40:37] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2024-05-22 01:40:37] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 65 ms returned sat
[2024-05-22 01:40:38] [INFO ] After 647ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-22 01:40:38] [INFO ] After 957ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 197 ms.
[2024-05-22 01:40:38] [INFO ] After 1361ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 135 ms.
Support contains 6 out of 352 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 296/296 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 352 transition count 294
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 7 place count 352 transition count 294
Applied a total of 7 rules in 12 ms. Remains 352 /352 variables (removed 0) and now considering 294/296 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 352/352 places, 294/296 transitions.
Incomplete random walk after 10000 steps, including 133 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 21 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 930235 steps, run timeout after 3001 ms. (steps per millisecond=309 ) properties seen :{}
Probabilistic random walk after 930235 steps, saw 132334 distinct states, run finished after 3001 ms. (steps per millisecond=309 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 294 rows 352 cols
[2024-05-22 01:40:41] [INFO ] Computed 60 invariants in 4 ms
[2024-05-22 01:40:41] [INFO ] After 64ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-22 01:40:42] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-22 01:40:42] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 16 ms returned sat
[2024-05-22 01:40:42] [INFO ] After 259ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-22 01:40:42] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 01:40:42] [INFO ] After 134ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-22 01:40:42] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 0 ms to minimize.
[2024-05-22 01:40:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 104 ms
[2024-05-22 01:40:42] [INFO ] After 352ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 124 ms.
[2024-05-22 01:40:42] [INFO ] After 845ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 642 steps, including 0 resets, run visited all 2 properties in 10 ms. (steps per millisecond=64 )
Parikh walk visited 2 properties in 18 ms.
Knowledge obtained : [(AND p0 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (OR p0 p2)), true, (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (OR p0 p2))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p2))), (F (NOT (OR p0 p2)))]
Property proved to be false thanks to negative knowledge :(F (AND (NOT p0) (NOT p2)))
Knowledge based reduction with 8 factoid took 254 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA DES-PT-60a-LTLFireability-06 FALSE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-60a-LTLFireability-06 finished in 50125 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X(p0)||(p0 U (p1 U X(!p2)))))))'
Support contains 8 out of 353 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 353/353 places, 297/297 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 352 transition count 296
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 352 transition count 296
Applied a total of 2 rules in 13 ms. Remains 352 /353 variables (removed 1) and now considering 296/297 (removed 1) transitions.
// Phase 1: matrix 296 rows 352 cols
[2024-05-22 01:40:43] [INFO ] Computed 58 invariants in 3 ms
[2024-05-22 01:40:43] [INFO ] Implicit Places using invariants in 181 ms returned []
[2024-05-22 01:40:43] [INFO ] Invariant cache hit.
[2024-05-22 01:40:43] [INFO ] Implicit Places using invariants and state equation in 385 ms returned []
Implicit Place search using SMT with State Equation took 586 ms to find 0 implicit places.
[2024-05-22 01:40:43] [INFO ] Invariant cache hit.
[2024-05-22 01:40:43] [INFO ] Dead Transitions using invariants and state equation in 158 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 352/353 places, 296/297 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 777 ms. Remains : 352/353 places, 296/297 transitions.
Stuttering acceptance computed with spot in 187 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), false]
Running random walk in product with property : DES-PT-60a-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 1}, { cond=(OR p1 p0), acceptance={0} source=0 dest: 2}], [{ cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0) p2), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0) p2), acceptance={0} source=2 dest: 1}, { cond=(AND p1 (NOT p0) p2), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=2 dest: 4}], [{ cond=p2, acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={0} source=3 dest: 1}, { cond=(OR (AND p1 p2) (AND p0 p2)), acceptance={0} source=3 dest: 2}], [{ cond=(AND p0 p2), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=4 dest: 3}, { cond=(AND p1 p0 p2), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(AND (EQ s221 1) (EQ s244 1)), p0:(AND (EQ s260 1) (EQ s265 1) (EQ s267 1)), p2:(AND (EQ s8 1) (EQ s271 1) (EQ s273 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33534 reset in 399 ms.
Product exploration explored 100000 steps with 33154 reset in 456 ms.
Computed a total of 255 stabilizing places and 250 stable transitions
Computed a total of 255 stabilizing places and 250 stable transitions
Detected a total of 255/352 stabilizing places and 250/296 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND p1 (NOT p0) p2))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (X (NOT p2))), true, (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT (OR p1 p0)))), (X (X (NOT (AND p1 p0 p2)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (OR (AND p1 p2) (AND p0 p2))))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 16 factoid took 329 ms. Reduced automaton from 5 states, 16 edges and 3 AP (stutter sensitive) to 9 states, 30 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 464 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), false, false, false, false, false, false]
Incomplete random walk after 10000 steps, including 218 resets, run finished after 195 ms. (steps per millisecond=51 ) properties (out of 8) seen :2
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 62 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2024-05-22 01:40:46] [INFO ] Invariant cache hit.
[2024-05-22 01:40:46] [INFO ] [Real]Absence check using 33 positive place invariants in 5 ms returned sat
[2024-05-22 01:40:46] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 15 ms returned sat
[2024-05-22 01:40:46] [INFO ] After 146ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-22 01:40:46] [INFO ] [Nat]Absence check using 33 positive place invariants in 5 ms returned sat
[2024-05-22 01:40:46] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 15 ms returned sat
[2024-05-22 01:40:47] [INFO ] After 667ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :4
[2024-05-22 01:40:47] [INFO ] After 1002ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :4
Attempting to minimize the solution found.
Minimization took 283 ms.
[2024-05-22 01:40:47] [INFO ] After 1518ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :4
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 264 ms.
Support contains 8 out of 352 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 296/296 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 352 transition count 294
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 7 place count 352 transition count 294
Applied a total of 7 rules in 12 ms. Remains 352 /352 variables (removed 0) and now considering 294/296 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 352/352 places, 294/296 transitions.
Incomplete random walk after 10000 steps, including 133 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 823363 steps, run timeout after 3011 ms. (steps per millisecond=273 ) properties seen :{}
Probabilistic random walk after 823363 steps, saw 117294 distinct states, run finished after 3011 ms. (steps per millisecond=273 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 294 rows 352 cols
[2024-05-22 01:40:51] [INFO ] Computed 60 invariants in 3 ms
[2024-05-22 01:40:51] [INFO ] [Real]Absence check using 36 positive place invariants in 8 ms returned sat
[2024-05-22 01:40:51] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 15 ms returned sat
[2024-05-22 01:40:51] [INFO ] After 180ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-22 01:40:51] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-22 01:40:51] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 152 ms returned sat
[2024-05-22 01:41:08] [INFO ] After 16401ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-22 01:41:08] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-22 01:41:09] [INFO ] After 916ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-22 01:41:09] [INFO ] After 1524ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 601 ms.
[2024-05-22 01:41:10] [INFO ] After 18804ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 445 ms.
Support contains 8 out of 352 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 294/294 transitions.
Applied a total of 0 rules in 6 ms. Remains 352 /352 variables (removed 0) and now considering 294/294 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 352/352 places, 294/294 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 294/294 transitions.
Applied a total of 0 rules in 6 ms. Remains 352 /352 variables (removed 0) and now considering 294/294 (removed 0) transitions.
[2024-05-22 01:41:10] [INFO ] Invariant cache hit.
[2024-05-22 01:41:10] [INFO ] Implicit Places using invariants in 189 ms returned []
[2024-05-22 01:41:10] [INFO ] Invariant cache hit.
[2024-05-22 01:41:11] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-22 01:41:11] [INFO ] Implicit Places using invariants and state equation in 486 ms returned []
Implicit Place search using SMT with State Equation took 701 ms to find 0 implicit places.
[2024-05-22 01:41:11] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-22 01:41:11] [INFO ] Invariant cache hit.
[2024-05-22 01:41:11] [INFO ] Dead Transitions using invariants and state equation in 148 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 891 ms. Remains : 352/352 places, 294/294 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 352 transition count 294
Applied a total of 1 rules in 12 ms. Remains 352 /352 variables (removed 0) and now considering 294/294 (removed 0) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 294 rows 352 cols
[2024-05-22 01:41:11] [INFO ] Computed 60 invariants in 8 ms
[2024-05-22 01:41:11] [INFO ] [Real]Absence check using 36 positive place invariants in 8 ms returned sat
[2024-05-22 01:41:11] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 25 ms returned sat
[2024-05-22 01:41:11] [INFO ] After 179ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-22 01:41:11] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-22 01:41:12] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 161 ms returned sat
[2024-05-22 01:41:22] [INFO ] After 10623ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-22 01:41:23] [INFO ] After 11536ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 703 ms.
[2024-05-22 01:41:24] [INFO ] After 12506ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND p1 (NOT p0) p2))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (X (NOT p2))), true, (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT (OR p1 p0)))), (X (X (NOT (AND p1 p0 p2)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (OR (AND p1 p2) (AND p0 p2))))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (F (OR (G p2) (G (NOT p2)))), (G (NOT (AND (NOT p0) p2 p1))), (G (NOT (AND p0 p2 p1)))]
False Knowledge obtained : [(F (OR p0 p1)), (F (NOT (AND (NOT p0) (NOT p2) (NOT p1))))]
Knowledge based reduction with 18 factoid took 514 ms. Reduced automaton from 9 states, 30 edges and 3 AP (stutter insensitive) to 5 states, 16 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 174 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), false, false]
Stuttering acceptance computed with spot in 246 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), false, false]
Support contains 8 out of 352 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 352/352 places, 296/296 transitions.
Applied a total of 0 rules in 14 ms. Remains 352 /352 variables (removed 0) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 352 cols
[2024-05-22 01:41:25] [INFO ] Computed 58 invariants in 3 ms
[2024-05-22 01:41:25] [INFO ] Implicit Places using invariants in 203 ms returned []
[2024-05-22 01:41:25] [INFO ] Invariant cache hit.
[2024-05-22 01:41:25] [INFO ] Implicit Places using invariants and state equation in 373 ms returned []
Implicit Place search using SMT with State Equation took 614 ms to find 0 implicit places.
[2024-05-22 01:41:25] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-22 01:41:26] [INFO ] Invariant cache hit.
[2024-05-22 01:41:26] [INFO ] Dead Transitions using invariants and state equation in 186 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 836 ms. Remains : 352/352 places, 296/296 transitions.
Computed a total of 255 stabilizing places and 250 stable transitions
Computed a total of 255 stabilizing places and 250 stable transitions
Detected a total of 255/352 stabilizing places and 250/296 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT (OR p0 p1))), (X (NOT (AND (NOT p0) p2 p1))), (X (OR p0 (NOT p2))), (X (AND (NOT p0) (NOT p2) (NOT p1))), (X (NOT (AND p0 p2))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT (AND (NOT p0) p2))), (X (X (NOT (OR p0 p1)))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (OR p0 (NOT p2)))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) p2)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 249 ms. Reduced automaton from 5 states, 16 edges and 3 AP (stutter insensitive) to 5 states, 16 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 156 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), false, false]
Incomplete random walk after 10000 steps, including 225 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 7) seen :2
Incomplete Best-First random walk after 10000 steps, including 48 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 53 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 64 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 51 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2024-05-22 01:41:26] [INFO ] Invariant cache hit.
[2024-05-22 01:41:26] [INFO ] [Real]Absence check using 33 positive place invariants in 4 ms returned sat
[2024-05-22 01:41:26] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 15 ms returned sat
[2024-05-22 01:41:26] [INFO ] After 108ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-22 01:41:27] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2024-05-22 01:41:27] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 16 ms returned sat
[2024-05-22 01:41:30] [INFO ] After 3412ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :4
[2024-05-22 01:41:31] [INFO ] After 4423ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :4
Attempting to minimize the solution found.
Minimization took 1215 ms.
[2024-05-22 01:41:32] [INFO ] After 5836ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :4
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 2 properties in 100 ms.
Support contains 8 out of 352 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 296/296 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 352 transition count 294
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 7 place count 352 transition count 294
Applied a total of 7 rules in 17 ms. Remains 352 /352 variables (removed 0) and now considering 294/296 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 352/352 places, 294/296 transitions.
Incomplete random walk after 10000 steps, including 138 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 924647 steps, run timeout after 3001 ms. (steps per millisecond=308 ) properties seen :{}
Probabilistic random walk after 924647 steps, saw 131590 distinct states, run finished after 3001 ms. (steps per millisecond=308 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 294 rows 352 cols
[2024-05-22 01:41:36] [INFO ] Computed 60 invariants in 8 ms
[2024-05-22 01:41:36] [INFO ] [Real]Absence check using 36 positive place invariants in 4 ms returned sat
[2024-05-22 01:41:36] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 14 ms returned sat
[2024-05-22 01:41:36] [INFO ] After 124ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-22 01:41:36] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2024-05-22 01:41:36] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 156 ms returned sat
[2024-05-22 01:41:39] [INFO ] After 2783ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-22 01:41:39] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-22 01:41:39] [INFO ] After 147ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-22 01:41:39] [INFO ] After 316ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 138 ms.
[2024-05-22 01:41:39] [INFO ] After 3508ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 4413 steps, including 19 resets, run visited all 2 properties in 48 ms. (steps per millisecond=91 )
Parikh walk visited 2 properties in 47 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT (OR p0 p1))), (X (NOT (AND (NOT p0) p2 p1))), (X (OR p0 (NOT p2))), (X (AND (NOT p0) (NOT p2) (NOT p1))), (X (NOT (AND p0 p2))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT (AND (NOT p0) p2))), (X (X (NOT (OR p0 p1)))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (OR p0 (NOT p2)))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) p2)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (AND (NOT p0) p2 p1)), (F (OR p0 p1)), (F (AND p0 p2)), (F (AND (NOT p0) p2 (NOT p1))), (F (NOT (OR p0 (NOT p2)))), (F (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (F (AND (NOT p0) p2))]
Knowledge based reduction with 16 factoid took 614 ms. Reduced automaton from 5 states, 16 edges and 3 AP (stutter insensitive) to 5 states, 16 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 178 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), false, false]
Stuttering acceptance computed with spot in 178 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), false, false]
Stuttering acceptance computed with spot in 167 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), false, false]
Product exploration explored 100000 steps with 33411 reset in 445 ms.
Product exploration explored 100000 steps with 33447 reset in 442 ms.
Built C files in :
/tmp/ltsmin5138543938255170467
[2024-05-22 01:41:41] [INFO ] Computing symmetric may disable matrix : 296 transitions.
[2024-05-22 01:41:41] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:41:41] [INFO ] Computing symmetric may enable matrix : 296 transitions.
[2024-05-22 01:41:41] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:41:41] [INFO ] Computing Do-Not-Accords matrix : 296 transitions.
[2024-05-22 01:41:41] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:41:41] [INFO ] Built C files in 38ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5138543938255170467
Running compilation step : cd /tmp/ltsmin5138543938255170467;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 657 ms.
Running link step : cd /tmp/ltsmin5138543938255170467;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin5138543938255170467;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12816600464687416876.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 8 out of 352 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 352/352 places, 296/296 transitions.
Applied a total of 0 rules in 13 ms. Remains 352 /352 variables (removed 0) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 352 cols
[2024-05-22 01:41:56] [INFO ] Computed 58 invariants in 3 ms
[2024-05-22 01:41:57] [INFO ] Implicit Places using invariants in 383 ms returned []
[2024-05-22 01:41:57] [INFO ] Invariant cache hit.
[2024-05-22 01:41:57] [INFO ] Implicit Places using invariants and state equation in 374 ms returned []
Implicit Place search using SMT with State Equation took 794 ms to find 0 implicit places.
[2024-05-22 01:41:57] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-22 01:41:57] [INFO ] Invariant cache hit.
[2024-05-22 01:41:57] [INFO ] Dead Transitions using invariants and state equation in 152 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 990 ms. Remains : 352/352 places, 296/296 transitions.
Built C files in :
/tmp/ltsmin15226956007467373516
[2024-05-22 01:41:57] [INFO ] Computing symmetric may disable matrix : 296 transitions.
[2024-05-22 01:41:57] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:41:57] [INFO ] Computing symmetric may enable matrix : 296 transitions.
[2024-05-22 01:41:57] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:41:57] [INFO ] Computing Do-Not-Accords matrix : 296 transitions.
[2024-05-22 01:41:57] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:41:57] [INFO ] Built C files in 41ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15226956007467373516
Running compilation step : cd /tmp/ltsmin15226956007467373516;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 657 ms.
Running link step : cd /tmp/ltsmin15226956007467373516;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin15226956007467373516;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased18119369593346977776.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-22 01:42:13] [INFO ] Flatten gal took : 19 ms
[2024-05-22 01:42:13] [INFO ] Flatten gal took : 16 ms
[2024-05-22 01:42:13] [INFO ] Time to serialize gal into /tmp/LTL8808606906740425736.gal : 3 ms
[2024-05-22 01:42:13] [INFO ] Time to serialize properties into /tmp/LTL11395154214464156583.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8808606906740425736.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13126183435121775713.hoa' '-atoms' '/tmp/LTL11395154214464156583.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL11395154214464156583.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13126183435121775713.hoa
Detected timeout of ITS tools.
[2024-05-22 01:42:28] [INFO ] Flatten gal took : 20 ms
[2024-05-22 01:42:28] [INFO ] Flatten gal took : 14 ms
[2024-05-22 01:42:28] [INFO ] Time to serialize gal into /tmp/LTL13206285986898373775.gal : 2 ms
[2024-05-22 01:42:28] [INFO ] Time to serialize properties into /tmp/LTL7701648200979739699.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13206285986898373775.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7701648200979739699.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G((X("(((p261==1)&&(p266==1))&&(p268==1))"))||(("(((p261==1)&&(p266==1))&&(p268==1))")U(("((p221==1)&&(p244==1))")U(X(!("(((p8==1...190
Formula 0 simplified : GF(X!"(((p261==1)&&(p266==1))&&(p268==1))" & (!"(((p261==1)&&(p266==1))&&(p268==1))" R (!"((p221==1)&&(p244==1))" R X"(((p8==1)&&(p2...178
Detected timeout of ITS tools.
[2024-05-22 01:42:43] [INFO ] Flatten gal took : 20 ms
[2024-05-22 01:42:43] [INFO ] Applying decomposition
[2024-05-22 01:42:43] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph16375882398105890144.txt' '-o' '/tmp/graph16375882398105890144.bin' '-w' '/tmp/graph16375882398105890144.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph16375882398105890144.bin' '-l' '-1' '-v' '-w' '/tmp/graph16375882398105890144.weights' '-q' '0' '-e' '0.001'
[2024-05-22 01:42:43] [INFO ] Decomposing Gal with order
[2024-05-22 01:42:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 01:42:43] [INFO ] Removed a total of 62 redundant transitions.
[2024-05-22 01:42:43] [INFO ] Flatten gal took : 34 ms
[2024-05-22 01:42:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 48 labels/synchronizations in 5 ms.
[2024-05-22 01:42:43] [INFO ] Time to serialize gal into /tmp/LTL15175135288690612870.gal : 3 ms
[2024-05-22 01:42:43] [INFO ] Time to serialize properties into /tmp/LTL8320192534111208549.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15175135288690612870.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8320192534111208549.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F(G((X("(((i1.i0.u7.p261==1)&&(i1.i1.u11.p266==1))&&(i1.i1.u12.p268==1))"))||(("(((i1.i0.u7.p261==1)&&(i1.i1.u11.p266==1))&&(i1.i1....275
Formula 0 simplified : GF(X!"(((i1.i0.u7.p261==1)&&(i1.i1.u11.p266==1))&&(i1.i1.u12.p268==1))" & (!"(((i1.i0.u7.p261==1)&&(i1.i1.u11.p266==1))&&(i1.i1.u12....263
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2509641781549045399
[2024-05-22 01:42:58] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2509641781549045399
Running compilation step : cd /tmp/ltsmin2509641781549045399;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 491 ms.
Running link step : cd /tmp/ltsmin2509641781549045399;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin2509641781549045399;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([]((X((LTLAPp0==true))||((LTLAPp0==true) U ((LTLAPp1==true) U X(!(LTLAPp2==true)))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DES-PT-60a-LTLFireability-07 finished in 150460 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((F(G(p0))&&(X(p2)||p1)))))'
Support contains 4 out of 353 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 353/353 places, 297/297 transitions.
Applied a total of 0 rules in 6 ms. Remains 353 /353 variables (removed 0) and now considering 297/297 (removed 0) transitions.
// Phase 1: matrix 297 rows 353 cols
[2024-05-22 01:43:13] [INFO ] Computed 58 invariants in 3 ms
[2024-05-22 01:43:13] [INFO ] Implicit Places using invariants in 293 ms returned []
[2024-05-22 01:43:13] [INFO ] Invariant cache hit.
[2024-05-22 01:43:14] [INFO ] Implicit Places using invariants and state equation in 531 ms returned []
Implicit Place search using SMT with State Equation took 835 ms to find 0 implicit places.
[2024-05-22 01:43:14] [INFO ] Invariant cache hit.
[2024-05-22 01:43:14] [INFO ] Dead Transitions using invariants and state equation in 192 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1034 ms. Remains : 353/353 places, 297/297 transitions.
Stuttering acceptance computed with spot in 163 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : DES-PT-60a-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(OR (EQ s224 0) (EQ s244 0)), p0:(OR (EQ s276 0) (EQ s346 0)), p2:(OR (EQ s224 0) (EQ s244 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 2238 reset in 205 ms.
Product exploration explored 100000 steps with 2233 reset in 228 ms.
Computed a total of 256 stabilizing places and 251 stable transitions
Computed a total of 256 stabilizing places and 251 stable transitions
Knowledge obtained : [(AND p1 p0 p2), (X p1), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 71 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Finished random walk after 16 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=16 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p0 p2), (X p1), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 94 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Support contains 2 out of 353 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 353/353 places, 297/297 transitions.
Applied a total of 0 rules in 11 ms. Remains 353 /353 variables (removed 0) and now considering 297/297 (removed 0) transitions.
[2024-05-22 01:43:15] [INFO ] Invariant cache hit.
[2024-05-22 01:43:15] [INFO ] Implicit Places using invariants in 290 ms returned []
[2024-05-22 01:43:15] [INFO ] Invariant cache hit.
[2024-05-22 01:43:16] [INFO ] Implicit Places using invariants and state equation in 549 ms returned []
Implicit Place search using SMT with State Equation took 841 ms to find 0 implicit places.
[2024-05-22 01:43:16] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-22 01:43:16] [INFO ] Invariant cache hit.
[2024-05-22 01:43:16] [INFO ] Dead Transitions using invariants and state equation in 216 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1074 ms. Remains : 353/353 places, 297/297 transitions.
Computed a total of 256 stabilizing places and 251 stable transitions
Computed a total of 256 stabilizing places and 251 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 89 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Finished random walk after 14 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=14 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 89 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Product exploration explored 100000 steps with 2250 reset in 208 ms.
Product exploration explored 100000 steps with 2232 reset in 227 ms.
Built C files in :
/tmp/ltsmin6876425884722451398
[2024-05-22 01:43:17] [INFO ] Computing symmetric may disable matrix : 297 transitions.
[2024-05-22 01:43:17] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:43:17] [INFO ] Computing symmetric may enable matrix : 297 transitions.
[2024-05-22 01:43:17] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:43:17] [INFO ] Computing Do-Not-Accords matrix : 297 transitions.
[2024-05-22 01:43:17] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:43:17] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6876425884722451398
Running compilation step : cd /tmp/ltsmin6876425884722451398;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 668 ms.
Running link step : cd /tmp/ltsmin6876425884722451398;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin6876425884722451398;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11457338654902845271.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 353 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 353/353 places, 297/297 transitions.
Applied a total of 0 rules in 16 ms. Remains 353 /353 variables (removed 0) and now considering 297/297 (removed 0) transitions.
[2024-05-22 01:43:32] [INFO ] Invariant cache hit.
[2024-05-22 01:43:32] [INFO ] Implicit Places using invariants in 310 ms returned []
[2024-05-22 01:43:32] [INFO ] Invariant cache hit.
[2024-05-22 01:43:33] [INFO ] Implicit Places using invariants and state equation in 740 ms returned []
Implicit Place search using SMT with State Equation took 1051 ms to find 0 implicit places.
[2024-05-22 01:43:33] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-22 01:43:33] [INFO ] Invariant cache hit.
[2024-05-22 01:43:33] [INFO ] Dead Transitions using invariants and state equation in 204 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1284 ms. Remains : 353/353 places, 297/297 transitions.
Built C files in :
/tmp/ltsmin264577197927491040
[2024-05-22 01:43:33] [INFO ] Computing symmetric may disable matrix : 297 transitions.
[2024-05-22 01:43:33] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:43:33] [INFO ] Computing symmetric may enable matrix : 297 transitions.
[2024-05-22 01:43:33] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:43:33] [INFO ] Computing Do-Not-Accords matrix : 297 transitions.
[2024-05-22 01:43:33] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:43:33] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin264577197927491040
Running compilation step : cd /tmp/ltsmin264577197927491040;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 662 ms.
Running link step : cd /tmp/ltsmin264577197927491040;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin264577197927491040;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased9258362264714457248.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-22 01:43:48] [INFO ] Flatten gal took : 15 ms
[2024-05-22 01:43:48] [INFO ] Flatten gal took : 13 ms
[2024-05-22 01:43:48] [INFO ] Time to serialize gal into /tmp/LTL11415749790732138351.gal : 3 ms
[2024-05-22 01:43:48] [INFO ] Time to serialize properties into /tmp/LTL3319360133981240408.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11415749790732138351.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10141436455598034044.hoa' '-atoms' '/tmp/LTL3319360133981240408.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL3319360133981240408.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10141436455598034044.hoa
Detected timeout of ITS tools.
[2024-05-22 01:44:04] [INFO ] Flatten gal took : 12 ms
[2024-05-22 01:44:04] [INFO ] Flatten gal took : 12 ms
[2024-05-22 01:44:04] [INFO ] Time to serialize gal into /tmp/LTL17626486787559760012.gal : 4 ms
[2024-05-22 01:44:04] [INFO ] Time to serialize properties into /tmp/LTL5119249138606519934.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17626486787559760012.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5119249138606519934.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(F((F(G("((p277==0)||(p347==0))")))&&(("((p224==0)||(p244==0))")||(X("((p224==0)||(p244==0))")))))))
Formula 0 simplified : X(GF!"((p277==0)||(p347==0))" | G(!"((p224==0)||(p244==0))" & X!"((p224==0)||(p244==0))"))
Detected timeout of ITS tools.
[2024-05-22 01:44:19] [INFO ] Flatten gal took : 12 ms
[2024-05-22 01:44:19] [INFO ] Applying decomposition
[2024-05-22 01:44:19] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph11514755896681390293.txt' '-o' '/tmp/graph11514755896681390293.bin' '-w' '/tmp/graph11514755896681390293.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph11514755896681390293.bin' '-l' '-1' '-v' '-w' '/tmp/graph11514755896681390293.weights' '-q' '0' '-e' '0.001'
[2024-05-22 01:44:19] [INFO ] Decomposing Gal with order
[2024-05-22 01:44:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 01:44:19] [INFO ] Removed a total of 14 redundant transitions.
[2024-05-22 01:44:19] [INFO ] Flatten gal took : 18 ms
[2024-05-22 01:44:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 3 ms.
[2024-05-22 01:44:19] [INFO ] Time to serialize gal into /tmp/LTL5193984457814943188.gal : 3 ms
[2024-05-22 01:44:19] [INFO ] Time to serialize properties into /tmp/LTL13085710679053124436.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5193984457814943188.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13085710679053124436.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(F((F(G("((i9.u15.p277==0)||(i9.u46.p347==0))")))&&(("((u2.p224==0)||(u2.p244==0))")||(X("((u2.p224==0)||(u2.p244==0))")))))))
Formula 0 simplified : X(GF!"((i9.u15.p277==0)||(i9.u46.p347==0))" | G(!"((u2.p224==0)||(u2.p244==0))" & X!"((u2.p224==0)||(u2.p244==0))"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6591511598126061833
[2024-05-22 01:44:34] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6591511598126061833
Running compilation step : cd /tmp/ltsmin6591511598126061833;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 527 ms.
Running link step : cd /tmp/ltsmin6591511598126061833;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin6591511598126061833;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>((<>([]((LTLAPp0==true)))&&(X((LTLAPp2==true))||(LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DES-PT-60a-LTLFireability-08 finished in 95737 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G((!p0 U !p1)))&&F(p2)))'
Support contains 6 out of 353 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 353/353 places, 297/297 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 352 transition count 296
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 352 transition count 296
Applied a total of 2 rules in 16 ms. Remains 352 /353 variables (removed 1) and now considering 296/297 (removed 1) transitions.
// Phase 1: matrix 296 rows 352 cols
[2024-05-22 01:44:49] [INFO ] Computed 58 invariants in 5 ms
[2024-05-22 01:44:49] [INFO ] Implicit Places using invariants in 186 ms returned []
[2024-05-22 01:44:49] [INFO ] Invariant cache hit.
[2024-05-22 01:44:49] [INFO ] Implicit Places using invariants and state equation in 373 ms returned []
Implicit Place search using SMT with State Equation took 561 ms to find 0 implicit places.
[2024-05-22 01:44:49] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-22 01:44:49] [INFO ] Invariant cache hit.
[2024-05-22 01:44:50] [INFO ] Dead Transitions using invariants and state equation in 151 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 352/353 places, 296/297 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 739 ms. Remains : 352/353 places, 296/297 transitions.
Stuttering acceptance computed with spot in 175 ms :[(OR (NOT p2) p1), p1, (NOT p2), p1]
Running random walk in product with property : DES-PT-60a-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 p0), acceptance={0} source=3 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(AND (EQ s219 1) (EQ s244 1)), p1:(AND (EQ s58 1) (EQ s271 1) (EQ s273 1)), p0:(AND (EQ s51 1) (EQ s271 1) (EQ s273 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 65 steps with 0 reset in 0 ms.
FORMULA DES-PT-60a-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-60a-LTLFireability-09 finished in 940 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(p1)&&F(p2)&&p0))))'
Support contains 5 out of 353 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 353/353 places, 297/297 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 352 transition count 296
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 352 transition count 296
Applied a total of 2 rules in 16 ms. Remains 352 /353 variables (removed 1) and now considering 296/297 (removed 1) transitions.
[2024-05-22 01:44:50] [INFO ] Invariant cache hit.
[2024-05-22 01:44:50] [INFO ] Implicit Places using invariants in 175 ms returned []
[2024-05-22 01:44:50] [INFO ] Invariant cache hit.
[2024-05-22 01:44:50] [INFO ] Implicit Places using invariants and state equation in 400 ms returned []
Implicit Place search using SMT with State Equation took 577 ms to find 0 implicit places.
[2024-05-22 01:44:50] [INFO ] Invariant cache hit.
[2024-05-22 01:44:51] [INFO ] Dead Transitions using invariants and state equation in 159 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 352/353 places, 296/297 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 754 ms. Remains : 352/353 places, 296/297 transitions.
Stuttering acceptance computed with spot in 158 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Running random walk in product with property : DES-PT-60a-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (OR (EQ s215 0) (EQ s244 0)) (OR (EQ s245 0) (EQ s266 0))), p1:(OR (EQ s215 0) (EQ s244 0)), p2:(OR (EQ s235 0) (EQ s244 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 2240 reset in 214 ms.
Product exploration explored 100000 steps with 2205 reset in 236 ms.
Computed a total of 255 stabilizing places and 250 stable transitions
Computed a total of 255 stabilizing places and 250 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X (AND p0 p1)), (X (NOT (OR (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (X p1)), (X (X (AND p0 p1))), (X (X p2)), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 100 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 162 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Incomplete random walk after 10000 steps, including 232 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10000 steps, including 61 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 64 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 64 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-22 01:44:52] [INFO ] Invariant cache hit.
[2024-05-22 01:44:52] [INFO ] After 60ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-22 01:44:52] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2024-05-22 01:44:52] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 88 ms returned sat
[2024-05-22 01:44:53] [INFO ] After 952ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-22 01:44:56] [INFO ] After 4078ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 3463 ms.
[2024-05-22 01:44:59] [INFO ] After 7719ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 51 ms.
Support contains 5 out of 352 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 296/296 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 352 transition count 294
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 7 place count 352 transition count 294
Applied a total of 7 rules in 12 ms. Remains 352 /352 variables (removed 0) and now considering 294/296 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 352/352 places, 294/296 transitions.
Incomplete random walk after 10000 steps, including 126 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 72 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 72 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 74 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 833967 steps, run timeout after 3001 ms. (steps per millisecond=277 ) properties seen :{}
Probabilistic random walk after 833967 steps, saw 118734 distinct states, run finished after 3001 ms. (steps per millisecond=277 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 294 rows 352 cols
[2024-05-22 01:45:03] [INFO ] Computed 60 invariants in 8 ms
[2024-05-22 01:45:03] [INFO ] After 82ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-22 01:45:03] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-22 01:45:03] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 97 ms returned sat
[2024-05-22 01:45:04] [INFO ] After 680ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-22 01:45:04] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-22 01:45:04] [INFO ] After 146ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-22 01:45:04] [INFO ] After 309ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 125 ms.
[2024-05-22 01:45:04] [INFO ] After 1407ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 2 properties in 22 ms.
Support contains 2 out of 352 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 294/294 transitions.
Applied a total of 0 rules in 6 ms. Remains 352 /352 variables (removed 0) and now considering 294/294 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 352/352 places, 294/294 transitions.
Incomplete random walk after 10000 steps, including 130 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 73 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1345219 steps, run timeout after 3001 ms. (steps per millisecond=448 ) properties seen :{}
Probabilistic random walk after 1345219 steps, saw 187946 distinct states, run finished after 3001 ms. (steps per millisecond=448 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-22 01:45:07] [INFO ] Invariant cache hit.
[2024-05-22 01:45:07] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 01:45:07] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-22 01:45:08] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 117 ms returned sat
[2024-05-22 01:45:08] [INFO ] After 553ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 01:45:08] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-22 01:45:08] [INFO ] After 39ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-22 01:45:08] [INFO ] After 81ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 46 ms.
[2024-05-22 01:45:08] [INFO ] After 883ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 10 ms.
Support contains 2 out of 352 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 294/294 transitions.
Applied a total of 0 rules in 6 ms. Remains 352 /352 variables (removed 0) and now considering 294/294 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 352/352 places, 294/294 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 294/294 transitions.
Applied a total of 0 rules in 5 ms. Remains 352 /352 variables (removed 0) and now considering 294/294 (removed 0) transitions.
[2024-05-22 01:45:08] [INFO ] Invariant cache hit.
[2024-05-22 01:45:08] [INFO ] Implicit Places using invariants in 183 ms returned []
[2024-05-22 01:45:08] [INFO ] Invariant cache hit.
[2024-05-22 01:45:09] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-22 01:45:09] [INFO ] Implicit Places using invariants and state equation in 524 ms returned []
Implicit Place search using SMT with State Equation took 708 ms to find 0 implicit places.
[2024-05-22 01:45:09] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-22 01:45:09] [INFO ] Invariant cache hit.
[2024-05-22 01:45:09] [INFO ] Dead Transitions using invariants and state equation in 152 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 873 ms. Remains : 352/352 places, 294/294 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 352 transition count 294
Applied a total of 1 rules in 11 ms. Remains 352 /352 variables (removed 0) and now considering 294/294 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 294 rows 352 cols
[2024-05-22 01:45:09] [INFO ] Computed 60 invariants in 8 ms
[2024-05-22 01:45:09] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 01:45:09] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-22 01:45:09] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 18 ms returned sat
[2024-05-22 01:45:09] [INFO ] After 183ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 01:45:10] [INFO ] After 252ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 38 ms.
[2024-05-22 01:45:10] [INFO ] After 392ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 p1 p2), (X (AND p0 p1)), (X (NOT (OR (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (X p1)), (X (X (AND p0 p1))), (X (X p2)), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1 (NOT p2)))))]
False Knowledge obtained : [(F (NOT p2)), (F (OR (NOT p0) (NOT p1))), (F (AND p0 p1 (NOT p2))), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 9 factoid took 230 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 165 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 166 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Support contains 5 out of 352 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 352/352 places, 296/296 transitions.
Applied a total of 0 rules in 9 ms. Remains 352 /352 variables (removed 0) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 352 cols
[2024-05-22 01:45:10] [INFO ] Computed 58 invariants in 8 ms
[2024-05-22 01:45:10] [INFO ] Implicit Places using invariants in 180 ms returned []
[2024-05-22 01:45:10] [INFO ] Invariant cache hit.
[2024-05-22 01:45:11] [INFO ] Implicit Places using invariants and state equation in 393 ms returned []
Implicit Place search using SMT with State Equation took 574 ms to find 0 implicit places.
[2024-05-22 01:45:11] [INFO ] Invariant cache hit.
[2024-05-22 01:45:11] [INFO ] Dead Transitions using invariants and state equation in 154 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 738 ms. Remains : 352/352 places, 296/296 transitions.
Computed a total of 255 stabilizing places and 250 stable transitions
Computed a total of 255 stabilizing places and 250 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X (AND p0 p1)), (X (NOT (OR (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (X p1)), (X (X (AND p0 p1))), (X (X p2)), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 99 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 147 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Incomplete random walk after 10000 steps, including 221 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 65 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 66 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 63 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-22 01:45:11] [INFO ] Invariant cache hit.
[2024-05-22 01:45:11] [INFO ] After 63ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-22 01:45:12] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2024-05-22 01:45:12] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 87 ms returned sat
[2024-05-22 01:45:13] [INFO ] After 942ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-22 01:45:16] [INFO ] After 3994ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 3268 ms.
[2024-05-22 01:45:19] [INFO ] After 7444ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 87 ms.
Support contains 5 out of 352 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 296/296 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 352 transition count 294
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 7 place count 352 transition count 294
Applied a total of 7 rules in 11 ms. Remains 352 /352 variables (removed 0) and now considering 294/296 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 352/352 places, 294/296 transitions.
Incomplete random walk after 10000 steps, including 132 resets, run finished after 187 ms. (steps per millisecond=53 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 71 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 72 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 72 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 874799 steps, run timeout after 3001 ms. (steps per millisecond=291 ) properties seen :{}
Probabilistic random walk after 874799 steps, saw 124624 distinct states, run finished after 3001 ms. (steps per millisecond=291 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 294 rows 352 cols
[2024-05-22 01:45:22] [INFO ] Computed 60 invariants in 7 ms
[2024-05-22 01:45:22] [INFO ] After 71ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-22 01:45:23] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-22 01:45:23] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 99 ms returned sat
[2024-05-22 01:45:23] [INFO ] After 676ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-22 01:45:23] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-22 01:45:24] [INFO ] After 143ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-22 01:45:24] [INFO ] After 308ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 122 ms.
[2024-05-22 01:45:24] [INFO ] After 1410ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 2 properties in 17 ms.
Support contains 2 out of 352 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 294/294 transitions.
Applied a total of 0 rules in 5 ms. Remains 352 /352 variables (removed 0) and now considering 294/294 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 352/352 places, 294/294 transitions.
Incomplete random walk after 10000 steps, including 135 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 71 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1514059 steps, run timeout after 3001 ms. (steps per millisecond=504 ) properties seen :{}
Probabilistic random walk after 1514059 steps, saw 211688 distinct states, run finished after 3001 ms. (steps per millisecond=504 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-22 01:45:27] [INFO ] Invariant cache hit.
[2024-05-22 01:45:27] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 01:45:27] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-22 01:45:27] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 119 ms returned sat
[2024-05-22 01:45:28] [INFO ] After 574ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 01:45:28] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-22 01:45:28] [INFO ] After 40ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-22 01:45:28] [INFO ] After 81ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 36 ms.
[2024-05-22 01:45:28] [INFO ] After 895ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 10 ms.
Support contains 2 out of 352 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 294/294 transitions.
Applied a total of 0 rules in 5 ms. Remains 352 /352 variables (removed 0) and now considering 294/294 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 352/352 places, 294/294 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 294/294 transitions.
Applied a total of 0 rules in 7 ms. Remains 352 /352 variables (removed 0) and now considering 294/294 (removed 0) transitions.
[2024-05-22 01:45:28] [INFO ] Invariant cache hit.
[2024-05-22 01:45:28] [INFO ] Implicit Places using invariants in 192 ms returned []
[2024-05-22 01:45:28] [INFO ] Invariant cache hit.
[2024-05-22 01:45:28] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-22 01:45:29] [INFO ] Implicit Places using invariants and state equation in 508 ms returned []
Implicit Place search using SMT with State Equation took 709 ms to find 0 implicit places.
[2024-05-22 01:45:29] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-22 01:45:29] [INFO ] Invariant cache hit.
[2024-05-22 01:45:29] [INFO ] Dead Transitions using invariants and state equation in 153 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 882 ms. Remains : 352/352 places, 294/294 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 352 transition count 294
Applied a total of 1 rules in 11 ms. Remains 352 /352 variables (removed 0) and now considering 294/294 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 294 rows 352 cols
[2024-05-22 01:45:29] [INFO ] Computed 60 invariants in 4 ms
[2024-05-22 01:45:29] [INFO ] After 60ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 01:45:29] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-22 01:45:29] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 18 ms returned sat
[2024-05-22 01:45:29] [INFO ] After 181ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 01:45:29] [INFO ] After 245ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 37 ms.
[2024-05-22 01:45:29] [INFO ] After 387ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 p1 p2), (X (AND p0 p1)), (X (NOT (OR (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (X p1)), (X (X (AND p0 p1))), (X (X p2)), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1 (NOT p2)))))]
False Knowledge obtained : [(F (NOT p2)), (F (OR (NOT p0) (NOT p1))), (F (AND p0 p1 (NOT p2))), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 9 factoid took 229 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 150 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 161 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Product exploration explored 100000 steps with 2216 reset in 211 ms.
Product exploration explored 100000 steps with 2205 reset in 229 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 241 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Support contains 5 out of 352 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 352/352 places, 296/296 transitions.
Applied a total of 0 rules in 10 ms. Remains 352 /352 variables (removed 0) and now considering 296/296 (removed 0) transitions.
[2024-05-22 01:45:31] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 296 rows 352 cols
[2024-05-22 01:45:31] [INFO ] Computed 58 invariants in 6 ms
[2024-05-22 01:45:31] [INFO ] Dead Transitions using invariants and state equation in 160 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 183 ms. Remains : 352/352 places, 296/296 transitions.
Built C files in :
/tmp/ltsmin6321106146864331744
[2024-05-22 01:45:31] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6321106146864331744
Running compilation step : cd /tmp/ltsmin6321106146864331744;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 529 ms.
Running link step : cd /tmp/ltsmin6321106146864331744;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin6321106146864331744;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased4770852607565016237.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 352 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 352/352 places, 296/296 transitions.
Applied a total of 0 rules in 11 ms. Remains 352 /352 variables (removed 0) and now considering 296/296 (removed 0) transitions.
[2024-05-22 01:45:46] [INFO ] Invariant cache hit.
[2024-05-22 01:45:46] [INFO ] Implicit Places using invariants in 192 ms returned []
[2024-05-22 01:45:46] [INFO ] Invariant cache hit.
[2024-05-22 01:45:47] [INFO ] Implicit Places using invariants and state equation in 395 ms returned []
Implicit Place search using SMT with State Equation took 590 ms to find 0 implicit places.
[2024-05-22 01:45:47] [INFO ] Invariant cache hit.
[2024-05-22 01:45:47] [INFO ] Dead Transitions using invariants and state equation in 145 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 759 ms. Remains : 352/352 places, 296/296 transitions.
Built C files in :
/tmp/ltsmin5804495464666178065
[2024-05-22 01:45:47] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5804495464666178065
Running compilation step : cd /tmp/ltsmin5804495464666178065;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 486 ms.
Running link step : cd /tmp/ltsmin5804495464666178065;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 25 ms.
Running LTSmin : cd /tmp/ltsmin5804495464666178065;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased16161168072908798607.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-22 01:46:02] [INFO ] Flatten gal took : 13 ms
[2024-05-22 01:46:02] [INFO ] Flatten gal took : 12 ms
[2024-05-22 01:46:02] [INFO ] Time to serialize gal into /tmp/LTL16369559383170189703.gal : 2 ms
[2024-05-22 01:46:02] [INFO ] Time to serialize properties into /tmp/LTL10506607418707008649.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16369559383170189703.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11207421045617364678.hoa' '-atoms' '/tmp/LTL10506607418707008649.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL10506607418707008649.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11207421045617364678.hoa
Detected timeout of ITS tools.
[2024-05-22 01:46:17] [INFO ] Flatten gal took : 13 ms
[2024-05-22 01:46:17] [INFO ] Flatten gal took : 9 ms
[2024-05-22 01:46:17] [INFO ] Time to serialize gal into /tmp/LTL14862208303291293959.gal : 5 ms
[2024-05-22 01:46:17] [INFO ] Time to serialize properties into /tmp/LTL9959186919722820053.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14862208303291293959.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9959186919722820053.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(F(((G("((p215==0)||(p244==0))"))&&(F("((p235==0)||(p244==0))")))&&("(((p215==0)||(p244==0))&&((p245==0)||(p267==0)))")))))
Formula 0 simplified : XG(!"(((p215==0)||(p244==0))&&((p245==0)||(p267==0)))" | F!"((p215==0)||(p244==0))" | G!"((p235==0)||(p244==0))")
Detected timeout of ITS tools.
[2024-05-22 01:46:32] [INFO ] Flatten gal took : 14 ms
[2024-05-22 01:46:32] [INFO ] Applying decomposition
[2024-05-22 01:46:32] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph16272441867530581973.txt' '-o' '/tmp/graph16272441867530581973.bin' '-w' '/tmp/graph16272441867530581973.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph16272441867530581973.bin' '-l' '-1' '-v' '-w' '/tmp/graph16272441867530581973.weights' '-q' '0' '-e' '0.001'
[2024-05-22 01:46:32] [INFO ] Decomposing Gal with order
[2024-05-22 01:46:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 01:46:32] [INFO ] Removed a total of 14 redundant transitions.
[2024-05-22 01:46:32] [INFO ] Flatten gal took : 29 ms
[2024-05-22 01:46:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-22 01:46:32] [INFO ] Time to serialize gal into /tmp/LTL6892972408620297438.gal : 4 ms
[2024-05-22 01:46:32] [INFO ] Time to serialize properties into /tmp/LTL2227048380179165591.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6892972408620297438.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2227048380179165591.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(F(((G("((u2.p215==0)||(u2.p244==0))"))&&(F("((u2.p235==0)||(u2.p244==0))")))&&("(((u2.p215==0)||(u2.p244==0))&&((u2.p245==0)||(i1...179
Formula 0 simplified : XG(!"(((u2.p215==0)||(u2.p244==0))&&((u2.p245==0)||(i1.i1.u11.p267==0)))" | F!"((u2.p215==0)||(u2.p244==0))" | G!"((u2.p235==0)||(u2...167
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13507110783798787571
[2024-05-22 01:46:47] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13507110783798787571
Running compilation step : cd /tmp/ltsmin13507110783798787571;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 499 ms.
Running link step : cd /tmp/ltsmin13507110783798787571;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin13507110783798787571;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>(([]((LTLAPp1==true))&&<>((LTLAPp2==true))&&(LTLAPp0==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DES-PT-60a-LTLFireability-10 finished in 132651 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(((p0 U X(p1))||G(p2)))))'
Support contains 6 out of 353 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 353/353 places, 297/297 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 352 transition count 296
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 352 transition count 296
Applied a total of 2 rules in 15 ms. Remains 352 /353 variables (removed 1) and now considering 296/297 (removed 1) transitions.
[2024-05-22 01:47:02] [INFO ] Invariant cache hit.
[2024-05-22 01:47:03] [INFO ] Implicit Places using invariants in 182 ms returned []
[2024-05-22 01:47:03] [INFO ] Invariant cache hit.
[2024-05-22 01:47:03] [INFO ] Implicit Places using invariants and state equation in 383 ms returned []
Implicit Place search using SMT with State Equation took 571 ms to find 0 implicit places.
[2024-05-22 01:47:03] [INFO ] Invariant cache hit.
[2024-05-22 01:47:03] [INFO ] Dead Transitions using invariants and state equation in 152 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 352/353 places, 296/297 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 739 ms. Remains : 352/353 places, 296/297 transitions.
Stuttering acceptance computed with spot in 327 ms :[true, (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : DES-PT-60a-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 2}, { cond=(AND p0 p2), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 5}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 6}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=3 dest: 6}], [{ cond=(NOT p2), acceptance={} source=4 dest: 0}, { cond=p2, acceptance={} source=4 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=5 dest: 6}], [{ cond=(NOT p1), acceptance={} source=6 dest: 0}], [{ cond=true, acceptance={} source=7 dest: 8}], [{ cond=true, acceptance={} source=8 dest: 1}]], initial=7, aps=[p0:(AND (EQ s215 1) (EQ s244 1)), p2:(AND (EQ s95 1) (EQ s347 1)), p1:(AND (EQ s241 1) (EQ s253 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, null, null, null][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 DES-PT-60a-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-60a-LTLFireability-11 finished in 1102 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0||X(G(p1))) U X(!p2))))'
Support contains 7 out of 353 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 353/353 places, 297/297 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 352 transition count 296
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 352 transition count 296
Applied a total of 2 rules in 14 ms. Remains 352 /353 variables (removed 1) and now considering 296/297 (removed 1) transitions.
[2024-05-22 01:47:04] [INFO ] Invariant cache hit.
[2024-05-22 01:47:04] [INFO ] Implicit Places using invariants in 178 ms returned []
[2024-05-22 01:47:04] [INFO ] Invariant cache hit.
[2024-05-22 01:47:04] [INFO ] Implicit Places using invariants and state equation in 373 ms returned []
Implicit Place search using SMT with State Equation took 553 ms to find 0 implicit places.
[2024-05-22 01:47:04] [INFO ] Invariant cache hit.
[2024-05-22 01:47:04] [INFO ] Dead Transitions using invariants and state equation in 151 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 352/353 places, 296/297 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 719 ms. Remains : 352/353 places, 296/297 transitions.
Stuttering acceptance computed with spot in 245 ms :[p2, p2, p2, (AND (NOT p1) p2), true, (NOT p1)]
Running random walk in product with property : DES-PT-60a-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=p2, acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={0} source=2 dest: 3}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND p2 p1), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 4}, { cond=p1, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(AND (EQ s135 1) (EQ s268 1)), p2:(AND (EQ s275 1) (EQ s277 1) (EQ s334 1)), p1:(AND (EQ s280 1) (EQ s297 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 390 ms.
Product exploration explored 100000 steps with 33333 reset in 408 ms.
Computed a total of 255 stabilizing places and 250 stable transitions
Computed a total of 255 stabilizing places and 250 stable transitions
Detected a total of 255/352 stabilizing places and 250/296 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND (NOT p0) p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 25 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DES-PT-60a-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-60a-LTLFireability-12 finished in 1815 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((!(p0 U p1)||p0)) U !F(X(p2))))'
Support contains 6 out of 353 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 353/353 places, 297/297 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 352 transition count 296
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 352 transition count 296
Applied a total of 2 rules in 12 ms. Remains 352 /353 variables (removed 1) and now considering 296/297 (removed 1) transitions.
[2024-05-22 01:47:05] [INFO ] Invariant cache hit.
[2024-05-22 01:47:06] [INFO ] Implicit Places using invariants in 170 ms returned []
[2024-05-22 01:47:06] [INFO ] Invariant cache hit.
[2024-05-22 01:47:06] [INFO ] Implicit Places using invariants and state equation in 398 ms returned []
Implicit Place search using SMT with State Equation took 578 ms to find 0 implicit places.
[2024-05-22 01:47:06] [INFO ] Invariant cache hit.
[2024-05-22 01:47:06] [INFO ] Dead Transitions using invariants and state equation in 149 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 352/353 places, 296/297 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 740 ms. Remains : 352/353 places, 296/297 transitions.
Stuttering acceptance computed with spot in 141 ms :[p2, p2, true, p2]
Running random walk in product with property : DES-PT-60a-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (AND (NOT p2) p0) (AND (NOT p2) (NOT p1))), acceptance={} source=1 dest: 1}, { cond=(OR (AND p2 p0) (AND p2 (NOT p1))), acceptance={0} source=1 dest: 1}, { cond=(AND p2 (NOT p0) p1), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p2, acceptance={} source=3 dest: 2}, { cond=(NOT p2), acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(AND (EQ s208 1) (EQ s244 1)), p0:(AND (EQ s334 1) (EQ s348 1)), p1:(AND (EQ s129 1) (EQ s268 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][false, false, false, false]]
Product exploration explored 100000 steps with 2230 reset in 295 ms.
Product exploration explored 100000 steps with 2229 reset in 285 ms.
Computed a total of 255 stabilizing places and 250 stable transitions
Computed a total of 255 stabilizing places and 250 stable transitions
Detected a total of 255/352 stabilizing places and 250/296 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT (AND p2 (NOT p0) p1))), (X (OR (AND (NOT p2) p0) (AND (NOT p2) (NOT p1)))), (X (NOT (OR (AND p2 p0) (AND p2 (NOT p1))))), (X (X (NOT p2))), true, (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X (OR (AND (NOT p2) p0) (AND (NOT p2) (NOT p1))))), (X (X (NOT (OR (AND p2 p0) (AND p2 (NOT p1)))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 12 factoid took 205 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[p2, true, p2]
Incomplete random walk after 10000 steps, including 215 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 59 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 62 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 57 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 64 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 703340 steps, run timeout after 3001 ms. (steps per millisecond=234 ) properties seen :{}
Probabilistic random walk after 703340 steps, saw 108564 distinct states, run finished after 3001 ms. (steps per millisecond=234 ) properties seen :0
Running SMT prover for 5 properties.
[2024-05-22 01:47:10] [INFO ] Invariant cache hit.
[2024-05-22 01:47:11] [INFO ] [Real]Absence check using 33 positive place invariants in 5 ms returned sat
[2024-05-22 01:47:11] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 14 ms returned sat
[2024-05-22 01:47:11] [INFO ] After 115ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-22 01:47:11] [INFO ] [Nat]Absence check using 33 positive place invariants in 5 ms returned sat
[2024-05-22 01:47:11] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 32 ms returned sat
[2024-05-22 01:47:11] [INFO ] After 708ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-22 01:47:12] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 0 ms to minimize.
[2024-05-22 01:47:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 84 ms
[2024-05-22 01:47:12] [INFO ] After 1382ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 539 ms.
[2024-05-22 01:47:13] [INFO ] After 2080ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 306 ms.
Support contains 6 out of 352 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 296/296 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 352 transition count 294
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 6 place count 352 transition count 294
Applied a total of 6 rules in 13 ms. Remains 352 /352 variables (removed 0) and now considering 294/296 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 352/352 places, 294/296 transitions.
Incomplete random walk after 10000 steps, including 134 resets, run finished after 162 ms. (steps per millisecond=61 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 72 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 70 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 73 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 754539 steps, run timeout after 3001 ms. (steps per millisecond=251 ) properties seen :{}
Probabilistic random walk after 754539 steps, saw 108305 distinct states, run finished after 3001 ms. (steps per millisecond=251 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 294 rows 352 cols
[2024-05-22 01:47:16] [INFO ] Computed 60 invariants in 3 ms
[2024-05-22 01:47:16] [INFO ] [Real]Absence check using 36 positive place invariants in 6 ms returned sat
[2024-05-22 01:47:16] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 15 ms returned sat
[2024-05-22 01:47:16] [INFO ] After 110ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-22 01:47:16] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-22 01:47:17] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 59 ms returned sat
[2024-05-22 01:47:18] [INFO ] After 1000ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-22 01:47:18] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 01:47:18] [INFO ] After 735ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2024-05-22 01:47:19] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 0 ms to minimize.
[2024-05-22 01:47:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 120 ms
[2024-05-22 01:47:19] [INFO ] After 1428ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 885 ms.
[2024-05-22 01:47:20] [INFO ] After 3524ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 342 ms.
Support contains 6 out of 352 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 294/294 transitions.
Applied a total of 0 rules in 5 ms. Remains 352 /352 variables (removed 0) and now considering 294/294 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 352/352 places, 294/294 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 294/294 transitions.
Applied a total of 0 rules in 5 ms. Remains 352 /352 variables (removed 0) and now considering 294/294 (removed 0) transitions.
[2024-05-22 01:47:20] [INFO ] Invariant cache hit.
[2024-05-22 01:47:20] [INFO ] Implicit Places using invariants in 175 ms returned []
[2024-05-22 01:47:20] [INFO ] Invariant cache hit.
[2024-05-22 01:47:21] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 01:47:21] [INFO ] Implicit Places using invariants and state equation in 430 ms returned []
Implicit Place search using SMT with State Equation took 607 ms to find 0 implicit places.
[2024-05-22 01:47:21] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-22 01:47:21] [INFO ] Invariant cache hit.
[2024-05-22 01:47:21] [INFO ] Dead Transitions using invariants and state equation in 160 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 789 ms. Remains : 352/352 places, 294/294 transitions.
Applied a total of 0 rules in 6 ms. Remains 352 /352 variables (removed 0) and now considering 294/294 (removed 0) transitions.
Running SMT prover for 5 properties.
[2024-05-22 01:47:21] [INFO ] Invariant cache hit.
[2024-05-22 01:47:21] [INFO ] [Real]Absence check using 36 positive place invariants in 6 ms returned sat
[2024-05-22 01:47:21] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 15 ms returned sat
[2024-05-22 01:47:21] [INFO ] After 113ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-22 01:47:21] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-22 01:47:21] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 14 ms returned sat
[2024-05-22 01:47:23] [INFO ] After 1034ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-22 01:47:23] [INFO ] Deduced a trap composed of 6 places in 39 ms of which 1 ms to minimize.
[2024-05-22 01:47:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 113 ms
[2024-05-22 01:47:23] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 0 ms to minimize.
[2024-05-22 01:47:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 98 ms
[2024-05-22 01:47:23] [INFO ] After 1814ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 679 ms.
[2024-05-22 01:47:24] [INFO ] After 2738ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT (AND p2 (NOT p0) p1))), (X (OR (AND (NOT p2) p0) (AND (NOT p2) (NOT p1)))), (X (NOT (OR (AND p2 p0) (AND p2 (NOT p1))))), (X (X (NOT p2))), true, (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X (OR (AND (NOT p2) p0) (AND (NOT p2) (NOT p1))))), (X (X (NOT (OR (AND p2 p0) (AND p2 (NOT p1)))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 179 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 87 ms :[p2, true, p2]
Stuttering acceptance computed with spot in 83 ms :[p2, true, p2]
Support contains 6 out of 352 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 352/352 places, 296/296 transitions.
Applied a total of 0 rules in 14 ms. Remains 352 /352 variables (removed 0) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 352 cols
[2024-05-22 01:47:24] [INFO ] Computed 58 invariants in 3 ms
[2024-05-22 01:47:25] [INFO ] Implicit Places using invariants in 175 ms returned []
[2024-05-22 01:47:25] [INFO ] Invariant cache hit.
[2024-05-22 01:47:25] [INFO ] Implicit Places using invariants and state equation in 404 ms returned []
Implicit Place search using SMT with State Equation took 589 ms to find 0 implicit places.
[2024-05-22 01:47:25] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-22 01:47:25] [INFO ] Invariant cache hit.
[2024-05-22 01:47:25] [INFO ] Dead Transitions using invariants and state equation in 149 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 776 ms. Remains : 352/352 places, 296/296 transitions.
Computed a total of 255 stabilizing places and 250 stable transitions
Computed a total of 255 stabilizing places and 250 stable transitions
Detected a total of 255/352 stabilizing places and 250/296 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (OR (AND p0 p2) (AND p2 (NOT p1))))), (X (NOT (AND (NOT p0) p2 p1))), (X (OR (AND p0 (NOT p2)) (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (X (NOT p2))), true, (X (X (NOT (OR (AND p0 p2) (AND p2 (NOT p1)))))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (OR (AND p0 (NOT p2)) (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 166 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[p2, true, p2]
Incomplete random walk after 10000 steps, including 220 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 59 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 63 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 59 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 56 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 62 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 688238 steps, run timeout after 3001 ms. (steps per millisecond=229 ) properties seen :{}
Probabilistic random walk after 688238 steps, saw 106684 distinct states, run finished after 3001 ms. (steps per millisecond=229 ) properties seen :0
Running SMT prover for 5 properties.
[2024-05-22 01:47:29] [INFO ] Invariant cache hit.
[2024-05-22 01:47:29] [INFO ] [Real]Absence check using 33 positive place invariants in 5 ms returned sat
[2024-05-22 01:47:29] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 14 ms returned sat
[2024-05-22 01:47:29] [INFO ] After 114ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-22 01:47:29] [INFO ] [Nat]Absence check using 33 positive place invariants in 5 ms returned sat
[2024-05-22 01:47:29] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 24 ms returned sat
[2024-05-22 01:47:30] [INFO ] After 691ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-22 01:47:30] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 0 ms to minimize.
[2024-05-22 01:47:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 87 ms
[2024-05-22 01:47:30] [INFO ] After 1356ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 537 ms.
[2024-05-22 01:47:31] [INFO ] After 2039ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 326 ms.
Support contains 6 out of 352 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 296/296 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 352 transition count 294
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 6 place count 352 transition count 294
Applied a total of 6 rules in 12 ms. Remains 352 /352 variables (removed 0) and now considering 294/296 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 352/352 places, 294/296 transitions.
Incomplete random walk after 10000 steps, including 131 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 72 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 71 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 73 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 716055 steps, run timeout after 3001 ms. (steps per millisecond=238 ) properties seen :{}
Probabilistic random walk after 716055 steps, saw 102920 distinct states, run finished after 3001 ms. (steps per millisecond=238 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 294 rows 352 cols
[2024-05-22 01:47:35] [INFO ] Computed 60 invariants in 4 ms
[2024-05-22 01:47:35] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-22 01:47:35] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 14 ms returned sat
[2024-05-22 01:47:35] [INFO ] After 109ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-22 01:47:35] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-22 01:47:35] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 51 ms returned sat
[2024-05-22 01:47:36] [INFO ] After 1083ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-22 01:47:36] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 01:47:37] [INFO ] After 743ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2024-05-22 01:47:37] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 0 ms to minimize.
[2024-05-22 01:47:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 115 ms
[2024-05-22 01:47:37] [INFO ] After 1432ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 895 ms.
[2024-05-22 01:47:38] [INFO ] After 3639ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 223 ms.
Support contains 6 out of 352 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 294/294 transitions.
Applied a total of 0 rules in 5 ms. Remains 352 /352 variables (removed 0) and now considering 294/294 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 352/352 places, 294/294 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 294/294 transitions.
Applied a total of 0 rules in 4 ms. Remains 352 /352 variables (removed 0) and now considering 294/294 (removed 0) transitions.
[2024-05-22 01:47:39] [INFO ] Invariant cache hit.
[2024-05-22 01:47:39] [INFO ] Implicit Places using invariants in 182 ms returned []
[2024-05-22 01:47:39] [INFO ] Invariant cache hit.
[2024-05-22 01:47:39] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 01:47:39] [INFO ] Implicit Places using invariants and state equation in 452 ms returned []
Implicit Place search using SMT with State Equation took 672 ms to find 0 implicit places.
[2024-05-22 01:47:39] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-22 01:47:39] [INFO ] Invariant cache hit.
[2024-05-22 01:47:39] [INFO ] Dead Transitions using invariants and state equation in 148 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 843 ms. Remains : 352/352 places, 294/294 transitions.
Applied a total of 0 rules in 5 ms. Remains 352 /352 variables (removed 0) and now considering 294/294 (removed 0) transitions.
Running SMT prover for 5 properties.
[2024-05-22 01:47:39] [INFO ] Invariant cache hit.
[2024-05-22 01:47:39] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-22 01:47:40] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 16 ms returned sat
[2024-05-22 01:47:40] [INFO ] After 136ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-22 01:47:40] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2024-05-22 01:47:40] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 13 ms returned sat
[2024-05-22 01:47:41] [INFO ] After 1053ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-22 01:47:41] [INFO ] Deduced a trap composed of 6 places in 50 ms of which 1 ms to minimize.
[2024-05-22 01:47:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 126 ms
[2024-05-22 01:47:42] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 0 ms to minimize.
[2024-05-22 01:47:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 96 ms
[2024-05-22 01:47:42] [INFO ] After 1850ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 712 ms.
[2024-05-22 01:47:42] [INFO ] After 2810ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (OR (AND p0 p2) (AND p2 (NOT p1))))), (X (NOT (AND (NOT p0) p2 p1))), (X (OR (AND p0 (NOT p2)) (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (X (NOT p2))), true, (X (X (NOT (OR (AND p0 p2) (AND p2 (NOT p1)))))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (OR (AND p0 (NOT p2)) (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 230 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 93 ms :[p2, true, p2]
Stuttering acceptance computed with spot in 82 ms :[p2, true, p2]
Stuttering acceptance computed with spot in 84 ms :[p2, true, p2]
Product exploration explored 100000 steps with 2229 reset in 278 ms.
Product exploration explored 100000 steps with 2236 reset in 291 ms.
Built C files in :
/tmp/ltsmin9949966778959857774
[2024-05-22 01:47:43] [INFO ] Computing symmetric may disable matrix : 296 transitions.
[2024-05-22 01:47:43] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:47:43] [INFO ] Computing symmetric may enable matrix : 296 transitions.
[2024-05-22 01:47:43] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:47:43] [INFO ] Computing Do-Not-Accords matrix : 296 transitions.
[2024-05-22 01:47:43] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:47:43] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9949966778959857774
Running compilation step : cd /tmp/ltsmin9949966778959857774;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 655 ms.
Running link step : cd /tmp/ltsmin9949966778959857774;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin9949966778959857774;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13638210743309378403.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 352 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 352/352 places, 296/296 transitions.
Applied a total of 0 rules in 8 ms. Remains 352 /352 variables (removed 0) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 352 cols
[2024-05-22 01:47:59] [INFO ] Computed 58 invariants in 8 ms
[2024-05-22 01:47:59] [INFO ] Implicit Places using invariants in 195 ms returned []
[2024-05-22 01:47:59] [INFO ] Invariant cache hit.
[2024-05-22 01:47:59] [INFO ] Implicit Places using invariants and state equation in 424 ms returned []
Implicit Place search using SMT with State Equation took 649 ms to find 0 implicit places.
[2024-05-22 01:47:59] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-22 01:47:59] [INFO ] Invariant cache hit.
[2024-05-22 01:47:59] [INFO ] Dead Transitions using invariants and state equation in 178 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 867 ms. Remains : 352/352 places, 296/296 transitions.
Built C files in :
/tmp/ltsmin18192744357987154370
[2024-05-22 01:47:59] [INFO ] Computing symmetric may disable matrix : 296 transitions.
[2024-05-22 01:47:59] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:47:59] [INFO ] Computing symmetric may enable matrix : 296 transitions.
[2024-05-22 01:47:59] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:47:59] [INFO ] Computing Do-Not-Accords matrix : 296 transitions.
[2024-05-22 01:47:59] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:47:59] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18192744357987154370
Running compilation step : cd /tmp/ltsmin18192744357987154370;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 654 ms.
Running link step : cd /tmp/ltsmin18192744357987154370;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin18192744357987154370;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased5674794349443995265.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-22 01:48:14] [INFO ] Flatten gal took : 14 ms
[2024-05-22 01:48:14] [INFO ] Flatten gal took : 11 ms
[2024-05-22 01:48:15] [INFO ] Time to serialize gal into /tmp/LTL15820696970682310250.gal : 18 ms
[2024-05-22 01:48:15] [INFO ] Time to serialize properties into /tmp/LTL14654656087745347104.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15820696970682310250.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10124888620833570244.hoa' '-atoms' '/tmp/LTL14654656087745347104.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL14654656087745347104.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10124888620833570244.hoa
Detected timeout of ITS tools.
[2024-05-22 01:48:30] [INFO ] Flatten gal took : 10 ms
[2024-05-22 01:48:30] [INFO ] Flatten gal took : 10 ms
[2024-05-22 01:48:30] [INFO ] Time to serialize gal into /tmp/LTL7518494082320633761.gal : 1 ms
[2024-05-22 01:48:30] [INFO ] Time to serialize properties into /tmp/LTL10905323892079138789.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7518494082320633761.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10905323892079138789.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((X((!(("((p335==1)&&(p350==1))")U("((p129==1)&&(p269==1))")))||("((p335==1)&&(p350==1))")))U(!(F(X("((p208==1)&&(p244==1))"))))))
Formula 0 simplified : X((!"((p335==1)&&(p350==1))" & ("((p335==1)&&(p350==1))" U "((p129==1)&&(p269==1))")) R F"((p208==1)&&(p244==1))")
Detected timeout of ITS tools.
[2024-05-22 01:48:45] [INFO ] Flatten gal took : 11 ms
[2024-05-22 01:48:45] [INFO ] Applying decomposition
[2024-05-22 01:48:45] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph7940514306521670276.txt' '-o' '/tmp/graph7940514306521670276.bin' '-w' '/tmp/graph7940514306521670276.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph7940514306521670276.bin' '-l' '-1' '-v' '-w' '/tmp/graph7940514306521670276.weights' '-q' '0' '-e' '0.001'
[2024-05-22 01:48:45] [INFO ] Decomposing Gal with order
[2024-05-22 01:48:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 01:48:45] [INFO ] Removed a total of 16 redundant transitions.
[2024-05-22 01:48:45] [INFO ] Flatten gal took : 50 ms
[2024-05-22 01:48:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-22 01:48:45] [INFO ] Time to serialize gal into /tmp/LTL12480525165239263472.gal : 12 ms
[2024-05-22 01:48:45] [INFO ] Time to serialize properties into /tmp/LTL14941003961343944110.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12480525165239263472.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14941003961343944110.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !(((X((!(("((i9.u44.p335==1)&&(u48.p350==1))")U("((u13.p129==1)&&(u13.p269==1))")))||("((i9.u44.p335==1)&&(u48.p350==1))")))U(!(F(X("(...189
Formula 0 simplified : X((!"((i9.u44.p335==1)&&(u48.p350==1))" & ("((i9.u44.p335==1)&&(u48.p350==1))" U "((u13.p129==1)&&(u13.p269==1))")) R F"((u2.p208==1...173
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10369046201996066356
[2024-05-22 01:49:00] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10369046201996066356
Running compilation step : cd /tmp/ltsmin10369046201996066356;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 491 ms.
Running link step : cd /tmp/ltsmin10369046201996066356;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 25 ms.
Running LTSmin : cd /tmp/ltsmin10369046201996066356;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(X((!((LTLAPp0==true) U (LTLAPp1==true))||(LTLAPp0==true))) U !<>(X((LTLAPp2==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DES-PT-60a-LTLFireability-13 finished in 129672 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 5 out of 353 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 353/353 places, 297/297 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 352 transition count 296
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 352 transition count 296
Applied a total of 2 rules in 6 ms. Remains 352 /353 variables (removed 1) and now considering 296/297 (removed 1) transitions.
[2024-05-22 01:49:15] [INFO ] Invariant cache hit.
[2024-05-22 01:49:15] [INFO ] Implicit Places using invariants in 171 ms returned []
[2024-05-22 01:49:15] [INFO ] Invariant cache hit.
[2024-05-22 01:49:16] [INFO ] Implicit Places using invariants and state equation in 372 ms returned []
Implicit Place search using SMT with State Equation took 562 ms to find 0 implicit places.
[2024-05-22 01:49:16] [INFO ] Invariant cache hit.
[2024-05-22 01:49:16] [INFO ] Dead Transitions using invariants and state equation in 164 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 352/353 places, 296/297 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 757 ms. Remains : 352/353 places, 296/297 transitions.
Stuttering acceptance computed with spot in 211 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-60a-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (OR (NEQ s86 1) (NEQ s347 1)) (OR (NEQ s10 1) (NEQ s271 1) (NEQ s273 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 2230 reset in 216 ms.
Product exploration explored 100000 steps with 2222 reset in 236 ms.
Computed a total of 255 stabilizing places and 250 stable transitions
Computed a total of 255 stabilizing places and 250 stable transitions
Detected a total of 255/352 stabilizing places and 250/296 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 86 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 51 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 219 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1443501 steps, run timeout after 3001 ms. (steps per millisecond=481 ) properties seen :{}
Probabilistic random walk after 1443501 steps, saw 202113 distinct states, run finished after 3001 ms. (steps per millisecond=481 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-22 01:49:20] [INFO ] Invariant cache hit.
[2024-05-22 01:49:20] [INFO ] [Real]Absence check using 33 positive place invariants in 5 ms returned sat
[2024-05-22 01:49:20] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 14 ms returned sat
[2024-05-22 01:49:20] [INFO ] After 94ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 01:49:20] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2024-05-22 01:49:20] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 15 ms returned sat
[2024-05-22 01:49:21] [INFO ] After 634ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 01:49:21] [INFO ] After 772ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 109 ms.
[2024-05-22 01:49:21] [INFO ] After 1093ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 14 ms.
Support contains 5 out of 352 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 296/296 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 352 transition count 294
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 8 place count 352 transition count 294
Applied a total of 8 rules in 11 ms. Remains 352 /352 variables (removed 0) and now considering 294/296 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 352/352 places, 294/296 transitions.
Incomplete random walk after 10000 steps, including 132 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1494994 steps, run timeout after 3001 ms. (steps per millisecond=498 ) properties seen :{}
Probabilistic random walk after 1494994 steps, saw 208441 distinct states, run finished after 3001 ms. (steps per millisecond=498 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 294 rows 352 cols
[2024-05-22 01:49:24] [INFO ] Computed 60 invariants in 13 ms
[2024-05-22 01:49:24] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-22 01:49:24] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 16 ms returned sat
[2024-05-22 01:49:24] [INFO ] After 84ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 01:49:24] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-22 01:49:24] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 143 ms returned sat
[2024-05-22 01:49:25] [INFO ] After 781ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 01:49:25] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-22 01:49:25] [INFO ] After 227ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-22 01:49:25] [INFO ] After 316ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 81 ms.
[2024-05-22 01:49:25] [INFO ] After 1462ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 9 ms.
Support contains 5 out of 352 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 294/294 transitions.
Applied a total of 0 rules in 7 ms. Remains 352 /352 variables (removed 0) and now considering 294/294 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 352/352 places, 294/294 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 294/294 transitions.
Applied a total of 0 rules in 5 ms. Remains 352 /352 variables (removed 0) and now considering 294/294 (removed 0) transitions.
[2024-05-22 01:49:25] [INFO ] Invariant cache hit.
[2024-05-22 01:49:26] [INFO ] Implicit Places using invariants in 224 ms returned []
[2024-05-22 01:49:26] [INFO ] Invariant cache hit.
[2024-05-22 01:49:26] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-22 01:49:26] [INFO ] Implicit Places using invariants and state equation in 444 ms returned []
Implicit Place search using SMT with State Equation took 699 ms to find 0 implicit places.
[2024-05-22 01:49:26] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-22 01:49:26] [INFO ] Invariant cache hit.
[2024-05-22 01:49:26] [INFO ] Dead Transitions using invariants and state equation in 145 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 866 ms. Remains : 352/352 places, 294/294 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 352 transition count 294
Applied a total of 1 rules in 9 ms. Remains 352 /352 variables (removed 0) and now considering 294/294 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 294 rows 352 cols
[2024-05-22 01:49:26] [INFO ] Computed 60 invariants in 4 ms
[2024-05-22 01:49:26] [INFO ] [Real]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-22 01:49:26] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 15 ms returned sat
[2024-05-22 01:49:26] [INFO ] After 90ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 01:49:26] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-22 01:49:27] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 143 ms returned sat
[2024-05-22 01:49:27] [INFO ] After 505ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 01:49:27] [INFO ] After 628ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 142 ms.
[2024-05-22 01:49:27] [INFO ] After 1034ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 83 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 53 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[true, (NOT p0)]
Support contains 5 out of 352 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 352/352 places, 296/296 transitions.
Applied a total of 0 rules in 15 ms. Remains 352 /352 variables (removed 0) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 352 cols
[2024-05-22 01:49:28] [INFO ] Computed 58 invariants in 4 ms
[2024-05-22 01:49:28] [INFO ] Implicit Places using invariants in 193 ms returned []
[2024-05-22 01:49:28] [INFO ] Invariant cache hit.
[2024-05-22 01:49:28] [INFO ] Implicit Places using invariants and state equation in 364 ms returned []
Implicit Place search using SMT with State Equation took 604 ms to find 0 implicit places.
[2024-05-22 01:49:28] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-22 01:49:28] [INFO ] Invariant cache hit.
[2024-05-22 01:49:28] [INFO ] Dead Transitions using invariants and state equation in 144 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 787 ms. Remains : 352/352 places, 296/296 transitions.
Computed a total of 255 stabilizing places and 250 stable transitions
Computed a total of 255 stabilizing places and 250 stable transitions
Detected a total of 255/352 stabilizing places and 250/296 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 125 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 219 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1420439 steps, run timeout after 3001 ms. (steps per millisecond=473 ) properties seen :{}
Probabilistic random walk after 1420439 steps, saw 199166 distinct states, run finished after 3001 ms. (steps per millisecond=473 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-22 01:49:32] [INFO ] Invariant cache hit.
[2024-05-22 01:49:32] [INFO ] [Real]Absence check using 33 positive place invariants in 4 ms returned sat
[2024-05-22 01:49:32] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 14 ms returned sat
[2024-05-22 01:49:32] [INFO ] After 93ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 01:49:32] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2024-05-22 01:49:32] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 14 ms returned sat
[2024-05-22 01:49:33] [INFO ] After 625ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 01:49:33] [INFO ] After 761ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 109 ms.
[2024-05-22 01:49:33] [INFO ] After 1076ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 12 ms.
Support contains 5 out of 352 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 296/296 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 352 transition count 294
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 8 place count 352 transition count 294
Applied a total of 8 rules in 11 ms. Remains 352 /352 variables (removed 0) and now considering 294/296 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 352/352 places, 294/296 transitions.
Incomplete random walk after 10000 steps, including 133 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1501967 steps, run timeout after 3001 ms. (steps per millisecond=500 ) properties seen :{}
Probabilistic random walk after 1501967 steps, saw 209691 distinct states, run finished after 3001 ms. (steps per millisecond=500 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 294 rows 352 cols
[2024-05-22 01:49:36] [INFO ] Computed 60 invariants in 10 ms
[2024-05-22 01:49:36] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-22 01:49:36] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 17 ms returned sat
[2024-05-22 01:49:36] [INFO ] After 92ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 01:49:36] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-22 01:49:36] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 148 ms returned sat
[2024-05-22 01:49:37] [INFO ] After 781ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 01:49:37] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-22 01:49:37] [INFO ] After 225ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-22 01:49:37] [INFO ] After 315ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 83 ms.
[2024-05-22 01:49:37] [INFO ] After 1451ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 8 ms.
Support contains 5 out of 352 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 294/294 transitions.
Applied a total of 0 rules in 5 ms. Remains 352 /352 variables (removed 0) and now considering 294/294 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 352/352 places, 294/294 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 294/294 transitions.
Applied a total of 0 rules in 5 ms. Remains 352 /352 variables (removed 0) and now considering 294/294 (removed 0) transitions.
[2024-05-22 01:49:37] [INFO ] Invariant cache hit.
[2024-05-22 01:49:38] [INFO ] Implicit Places using invariants in 177 ms returned []
[2024-05-22 01:49:38] [INFO ] Invariant cache hit.
[2024-05-22 01:49:38] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-22 01:49:38] [INFO ] Implicit Places using invariants and state equation in 410 ms returned []
Implicit Place search using SMT with State Equation took 626 ms to find 0 implicit places.
[2024-05-22 01:49:38] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-22 01:49:38] [INFO ] Invariant cache hit.
[2024-05-22 01:49:38] [INFO ] Dead Transitions using invariants and state equation in 144 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 784 ms. Remains : 352/352 places, 294/294 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 352 transition count 294
Applied a total of 1 rules in 23 ms. Remains 352 /352 variables (removed 0) and now considering 294/294 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 294 rows 352 cols
[2024-05-22 01:49:38] [INFO ] Computed 60 invariants in 4 ms
[2024-05-22 01:49:38] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2024-05-22 01:49:38] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 16 ms returned sat
[2024-05-22 01:49:38] [INFO ] After 149ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 01:49:39] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-22 01:49:39] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 146 ms returned sat
[2024-05-22 01:49:39] [INFO ] After 501ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 01:49:39] [INFO ] After 625ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 144 ms.
[2024-05-22 01:49:40] [INFO ] After 1056ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 69 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 41 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[true, (NOT p0)]
Product exploration explored 100000 steps with 2227 reset in 222 ms.
Product exploration explored 100000 steps with 2234 reset in 239 ms.
Built C files in :
/tmp/ltsmin14095940917734829466
[2024-05-22 01:49:40] [INFO ] Computing symmetric may disable matrix : 296 transitions.
[2024-05-22 01:49:40] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:49:40] [INFO ] Computing symmetric may enable matrix : 296 transitions.
[2024-05-22 01:49:40] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:49:40] [INFO ] Computing Do-Not-Accords matrix : 296 transitions.
[2024-05-22 01:49:40] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:49:40] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14095940917734829466
Running compilation step : cd /tmp/ltsmin14095940917734829466;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 628 ms.
Running link step : cd /tmp/ltsmin14095940917734829466;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin14095940917734829466;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16897901074618267505.hoa' '--buchi-type=spotba'
LTSmin run took 4792 ms.
FORMULA DES-PT-60a-LTLFireability-14 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DES-PT-60a-LTLFireability-14 finished in 30678 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 353 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 353/353 places, 297/297 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 352 transition count 296
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 352 transition count 296
Applied a total of 2 rules in 7 ms. Remains 352 /353 variables (removed 1) and now considering 296/297 (removed 1) transitions.
// Phase 1: matrix 296 rows 352 cols
[2024-05-22 01:49:46] [INFO ] Computed 58 invariants in 3 ms
[2024-05-22 01:49:46] [INFO ] Implicit Places using invariants in 180 ms returned []
[2024-05-22 01:49:46] [INFO ] Invariant cache hit.
[2024-05-22 01:49:46] [INFO ] Implicit Places using invariants and state equation in 407 ms returned []
Implicit Place search using SMT with State Equation took 632 ms to find 0 implicit places.
[2024-05-22 01:49:46] [INFO ] Invariant cache hit.
[2024-05-22 01:49:46] [INFO ] Dead Transitions using invariants and state equation in 176 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 352/353 places, 296/297 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 816 ms. Remains : 352/353 places, 296/297 transitions.
Stuttering acceptance computed with spot in 56 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-60a-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (NEQ s304 1) (NEQ s320 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 495 ms.
Product exploration explored 100000 steps with 50000 reset in 500 ms.
Computed a total of 255 stabilizing places and 250 stable transitions
Computed a total of 255 stabilizing places and 250 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 18 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DES-PT-60a-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-60a-LTLFireability-15 finished in 1900 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(X(F(p0)))&&G(p1))))'
Found a Shortening insensitive property : DES-PT-60a-LTLFireability-00
Stuttering acceptance computed with spot in 134 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p0)]
Support contains 6 out of 353 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 353/353 places, 297/297 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 352 transition count 296
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 352 transition count 296
Applied a total of 2 rules in 13 ms. Remains 352 /353 variables (removed 1) and now considering 296/297 (removed 1) transitions.
[2024-05-22 01:49:48] [INFO ] Invariant cache hit.
[2024-05-22 01:49:48] [INFO ] Implicit Places using invariants in 245 ms returned []
[2024-05-22 01:49:48] [INFO ] Invariant cache hit.
[2024-05-22 01:49:48] [INFO ] Implicit Places using invariants and state equation in 364 ms returned []
Implicit Place search using SMT with State Equation took 625 ms to find 0 implicit places.
[2024-05-22 01:49:48] [INFO ] Invariant cache hit.
[2024-05-22 01:49:49] [INFO ] Dead Transitions using invariants and state equation in 145 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 352/353 places, 296/297 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 828 ms. Remains : 352/353 places, 296/297 transitions.
Running random walk in product with property : DES-PT-60a-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(OR (NEQ s199 1) (NEQ s244 1)), p0:(OR (EQ s188 0) (EQ s244 0) (EQ s10 0) (EQ s271 0) (EQ s273 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 4132 reset in 218 ms.
Product exploration explored 100000 steps with 4252 reset in 240 ms.
Computed a total of 255 stabilizing places and 250 stable transitions
Computed a total of 255 stabilizing places and 250 stable transitions
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p1)), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 101 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 137 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p0)]
Incomplete random walk after 10000 steps, including 225 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 64 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 63 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 756310 steps, run timeout after 3001 ms. (steps per millisecond=252 ) properties seen :{}
Probabilistic random walk after 756310 steps, saw 114984 distinct states, run finished after 3001 ms. (steps per millisecond=252 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-22 01:49:52] [INFO ] Invariant cache hit.
[2024-05-22 01:49:53] [INFO ] [Real]Absence check using 33 positive place invariants in 4 ms returned sat
[2024-05-22 01:49:53] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 13 ms returned sat
[2024-05-22 01:49:53] [INFO ] After 136ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-22 01:49:53] [INFO ] [Nat]Absence check using 33 positive place invariants in 5 ms returned sat
[2024-05-22 01:49:53] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 120 ms returned sat
[2024-05-22 01:49:53] [INFO ] After 573ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-22 01:49:54] [INFO ] After 817ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 389 ms.
[2024-05-22 01:49:54] [INFO ] After 1425ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 64 ms.
Support contains 6 out of 352 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 296/296 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 352 transition count 294
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 7 place count 352 transition count 294
Applied a total of 7 rules in 11 ms. Remains 352 /352 variables (removed 0) and now considering 294/296 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 352/352 places, 294/296 transitions.
Incomplete random walk after 10000 steps, including 133 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 74 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 72 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 798688 steps, run timeout after 3001 ms. (steps per millisecond=266 ) properties seen :{}
Probabilistic random walk after 798688 steps, saw 114231 distinct states, run finished after 3001 ms. (steps per millisecond=266 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 294 rows 352 cols
[2024-05-22 01:49:57] [INFO ] Computed 60 invariants in 3 ms
[2024-05-22 01:49:57] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-22 01:49:57] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 14 ms returned sat
[2024-05-22 01:49:57] [INFO ] After 93ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-22 01:49:57] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-22 01:49:57] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 161 ms returned sat
[2024-05-22 01:49:58] [INFO ] After 485ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-22 01:49:58] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-22 01:49:58] [INFO ] After 130ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-22 01:49:58] [INFO ] After 375ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 146 ms.
[2024-05-22 01:49:59] [INFO ] After 1272ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 46 ms.
Support contains 6 out of 352 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 294/294 transitions.
Applied a total of 0 rules in 5 ms. Remains 352 /352 variables (removed 0) and now considering 294/294 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 352/352 places, 294/294 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 294/294 transitions.
Applied a total of 0 rules in 5 ms. Remains 352 /352 variables (removed 0) and now considering 294/294 (removed 0) transitions.
[2024-05-22 01:49:59] [INFO ] Invariant cache hit.
[2024-05-22 01:49:59] [INFO ] Implicit Places using invariants in 200 ms returned []
[2024-05-22 01:49:59] [INFO ] Invariant cache hit.
[2024-05-22 01:49:59] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-22 01:49:59] [INFO ] Implicit Places using invariants and state equation in 489 ms returned []
Implicit Place search using SMT with State Equation took 701 ms to find 0 implicit places.
[2024-05-22 01:49:59] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-22 01:49:59] [INFO ] Invariant cache hit.
[2024-05-22 01:49:59] [INFO ] Dead Transitions using invariants and state equation in 144 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 868 ms. Remains : 352/352 places, 294/294 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 352 transition count 294
Applied a total of 1 rules in 12 ms. Remains 352 /352 variables (removed 0) and now considering 294/294 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 294 rows 352 cols
[2024-05-22 01:49:59] [INFO ] Computed 60 invariants in 3 ms
[2024-05-22 01:50:00] [INFO ] [Real]Absence check using 36 positive place invariants in 4 ms returned sat
[2024-05-22 01:50:00] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 13 ms returned sat
[2024-05-22 01:50:00] [INFO ] After 105ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-22 01:50:00] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2024-05-22 01:50:00] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 161 ms returned sat
[2024-05-22 01:50:00] [INFO ] After 342ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-22 01:50:00] [INFO ] After 464ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 158 ms.
[2024-05-22 01:50:00] [INFO ] After 880ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p1)), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 74 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 129 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 112 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p0)]
Support contains 6 out of 352 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 352/352 places, 296/296 transitions.
Applied a total of 0 rules in 3 ms. Remains 352 /352 variables (removed 0) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 352 cols
[2024-05-22 01:50:01] [INFO ] Computed 58 invariants in 5 ms
[2024-05-22 01:50:01] [INFO ] Implicit Places using invariants in 172 ms returned []
[2024-05-22 01:50:01] [INFO ] Invariant cache hit.
[2024-05-22 01:50:01] [INFO ] Implicit Places using invariants and state equation in 376 ms returned []
Implicit Place search using SMT with State Equation took 582 ms to find 0 implicit places.
[2024-05-22 01:50:01] [INFO ] Invariant cache hit.
[2024-05-22 01:50:02] [INFO ] Dead Transitions using invariants and state equation in 148 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 747 ms. Remains : 352/352 places, 296/296 transitions.
Computed a total of 255 stabilizing places and 250 stable transitions
Computed a total of 255 stabilizing places and 250 stable transitions
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p1)), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 137 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 167 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p0)]
Incomplete random walk after 10000 steps, including 221 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 65 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 66 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 917613 steps, run timeout after 3001 ms. (steps per millisecond=305 ) properties seen :{}
Probabilistic random walk after 917613 steps, saw 133457 distinct states, run finished after 3001 ms. (steps per millisecond=305 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-22 01:50:05] [INFO ] Invariant cache hit.
[2024-05-22 01:50:05] [INFO ] [Real]Absence check using 33 positive place invariants in 4 ms returned sat
[2024-05-22 01:50:05] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 14 ms returned sat
[2024-05-22 01:50:05] [INFO ] After 105ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-22 01:50:05] [INFO ] [Nat]Absence check using 33 positive place invariants in 5 ms returned sat
[2024-05-22 01:50:05] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 118 ms returned sat
[2024-05-22 01:50:06] [INFO ] After 569ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-22 01:50:06] [INFO ] After 819ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 374 ms.
[2024-05-22 01:50:07] [INFO ] After 1416ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 115 ms.
Support contains 6 out of 352 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 296/296 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 352 transition count 294
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 7 place count 352 transition count 294
Applied a total of 7 rules in 26 ms. Remains 352 /352 variables (removed 0) and now considering 294/296 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 352/352 places, 294/296 transitions.
Incomplete random walk after 10000 steps, including 129 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 72 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 72 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 802671 steps, run timeout after 3001 ms. (steps per millisecond=267 ) properties seen :{}
Probabilistic random walk after 802671 steps, saw 114717 distinct states, run finished after 3001 ms. (steps per millisecond=267 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 294 rows 352 cols
[2024-05-22 01:50:10] [INFO ] Computed 60 invariants in 3 ms
[2024-05-22 01:50:10] [INFO ] [Real]Absence check using 36 positive place invariants in 4 ms returned sat
[2024-05-22 01:50:10] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 14 ms returned sat
[2024-05-22 01:50:10] [INFO ] After 98ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-22 01:50:10] [INFO ] [Nat]Absence check using 36 positive place invariants in 13 ms returned sat
[2024-05-22 01:50:10] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 175 ms returned sat
[2024-05-22 01:50:11] [INFO ] After 478ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-22 01:50:11] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-22 01:50:11] [INFO ] After 134ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-22 01:50:11] [INFO ] After 377ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 147 ms.
[2024-05-22 01:50:11] [INFO ] After 1283ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 95 ms.
Support contains 6 out of 352 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 294/294 transitions.
Applied a total of 0 rules in 7 ms. Remains 352 /352 variables (removed 0) and now considering 294/294 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 352/352 places, 294/294 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 294/294 transitions.
Applied a total of 0 rules in 5 ms. Remains 352 /352 variables (removed 0) and now considering 294/294 (removed 0) transitions.
[2024-05-22 01:50:11] [INFO ] Invariant cache hit.
[2024-05-22 01:50:11] [INFO ] Implicit Places using invariants in 171 ms returned []
[2024-05-22 01:50:11] [INFO ] Invariant cache hit.
[2024-05-22 01:50:12] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-22 01:50:12] [INFO ] Implicit Places using invariants and state equation in 500 ms returned []
Implicit Place search using SMT with State Equation took 703 ms to find 0 implicit places.
[2024-05-22 01:50:12] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-22 01:50:12] [INFO ] Invariant cache hit.
[2024-05-22 01:50:12] [INFO ] Dead Transitions using invariants and state equation in 142 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 875 ms. Remains : 352/352 places, 294/294 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 352 transition count 294
Applied a total of 1 rules in 10 ms. Remains 352 /352 variables (removed 0) and now considering 294/294 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 294 rows 352 cols
[2024-05-22 01:50:12] [INFO ] Computed 60 invariants in 4 ms
[2024-05-22 01:50:12] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-22 01:50:12] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 14 ms returned sat
[2024-05-22 01:50:12] [INFO ] After 107ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-22 01:50:12] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2024-05-22 01:50:13] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 159 ms returned sat
[2024-05-22 01:50:13] [INFO ] After 346ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-22 01:50:13] [INFO ] After 474ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 166 ms.
[2024-05-22 01:50:13] [INFO ] After 899ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p1)), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 77 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 145 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 168 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 126 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p0)]
Product exploration explored 100000 steps with 4185 reset in 229 ms.
Product exploration explored 100000 steps with 4162 reset in 239 ms.
Applying partial POR strategy [false, false, false, true]
Stuttering acceptance computed with spot in 127 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p0)]
Support contains 6 out of 352 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 352/352 places, 296/296 transitions.
Applied a total of 0 rules in 6 ms. Remains 352 /352 variables (removed 0) and now considering 296/296 (removed 0) transitions.
[2024-05-22 01:50:14] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 296 rows 352 cols
[2024-05-22 01:50:14] [INFO ] Computed 58 invariants in 3 ms
[2024-05-22 01:50:15] [INFO ] Dead Transitions using invariants and state equation in 156 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 220 ms. Remains : 352/352 places, 296/296 transitions.
Built C files in :
/tmp/ltsmin3872354673654040636
[2024-05-22 01:50:15] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3872354673654040636
Running compilation step : cd /tmp/ltsmin3872354673654040636;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 489 ms.
Running link step : cd /tmp/ltsmin3872354673654040636;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin3872354673654040636;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased8729873680616447078.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 352 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 352/352 places, 296/296 transitions.
Applied a total of 0 rules in 3 ms. Remains 352 /352 variables (removed 0) and now considering 296/296 (removed 0) transitions.
[2024-05-22 01:50:30] [INFO ] Invariant cache hit.
[2024-05-22 01:50:30] [INFO ] Implicit Places using invariants in 169 ms returned []
[2024-05-22 01:50:30] [INFO ] Invariant cache hit.
[2024-05-22 01:50:30] [INFO ] Implicit Places using invariants and state equation in 363 ms returned []
Implicit Place search using SMT with State Equation took 553 ms to find 0 implicit places.
[2024-05-22 01:50:30] [INFO ] Invariant cache hit.
[2024-05-22 01:50:30] [INFO ] Dead Transitions using invariants and state equation in 142 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 708 ms. Remains : 352/352 places, 296/296 transitions.
Built C files in :
/tmp/ltsmin366975602860437567
[2024-05-22 01:50:30] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin366975602860437567
Running compilation step : cd /tmp/ltsmin366975602860437567;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 477 ms.
Running link step : cd /tmp/ltsmin366975602860437567;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin366975602860437567;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased17580584375428611343.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-22 01:50:46] [INFO ] Flatten gal took : 10 ms
[2024-05-22 01:50:46] [INFO ] Flatten gal took : 10 ms
[2024-05-22 01:50:46] [INFO ] Time to serialize gal into /tmp/LTL12524225898779431000.gal : 2 ms
[2024-05-22 01:50:46] [INFO ] Time to serialize properties into /tmp/LTL17937109533191009489.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12524225898779431000.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15680782943549692595.hoa' '-atoms' '/tmp/LTL17937109533191009489.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL17937109533191009489.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15680782943549692595.hoa
Detected timeout of ITS tools.
[2024-05-22 01:51:01] [INFO ] Flatten gal took : 15 ms
[2024-05-22 01:51:01] [INFO ] Flatten gal took : 19 ms
[2024-05-22 01:51:01] [INFO ] Time to serialize gal into /tmp/LTL12088745070298069415.gal : 3 ms
[2024-05-22 01:51:01] [INFO ] Time to serialize properties into /tmp/LTL17639130697681081735.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12088745070298069415.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17639130697681081735.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F((X(X(F("((((p188==0)||(p244==0))||((p10==0)||(p272==0)))||(p274==0))"))))&&(G("((p199!=1)||(p244!=1))")))))
Formula 0 simplified : G(XXG!"((((p188==0)||(p244==0))||((p10==0)||(p272==0)))||(p274==0))" | F!"((p199!=1)||(p244!=1))")
Detected timeout of ITS tools.
[2024-05-22 01:51:16] [INFO ] Flatten gal took : 11 ms
[2024-05-22 01:51:16] [INFO ] Applying decomposition
[2024-05-22 01:51:16] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph8290078224431723249.txt' '-o' '/tmp/graph8290078224431723249.bin' '-w' '/tmp/graph8290078224431723249.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph8290078224431723249.bin' '-l' '-1' '-v' '-w' '/tmp/graph8290078224431723249.weights' '-q' '0' '-e' '0.001'
[2024-05-22 01:51:16] [INFO ] Decomposing Gal with order
[2024-05-22 01:51:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 01:51:16] [INFO ] Removed a total of 62 redundant transitions.
[2024-05-22 01:51:16] [INFO ] Flatten gal took : 41 ms
[2024-05-22 01:51:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 52 labels/synchronizations in 3 ms.
[2024-05-22 01:51:16] [INFO ] Time to serialize gal into /tmp/LTL14746444721595633108.gal : 22 ms
[2024-05-22 01:51:16] [INFO ] Time to serialize properties into /tmp/LTL12619505061424046817.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14746444721595633108.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12619505061424046817.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((F((X(X(F("((((u2.p188==0)||(u2.p244==0))||((i3.u13.p10==0)||(i3.u13.p272==0)))||(i3.u14.p274==0))"))))&&(G("((u2.p199!=1)||(u2.p244...166
Formula 0 simplified : G(XXG!"((((u2.p188==0)||(u2.p244==0))||((i3.u13.p10==0)||(i3.u13.p272==0)))||(i3.u14.p274==0))" | F!"((u2.p199!=1)||(u2.p244!=1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13138231733983063255
[2024-05-22 01:51:31] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13138231733983063255
Running compilation step : cd /tmp/ltsmin13138231733983063255;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 492 ms.
Running link step : cd /tmp/ltsmin13138231733983063255;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin13138231733983063255;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>((X(X(<>((LTLAPp0==true))))&&[]((LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DES-PT-60a-LTLFireability-00 finished in 118529 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X(p0)||(p0 U (p1 U X(!p2)))))))'
Found a Lengthening insensitive property : DES-PT-60a-LTLFireability-07
Stuttering acceptance computed with spot in 189 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), false]
Support contains 8 out of 353 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 353/353 places, 297/297 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 352 transition count 296
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 352 transition count 296
Applied a total of 2 rules in 9 ms. Remains 352 /353 variables (removed 1) and now considering 296/297 (removed 1) transitions.
[2024-05-22 01:51:46] [INFO ] Invariant cache hit.
[2024-05-22 01:51:47] [INFO ] Implicit Places using invariants in 181 ms returned []
[2024-05-22 01:51:47] [INFO ] Invariant cache hit.
[2024-05-22 01:51:47] [INFO ] Implicit Places using invariants and state equation in 361 ms returned []
Implicit Place search using SMT with State Equation took 569 ms to find 0 implicit places.
[2024-05-22 01:51:47] [INFO ] Invariant cache hit.
[2024-05-22 01:51:47] [INFO ] Dead Transitions using invariants and state equation in 144 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 352/353 places, 296/297 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 733 ms. Remains : 352/353 places, 296/297 transitions.
Running random walk in product with property : DES-PT-60a-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 1}, { cond=(OR p1 p0), acceptance={0} source=0 dest: 2}], [{ cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0) p2), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0) p2), acceptance={0} source=2 dest: 1}, { cond=(AND p1 (NOT p0) p2), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=2 dest: 4}], [{ cond=p2, acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={0} source=3 dest: 1}, { cond=(OR (AND p1 p2) (AND p0 p2)), acceptance={0} source=3 dest: 2}], [{ cond=(AND p0 p2), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=4 dest: 3}, { cond=(AND p1 p0 p2), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(AND (EQ s221 1) (EQ s244 1)), p0:(AND (EQ s260 1) (EQ s265 1) (EQ s267 1)), p2:(AND (EQ s8 1) (EQ s271 1) (EQ s273 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33417 reset in 398 ms.
Product exploration explored 100000 steps with 33533 reset in 412 ms.
Computed a total of 255 stabilizing places and 250 stable transitions
Computed a total of 255 stabilizing places and 250 stable transitions
Detected a total of 255/352 stabilizing places and 250/296 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND p1 (NOT p0) p2))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (X (NOT p2))), true, (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT (OR p1 p0)))), (X (X (NOT (AND p1 p0 p2)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (OR (AND p1 p2) (AND p0 p2))))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 16 factoid took 236 ms. Reduced automaton from 5 states, 16 edges and 3 AP (stutter sensitive) to 9 states, 30 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 345 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), false, false, false, false, false, false]
Incomplete random walk after 10000 steps, including 219 resets, run finished after 345 ms. (steps per millisecond=28 ) properties (out of 8) seen :2
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 49 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 63 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 47 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 43 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2024-05-22 01:51:49] [INFO ] Invariant cache hit.
[2024-05-22 01:51:49] [INFO ] [Real]Absence check using 33 positive place invariants in 5 ms returned sat
[2024-05-22 01:51:49] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 15 ms returned sat
[2024-05-22 01:51:49] [INFO ] After 152ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-22 01:51:49] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2024-05-22 01:51:49] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 14 ms returned sat
[2024-05-22 01:51:50] [INFO ] After 645ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :4
[2024-05-22 01:51:50] [INFO ] After 984ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :4
Attempting to minimize the solution found.
Minimization took 286 ms.
[2024-05-22 01:51:51] [INFO ] After 1506ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :4
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 496 ms.
Support contains 8 out of 352 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 296/296 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 352 transition count 294
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 7 place count 352 transition count 294
Applied a total of 7 rules in 10 ms. Remains 352 /352 variables (removed 0) and now considering 294/296 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 352/352 places, 294/296 transitions.
Incomplete random walk after 10000 steps, including 133 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 19 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 838331 steps, run timeout after 3001 ms. (steps per millisecond=279 ) properties seen :{}
Probabilistic random walk after 838331 steps, saw 119372 distinct states, run finished after 3001 ms. (steps per millisecond=279 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 294 rows 352 cols
[2024-05-22 01:51:54] [INFO ] Computed 60 invariants in 3 ms
[2024-05-22 01:51:54] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-22 01:51:54] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 14 ms returned sat
[2024-05-22 01:51:54] [INFO ] After 125ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-22 01:51:55] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-22 01:51:55] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 152 ms returned sat
[2024-05-22 01:52:11] [INFO ] After 16180ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-22 01:52:11] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-22 01:52:12] [INFO ] After 900ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-22 01:52:12] [INFO ] After 1499ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 598 ms.
[2024-05-22 01:52:13] [INFO ] After 18545ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 195 ms.
Support contains 8 out of 352 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 294/294 transitions.
Applied a total of 0 rules in 11 ms. Remains 352 /352 variables (removed 0) and now considering 294/294 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 352/352 places, 294/294 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 294/294 transitions.
Applied a total of 0 rules in 5 ms. Remains 352 /352 variables (removed 0) and now considering 294/294 (removed 0) transitions.
[2024-05-22 01:52:13] [INFO ] Invariant cache hit.
[2024-05-22 01:52:13] [INFO ] Implicit Places using invariants in 174 ms returned []
[2024-05-22 01:52:13] [INFO ] Invariant cache hit.
[2024-05-22 01:52:14] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-22 01:52:14] [INFO ] Implicit Places using invariants and state equation in 482 ms returned []
Implicit Place search using SMT with State Equation took 699 ms to find 0 implicit places.
[2024-05-22 01:52:14] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-22 01:52:14] [INFO ] Invariant cache hit.
[2024-05-22 01:52:14] [INFO ] Dead Transitions using invariants and state equation in 186 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 897 ms. Remains : 352/352 places, 294/294 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 352 transition count 294
Applied a total of 1 rules in 9 ms. Remains 352 /352 variables (removed 0) and now considering 294/294 (removed 0) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 294 rows 352 cols
[2024-05-22 01:52:14] [INFO ] Computed 60 invariants in 4 ms
[2024-05-22 01:52:14] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-22 01:52:14] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 15 ms returned sat
[2024-05-22 01:52:14] [INFO ] After 127ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-22 01:52:14] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2024-05-22 01:52:14] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 152 ms returned sat
[2024-05-22 01:52:25] [INFO ] After 10374ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-22 01:52:26] [INFO ] After 11281ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 694 ms.
[2024-05-22 01:52:26] [INFO ] After 12243ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND p1 (NOT p0) p2))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (X (NOT p2))), true, (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT (OR p1 p0)))), (X (X (NOT (AND p1 p0 p2)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (OR (AND p1 p2) (AND p0 p2))))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (F (OR (G p2) (G (NOT p2)))), (G (NOT (AND (NOT p0) p2 p1))), (G (NOT (AND p0 p2 p1)))]
False Knowledge obtained : [(F (OR p0 p1)), (F (NOT (AND (NOT p0) (NOT p2) (NOT p1))))]
Knowledge based reduction with 18 factoid took 512 ms. Reduced automaton from 9 states, 30 edges and 3 AP (stutter insensitive) to 5 states, 16 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 186 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), false, false]
Stuttering acceptance computed with spot in 173 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), false, false]
Support contains 8 out of 352 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 352/352 places, 296/296 transitions.
Applied a total of 0 rules in 10 ms. Remains 352 /352 variables (removed 0) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 352 cols
[2024-05-22 01:52:27] [INFO ] Computed 58 invariants in 8 ms
[2024-05-22 01:52:28] [INFO ] Implicit Places using invariants in 178 ms returned []
[2024-05-22 01:52:28] [INFO ] Invariant cache hit.
[2024-05-22 01:52:28] [INFO ] Implicit Places using invariants and state equation in 372 ms returned []
Implicit Place search using SMT with State Equation took 580 ms to find 0 implicit places.
[2024-05-22 01:52:28] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-22 01:52:28] [INFO ] Invariant cache hit.
[2024-05-22 01:52:28] [INFO ] Dead Transitions using invariants and state equation in 156 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 755 ms. Remains : 352/352 places, 296/296 transitions.
Computed a total of 255 stabilizing places and 250 stable transitions
Computed a total of 255 stabilizing places and 250 stable transitions
Detected a total of 255/352 stabilizing places and 250/296 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT (OR p0 p1))), (X (NOT (AND (NOT p0) p2 p1))), (X (OR p0 (NOT p2))), (X (AND (NOT p0) (NOT p2) (NOT p1))), (X (NOT (AND p0 p2))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT (AND (NOT p0) p2))), (X (X (NOT (OR p0 p1)))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (OR p0 (NOT p2)))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) p2)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 180 ms. Reduced automaton from 5 states, 16 edges and 3 AP (stutter insensitive) to 5 states, 16 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 177 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), false, false]
Incomplete random walk after 10000 steps, including 218 resets, run finished after 249 ms. (steps per millisecond=40 ) properties (out of 7) seen :2
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 52 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 63 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2024-05-22 01:52:29] [INFO ] Invariant cache hit.
[2024-05-22 01:52:29] [INFO ] [Real]Absence check using 33 positive place invariants in 5 ms returned sat
[2024-05-22 01:52:29] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 30 ms returned sat
[2024-05-22 01:52:29] [INFO ] After 126ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-22 01:52:29] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2024-05-22 01:52:29] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 16 ms returned sat
[2024-05-22 01:52:33] [INFO ] After 3384ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :4
[2024-05-22 01:52:34] [INFO ] After 4394ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :4
Attempting to minimize the solution found.
Minimization took 1218 ms.
[2024-05-22 01:52:35] [INFO ] After 5814ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :4
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 2 properties in 157 ms.
Support contains 8 out of 352 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 296/296 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 352 transition count 294
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 7 place count 352 transition count 294
Applied a total of 7 rules in 12 ms. Remains 352 /352 variables (removed 0) and now considering 294/296 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 352/352 places, 294/296 transitions.
Incomplete random walk after 10000 steps, including 130 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 828555 steps, run timeout after 3001 ms. (steps per millisecond=276 ) properties seen :{}
Probabilistic random walk after 828555 steps, saw 118010 distinct states, run finished after 3001 ms. (steps per millisecond=276 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 294 rows 352 cols
[2024-05-22 01:52:38] [INFO ] Computed 60 invariants in 3 ms
[2024-05-22 01:52:38] [INFO ] [Real]Absence check using 36 positive place invariants in 4 ms returned sat
[2024-05-22 01:52:38] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 14 ms returned sat
[2024-05-22 01:52:38] [INFO ] After 92ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-22 01:52:38] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-22 01:52:38] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 152 ms returned sat
[2024-05-22 01:52:41] [INFO ] After 2787ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-22 01:52:41] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-22 01:52:41] [INFO ] After 143ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-22 01:52:42] [INFO ] After 316ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 143 ms.
[2024-05-22 01:52:42] [INFO ] After 3503ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 85 ms.
Support contains 8 out of 352 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 294/294 transitions.
Applied a total of 0 rules in 5 ms. Remains 352 /352 variables (removed 0) and now considering 294/294 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 352/352 places, 294/294 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 294/294 transitions.
Applied a total of 0 rules in 5 ms. Remains 352 /352 variables (removed 0) and now considering 294/294 (removed 0) transitions.
[2024-05-22 01:52:42] [INFO ] Invariant cache hit.
[2024-05-22 01:52:42] [INFO ] Implicit Places using invariants in 200 ms returned []
[2024-05-22 01:52:42] [INFO ] Invariant cache hit.
[2024-05-22 01:52:42] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-22 01:52:43] [INFO ] Implicit Places using invariants and state equation in 492 ms returned []
Implicit Place search using SMT with State Equation took 703 ms to find 0 implicit places.
[2024-05-22 01:52:43] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-22 01:52:43] [INFO ] Invariant cache hit.
[2024-05-22 01:52:43] [INFO ] Dead Transitions using invariants and state equation in 144 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 884 ms. Remains : 352/352 places, 294/294 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 352 transition count 294
Applied a total of 1 rules in 11 ms. Remains 352 /352 variables (removed 0) and now considering 294/294 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 294 rows 352 cols
[2024-05-22 01:52:43] [INFO ] Computed 60 invariants in 3 ms
[2024-05-22 01:52:43] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-22 01:52:43] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 15 ms returned sat
[2024-05-22 01:52:43] [INFO ] After 103ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-22 01:52:43] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-22 01:52:43] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 172 ms returned sat
[2024-05-22 01:52:45] [INFO ] After 2295ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-22 01:52:46] [INFO ] After 2519ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 185 ms.
[2024-05-22 01:52:46] [INFO ] After 2962ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT (OR p0 p1))), (X (NOT (AND (NOT p0) p2 p1))), (X (OR p0 (NOT p2))), (X (AND (NOT p0) (NOT p2) (NOT p1))), (X (NOT (AND p0 p2))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT (AND (NOT p0) p2))), (X (X (NOT (OR p0 p1)))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (OR p0 (NOT p2)))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) p2)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (AND (NOT p0) p2 p1)), (F (OR p0 p1)), (F (NOT (OR p0 (NOT p2)))), (F (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (F (AND (NOT p0) p2))]
Knowledge based reduction with 16 factoid took 463 ms. Reduced automaton from 5 states, 16 edges and 3 AP (stutter insensitive) to 5 states, 16 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 172 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), false, false]
Stuttering acceptance computed with spot in 158 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), false, false]
Stuttering acceptance computed with spot in 217 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), false, false]
Product exploration explored 100000 steps with 33370 reset in 419 ms.
Product exploration explored 100000 steps with 33372 reset in 433 ms.
Built C files in :
/tmp/ltsmin7565798911543893478
[2024-05-22 01:52:48] [INFO ] Computing symmetric may disable matrix : 296 transitions.
[2024-05-22 01:52:48] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:52:48] [INFO ] Computing symmetric may enable matrix : 296 transitions.
[2024-05-22 01:52:48] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:52:48] [INFO ] Computing Do-Not-Accords matrix : 296 transitions.
[2024-05-22 01:52:48] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:52:48] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7565798911543893478
Running compilation step : cd /tmp/ltsmin7565798911543893478;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 637 ms.
Running link step : cd /tmp/ltsmin7565798911543893478;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin7565798911543893478;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13851408881731085571.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 8 out of 352 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 352/352 places, 296/296 transitions.
Applied a total of 0 rules in 6 ms. Remains 352 /352 variables (removed 0) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 352 cols
[2024-05-22 01:53:03] [INFO ] Computed 58 invariants in 3 ms
[2024-05-22 01:53:03] [INFO ] Implicit Places using invariants in 178 ms returned []
[2024-05-22 01:53:03] [INFO ] Invariant cache hit.
[2024-05-22 01:53:03] [INFO ] Implicit Places using invariants and state equation in 379 ms returned []
Implicit Place search using SMT with State Equation took 601 ms to find 0 implicit places.
[2024-05-22 01:53:03] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-22 01:53:03] [INFO ] Invariant cache hit.
[2024-05-22 01:53:04] [INFO ] Dead Transitions using invariants and state equation in 152 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 783 ms. Remains : 352/352 places, 296/296 transitions.
Built C files in :
/tmp/ltsmin9437446808978759070
[2024-05-22 01:53:04] [INFO ] Computing symmetric may disable matrix : 296 transitions.
[2024-05-22 01:53:04] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:53:04] [INFO ] Computing symmetric may enable matrix : 296 transitions.
[2024-05-22 01:53:04] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:53:04] [INFO ] Computing Do-Not-Accords matrix : 296 transitions.
[2024-05-22 01:53:04] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:53:04] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9437446808978759070
Running compilation step : cd /tmp/ltsmin9437446808978759070;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 637 ms.
Running link step : cd /tmp/ltsmin9437446808978759070;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin9437446808978759070;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6377559296061846150.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-22 01:53:19] [INFO ] Flatten gal took : 14 ms
[2024-05-22 01:53:19] [INFO ] Flatten gal took : 16 ms
[2024-05-22 01:53:19] [INFO ] Time to serialize gal into /tmp/LTL7221531700339088413.gal : 2 ms
[2024-05-22 01:53:19] [INFO ] Time to serialize properties into /tmp/LTL10677262618800638400.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7221531700339088413.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9198892205834920742.hoa' '-atoms' '/tmp/LTL10677262618800638400.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL10677262618800638400.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9198892205834920742.hoa
Detected timeout of ITS tools.
[2024-05-22 01:53:34] [INFO ] Flatten gal took : 10 ms
[2024-05-22 01:53:34] [INFO ] Flatten gal took : 10 ms
[2024-05-22 01:53:34] [INFO ] Time to serialize gal into /tmp/LTL9564894448499276144.gal : 5 ms
[2024-05-22 01:53:34] [INFO ] Time to serialize properties into /tmp/LTL6265959644582301328.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9564894448499276144.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6265959644582301328.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F(G((X("(((p261==1)&&(p266==1))&&(p268==1))"))||(("(((p261==1)&&(p266==1))&&(p268==1))")U(("((p221==1)&&(p244==1))")U(X(!("(((p8==1...190
Formula 0 simplified : GF(X!"(((p261==1)&&(p266==1))&&(p268==1))" & (!"(((p261==1)&&(p266==1))&&(p268==1))" R (!"((p221==1)&&(p244==1))" R X"(((p8==1)&&(p2...178
Detected timeout of ITS tools.
[2024-05-22 01:53:49] [INFO ] Flatten gal took : 13 ms
[2024-05-22 01:53:49] [INFO ] Applying decomposition
[2024-05-22 01:53:49] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph2790307432750183444.txt' '-o' '/tmp/graph2790307432750183444.bin' '-w' '/tmp/graph2790307432750183444.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph2790307432750183444.bin' '-l' '-1' '-v' '-w' '/tmp/graph2790307432750183444.weights' '-q' '0' '-e' '0.001'
[2024-05-22 01:53:49] [INFO ] Decomposing Gal with order
[2024-05-22 01:53:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 01:53:49] [INFO ] Removed a total of 66 redundant transitions.
[2024-05-22 01:53:49] [INFO ] Flatten gal took : 22 ms
[2024-05-22 01:53:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 54 labels/synchronizations in 2 ms.
[2024-05-22 01:53:49] [INFO ] Time to serialize gal into /tmp/LTL809483042691911960.gal : 6 ms
[2024-05-22 01:53:49] [INFO ] Time to serialize properties into /tmp/LTL8701572265254935052.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL809483042691911960.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8701572265254935052.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...253
Read 1 LTL properties
Checking formula 0 : !((F(G((X("(((i0.i1.u7.p261==1)&&(i0.i0.u10.p266==1))&&(i0.i0.u11.p268==1))"))||(("(((i0.i1.u7.p261==1)&&(i0.i0.u10.p266==1))&&(i0.i0....275
Formula 0 simplified : GF(X!"(((i0.i1.u7.p261==1)&&(i0.i0.u10.p266==1))&&(i0.i0.u11.p268==1))" & (!"(((i0.i1.u7.p261==1)&&(i0.i0.u10.p266==1))&&(i0.i0.u11....263
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10442496032503310070
[2024-05-22 01:54:04] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10442496032503310070
Running compilation step : cd /tmp/ltsmin10442496032503310070;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 482 ms.
Running link step : cd /tmp/ltsmin10442496032503310070;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin10442496032503310070;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([]((X((LTLAPp0==true))||((LTLAPp0==true) U ((LTLAPp1==true) U X(!(LTLAPp2==true)))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DES-PT-60a-LTLFireability-07 finished in 152973 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((F(G(p0))&&(X(p2)||p1)))))'
Found a Shortening insensitive property : DES-PT-60a-LTLFireability-08
Stuttering acceptance computed with spot in 143 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Support contains 4 out of 353 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 353/353 places, 297/297 transitions.
Applied a total of 0 rules in 7 ms. Remains 353 /353 variables (removed 0) and now considering 297/297 (removed 0) transitions.
// Phase 1: matrix 297 rows 353 cols
[2024-05-22 01:54:19] [INFO ] Computed 58 invariants in 7 ms
[2024-05-22 01:54:20] [INFO ] Implicit Places using invariants in 276 ms returned []
[2024-05-22 01:54:20] [INFO ] Invariant cache hit.
[2024-05-22 01:54:20] [INFO ] Implicit Places using invariants and state equation in 557 ms returned []
Implicit Place search using SMT with State Equation took 853 ms to find 0 implicit places.
[2024-05-22 01:54:20] [INFO ] Invariant cache hit.
[2024-05-22 01:54:20] [INFO ] Dead Transitions using invariants and state equation in 193 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 1065 ms. Remains : 353/353 places, 297/297 transitions.
Running random walk in product with property : DES-PT-60a-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(OR (EQ s224 0) (EQ s244 0)), p0:(OR (EQ s276 0) (EQ s346 0)), p2:(OR (EQ s224 0) (EQ s244 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 2235 reset in 223 ms.
Product exploration explored 100000 steps with 2223 reset in 229 ms.
Computed a total of 256 stabilizing places and 251 stable transitions
Computed a total of 256 stabilizing places and 251 stable transitions
Knowledge obtained : [(AND p1 p0 p2), (X p1), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 70 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Finished random walk after 10 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=10 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p0 p2), (X p1), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 83 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Support contains 2 out of 353 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 353/353 places, 297/297 transitions.
Applied a total of 0 rules in 8 ms. Remains 353 /353 variables (removed 0) and now considering 297/297 (removed 0) transitions.
[2024-05-22 01:54:21] [INFO ] Invariant cache hit.
[2024-05-22 01:54:21] [INFO ] Implicit Places using invariants in 296 ms returned []
[2024-05-22 01:54:21] [INFO ] Invariant cache hit.
[2024-05-22 01:54:22] [INFO ] Implicit Places using invariants and state equation in 585 ms returned []
Implicit Place search using SMT with State Equation took 910 ms to find 0 implicit places.
[2024-05-22 01:54:22] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-22 01:54:22] [INFO ] Invariant cache hit.
[2024-05-22 01:54:22] [INFO ] Dead Transitions using invariants and state equation in 209 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1151 ms. Remains : 353/353 places, 297/297 transitions.
Computed a total of 256 stabilizing places and 251 stable transitions
Computed a total of 256 stabilizing places and 251 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 77 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Finished random walk after 71 steps, including 1 resets, run visited all 1 properties in 1 ms. (steps per millisecond=71 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 87 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Product exploration explored 100000 steps with 2225 reset in 210 ms.
Product exploration explored 100000 steps with 2222 reset in 231 ms.
Built C files in :
/tmp/ltsmin699163648950881250
[2024-05-22 01:54:23] [INFO ] Computing symmetric may disable matrix : 297 transitions.
[2024-05-22 01:54:23] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:54:23] [INFO ] Computing symmetric may enable matrix : 297 transitions.
[2024-05-22 01:54:23] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:54:23] [INFO ] Computing Do-Not-Accords matrix : 297 transitions.
[2024-05-22 01:54:23] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:54:23] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin699163648950881250
Running compilation step : cd /tmp/ltsmin699163648950881250;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 639 ms.
Running link step : cd /tmp/ltsmin699163648950881250;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin699163648950881250;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14451454718390689529.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 353 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 353/353 places, 297/297 transitions.
Applied a total of 0 rules in 12 ms. Remains 353 /353 variables (removed 0) and now considering 297/297 (removed 0) transitions.
[2024-05-22 01:54:38] [INFO ] Invariant cache hit.
[2024-05-22 01:54:38] [INFO ] Implicit Places using invariants in 281 ms returned []
[2024-05-22 01:54:38] [INFO ] Invariant cache hit.
[2024-05-22 01:54:39] [INFO ] Implicit Places using invariants and state equation in 700 ms returned []
Implicit Place search using SMT with State Equation took 1021 ms to find 0 implicit places.
[2024-05-22 01:54:39] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-22 01:54:39] [INFO ] Invariant cache hit.
[2024-05-22 01:54:39] [INFO ] Dead Transitions using invariants and state equation in 210 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1250 ms. Remains : 353/353 places, 297/297 transitions.
Built C files in :
/tmp/ltsmin3818412897456556395
[2024-05-22 01:54:39] [INFO ] Computing symmetric may disable matrix : 297 transitions.
[2024-05-22 01:54:39] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:54:39] [INFO ] Computing symmetric may enable matrix : 297 transitions.
[2024-05-22 01:54:39] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:54:39] [INFO ] Computing Do-Not-Accords matrix : 297 transitions.
[2024-05-22 01:54:39] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:54:39] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3818412897456556395
Running compilation step : cd /tmp/ltsmin3818412897456556395;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 621 ms.
Running link step : cd /tmp/ltsmin3818412897456556395;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin3818412897456556395;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4145082369730481772.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-22 01:54:54] [INFO ] Flatten gal took : 12 ms
[2024-05-22 01:54:54] [INFO ] Flatten gal took : 10 ms
[2024-05-22 01:54:54] [INFO ] Time to serialize gal into /tmp/LTL14864802965274669827.gal : 4 ms
[2024-05-22 01:54:54] [INFO ] Time to serialize properties into /tmp/LTL2381130917786601071.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14864802965274669827.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12670552396799791284.hoa' '-atoms' '/tmp/LTL2381130917786601071.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL2381130917786601071.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12670552396799791284.hoa
Detected timeout of ITS tools.
[2024-05-22 01:55:10] [INFO ] Flatten gal took : 10 ms
[2024-05-22 01:55:10] [INFO ] Flatten gal took : 10 ms
[2024-05-22 01:55:10] [INFO ] Time to serialize gal into /tmp/LTL8917820592076098541.gal : 2 ms
[2024-05-22 01:55:10] [INFO ] Time to serialize properties into /tmp/LTL14514343910617595818.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8917820592076098541.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14514343910617595818.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(F((F(G("((p277==0)||(p347==0))")))&&(("((p224==0)||(p244==0))")||(X("((p224==0)||(p244==0))")))))))
Formula 0 simplified : X(GF!"((p277==0)||(p347==0))" | G(!"((p224==0)||(p244==0))" & X!"((p224==0)||(p244==0))"))
Detected timeout of ITS tools.
[2024-05-22 01:55:25] [INFO ] Flatten gal took : 13 ms
[2024-05-22 01:55:25] [INFO ] Applying decomposition
[2024-05-22 01:55:25] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph500793472328653047.txt' '-o' '/tmp/graph500793472328653047.bin' '-w' '/tmp/graph500793472328653047.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph500793472328653047.bin' '-l' '-1' '-v' '-w' '/tmp/graph500793472328653047.weights' '-q' '0' '-e' '0.001'
[2024-05-22 01:55:25] [INFO ] Decomposing Gal with order
[2024-05-22 01:55:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 01:55:25] [INFO ] Removed a total of 59 redundant transitions.
[2024-05-22 01:55:25] [INFO ] Flatten gal took : 32 ms
[2024-05-22 01:55:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 51 labels/synchronizations in 3 ms.
[2024-05-22 01:55:25] [INFO ] Time to serialize gal into /tmp/LTL1395722355698589117.gal : 19 ms
[2024-05-22 01:55:25] [INFO ] Time to serialize properties into /tmp/LTL12560453635025661145.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1395722355698589117.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12560453635025661145.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(F((F(G("((i12.u15.p277==0)||(i12.u15.p347==0))")))&&(("((u2.p224==0)||(u2.p244==0))")||(X("((u2.p224==0)||(u2.p244==0))")))))))
Formula 0 simplified : X(GF!"((i12.u15.p277==0)||(i12.u15.p347==0))" | G(!"((u2.p224==0)||(u2.p244==0))" & X!"((u2.p224==0)||(u2.p244==0))"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11902343596406474824
[2024-05-22 01:55:40] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11902343596406474824
Running compilation step : cd /tmp/ltsmin11902343596406474824;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 481 ms.
Running link step : cd /tmp/ltsmin11902343596406474824;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin11902343596406474824;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>((<>([]((LTLAPp0==true)))&&(X((LTLAPp2==true))||(LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DES-PT-60a-LTLFireability-08 finished in 95888 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(p1)&&F(p2)&&p0))))'
Found a Shortening insensitive property : DES-PT-60a-LTLFireability-10
Stuttering acceptance computed with spot in 158 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Support contains 5 out of 353 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 353/353 places, 297/297 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 352 transition count 296
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 352 transition count 296
Applied a total of 2 rules in 17 ms. Remains 352 /353 variables (removed 1) and now considering 296/297 (removed 1) transitions.
// Phase 1: matrix 296 rows 352 cols
[2024-05-22 01:55:55] [INFO ] Computed 58 invariants in 2 ms
[2024-05-22 01:55:55] [INFO ] Implicit Places using invariants in 192 ms returned []
[2024-05-22 01:55:55] [INFO ] Invariant cache hit.
[2024-05-22 01:55:56] [INFO ] Implicit Places using invariants and state equation in 377 ms returned []
Implicit Place search using SMT with State Equation took 586 ms to find 0 implicit places.
[2024-05-22 01:55:56] [INFO ] Invariant cache hit.
[2024-05-22 01:55:56] [INFO ] Dead Transitions using invariants and state equation in 142 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 352/353 places, 296/297 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 763 ms. Remains : 352/353 places, 296/297 transitions.
Running random walk in product with property : DES-PT-60a-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (OR (EQ s215 0) (EQ s244 0)) (OR (EQ s245 0) (EQ s266 0))), p1:(OR (EQ s215 0) (EQ s244 0)), p2:(OR (EQ s235 0) (EQ s244 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 2249 reset in 207 ms.
Product exploration explored 100000 steps with 2231 reset in 226 ms.
Computed a total of 255 stabilizing places and 250 stable transitions
Computed a total of 255 stabilizing places and 250 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X (AND p0 p1)), (X (NOT (OR (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (X p1)), (X (X (AND p0 p1))), (X (X p2)), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 87 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 139 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Incomplete random walk after 10000 steps, including 221 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 64 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 64 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 64 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-22 01:55:57] [INFO ] Invariant cache hit.
[2024-05-22 01:55:57] [INFO ] After 75ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-22 01:55:57] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2024-05-22 01:55:57] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 86 ms returned sat
[2024-05-22 01:55:58] [INFO ] After 915ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-22 01:56:01] [INFO ] After 4025ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 3320 ms.
[2024-05-22 01:56:04] [INFO ] After 7535ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 47 ms.
Support contains 5 out of 352 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 296/296 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 352 transition count 294
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 7 place count 352 transition count 294
Applied a total of 7 rules in 10 ms. Remains 352 /352 variables (removed 0) and now considering 294/296 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 352/352 places, 294/296 transitions.
Incomplete random walk after 10000 steps, including 136 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 72 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 72 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 73 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 901219 steps, run timeout after 3001 ms. (steps per millisecond=300 ) properties seen :{}
Probabilistic random walk after 901219 steps, saw 128402 distinct states, run finished after 3001 ms. (steps per millisecond=300 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 294 rows 352 cols
[2024-05-22 01:56:08] [INFO ] Computed 60 invariants in 3 ms
[2024-05-22 01:56:08] [INFO ] After 70ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-22 01:56:08] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-22 01:56:08] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 93 ms returned sat
[2024-05-22 01:56:09] [INFO ] After 644ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-22 01:56:09] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-22 01:56:09] [INFO ] After 136ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-22 01:56:09] [INFO ] After 288ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 123 ms.
[2024-05-22 01:56:09] [INFO ] After 1347ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 2 properties in 14 ms.
Support contains 2 out of 352 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 294/294 transitions.
Applied a total of 0 rules in 5 ms. Remains 352 /352 variables (removed 0) and now considering 294/294 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 352/352 places, 294/294 transitions.
Incomplete random walk after 10000 steps, including 133 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 73 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1512752 steps, run timeout after 3001 ms. (steps per millisecond=504 ) properties seen :{}
Probabilistic random walk after 1512752 steps, saw 211477 distinct states, run finished after 3001 ms. (steps per millisecond=504 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-22 01:56:12] [INFO ] Invariant cache hit.
[2024-05-22 01:56:12] [INFO ] After 77ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 01:56:12] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-22 01:56:12] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 116 ms returned sat
[2024-05-22 01:56:13] [INFO ] After 545ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 01:56:13] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-22 01:56:13] [INFO ] After 38ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-22 01:56:13] [INFO ] After 76ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 41 ms.
[2024-05-22 01:56:13] [INFO ] After 865ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 2 out of 352 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 294/294 transitions.
Applied a total of 0 rules in 4 ms. Remains 352 /352 variables (removed 0) and now considering 294/294 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 352/352 places, 294/294 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 294/294 transitions.
Applied a total of 0 rules in 4 ms. Remains 352 /352 variables (removed 0) and now considering 294/294 (removed 0) transitions.
[2024-05-22 01:56:13] [INFO ] Invariant cache hit.
[2024-05-22 01:56:13] [INFO ] Implicit Places using invariants in 184 ms returned []
[2024-05-22 01:56:13] [INFO ] Invariant cache hit.
[2024-05-22 01:56:13] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-22 01:56:14] [INFO ] Implicit Places using invariants and state equation in 504 ms returned []
Implicit Place search using SMT with State Equation took 713 ms to find 0 implicit places.
[2024-05-22 01:56:14] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-22 01:56:14] [INFO ] Invariant cache hit.
[2024-05-22 01:56:14] [INFO ] Dead Transitions using invariants and state equation in 154 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 890 ms. Remains : 352/352 places, 294/294 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 352 transition count 294
Applied a total of 1 rules in 26 ms. Remains 352 /352 variables (removed 0) and now considering 294/294 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 294 rows 352 cols
[2024-05-22 01:56:14] [INFO ] Computed 60 invariants in 3 ms
[2024-05-22 01:56:14] [INFO ] After 55ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 01:56:14] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-22 01:56:14] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 17 ms returned sat
[2024-05-22 01:56:14] [INFO ] After 175ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 01:56:14] [INFO ] After 240ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 38 ms.
[2024-05-22 01:56:14] [INFO ] After 403ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 p1 p2), (X (AND p0 p1)), (X (NOT (OR (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (X p1)), (X (X (AND p0 p1))), (X (X p2)), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1 (NOT p2)))))]
False Knowledge obtained : [(F (NOT p2)), (F (OR (NOT p0) (NOT p1))), (F (AND p0 p1 (NOT p2))), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 9 factoid took 196 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 143 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 128 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Support contains 5 out of 352 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 352/352 places, 296/296 transitions.
Applied a total of 0 rules in 6 ms. Remains 352 /352 variables (removed 0) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 352 cols
[2024-05-22 01:56:15] [INFO ] Computed 58 invariants in 3 ms
[2024-05-22 01:56:15] [INFO ] Implicit Places using invariants in 195 ms returned []
[2024-05-22 01:56:15] [INFO ] Invariant cache hit.
[2024-05-22 01:56:16] [INFO ] Implicit Places using invariants and state equation in 411 ms returned []
Implicit Place search using SMT with State Equation took 646 ms to find 0 implicit places.
[2024-05-22 01:56:16] [INFO ] Invariant cache hit.
[2024-05-22 01:56:16] [INFO ] Dead Transitions using invariants and state equation in 145 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 815 ms. Remains : 352/352 places, 296/296 transitions.
Computed a total of 255 stabilizing places and 250 stable transitions
Computed a total of 255 stabilizing places and 250 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X (AND p0 p1)), (X (NOT (OR (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (X p1)), (X (X (AND p0 p1))), (X (X p2)), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 106 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 170 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Incomplete random walk after 10000 steps, including 219 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10001 steps, including 64 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-22 01:56:16] [INFO ] Invariant cache hit.
[2024-05-22 01:56:16] [INFO ] After 99ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 01:56:16] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2024-05-22 01:56:16] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 14 ms returned sat
[2024-05-22 01:56:17] [INFO ] After 278ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 01:56:17] [INFO ] After 317ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 38 ms.
[2024-05-22 01:56:17] [INFO ] After 445ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 10 ms.
Support contains 2 out of 352 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 296/296 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 352 transition count 294
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 7 place count 352 transition count 294
Applied a total of 7 rules in 11 ms. Remains 352 /352 variables (removed 0) and now considering 294/296 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 352/352 places, 294/296 transitions.
Incomplete random walk after 10000 steps, including 140 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 70 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1485767 steps, run timeout after 3001 ms. (steps per millisecond=495 ) properties seen :{}
Probabilistic random walk after 1485767 steps, saw 207297 distinct states, run finished after 3004 ms. (steps per millisecond=494 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 294 rows 352 cols
[2024-05-22 01:56:20] [INFO ] Computed 60 invariants in 3 ms
[2024-05-22 01:56:20] [INFO ] After 67ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 01:56:20] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-22 01:56:20] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 17 ms returned sat
[2024-05-22 01:56:20] [INFO ] After 208ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 01:56:20] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-22 01:56:20] [INFO ] After 55ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-22 01:56:20] [INFO ] Deduced a trap composed of 11 places in 80 ms of which 1 ms to minimize.
[2024-05-22 01:56:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 111 ms
[2024-05-22 01:56:20] [INFO ] After 205ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 29 ms.
[2024-05-22 01:56:20] [INFO ] After 570ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 9 ms.
Support contains 2 out of 352 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 294/294 transitions.
Applied a total of 0 rules in 6 ms. Remains 352 /352 variables (removed 0) and now considering 294/294 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 352/352 places, 294/294 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 294/294 transitions.
Applied a total of 0 rules in 6 ms. Remains 352 /352 variables (removed 0) and now considering 294/294 (removed 0) transitions.
[2024-05-22 01:56:20] [INFO ] Invariant cache hit.
[2024-05-22 01:56:21] [INFO ] Implicit Places using invariants in 183 ms returned []
[2024-05-22 01:56:21] [INFO ] Invariant cache hit.
[2024-05-22 01:56:21] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-22 01:56:21] [INFO ] Implicit Places using invariants and state equation in 510 ms returned []
Implicit Place search using SMT with State Equation took 721 ms to find 0 implicit places.
[2024-05-22 01:56:21] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-22 01:56:21] [INFO ] Invariant cache hit.
[2024-05-22 01:56:21] [INFO ] Dead Transitions using invariants and state equation in 139 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 887 ms. Remains : 352/352 places, 294/294 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 352 transition count 294
Applied a total of 1 rules in 9 ms. Remains 352 /352 variables (removed 0) and now considering 294/294 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 294 rows 352 cols
[2024-05-22 01:56:21] [INFO ] Computed 60 invariants in 3 ms
[2024-05-22 01:56:21] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 01:56:21] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2024-05-22 01:56:21] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 18 ms returned sat
[2024-05-22 01:56:22] [INFO ] After 187ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 01:56:22] [INFO ] After 254ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 36 ms.
[2024-05-22 01:56:22] [INFO ] After 407ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 p1 p2), (X (AND p0 p1)), (X (NOT (OR (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (X p1)), (X (X (AND p0 p1))), (X (X p2)), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1 (NOT p2)))))]
False Knowledge obtained : [(F (NOT p2)), (F (OR (NOT p0) (NOT p1))), (F (AND p0 p1 (NOT p2))), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 9 factoid took 264 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 156 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 137 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 135 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Product exploration explored 100000 steps with 2250 reset in 208 ms.
Product exploration explored 100000 steps with 2228 reset in 234 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 169 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Support contains 5 out of 352 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 352/352 places, 296/296 transitions.
Applied a total of 0 rules in 6 ms. Remains 352 /352 variables (removed 0) and now considering 296/296 (removed 0) transitions.
[2024-05-22 01:56:23] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 296 rows 352 cols
[2024-05-22 01:56:23] [INFO ] Computed 58 invariants in 3 ms
[2024-05-22 01:56:23] [INFO ] Dead Transitions using invariants and state equation in 148 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 173 ms. Remains : 352/352 places, 296/296 transitions.
Built C files in :
/tmp/ltsmin3789938959066395702
[2024-05-22 01:56:23] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3789938959066395702
Running compilation step : cd /tmp/ltsmin3789938959066395702;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 510 ms.
Running link step : cd /tmp/ltsmin3789938959066395702;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 25 ms.
Running LTSmin : cd /tmp/ltsmin3789938959066395702;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased14593811688733351795.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 352 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 352/352 places, 296/296 transitions.
Applied a total of 0 rules in 4 ms. Remains 352 /352 variables (removed 0) and now considering 296/296 (removed 0) transitions.
[2024-05-22 01:56:38] [INFO ] Invariant cache hit.
[2024-05-22 01:56:39] [INFO ] Implicit Places using invariants in 183 ms returned []
[2024-05-22 01:56:39] [INFO ] Invariant cache hit.
[2024-05-22 01:56:39] [INFO ] Implicit Places using invariants and state equation in 383 ms returned []
Implicit Place search using SMT with State Equation took 605 ms to find 0 implicit places.
[2024-05-22 01:56:39] [INFO ] Invariant cache hit.
[2024-05-22 01:56:39] [INFO ] Dead Transitions using invariants and state equation in 164 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 794 ms. Remains : 352/352 places, 296/296 transitions.
Built C files in :
/tmp/ltsmin4831164905410951235
[2024-05-22 01:56:39] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4831164905410951235
Running compilation step : cd /tmp/ltsmin4831164905410951235;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 513 ms.
Running link step : cd /tmp/ltsmin4831164905410951235;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin4831164905410951235;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased14215304147391965494.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-22 01:56:54] [INFO ] Flatten gal took : 15 ms
[2024-05-22 01:56:54] [INFO ] Flatten gal took : 15 ms
[2024-05-22 01:56:54] [INFO ] Time to serialize gal into /tmp/LTL6585197249399602513.gal : 1 ms
[2024-05-22 01:56:54] [INFO ] Time to serialize properties into /tmp/LTL15620493810115038816.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6585197249399602513.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8746653353855955268.hoa' '-atoms' '/tmp/LTL15620493810115038816.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL15620493810115038816.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8746653353855955268.hoa
Detected timeout of ITS tools.
[2024-05-22 01:57:09] [INFO ] Flatten gal took : 9 ms
[2024-05-22 01:57:09] [INFO ] Flatten gal took : 9 ms
[2024-05-22 01:57:09] [INFO ] Time to serialize gal into /tmp/LTL14946743379403918854.gal : 1 ms
[2024-05-22 01:57:09] [INFO ] Time to serialize properties into /tmp/LTL18035684562211275038.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14946743379403918854.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18035684562211275038.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(F(((G("((p215==0)||(p244==0))"))&&(F("((p235==0)||(p244==0))")))&&("(((p215==0)||(p244==0))&&((p245==0)||(p267==0)))")))))
Formula 0 simplified : XG(!"(((p215==0)||(p244==0))&&((p245==0)||(p267==0)))" | F!"((p215==0)||(p244==0))" | G!"((p235==0)||(p244==0))")
Detected timeout of ITS tools.
[2024-05-22 01:57:24] [INFO ] Flatten gal took : 13 ms
[2024-05-22 01:57:24] [INFO ] Applying decomposition
[2024-05-22 01:57:24] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph1505192136084058516.txt' '-o' '/tmp/graph1505192136084058516.bin' '-w' '/tmp/graph1505192136084058516.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph1505192136084058516.bin' '-l' '-1' '-v' '-w' '/tmp/graph1505192136084058516.weights' '-q' '0' '-e' '0.001'
[2024-05-22 01:57:25] [INFO ] Decomposing Gal with order
[2024-05-22 01:57:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 01:57:25] [INFO ] Removed a total of 14 redundant transitions.
[2024-05-22 01:57:25] [INFO ] Flatten gal took : 16 ms
[2024-05-22 01:57:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-22 01:57:25] [INFO ] Time to serialize gal into /tmp/LTL4419546314168317451.gal : 11 ms
[2024-05-22 01:57:25] [INFO ] Time to serialize properties into /tmp/LTL16085655354911064424.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4419546314168317451.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16085655354911064424.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(F(((G("((u2.p215==0)||(u2.p244==0))"))&&(F("((u2.p235==0)||(u2.p244==0))")))&&("(((u2.p215==0)||(u2.p244==0))&&((u2.p245==0)||(i0...179
Formula 0 simplified : XG(!"(((u2.p215==0)||(u2.p244==0))&&((u2.p245==0)||(i0.i0.u11.p267==0)))" | F!"((u2.p215==0)||(u2.p244==0))" | G!"((u2.p235==0)||(u2...167
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2380940634042633991
[2024-05-22 01:57:40] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2380940634042633991
Running compilation step : cd /tmp/ltsmin2380940634042633991;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 487 ms.
Running link step : cd /tmp/ltsmin2380940634042633991;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin2380940634042633991;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>(([]((LTLAPp1==true))&&<>((LTLAPp2==true))&&(LTLAPp0==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DES-PT-60a-LTLFireability-10 finished in 119748 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((!(p0 U p1)||p0)) U !F(X(p2))))'
Found a Lengthening insensitive property : DES-PT-60a-LTLFireability-13
Stuttering acceptance computed with spot in 139 ms :[p2, p2, true, p2]
Support contains 6 out of 353 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 353/353 places, 297/297 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 352 transition count 296
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 352 transition count 296
Applied a total of 2 rules in 15 ms. Remains 352 /353 variables (removed 1) and now considering 296/297 (removed 1) transitions.
[2024-05-22 01:57:55] [INFO ] Invariant cache hit.
[2024-05-22 01:57:55] [INFO ] Implicit Places using invariants in 176 ms returned []
[2024-05-22 01:57:55] [INFO ] Invariant cache hit.
[2024-05-22 01:57:56] [INFO ] Implicit Places using invariants and state equation in 396 ms returned []
Implicit Place search using SMT with State Equation took 586 ms to find 0 implicit places.
[2024-05-22 01:57:56] [INFO ] Invariant cache hit.
[2024-05-22 01:57:56] [INFO ] Dead Transitions using invariants and state equation in 149 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 352/353 places, 296/297 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 750 ms. Remains : 352/353 places, 296/297 transitions.
Running random walk in product with property : DES-PT-60a-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (AND (NOT p2) p0) (AND (NOT p2) (NOT p1))), acceptance={} source=1 dest: 1}, { cond=(OR (AND p2 p0) (AND p2 (NOT p1))), acceptance={0} source=1 dest: 1}, { cond=(AND p2 (NOT p0) p1), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p2, acceptance={} source=3 dest: 2}, { cond=(NOT p2), acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(AND (EQ s208 1) (EQ s244 1)), p0:(AND (EQ s334 1) (EQ s348 1)), p1:(AND (EQ s129 1) (EQ s268 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 2200 reset in 271 ms.
Product exploration explored 100000 steps with 2216 reset in 289 ms.
Computed a total of 255 stabilizing places and 250 stable transitions
Computed a total of 255 stabilizing places and 250 stable transitions
Detected a total of 255/352 stabilizing places and 250/296 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT (AND p2 (NOT p0) p1))), (X (OR (AND (NOT p2) p0) (AND (NOT p2) (NOT p1)))), (X (NOT (OR (AND p2 p0) (AND p2 (NOT p1))))), (X (X (NOT p2))), true, (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X (OR (AND (NOT p2) p0) (AND (NOT p2) (NOT p1))))), (X (X (NOT (OR (AND p2 p0) (AND p2 (NOT p1)))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 12 factoid took 162 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[p2, true, p2]
Incomplete random walk after 10000 steps, including 222 resets, run finished after 157 ms. (steps per millisecond=63 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 60 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 63 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 60 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 52 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 63 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 610067 steps, run timeout after 3001 ms. (steps per millisecond=203 ) properties seen :{}
Probabilistic random walk after 610067 steps, saw 96240 distinct states, run finished after 3001 ms. (steps per millisecond=203 ) properties seen :0
Running SMT prover for 5 properties.
[2024-05-22 01:58:00] [INFO ] Invariant cache hit.
[2024-05-22 01:58:00] [INFO ] [Real]Absence check using 33 positive place invariants in 5 ms returned sat
[2024-05-22 01:58:00] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 15 ms returned sat
[2024-05-22 01:58:00] [INFO ] After 109ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-22 01:58:00] [INFO ] [Nat]Absence check using 33 positive place invariants in 5 ms returned sat
[2024-05-22 01:58:00] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 25 ms returned sat
[2024-05-22 01:58:01] [INFO ] After 717ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-22 01:58:02] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 0 ms to minimize.
[2024-05-22 01:58:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 105 ms
[2024-05-22 01:58:02] [INFO ] After 1418ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 538 ms.
[2024-05-22 01:58:02] [INFO ] After 2102ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 325 ms.
Support contains 6 out of 352 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 296/296 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 352 transition count 294
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 6 place count 352 transition count 294
Applied a total of 6 rules in 10 ms. Remains 352 /352 variables (removed 0) and now considering 294/296 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 352/352 places, 294/296 transitions.
Incomplete random walk after 10000 steps, including 132 resets, run finished after 143 ms. (steps per millisecond=69 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 72 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 70 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 73 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 605745 steps, run timeout after 3001 ms. (steps per millisecond=201 ) properties seen :{}
Probabilistic random walk after 605745 steps, saw 87154 distinct states, run finished after 3001 ms. (steps per millisecond=201 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 294 rows 352 cols
[2024-05-22 01:58:06] [INFO ] Computed 60 invariants in 3 ms
[2024-05-22 01:58:06] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-22 01:58:06] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 15 ms returned sat
[2024-05-22 01:58:06] [INFO ] After 120ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-22 01:58:06] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-22 01:58:06] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 50 ms returned sat
[2024-05-22 01:58:07] [INFO ] After 985ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-22 01:58:07] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 01:58:08] [INFO ] After 741ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2024-05-22 01:58:08] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 0 ms to minimize.
[2024-05-22 01:58:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 107 ms
[2024-05-22 01:58:09] [INFO ] After 1433ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 882 ms.
[2024-05-22 01:58:10] [INFO ] After 3520ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 190 ms.
Support contains 6 out of 352 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 294/294 transitions.
Applied a total of 0 rules in 5 ms. Remains 352 /352 variables (removed 0) and now considering 294/294 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 352/352 places, 294/294 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 294/294 transitions.
Applied a total of 0 rules in 4 ms. Remains 352 /352 variables (removed 0) and now considering 294/294 (removed 0) transitions.
[2024-05-22 01:58:10] [INFO ] Invariant cache hit.
[2024-05-22 01:58:10] [INFO ] Implicit Places using invariants in 171 ms returned []
[2024-05-22 01:58:10] [INFO ] Invariant cache hit.
[2024-05-22 01:58:10] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 01:58:10] [INFO ] Implicit Places using invariants and state equation in 436 ms returned []
Implicit Place search using SMT with State Equation took 652 ms to find 0 implicit places.
[2024-05-22 01:58:10] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-22 01:58:10] [INFO ] Invariant cache hit.
[2024-05-22 01:58:11] [INFO ] Dead Transitions using invariants and state equation in 180 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 856 ms. Remains : 352/352 places, 294/294 transitions.
Applied a total of 0 rules in 4 ms. Remains 352 /352 variables (removed 0) and now considering 294/294 (removed 0) transitions.
Running SMT prover for 5 properties.
[2024-05-22 01:58:11] [INFO ] Invariant cache hit.
[2024-05-22 01:58:11] [INFO ] [Real]Absence check using 36 positive place invariants in 8 ms returned sat
[2024-05-22 01:58:11] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 24 ms returned sat
[2024-05-22 01:58:11] [INFO ] After 205ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-22 01:58:11] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-22 01:58:11] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 13 ms returned sat
[2024-05-22 01:58:12] [INFO ] After 1040ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-22 01:58:12] [INFO ] Deduced a trap composed of 6 places in 46 ms of which 0 ms to minimize.
[2024-05-22 01:58:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 123 ms
[2024-05-22 01:58:13] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 0 ms to minimize.
[2024-05-22 01:58:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 96 ms
[2024-05-22 01:58:13] [INFO ] After 1826ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 694 ms.
[2024-05-22 01:58:14] [INFO ] After 2779ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT (AND p2 (NOT p0) p1))), (X (OR (AND (NOT p2) p0) (AND (NOT p2) (NOT p1)))), (X (NOT (OR (AND p2 p0) (AND p2 (NOT p1))))), (X (X (NOT p2))), true, (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X (OR (AND (NOT p2) p0) (AND (NOT p2) (NOT p1))))), (X (X (NOT (OR (AND p2 p0) (AND p2 (NOT p1)))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 160 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[p2, true, p2]
Stuttering acceptance computed with spot in 73 ms :[p2, true, p2]
Support contains 6 out of 352 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 352/352 places, 296/296 transitions.
Applied a total of 0 rules in 6 ms. Remains 352 /352 variables (removed 0) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 352 cols
[2024-05-22 01:58:14] [INFO ] Computed 58 invariants in 5 ms
[2024-05-22 01:58:14] [INFO ] Implicit Places using invariants in 197 ms returned []
[2024-05-22 01:58:14] [INFO ] Invariant cache hit.
[2024-05-22 01:58:15] [INFO ] Implicit Places using invariants and state equation in 393 ms returned []
Implicit Place search using SMT with State Equation took 627 ms to find 0 implicit places.
[2024-05-22 01:58:15] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-22 01:58:15] [INFO ] Invariant cache hit.
[2024-05-22 01:58:15] [INFO ] Dead Transitions using invariants and state equation in 151 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 799 ms. Remains : 352/352 places, 296/296 transitions.
Computed a total of 255 stabilizing places and 250 stable transitions
Computed a total of 255 stabilizing places and 250 stable transitions
Detected a total of 255/352 stabilizing places and 250/296 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (OR (AND p0 p2) (AND p2 (NOT p1))))), (X (NOT (AND (NOT p0) p2 p1))), (X (OR (AND p0 (NOT p2)) (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (X (NOT p2))), true, (X (X (NOT (OR (AND p0 p2) (AND p2 (NOT p1)))))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (OR (AND p0 (NOT p2)) (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 177 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[p2, true, p2]
Incomplete random walk after 10000 steps, including 224 resets, run finished after 166 ms. (steps per millisecond=60 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 60 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 60 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 57 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 53 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 62 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 753022 steps, run timeout after 3001 ms. (steps per millisecond=250 ) properties seen :{}
Probabilistic random walk after 753022 steps, saw 114552 distinct states, run finished after 3001 ms. (steps per millisecond=250 ) properties seen :0
Running SMT prover for 5 properties.
[2024-05-22 01:58:18] [INFO ] Invariant cache hit.
[2024-05-22 01:58:18] [INFO ] [Real]Absence check using 33 positive place invariants in 4 ms returned sat
[2024-05-22 01:58:18] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 16 ms returned sat
[2024-05-22 01:58:18] [INFO ] After 124ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-22 01:58:19] [INFO ] [Nat]Absence check using 33 positive place invariants in 5 ms returned sat
[2024-05-22 01:58:19] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 25 ms returned sat
[2024-05-22 01:58:19] [INFO ] After 696ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-22 01:58:20] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 0 ms to minimize.
[2024-05-22 01:58:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 112 ms
[2024-05-22 01:58:20] [INFO ] After 1407ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 528 ms.
[2024-05-22 01:58:21] [INFO ] After 2081ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 228 ms.
Support contains 6 out of 352 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 296/296 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 352 transition count 294
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 6 place count 352 transition count 294
Applied a total of 6 rules in 9 ms. Remains 352 /352 variables (removed 0) and now considering 294/296 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 352/352 places, 294/296 transitions.
Incomplete random walk after 10000 steps, including 134 resets, run finished after 148 ms. (steps per millisecond=67 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 73 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 67 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 73 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 783310 steps, run timeout after 3001 ms. (steps per millisecond=261 ) properties seen :{}
Probabilistic random walk after 783310 steps, saw 112211 distinct states, run finished after 3001 ms. (steps per millisecond=261 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 294 rows 352 cols
[2024-05-22 01:58:24] [INFO ] Computed 60 invariants in 5 ms
[2024-05-22 01:58:24] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-22 01:58:24] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 15 ms returned sat
[2024-05-22 01:58:24] [INFO ] After 111ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-22 01:58:24] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-22 01:58:24] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 50 ms returned sat
[2024-05-22 01:58:25] [INFO ] After 1014ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-22 01:58:25] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 01:58:26] [INFO ] After 737ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2024-05-22 01:58:26] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 0 ms to minimize.
[2024-05-22 01:58:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 117 ms
[2024-05-22 01:58:27] [INFO ] After 1433ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 883 ms.
[2024-05-22 01:58:28] [INFO ] After 3540ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 476 ms.
Support contains 6 out of 352 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 294/294 transitions.
Applied a total of 0 rules in 5 ms. Remains 352 /352 variables (removed 0) and now considering 294/294 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 352/352 places, 294/294 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 294/294 transitions.
Applied a total of 0 rules in 5 ms. Remains 352 /352 variables (removed 0) and now considering 294/294 (removed 0) transitions.
[2024-05-22 01:58:28] [INFO ] Invariant cache hit.
[2024-05-22 01:58:28] [INFO ] Implicit Places using invariants in 174 ms returned []
[2024-05-22 01:58:28] [INFO ] Invariant cache hit.
[2024-05-22 01:58:29] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 01:58:29] [INFO ] Implicit Places using invariants and state equation in 427 ms returned []
Implicit Place search using SMT with State Equation took 630 ms to find 0 implicit places.
[2024-05-22 01:58:29] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-22 01:58:29] [INFO ] Invariant cache hit.
[2024-05-22 01:58:29] [INFO ] Dead Transitions using invariants and state equation in 169 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 824 ms. Remains : 352/352 places, 294/294 transitions.
Applied a total of 0 rules in 4 ms. Remains 352 /352 variables (removed 0) and now considering 294/294 (removed 0) transitions.
Running SMT prover for 5 properties.
[2024-05-22 01:58:29] [INFO ] Invariant cache hit.
[2024-05-22 01:58:29] [INFO ] [Real]Absence check using 36 positive place invariants in 4 ms returned sat
[2024-05-22 01:58:29] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 14 ms returned sat
[2024-05-22 01:58:29] [INFO ] After 135ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-22 01:58:29] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-22 01:58:29] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 13 ms returned sat
[2024-05-22 01:58:30] [INFO ] After 1033ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-22 01:58:31] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 0 ms to minimize.
[2024-05-22 01:58:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 119 ms
[2024-05-22 01:58:31] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 1 ms to minimize.
[2024-05-22 01:58:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 99 ms
[2024-05-22 01:58:31] [INFO ] After 1816ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 667 ms.
[2024-05-22 01:58:32] [INFO ] After 2742ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (OR (AND p0 p2) (AND p2 (NOT p1))))), (X (NOT (AND (NOT p0) p2 p1))), (X (OR (AND p0 (NOT p2)) (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (X (NOT p2))), true, (X (X (NOT (OR (AND p0 p2) (AND p2 (NOT p1)))))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (OR (AND p0 (NOT p2)) (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 202 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[p2, true, p2]
Stuttering acceptance computed with spot in 79 ms :[p2, true, p2]
Stuttering acceptance computed with spot in 76 ms :[p2, true, p2]
Product exploration explored 100000 steps with 2240 reset in 255 ms.
Product exploration explored 100000 steps with 2227 reset in 269 ms.
Built C files in :
/tmp/ltsmin18321669649166829140
[2024-05-22 01:58:33] [INFO ] Computing symmetric may disable matrix : 296 transitions.
[2024-05-22 01:58:33] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:58:33] [INFO ] Computing symmetric may enable matrix : 296 transitions.
[2024-05-22 01:58:33] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:58:33] [INFO ] Computing Do-Not-Accords matrix : 296 transitions.
[2024-05-22 01:58:33] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:58:33] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18321669649166829140
Running compilation step : cd /tmp/ltsmin18321669649166829140;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 631 ms.
Running link step : cd /tmp/ltsmin18321669649166829140;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin18321669649166829140;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8309404173520312793.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 352 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 352/352 places, 296/296 transitions.
Applied a total of 0 rules in 5 ms. Remains 352 /352 variables (removed 0) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 352 cols
[2024-05-22 01:58:48] [INFO ] Computed 58 invariants in 3 ms
[2024-05-22 01:58:48] [INFO ] Implicit Places using invariants in 167 ms returned []
[2024-05-22 01:58:48] [INFO ] Invariant cache hit.
[2024-05-22 01:58:49] [INFO ] Implicit Places using invariants and state equation in 395 ms returned []
Implicit Place search using SMT with State Equation took 573 ms to find 0 implicit places.
[2024-05-22 01:58:49] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-22 01:58:49] [INFO ] Invariant cache hit.
[2024-05-22 01:58:49] [INFO ] Dead Transitions using invariants and state equation in 143 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 751 ms. Remains : 352/352 places, 296/296 transitions.
Built C files in :
/tmp/ltsmin10759817294448106297
[2024-05-22 01:58:49] [INFO ] Computing symmetric may disable matrix : 296 transitions.
[2024-05-22 01:58:49] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:58:49] [INFO ] Computing symmetric may enable matrix : 296 transitions.
[2024-05-22 01:58:49] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:58:49] [INFO ] Computing Do-Not-Accords matrix : 296 transitions.
[2024-05-22 01:58:49] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:58:49] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10759817294448106297
Running compilation step : cd /tmp/ltsmin10759817294448106297;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 623 ms.
Running link step : cd /tmp/ltsmin10759817294448106297;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin10759817294448106297;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11965853386520716048.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-22 01:59:04] [INFO ] Flatten gal took : 14 ms
[2024-05-22 01:59:04] [INFO ] Flatten gal took : 9 ms
[2024-05-22 01:59:04] [INFO ] Time to serialize gal into /tmp/LTL2938451749186759993.gal : 2 ms
[2024-05-22 01:59:04] [INFO ] Time to serialize properties into /tmp/LTL7317132639856187058.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2938451749186759993.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16210663142119380716.hoa' '-atoms' '/tmp/LTL7317132639856187058.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL7317132639856187058.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16210663142119380716.hoa
Detected timeout of ITS tools.
[2024-05-22 01:59:19] [INFO ] Flatten gal took : 10 ms
[2024-05-22 01:59:19] [INFO ] Flatten gal took : 9 ms
[2024-05-22 01:59:19] [INFO ] Time to serialize gal into /tmp/LTL1363258018260283678.gal : 1 ms
[2024-05-22 01:59:19] [INFO ] Time to serialize properties into /tmp/LTL8586762706225966013.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1363258018260283678.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8586762706225966013.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !(((X((!(("((p335==1)&&(p350==1))")U("((p129==1)&&(p269==1))")))||("((p335==1)&&(p350==1))")))U(!(F(X("((p208==1)&&(p244==1))"))))))
Formula 0 simplified : X((!"((p335==1)&&(p350==1))" & ("((p335==1)&&(p350==1))" U "((p129==1)&&(p269==1))")) R F"((p208==1)&&(p244==1))")
Detected timeout of ITS tools.
[2024-05-22 01:59:34] [INFO ] Flatten gal took : 15 ms
[2024-05-22 01:59:34] [INFO ] Applying decomposition
[2024-05-22 01:59:34] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph1615722104110296768.txt' '-o' '/tmp/graph1615722104110296768.bin' '-w' '/tmp/graph1615722104110296768.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph1615722104110296768.bin' '-l' '-1' '-v' '-w' '/tmp/graph1615722104110296768.weights' '-q' '0' '-e' '0.001'
[2024-05-22 01:59:34] [INFO ] Decomposing Gal with order
[2024-05-22 01:59:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 01:59:34] [INFO ] Removed a total of 14 redundant transitions.
[2024-05-22 01:59:34] [INFO ] Flatten gal took : 14 ms
[2024-05-22 01:59:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 1 ms.
[2024-05-22 01:59:34] [INFO ] Time to serialize gal into /tmp/LTL12406341022111360267.gal : 3 ms
[2024-05-22 01:59:34] [INFO ] Time to serialize properties into /tmp/LTL17131989805531354427.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12406341022111360267.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17131989805531354427.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !(((X((!(("((i9.u43.p335==1)&&(u47.p350==1))")U("((u12.p129==1)&&(u12.p269==1))")))||("((i9.u43.p335==1)&&(u47.p350==1))")))U(!(F(X("(...189
Formula 0 simplified : X((!"((i9.u43.p335==1)&&(u47.p350==1))" & ("((i9.u43.p335==1)&&(u47.p350==1))" U "((u12.p129==1)&&(u12.p269==1))")) R F"((u2.p208==1...173
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11501057237592918233
[2024-05-22 01:59:49] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11501057237592918233
Running compilation step : cd /tmp/ltsmin11501057237592918233;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 487 ms.
Running link step : cd /tmp/ltsmin11501057237592918233;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin11501057237592918233;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(X((!((LTLAPp0==true) U (LTLAPp1==true))||(LTLAPp0==true))) U !<>(X((LTLAPp2==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DES-PT-60a-LTLFireability-13 finished in 129477 ms.
[2024-05-22 02:00:04] [INFO ] Flatten gal took : 16 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin3042079145402835638
[2024-05-22 02:00:04] [INFO ] Computing symmetric may disable matrix : 297 transitions.
[2024-05-22 02:00:04] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 02:00:04] [INFO ] Computing symmetric may enable matrix : 297 transitions.
[2024-05-22 02:00:04] [INFO ] Applying decomposition
[2024-05-22 02:00:04] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 02:00:04] [INFO ] Flatten gal took : 10 ms
[2024-05-22 02:00:04] [INFO ] Computing Do-Not-Accords matrix : 297 transitions.
[2024-05-22 02:00:04] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 02:00:04] [INFO ] Built C files in 41ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3042079145402835638
Running compilation step : cd /tmp/ltsmin3042079145402835638;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '144' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph948555884368145751.txt' '-o' '/tmp/graph948555884368145751.bin' '-w' '/tmp/graph948555884368145751.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph948555884368145751.bin' '-l' '-1' '-v' '-w' '/tmp/graph948555884368145751.weights' '-q' '0' '-e' '0.001'
[2024-05-22 02:00:04] [INFO ] Decomposing Gal with order
[2024-05-22 02:00:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 02:00:04] [INFO ] Removed a total of 60 redundant transitions.
[2024-05-22 02:00:04] [INFO ] Flatten gal took : 15 ms
[2024-05-22 02:00:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 50 labels/synchronizations in 1 ms.
[2024-05-22 02:00:04] [INFO ] Time to serialize gal into /tmp/LTLFireability4642706539568749034.gal : 3 ms
[2024-05-22 02:00:04] [INFO ] Time to serialize properties into /tmp/LTLFireability13516051897689907719.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability4642706539568749034.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability13516051897689907719.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 5 LTL properties
Checking formula 0 : !((F((X(X(F("((((u2.p188==0)||(u2.p244==0))||((i3.u14.p10==0)||(i3.u14.p272==0)))||(i3.u15.p274==0))"))))&&(G("((u2.p199!=1)||(u2.p244...166
Formula 0 simplified : G(XXG!"((((u2.p188==0)||(u2.p244==0))||((i3.u14.p10==0)||(i3.u14.p272==0)))||(i3.u15.p274==0))" | F!"((u2.p199!=1)||(u2.p244!=1))")
Compilation finished in 758 ms.
Running link step : cd /tmp/ltsmin3042079145402835638;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin3042079145402835638;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>((X(X(<>((LTLAPp0==true))))&&[]((LTLAPp1==true))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t1, t256, t257, t290, u2.t8, u2.t130, u2.t134, u2.t135, u2.t136, u2.t137, u2.t138, u2.t139, u...855
Computing Next relation with stutter on 9.16345e+06 deadlock states
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 3/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.009: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.009: LTL layer: formula: <>((X(X(<>((LTLAPp0==true))))&&[]((LTLAPp1==true))))
pins2lts-mc-linux64( 3/ 8), 0.009: "<>((X(X(<>((LTLAPp0==true))))&&[]((LTLAPp1==true))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 3/ 8), 0.010: Using Spin LTL semantics
pins2lts-mc-linux64( 1/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.013: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.013: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.014: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.014: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.014: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.033: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.033: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.033: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.046: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.046: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.047: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.061: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.043: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.058: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.074: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.082: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.089: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.113: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.115: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.123: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.202: There are 312 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.202: State length is 354, there are 304 groups
pins2lts-mc-linux64( 0/ 8), 0.202: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.202: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.202: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.202: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 4/ 8), 0.247: [Blue] ~97 levels ~960 states ~3000 transitions
pins2lts-mc-linux64( 4/ 8), 0.260: [Blue] ~97 levels ~1920 states ~5368 transitions
pins2lts-mc-linux64( 4/ 8), 0.365: [Blue] ~97 levels ~3840 states ~11888 transitions
pins2lts-mc-linux64( 4/ 8), 0.506: [Blue] ~97 levels ~7680 states ~27216 transitions
pins2lts-mc-linux64( 4/ 8), 0.805: [Blue] ~97 levels ~15360 states ~64560 transitions
pins2lts-mc-linux64( 1/ 8), 2.118: [Blue] ~63 levels ~30720 states ~149104 transitions
pins2lts-mc-linux64( 3/ 8), 3.234: [Blue] ~90 levels ~61440 states ~343560 transitions
pins2lts-mc-linux64( 3/ 8), 5.349: [Blue] ~90 levels ~122880 states ~760752 transitions
pins2lts-mc-linux64( 0/ 8), 11.365: [Blue] ~60 levels ~245760 states ~1522768 transitions
pins2lts-mc-linux64( 1/ 8), 21.015: [Blue] ~66 levels ~491520 states ~2825200 transitions
pins2lts-mc-linux64( 1/ 8), 34.635: [Blue] ~66 levels ~983040 states ~6147056 transitions
pins2lts-mc-linux64( 7/ 8), 52.840: [Blue] ~7095 levels ~1966080 states ~9472024 transitions
pins2lts-mc-linux64( 0/ 8), 72.503: [Blue] ~3345 levels ~3932160 states ~24585880 transitions
pins2lts-mc-linux64( 0/ 8), 109.223: [Blue] ~5623 levels ~7864320 states ~44074152 transitions
pins2lts-mc-linux64( 0/ 8), 188.591: [Blue] ~7669 levels ~15728640 states ~90477896 transitions
pins2lts-mc-linux64( 0/ 8), 364.912: [Blue] ~7783 levels ~31457280 states ~206287160 transitions
pins2lts-mc-linux64( 7/ 8), 379.403: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 379.472:
pins2lts-mc-linux64( 0/ 8), 379.472: Explored 31534899 states 220136088 transitions, fanout: 6.981
pins2lts-mc-linux64( 0/ 8), 379.472: Total exploration time 379.210 sec (379.110 sec minimum, 379.170 sec on average)
pins2lts-mc-linux64( 0/ 8), 379.472: States per second: 83159, Transitions per second: 580512
pins2lts-mc-linux64( 0/ 8), 379.472:
pins2lts-mc-linux64( 0/ 8), 379.472: State space has 31565834 states, 32001 are accepting
pins2lts-mc-linux64( 0/ 8), 379.472: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 379.472: blue states: 31534899 (99.90%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 379.472: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 379.472: all-red states: 48250 (0.15%), bogus 2 (0.00%)
pins2lts-mc-linux64( 0/ 8), 379.472:
pins2lts-mc-linux64( 0/ 8), 379.472: Total memory used for local state coloring: 0.5MB
pins2lts-mc-linux64( 0/ 8), 379.472:
pins2lts-mc-linux64( 0/ 8), 379.472: Queue width: 8B, total height: 30633, memory: 0.23MB
pins2lts-mc-linux64( 0/ 8), 379.472: Tree memory: 496.8MB, 16.5 B/state, compr.: 1.2%
pins2lts-mc-linux64( 0/ 8), 379.472: Tree fill ratio (roots/leafs): 23.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 379.472: Stored 299 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 379.472: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 379.472: Est. total memory use: 497.1MB (~1024.2MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin3042079145402835638;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>((X(X(<>((LTLAPp0==true))))&&[]((LTLAPp1==true))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin3042079145402835638;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>((X(X(<>((LTLAPp0==true))))&&[]((LTLAPp1==true))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2024-05-22 02:27:55] [INFO ] Applying decomposition
[2024-05-22 02:27:55] [INFO ] Flatten gal took : 11 ms
[2024-05-22 02:27:55] [INFO ] Decomposing Gal with order
[2024-05-22 02:27:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 02:27:55] [INFO ] Removed a total of 431 redundant transitions.
[2024-05-22 02:27:55] [INFO ] Flatten gal took : 24 ms
[2024-05-22 02:27:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 247 labels/synchronizations in 3 ms.
[2024-05-22 02:27:55] [INFO ] Time to serialize gal into /tmp/LTLFireability3207210770412309916.gal : 2 ms
[2024-05-22 02:27:55] [INFO ] Time to serialize properties into /tmp/LTLFireability14097830367654415276.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability3207210770412309916.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability14097830367654415276.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 5 LTL properties
Checking formula 0 : !((F((X(X(F("((((u4.p188==0)||(u7.p244==0))||((u1.p10==0)||(u20.p272==0)))||(u21.p274==0))"))))&&(G("((u4.p199!=1)||(u7.p244!=1))"))))...156
Formula 0 simplified : G(XXG!"((((u4.p188==0)||(u7.p244==0))||((u1.p10==0)||(u20.p272==0)))||(u21.p274==0))" | F!"((u4.p199!=1)||(u7.p244!=1))")
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 10797268 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16034200 kB

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is DES-PT-60a, 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 r109-tall-171624208600468"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-60a.tgz
mv DES-PT-60a 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 ;