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.r536-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 ltsminxred
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 r536-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 1717226404115

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SquareGrid-PT-040204
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 07:20:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 07:20:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 07:20:05] [INFO ] Load time of PNML (sax parser for PT used): 72 ms
[2024-06-01 07:20:05] [INFO ] Transformed 240 places.
[2024-06-01 07:20:05] [INFO ] Transformed 272 transitions.
[2024-06-01 07:20:05] [INFO ] Parsed PT model containing 240 places and 272 transitions and 1088 arcs in 164 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 21 ms. Remains 240 /240 variables (removed 0) and now considering 272/272 (removed 0) transitions.
// Phase 1: matrix 272 rows 240 cols
[2024-06-01 07:20:05] [INFO ] Computed 97 invariants in 26 ms
[2024-06-01 07:20:05] [INFO ] Implicit Places using invariants in 343 ms returned []
[2024-06-01 07:20:05] [INFO ] Invariant cache hit.
[2024-06-01 07:20:06] [INFO ] Implicit Places using invariants and state equation in 231 ms returned []
Implicit Place search using SMT with State Equation took 605 ms to find 0 implicit places.
Running 208 sub problems to find dead transitions.
[2024-06-01 07:20:06] [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 6779 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 12447 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 19366ms problems are : Problem set: 0 solved, 208 unsolved
Search for dead transitions found 0 dead transitions in 19387ms
Finished structural reductions in LTL mode , in 1 iterations and 20032 ms. Remains : 240/240 places, 272/272 transitions.
Support contains 47 out of 240 places after structural reductions.
[2024-06-01 07:20:25] [INFO ] Flatten gal took : 53 ms
[2024-06-01 07:20:25] [INFO ] Flatten gal took : 23 ms
[2024-06-01 07:20:25] [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 2953 steps (0 resets) in 332 ms. (8 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-06-01 07:20:26] [INFO ] Invariant cache hit.
[2024-06-01 07:20:26] [INFO ] Implicit Places using invariants in 153 ms returned []
[2024-06-01 07:20:26] [INFO ] Invariant cache hit.
[2024-06-01 07:20:26] [INFO ] Implicit Places using invariants and state equation in 205 ms returned []
Implicit Place search using SMT with State Equation took 363 ms to find 0 implicit places.
[2024-06-01 07:20:26] [INFO ] Redundant transitions in 14 ms returned []
Running 208 sub problems to find dead transitions.
[2024-06-01 07:20:26] [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 6398 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 12209 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 18673ms problems are : Problem set: 0 solved, 208 unsolved
Search for dead transitions found 0 dead transitions in 18676ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 19082 ms. Remains : 240/240 places, 272/272 transitions.
Stuttering acceptance computed with spot in 208 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SquareGrid-PT-040204-LTLFireability-01
Product exploration explored 100000 steps with 2268 reset in 1091 ms.
Product exploration explored 100000 steps with 2354 reset in 1061 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 146 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 143 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 155 steps (0 resets) in 10 ms. (14 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 150 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
[2024-06-01 07:20:48] [INFO ] Invariant cache hit.
[2024-06-01 07:20:48] [INFO ] [Real]Absence check using 96 positive place invariants in 20 ms returned sat
[2024-06-01 07:20:48] [INFO ] [Real]Absence check using 96 positive and 1 generalized place invariants in 10 ms returned sat
[2024-06-01 07:20:48] [INFO ] [Real]Absence check using state equation in 218 ms returned sat
[2024-06-01 07:20:48] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 07:20:49] [INFO ] [Nat]Absence check using 96 positive place invariants in 22 ms returned sat
[2024-06-01 07:20:49] [INFO ] [Nat]Absence check using 96 positive and 1 generalized place invariants in 6 ms returned sat
[2024-06-01 07:20:49] [INFO ] [Nat]Absence check using state equation in 182 ms returned sat
[2024-06-01 07:20:49] [INFO ] Computed and/alt/rep : 208/208/208 causal constraints (skipped 0 transitions) in 13 ms.
[2024-06-01 07:20:49] [INFO ] Added : 75 causal constraints over 15 iterations in 281 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 12 ms. Remains 240 /240 variables (removed 0) and now considering 272/272 (removed 0) transitions.
[2024-06-01 07:20:49] [INFO ] Invariant cache hit.
[2024-06-01 07:20:49] [INFO ] Implicit Places using invariants in 129 ms returned []
[2024-06-01 07:20:49] [INFO ] Invariant cache hit.
[2024-06-01 07:20:49] [INFO ] Implicit Places using invariants and state equation in 199 ms returned []
Implicit Place search using SMT with State Equation took 330 ms to find 0 implicit places.
[2024-06-01 07:20:49] [INFO ] Redundant transitions in 6 ms returned []
Running 208 sub problems to find dead transitions.
[2024-06-01 07:20:49] [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 6416 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 12046 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 18544ms problems are : Problem set: 0 solved, 208 unsolved
Search for dead transitions found 0 dead transitions in 18547ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 18901 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 137 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 65 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 206 steps (0 resets) in 10 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 176 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 p0), (NOT p0)]
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0)]
[2024-06-01 07:21:09] [INFO ] Invariant cache hit.
[2024-06-01 07:21:09] [INFO ] [Real]Absence check using 96 positive place invariants in 20 ms returned sat
[2024-06-01 07:21:09] [INFO ] [Real]Absence check using 96 positive and 1 generalized place invariants in 13 ms returned sat
[2024-06-01 07:21:09] [INFO ] [Real]Absence check using state equation in 225 ms returned sat
[2024-06-01 07:21:09] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 07:21:09] [INFO ] [Nat]Absence check using 96 positive place invariants in 29 ms returned sat
[2024-06-01 07:21:09] [INFO ] [Nat]Absence check using 96 positive and 1 generalized place invariants in 6 ms returned sat
[2024-06-01 07:21:09] [INFO ] [Nat]Absence check using state equation in 187 ms returned sat
[2024-06-01 07:21:09] [INFO ] Computed and/alt/rep : 208/208/208 causal constraints (skipped 0 transitions) in 19 ms.
[2024-06-01 07:21:10] [INFO ] Added : 75 causal constraints over 15 iterations in 295 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2329 reset in 966 ms.
Product exploration explored 100000 steps with 2211 reset in 1033 ms.
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 16 ms. Remains 240 /240 variables (removed 0) and now considering 272/272 (removed 0) transitions.
[2024-06-01 07:21:12] [INFO ] Invariant cache hit.
[2024-06-01 07:21:12] [INFO ] Implicit Places using invariants in 199 ms returned []
[2024-06-01 07:21:12] [INFO ] Invariant cache hit.
[2024-06-01 07:21:12] [INFO ] Implicit Places using invariants and state equation in 216 ms returned []
Implicit Place search using SMT with State Equation took 422 ms to find 0 implicit places.
[2024-06-01 07:21:12] [INFO ] Redundant transitions in 4 ms returned []
Running 208 sub problems to find dead transitions.
[2024-06-01 07:21:12] [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 6448 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 12212 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 18721ms problems are : Problem set: 0 solved, 208 unsolved
Search for dead transitions found 0 dead transitions in 18724ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 19172 ms. Remains : 240/240 places, 272/272 transitions.
Treatment of property SquareGrid-PT-040204-LTLFireability-01 finished in 64998 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 4 ms. Remains 240 /240 variables (removed 0) and now considering 272/272 (removed 0) transitions.
[2024-06-01 07:21:31] [INFO ] Invariant cache hit.
[2024-06-01 07:21:31] [INFO ] Implicit Places using invariants in 130 ms returned []
[2024-06-01 07:21:31] [INFO ] Invariant cache hit.
[2024-06-01 07:21:31] [INFO ] Implicit Places using invariants and state equation in 209 ms returned []
Implicit Place search using SMT with State Equation took 343 ms to find 0 implicit places.
Running 208 sub problems to find dead transitions.
[2024-06-01 07:21:31] [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 6560 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 12474 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 19097ms problems are : Problem set: 0 solved, 208 unsolved
Search for dead transitions found 0 dead transitions in 19099ms
Finished structural reductions in LTL mode , in 1 iterations and 19448 ms. Remains : 240/240 places, 272/272 transitions.
Stuttering acceptance computed with spot in 91 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 19560 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 12 ms. Remains 240 /240 variables (removed 0) and now considering 272/272 (removed 0) transitions.
[2024-06-01 07:21:50] [INFO ] Invariant cache hit.
[2024-06-01 07:21:51] [INFO ] Implicit Places using invariants in 143 ms returned []
[2024-06-01 07:21:51] [INFO ] Invariant cache hit.
[2024-06-01 07:21:51] [INFO ] Implicit Places using invariants and state equation in 214 ms returned []
Implicit Place search using SMT with State Equation took 359 ms to find 0 implicit places.
Running 208 sub problems to find dead transitions.
[2024-06-01 07:21:51] [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 6297 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 11932 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 18296ms problems are : Problem set: 0 solved, 208 unsolved
Search for dead transitions found 0 dead transitions in 18297ms
Finished structural reductions in LTL mode , in 1 iterations and 18669 ms. Remains : 240/240 places, 272/272 transitions.
Stuttering acceptance computed with spot in 205 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 4112 steps with 0 reset in 36 ms.
FORMULA SquareGrid-PT-040204-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SquareGrid-PT-040204-LTLFireability-04 finished in 18928 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 4 ms. Remains 240 /240 variables (removed 0) and now considering 272/272 (removed 0) transitions.
[2024-06-01 07:22:09] [INFO ] Invariant cache hit.
[2024-06-01 07:22:10] [INFO ] Implicit Places using invariants in 132 ms returned []
[2024-06-01 07:22:10] [INFO ] Invariant cache hit.
[2024-06-01 07:22:10] [INFO ] Implicit Places using invariants and state equation in 194 ms returned []
Implicit Place search using SMT with State Equation took 327 ms to find 0 implicit places.
Running 208 sub problems to find dead transitions.
[2024-06-01 07:22:10] [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 6679 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 12371 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 19109ms problems are : Problem set: 0 solved, 208 unsolved
Search for dead transitions found 0 dead transitions in 19112ms
Finished structural reductions in LTL mode , in 1 iterations and 19444 ms. Remains : 240/240 places, 272/272 transitions.
Stuttering acceptance computed with spot in 216 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 19681 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-06-01 07:22:29] [INFO ] Invariant cache hit.
[2024-06-01 07:22:29] [INFO ] Implicit Places using invariants in 129 ms returned []
[2024-06-01 07:22:29] [INFO ] Invariant cache hit.
[2024-06-01 07:22:29] [INFO ] Implicit Places using invariants and state equation in 206 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-06-01 07:22:29] [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 6394 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 11763 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 18220ms problems are : Problem set: 0 solved, 208 unsolved
Search for dead transitions found 0 dead transitions in 18222ms
Finished structural reductions in LTL mode , in 1 iterations and 18565 ms. Remains : 240/240 places, 272/272 transitions.
Stuttering acceptance computed with spot in 163 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 528 ms.
Product exploration explored 100000 steps with 50000 reset in 558 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 80 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 19940 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 11 ms. Remains 240 /240 variables (removed 0) and now considering 272/272 (removed 0) transitions.
[2024-06-01 07:22:49] [INFO ] Invariant cache hit.
[2024-06-01 07:22:49] [INFO ] Implicit Places using invariants in 125 ms returned []
[2024-06-01 07:22:49] [INFO ] Invariant cache hit.
[2024-06-01 07:22:49] [INFO ] Implicit Places using invariants and state equation in 201 ms returned []
Implicit Place search using SMT with State Equation took 329 ms to find 0 implicit places.
[2024-06-01 07:22:49] [INFO ] Redundant transitions in 2 ms returned []
Running 208 sub problems to find dead transitions.
[2024-06-01 07:22:49] [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 6355 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 12113 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 18526ms problems are : Problem set: 0 solved, 208 unsolved
Search for dead transitions found 0 dead transitions in 18528ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 18875 ms. Remains : 240/240 places, 272/272 transitions.
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SquareGrid-PT-040204-LTLFireability-09
Product exploration explored 100000 steps with 886 reset in 1019 ms.
Product exploration explored 100000 steps with 848 reset in 1078 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 172 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 579 steps (0 resets) in 19 ms. (28 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 141 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)]
Stuttering acceptance computed with spot in 88 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-06-01 07:23:11] [INFO ] Invariant cache hit.
[2024-06-01 07:23:11] [INFO ] Implicit Places using invariants in 134 ms returned []
[2024-06-01 07:23:11] [INFO ] Invariant cache hit.
[2024-06-01 07:23:11] [INFO ] Implicit Places using invariants and state equation in 220 ms returned []
Implicit Place search using SMT with State Equation took 356 ms to find 0 implicit places.
[2024-06-01 07:23:11] [INFO ] Redundant transitions in 2 ms returned []
Running 208 sub problems to find dead transitions.
[2024-06-01 07:23:11] [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 6391 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 12401 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 18867ms problems are : Problem set: 0 solved, 208 unsolved
Search for dead transitions found 0 dead transitions in 18870ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 19249 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 165 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 p0), (NOT p0)]
RANDOM walk for 127 steps (0 resets) in 7 ms. (15 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 205 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 90 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 824 reset in 1022 ms.
Product exploration explored 100000 steps with 815 reset in 1101 ms.
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 6 ms. Remains 240 /240 variables (removed 0) and now considering 272/272 (removed 0) transitions.
[2024-06-01 07:23:33] [INFO ] Invariant cache hit.
[2024-06-01 07:23:33] [INFO ] Implicit Places using invariants in 140 ms returned []
[2024-06-01 07:23:33] [INFO ] Invariant cache hit.
[2024-06-01 07:23:33] [INFO ] Implicit Places using invariants and state equation in 226 ms returned []
Implicit Place search using SMT with State Equation took 367 ms to find 0 implicit places.
[2024-06-01 07:23:33] [INFO ] Redundant transitions in 1 ms returned []
Running 208 sub problems to find dead transitions.
[2024-06-01 07:23:33] [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 6451 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 11859 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 18377ms problems are : Problem set: 0 solved, 208 unsolved
Search for dead transitions found 0 dead transitions in 18381ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 18763 ms. Remains : 240/240 places, 272/272 transitions.
Treatment of property SquareGrid-PT-040204-LTLFireability-09 finished in 62546 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 2 ms. Remains 240 /240 variables (removed 0) and now considering 272/272 (removed 0) transitions.
[2024-06-01 07:23:52] [INFO ] Invariant cache hit.
[2024-06-01 07:23:52] [INFO ] Implicit Places using invariants in 208 ms returned []
[2024-06-01 07:23:52] [INFO ] Invariant cache hit.
[2024-06-01 07:23:52] [INFO ] Implicit Places using invariants and state equation in 259 ms returned []
Implicit Place search using SMT with State Equation took 472 ms to find 0 implicit places.
Running 208 sub problems to find dead transitions.
[2024-06-01 07:23:52] [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 6420 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 12415 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 18891ms problems are : Problem set: 0 solved, 208 unsolved
Search for dead transitions found 0 dead transitions in 18894ms
Finished structural reductions in LTL mode , in 1 iterations and 19368 ms. Remains : 240/240 places, 272/272 transitions.
Stuttering acceptance computed with spot in 122 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 1083 reset in 1112 ms.
Product exploration explored 100000 steps with 1047 reset in 1175 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 742 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 142 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 1201 steps (0 resets) in 30 ms. (38 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 950 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 129 ms :[(OR p1 (AND p0 (NOT p2))), (OR p1 (AND p0 (NOT p2))), p1]
Stuttering acceptance computed with spot in 118 ms :[(OR p1 (AND p0 (NOT p2))), (OR p1 (AND p0 (NOT p2))), p1]
[2024-06-01 07:24:15] [INFO ] Invariant cache hit.
[2024-06-01 07:24:16] [INFO ] [Real]Absence check using 96 positive place invariants in 27 ms returned sat
[2024-06-01 07:24:16] [INFO ] [Real]Absence check using 96 positive and 1 generalized place invariants in 9 ms returned sat
[2024-06-01 07:24:16] [INFO ] [Real]Absence check using state equation in 161 ms returned sat
[2024-06-01 07:24:16] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 07:24:16] [INFO ] [Nat]Absence check using 96 positive place invariants in 28 ms returned sat
[2024-06-01 07:24:16] [INFO ] [Nat]Absence check using 96 positive and 1 generalized place invariants in 9 ms returned sat
[2024-06-01 07:24:16] [INFO ] [Nat]Absence check using state equation in 173 ms returned sat
[2024-06-01 07:24:16] [INFO ] Computed and/alt/rep : 208/208/208 causal constraints (skipped 0 transitions) in 14 ms.
[2024-06-01 07:24:16] [INFO ] Added : 75 causal constraints over 15 iterations in 289 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-06-01 07:24:16] [INFO ] Invariant cache hit.
[2024-06-01 07:24:17] [INFO ] Implicit Places using invariants in 128 ms returned []
[2024-06-01 07:24:17] [INFO ] Invariant cache hit.
[2024-06-01 07:24:17] [INFO ] Implicit Places using invariants and state equation in 212 ms returned []
Implicit Place search using SMT with State Equation took 343 ms to find 0 implicit places.
Running 208 sub problems to find dead transitions.
[2024-06-01 07:24:17] [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 12487 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 19122ms problems are : Problem set: 0 solved, 208 unsolved
Search for dead transitions found 0 dead transitions in 19124ms
Finished structural reductions in LTL mode , in 1 iterations and 19470 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 739 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 122 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 1020 steps (0 resets) in 29 ms. (34 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 1127 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 115 ms :[(OR p1 (AND p0 (NOT p2))), (OR p1 (AND p0 (NOT p2))), p1]
Stuttering acceptance computed with spot in 115 ms :[(OR p1 (AND p0 (NOT p2))), (OR p1 (AND p0 (NOT p2))), p1]
[2024-06-01 07:24:38] [INFO ] Invariant cache hit.
[2024-06-01 07:24:38] [INFO ] [Real]Absence check using 96 positive place invariants in 27 ms returned sat
[2024-06-01 07:24:38] [INFO ] [Real]Absence check using 96 positive and 1 generalized place invariants in 14 ms returned sat
[2024-06-01 07:24:38] [INFO ] [Real]Absence check using state equation in 164 ms returned sat
[2024-06-01 07:24:39] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 07:24:39] [INFO ] [Nat]Absence check using 96 positive place invariants in 26 ms returned sat
[2024-06-01 07:24:39] [INFO ] [Nat]Absence check using 96 positive and 1 generalized place invariants in 5 ms returned sat
[2024-06-01 07:24:39] [INFO ] [Nat]Absence check using state equation in 200 ms returned sat
[2024-06-01 07:24:39] [INFO ] Computed and/alt/rep : 208/208/208 causal constraints (skipped 0 transitions) in 17 ms.
[2024-06-01 07:24:39] [INFO ] Added : 75 causal constraints over 15 iterations in 340 ms. Result :sat
Could not prove EG p1
Stuttering acceptance computed with spot in 115 ms :[(OR p1 (AND p0 (NOT p2))), (OR p1 (AND p0 (NOT p2))), p1]
Product exploration explored 100000 steps with 1104 reset in 1072 ms.
Product exploration explored 100000 steps with 1090 reset in 1147 ms.
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 5 ms. Remains 240 /240 variables (removed 0) and now considering 272/272 (removed 0) transitions.
[2024-06-01 07:24:42] [INFO ] Invariant cache hit.
[2024-06-01 07:24:42] [INFO ] Implicit Places using invariants in 179 ms returned []
[2024-06-01 07:24:42] [INFO ] Invariant cache hit.
[2024-06-01 07:24:42] [INFO ] Implicit Places using invariants and state equation in 223 ms returned []
Implicit Place search using SMT with State Equation took 427 ms to find 0 implicit places.
Running 208 sub problems to find dead transitions.
[2024-06-01 07:24:42] [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 6511 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 12351 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 18938ms problems are : Problem set: 0 solved, 208 unsolved
Search for dead transitions found 0 dead transitions in 18940ms
Finished structural reductions in LTL mode , in 1 iterations and 19383 ms. Remains : 240/240 places, 272/272 transitions.
Treatment of property SquareGrid-PT-040204-LTLFireability-10 finished in 69604 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 1 ms. Remains 240 /240 variables (removed 0) and now considering 272/272 (removed 0) transitions.
[2024-06-01 07:25:01] [INFO ] Invariant cache hit.
[2024-06-01 07:25:01] [INFO ] Implicit Places using invariants in 195 ms returned []
[2024-06-01 07:25:01] [INFO ] Invariant cache hit.
[2024-06-01 07:25:02] [INFO ] Implicit Places using invariants and state equation in 212 ms returned []
Implicit Place search using SMT with State Equation took 410 ms to find 0 implicit places.
Running 208 sub problems to find dead transitions.
[2024-06-01 07:25:02] [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 6469 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 12503 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 19025ms problems are : Problem set: 0 solved, 208 unsolved
Search for dead transitions found 0 dead transitions in 19027ms
Finished structural reductions in LTL mode , in 1 iterations and 19440 ms. Remains : 240/240 places, 272/272 transitions.
Stuttering acceptance computed with spot in 171 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 1419 reset in 1020 ms.
Product exploration explored 100000 steps with 1395 reset in 1079 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 265 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 129 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 806 steps (0 resets) in 13 ms. (57 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 322 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 129 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 128 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
[2024-06-01 07:25:24] [INFO ] Invariant cache hit.
[2024-06-01 07:25:24] [INFO ] [Real]Absence check using 96 positive place invariants in 27 ms returned sat
[2024-06-01 07:25:24] [INFO ] [Real]Absence check using 96 positive and 1 generalized place invariants in 19 ms returned sat
[2024-06-01 07:25:24] [INFO ] [Real]Absence check using state equation in 244 ms returned sat
[2024-06-01 07:25:24] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 07:25:24] [INFO ] [Nat]Absence check using 96 positive place invariants in 20 ms returned sat
[2024-06-01 07:25:24] [INFO ] [Nat]Absence check using 96 positive and 1 generalized place invariants in 15 ms returned sat
[2024-06-01 07:25:25] [INFO ] [Nat]Absence check using state equation in 171 ms returned sat
[2024-06-01 07:25:25] [INFO ] Computed and/alt/rep : 208/208/208 causal constraints (skipped 0 transitions) in 18 ms.
[2024-06-01 07:25:25] [INFO ] Added : 76 causal constraints over 16 iterations in 285 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 4 ms. Remains 240 /240 variables (removed 0) and now considering 272/272 (removed 0) transitions.
[2024-06-01 07:25:25] [INFO ] Invariant cache hit.
[2024-06-01 07:25:25] [INFO ] Implicit Places using invariants in 189 ms returned []
[2024-06-01 07:25:25] [INFO ] Invariant cache hit.
[2024-06-01 07:25:25] [INFO ] Implicit Places using invariants and state equation in 201 ms returned []
Implicit Place search using SMT with State Equation took 410 ms to find 0 implicit places.
Running 208 sub problems to find dead transitions.
[2024-06-01 07:25:25] [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 6673 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 12232 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 18967ms problems are : Problem set: 0 solved, 208 unsolved
Search for dead transitions found 0 dead transitions in 18969ms
Finished structural reductions in LTL mode , in 1 iterations and 19385 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 311 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 151 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 550 steps (0 resets) in 11 ms. (45 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 377 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 140 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 148 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
[2024-06-01 07:25:46] [INFO ] Invariant cache hit.
[2024-06-01 07:25:46] [INFO ] [Real]Absence check using 96 positive place invariants in 26 ms returned sat
[2024-06-01 07:25:46] [INFO ] [Real]Absence check using 96 positive and 1 generalized place invariants in 17 ms returned sat
[2024-06-01 07:25:46] [INFO ] [Real]Absence check using state equation in 231 ms returned sat
[2024-06-01 07:25:46] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 07:25:46] [INFO ] [Nat]Absence check using 96 positive place invariants in 21 ms returned sat
[2024-06-01 07:25:46] [INFO ] [Nat]Absence check using 96 positive and 1 generalized place invariants in 15 ms returned sat
[2024-06-01 07:25:46] [INFO ] [Nat]Absence check using state equation in 181 ms returned sat
[2024-06-01 07:25:46] [INFO ] Computed and/alt/rep : 208/208/208 causal constraints (skipped 0 transitions) in 15 ms.
[2024-06-01 07:25:47] [INFO ] Added : 76 causal constraints over 16 iterations in 296 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 177 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 1360 reset in 1044 ms.
Product exploration explored 100000 steps with 1367 reset in 1062 ms.
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-06-01 07:25:49] [INFO ] Invariant cache hit.
[2024-06-01 07:25:49] [INFO ] Implicit Places using invariants in 147 ms returned []
[2024-06-01 07:25:49] [INFO ] Invariant cache hit.
[2024-06-01 07:25:49] [INFO ] Implicit Places using invariants and state equation in 215 ms returned []
Implicit Place search using SMT with State Equation took 362 ms to find 0 implicit places.
Running 208 sub problems to find dead transitions.
[2024-06-01 07:25:49] [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 6459 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 12338 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 18850ms problems are : Problem set: 0 solved, 208 unsolved
Search for dead transitions found 0 dead transitions in 18852ms
Finished structural reductions in LTL mode , in 1 iterations and 19220 ms. Remains : 240/240 places, 272/272 transitions.
Treatment of property SquareGrid-PT-040204-LTLFireability-12 finished in 67042 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 1 ms. Remains 240 /240 variables (removed 0) and now considering 272/272 (removed 0) transitions.
[2024-06-01 07:26:08] [INFO ] Invariant cache hit.
[2024-06-01 07:26:08] [INFO ] Implicit Places using invariants in 146 ms returned []
[2024-06-01 07:26:08] [INFO ] Invariant cache hit.
[2024-06-01 07:26:09] [INFO ] Implicit Places using invariants and state equation in 224 ms returned []
Implicit Place search using SMT with State Equation took 392 ms to find 0 implicit places.
Running 208 sub problems to find dead transitions.
[2024-06-01 07:26: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 6679 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 12404 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 19147ms problems are : Problem set: 0 solved, 208 unsolved
Search for dead transitions found 0 dead transitions in 19149ms
Finished structural reductions in LTL mode , in 1 iterations and 19543 ms. Remains : 240/240 places, 272/272 transitions.
Stuttering acceptance computed with spot in 281 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 13 steps with 0 reset in 0 ms.
FORMULA SquareGrid-PT-040204-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SquareGrid-PT-040204-LTLFireability-13 finished in 19845 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 6 ms. Remains 240 /240 variables (removed 0) and now considering 272/272 (removed 0) transitions.
[2024-06-01 07:26:28] [INFO ] Invariant cache hit.
[2024-06-01 07:26:28] [INFO ] Implicit Places using invariants in 152 ms returned []
[2024-06-01 07:26:28] [INFO ] Invariant cache hit.
[2024-06-01 07:26:28] [INFO ] Implicit Places using invariants and state equation in 197 ms returned []
Implicit Place search using SMT with State Equation took 371 ms to find 0 implicit places.
[2024-06-01 07:26:28] [INFO ] Redundant transitions in 1 ms returned []
Running 208 sub problems to find dead transitions.
[2024-06-01 07:26:28] [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 6395 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 12265 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 18740ms problems are : Problem set: 0 solved, 208 unsolved
Search for dead transitions found 0 dead transitions in 18742ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 19129 ms. Remains : 240/240 places, 272/272 transitions.
Stuttering acceptance computed with spot in 125 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 1221 reset in 989 ms.
Product exploration explored 100000 steps with 1198 reset in 1076 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 971 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 60 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 390 steps (0 resets) in 9 ms. (39 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 1065 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 52 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 76 ms :[(NOT p1), (NOT p1)]
[2024-06-01 07:26:52] [INFO ] Invariant cache hit.
[2024-06-01 07:26:52] [INFO ] [Real]Absence check using 96 positive place invariants in 27 ms returned sat
[2024-06-01 07:26:52] [INFO ] [Real]Absence check using 96 positive and 1 generalized place invariants in 7 ms returned sat
[2024-06-01 07:26:52] [INFO ] [Real]Absence check using state equation in 148 ms returned sat
[2024-06-01 07:26:52] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 07:26:52] [INFO ] [Nat]Absence check using 96 positive place invariants in 46 ms returned sat
[2024-06-01 07:26:52] [INFO ] [Nat]Absence check using 96 positive and 1 generalized place invariants in 5 ms returned sat
[2024-06-01 07:26:52] [INFO ] [Nat]Absence check using state equation in 164 ms returned sat
[2024-06-01 07:26:52] [INFO ] Computed and/alt/rep : 208/208/208 causal constraints (skipped 0 transitions) in 26 ms.
[2024-06-01 07:26:53] [INFO ] Added : 75 causal constraints over 15 iterations in 269 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 5 ms. Remains 240 /240 variables (removed 0) and now considering 272/272 (removed 0) transitions.
[2024-06-01 07:26:53] [INFO ] Invariant cache hit.
[2024-06-01 07:26:53] [INFO ] Implicit Places using invariants in 205 ms returned []
[2024-06-01 07:26:53] [INFO ] Invariant cache hit.
[2024-06-01 07:26:53] [INFO ] Implicit Places using invariants and state equation in 193 ms returned []
Implicit Place search using SMT with State Equation took 408 ms to find 0 implicit places.
[2024-06-01 07:26:53] [INFO ] Redundant transitions in 0 ms returned []
Running 208 sub problems to find dead transitions.
[2024-06-01 07:26: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 6488 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 12410 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 18978ms problems are : Problem set: 0 solved, 208 unsolved
Search for dead transitions found 0 dead transitions in 18981ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 19406 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 217 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 p1), (NOT p1)]
RANDOM walk for 482 steps (0 resets) in 14 ms. (32 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 173 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 p1), (NOT p1)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p1), (NOT p1)]
[2024-06-01 07:27:13] [INFO ] Invariant cache hit.
[2024-06-01 07:27:13] [INFO ] [Real]Absence check using 96 positive place invariants in 27 ms returned sat
[2024-06-01 07:27:13] [INFO ] [Real]Absence check using 96 positive and 1 generalized place invariants in 7 ms returned sat
[2024-06-01 07:27:13] [INFO ] [Real]Absence check using state equation in 141 ms returned sat
[2024-06-01 07:27:13] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 07:27:13] [INFO ] [Nat]Absence check using 96 positive place invariants in 45 ms returned sat
[2024-06-01 07:27:13] [INFO ] [Nat]Absence check using 96 positive and 1 generalized place invariants in 2 ms returned sat
[2024-06-01 07:27:13] [INFO ] [Nat]Absence check using state equation in 160 ms returned sat
[2024-06-01 07:27:13] [INFO ] Computed and/alt/rep : 208/208/208 causal constraints (skipped 0 transitions) in 14 ms.
[2024-06-01 07:27:14] [INFO ] Added : 75 causal constraints over 15 iterations in 348 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 51 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 1168 reset in 980 ms.
Product exploration explored 100000 steps with 1210 reset in 1043 ms.
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 5 ms. Remains 240 /240 variables (removed 0) and now considering 272/272 (removed 0) transitions.
[2024-06-01 07:27:16] [INFO ] Invariant cache hit.
[2024-06-01 07:27:16] [INFO ] Implicit Places using invariants in 151 ms returned []
[2024-06-01 07:27:16] [INFO ] Invariant cache hit.
[2024-06-01 07:27:16] [INFO ] Implicit Places using invariants and state equation in 194 ms returned []
Implicit Place search using SMT with State Equation took 373 ms to find 0 implicit places.
[2024-06-01 07:27:16] [INFO ] Redundant transitions in 1 ms returned []
Running 208 sub problems to find dead transitions.
[2024-06-01 07:27: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 6355 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 12507 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 18945ms problems are : Problem set: 0 solved, 208 unsolved
Search for dead transitions found 0 dead transitions in 18947ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 19337 ms. Remains : 240/240 places, 272/272 transitions.
Treatment of property SquareGrid-PT-040204-LTLFireability-14 finished in 66961 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)))'
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)))'
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))))))'
Found a Shortening insensitive property : SquareGrid-PT-040204-LTLFireability-10
Stuttering acceptance computed with spot in 105 ms :[(OR p1 (AND p0 (NOT p2))), (OR p1 (AND p0 (NOT p2))), p1]
Support contains 8 out of 240 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 240/240 places, 272/272 transitions.
Applied a total of 0 rules in 3 ms. Remains 240 /240 variables (removed 0) and now considering 272/272 (removed 0) transitions.
[2024-06-01 07:27:35] [INFO ] Invariant cache hit.
[2024-06-01 07:27:36] [INFO ] Implicit Places using invariants in 212 ms returned []
[2024-06-01 07:27:36] [INFO ] Invariant cache hit.
[2024-06-01 07:27:36] [INFO ] Implicit Places using invariants and state equation in 195 ms returned []
Implicit Place search using SMT with State Equation took 419 ms to find 0 implicit places.
Running 208 sub problems to find dead transitions.
[2024-06-01 07:27:36] [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 6404 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 12184 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 18666ms problems are : Problem set: 0 solved, 208 unsolved
Search for dead transitions found 0 dead transitions in 18668ms
Finished structural reductions in LI_LTL mode , in 1 iterations and 19092 ms. Remains : 240/240 places, 272/272 transitions.
Running random walk in product with property : SquareGrid-PT-040204-LTLFireability-10
Product exploration explored 100000 steps with 1047 reset in 1066 ms.
Product exploration explored 100000 steps with 1067 reset in 1135 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 680 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 114 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 1011 steps (0 resets) in 16 ms. (59 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 912 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 107 ms :[(OR p1 (AND p0 (NOT p2))), (OR p1 (AND p0 (NOT p2))), p1]
Stuttering acceptance computed with spot in 112 ms :[(OR p1 (AND p0 (NOT p2))), (OR p1 (AND p0 (NOT p2))), p1]
[2024-06-01 07:27:59] [INFO ] Invariant cache hit.
[2024-06-01 07:27:59] [INFO ] [Real]Absence check using 96 positive place invariants in 26 ms returned sat
[2024-06-01 07:27:59] [INFO ] [Real]Absence check using 96 positive and 1 generalized place invariants in 8 ms returned sat
[2024-06-01 07:27:59] [INFO ] [Real]Absence check using state equation in 165 ms returned sat
[2024-06-01 07:27:59] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 07:27:59] [INFO ] [Nat]Absence check using 96 positive place invariants in 26 ms returned sat
[2024-06-01 07:27:59] [INFO ] [Nat]Absence check using 96 positive and 1 generalized place invariants in 5 ms returned sat
[2024-06-01 07:27:59] [INFO ] [Nat]Absence check using state equation in 162 ms returned sat
[2024-06-01 07:27:59] [INFO ] Computed and/alt/rep : 208/208/208 causal constraints (skipped 0 transitions) in 19 ms.
[2024-06-01 07:28:00] [INFO ] Added : 75 causal constraints over 15 iterations in 287 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-06-01 07:28:00] [INFO ] Invariant cache hit.
[2024-06-01 07:28:00] [INFO ] Implicit Places using invariants in 132 ms returned []
[2024-06-01 07:28:00] [INFO ] Invariant cache hit.
[2024-06-01 07:28:00] [INFO ] Implicit Places using invariants and state equation in 200 ms returned []
Implicit Place search using SMT with State Equation took 376 ms to find 0 implicit places.
Running 208 sub problems to find dead transitions.
[2024-06-01 07:28:00] [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 6514 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 12170 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 18742ms problems are : Problem set: 0 solved, 208 unsolved
Search for dead transitions found 0 dead transitions in 18744ms
Finished structural reductions in LTL mode , in 1 iterations and 19123 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 653 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 110 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 606 steps (0 resets) in 11 ms. (50 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 872 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 105 ms :[(OR p1 (AND p0 (NOT p2))), (OR p1 (AND p0 (NOT p2))), p1]
Stuttering acceptance computed with spot in 114 ms :[(OR p1 (AND p0 (NOT p2))), (OR p1 (AND p0 (NOT p2))), p1]
[2024-06-01 07:28:21] [INFO ] Invariant cache hit.
[2024-06-01 07:28:21] [INFO ] [Real]Absence check using 96 positive place invariants in 27 ms returned sat
[2024-06-01 07:28:21] [INFO ] [Real]Absence check using 96 positive and 1 generalized place invariants in 8 ms returned sat
[2024-06-01 07:28:21] [INFO ] [Real]Absence check using state equation in 166 ms returned sat
[2024-06-01 07:28:21] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 07:28:21] [INFO ] [Nat]Absence check using 96 positive place invariants in 25 ms returned sat
[2024-06-01 07:28:21] [INFO ] [Nat]Absence check using 96 positive and 1 generalized place invariants in 5 ms returned sat
[2024-06-01 07:28:21] [INFO ] [Nat]Absence check using state equation in 172 ms returned sat
[2024-06-01 07:28:21] [INFO ] Computed and/alt/rep : 208/208/208 causal constraints (skipped 0 transitions) in 17 ms.
[2024-06-01 07:28:22] [INFO ] Added : 75 causal constraints over 15 iterations in 279 ms. Result :sat
Could not prove EG p1
Stuttering acceptance computed with spot in 218 ms :[(OR p1 (AND p0 (NOT p2))), (OR p1 (AND p0 (NOT p2))), p1]
Product exploration explored 100000 steps with 1049 reset in 1039 ms.
Product exploration explored 100000 steps with 1092 reset in 1115 ms.
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 1 ms. Remains 240 /240 variables (removed 0) and now considering 272/272 (removed 0) transitions.
[2024-06-01 07:28:24] [INFO ] Invariant cache hit.
[2024-06-01 07:28:24] [INFO ] Implicit Places using invariants in 136 ms returned []
[2024-06-01 07:28:24] [INFO ] Invariant cache hit.
[2024-06-01 07:28:24] [INFO ] Implicit Places using invariants and state equation in 227 ms returned []
Implicit Place search using SMT with State Equation took 382 ms to find 0 implicit places.
Running 208 sub problems to find dead transitions.
[2024-06-01 07:28: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 6354 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 12143 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 18559ms problems are : Problem set: 0 solved, 208 unsolved
Search for dead transitions found 0 dead transitions in 18561ms
Finished structural reductions in LTL mode , in 1 iterations and 18947 ms. Remains : 240/240 places, 272/272 transitions.
Treatment of property SquareGrid-PT-040204-LTLFireability-10 finished in 67830 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)))))'
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)))))'
[2024-06-01 07:28:43] [INFO ] Flatten gal took : 21 ms
[2024-06-01 07:28:43] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-06-01 07:28:43] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 240 places, 272 transitions and 1088 arcs took 4 ms.
Total runtime 518542 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA SquareGrid-PT-040204-LTLFireability-01 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA SquareGrid-PT-040204-LTLFireability-09 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA SquareGrid-PT-040204-LTLFireability-10 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA SquareGrid-PT-040204-LTLFireability-12 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA SquareGrid-PT-040204-LTLFireability-14 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717226927131

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2024
ltl formula name SquareGrid-PT-040204-LTLFireability-01
ltl formula formula --ltl=/tmp/2653/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 240 places, 272 transitions and 1088 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2653/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2653/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.040 real 0.010 user 0.010 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2653/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2653/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 242 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 241, there are 277 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 2/ 4): Accepting cycle FOUND at depth ~57!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 76
pnml2lts-mc( 0/ 4): unique states count: 315
pnml2lts-mc( 0/ 4): unique transitions count: 17846
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 2
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 318
pnml2lts-mc( 0/ 4): - cum. max stack depth: 242
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 318 states 18234 transitions, fanout: 57.340
pnml2lts-mc( 0/ 4): Total exploration time 0.180 sec (0.180 sec minimum, 0.180 sec on average)
pnml2lts-mc( 0/ 4): States per second: 1767, Transitions per second: 101300
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.7MB, 43.2 B/state, compr.: 4.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 275 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.7MB (~256.0MB paged-in)
ltl formula name SquareGrid-PT-040204-LTLFireability-09
ltl formula formula --ltl=/tmp/2653/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 240 places, 272 transitions and 1088 arcs
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.050 real 0.010 user 0.010 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2653/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2653/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2653/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2653/ltl_1_
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 242 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 241, there are 277 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 1/ 4): Accepting cycle FOUND at depth ~105!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 407
pnml2lts-mc( 0/ 4): unique transitions count: 28601
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 2
pnml2lts-mc( 0/ 4): - claim success count: 410
pnml2lts-mc( 0/ 4): - cum. max stack depth: 410
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 410 states 28797 transitions, fanout: 70.237
pnml2lts-mc( 0/ 4): Total exploration time 0.240 sec (0.230 sec minimum, 0.235 sec on average)
pnml2lts-mc( 0/ 4): States per second: 1708, Transitions per second: 119988
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 1.1MB, 41.1 B/state, compr.: 4.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/1.0%
pnml2lts-mc( 0/ 4): Stored 275 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 1.1MB (~256.0MB paged-in)
ltl formula name SquareGrid-PT-040204-LTLFireability-10
ltl formula formula --ltl=/tmp/2653/ltl_2_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 240 places, 272 transitions and 1088 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.060 real 0.010 user 0.000 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2653/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2653/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2653/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2653/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): There are 241 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 241, there are 301 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4): ~542 levels ~10000 states ~199728 transitions
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 2/ 4): Accepting cycle FOUND at depth ~601!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 6889
pnml2lts-mc( 0/ 4): unique states count: 9407
pnml2lts-mc( 0/ 4): unique transitions count: 270884
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 1965
pnml2lts-mc( 0/ 4): - claim found count: 644
pnml2lts-mc( 0/ 4): - claim success count: 9410
pnml2lts-mc( 0/ 4): - cum. max stack depth: 2521
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 9410 states 271080 transitions, fanout: 28.808
pnml2lts-mc( 0/ 4): Total exploration time 0.990 sec (0.970 sec minimum, 0.985 sec on average)
pnml2lts-mc( 0/ 4): States per second: 9505, Transitions per second: 273818
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 5.0MB, 28.3 B/state, compr.: 2.9%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/5.0%
pnml2lts-mc( 0/ 4): Stored 275 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 5.0MB (~256.0MB paged-in)
ltl formula name SquareGrid-PT-040204-LTLFireability-12
ltl formula formula --ltl=/tmp/2653/ltl_3_
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 240 places, 272 transitions and 1088 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2653/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2653/ltl_3_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.050 real 0.000 user 0.010 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2653/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2653/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): There are 241 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 241, there are 305 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 2/ 4): Accepting cycle FOUND at depth ~124!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 32
pnml2lts-mc( 0/ 4): unique states count: 540
pnml2lts-mc( 0/ 4): unique transitions count: 65178
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 543
pnml2lts-mc( 0/ 4): - cum. max stack depth: 511
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 543 states 65566 transitions, fanout: 120.748
pnml2lts-mc( 0/ 4): Total exploration time 0.360 sec (0.360 sec minimum, 0.360 sec on average)
pnml2lts-mc( 0/ 4): States per second: 1508, Transitions per second: 182128
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 1.8MB, 31.5 B/state, compr.: 3.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/2.0%
pnml2lts-mc( 0/ 4): Stored 275 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 1.8MB (~256.0MB paged-in)
ltl formula name SquareGrid-PT-040204-LTLFireability-14
ltl formula formula --ltl=/tmp/2653/ltl_4_
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 240 places, 272 transitions and 1088 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.040 real 0.000 user 0.010 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2653/ltl_4_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2653/ltl_4_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2653/ltl_4_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2653/ltl_4_
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 242 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 241, there are 304 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~189!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 141
pnml2lts-mc( 0/ 4): unique states count: 1022
pnml2lts-mc( 0/ 4): unique transitions count: 48832
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 1025
pnml2lts-mc( 0/ 4): - cum. max stack depth: 884
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 1025 states 49028 transitions, fanout: 47.832
pnml2lts-mc( 0/ 4): Total exploration time 0.320 sec (0.300 sec minimum, 0.315 sec on average)
pnml2lts-mc( 0/ 4): States per second: 3203, Transitions per second: 153212
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 1.9MB, 39.8 B/state, compr.: 4.1%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/2.0%
pnml2lts-mc( 0/ 4): Stored 275 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 1.9MB (~256.0MB paged-in)

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="ltsminxred"
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 ltsminxred"
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 r536-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 ;