About the Execution of ITS-Tools for Solitaire-PT-SqrNC5x5
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 3601.939 | 1148120.00 | 3342472.00 | 1597.10 | TFFTFTFTFFTFTFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r400-tall-171690531500044.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is Solitaire-PT-SqrNC5x5, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r400-tall-171690531500044
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 572K
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K 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.8K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K 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 13K Apr 12 14:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 143K Apr 12 14:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K Apr 12 14:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K Apr 12 14:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:58 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K 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 9 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 69K 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 Solitaire-PT-SqrNC5x5-LTLFireability-00
FORMULA_NAME Solitaire-PT-SqrNC5x5-LTLFireability-01
FORMULA_NAME Solitaire-PT-SqrNC5x5-LTLFireability-02
FORMULA_NAME Solitaire-PT-SqrNC5x5-LTLFireability-03
FORMULA_NAME Solitaire-PT-SqrNC5x5-LTLFireability-04
FORMULA_NAME Solitaire-PT-SqrNC5x5-LTLFireability-05
FORMULA_NAME Solitaire-PT-SqrNC5x5-LTLFireability-06
FORMULA_NAME Solitaire-PT-SqrNC5x5-LTLFireability-07
FORMULA_NAME Solitaire-PT-SqrNC5x5-LTLFireability-08
FORMULA_NAME Solitaire-PT-SqrNC5x5-LTLFireability-09
FORMULA_NAME Solitaire-PT-SqrNC5x5-LTLFireability-10
FORMULA_NAME Solitaire-PT-SqrNC5x5-LTLFireability-11
FORMULA_NAME Solitaire-PT-SqrNC5x5-LTLFireability-12
FORMULA_NAME Solitaire-PT-SqrNC5x5-LTLFireability-13
FORMULA_NAME Solitaire-PT-SqrNC5x5-LTLFireability-14
FORMULA_NAME Solitaire-PT-SqrNC5x5-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1716972740190
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Solitaire-PT-SqrNC5x5
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-29 08:52:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-29 08:52:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 08:52:21] [INFO ] Load time of PNML (sax parser for PT used): 75 ms
[2024-05-29 08:52:21] [INFO ] Transformed 50 places.
[2024-05-29 08:52:21] [INFO ] Transformed 84 transitions.
[2024-05-29 08:52:21] [INFO ] Found NUPN structural information;
[2024-05-29 08:52:21] [INFO ] Parsed PT model containing 50 places and 84 transitions and 456 arcs in 168 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 3 formulas.
FORMULA Solitaire-PT-SqrNC5x5-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Solitaire-PT-SqrNC5x5-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Solitaire-PT-SqrNC5x5-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 42 out of 50 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 50/50 places, 84/84 transitions.
Applied a total of 0 rules in 9 ms. Remains 50 /50 variables (removed 0) and now considering 84/84 (removed 0) transitions.
// Phase 1: matrix 84 rows 50 cols
[2024-05-29 08:52:21] [INFO ] Computed 25 invariants in 15 ms
[2024-05-29 08:52:21] [INFO ] Implicit Places using invariants in 172 ms returned []
[2024-05-29 08:52:21] [INFO ] Invariant cache hit.
[2024-05-29 08:52:21] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 285 ms to find 0 implicit places.
Running 72 sub problems to find dead transitions.
[2024-05-29 08:52:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 25/75 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (OVERLAPS) 84/134 variables, 50/125 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (OVERLAPS) 0/134 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Real declared 134/134 variables, and 125 constraints, problems are : Problem set: 0 solved, 72 unsolved in 928 ms.
Refiners :[Domain max(s): 50/50 constraints, Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 50/50 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 72 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 25/75 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (OVERLAPS) 84/134 variables, 50/125 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 72/197 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (OVERLAPS) 0/134 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Int declared 134/134 variables, and 197 constraints, problems are : Problem set: 0 solved, 72 unsolved in 3030 ms.
Refiners :[Domain max(s): 50/50 constraints, Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 50/50 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 0/0 constraints]
After SMT, in 4040ms problems are : Problem set: 0 solved, 72 unsolved
Search for dead transitions found 0 dead transitions in 4054ms
Finished structural reductions in LTL mode , in 1 iterations and 4367 ms. Remains : 50/50 places, 84/84 transitions.
Support contains 42 out of 50 places after structural reductions.
[2024-05-29 08:52:26] [INFO ] Flatten gal took : 31 ms
[2024-05-29 08:52:26] [INFO ] Flatten gal took : 13 ms
[2024-05-29 08:52:26] [INFO ] Input system was already deterministic with 84 transitions.
Reduction of identical properties reduced properties to check from 31 to 29
RANDOM walk for 1021 steps (45 resets) in 94 ms. (10 steps per ms) remains 0/29 properties
FORMULA Solitaire-PT-SqrNC5x5-LTLFireability-04 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' '!(F(((p0 U G(p1))||G(F((p2&&X(p3)))))))'
Support contains 8 out of 50 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 50/50 places, 84/84 transitions.
Applied a total of 0 rules in 1 ms. Remains 50 /50 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2024-05-29 08:52:26] [INFO ] Invariant cache hit.
[2024-05-29 08:52:26] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-29 08:52:26] [INFO ] Invariant cache hit.
[2024-05-29 08:52:26] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 127 ms to find 0 implicit places.
Running 72 sub problems to find dead transitions.
[2024-05-29 08:52:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 25/75 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (OVERLAPS) 84/134 variables, 50/125 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (OVERLAPS) 0/134 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Real declared 134/134 variables, and 125 constraints, problems are : Problem set: 0 solved, 72 unsolved in 690 ms.
Refiners :[Domain max(s): 50/50 constraints, Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 50/50 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 72 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 25/75 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (OVERLAPS) 84/134 variables, 50/125 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 72/197 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (OVERLAPS) 0/134 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Int declared 134/134 variables, and 197 constraints, problems are : Problem set: 0 solved, 72 unsolved in 2795 ms.
Refiners :[Domain max(s): 50/50 constraints, Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 50/50 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 0/0 constraints]
After SMT, in 3517ms problems are : Problem set: 0 solved, 72 unsolved
Search for dead transitions found 0 dead transitions in 3519ms
Finished structural reductions in LTL mode , in 1 iterations and 3648 ms. Remains : 50/50 places, 84/84 transitions.
Stuttering acceptance computed with spot in 262 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : Solitaire-PT-SqrNC5x5-LTLFireability-00
Product exploration explored 100000 steps with 26448 reset in 379 ms.
Product exploration explored 100000 steps with 26708 reset in 311 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) p2 p3), (X p2), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p1 p2))), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (X (NOT (AND p1 (NOT p2) (NOT p3)))), (X (NOT (AND p1 p2 (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND p1 p2 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(X p3), (X (NOT p3)), (X (AND (NOT p1) p2 (NOT p3))), (X (NOT (AND (NOT p1) p2 (NOT p3)))), (X (X p2)), (X (X (NOT p2))), (X (X p3)), (X (X (NOT p3))), (X (X (AND (NOT p1) p2 (NOT p3)))), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND p1 p2))), (X (X (NOT (AND p1 p2)))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 14 factoid took 718 ms. Reduced automaton from 3 states, 11 edges and 3 AP (stutter sensitive) to 3 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 109 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3))]
RANDOM walk for 40000 steps (1808 resets) in 564 ms. (70 steps per ms) remains 2/11 properties
BEST_FIRST walk for 40002 steps (154 resets) in 208 ms. (191 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (154 resets) in 106 ms. (373 steps per ms) remains 2/2 properties
[2024-05-29 08:52:32] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 8/16 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 8/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 60/76 variables, 16/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/76 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 58/134 variables, 34/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/134 variables, 34/108 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/134 variables, 17/125 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/134 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/134 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 134/134 variables, and 125 constraints, problems are : Problem set: 0 solved, 2 unsolved in 66 ms.
Refiners :[Domain max(s): 50/50 constraints, Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 50/50 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Problem apf6 is UNSAT
Problem apf9 is UNSAT
After SMT solving in domain Int declared 8/134 variables, and 8 constraints, problems are : Problem set: 2 solved, 0 unsolved in 16 ms.
Refiners :[Domain max(s): 8/50 constraints, Positive P Invariants (semi-flows): 0/25 constraints, State Equation: 0/50 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 88ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p2 p3), (X p2), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p1 p2))), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (X (NOT (AND p1 (NOT p2) (NOT p3)))), (X (NOT (AND p1 p2 (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND p1 p2 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (G (OR p1 p2 p3)), (G (OR p1 p2))]
False Knowledge obtained : [(X p3), (X (NOT p3)), (X (AND (NOT p1) p2 (NOT p3))), (X (NOT (AND (NOT p1) p2 (NOT p3)))), (X (X p2)), (X (X (NOT p2))), (X (X p3)), (X (X (NOT p3))), (X (X (AND (NOT p1) p2 (NOT p3)))), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND p1 p2))), (X (X (NOT (AND p1 p2)))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR (NOT p1) (NOT p2)))), (F (NOT (OR (NOT p1) p2))), (F (NOT (AND (NOT p1) p2))), (F (NOT p2)), (F (NOT (OR p1 (NOT p2) p3))), (F (NOT p3)), (F (NOT (OR (NOT p1) (NOT p2) p3))), (F p1), (F (NOT (OR (NOT p1) p2 p3)))]
Knowledge based reduction with 16 factoid took 1029 ms. Reduced automaton from 3 states, 11 edges and 3 AP (stutter sensitive) to 3 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 127 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 136 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3))]
Support contains 8 out of 50 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 50/50 places, 84/84 transitions.
Applied a total of 0 rules in 2 ms. Remains 50 /50 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2024-05-29 08:52:33] [INFO ] Invariant cache hit.
[2024-05-29 08:52:33] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-29 08:52:33] [INFO ] Invariant cache hit.
[2024-05-29 08:52:34] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 128 ms to find 0 implicit places.
Running 72 sub problems to find dead transitions.
[2024-05-29 08:52:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 25/75 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (OVERLAPS) 84/134 variables, 50/125 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (OVERLAPS) 0/134 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Real declared 134/134 variables, and 125 constraints, problems are : Problem set: 0 solved, 72 unsolved in 719 ms.
Refiners :[Domain max(s): 50/50 constraints, Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 50/50 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 72 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 25/75 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (OVERLAPS) 84/134 variables, 50/125 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 72/197 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (OVERLAPS) 0/134 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Int declared 134/134 variables, and 197 constraints, problems are : Problem set: 0 solved, 72 unsolved in 3011 ms.
Refiners :[Domain max(s): 50/50 constraints, Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 50/50 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 0/0 constraints]
After SMT, in 3763ms problems are : Problem set: 0 solved, 72 unsolved
Search for dead transitions found 0 dead transitions in 3764ms
Finished structural reductions in LTL mode , in 1 iterations and 3895 ms. Remains : 50/50 places, 84/84 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 p1) p2 p3), (X p2), (X (NOT (AND (NOT p2) (NOT p3)))), (X (NOT (AND p1 p2 (NOT p3)))), (X (NOT p1)), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND p1 p2 (NOT p3)))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p3))), (X (NOT (AND (NOT p1) (NOT p3)))), (X p3), (X (NOT p3)), (X (X (AND (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT p2))), (X (X p2)), (X (X p3)), (X (X (NOT p3))), (X (X (AND p1 p2))), (X (X (NOT (AND p1 p2)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 7 factoid took 640 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter sensitive) to 3 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 127 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3))]
RANDOM walk for 5951 steps (271 resets) in 33 ms. (175 steps per ms) remains 0/7 properties
Knowledge obtained : [(AND (NOT p1) p2 p3), (X p2), (X (NOT (AND (NOT p2) (NOT p3)))), (X (NOT (AND p1 p2 (NOT p3)))), (X (NOT p1)), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND p1 p2 (NOT p3)))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p3))), (X (NOT (AND (NOT p1) (NOT p3)))), (X p3), (X (NOT p3)), (X (X (AND (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT p2))), (X (X p2)), (X (X p3)), (X (X (NOT p3))), (X (X (AND p1 p2))), (X (X (NOT (AND p1 p2)))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR p3 p1))), (F (NOT (OR p3 p2))), (F p1), (F (NOT (OR (NOT p2) (NOT p1)))), (F (NOT p2)), (F (NOT (OR p3 (NOT p2) (NOT p1)))), (F (NOT p3))]
Knowledge based reduction with 7 factoid took 798 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter sensitive) to 3 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 141 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3))]
Product exploration explored 100000 steps with 26818 reset in 243 ms.
Product exploration explored 100000 steps with 26654 reset in 288 ms.
Built C files in :
/tmp/ltsmin6279974829456504376
[2024-05-29 08:52:40] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6279974829456504376
Running compilation step : cd /tmp/ltsmin6279974829456504376;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 332 ms.
Running link step : cd /tmp/ltsmin6279974829456504376;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin6279974829456504376;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased10426227397180076605.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 8 out of 50 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 50/50 places, 84/84 transitions.
Applied a total of 0 rules in 2 ms. Remains 50 /50 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2024-05-29 08:52:55] [INFO ] Invariant cache hit.
[2024-05-29 08:52:55] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-29 08:52:55] [INFO ] Invariant cache hit.
[2024-05-29 08:52:55] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
Running 72 sub problems to find dead transitions.
[2024-05-29 08:52:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 25/75 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (OVERLAPS) 84/134 variables, 50/125 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (OVERLAPS) 0/134 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Real declared 134/134 variables, and 125 constraints, problems are : Problem set: 0 solved, 72 unsolved in 667 ms.
Refiners :[Domain max(s): 50/50 constraints, Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 50/50 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 72 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 25/75 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (OVERLAPS) 84/134 variables, 50/125 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 72/197 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (OVERLAPS) 0/134 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Int declared 134/134 variables, and 197 constraints, problems are : Problem set: 0 solved, 72 unsolved in 2907 ms.
Refiners :[Domain max(s): 50/50 constraints, Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 50/50 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 0/0 constraints]
After SMT, in 3610ms problems are : Problem set: 0 solved, 72 unsolved
Search for dead transitions found 0 dead transitions in 3613ms
Finished structural reductions in LTL mode , in 1 iterations and 3749 ms. Remains : 50/50 places, 84/84 transitions.
Built C files in :
/tmp/ltsmin14208362473435103507
[2024-05-29 08:52:59] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14208362473435103507
Running compilation step : cd /tmp/ltsmin14208362473435103507;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 201 ms.
Running link step : cd /tmp/ltsmin14208362473435103507;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin14208362473435103507;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased16031293271382962773.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 08:53:14] [INFO ] Flatten gal took : 8 ms
[2024-05-29 08:53:14] [INFO ] Flatten gal took : 7 ms
[2024-05-29 08:53:14] [INFO ] Time to serialize gal into /tmp/LTL12138731730078796865.gal : 3 ms
[2024-05-29 08:53:14] [INFO ] Time to serialize properties into /tmp/LTL11961070451141671672.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12138731730078796865.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13108185503250741311.hoa' '-atoms' '/tmp/LTL11961070451141671672.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL11961070451141671672.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13108185503250741311.hoa
Detected timeout of ITS tools.
[2024-05-29 08:53:29] [INFO ] Flatten gal took : 7 ms
[2024-05-29 08:53:29] [INFO ] Flatten gal took : 7 ms
[2024-05-29 08:53:29] [INFO ] Time to serialize gal into /tmp/LTL17034239420381805588.gal : 2 ms
[2024-05-29 08:53:29] [INFO ] Time to serialize properties into /tmp/LTL9034558634296340846.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17034239420381805588.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9034558634296340846.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F((("((F53==1)&&(T63==1))")U(G("(((F44==1)&&(T45==1))&&(T46==1))")))||(G(F(("((((F44==0)||(T45==0))||((T46==0)||(T32==0)))||((T33==...206
Formula 0 simplified : G((!"((F53==1)&&(T63==1))" R F!"(((F44==1)&&(T45==1))&&(T46==1))") & FG(!"((((F44==0)||(T45==0))||((T46==0)||(T32==0)))||((T33==0)||...195
Detected timeout of ITS tools.
[2024-05-29 08:53:44] [INFO ] Flatten gal took : 6 ms
[2024-05-29 08:53:44] [INFO ] Applying decomposition
[2024-05-29 08:53:44] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph7379201244190310872.txt' '-o' '/tmp/graph7379201244190310872.bin' '-w' '/tmp/graph7379201244190310872.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7379201244190310872.bin' '-l' '-1' '-v' '-w' '/tmp/graph7379201244190310872.weights' '-q' '0' '-e' '0.001'
[2024-05-29 08:53:44] [INFO ] Decomposing Gal with order
[2024-05-29 08:53:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 08:53:44] [INFO ] Removed a total of 178 redundant transitions.
[2024-05-29 08:53:44] [INFO ] Flatten gal took : 38 ms
[2024-05-29 08:53:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 6 ms.
[2024-05-29 08:53:44] [INFO ] Time to serialize gal into /tmp/LTL10625130488651592804.gal : 2 ms
[2024-05-29 08:53:44] [INFO ] Time to serialize properties into /tmp/LTL7397729407571730801.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10625130488651592804.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7397729407571730801.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F((("((i1.u1.F53==1)&&(i1.u18.T63==1))")U(G("(((i0.u11.F44==1)&&(i5.u14.T45==1))&&(i5.u20.T46==1))")))||(G(F(("((((i0.u11.F44==0)||...295
Formula 0 simplified : G((!"((i1.u1.F53==1)&&(i1.u18.T63==1))" R F!"(((i0.u11.F44==1)&&(i5.u14.T45==1))&&(i5.u20.T46==1))") & FG(!"((((i0.u11.F44==0)||(i5....284
Detected timeout of ITS tools.
Treatment of property Solitaire-PT-SqrNC5x5-LTLFireability-00 finished in 93201 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||X((G(p1) U (!p0&&G(p1))))) U p2))'
Support contains 8 out of 50 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 50/50 places, 84/84 transitions.
Applied a total of 0 rules in 2 ms. Remains 50 /50 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2024-05-29 08:53:59] [INFO ] Invariant cache hit.
[2024-05-29 08:53:59] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-29 08:53:59] [INFO ] Invariant cache hit.
[2024-05-29 08:54:00] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
Running 72 sub problems to find dead transitions.
[2024-05-29 08:54:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 25/75 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (OVERLAPS) 84/134 variables, 50/125 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (OVERLAPS) 0/134 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Real declared 134/134 variables, and 125 constraints, problems are : Problem set: 0 solved, 72 unsolved in 690 ms.
Refiners :[Domain max(s): 50/50 constraints, Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 50/50 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 72 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 25/75 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (OVERLAPS) 84/134 variables, 50/125 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 72/197 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (OVERLAPS) 0/134 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Int declared 134/134 variables, and 197 constraints, problems are : Problem set: 0 solved, 72 unsolved in 2972 ms.
Refiners :[Domain max(s): 50/50 constraints, Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 50/50 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 0/0 constraints]
After SMT, in 3691ms problems are : Problem set: 0 solved, 72 unsolved
Search for dead transitions found 0 dead transitions in 3693ms
Finished structural reductions in LTL mode , in 1 iterations and 3821 ms. Remains : 50/50 places, 84/84 transitions.
Stuttering acceptance computed with spot in 179 ms :[(NOT p2), (OR (NOT p1) p0), true, (NOT p1)]
Running random walk in product with property : Solitaire-PT-SqrNC5x5-LTLFireability-01
Entered a terminal (fully accepting) state of product in 9 steps with 1 reset in 0 ms.
FORMULA Solitaire-PT-SqrNC5x5-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Solitaire-PT-SqrNC5x5-LTLFireability-01 finished in 4019 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(((X(p1)&&G(p2))||p0))))'
Support contains 8 out of 50 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 50/50 places, 84/84 transitions.
Applied a total of 0 rules in 13 ms. Remains 50 /50 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2024-05-29 08:54:03] [INFO ] Invariant cache hit.
[2024-05-29 08:54:04] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-29 08:54:04] [INFO ] Invariant cache hit.
[2024-05-29 08:54:04] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
[2024-05-29 08:54:04] [INFO ] Redundant transitions in 1 ms returned []
Running 72 sub problems to find dead transitions.
[2024-05-29 08:54:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 25/75 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (OVERLAPS) 84/134 variables, 50/125 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (OVERLAPS) 0/134 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Real declared 134/134 variables, and 125 constraints, problems are : Problem set: 0 solved, 72 unsolved in 660 ms.
Refiners :[Domain max(s): 50/50 constraints, Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 50/50 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 72 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 25/75 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (OVERLAPS) 84/134 variables, 50/125 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 72/197 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (OVERLAPS) 0/134 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Int declared 134/134 variables, and 197 constraints, problems are : Problem set: 0 solved, 72 unsolved in 2962 ms.
Refiners :[Domain max(s): 50/50 constraints, Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 50/50 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 0/0 constraints]
After SMT, in 3653ms problems are : Problem set: 0 solved, 72 unsolved
Search for dead transitions found 0 dead transitions in 3654ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 3793 ms. Remains : 50/50 places, 84/84 transitions.
Stuttering acceptance computed with spot in 166 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : Solitaire-PT-SqrNC5x5-LTLFireability-03
Product exploration explored 100000 steps with 5402 reset in 282 ms.
Product exploration explored 100000 steps with 5376 reset in 294 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 p0 (NOT p2) (NOT p1)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT p2)), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 10 factoid took 389 ms. Reduced automaton from 4 states, 11 edges and 3 AP (stutter insensitive) to 5 states, 16 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 212 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), false]
RANDOM walk for 14038 steps (627 resets) in 81 ms. (171 steps per ms) remains 0/8 properties
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT p2)), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR (NOT p2) p0 p1))), (F (NOT (OR (NOT p2) p0 (NOT p1)))), (F (NOT (OR (NOT p2) p0))), (F (NOT p0)), (F p2), (F (NOT (OR p2 p0))), (F (NOT (OR p2 p0 p1))), (F p1)]
Knowledge based reduction with 10 factoid took 608 ms. Reduced automaton from 5 states, 16 edges and 3 AP (stutter insensitive) to 5 states, 16 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 266 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), false]
Stuttering acceptance computed with spot in 196 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), false]
Support contains 8 out of 50 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 50/50 places, 84/84 transitions.
Applied a total of 0 rules in 7 ms. Remains 50 /50 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2024-05-29 08:54:10] [INFO ] Invariant cache hit.
[2024-05-29 08:54:10] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-29 08:54:10] [INFO ] Invariant cache hit.
[2024-05-29 08:54:10] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
[2024-05-29 08:54:10] [INFO ] Redundant transitions in 1 ms returned []
Running 72 sub problems to find dead transitions.
[2024-05-29 08:54:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 25/75 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (OVERLAPS) 84/134 variables, 50/125 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (OVERLAPS) 0/134 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Real declared 134/134 variables, and 125 constraints, problems are : Problem set: 0 solved, 72 unsolved in 670 ms.
Refiners :[Domain max(s): 50/50 constraints, Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 50/50 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 72 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 25/75 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (OVERLAPS) 84/134 variables, 50/125 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 72/197 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (OVERLAPS) 0/134 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Int declared 134/134 variables, and 197 constraints, problems are : Problem set: 0 solved, 72 unsolved in 3002 ms.
Refiners :[Domain max(s): 50/50 constraints, Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 50/50 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 0/0 constraints]
After SMT, in 3710ms problems are : Problem set: 0 solved, 72 unsolved
Search for dead transitions found 0 dead transitions in 3712ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 3840 ms. Remains : 50/50 places, 84/84 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 p2) p0 (NOT p1)), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND p2 (NOT p0) p1))), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X p0), (X (NOT (AND p2 (NOT p0)))), (X (NOT p1)), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT (AND p2 (NOT p0)))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 12 factoid took 495 ms. Reduced automaton from 5 states, 16 edges and 3 AP (stutter insensitive) to 5 states, 16 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 219 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), false]
RANDOM walk for 5999 steps (270 resets) in 36 ms. (162 steps per ms) remains 0/8 properties
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND p2 (NOT p0) p1))), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X p0), (X (NOT (AND p2 (NOT p0)))), (X (NOT p1)), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT (AND p2 (NOT p0)))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR (NOT p2) p0 p1))), (F (NOT (OR (NOT p2) p0 (NOT p1)))), (F (NOT (OR (NOT p2) p0))), (F (NOT p0)), (F p2), (F (NOT (OR p2 p0))), (F (NOT (OR p2 p0 p1))), (F p1)]
Knowledge based reduction with 12 factoid took 739 ms. Reduced automaton from 5 states, 16 edges and 3 AP (stutter insensitive) to 5 states, 16 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 240 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), false]
Stuttering acceptance computed with spot in 273 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), false]
Stuttering acceptance computed with spot in 237 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), false]
Product exploration explored 100000 steps with 5459 reset in 303 ms.
Product exploration explored 100000 steps with 5398 reset in 305 ms.
Built C files in :
/tmp/ltsmin4100293151230901712
[2024-05-29 08:54:16] [INFO ] Computing symmetric may disable matrix : 84 transitions.
[2024-05-29 08:54:16] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 08:54:16] [INFO ] Computing symmetric may enable matrix : 84 transitions.
[2024-05-29 08:54:16] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 08:54:16] [INFO ] Computing Do-Not-Accords matrix : 84 transitions.
[2024-05-29 08:54:16] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 08:54:16] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4100293151230901712
Running compilation step : cd /tmp/ltsmin4100293151230901712;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 309 ms.
Running link step : cd /tmp/ltsmin4100293151230901712;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin4100293151230901712;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8776855665546824338.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 8 out of 50 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 50/50 places, 84/84 transitions.
Applied a total of 0 rules in 8 ms. Remains 50 /50 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2024-05-29 08:54:32] [INFO ] Invariant cache hit.
[2024-05-29 08:54:32] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-29 08:54:32] [INFO ] Invariant cache hit.
[2024-05-29 08:54:32] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
[2024-05-29 08:54:32] [INFO ] Redundant transitions in 1 ms returned []
Running 72 sub problems to find dead transitions.
[2024-05-29 08:54:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 25/75 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (OVERLAPS) 84/134 variables, 50/125 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (OVERLAPS) 0/134 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Real declared 134/134 variables, and 125 constraints, problems are : Problem set: 0 solved, 72 unsolved in 673 ms.
Refiners :[Domain max(s): 50/50 constraints, Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 50/50 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 72 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 25/75 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (OVERLAPS) 84/134 variables, 50/125 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 72/197 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (OVERLAPS) 0/134 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Int declared 134/134 variables, and 197 constraints, problems are : Problem set: 0 solved, 72 unsolved in 2976 ms.
Refiners :[Domain max(s): 50/50 constraints, Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 50/50 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 0/0 constraints]
After SMT, in 3676ms problems are : Problem set: 0 solved, 72 unsolved
Search for dead transitions found 0 dead transitions in 3677ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 3811 ms. Remains : 50/50 places, 84/84 transitions.
Built C files in :
/tmp/ltsmin5645140154586411103
[2024-05-29 08:54:35] [INFO ] Computing symmetric may disable matrix : 84 transitions.
[2024-05-29 08:54:35] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 08:54:35] [INFO ] Computing symmetric may enable matrix : 84 transitions.
[2024-05-29 08:54:35] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 08:54:35] [INFO ] Computing Do-Not-Accords matrix : 84 transitions.
[2024-05-29 08:54:35] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 08:54:35] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5645140154586411103
Running compilation step : cd /tmp/ltsmin5645140154586411103;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 226 ms.
Running link step : cd /tmp/ltsmin5645140154586411103;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin5645140154586411103;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10810582303128682716.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 08:54:51] [INFO ] Flatten gal took : 7 ms
[2024-05-29 08:54:51] [INFO ] Flatten gal took : 6 ms
[2024-05-29 08:54:51] [INFO ] Time to serialize gal into /tmp/LTL1688810690272044395.gal : 9 ms
[2024-05-29 08:54:51] [INFO ] Time to serialize properties into /tmp/LTL13055052292952508091.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1688810690272044395.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7565605799808551333.hoa' '-atoms' '/tmp/LTL13055052292952508091.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL13055052292952508091.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7565605799808551333.hoa
Detected timeout of ITS tools.
[2024-05-29 08:55:06] [INFO ] Flatten gal took : 7 ms
[2024-05-29 08:55:06] [INFO ] Flatten gal took : 6 ms
[2024-05-29 08:55:06] [INFO ] Time to serialize gal into /tmp/LTL10319889417022167313.gal : 2 ms
[2024-05-29 08:55:06] [INFO ] Time to serialize properties into /tmp/LTL17394280326677388365.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10319889417022167313.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17394280326677388365.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G(F(("((F32==0)||(T33==0))")||(("(T34==0)")||((X("(((F22==1)&&(T23==1))&&(T24==1))"))&&(G("((F45==1)&&(T46==1))"))))))))
Formula 0 simplified : FG(!"((F32==0)||(T33==0))" & !"(T34==0)" & (X!"(((F22==1)&&(T23==1))&&(T24==1))" | F!"((F45==1)&&(T46==1))"))
Detected timeout of ITS tools.
[2024-05-29 08:55:21] [INFO ] Flatten gal took : 10 ms
[2024-05-29 08:55:21] [INFO ] Applying decomposition
[2024-05-29 08:55:21] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph7064109244219896010.txt' '-o' '/tmp/graph7064109244219896010.bin' '-w' '/tmp/graph7064109244219896010.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7064109244219896010.bin' '-l' '-1' '-v' '-w' '/tmp/graph7064109244219896010.weights' '-q' '0' '-e' '0.001'
[2024-05-29 08:55:21] [INFO ] Decomposing Gal with order
[2024-05-29 08:55:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 08:55:21] [INFO ] Removed a total of 178 redundant transitions.
[2024-05-29 08:55:21] [INFO ] Flatten gal took : 9 ms
[2024-05-29 08:55:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-29 08:55:21] [INFO ] Time to serialize gal into /tmp/LTL7692912206633754805.gal : 2 ms
[2024-05-29 08:55:21] [INFO ] Time to serialize properties into /tmp/LTL682328143741434342.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7692912206633754805.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL682328143741434342.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...253
Read 1 LTL properties
Checking formula 0 : !((G(F(("((i1.u5.F32==0)||(i1.u7.T33==0))")||(("(i2.i1.u8.T34==0)")||((X("(((i1.u6.F22==1)&&(i1.u10.T23==1))&&(i2.i1.u13.T24==1))"))&&...208
Formula 0 simplified : FG(!"((i1.u5.F32==0)||(i1.u7.T33==0))" & !"(i2.i1.u8.T34==0)" & (X!"(((i1.u6.F22==1)&&(i1.u10.T23==1))&&(i2.i1.u13.T24==1))" | F!"((...196
Detected timeout of ITS tools.
Treatment of property Solitaire-PT-SqrNC5x5-LTLFireability-03 finished in 92312 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||X((p1||G(F(p2)))))))'
Support contains 9 out of 50 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 50/50 places, 84/84 transitions.
Applied a total of 0 rules in 1 ms. Remains 50 /50 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2024-05-29 08:55:36] [INFO ] Invariant cache hit.
[2024-05-29 08:55:36] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-05-29 08:55:36] [INFO ] Invariant cache hit.
[2024-05-29 08:55:36] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
Running 72 sub problems to find dead transitions.
[2024-05-29 08:55:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 25/75 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (OVERLAPS) 84/134 variables, 50/125 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (OVERLAPS) 0/134 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Real declared 134/134 variables, and 125 constraints, problems are : Problem set: 0 solved, 72 unsolved in 698 ms.
Refiners :[Domain max(s): 50/50 constraints, Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 50/50 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 72 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 25/75 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (OVERLAPS) 84/134 variables, 50/125 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 72/197 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (OVERLAPS) 0/134 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Int declared 134/134 variables, and 197 constraints, problems are : Problem set: 0 solved, 72 unsolved in 3010 ms.
Refiners :[Domain max(s): 50/50 constraints, Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 50/50 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 0/0 constraints]
After SMT, in 3738ms problems are : Problem set: 0 solved, 72 unsolved
Search for dead transitions found 0 dead transitions in 3739ms
Finished structural reductions in LTL mode , in 1 iterations and 3865 ms. Remains : 50/50 places, 84/84 transitions.
Stuttering acceptance computed with spot in 169 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2)]
Running random walk in product with property : Solitaire-PT-SqrNC5x5-LTLFireability-05
Product exploration explored 100000 steps with 7848 reset in 292 ms.
Product exploration explored 100000 steps with 7868 reset in 297 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) p2)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 1 factoid took 218 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 5 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 187 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2)]
RANDOM walk for 189 steps (7 resets) in 5 ms. (31 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p1)), (X (X (NOT p1))), (F p1), (F (NOT p2)), (F (NOT (OR p1 p2))), (F p0)]
Knowledge based reduction with 1 factoid took 361 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 5 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 190 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 195 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2)]
Support contains 9 out of 50 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 50/50 places, 84/84 transitions.
Applied a total of 0 rules in 1 ms. Remains 50 /50 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2024-05-29 08:55:42] [INFO ] Invariant cache hit.
[2024-05-29 08:55:42] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-29 08:55:42] [INFO ] Invariant cache hit.
[2024-05-29 08:55:42] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
Running 72 sub problems to find dead transitions.
[2024-05-29 08:55:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 25/75 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (OVERLAPS) 84/134 variables, 50/125 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (OVERLAPS) 0/134 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Real declared 134/134 variables, and 125 constraints, problems are : Problem set: 0 solved, 72 unsolved in 663 ms.
Refiners :[Domain max(s): 50/50 constraints, Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 50/50 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 72 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 25/75 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (OVERLAPS) 84/134 variables, 50/125 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 72/197 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (OVERLAPS) 0/134 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Int declared 134/134 variables, and 197 constraints, problems are : Problem set: 0 solved, 72 unsolved in 2926 ms.
Refiners :[Domain max(s): 50/50 constraints, Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 50/50 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 0/0 constraints]
After SMT, in 3619ms problems are : Problem set: 0 solved, 72 unsolved
Search for dead transitions found 0 dead transitions in 3620ms
Finished structural reductions in LTL mode , in 1 iterations and 3733 ms. Remains : 50/50 places, 84/84 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) p2)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 1 factoid took 255 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 5 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 197 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2)]
RANDOM walk for 171 steps (7 resets) in 6 ms. (24 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p1)), (X (X (NOT p1))), (F p1), (F (NOT p2)), (F (NOT (OR p1 p2))), (F p0)]
Knowledge based reduction with 1 factoid took 375 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 5 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 215 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 232 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 210 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 7853 reset in 289 ms.
Product exploration explored 100000 steps with 7987 reset in 284 ms.
Applying partial POR strategy [false, false, true, true, true]
Stuttering acceptance computed with spot in 218 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2)]
Support contains 9 out of 50 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 50/50 places, 84/84 transitions.
Applied a total of 0 rules in 3 ms. Remains 50 /50 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2024-05-29 08:55:48] [INFO ] Redundant transitions in 1 ms returned []
Running 72 sub problems to find dead transitions.
[2024-05-29 08:55:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 25/75 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (OVERLAPS) 84/134 variables, 50/125 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (OVERLAPS) 0/134 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Real declared 134/134 variables, and 125 constraints, problems are : Problem set: 0 solved, 72 unsolved in 696 ms.
Refiners :[Domain max(s): 50/50 constraints, Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 50/50 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 72 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 25/75 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (OVERLAPS) 84/134 variables, 50/125 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 72/197 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (OVERLAPS) 0/134 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Int declared 134/134 variables, and 197 constraints, problems are : Problem set: 0 solved, 72 unsolved in 4116 ms.
Refiners :[Domain max(s): 50/50 constraints, Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 50/50 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 0/0 constraints]
After SMT, in 4855ms problems are : Problem set: 0 solved, 72 unsolved
Search for dead transitions found 0 dead transitions in 4856ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 4864 ms. Remains : 50/50 places, 84/84 transitions.
Built C files in :
/tmp/ltsmin1192650402493103632
[2024-05-29 08:55:53] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1192650402493103632
Running compilation step : cd /tmp/ltsmin1192650402493103632;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 213 ms.
Running link step : cd /tmp/ltsmin1192650402493103632;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin1192650402493103632;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased18300405749811116242.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 9 out of 50 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 50/50 places, 84/84 transitions.
Applied a total of 0 rules in 3 ms. Remains 50 /50 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2024-05-29 08:56:08] [INFO ] Invariant cache hit.
[2024-05-29 08:56:08] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-29 08:56:08] [INFO ] Invariant cache hit.
[2024-05-29 08:56:08] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 137 ms to find 0 implicit places.
Running 72 sub problems to find dead transitions.
[2024-05-29 08:56:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 25/75 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (OVERLAPS) 84/134 variables, 50/125 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (OVERLAPS) 0/134 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Real declared 134/134 variables, and 125 constraints, problems are : Problem set: 0 solved, 72 unsolved in 632 ms.
Refiners :[Domain max(s): 50/50 constraints, Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 50/50 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 72 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 25/75 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (OVERLAPS) 84/134 variables, 50/125 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 72/197 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (OVERLAPS) 0/134 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Int declared 134/134 variables, and 197 constraints, problems are : Problem set: 0 solved, 72 unsolved in 2876 ms.
Refiners :[Domain max(s): 50/50 constraints, Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 50/50 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 0/0 constraints]
After SMT, in 3538ms problems are : Problem set: 0 solved, 72 unsolved
Search for dead transitions found 0 dead transitions in 3539ms
Finished structural reductions in LTL mode , in 1 iterations and 3681 ms. Remains : 50/50 places, 84/84 transitions.
Built C files in :
/tmp/ltsmin7921141456121596517
[2024-05-29 08:56:11] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7921141456121596517
Running compilation step : cd /tmp/ltsmin7921141456121596517;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 204 ms.
Running link step : cd /tmp/ltsmin7921141456121596517;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin7921141456121596517;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased3610473330035957942.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 08:56:27] [INFO ] Flatten gal took : 7 ms
[2024-05-29 08:56:27] [INFO ] Flatten gal took : 5 ms
[2024-05-29 08:56:27] [INFO ] Time to serialize gal into /tmp/LTL2166940449763451555.gal : 2 ms
[2024-05-29 08:56:27] [INFO ] Time to serialize properties into /tmp/LTL2282917886701951082.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2166940449763451555.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17810633530357827971.hoa' '-atoms' '/tmp/LTL2282917886701951082.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL2282917886701951082.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17810633530357827971.hoa
Detected timeout of ITS tools.
[2024-05-29 08:56:42] [INFO ] Flatten gal took : 9 ms
[2024-05-29 08:56:42] [INFO ] Flatten gal took : 6 ms
[2024-05-29 08:56:42] [INFO ] Time to serialize gal into /tmp/LTL15210741505717343785.gal : 1 ms
[2024-05-29 08:56:42] [INFO ] Time to serialize properties into /tmp/LTL17735023752014373502.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15210741505717343785.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17735023752014373502.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X((X(("(((F43==1)&&(T44==1))&&(T45==1))")||(G(F("(((T53==0)||(T43==0))||(F33==0))")))))||("(((F54==1)&&(T55==1))&&(T56==1))"))))
Formula 0 simplified : X(!"(((F54==1)&&(T55==1))&&(T56==1))" & X(!"(((F43==1)&&(T44==1))&&(T45==1))" & FG!"(((T53==0)||(T43==0))||(F33==0))"))
Detected timeout of ITS tools.
[2024-05-29 08:56:57] [INFO ] Flatten gal took : 5 ms
[2024-05-29 08:56:57] [INFO ] Applying decomposition
[2024-05-29 08:56:57] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph9371969822600273743.txt' '-o' '/tmp/graph9371969822600273743.bin' '-w' '/tmp/graph9371969822600273743.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9371969822600273743.bin' '-l' '-1' '-v' '-w' '/tmp/graph9371969822600273743.weights' '-q' '0' '-e' '0.001'
[2024-05-29 08:56:57] [INFO ] Decomposing Gal with order
[2024-05-29 08:56:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 08:56:57] [INFO ] Removed a total of 178 redundant transitions.
[2024-05-29 08:56:57] [INFO ] Flatten gal took : 9 ms
[2024-05-29 08:56:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2024-05-29 08:56:57] [INFO ] Time to serialize gal into /tmp/LTL16135553642684300138.gal : 2 ms
[2024-05-29 08:56:57] [INFO ] Time to serialize properties into /tmp/LTL790764584293666531.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16135553642684300138.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL790764584293666531.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X((X(("(((i0.u4.F43==1)&&(i0.u11.T44==1))&&(i3.i0.u14.T45==1))")||(G(F("(((i4.i0.u1.T53==0)||(i0.u4.T43==0))||(i1.u7.F33==0))")))))...226
Formula 0 simplified : X(!"(((i4.i1.u15.F54==1)&&(i3.i1.u17.T55==1))&&(i3.i1.u23.T56==1))" & X(!"(((i0.u4.F43==1)&&(i0.u11.T44==1))&&(i3.i0.u14.T45==1))" &...216
Detected timeout of ITS tools.
Treatment of property Solitaire-PT-SqrNC5x5-LTLFireability-05 finished in 95986 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&&X(G(p1)))) U G(p2)))'
Support contains 8 out of 50 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 50/50 places, 84/84 transitions.
Applied a total of 0 rules in 1 ms. Remains 50 /50 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2024-05-29 08:57:12] [INFO ] Invariant cache hit.
[2024-05-29 08:57:12] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-29 08:57:12] [INFO ] Invariant cache hit.
[2024-05-29 08:57:12] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 158 ms to find 0 implicit places.
Running 72 sub problems to find dead transitions.
[2024-05-29 08:57:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 25/75 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (OVERLAPS) 84/134 variables, 50/125 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (OVERLAPS) 0/134 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Real declared 134/134 variables, and 125 constraints, problems are : Problem set: 0 solved, 72 unsolved in 677 ms.
Refiners :[Domain max(s): 50/50 constraints, Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 50/50 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 72 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 25/75 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (OVERLAPS) 84/134 variables, 50/125 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 72/197 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (OVERLAPS) 0/134 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Int declared 134/134 variables, and 197 constraints, problems are : Problem set: 0 solved, 72 unsolved in 2924 ms.
Refiners :[Domain max(s): 50/50 constraints, Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 50/50 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 0/0 constraints]
After SMT, in 3637ms problems are : Problem set: 0 solved, 72 unsolved
Search for dead transitions found 0 dead transitions in 3637ms
Finished structural reductions in LTL mode , in 1 iterations and 3796 ms. Remains : 50/50 places, 84/84 transitions.
Stuttering acceptance computed with spot in 250 ms :[(NOT p2), (OR (NOT p1) p0), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), true, (NOT p1), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Running random walk in product with property : Solitaire-PT-SqrNC5x5-LTLFireability-06
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA Solitaire-PT-SqrNC5x5-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Solitaire-PT-SqrNC5x5-LTLFireability-06 finished in 4077 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))||F(p1)))'
Support contains 4 out of 50 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 50/50 places, 84/84 transitions.
Applied a total of 0 rules in 2 ms. Remains 50 /50 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2024-05-29 08:57:16] [INFO ] Invariant cache hit.
[2024-05-29 08:57:16] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-29 08:57:16] [INFO ] Invariant cache hit.
[2024-05-29 08:57:16] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
Running 72 sub problems to find dead transitions.
[2024-05-29 08:57:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 25/75 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (OVERLAPS) 84/134 variables, 50/125 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (OVERLAPS) 0/134 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Real declared 134/134 variables, and 125 constraints, problems are : Problem set: 0 solved, 72 unsolved in 680 ms.
Refiners :[Domain max(s): 50/50 constraints, Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 50/50 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 72 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 25/75 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (OVERLAPS) 84/134 variables, 50/125 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 72/197 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (OVERLAPS) 0/134 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Int declared 134/134 variables, and 197 constraints, problems are : Problem set: 0 solved, 72 unsolved in 2996 ms.
Refiners :[Domain max(s): 50/50 constraints, Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 50/50 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 0/0 constraints]
After SMT, in 3703ms problems are : Problem set: 0 solved, 72 unsolved
Search for dead transitions found 0 dead transitions in 3704ms
Finished structural reductions in LTL mode , in 1 iterations and 3842 ms. Remains : 50/50 places, 84/84 transitions.
Stuttering acceptance computed with spot in 111 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Solitaire-PT-SqrNC5x5-LTLFireability-07
Product exploration explored 100000 steps with 14072 reset in 253 ms.
Product exploration explored 100000 steps with 13980 reset in 270 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 p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT p0))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (NOT p1)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (X (X (NOT p1))), (X (X p1))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 412 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 91 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 21 steps (0 resets) in 5 ms. (3 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT p0))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (NOT p1)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (X (X (NOT p1))), (X (X p1)), (F p1)]
Knowledge based reduction with 3 factoid took 369 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 85 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p1), (NOT p1)]
[2024-05-29 08:57:21] [INFO ] Invariant cache hit.
[2024-05-29 08:57:21] [INFO ] [Real]Absence check using 25 positive place invariants in 3 ms returned sat
[2024-05-29 08:57:21] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2024-05-29 08:57:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 08:57:21] [INFO ] [Nat]Absence check using 25 positive place invariants in 3 ms returned sat
[2024-05-29 08:57:21] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2024-05-29 08:57:22] [INFO ] Computed and/alt/rep : 72/484/72 causal constraints (skipped 0 transitions) in 7 ms.
[2024-05-29 08:57:22] [INFO ] Added : 19 causal constraints over 4 iterations in 83 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 2 out of 50 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 : 50/50 places, 84/84 transitions.
Applied a total of 0 rules in 3 ms. Remains 50 /50 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2024-05-29 08:57:22] [INFO ] Invariant cache hit.
[2024-05-29 08:57:22] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-29 08:57:22] [INFO ] Invariant cache hit.
[2024-05-29 08:57:22] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
[2024-05-29 08:57:22] [INFO ] Redundant transitions in 2 ms returned []
Running 72 sub problems to find dead transitions.
[2024-05-29 08:57:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 25/75 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (OVERLAPS) 84/134 variables, 50/125 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (OVERLAPS) 0/134 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Real declared 134/134 variables, and 125 constraints, problems are : Problem set: 0 solved, 72 unsolved in 666 ms.
Refiners :[Domain max(s): 50/50 constraints, Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 50/50 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 72 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 25/75 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (OVERLAPS) 84/134 variables, 50/125 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 72/197 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (OVERLAPS) 0/134 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Int declared 134/134 variables, and 197 constraints, problems are : Problem set: 0 solved, 72 unsolved in 2957 ms.
Refiners :[Domain max(s): 50/50 constraints, Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 50/50 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 0/0 constraints]
After SMT, in 3653ms problems are : Problem set: 0 solved, 72 unsolved
Search for dead transitions found 0 dead transitions in 3654ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 3784 ms. Remains : 50/50 places, 84/84 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 148 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 17 steps (0 resets) in 4 ms. (3 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 190 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 81 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 61 ms :[(NOT p1), (NOT p1)]
[2024-05-29 08:57:26] [INFO ] Invariant cache hit.
[2024-05-29 08:57:26] [INFO ] [Real]Absence check using 25 positive place invariants in 3 ms returned sat
[2024-05-29 08:57:26] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2024-05-29 08:57:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 08:57:26] [INFO ] [Nat]Absence check using 25 positive place invariants in 4 ms returned sat
[2024-05-29 08:57:26] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2024-05-29 08:57:26] [INFO ] Computed and/alt/rep : 72/484/72 causal constraints (skipped 0 transitions) in 7 ms.
[2024-05-29 08:57:26] [INFO ] Added : 19 causal constraints over 4 iterations in 70 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 81 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 13983 reset in 254 ms.
Product exploration explored 100000 steps with 14106 reset in 264 ms.
Built C files in :
/tmp/ltsmin14410341600854717446
[2024-05-29 08:57:27] [INFO ] Computing symmetric may disable matrix : 84 transitions.
[2024-05-29 08:57:27] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 08:57:27] [INFO ] Computing symmetric may enable matrix : 84 transitions.
[2024-05-29 08:57:27] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 08:57:27] [INFO ] Computing Do-Not-Accords matrix : 84 transitions.
[2024-05-29 08:57:27] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 08:57:27] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14410341600854717446
Running compilation step : cd /tmp/ltsmin14410341600854717446;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 224 ms.
Running link step : cd /tmp/ltsmin14410341600854717446;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin14410341600854717446;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased9662824341639697553.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 50 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 50/50 places, 84/84 transitions.
Applied a total of 0 rules in 10 ms. Remains 50 /50 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2024-05-29 08:57:42] [INFO ] Invariant cache hit.
[2024-05-29 08:57:42] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-05-29 08:57:42] [INFO ] Invariant cache hit.
[2024-05-29 08:57:42] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 128 ms to find 0 implicit places.
[2024-05-29 08:57:42] [INFO ] Redundant transitions in 1 ms returned []
Running 72 sub problems to find dead transitions.
[2024-05-29 08:57:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 25/75 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (OVERLAPS) 84/134 variables, 50/125 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (OVERLAPS) 0/134 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Real declared 134/134 variables, and 125 constraints, problems are : Problem set: 0 solved, 72 unsolved in 686 ms.
Refiners :[Domain max(s): 50/50 constraints, Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 50/50 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 72 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 25/75 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (OVERLAPS) 84/134 variables, 50/125 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 72/197 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (OVERLAPS) 0/134 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Int declared 134/134 variables, and 197 constraints, problems are : Problem set: 0 solved, 72 unsolved in 2953 ms.
Refiners :[Domain max(s): 50/50 constraints, Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 50/50 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 0/0 constraints]
After SMT, in 3665ms problems are : Problem set: 0 solved, 72 unsolved
Search for dead transitions found 0 dead transitions in 3666ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 3809 ms. Remains : 50/50 places, 84/84 transitions.
Built C files in :
/tmp/ltsmin15024127597600145583
[2024-05-29 08:57:46] [INFO ] Computing symmetric may disable matrix : 84 transitions.
[2024-05-29 08:57:46] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 08:57:46] [INFO ] Computing symmetric may enable matrix : 84 transitions.
[2024-05-29 08:57:46] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 08:57:46] [INFO ] Computing Do-Not-Accords matrix : 84 transitions.
[2024-05-29 08:57:46] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 08:57:46] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15024127597600145583
Running compilation step : cd /tmp/ltsmin15024127597600145583;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 230 ms.
Running link step : cd /tmp/ltsmin15024127597600145583;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin15024127597600145583;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8279567112806748643.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 08:58:01] [INFO ] Flatten gal took : 13 ms
[2024-05-29 08:58:01] [INFO ] Flatten gal took : 5 ms
[2024-05-29 08:58:01] [INFO ] Time to serialize gal into /tmp/LTL13010047328691901839.gal : 1 ms
[2024-05-29 08:58:01] [INFO ] Time to serialize properties into /tmp/LTL17410396465033737574.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13010047328691901839.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1124911817998020087.hoa' '-atoms' '/tmp/LTL17410396465033737574.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL17410396465033737574.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1124911817998020087.hoa
Detected timeout of ITS tools.
[2024-05-29 08:58:16] [INFO ] Flatten gal took : 7 ms
[2024-05-29 08:58:16] [INFO ] Flatten gal took : 5 ms
[2024-05-29 08:58:16] [INFO ] Time to serialize gal into /tmp/LTL8874862161885379464.gal : 1 ms
[2024-05-29 08:58:16] [INFO ] Time to serialize properties into /tmp/LTL17639441017763389428.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8874862161885379464.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17639441017763389428.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((X(G("((F45==1)&&(T46==1))")))||(F("((T42==0)||(T43==0))"))))
Formula 0 simplified : XF!"((F45==1)&&(T46==1))" & G!"((T42==0)||(T43==0))"
Detected timeout of ITS tools.
[2024-05-29 08:58:31] [INFO ] Flatten gal took : 8 ms
[2024-05-29 08:58:31] [INFO ] Applying decomposition
[2024-05-29 08:58:31] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph1612961429909644252.txt' '-o' '/tmp/graph1612961429909644252.bin' '-w' '/tmp/graph1612961429909644252.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1612961429909644252.bin' '-l' '-1' '-v' '-w' '/tmp/graph1612961429909644252.weights' '-q' '0' '-e' '0.001'
[2024-05-29 08:58:31] [INFO ] Decomposing Gal with order
[2024-05-29 08:58:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 08:58:31] [INFO ] Removed a total of 178 redundant transitions.
[2024-05-29 08:58:31] [INFO ] Flatten gal took : 9 ms
[2024-05-29 08:58:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-29 08:58:31] [INFO ] Time to serialize gal into /tmp/LTL2494989274985259614.gal : 2 ms
[2024-05-29 08:58:31] [INFO ] Time to serialize properties into /tmp/LTL3931156666731192975.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2494989274985259614.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3931156666731192975.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !(((X(G("((i4.i1.u14.F45==1)&&(i4.i1.u20.T46==1))")))||(F("((i1.u0.T42==0)||(i1.u4.T43==0))"))))
Formula 0 simplified : XF!"((i4.i1.u14.F45==1)&&(i4.i1.u20.T46==1))" & G!"((i1.u0.T42==0)||(i1.u4.T43==0))"
Detected timeout of ITS tools.
Treatment of property Solitaire-PT-SqrNC5x5-LTLFireability-07 finished in 90232 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)||G(p1)||G(p2)))'
Support contains 9 out of 50 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 50/50 places, 84/84 transitions.
Applied a total of 0 rules in 9 ms. Remains 50 /50 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2024-05-29 08:58:46] [INFO ] Invariant cache hit.
[2024-05-29 08:58:46] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-29 08:58:46] [INFO ] Invariant cache hit.
[2024-05-29 08:58:46] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 181 ms to find 0 implicit places.
[2024-05-29 08:58:46] [INFO ] Redundant transitions in 1 ms returned []
Running 72 sub problems to find dead transitions.
[2024-05-29 08:58:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 25/75 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (OVERLAPS) 84/134 variables, 50/125 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (OVERLAPS) 0/134 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Real declared 134/134 variables, and 125 constraints, problems are : Problem set: 0 solved, 72 unsolved in 668 ms.
Refiners :[Domain max(s): 50/50 constraints, Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 50/50 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 72 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 25/75 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (OVERLAPS) 84/134 variables, 50/125 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 72/197 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (OVERLAPS) 0/134 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Int declared 134/134 variables, and 197 constraints, problems are : Problem set: 0 solved, 72 unsolved in 2956 ms.
Refiners :[Domain max(s): 50/50 constraints, Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 50/50 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 0/0 constraints]
After SMT, in 3656ms problems are : Problem set: 0 solved, 72 unsolved
Search for dead transitions found 0 dead transitions in 3657ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 3856 ms. Remains : 50/50 places, 84/84 transitions.
Stuttering acceptance computed with spot in 290 ms :[true, (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (AND (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Solitaire-PT-SqrNC5x5-LTLFireability-09
Entered a terminal (fully accepting) state of product in 17 steps with 0 reset in 0 ms.
FORMULA Solitaire-PT-SqrNC5x5-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Solitaire-PT-SqrNC5x5-LTLFireability-09 finished in 4163 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&&F(p1))))'
Support contains 10 out of 50 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 50/50 places, 84/84 transitions.
Applied a total of 0 rules in 1 ms. Remains 50 /50 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2024-05-29 08:58:50] [INFO ] Invariant cache hit.
[2024-05-29 08:58:50] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-05-29 08:58:50] [INFO ] Invariant cache hit.
[2024-05-29 08:58:50] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 126 ms to find 0 implicit places.
Running 72 sub problems to find dead transitions.
[2024-05-29 08:58:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 25/75 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (OVERLAPS) 84/134 variables, 50/125 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (OVERLAPS) 0/134 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Real declared 134/134 variables, and 125 constraints, problems are : Problem set: 0 solved, 72 unsolved in 664 ms.
Refiners :[Domain max(s): 50/50 constraints, Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 50/50 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 72 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 25/75 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (OVERLAPS) 84/134 variables, 50/125 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 72/197 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (OVERLAPS) 0/134 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Int declared 134/134 variables, and 197 constraints, problems are : Problem set: 0 solved, 72 unsolved in 2930 ms.
Refiners :[Domain max(s): 50/50 constraints, Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 50/50 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 0/0 constraints]
After SMT, in 3622ms problems are : Problem set: 0 solved, 72 unsolved
Search for dead transitions found 0 dead transitions in 3623ms
Finished structural reductions in LTL mode , in 1 iterations and 3750 ms. Remains : 50/50 places, 84/84 transitions.
Stuttering acceptance computed with spot in 131 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : Solitaire-PT-SqrNC5x5-LTLFireability-10
Product exploration explored 100000 steps with 42434 reset in 238 ms.
Product exploration explored 100000 steps with 42509 reset in 242 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X p0)]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (NOT p1)), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 2 factoid took 298 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 88 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 93 steps (4 resets) in 4 ms. (18 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 p0), (X p0)]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (NOT p1)), (X (X (NOT p1))), (X (X p1)), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 278 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 81 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p1), (NOT p1)]
Support contains 7 out of 50 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 50/50 places, 84/84 transitions.
Applied a total of 0 rules in 0 ms. Remains 50 /50 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2024-05-29 08:58:55] [INFO ] Invariant cache hit.
[2024-05-29 08:58:55] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-29 08:58:55] [INFO ] Invariant cache hit.
[2024-05-29 08:58:56] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 136 ms to find 0 implicit places.
Running 72 sub problems to find dead transitions.
[2024-05-29 08:58:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 25/75 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (OVERLAPS) 84/134 variables, 50/125 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (OVERLAPS) 0/134 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Real declared 134/134 variables, and 125 constraints, problems are : Problem set: 0 solved, 72 unsolved in 1824 ms.
Refiners :[Domain max(s): 50/50 constraints, Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 50/50 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 72 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 25/75 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (OVERLAPS) 84/134 variables, 50/125 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 72/197 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (OVERLAPS) 0/134 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Int declared 134/134 variables, and 197 constraints, problems are : Problem set: 0 solved, 72 unsolved in 2937 ms.
Refiners :[Domain max(s): 50/50 constraints, Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 50/50 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 0/0 constraints]
After SMT, in 4786ms problems are : Problem set: 0 solved, 72 unsolved
Search for dead transitions found 0 dead transitions in 4788ms
Finished structural reductions in LTL mode , in 1 iterations and 4926 ms. Remains : 50/50 places, 84/84 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 : [p1]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 1 factoid took 166 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 80 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 110 steps (4 resets) in 6 ms. (15 steps per ms) remains 0/1 properties
Knowledge obtained : [p1]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (F (NOT p1))]
Knowledge based reduction with 1 factoid took 199 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 98 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 102 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 42541 reset in 152 ms.
Product exploration explored 100000 steps with 42372 reset in 165 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 72 ms :[(NOT p1), (NOT p1)]
Support contains 7 out of 50 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 50/50 places, 84/84 transitions.
Applied a total of 0 rules in 8 ms. Remains 50 /50 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2024-05-29 08:59:02] [INFO ] Redundant transitions in 1 ms returned []
Running 72 sub problems to find dead transitions.
[2024-05-29 08:59:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 25/75 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (OVERLAPS) 84/134 variables, 50/125 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (OVERLAPS) 0/134 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Real declared 134/134 variables, and 125 constraints, problems are : Problem set: 0 solved, 72 unsolved in 664 ms.
Refiners :[Domain max(s): 50/50 constraints, Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 50/50 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 72 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 25/75 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (OVERLAPS) 84/134 variables, 50/125 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 72/197 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (OVERLAPS) 0/134 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Int declared 134/134 variables, and 197 constraints, problems are : Problem set: 0 solved, 72 unsolved in 3191 ms.
Refiners :[Domain max(s): 50/50 constraints, Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 50/50 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 0/0 constraints]
After SMT, in 3903ms problems are : Problem set: 0 solved, 72 unsolved
Search for dead transitions found 0 dead transitions in 3904ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 3933 ms. Remains : 50/50 places, 84/84 transitions.
Built C files in :
/tmp/ltsmin2843431469940045171
[2024-05-29 08:59:06] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2843431469940045171
Running compilation step : cd /tmp/ltsmin2843431469940045171;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 222 ms.
Running link step : cd /tmp/ltsmin2843431469940045171;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin2843431469940045171;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased4133077288474185535.hoa' '--buchi-type=spotba'
LTSmin run took 13793 ms.
FORMULA Solitaire-PT-SqrNC5x5-LTLFireability-10 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property Solitaire-PT-SqrNC5x5-LTLFireability-10 finished in 29422 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(X(X(p0))))&&F((p1&&F(p2))))))'
Support contains 7 out of 50 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 50/50 places, 84/84 transitions.
Applied a total of 0 rules in 2 ms. Remains 50 /50 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2024-05-29 08:59:20] [INFO ] Invariant cache hit.
[2024-05-29 08:59:20] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-29 08:59:20] [INFO ] Invariant cache hit.
[2024-05-29 08:59:20] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
Running 72 sub problems to find dead transitions.
[2024-05-29 08:59:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 25/75 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (OVERLAPS) 84/134 variables, 50/125 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (OVERLAPS) 0/134 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Real declared 134/134 variables, and 125 constraints, problems are : Problem set: 0 solved, 72 unsolved in 683 ms.
Refiners :[Domain max(s): 50/50 constraints, Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 50/50 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 72 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 25/75 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (OVERLAPS) 84/134 variables, 50/125 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 72/197 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (OVERLAPS) 0/134 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Int declared 134/134 variables, and 197 constraints, problems are : Problem set: 0 solved, 72 unsolved in 2845 ms.
Refiners :[Domain max(s): 50/50 constraints, Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 50/50 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 0/0 constraints]
After SMT, in 3556ms problems are : Problem set: 0 solved, 72 unsolved
Search for dead transitions found 0 dead transitions in 3557ms
Finished structural reductions in LTL mode , in 1 iterations and 3678 ms. Remains : 50/50 places, 84/84 transitions.
Stuttering acceptance computed with spot in 361 ms :[(OR (NOT p1) (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (OR (NOT p1) (NOT p2)), (NOT p2), (NOT p0), (NOT p0), (NOT p0), true]
Running random walk in product with property : Solitaire-PT-SqrNC5x5-LTLFireability-11
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 0 ms.
FORMULA Solitaire-PT-SqrNC5x5-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Solitaire-PT-SqrNC5x5-LTLFireability-11 finished in 4060 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((X(F(p1))&&p0))))'
Support contains 8 out of 50 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 50/50 places, 84/84 transitions.
Applied a total of 0 rules in 1 ms. Remains 50 /50 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2024-05-29 08:59:24] [INFO ] Invariant cache hit.
[2024-05-29 08:59:24] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-29 08:59:24] [INFO ] Invariant cache hit.
[2024-05-29 08:59:24] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
Running 72 sub problems to find dead transitions.
[2024-05-29 08:59:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 25/75 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (OVERLAPS) 84/134 variables, 50/125 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (OVERLAPS) 0/134 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Real declared 134/134 variables, and 125 constraints, problems are : Problem set: 0 solved, 72 unsolved in 715 ms.
Refiners :[Domain max(s): 50/50 constraints, Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 50/50 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 72 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 25/75 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (OVERLAPS) 84/134 variables, 50/125 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 72/197 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (OVERLAPS) 0/134 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Int declared 134/134 variables, and 197 constraints, problems are : Problem set: 0 solved, 72 unsolved in 2900 ms.
Refiners :[Domain max(s): 50/50 constraints, Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 50/50 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 0/0 constraints]
After SMT, in 3641ms problems are : Problem set: 0 solved, 72 unsolved
Search for dead transitions found 0 dead transitions in 3642ms
Finished structural reductions in LTL mode , in 1 iterations and 3762 ms. Remains : 50/50 places, 84/84 transitions.
Stuttering acceptance computed with spot in 143 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : Solitaire-PT-SqrNC5x5-LTLFireability-13
Stuttering criterion allowed to conclude after 44 steps with 3 reset in 1 ms.
FORMULA Solitaire-PT-SqrNC5x5-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Solitaire-PT-SqrNC5x5-LTLFireability-13 finished in 3926 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 7 out of 50 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 50/50 places, 84/84 transitions.
Applied a total of 0 rules in 6 ms. Remains 50 /50 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2024-05-29 08:59:28] [INFO ] Invariant cache hit.
[2024-05-29 08:59:28] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-29 08:59:28] [INFO ] Invariant cache hit.
[2024-05-29 08:59:28] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
[2024-05-29 08:59:28] [INFO ] Redundant transitions in 2 ms returned []
Running 72 sub problems to find dead transitions.
[2024-05-29 08:59:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 25/75 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (OVERLAPS) 84/134 variables, 50/125 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (OVERLAPS) 0/134 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Real declared 134/134 variables, and 125 constraints, problems are : Problem set: 0 solved, 72 unsolved in 691 ms.
Refiners :[Domain max(s): 50/50 constraints, Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 50/50 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 72 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 25/75 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (OVERLAPS) 84/134 variables, 50/125 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 72/197 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (OVERLAPS) 0/134 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Int declared 134/134 variables, and 197 constraints, problems are : Problem set: 0 solved, 72 unsolved in 3014 ms.
Refiners :[Domain max(s): 50/50 constraints, Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 50/50 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 0/0 constraints]
After SMT, in 3737ms problems are : Problem set: 0 solved, 72 unsolved
Search for dead transitions found 0 dead transitions in 3738ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 3869 ms. Remains : 50/50 places, 84/84 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Solitaire-PT-SqrNC5x5-LTLFireability-14
Stuttering criterion allowed to conclude after 30 steps with 1 reset in 1 ms.
FORMULA Solitaire-PT-SqrNC5x5-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Solitaire-PT-SqrNC5x5-LTLFireability-14 finished in 3962 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(!p1) U X(G(p2)))&&p0)))'
Support contains 6 out of 50 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 50/50 places, 84/84 transitions.
Applied a total of 0 rules in 1 ms. Remains 50 /50 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2024-05-29 08:59:32] [INFO ] Invariant cache hit.
[2024-05-29 08:59:32] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-29 08:59:32] [INFO ] Invariant cache hit.
[2024-05-29 08:59:32] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 130 ms to find 0 implicit places.
Running 72 sub problems to find dead transitions.
[2024-05-29 08:59:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 25/75 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (OVERLAPS) 84/134 variables, 50/125 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (OVERLAPS) 0/134 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Real declared 134/134 variables, and 125 constraints, problems are : Problem set: 0 solved, 72 unsolved in 679 ms.
Refiners :[Domain max(s): 50/50 constraints, Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 50/50 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 72 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 25/75 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (OVERLAPS) 84/134 variables, 50/125 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 72/197 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (OVERLAPS) 0/134 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Int declared 134/134 variables, and 197 constraints, problems are : Problem set: 0 solved, 72 unsolved in 3013 ms.
Refiners :[Domain max(s): 50/50 constraints, Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 50/50 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 0/0 constraints]
After SMT, in 3720ms problems are : Problem set: 0 solved, 72 unsolved
Search for dead transitions found 0 dead transitions in 3721ms
Finished structural reductions in LTL mode , in 1 iterations and 3853 ms. Remains : 50/50 places, 84/84 transitions.
Stuttering acceptance computed with spot in 184 ms :[(OR (NOT p0) (NOT p2)), (NOT p2), (AND p1 (NOT p2)), (OR (AND (NOT p0) p1) (AND p1 (NOT p2)))]
Running random walk in product with property : Solitaire-PT-SqrNC5x5-LTLFireability-15
Stuttering criterion allowed to conclude after 28 steps with 0 reset in 0 ms.
FORMULA Solitaire-PT-SqrNC5x5-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Solitaire-PT-SqrNC5x5-LTLFireability-15 finished in 4060 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(((p0 U G(p1))||G(F((p2&&X(p3)))))))'
Found a Shortening insensitive property : Solitaire-PT-SqrNC5x5-LTLFireability-00
Stuttering acceptance computed with spot in 125 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3))]
Support contains 8 out of 50 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 50/50 places, 84/84 transitions.
Applied a total of 0 rules in 2 ms. Remains 50 /50 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2024-05-29 08:59:36] [INFO ] Invariant cache hit.
[2024-05-29 08:59:36] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-29 08:59:36] [INFO ] Invariant cache hit.
[2024-05-29 08:59:36] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 123 ms to find 0 implicit places.
Running 72 sub problems to find dead transitions.
[2024-05-29 08:59:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 25/75 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (OVERLAPS) 84/134 variables, 50/125 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (OVERLAPS) 0/134 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Real declared 134/134 variables, and 125 constraints, problems are : Problem set: 0 solved, 72 unsolved in 691 ms.
Refiners :[Domain max(s): 50/50 constraints, Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 50/50 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 72 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 25/75 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (OVERLAPS) 84/134 variables, 50/125 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 72/197 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (OVERLAPS) 0/134 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Int declared 134/134 variables, and 197 constraints, problems are : Problem set: 0 solved, 72 unsolved in 3010 ms.
Refiners :[Domain max(s): 50/50 constraints, Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 50/50 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 0/0 constraints]
After SMT, in 3726ms problems are : Problem set: 0 solved, 72 unsolved
Search for dead transitions found 0 dead transitions in 3728ms
Finished structural reductions in LI_LTL mode , in 1 iterations and 3853 ms. Remains : 50/50 places, 84/84 transitions.
Running random walk in product with property : Solitaire-PT-SqrNC5x5-LTLFireability-00
Product exploration explored 100000 steps with 26728 reset in 246 ms.
Product exploration explored 100000 steps with 26596 reset in 255 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) p2 p3), (X p2), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p1 p2))), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (X (NOT (AND p1 (NOT p2) (NOT p3)))), (X (NOT (AND p1 p2 (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND p1 p2 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(X p3), (X (NOT p3)), (X (AND (NOT p1) p2 (NOT p3))), (X (NOT (AND (NOT p1) p2 (NOT p3)))), (X (X p2)), (X (X (NOT p2))), (X (X p3)), (X (X (NOT p3))), (X (X (AND (NOT p1) p2 (NOT p3)))), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND p1 p2))), (X (X (NOT (AND p1 p2)))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 14 factoid took 731 ms. Reduced automaton from 3 states, 11 edges and 3 AP (stutter sensitive) to 3 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 139 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3))]
RANDOM walk for 40000 steps (1817 resets) in 167 ms. (238 steps per ms) remains 2/11 properties
BEST_FIRST walk for 40004 steps (153 resets) in 49 ms. (800 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (152 resets) in 40 ms. (975 steps per ms) remains 2/2 properties
[2024-05-29 08:59:41] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 8/16 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 8/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 60/76 variables, 16/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/76 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 58/134 variables, 34/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/134 variables, 34/108 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/134 variables, 17/125 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/134 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/134 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 134/134 variables, and 125 constraints, problems are : Problem set: 0 solved, 2 unsolved in 58 ms.
Refiners :[Domain max(s): 50/50 constraints, Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 50/50 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Problem apf6 is UNSAT
Problem apf9 is UNSAT
After SMT solving in domain Int declared 8/134 variables, and 8 constraints, problems are : Problem set: 2 solved, 0 unsolved in 14 ms.
Refiners :[Domain max(s): 8/50 constraints, Positive P Invariants (semi-flows): 0/25 constraints, State Equation: 0/50 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 76ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p2 p3), (X p2), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p1 p2))), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (X (NOT (AND p1 (NOT p2) (NOT p3)))), (X (NOT (AND p1 p2 (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND p1 p2 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (G (OR p1 p2 p3)), (G (OR p1 p2))]
False Knowledge obtained : [(X p3), (X (NOT p3)), (X (AND (NOT p1) p2 (NOT p3))), (X (NOT (AND (NOT p1) p2 (NOT p3)))), (X (X p2)), (X (X (NOT p2))), (X (X p3)), (X (X (NOT p3))), (X (X (AND (NOT p1) p2 (NOT p3)))), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND p1 p2))), (X (X (NOT (AND p1 p2)))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR (NOT p1) (NOT p2)))), (F (NOT (OR (NOT p1) p2))), (F (NOT (AND (NOT p1) p2))), (F (NOT p2)), (F (NOT (OR p1 (NOT p2) p3))), (F (NOT p3)), (F (NOT (OR (NOT p1) (NOT p2) p3))), (F p1), (F (NOT (OR (NOT p1) p2 p3)))]
Knowledge based reduction with 16 factoid took 1051 ms. Reduced automaton from 3 states, 11 edges and 3 AP (stutter sensitive) to 3 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 133 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3))]
Support contains 8 out of 50 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 50/50 places, 84/84 transitions.
Applied a total of 0 rules in 3 ms. Remains 50 /50 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2024-05-29 08:59:43] [INFO ] Invariant cache hit.
[2024-05-29 08:59:43] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-05-29 08:59:43] [INFO ] Invariant cache hit.
[2024-05-29 08:59:43] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
Running 72 sub problems to find dead transitions.
[2024-05-29 08:59:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 25/75 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (OVERLAPS) 84/134 variables, 50/125 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (OVERLAPS) 0/134 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Real declared 134/134 variables, and 125 constraints, problems are : Problem set: 0 solved, 72 unsolved in 685 ms.
Refiners :[Domain max(s): 50/50 constraints, Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 50/50 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 72 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 25/75 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (OVERLAPS) 84/134 variables, 50/125 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 72/197 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (OVERLAPS) 0/134 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Int declared 134/134 variables, and 197 constraints, problems are : Problem set: 0 solved, 72 unsolved in 2898 ms.
Refiners :[Domain max(s): 50/50 constraints, Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 50/50 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 0/0 constraints]
After SMT, in 3609ms problems are : Problem set: 0 solved, 72 unsolved
Search for dead transitions found 0 dead transitions in 3611ms
Finished structural reductions in LTL mode , in 1 iterations and 3736 ms. Remains : 50/50 places, 84/84 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 p1) p2 p3), (X p2), (X (NOT (AND (NOT p2) (NOT p3)))), (X (NOT (AND p1 p2 (NOT p3)))), (X (NOT p1)), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND p1 p2 (NOT p3)))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p3))), (X (NOT (AND (NOT p1) (NOT p3)))), (X p3), (X (NOT p3)), (X (X (AND (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT p2))), (X (X p2)), (X (X p3)), (X (X (NOT p3))), (X (X (AND p1 p2))), (X (X (NOT (AND p1 p2)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 7 factoid took 604 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter sensitive) to 3 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 145 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3))]
RANDOM walk for 7535 steps (338 resets) in 46 ms. (160 steps per ms) remains 0/7 properties
Knowledge obtained : [(AND (NOT p1) p2 p3), (X p2), (X (NOT (AND (NOT p2) (NOT p3)))), (X (NOT (AND p1 p2 (NOT p3)))), (X (NOT p1)), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND p1 p2 (NOT p3)))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p3))), (X (NOT (AND (NOT p1) (NOT p3)))), (X p3), (X (NOT p3)), (X (X (AND (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT p2))), (X (X p2)), (X (X p3)), (X (X (NOT p3))), (X (X (AND p1 p2))), (X (X (NOT (AND p1 p2)))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR p3 p1))), (F (NOT (OR p3 p2))), (F p1), (F (NOT (OR (NOT p2) (NOT p1)))), (F (NOT p2)), (F (NOT (OR p3 (NOT p2) (NOT p1)))), (F (NOT p3))]
Knowledge based reduction with 7 factoid took 677 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter sensitive) to 3 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 230 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 141 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3))]
Product exploration explored 100000 steps with 26843 reset in 229 ms.
Product exploration explored 100000 steps with 26684 reset in 237 ms.
Built C files in :
/tmp/ltsmin11996894608000810258
[2024-05-29 08:59:49] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11996894608000810258
Running compilation step : cd /tmp/ltsmin11996894608000810258;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 212 ms.
Running link step : cd /tmp/ltsmin11996894608000810258;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin11996894608000810258;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased2280299920258366233.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 8 out of 50 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 50/50 places, 84/84 transitions.
Applied a total of 0 rules in 1 ms. Remains 50 /50 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2024-05-29 09:00:04] [INFO ] Invariant cache hit.
[2024-05-29 09:00:04] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-29 09:00:04] [INFO ] Invariant cache hit.
[2024-05-29 09:00:04] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 130 ms to find 0 implicit places.
Running 72 sub problems to find dead transitions.
[2024-05-29 09:00:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 25/75 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (OVERLAPS) 84/134 variables, 50/125 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (OVERLAPS) 0/134 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Real declared 134/134 variables, and 125 constraints, problems are : Problem set: 0 solved, 72 unsolved in 690 ms.
Refiners :[Domain max(s): 50/50 constraints, Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 50/50 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 72 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 25/75 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (OVERLAPS) 84/134 variables, 50/125 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 72/197 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (OVERLAPS) 0/134 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Int declared 134/134 variables, and 197 constraints, problems are : Problem set: 0 solved, 72 unsolved in 2967 ms.
Refiners :[Domain max(s): 50/50 constraints, Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 50/50 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 0/0 constraints]
After SMT, in 3685ms problems are : Problem set: 0 solved, 72 unsolved
Search for dead transitions found 0 dead transitions in 3686ms
Finished structural reductions in LTL mode , in 1 iterations and 3817 ms. Remains : 50/50 places, 84/84 transitions.
Built C files in :
/tmp/ltsmin7074587681037056110
[2024-05-29 09:00:08] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7074587681037056110
Running compilation step : cd /tmp/ltsmin7074587681037056110;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 223 ms.
Running link step : cd /tmp/ltsmin7074587681037056110;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin7074587681037056110;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15253822727179887016.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 09:00:23] [INFO ] Flatten gal took : 5 ms
[2024-05-29 09:00:23] [INFO ] Flatten gal took : 4 ms
[2024-05-29 09:00:23] [INFO ] Time to serialize gal into /tmp/LTL18031761201072960843.gal : 1 ms
[2024-05-29 09:00:23] [INFO ] Time to serialize properties into /tmp/LTL445013295720373551.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18031761201072960843.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4938125671360580207.hoa' '-atoms' '/tmp/LTL445013295720373551.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL445013295720373551.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4938125671360580207.hoa
Detected timeout of ITS tools.
[2024-05-29 09:00:38] [INFO ] Flatten gal took : 9 ms
[2024-05-29 09:00:38] [INFO ] Flatten gal took : 4 ms
[2024-05-29 09:00:38] [INFO ] Time to serialize gal into /tmp/LTL10615084535613803832.gal : 1 ms
[2024-05-29 09:00:38] [INFO ] Time to serialize properties into /tmp/LTL1036833172628146398.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10615084535613803832.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1036833172628146398.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F((("((F53==1)&&(T63==1))")U(G("(((F44==1)&&(T45==1))&&(T46==1))")))||(G(F(("((((F44==0)||(T45==0))||((T46==0)||(T32==0)))||((T33==...206
Formula 0 simplified : G((!"((F53==1)&&(T63==1))" R F!"(((F44==1)&&(T45==1))&&(T46==1))") & FG(!"((((F44==0)||(T45==0))||((T46==0)||(T32==0)))||((T33==0)||...195
Detected timeout of ITS tools.
[2024-05-29 09:00:53] [INFO ] Flatten gal took : 4 ms
[2024-05-29 09:00:53] [INFO ] Applying decomposition
[2024-05-29 09:00:53] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph2551858238716519027.txt' '-o' '/tmp/graph2551858238716519027.bin' '-w' '/tmp/graph2551858238716519027.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2551858238716519027.bin' '-l' '-1' '-v' '-w' '/tmp/graph2551858238716519027.weights' '-q' '0' '-e' '0.001'
[2024-05-29 09:00:53] [INFO ] Decomposing Gal with order
[2024-05-29 09:00:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 09:00:53] [INFO ] Removed a total of 178 redundant transitions.
[2024-05-29 09:00:53] [INFO ] Flatten gal took : 6 ms
[2024-05-29 09:00:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-29 09:00:53] [INFO ] Time to serialize gal into /tmp/LTL1064273981371575309.gal : 1 ms
[2024-05-29 09:00:53] [INFO ] Time to serialize properties into /tmp/LTL7191172358144670724.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1064273981371575309.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7191172358144670724.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((F((("((i0.i0.u1.F53==1)&&(i0.i0.u18.T63==1))")U(G("(((i3.u11.F44==1)&&(i2.i1.u14.T45==1))&&(i2.i1.u20.T46==1))")))||(G(F(("((((i3.u...322
Formula 0 simplified : G((!"((i0.i0.u1.F53==1)&&(i0.i0.u18.T63==1))" R F!"(((i3.u11.F44==1)&&(i2.i1.u14.T45==1))&&(i2.i1.u20.T46==1))") & FG(!"((((i3.u11.F...311
Detected timeout of ITS tools.
Treatment of property Solitaire-PT-SqrNC5x5-LTLFireability-00 finished in 92509 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(((X(p1)&&G(p2))||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((p0||X((p1||G(F(p2)))))))'
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))||F(p1)))'
Found a Lengthening insensitive property : Solitaire-PT-SqrNC5x5-LTLFireability-07
Stuttering acceptance computed with spot in 103 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 50 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 50/50 places, 84/84 transitions.
Applied a total of 0 rules in 5 ms. Remains 50 /50 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2024-05-29 09:01:09] [INFO ] Invariant cache hit.
[2024-05-29 09:01:09] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-29 09:01:09] [INFO ] Invariant cache hit.
[2024-05-29 09:01:09] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
Running 72 sub problems to find dead transitions.
[2024-05-29 09:01:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 25/75 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (OVERLAPS) 84/134 variables, 50/125 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (OVERLAPS) 0/134 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Real declared 134/134 variables, and 125 constraints, problems are : Problem set: 0 solved, 72 unsolved in 677 ms.
Refiners :[Domain max(s): 50/50 constraints, Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 50/50 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 72 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 25/75 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (OVERLAPS) 84/134 variables, 50/125 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 72/197 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (OVERLAPS) 0/134 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Int declared 134/134 variables, and 197 constraints, problems are : Problem set: 0 solved, 72 unsolved in 2999 ms.
Refiners :[Domain max(s): 50/50 constraints, Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 50/50 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 0/0 constraints]
After SMT, in 3701ms problems are : Problem set: 0 solved, 72 unsolved
Search for dead transitions found 0 dead transitions in 3702ms
Finished structural reductions in LI_LTL mode , in 1 iterations and 3824 ms. Remains : 50/50 places, 84/84 transitions.
Running random walk in product with property : Solitaire-PT-SqrNC5x5-LTLFireability-07
Product exploration explored 100000 steps with 14015 reset in 271 ms.
Product exploration explored 100000 steps with 13978 reset in 277 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 p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT p0))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (NOT p1)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (X (X (NOT p1))), (X (X p1))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 305 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 58 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 17 steps (0 resets) in 5 ms. (2 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT p0))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (NOT p1)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (X (X (NOT p1))), (X (X p1)), (F p1)]
Knowledge based reduction with 3 factoid took 393 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 84 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p1), (NOT p1)]
[2024-05-29 09:01:14] [INFO ] Invariant cache hit.
[2024-05-29 09:01:14] [INFO ] [Real]Absence check using 25 positive place invariants in 4 ms returned sat
[2024-05-29 09:01:14] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-05-29 09:01:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 09:01:14] [INFO ] [Nat]Absence check using 25 positive place invariants in 3 ms returned sat
[2024-05-29 09:01:14] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2024-05-29 09:01:14] [INFO ] Computed and/alt/rep : 72/484/72 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-29 09:01:14] [INFO ] Added : 19 causal constraints over 4 iterations in 78 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 2 out of 50 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 : 50/50 places, 84/84 transitions.
Applied a total of 0 rules in 8 ms. Remains 50 /50 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2024-05-29 09:01:14] [INFO ] Invariant cache hit.
[2024-05-29 09:01:14] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-29 09:01:14] [INFO ] Invariant cache hit.
[2024-05-29 09:01:14] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
[2024-05-29 09:01:14] [INFO ] Redundant transitions in 1 ms returned []
Running 72 sub problems to find dead transitions.
[2024-05-29 09:01:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 25/75 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (OVERLAPS) 84/134 variables, 50/125 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (OVERLAPS) 0/134 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Real declared 134/134 variables, and 125 constraints, problems are : Problem set: 0 solved, 72 unsolved in 670 ms.
Refiners :[Domain max(s): 50/50 constraints, Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 50/50 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 72 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 25/75 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (OVERLAPS) 84/134 variables, 50/125 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 72/197 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (OVERLAPS) 0/134 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Int declared 134/134 variables, and 197 constraints, problems are : Problem set: 0 solved, 72 unsolved in 2985 ms.
Refiners :[Domain max(s): 50/50 constraints, Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 50/50 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 0/0 constraints]
After SMT, in 3685ms problems are : Problem set: 0 solved, 72 unsolved
Search for dead transitions found 0 dead transitions in 3686ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 3812 ms. Remains : 50/50 places, 84/84 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 117 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 82 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 22 steps (0 resets) in 4 ms. (4 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 226 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 87 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 87 ms :[(NOT p1), (NOT p1)]
[2024-05-29 09:01:19] [INFO ] Invariant cache hit.
[2024-05-29 09:01:19] [INFO ] [Real]Absence check using 25 positive place invariants in 4 ms returned sat
[2024-05-29 09:01:19] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2024-05-29 09:01:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 09:01:19] [INFO ] [Nat]Absence check using 25 positive place invariants in 3 ms returned sat
[2024-05-29 09:01:19] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2024-05-29 09:01:19] [INFO ] Computed and/alt/rep : 72/484/72 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-29 09:01:19] [INFO ] Added : 19 causal constraints over 4 iterations in 70 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 70 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 13952 reset in 257 ms.
Product exploration explored 100000 steps with 14022 reset in 276 ms.
Built C files in :
/tmp/ltsmin15344160853087222238
[2024-05-29 09:01:19] [INFO ] Computing symmetric may disable matrix : 84 transitions.
[2024-05-29 09:01:19] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 09:01:19] [INFO ] Computing symmetric may enable matrix : 84 transitions.
[2024-05-29 09:01:19] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 09:01:19] [INFO ] Computing Do-Not-Accords matrix : 84 transitions.
[2024-05-29 09:01:19] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 09:01:19] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15344160853087222238
Running compilation step : cd /tmp/ltsmin15344160853087222238;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 233 ms.
Running link step : cd /tmp/ltsmin15344160853087222238;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin15344160853087222238;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4924859671353168514.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 50 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 50/50 places, 84/84 transitions.
Applied a total of 0 rules in 10 ms. Remains 50 /50 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2024-05-29 09:01:35] [INFO ] Invariant cache hit.
[2024-05-29 09:01:35] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-29 09:01:35] [INFO ] Invariant cache hit.
[2024-05-29 09:01:35] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 132 ms to find 0 implicit places.
[2024-05-29 09:01:35] [INFO ] Redundant transitions in 0 ms returned []
Running 72 sub problems to find dead transitions.
[2024-05-29 09:01:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 25/75 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (OVERLAPS) 84/134 variables, 50/125 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (OVERLAPS) 0/134 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Real declared 134/134 variables, and 125 constraints, problems are : Problem set: 0 solved, 72 unsolved in 679 ms.
Refiners :[Domain max(s): 50/50 constraints, Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 50/50 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 72 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 25/75 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (OVERLAPS) 84/134 variables, 50/125 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 72/197 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (OVERLAPS) 0/134 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Int declared 134/134 variables, and 197 constraints, problems are : Problem set: 0 solved, 72 unsolved in 2974 ms.
Refiners :[Domain max(s): 50/50 constraints, Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 50/50 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 0/0 constraints]
After SMT, in 3681ms problems are : Problem set: 0 solved, 72 unsolved
Search for dead transitions found 0 dead transitions in 3682ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 3829 ms. Remains : 50/50 places, 84/84 transitions.
Built C files in :
/tmp/ltsmin4905210439999520475
[2024-05-29 09:01:38] [INFO ] Computing symmetric may disable matrix : 84 transitions.
[2024-05-29 09:01:38] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 09:01:38] [INFO ] Computing symmetric may enable matrix : 84 transitions.
[2024-05-29 09:01:38] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 09:01:38] [INFO ] Computing Do-Not-Accords matrix : 84 transitions.
[2024-05-29 09:01:38] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 09:01:38] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4905210439999520475
Running compilation step : cd /tmp/ltsmin4905210439999520475;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 230 ms.
Running link step : cd /tmp/ltsmin4905210439999520475;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin4905210439999520475;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased17272112122027775429.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 09:01:53] [INFO ] Flatten gal took : 4 ms
[2024-05-29 09:01:53] [INFO ] Flatten gal took : 4 ms
[2024-05-29 09:01:53] [INFO ] Time to serialize gal into /tmp/LTL1455032907518462769.gal : 1 ms
[2024-05-29 09:01:53] [INFO ] Time to serialize properties into /tmp/LTL17874361864245927952.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1455032907518462769.gal' '-t' 'CGAL' '-hoa' '/tmp/aut18139154828181110901.hoa' '-atoms' '/tmp/LTL17874361864245927952.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL17874361864245927952.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut18139154828181110901.hoa
Detected timeout of ITS tools.
[2024-05-29 09:02:09] [INFO ] Flatten gal took : 6 ms
[2024-05-29 09:02:09] [INFO ] Flatten gal took : 4 ms
[2024-05-29 09:02:09] [INFO ] Time to serialize gal into /tmp/LTL18374454994542780671.gal : 1 ms
[2024-05-29 09:02:09] [INFO ] Time to serialize properties into /tmp/LTL14869716304064488855.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18374454994542780671.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14869716304064488855.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !(((X(G("((F45==1)&&(T46==1))")))||(F("((T42==0)||(T43==0))"))))
Formula 0 simplified : XF!"((F45==1)&&(T46==1))" & G!"((T42==0)||(T43==0))"
Detected timeout of ITS tools.
[2024-05-29 09:02:24] [INFO ] Flatten gal took : 10 ms
[2024-05-29 09:02:24] [INFO ] Applying decomposition
[2024-05-29 09:02:24] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph4638398094693170054.txt' '-o' '/tmp/graph4638398094693170054.bin' '-w' '/tmp/graph4638398094693170054.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4638398094693170054.bin' '-l' '-1' '-v' '-w' '/tmp/graph4638398094693170054.weights' '-q' '0' '-e' '0.001'
[2024-05-29 09:02:24] [INFO ] Decomposing Gal with order
[2024-05-29 09:02:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 09:02:24] [INFO ] Removed a total of 178 redundant transitions.
[2024-05-29 09:02:24] [INFO ] Flatten gal took : 15 ms
[2024-05-29 09:02:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-29 09:02:24] [INFO ] Time to serialize gal into /tmp/LTL1788117143055973032.gal : 1 ms
[2024-05-29 09:02:24] [INFO ] Time to serialize properties into /tmp/LTL8631396741310705366.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1788117143055973032.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8631396741310705366.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !(((X(G("((i2.i1.u14.F45==1)&&(i2.i1.u20.T46==1))")))||(F("((i0.i1.u0.T42==0)||(i0.i1.u4.T43==0))"))))
Formula 0 simplified : XF!"((i2.i1.u14.F45==1)&&(i2.i1.u20.T46==1))" & G!"((i0.i1.u0.T42==0)||(i0.i1.u4.T43==0))"
Detected timeout of ITS tools.
Treatment of property Solitaire-PT-SqrNC5x5-LTLFireability-07 finished in 90307 ms.
[2024-05-29 09:02:39] [INFO ] Flatten gal took : 10 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin9132536645474381004
[2024-05-29 09:02:39] [INFO ] Applying decomposition
[2024-05-29 09:02:39] [INFO ] Computing symmetric may disable matrix : 84 transitions.
[2024-05-29 09:02:39] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 09:02:39] [INFO ] Computing symmetric may enable matrix : 84 transitions.
[2024-05-29 09:02:39] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 09:02:39] [INFO ] Flatten gal took : 3 ms
[2024-05-29 09:02:39] [INFO ] Computing Do-Not-Accords matrix : 84 transitions.
[2024-05-29 09:02:39] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 09:02:39] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9132536645474381004
Running compilation step : cd /tmp/ltsmin9132536645474381004;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '180' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph11167096493251181884.txt' '-o' '/tmp/graph11167096493251181884.bin' '-w' '/tmp/graph11167096493251181884.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11167096493251181884.bin' '-l' '-1' '-v' '-w' '/tmp/graph11167096493251181884.weights' '-q' '0' '-e' '0.001'
[2024-05-29 09:02:39] [INFO ] Decomposing Gal with order
[2024-05-29 09:02:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 09:02:39] [INFO ] Removed a total of 178 redundant transitions.
[2024-05-29 09:02:39] [INFO ] Flatten gal took : 6 ms
[2024-05-29 09:02:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-29 09:02:39] [INFO ] Time to serialize gal into /tmp/LTLFireability16794672375581589780.gal : 2 ms
[2024-05-29 09:02:39] [INFO ] Time to serialize properties into /tmp/LTLFireability17295203155783145434.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability16794672375581589780.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability17295203155783145434.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 4 LTL properties
Checking formula 0 : !((F((("((i4.i0.u1.F53==1)&&(i4.i0.u18.T63==1))")U(G("(((i0.u11.F44==1)&&(i3.i0.u14.T45==1))&&(i3.i0.u20.T46==1))")))||(G(F(("((((i0.u...319
Formula 0 simplified : G((!"((i4.i0.u1.F53==1)&&(i4.i0.u18.T63==1))" R F!"(((i0.u11.F44==1)&&(i3.i0.u14.T45==1))&&(i3.i0.u20.T46==1))") & FG(!"((((i0.u11.F...308
Compilation finished in 223 ms.
Running link step : cd /tmp/ltsmin9132536645474381004;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 25 ms.
Running LTSmin : cd /tmp/ltsmin9132536645474381004;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>((((LTLAPp0==true) U []((LTLAPp1==true)))||[](<>(((LTLAPp2==true)&&X((LTLAPp3==true)))))))' '--buchi-type=spotba'
LTSmin run took 156325 ms.
FORMULA Solitaire-PT-SqrNC5x5-LTLFireability-00 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin9132536645474381004;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>(((X((LTLAPp5==true))&&[]((LTLAPp6==true)))||(LTLAPp4==true))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t6, t7, t10, t11, t12, t13, t16, t17, t18, t19, t20, t21, t22, t23, t24, t25, t26, t2...737
Computing Next relation with stutter on 504 deadlock states
LTSmin run took 103186 ms.
FORMULA Solitaire-PT-SqrNC5x5-LTLFireability-03 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin9132536645474381004;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(((LTLAPp7==true)||X(((LTLAPp8==true)||[](<>((LTLAPp9==true)))))))' '--buchi-type=spotba'
LTSmin run took 108427 ms.
FORMULA Solitaire-PT-SqrNC5x5-LTLFireability-05 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin9132536645474381004;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(X([]((LTLAPp6==true)))||<>((LTLAPp10==true)))' '--buchi-type=spotba'
LTSmin run took 160780 ms.
FORMULA Solitaire-PT-SqrNC5x5-LTLFireability-07 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 1146929 ms.
BK_STOP 1716973888310
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Solitaire-PT-SqrNC5x5"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is Solitaire-PT-SqrNC5x5, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r400-tall-171690531500044"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Solitaire-PT-SqrNC5x5.tgz
mv Solitaire-PT-SqrNC5x5 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;