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.r400-tall-171690531500060.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 itstools
Input is SquareGrid-PT-040204, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r400-tall-171690531500060
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.1K Apr 23 07:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 07:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 07:58 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 04:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K Apr 12 04:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Apr 12 04:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K Apr 12 04:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:58 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:58 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rwxr-xr-x 1 mcc users 130K May 18 16:43 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 SquareGrid-PT-040204-LTLFireability-00
FORMULA_NAME SquareGrid-PT-040204-LTLFireability-01
FORMULA_NAME SquareGrid-PT-040204-LTLFireability-02
FORMULA_NAME SquareGrid-PT-040204-LTLFireability-03
FORMULA_NAME SquareGrid-PT-040204-LTLFireability-04
FORMULA_NAME SquareGrid-PT-040204-LTLFireability-05
FORMULA_NAME SquareGrid-PT-040204-LTLFireability-06
FORMULA_NAME SquareGrid-PT-040204-LTLFireability-07
FORMULA_NAME SquareGrid-PT-040204-LTLFireability-08
FORMULA_NAME SquareGrid-PT-040204-LTLFireability-09
FORMULA_NAME SquareGrid-PT-040204-LTLFireability-10
FORMULA_NAME SquareGrid-PT-040204-LTLFireability-11
FORMULA_NAME SquareGrid-PT-040204-LTLFireability-12
FORMULA_NAME SquareGrid-PT-040204-LTLFireability-13
FORMULA_NAME SquareGrid-PT-040204-LTLFireability-14
FORMULA_NAME SquareGrid-PT-040204-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716975667217

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SquareGrid-PT-040204
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-29 09:41:08] [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-29 09:41:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 09:41:08] [INFO ] Load time of PNML (sax parser for PT used): 76 ms
[2024-05-29 09:41:08] [INFO ] Transformed 240 places.
[2024-05-29 09:41:08] [INFO ] Transformed 272 transitions.
[2024-05-29 09:41:08] [INFO ] Parsed PT model containing 240 places and 272 transitions and 1088 arcs in 173 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA SquareGrid-PT-040204-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SquareGrid-PT-040204-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SquareGrid-PT-040204-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SquareGrid-PT-040204-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SquareGrid-PT-040204-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 47 out of 240 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 240/240 places, 272/272 transitions.
Applied a total of 0 rules in 22 ms. Remains 240 /240 variables (removed 0) and now considering 272/272 (removed 0) transitions.
// Phase 1: matrix 272 rows 240 cols
[2024-05-29 09:41:08] [INFO ] Computed 97 invariants in 37 ms
[2024-05-29 09:41:09] [INFO ] Implicit Places using invariants in 443 ms returned []
[2024-05-29 09:41:09] [INFO ] Invariant cache hit.
[2024-05-29 09:41:09] [INFO ] Implicit Places using invariants and state equation in 264 ms returned []
Implicit Place search using SMT with State Equation took 734 ms to find 0 implicit places.
Running 208 sub problems to find dead transitions.
[2024-05-29 09:41:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 128/240 variables, 80/96 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (OVERLAPS) 272/512 variables, 240/337 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/512 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 7 (OVERLAPS) 0/512 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 208 unsolved
No progress, stopping.
After SMT solving in domain Real declared 512/512 variables, and 337 constraints, problems are : Problem set: 0 solved, 208 unsolved in 6995 ms.
Refiners :[Positive P Invariants (semi-flows): 96/96 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 240/240 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 208 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 128/240 variables, 80/96 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (OVERLAPS) 272/512 variables, 240/337 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/512 variables, 208/545 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/512 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 8 (OVERLAPS) 0/512 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 208 unsolved
No progress, stopping.
After SMT solving in domain Int declared 512/512 variables, and 545 constraints, problems are : Problem set: 0 solved, 208 unsolved in 12115 ms.
Refiners :[Positive P Invariants (semi-flows): 96/96 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 240/240 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints]
After SMT, in 19299ms problems are : Problem set: 0 solved, 208 unsolved
Search for dead transitions found 0 dead transitions in 19313ms
Finished structural reductions in LTL mode , in 1 iterations and 20091 ms. Remains : 240/240 places, 272/272 transitions.
Support contains 47 out of 240 places after structural reductions.
[2024-05-29 09:41:29] [INFO ] Flatten gal took : 51 ms
[2024-05-29 09:41:29] [INFO ] Flatten gal took : 24 ms
[2024-05-29 09:41:29] [INFO ] Input system was already deterministic with 272 transitions.
Support contains 46 out of 240 places (down from 47) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 23 to 22
RANDOM walk for 1794 steps (0 resets) in 255 ms. (7 steps per ms) remains 0/22 properties
FORMULA SquareGrid-PT-040204-LTLFireability-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 4 out of 240 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 240/240 places, 272/272 transitions.
Applied a total of 0 rules in 21 ms. Remains 240 /240 variables (removed 0) and now considering 272/272 (removed 0) transitions.
[2024-05-29 09:41:29] [INFO ] Invariant cache hit.
[2024-05-29 09:41:29] [INFO ] Implicit Places using invariants in 136 ms returned []
[2024-05-29 09:41:29] [INFO ] Invariant cache hit.
[2024-05-29 09:41:30] [INFO ] Implicit Places using invariants and state equation in 230 ms returned []
Implicit Place search using SMT with State Equation took 370 ms to find 0 implicit places.
[2024-05-29 09:41:30] [INFO ] Redundant transitions in 10 ms returned []
Running 208 sub problems to find dead transitions.
[2024-05-29 09:41:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 128/240 variables, 80/96 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (OVERLAPS) 272/512 variables, 240/337 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/512 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 7 (OVERLAPS) 0/512 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 208 unsolved
No progress, stopping.
After SMT solving in domain Real declared 512/512 variables, and 337 constraints, problems are : Problem set: 0 solved, 208 unsolved in 6552 ms.
Refiners :[Positive P Invariants (semi-flows): 96/96 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 240/240 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 208 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 128/240 variables, 80/96 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (OVERLAPS) 272/512 variables, 240/337 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/512 variables, 208/545 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/512 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 8 (OVERLAPS) 0/512 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 208 unsolved
No progress, stopping.
After SMT solving in domain Int declared 512/512 variables, and 545 constraints, problems are : Problem set: 0 solved, 208 unsolved in 12157 ms.
Refiners :[Positive P Invariants (semi-flows): 96/96 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 240/240 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints]
After SMT, in 18827ms problems are : Problem set: 0 solved, 208 unsolved
Search for dead transitions found 0 dead transitions in 18830ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 19244 ms. Remains : 240/240 places, 272/272 transitions.
Stuttering acceptance computed with spot in 199 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SquareGrid-PT-040204-LTLFireability-01
Product exploration explored 100000 steps with 2211 reset in 1134 ms.
Product exploration explored 100000 steps with 2252 reset in 1067 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 170 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 61 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 109 steps (0 resets) in 5 ms. (18 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 159 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 76 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
[2024-05-29 09:41:51] [INFO ] Invariant cache hit.
[2024-05-29 09:41:52] [INFO ] [Real]Absence check using 96 positive place invariants in 21 ms returned sat
[2024-05-29 09:41:52] [INFO ] [Real]Absence check using 96 positive and 1 generalized place invariants in 11 ms returned sat
[2024-05-29 09:41:52] [INFO ] [Real]Absence check using state equation in 230 ms returned sat
[2024-05-29 09:41:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 09:41:52] [INFO ] [Nat]Absence check using 96 positive place invariants in 21 ms returned sat
[2024-05-29 09:41:52] [INFO ] [Nat]Absence check using 96 positive and 1 generalized place invariants in 5 ms returned sat
[2024-05-29 09:41:52] [INFO ] [Nat]Absence check using state equation in 171 ms returned sat
[2024-05-29 09:41:52] [INFO ] Computed and/alt/rep : 208/208/208 causal constraints (skipped 0 transitions) in 16 ms.
[2024-05-29 09:41:52] [INFO ] Added : 75 causal constraints over 15 iterations in 352 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 4 out of 240 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 240/240 places, 272/272 transitions.
Applied a total of 0 rules in 11 ms. Remains 240 /240 variables (removed 0) and now considering 272/272 (removed 0) transitions.
[2024-05-29 09:41:52] [INFO ] Invariant cache hit.
[2024-05-29 09:41:53] [INFO ] Implicit Places using invariants in 129 ms returned []
[2024-05-29 09:41:53] [INFO ] Invariant cache hit.
[2024-05-29 09:41:53] [INFO ] Implicit Places using invariants and state equation in 207 ms returned []
Implicit Place search using SMT with State Equation took 351 ms to find 0 implicit places.
[2024-05-29 09:41:53] [INFO ] Redundant transitions in 3 ms returned []
Running 208 sub problems to find dead transitions.
[2024-05-29 09:41:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 128/240 variables, 80/96 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (OVERLAPS) 272/512 variables, 240/337 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/512 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 7 (OVERLAPS) 0/512 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 208 unsolved
No progress, stopping.
After SMT solving in domain Real declared 512/512 variables, and 337 constraints, problems are : Problem set: 0 solved, 208 unsolved in 6468 ms.
Refiners :[Positive P Invariants (semi-flows): 96/96 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 240/240 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 208 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 128/240 variables, 80/96 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (OVERLAPS) 272/512 variables, 240/337 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/512 variables, 208/545 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/512 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 8 (OVERLAPS) 0/512 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 208 unsolved
No progress, stopping.
After SMT solving in domain Int declared 512/512 variables, and 545 constraints, problems are : Problem set: 0 solved, 208 unsolved in 12061 ms.
Refiners :[Positive P Invariants (semi-flows): 96/96 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 240/240 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints]
After SMT, in 18604ms problems are : Problem set: 0 solved, 208 unsolved
Search for dead transitions found 0 dead transitions in 18607ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 18978 ms. Remains : 240/240 places, 272/272 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 184 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 87 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 104 steps (0 resets) in 5 ms. (17 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 218 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 83 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
[2024-05-29 09:42:12] [INFO ] Invariant cache hit.
[2024-05-29 09:42:12] [INFO ] [Real]Absence check using 96 positive place invariants in 20 ms returned sat
[2024-05-29 09:42:12] [INFO ] [Real]Absence check using 96 positive and 1 generalized place invariants in 11 ms returned sat
[2024-05-29 09:42:12] [INFO ] [Real]Absence check using state equation in 226 ms returned sat
[2024-05-29 09:42:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 09:42:13] [INFO ] [Nat]Absence check using 96 positive place invariants in 21 ms returned sat
[2024-05-29 09:42:13] [INFO ] [Nat]Absence check using 96 positive and 1 generalized place invariants in 6 ms returned sat
[2024-05-29 09:42:13] [INFO ] [Nat]Absence check using state equation in 188 ms returned sat
[2024-05-29 09:42:13] [INFO ] Computed and/alt/rep : 208/208/208 causal constraints (skipped 0 transitions) in 16 ms.
[2024-05-29 09:42:13] [INFO ] Added : 75 causal constraints over 15 iterations in 301 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2288 reset in 951 ms.
Product exploration explored 100000 steps with 2228 reset in 997 ms.
Built C files in :
/tmp/ltsmin2197667121992240192
[2024-05-29 09:42:15] [INFO ] Computing symmetric may disable matrix : 272 transitions.
[2024-05-29 09:42:15] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 09:42:15] [INFO ] Computing symmetric may enable matrix : 272 transitions.
[2024-05-29 09:42:15] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 09:42:15] [INFO ] Computing Do-Not-Accords matrix : 272 transitions.
[2024-05-29 09:42:15] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 09:42:15] [INFO ] Built C files in 57ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2197667121992240192
Running compilation step : cd /tmp/ltsmin2197667121992240192;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 770 ms.
Running link step : cd /tmp/ltsmin2197667121992240192;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 58 ms.
Running LTSmin : cd /tmp/ltsmin2197667121992240192;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15791004873552783937.hoa' '--buchi-type=spotba'
LTSmin run took 1562 ms.
FORMULA SquareGrid-PT-040204-LTLFireability-01 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property SquareGrid-PT-040204-LTLFireability-01 finished in 48614 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 4 out of 240 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 240/240 places, 272/272 transitions.
Applied a total of 0 rules in 8 ms. Remains 240 /240 variables (removed 0) and now considering 272/272 (removed 0) transitions.
[2024-05-29 09:42:18] [INFO ] Invariant cache hit.
[2024-05-29 09:42:18] [INFO ] Implicit Places using invariants in 139 ms returned []
[2024-05-29 09:42:18] [INFO ] Invariant cache hit.
[2024-05-29 09:42:18] [INFO ] Implicit Places using invariants and state equation in 215 ms returned []
Implicit Place search using SMT with State Equation took 356 ms to find 0 implicit places.
Running 208 sub problems to find dead transitions.
[2024-05-29 09:42:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 128/240 variables, 80/96 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (OVERLAPS) 272/512 variables, 240/337 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/512 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 7 (OVERLAPS) 0/512 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 208 unsolved
No progress, stopping.
After SMT solving in domain Real declared 512/512 variables, and 337 constraints, problems are : Problem set: 0 solved, 208 unsolved in 6484 ms.
Refiners :[Positive P Invariants (semi-flows): 96/96 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 240/240 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 208 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 128/240 variables, 80/96 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (OVERLAPS) 272/512 variables, 240/337 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/512 variables, 208/545 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/512 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 8 (OVERLAPS) 0/512 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 208 unsolved
No progress, stopping.
After SMT solving in domain Int declared 512/512 variables, and 545 constraints, problems are : Problem set: 0 solved, 208 unsolved in 12141 ms.
Refiners :[Positive P Invariants (semi-flows): 96/96 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 240/240 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints]
After SMT, in 18687ms problems are : Problem set: 0 solved, 208 unsolved
Search for dead transitions found 0 dead transitions in 18690ms
Finished structural reductions in LTL mode , in 1 iterations and 19055 ms. Remains : 240/240 places, 272/272 transitions.
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : SquareGrid-PT-040204-LTLFireability-03
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA SquareGrid-PT-040204-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SquareGrid-PT-040204-LTLFireability-03 finished in 19154 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||G((F(p1)&&F(G(p0)))))))'
Support contains 4 out of 240 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 240/240 places, 272/272 transitions.
Applied a total of 0 rules in 6 ms. Remains 240 /240 variables (removed 0) and now considering 272/272 (removed 0) transitions.
[2024-05-29 09:42:37] [INFO ] Invariant cache hit.
[2024-05-29 09:42:37] [INFO ] Implicit Places using invariants in 135 ms returned []
[2024-05-29 09:42:37] [INFO ] Invariant cache hit.
[2024-05-29 09:42:37] [INFO ] Implicit Places using invariants and state equation in 220 ms returned []
Implicit Place search using SMT with State Equation took 357 ms to find 0 implicit places.
Running 208 sub problems to find dead transitions.
[2024-05-29 09:42:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 128/240 variables, 80/96 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (OVERLAPS) 272/512 variables, 240/337 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/512 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 7 (OVERLAPS) 0/512 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 208 unsolved
No progress, stopping.
After SMT solving in domain Real declared 512/512 variables, and 337 constraints, problems are : Problem set: 0 solved, 208 unsolved in 6608 ms.
Refiners :[Positive P Invariants (semi-flows): 96/96 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 240/240 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 208 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 128/240 variables, 80/96 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (OVERLAPS) 272/512 variables, 240/337 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/512 variables, 208/545 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/512 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 8 (OVERLAPS) 0/512 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 208 unsolved
No progress, stopping.
After SMT solving in domain Int declared 512/512 variables, and 545 constraints, problems are : Problem set: 0 solved, 208 unsolved in 12314 ms.
Refiners :[Positive P Invariants (semi-flows): 96/96 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 240/240 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints]
After SMT, in 19001ms problems are : Problem set: 0 solved, 208 unsolved
Search for dead transitions found 0 dead transitions in 19006ms
Finished structural reductions in LTL mode , in 1 iterations and 19371 ms. Remains : 240/240 places, 272/272 transitions.
Stuttering acceptance computed with spot in 198 ms :[(NOT p0), (NOT p0), (NOT p1), (NOT p0), (NOT p1)]
Running random walk in product with property : SquareGrid-PT-040204-LTLFireability-04
Stuttering criterion allowed to conclude after 5253 steps with 0 reset in 49 ms.
FORMULA SquareGrid-PT-040204-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SquareGrid-PT-040204-LTLFireability-04 finished in 19642 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(!(p0 U X((!X((G(p3)&&p2))&&p1))))'
Support contains 8 out of 240 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 240/240 places, 272/272 transitions.
Applied a total of 0 rules in 7 ms. Remains 240 /240 variables (removed 0) and now considering 272/272 (removed 0) transitions.
[2024-05-29 09:42:57] [INFO ] Invariant cache hit.
[2024-05-29 09:42:57] [INFO ] Implicit Places using invariants in 159 ms returned []
[2024-05-29 09:42:57] [INFO ] Invariant cache hit.
[2024-05-29 09:42:57] [INFO ] Implicit Places using invariants and state equation in 201 ms returned []
Implicit Place search using SMT with State Equation took 386 ms to find 0 implicit places.
Running 208 sub problems to find dead transitions.
[2024-05-29 09:42:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 128/240 variables, 80/96 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (OVERLAPS) 272/512 variables, 240/337 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/512 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 7 (OVERLAPS) 0/512 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 208 unsolved
No progress, stopping.
After SMT solving in domain Real declared 512/512 variables, and 337 constraints, problems are : Problem set: 0 solved, 208 unsolved in 6464 ms.
Refiners :[Positive P Invariants (semi-flows): 96/96 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 240/240 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 208 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 128/240 variables, 80/96 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (OVERLAPS) 272/512 variables, 240/337 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/512 variables, 208/545 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/512 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 8 (OVERLAPS) 0/512 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 208 unsolved
No progress, stopping.
After SMT solving in domain Int declared 512/512 variables, and 545 constraints, problems are : Problem set: 0 solved, 208 unsolved in 12363 ms.
Refiners :[Positive P Invariants (semi-flows): 96/96 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 240/240 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints]
After SMT, in 18893ms problems are : Problem set: 0 solved, 208 unsolved
Search for dead transitions found 0 dead transitions in 18896ms
Finished structural reductions in LTL mode , in 1 iterations and 19290 ms. Remains : 240/240 places, 272/272 transitions.
Stuttering acceptance computed with spot in 200 ms :[(OR (AND p1 (NOT p2)) (AND p1 (NOT p3))), (OR (AND p1 (NOT p3)) (AND p1 (NOT p2))), (OR (NOT p2) (NOT p3)), true, (NOT p3)]
Running random walk in product with property : SquareGrid-PT-040204-LTLFireability-05
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA SquareGrid-PT-040204-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SquareGrid-PT-040204-LTLFireability-05 finished in 19515 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((F((G(F(!p0))||(!p1&&F(!p0))))&&(X(!p1) U ((!p0&&X(!p1))||X(G(!p1)))))))'
Support contains 4 out of 240 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 240/240 places, 272/272 transitions.
Applied a total of 0 rules in 5 ms. Remains 240 /240 variables (removed 0) and now considering 272/272 (removed 0) transitions.
[2024-05-29 09:43:16] [INFO ] Invariant cache hit.
[2024-05-29 09:43:16] [INFO ] Implicit Places using invariants in 125 ms returned []
[2024-05-29 09:43:16] [INFO ] Invariant cache hit.
[2024-05-29 09:43:16] [INFO ] Implicit Places using invariants and state equation in 238 ms returned []
Implicit Place search using SMT with State Equation took 385 ms to find 0 implicit places.
Running 208 sub problems to find dead transitions.
[2024-05-29 09:43:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 128/240 variables, 80/96 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (OVERLAPS) 272/512 variables, 240/337 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/512 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 7 (OVERLAPS) 0/512 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 208 unsolved
No progress, stopping.
After SMT solving in domain Real declared 512/512 variables, and 337 constraints, problems are : Problem set: 0 solved, 208 unsolved in 6365 ms.
Refiners :[Positive P Invariants (semi-flows): 96/96 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 240/240 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 208 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 128/240 variables, 80/96 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (OVERLAPS) 272/512 variables, 240/337 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/512 variables, 208/545 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/512 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 8 (OVERLAPS) 0/512 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 208 unsolved
No progress, stopping.
After SMT solving in domain Int declared 512/512 variables, and 545 constraints, problems are : Problem set: 0 solved, 208 unsolved in 12454 ms.
Refiners :[Positive P Invariants (semi-flows): 96/96 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 240/240 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints]
After SMT, in 18883ms problems are : Problem set: 0 solved, 208 unsolved
Search for dead transitions found 0 dead transitions in 18886ms
Finished structural reductions in LTL mode , in 1 iterations and 19277 ms. Remains : 240/240 places, 272/272 transitions.
Stuttering acceptance computed with spot in 168 ms :[p1, (OR p1 p0), p0, (OR p1 p0)]
Running random walk in product with property : SquareGrid-PT-040204-LTLFireability-08
Product exploration explored 100000 steps with 50000 reset in 577 ms.
Product exploration explored 100000 steps with 50000 reset in 554 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 112 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SquareGrid-PT-040204-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SquareGrid-PT-040204-LTLFireability-08 finished in 20738 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 240 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 240/240 places, 272/272 transitions.
Applied a total of 0 rules in 14 ms. Remains 240 /240 variables (removed 0) and now considering 272/272 (removed 0) transitions.
[2024-05-29 09:43:37] [INFO ] Invariant cache hit.
[2024-05-29 09:43:37] [INFO ] Implicit Places using invariants in 133 ms returned []
[2024-05-29 09:43:37] [INFO ] Invariant cache hit.
[2024-05-29 09:43:37] [INFO ] Implicit Places using invariants and state equation in 199 ms returned []
Implicit Place search using SMT with State Equation took 353 ms to find 0 implicit places.
[2024-05-29 09:43:37] [INFO ] Redundant transitions in 3 ms returned []
Running 208 sub problems to find dead transitions.
[2024-05-29 09:43:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 128/240 variables, 80/96 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (OVERLAPS) 272/512 variables, 240/337 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/512 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 7 (OVERLAPS) 0/512 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 208 unsolved
No progress, stopping.
After SMT solving in domain Real declared 512/512 variables, and 337 constraints, problems are : Problem set: 0 solved, 208 unsolved in 6546 ms.
Refiners :[Positive P Invariants (semi-flows): 96/96 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 240/240 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 208 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 128/240 variables, 80/96 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (OVERLAPS) 272/512 variables, 240/337 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/512 variables, 208/545 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/512 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 8 (OVERLAPS) 0/512 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 208 unsolved
No progress, stopping.
After SMT solving in domain Int declared 512/512 variables, and 545 constraints, problems are : Problem set: 0 solved, 208 unsolved in 12064 ms.
Refiners :[Positive P Invariants (semi-flows): 96/96 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 240/240 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints]
After SMT, in 18663ms problems are : Problem set: 0 solved, 208 unsolved
Search for dead transitions found 0 dead transitions in 18665ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 19041 ms. Remains : 240/240 places, 272/272 transitions.
Stuttering acceptance computed with spot in 117 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SquareGrid-PT-040204-LTLFireability-09
Product exploration explored 100000 steps with 851 reset in 1083 ms.
Product exploration explored 100000 steps with 876 reset in 1109 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 175 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)]
RANDOM walk for 537 steps (0 resets) in 12 ms. (41 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 179 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 73 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 240 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 240/240 places, 272/272 transitions.
Applied a total of 0 rules in 10 ms. Remains 240 /240 variables (removed 0) and now considering 272/272 (removed 0) transitions.
[2024-05-29 09:43:59] [INFO ] Invariant cache hit.
[2024-05-29 09:43:59] [INFO ] Implicit Places using invariants in 136 ms returned []
[2024-05-29 09:43:59] [INFO ] Invariant cache hit.
[2024-05-29 09:43:59] [INFO ] Implicit Places using invariants and state equation in 242 ms returned []
Implicit Place search using SMT with State Equation took 403 ms to find 0 implicit places.
[2024-05-29 09:43:59] [INFO ] Redundant transitions in 1 ms returned []
Running 208 sub problems to find dead transitions.
[2024-05-29 09:43:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 128/240 variables, 80/96 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (OVERLAPS) 272/512 variables, 240/337 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/512 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 7 (OVERLAPS) 0/512 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 208 unsolved
No progress, stopping.
After SMT solving in domain Real declared 512/512 variables, and 337 constraints, problems are : Problem set: 0 solved, 208 unsolved in 6555 ms.
Refiners :[Positive P Invariants (semi-flows): 96/96 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 240/240 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 208 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 128/240 variables, 80/96 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (OVERLAPS) 272/512 variables, 240/337 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/512 variables, 208/545 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/512 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 8 (OVERLAPS) 0/512 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 208 unsolved
No progress, stopping.
After SMT solving in domain Int declared 512/512 variables, and 545 constraints, problems are : Problem set: 0 solved, 208 unsolved in 12199 ms.
Refiners :[Positive P Invariants (semi-flows): 96/96 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 240/240 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints]
After SMT, in 18813ms problems are : Problem set: 0 solved, 208 unsolved
Search for dead transitions found 0 dead transitions in 18815ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 19235 ms. Remains : 240/240 places, 272/272 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 189 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 62 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 345 steps (0 resets) in 13 ms. (24 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 209 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 94 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 839 reset in 1067 ms.
Product exploration explored 100000 steps with 859 reset in 1140 ms.
Built C files in :
/tmp/ltsmin14509249282732594482
[2024-05-29 09:44:21] [INFO ] Computing symmetric may disable matrix : 272 transitions.
[2024-05-29 09:44:21] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 09:44:21] [INFO ] Computing symmetric may enable matrix : 272 transitions.
[2024-05-29 09:44:21] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 09:44:21] [INFO ] Computing Do-Not-Accords matrix : 272 transitions.
[2024-05-29 09:44:21] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 09:44:21] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14509249282732594482
Running compilation step : cd /tmp/ltsmin14509249282732594482;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 630 ms.
Running link step : cd /tmp/ltsmin14509249282732594482;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin14509249282732594482;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10399546554250718191.hoa' '--buchi-type=spotba'
LTSmin run took 1919 ms.
FORMULA SquareGrid-PT-040204-LTLFireability-09 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property SquareGrid-PT-040204-LTLFireability-09 finished in 46845 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(((!p0&&X(!p1)) U (G((!p0&&X(!p1)))||(X(!p1)&&p2))))))'
Support contains 8 out of 240 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 240/240 places, 272/272 transitions.
Applied a total of 0 rules in 4 ms. Remains 240 /240 variables (removed 0) and now considering 272/272 (removed 0) transitions.
[2024-05-29 09:44:24] [INFO ] Invariant cache hit.
[2024-05-29 09:44:24] [INFO ] Implicit Places using invariants in 135 ms returned []
[2024-05-29 09:44:24] [INFO ] Invariant cache hit.
[2024-05-29 09:44:24] [INFO ] Implicit Places using invariants and state equation in 212 ms returned []
Implicit Place search using SMT with State Equation took 348 ms to find 0 implicit places.
Running 208 sub problems to find dead transitions.
[2024-05-29 09:44:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 128/240 variables, 80/96 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (OVERLAPS) 272/512 variables, 240/337 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/512 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 7 (OVERLAPS) 0/512 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 208 unsolved
No progress, stopping.
After SMT solving in domain Real declared 512/512 variables, and 337 constraints, problems are : Problem set: 0 solved, 208 unsolved in 6474 ms.
Refiners :[Positive P Invariants (semi-flows): 96/96 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 240/240 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 208 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 128/240 variables, 80/96 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (OVERLAPS) 272/512 variables, 240/337 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/512 variables, 208/545 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/512 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 8 (OVERLAPS) 0/512 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 208 unsolved
No progress, stopping.
After SMT solving in domain Int declared 512/512 variables, and 545 constraints, problems are : Problem set: 0 solved, 208 unsolved in 12000 ms.
Refiners :[Positive P Invariants (semi-flows): 96/96 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 240/240 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints]
After SMT, in 18528ms problems are : Problem set: 0 solved, 208 unsolved
Search for dead transitions found 0 dead transitions in 18530ms
Finished structural reductions in LTL mode , in 1 iterations and 18884 ms. Remains : 240/240 places, 272/272 transitions.
Stuttering acceptance computed with spot in 148 ms :[(OR p1 (AND p0 (NOT p2))), (OR p1 (AND p0 (NOT p2))), p1]
Running random walk in product with property : SquareGrid-PT-040204-LTLFireability-10
Product exploration explored 100000 steps with 1037 reset in 1117 ms.
Product exploration explored 100000 steps with 950 reset in 1174 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1)]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (OR p2 (NOT p0))), (X (NOT (OR p2 (NOT p0)))), (X (AND (NOT p2) p0)), (X (NOT (AND (NOT p2) p0))), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), (X (NOT p0)), (X (X p2)), (X (X (NOT p2))), (X (X (OR (AND p2 p1) (AND (NOT p0) p1)))), (X (X (NOT (OR (AND p2 p1) (AND (NOT p0) p1))))), (X (X (OR p2 (NOT p0)))), (X (X (NOT (OR p2 (NOT p0))))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND (NOT p2) (NOT p0) p1))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p2) p0 p1))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 1 factoid took 682 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter sensitive) to 3 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 154 ms :[(OR p1 (AND p0 (NOT p2))), (OR p1 (AND p0 (NOT p2))), p1]
Reduction of identical properties reduced properties to check from 9 to 8
RANDOM walk for 463 steps (0 resets) in 23 ms. (19 steps per ms) remains 0/8 properties
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1)]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (OR p2 (NOT p0))), (X (NOT (OR p2 (NOT p0)))), (X (AND (NOT p2) p0)), (X (NOT (AND (NOT p2) p0))), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), (X (NOT p0)), (X (X p2)), (X (X (NOT p2))), (X (X (OR (AND p2 p1) (AND (NOT p0) p1)))), (X (X (NOT (OR (AND p2 p1) (AND (NOT p0) p1))))), (X (X (OR p2 (NOT p0)))), (X (X (NOT (OR p2 (NOT p0))))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND (NOT p2) (NOT p0) p1))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p2) p0 p1))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR (NOT p0) p2))), (F (NOT (AND (NOT p0) p1 (NOT p2)))), (F p0), (F (NOT (OR (NOT p0) (NOT p1) p2))), (F p2), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (OR (NOT p0) p2))), (F (NOT p1)), (F (NOT (OR (AND (NOT p0) p1) (AND p1 p2))))]
Knowledge based reduction with 1 factoid took 1084 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter sensitive) to 3 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 124 ms :[(OR p1 (AND p0 (NOT p2))), (OR p1 (AND p0 (NOT p2))), p1]
Stuttering acceptance computed with spot in 141 ms :[(OR p1 (AND p0 (NOT p2))), (OR p1 (AND p0 (NOT p2))), p1]
[2024-05-29 09:44:47] [INFO ] Invariant cache hit.
[2024-05-29 09:44:47] [INFO ] [Real]Absence check using 96 positive place invariants in 29 ms returned sat
[2024-05-29 09:44:47] [INFO ] [Real]Absence check using 96 positive and 1 generalized place invariants in 11 ms returned sat
[2024-05-29 09:44:47] [INFO ] [Real]Absence check using state equation in 181 ms returned sat
[2024-05-29 09:44:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 09:44:48] [INFO ] [Nat]Absence check using 96 positive place invariants in 26 ms returned sat
[2024-05-29 09:44:48] [INFO ] [Nat]Absence check using 96 positive and 1 generalized place invariants in 5 ms returned sat
[2024-05-29 09:44:48] [INFO ] [Nat]Absence check using state equation in 164 ms returned sat
[2024-05-29 09:44:48] [INFO ] Computed and/alt/rep : 208/208/208 causal constraints (skipped 0 transitions) in 15 ms.
[2024-05-29 09:44:48] [INFO ] Added : 75 causal constraints over 15 iterations in 281 ms. Result :sat
Could not prove EG p1
Support contains 8 out of 240 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 240/240 places, 272/272 transitions.
Applied a total of 0 rules in 2 ms. Remains 240 /240 variables (removed 0) and now considering 272/272 (removed 0) transitions.
[2024-05-29 09:44:48] [INFO ] Invariant cache hit.
[2024-05-29 09:44:48] [INFO ] Implicit Places using invariants in 125 ms returned []
[2024-05-29 09:44:48] [INFO ] Invariant cache hit.
[2024-05-29 09:44:48] [INFO ] Implicit Places using invariants and state equation in 212 ms returned []
Implicit Place search using SMT with State Equation took 339 ms to find 0 implicit places.
Running 208 sub problems to find dead transitions.
[2024-05-29 09:44:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 128/240 variables, 80/96 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (OVERLAPS) 272/512 variables, 240/337 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/512 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 7 (OVERLAPS) 0/512 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 208 unsolved
No progress, stopping.
After SMT solving in domain Real declared 512/512 variables, and 337 constraints, problems are : Problem set: 0 solved, 208 unsolved in 6572 ms.
Refiners :[Positive P Invariants (semi-flows): 96/96 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 240/240 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 208 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 128/240 variables, 80/96 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (OVERLAPS) 272/512 variables, 240/337 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/512 variables, 208/545 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/512 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 8 (OVERLAPS) 0/512 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 208 unsolved
No progress, stopping.
After SMT solving in domain Int declared 512/512 variables, and 545 constraints, problems are : Problem set: 0 solved, 208 unsolved in 11983 ms.
Refiners :[Positive P Invariants (semi-flows): 96/96 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 240/240 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints]
After SMT, in 18609ms problems are : Problem set: 0 solved, 208 unsolved
Search for dead transitions found 0 dead transitions in 18612ms
Finished structural reductions in LTL mode , in 1 iterations and 18953 ms. Remains : 240/240 places, 272/272 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1)]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (OR (NOT p0) p2)), (X (NOT (OR (NOT p0) p2))), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X p0), (X (NOT p0)), (X (X p2)), (X (X (NOT p2))), (X (X (OR (NOT p0) p2))), (X (X (NOT (OR (NOT p0) p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (X (X (OR (AND (NOT p0) p1) (AND p1 p2)))), (X (X (NOT (OR (AND (NOT p0) p1) (AND p1 p2))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 1 factoid took 721 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter sensitive) to 3 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 123 ms :[(OR p1 (AND p0 (NOT p2))), (OR p1 (AND p0 (NOT p2))), p1]
Reduction of identical properties reduced properties to check from 9 to 8
RANDOM walk for 1027 steps (0 resets) in 37 ms. (27 steps per ms) remains 0/8 properties
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1)]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (OR (NOT p0) p2)), (X (NOT (OR (NOT p0) p2))), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X p0), (X (NOT p0)), (X (X p2)), (X (X (NOT p2))), (X (X (OR (NOT p0) p2))), (X (X (NOT (OR (NOT p0) p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (X (X (OR (AND (NOT p0) p1) (AND p1 p2)))), (X (X (NOT (OR (AND (NOT p0) p1) (AND p1 p2))))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR (NOT p0) p2))), (F (NOT (AND (NOT p0) p1 (NOT p2)))), (F p0), (F (NOT (OR (NOT p0) (NOT p1) p2))), (F p2), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (OR (NOT p0) p2))), (F (NOT p1)), (F (NOT (OR (AND (NOT p0) p1) (AND p1 p2))))]
Knowledge based reduction with 1 factoid took 870 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter sensitive) to 3 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 118 ms :[(OR p1 (AND p0 (NOT p2))), (OR p1 (AND p0 (NOT p2))), p1]
Stuttering acceptance computed with spot in 127 ms :[(OR p1 (AND p0 (NOT p2))), (OR p1 (AND p0 (NOT p2))), p1]
[2024-05-29 09:45:09] [INFO ] Invariant cache hit.
[2024-05-29 09:45:09] [INFO ] [Real]Absence check using 96 positive place invariants in 28 ms returned sat
[2024-05-29 09:45:09] [INFO ] [Real]Absence check using 96 positive and 1 generalized place invariants in 14 ms returned sat
[2024-05-29 09:45:09] [INFO ] [Real]Absence check using state equation in 176 ms returned sat
[2024-05-29 09:45:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 09:45:10] [INFO ] [Nat]Absence check using 96 positive place invariants in 26 ms returned sat
[2024-05-29 09:45:10] [INFO ] [Nat]Absence check using 96 positive and 1 generalized place invariants in 5 ms returned sat
[2024-05-29 09:45:10] [INFO ] [Nat]Absence check using state equation in 171 ms returned sat
[2024-05-29 09:45:10] [INFO ] Computed and/alt/rep : 208/208/208 causal constraints (skipped 0 transitions) in 15 ms.
[2024-05-29 09:45:10] [INFO ] Added : 75 causal constraints over 15 iterations in 275 ms. Result :sat
Could not prove EG p1
Stuttering acceptance computed with spot in 146 ms :[(OR p1 (AND p0 (NOT p2))), (OR p1 (AND p0 (NOT p2))), p1]
Product exploration explored 100000 steps with 1035 reset in 1091 ms.
Product exploration explored 100000 steps with 1079 reset in 1176 ms.
Built C files in :
/tmp/ltsmin12781629990893752035
[2024-05-29 09:45:13] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12781629990893752035
Running compilation step : cd /tmp/ltsmin12781629990893752035;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 536 ms.
Running link step : cd /tmp/ltsmin12781629990893752035;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin12781629990893752035;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1177517561890094615.hoa' '--buchi-type=spotba'
LTSmin run took 1255 ms.
FORMULA SquareGrid-PT-040204-LTLFireability-10 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property SquareGrid-PT-040204-LTLFireability-10 finished in 50922 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0||X(X(p0))||F(p1)))))'
Support contains 4 out of 240 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 240/240 places, 272/272 transitions.
Applied a total of 0 rules in 2 ms. Remains 240 /240 variables (removed 0) and now considering 272/272 (removed 0) transitions.
[2024-05-29 09:45:15] [INFO ] Invariant cache hit.
[2024-05-29 09:45:15] [INFO ] Implicit Places using invariants in 137 ms returned []
[2024-05-29 09:45:15] [INFO ] Invariant cache hit.
[2024-05-29 09:45:15] [INFO ] Implicit Places using invariants and state equation in 203 ms returned []
Implicit Place search using SMT with State Equation took 346 ms to find 0 implicit places.
Running 208 sub problems to find dead transitions.
[2024-05-29 09:45:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 128/240 variables, 80/96 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (OVERLAPS) 272/512 variables, 240/337 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/512 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 7 (OVERLAPS) 0/512 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 208 unsolved
No progress, stopping.
After SMT solving in domain Real declared 512/512 variables, and 337 constraints, problems are : Problem set: 0 solved, 208 unsolved in 6461 ms.
Refiners :[Positive P Invariants (semi-flows): 96/96 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 240/240 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 208 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 128/240 variables, 80/96 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (OVERLAPS) 272/512 variables, 240/337 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/512 variables, 208/545 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/512 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 8 (OVERLAPS) 0/512 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 208 unsolved
No progress, stopping.
After SMT solving in domain Int declared 512/512 variables, and 545 constraints, problems are : Problem set: 0 solved, 208 unsolved in 12019 ms.
Refiners :[Positive P Invariants (semi-flows): 96/96 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 240/240 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints]
After SMT, in 18556ms problems are : Problem set: 0 solved, 208 unsolved
Search for dead transitions found 0 dead transitions in 18559ms
Finished structural reductions in LTL mode , in 1 iterations and 18908 ms. Remains : 240/240 places, 272/272 transitions.
Stuttering acceptance computed with spot in 148 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : SquareGrid-PT-040204-LTLFireability-12
Product exploration explored 100000 steps with 1387 reset in 1037 ms.
Product exploration explored 100000 steps with 1341 reset in 1128 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 1 factoid took 323 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 166 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 366 steps (0 resets) in 14 ms. (24 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F p0)]
Knowledge based reduction with 1 factoid took 331 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 155 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 143 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
[2024-05-29 09:45:37] [INFO ] Invariant cache hit.
[2024-05-29 09:45:37] [INFO ] [Real]Absence check using 96 positive place invariants in 26 ms returned sat
[2024-05-29 09:45:37] [INFO ] [Real]Absence check using 96 positive and 1 generalized place invariants in 17 ms returned sat
[2024-05-29 09:45:37] [INFO ] [Real]Absence check using state equation in 217 ms returned sat
[2024-05-29 09:45:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 09:45:37] [INFO ] [Nat]Absence check using 96 positive place invariants in 20 ms returned sat
[2024-05-29 09:45:37] [INFO ] [Nat]Absence check using 96 positive and 1 generalized place invariants in 14 ms returned sat
[2024-05-29 09:45:38] [INFO ] [Nat]Absence check using state equation in 165 ms returned sat
[2024-05-29 09:45:38] [INFO ] Computed and/alt/rep : 208/208/208 causal constraints (skipped 0 transitions) in 12 ms.
[2024-05-29 09:45:38] [INFO ] Added : 76 causal constraints over 16 iterations in 301 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 4 out of 240 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 240/240 places, 272/272 transitions.
Applied a total of 0 rules in 10 ms. Remains 240 /240 variables (removed 0) and now considering 272/272 (removed 0) transitions.
[2024-05-29 09:45:38] [INFO ] Invariant cache hit.
[2024-05-29 09:45:38] [INFO ] Implicit Places using invariants in 134 ms returned []
[2024-05-29 09:45:38] [INFO ] Invariant cache hit.
[2024-05-29 09:45:38] [INFO ] Implicit Places using invariants and state equation in 197 ms returned []
Implicit Place search using SMT with State Equation took 336 ms to find 0 implicit places.
Running 208 sub problems to find dead transitions.
[2024-05-29 09:45:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 128/240 variables, 80/96 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (OVERLAPS) 272/512 variables, 240/337 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/512 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 7 (OVERLAPS) 0/512 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 208 unsolved
No progress, stopping.
After SMT solving in domain Real declared 512/512 variables, and 337 constraints, problems are : Problem set: 0 solved, 208 unsolved in 6426 ms.
Refiners :[Positive P Invariants (semi-flows): 96/96 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 240/240 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 208 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 128/240 variables, 80/96 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (OVERLAPS) 272/512 variables, 240/337 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/512 variables, 208/545 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/512 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 8 (OVERLAPS) 0/512 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 208 unsolved
No progress, stopping.
After SMT solving in domain Int declared 512/512 variables, and 545 constraints, problems are : Problem set: 0 solved, 208 unsolved in 12021 ms.
Refiners :[Positive P Invariants (semi-flows): 96/96 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 240/240 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints]
After SMT, in 18513ms problems are : Problem set: 0 solved, 208 unsolved
Search for dead transitions found 0 dead transitions in 18517ms
Finished structural reductions in LTL mode , in 1 iterations and 18864 ms. Remains : 240/240 places, 272/272 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 1 factoid took 283 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 170 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 1006 steps (0 resets) in 40 ms. (24 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F p0)]
Knowledge based reduction with 1 factoid took 371 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 163 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
[2024-05-29 09:45:58] [INFO ] Invariant cache hit.
[2024-05-29 09:45:58] [INFO ] [Real]Absence check using 96 positive place invariants in 26 ms returned sat
[2024-05-29 09:45:58] [INFO ] [Real]Absence check using 96 positive and 1 generalized place invariants in 17 ms returned sat
[2024-05-29 09:45:58] [INFO ] [Real]Absence check using state equation in 237 ms returned sat
[2024-05-29 09:45:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 09:45:59] [INFO ] [Nat]Absence check using 96 positive place invariants in 21 ms returned sat
[2024-05-29 09:45:59] [INFO ] [Nat]Absence check using 96 positive and 1 generalized place invariants in 15 ms returned sat
[2024-05-29 09:45:59] [INFO ] [Nat]Absence check using state equation in 175 ms returned sat
[2024-05-29 09:45:59] [INFO ] Computed and/alt/rep : 208/208/208 causal constraints (skipped 0 transitions) in 14 ms.
[2024-05-29 09:45:59] [INFO ] Added : 76 causal constraints over 16 iterations in 285 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 176 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 1347 reset in 1019 ms.
Product exploration explored 100000 steps with 1362 reset in 1088 ms.
Built C files in :
/tmp/ltsmin17775986489017070681
[2024-05-29 09:46:01] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17775986489017070681
Running compilation step : cd /tmp/ltsmin17775986489017070681;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 531 ms.
Running link step : cd /tmp/ltsmin17775986489017070681;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin17775986489017070681;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased3144202288446256573.hoa' '--buchi-type=spotba'
LTSmin run took 945 ms.
FORMULA SquareGrid-PT-040204-LTLFireability-12 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property SquareGrid-PT-040204-LTLFireability-12 finished in 48476 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((X(G(!p1))||p0)) U (p1 U p2))))'
Support contains 6 out of 240 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 240/240 places, 272/272 transitions.
Applied a total of 0 rules in 4 ms. Remains 240 /240 variables (removed 0) and now considering 272/272 (removed 0) transitions.
[2024-05-29 09:46:03] [INFO ] Invariant cache hit.
[2024-05-29 09:46:03] [INFO ] Implicit Places using invariants in 125 ms returned []
[2024-05-29 09:46:03] [INFO ] Invariant cache hit.
[2024-05-29 09:46:03] [INFO ] Implicit Places using invariants and state equation in 219 ms returned []
Implicit Place search using SMT with State Equation took 347 ms to find 0 implicit places.
Running 208 sub problems to find dead transitions.
[2024-05-29 09:46:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 128/240 variables, 80/96 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (OVERLAPS) 272/512 variables, 240/337 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/512 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 7 (OVERLAPS) 0/512 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 208 unsolved
No progress, stopping.
After SMT solving in domain Real declared 512/512 variables, and 337 constraints, problems are : Problem set: 0 solved, 208 unsolved in 6525 ms.
Refiners :[Positive P Invariants (semi-flows): 96/96 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 240/240 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 208 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 128/240 variables, 80/96 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (OVERLAPS) 272/512 variables, 240/337 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/512 variables, 208/545 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/512 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 8 (OVERLAPS) 0/512 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 208 unsolved
No progress, stopping.
After SMT solving in domain Int declared 512/512 variables, and 545 constraints, problems are : Problem set: 0 solved, 208 unsolved in 12163 ms.
Refiners :[Positive P Invariants (semi-flows): 96/96 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 240/240 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints]
After SMT, in 18739ms problems are : Problem set: 0 solved, 208 unsolved
Search for dead transitions found 0 dead transitions in 18742ms
Finished structural reductions in LTL mode , in 1 iterations and 19094 ms. Remains : 240/240 places, 272/272 transitions.
Stuttering acceptance computed with spot in 321 ms :[(NOT p2), (NOT p2), (AND (NOT p0) p1), (AND (NOT p2) p1 (NOT p0)), p1, true, (AND p1 (NOT p2)), (NOT p2)]
Running random walk in product with property : SquareGrid-PT-040204-LTLFireability-13
Entered a terminal (fully accepting) state of product in 131 steps with 1 reset in 4 ms.
FORMULA SquareGrid-PT-040204-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SquareGrid-PT-040204-LTLFireability-13 finished in 19441 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||(F(p1) U (p1||G(p2)))))'
Support contains 6 out of 240 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 240/240 places, 272/272 transitions.
Applied a total of 0 rules in 13 ms. Remains 240 /240 variables (removed 0) and now considering 272/272 (removed 0) transitions.
[2024-05-29 09:46:22] [INFO ] Invariant cache hit.
[2024-05-29 09:46:23] [INFO ] Implicit Places using invariants in 127 ms returned []
[2024-05-29 09:46:23] [INFO ] Invariant cache hit.
[2024-05-29 09:46:23] [INFO ] Implicit Places using invariants and state equation in 212 ms returned []
Implicit Place search using SMT with State Equation took 341 ms to find 0 implicit places.
[2024-05-29 09:46:23] [INFO ] Redundant transitions in 1 ms returned []
Running 208 sub problems to find dead transitions.
[2024-05-29 09:46:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 128/240 variables, 80/96 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (OVERLAPS) 272/512 variables, 240/337 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/512 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 7 (OVERLAPS) 0/512 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 208 unsolved
No progress, stopping.
After SMT solving in domain Real declared 512/512 variables, and 337 constraints, problems are : Problem set: 0 solved, 208 unsolved in 6455 ms.
Refiners :[Positive P Invariants (semi-flows): 96/96 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 240/240 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 208 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 128/240 variables, 80/96 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (OVERLAPS) 272/512 variables, 240/337 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/512 variables, 208/545 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/512 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 8 (OVERLAPS) 0/512 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 208 unsolved
No progress, stopping.
After SMT solving in domain Int declared 512/512 variables, and 545 constraints, problems are : Problem set: 0 solved, 208 unsolved in 11927 ms.
Refiners :[Positive P Invariants (semi-flows): 96/96 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 240/240 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints]
After SMT, in 18444ms problems are : Problem set: 0 solved, 208 unsolved
Search for dead transitions found 0 dead transitions in 18447ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 18806 ms. Remains : 240/240 places, 272/272 transitions.
Stuttering acceptance computed with spot in 190 ms :[(AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : SquareGrid-PT-040204-LTLFireability-14
Product exploration explored 100000 steps with 1199 reset in 1019 ms.
Product exploration explored 100000 steps with 1184 reset in 1091 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT (AND p0 (NOT p1) p2)))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p0) (NOT p1) p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) p2))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (AND p0 (NOT p1) (NOT p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 2 factoid took 1207 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 130 steps (0 resets) in 9 ms. (13 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT (AND p0 (NOT p1) p2)))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p0) (NOT p1) p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) p2))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (AND p0 (NOT p1) (NOT p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F p1)]
Knowledge based reduction with 2 factoid took 1320 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 70 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 78 ms :[(NOT p1), (NOT p1)]
[2024-05-29 09:46:46] [INFO ] Invariant cache hit.
[2024-05-29 09:46:47] [INFO ] [Real]Absence check using 96 positive place invariants in 29 ms returned sat
[2024-05-29 09:46:47] [INFO ] [Real]Absence check using 96 positive and 1 generalized place invariants in 7 ms returned sat
[2024-05-29 09:46:47] [INFO ] [Real]Absence check using state equation in 155 ms returned sat
[2024-05-29 09:46:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 09:46:47] [INFO ] [Nat]Absence check using 96 positive place invariants in 46 ms returned sat
[2024-05-29 09:46:47] [INFO ] [Nat]Absence check using 96 positive and 1 generalized place invariants in 3 ms returned sat
[2024-05-29 09:46:47] [INFO ] [Nat]Absence check using state equation in 160 ms returned sat
[2024-05-29 09:46:47] [INFO ] Computed and/alt/rep : 208/208/208 causal constraints (skipped 0 transitions) in 13 ms.
[2024-05-29 09:46:47] [INFO ] Added : 75 causal constraints over 15 iterations in 258 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 2 out of 240 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 : 240/240 places, 272/272 transitions.
Applied a total of 0 rules in 6 ms. Remains 240 /240 variables (removed 0) and now considering 272/272 (removed 0) transitions.
[2024-05-29 09:46:47] [INFO ] Invariant cache hit.
[2024-05-29 09:46:47] [INFO ] Implicit Places using invariants in 128 ms returned []
[2024-05-29 09:46:47] [INFO ] Invariant cache hit.
[2024-05-29 09:46:48] [INFO ] Implicit Places using invariants and state equation in 205 ms returned []
Implicit Place search using SMT with State Equation took 334 ms to find 0 implicit places.
[2024-05-29 09:46:48] [INFO ] Redundant transitions in 0 ms returned []
Running 208 sub problems to find dead transitions.
[2024-05-29 09:46:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 128/240 variables, 80/96 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (OVERLAPS) 272/512 variables, 240/337 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/512 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 7 (OVERLAPS) 0/512 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 208 unsolved
No progress, stopping.
After SMT solving in domain Real declared 512/512 variables, and 337 constraints, problems are : Problem set: 0 solved, 208 unsolved in 6266 ms.
Refiners :[Positive P Invariants (semi-flows): 96/96 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 240/240 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 208 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 128/240 variables, 80/96 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (OVERLAPS) 272/512 variables, 240/337 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/512 variables, 208/545 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/512 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 8 (OVERLAPS) 0/512 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 208 unsolved
No progress, stopping.
After SMT solving in domain Int declared 512/512 variables, and 545 constraints, problems are : Problem set: 0 solved, 208 unsolved in 12037 ms.
Refiners :[Positive P Invariants (semi-flows): 96/96 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 240/240 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints]
After SMT, in 18363ms problems are : Problem set: 0 solved, 208 unsolved
Search for dead transitions found 0 dead transitions in 18366ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 18714 ms. Remains : 240/240 places, 272/272 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p1)]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 1 factoid took 197 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 68 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 209 steps (0 resets) in 13 ms. (14 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p1)]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (F p1)]
Knowledge based reduction with 1 factoid took 189 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 83 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p1), (NOT p1)]
[2024-05-29 09:47:07] [INFO ] Invariant cache hit.
[2024-05-29 09:47:07] [INFO ] [Real]Absence check using 96 positive place invariants in 27 ms returned sat
[2024-05-29 09:47:07] [INFO ] [Real]Absence check using 96 positive and 1 generalized place invariants in 10 ms returned sat
[2024-05-29 09:47:07] [INFO ] [Real]Absence check using state equation in 150 ms returned sat
[2024-05-29 09:47:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 09:47:07] [INFO ] [Nat]Absence check using 96 positive place invariants in 47 ms returned sat
[2024-05-29 09:47:07] [INFO ] [Nat]Absence check using 96 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-29 09:47:07] [INFO ] [Nat]Absence check using state equation in 175 ms returned sat
[2024-05-29 09:47:07] [INFO ] Computed and/alt/rep : 208/208/208 causal constraints (skipped 0 transitions) in 15 ms.
[2024-05-29 09:47:08] [INFO ] Added : 75 causal constraints over 15 iterations in 285 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 69 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 1212 reset in 1019 ms.
Product exploration explored 100000 steps with 1174 reset in 1092 ms.
Built C files in :
/tmp/ltsmin15721595800186542497
[2024-05-29 09:47:10] [INFO ] Computing symmetric may disable matrix : 272 transitions.
[2024-05-29 09:47:10] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 09:47:10] [INFO ] Computing symmetric may enable matrix : 272 transitions.
[2024-05-29 09:47:10] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 09:47:10] [INFO ] Computing Do-Not-Accords matrix : 272 transitions.
[2024-05-29 09:47:10] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 09:47:10] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15721595800186542497
Running compilation step : cd /tmp/ltsmin15721595800186542497;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 633 ms.
Running link step : cd /tmp/ltsmin15721595800186542497;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin15721595800186542497;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased17797428643316351350.hoa' '--buchi-type=spotba'
LTSmin run took 1146 ms.
FORMULA SquareGrid-PT-040204-LTLFireability-14 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property SquareGrid-PT-040204-LTLFireability-14 finished in 49219 ms.
All properties solved by simple procedures.
Total runtime 363699 ms.

BK_STOP 1716976032193

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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="SquareGrid-PT-040204"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is SquareGrid-PT-040204, 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 r400-tall-171690531500060"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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