About the Execution of ITS-Tools for Sudoku-PT-AN09
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16205.016 | 3318188.00 | 8787327.00 | 5638.60 | FTT??TFTTFTTFFTF | 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-171690532800635.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 Sudoku-PT-AN09, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r400-tall-171690532800635
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 25M
-rw-r--r-- 1 mcc users 237K Apr 12 10:35 CTLCardinality.txt
-rw-r--r-- 1 mcc users 1.1M Apr 12 10:35 CTLCardinality.xml
-rw-r--r-- 1 mcc users 769K Apr 12 10:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 3.7M Apr 12 10:07 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 205K Apr 23 08:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 691K Apr 23 08:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 367K Apr 23 08:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 1.4M Apr 23 08:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 549K Apr 12 11:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 2.6M Apr 12 11:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.1M Apr 12 10:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 11M Apr 12 10:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 28K Apr 23 08:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 70K Apr 23 08:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 416K 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 Sudoku-PT-AN09-LTLCardinality-00
FORMULA_NAME Sudoku-PT-AN09-LTLCardinality-01
FORMULA_NAME Sudoku-PT-AN09-LTLCardinality-02
FORMULA_NAME Sudoku-PT-AN09-LTLCardinality-03
FORMULA_NAME Sudoku-PT-AN09-LTLCardinality-04
FORMULA_NAME Sudoku-PT-AN09-LTLCardinality-05
FORMULA_NAME Sudoku-PT-AN09-LTLCardinality-06
FORMULA_NAME Sudoku-PT-AN09-LTLCardinality-07
FORMULA_NAME Sudoku-PT-AN09-LTLCardinality-08
FORMULA_NAME Sudoku-PT-AN09-LTLCardinality-09
FORMULA_NAME Sudoku-PT-AN09-LTLCardinality-10
FORMULA_NAME Sudoku-PT-AN09-LTLCardinality-11
FORMULA_NAME Sudoku-PT-AN09-LTLCardinality-12
FORMULA_NAME Sudoku-PT-AN09-LTLCardinality-13
FORMULA_NAME Sudoku-PT-AN09-LTLCardinality-14
FORMULA_NAME Sudoku-PT-AN09-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1717053329301
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Sudoku-PT-AN09
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-05-30 07:15:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-30 07:15:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 07:15:30] [INFO ] Load time of PNML (sax parser for PT used): 123 ms
[2024-05-30 07:15:30] [INFO ] Transformed 972 places.
[2024-05-30 07:15:30] [INFO ] Transformed 729 transitions.
[2024-05-30 07:15:30] [INFO ] Found NUPN structural information;
[2024-05-30 07:15:30] [INFO ] Parsed PT model containing 972 places and 729 transitions and 2916 arcs in 230 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 48 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA Sudoku-PT-AN09-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN09-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN09-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN09-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN09-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 895 out of 972 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 972/972 places, 729/729 transitions.
Applied a total of 0 rules in 26 ms. Remains 972 /972 variables (removed 0) and now considering 729/729 (removed 0) transitions.
// Phase 1: matrix 729 rows 972 cols
[2024-05-30 07:15:30] [INFO ] Computed 243 invariants in 26 ms
[2024-05-30 07:15:31] [INFO ] Implicit Places using invariants in 672 ms returned []
[2024-05-30 07:15:31] [INFO ] Invariant cache hit.
[2024-05-30 07:15:32] [INFO ] Implicit Places using invariants and state equation in 924 ms returned []
Implicit Place search using SMT with State Equation took 1626 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 1ms
Finished structural reductions in LTL mode , in 1 iterations and 1671 ms. Remains : 972/972 places, 729/729 transitions.
Support contains 895 out of 972 places after structural reductions.
[2024-05-30 07:15:32] [INFO ] Flatten gal took : 110 ms
[2024-05-30 07:15:32] [INFO ] Flatten gal took : 71 ms
[2024-05-30 07:15:33] [INFO ] Input system was already deterministic with 729 transitions.
RANDOM walk for 40000 steps (566 resets) in 3793 ms. (10 steps per ms) remains 5/18 properties
BEST_FIRST walk for 40004 steps (8 resets) in 336 ms. (118 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 387 ms. (103 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 374 ms. (106 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 354 ms. (112 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1046 ms. (38 steps per ms) remains 5/5 properties
[2024-05-30 07:15:35] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/891 variables, 891/891 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp9 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/891 variables, 162/1053 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/891 variables, 0/1053 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 81/972 variables, 81/1134 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/972 variables, 81/1215 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/972 variables, 0/1215 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 729/1701 variables, 972/2187 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1701 variables, 0/2187 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/1701 variables, 0/2187 constraints. Problems are: Problem set: 2 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1701/1701 variables, and 2187 constraints, problems are : Problem set: 2 solved, 3 unsolved in 1839 ms.
Refiners :[Domain max(s): 972/972 constraints, Positive P Invariants (semi-flows): 243/243 constraints, State Equation: 972/972 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 162/162 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/162 variables, 0/162 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 729/891 variables, 162/324 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/891 variables, 729/1053 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/891 variables, 0/1053 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 81/972 variables, 81/1134 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/972 variables, 81/1215 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/972 variables, 0/1215 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 729/1701 variables, 972/2187 constraints. Problems are: Problem set: 2 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1701/1701 variables, and 2190 constraints, problems are : Problem set: 2 solved, 3 unsolved in 4234 ms.
Refiners :[Domain max(s): 972/972 constraints, Positive P Invariants (semi-flows): 243/243 constraints, State Equation: 972/972 constraints, PredecessorRefiner: 3/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 6583ms problems are : Problem set: 2 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 162 out of 972 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 972/972 places, 729/729 transitions.
Graph (complete) has 2187 edges and 972 vertex of which 243 are kept as prefixes of interest. Removing 729 places using SCC suffix rule.2 ms
Discarding 729 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 27 ms. Remains 243 /972 variables (removed 729) and now considering 729/729 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 243/972 places, 729/729 transitions.
RANDOM walk for 40000 steps (565 resets) in 2736 ms. (14 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 234 ms. (170 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 224 ms. (177 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 229 ms. (173 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 386954 steps, run timeout after 3001 ms. (steps per millisecond=128 ) properties seen :0 out of 3
Probabilistic random walk after 386954 steps, saw 94437 distinct states, run finished after 3004 ms. (steps per millisecond=128 ) properties seen :0
// Phase 1: matrix 729 rows 243 cols
[2024-05-30 07:15:45] [INFO ] Computed 26 invariants in 29 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 162/162 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/162 variables, 4/166 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/162 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 81/243 variables, 22/188 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/243 variables, 81/269 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/243 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 729/972 variables, 243/512 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/972 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/972 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 972/972 variables, and 512 constraints, problems are : Problem set: 0 solved, 3 unsolved in 402 ms.
Refiners :[Domain max(s): 243/243 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 162/162 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/162 variables, 4/166 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/162 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 81/243 variables, 22/188 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/243 variables, 81/269 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/243 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 729/972 variables, 243/512 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/972 variables, 3/515 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 972/972 variables, and 515 constraints, problems are : Problem set: 0 solved, 3 unsolved in 42453 ms.
Refiners :[Domain max(s): 243/243 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 42960ms problems are : Problem set: 0 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 162 out of 243 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 243/243 places, 729/729 transitions.
Applied a total of 0 rules in 20 ms. Remains 243 /243 variables (removed 0) and now considering 729/729 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 243/243 places, 729/729 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 243/243 places, 729/729 transitions.
Applied a total of 0 rules in 7 ms. Remains 243 /243 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2024-05-30 07:16:28] [INFO ] Invariant cache hit.
[2024-05-30 07:16:28] [INFO ] Implicit Places using invariants in 300 ms returned []
[2024-05-30 07:16:28] [INFO ] Invariant cache hit.
[2024-05-30 07:16:29] [INFO ] Implicit Places using invariants and state equation in 690 ms returned []
Implicit Place search using SMT with State Equation took 995 ms to find 0 implicit places.
[2024-05-30 07:16:29] [INFO ] Redundant transitions in 35 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 1ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1048 ms. Remains : 243/243 places, 729/729 transitions.
Successfully simplified 2 atomic propositions for a total of 11 simplifications.
Computed a total of 972 stabilizing places and 729 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 972 transition count 729
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
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)))'
Support contains 81 out of 972 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 972/972 places, 729/729 transitions.
Reduce places removed 729 places and 0 transitions.
Iterating post reduction 0 with 729 rules applied. Total rules applied 729 place count 243 transition count 729
Applied a total of 729 rules in 45 ms. Remains 243 /972 variables (removed 729) and now considering 729/729 (removed 0) transitions.
[2024-05-30 07:16:29] [INFO ] Invariant cache hit.
[2024-05-30 07:16:30] [INFO ] Implicit Places using invariants in 384 ms returned []
[2024-05-30 07:16:30] [INFO ] Invariant cache hit.
[2024-05-30 07:16:31] [INFO ] Implicit Places using invariants and state equation in 1023 ms returned []
Implicit Place search using SMT with State Equation took 1419 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 1ms
Starting structural reductions in LTL mode, iteration 1 : 243/972 places, 729/729 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1467 ms. Remains : 243/972 places, 729/729 transitions.
Stuttering acceptance computed with spot in 176 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN09-LTLCardinality-00
Product exploration explored 100000 steps with 1418 reset in 4667 ms.
Product exploration explored 100000 steps with 1418 reset in 4644 ms.
Computed a total of 243 stabilizing places and 729 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 243 transition count 729
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 93 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[true, (NOT p0)]
RANDOM walk for 40000 steps (566 resets) in 2258 ms. (17 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 293 ms. (136 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 712165 steps, run timeout after 3001 ms. (steps per millisecond=237 ) properties seen :0 out of 1
Probabilistic random walk after 712165 steps, saw 142071 distinct states, run finished after 3001 ms. (steps per millisecond=237 ) properties seen :0
[2024-05-30 07:16:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 161/242 variables, 25/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/242 variables, 161/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/242 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/243 variables, 1/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/243 variables, 1/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/243 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 729/972 variables, 243/512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/972 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/972 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 972/972 variables, and 512 constraints, problems are : Problem set: 0 solved, 1 unsolved in 264 ms.
Refiners :[Domain max(s): 243/243 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 161/242 variables, 25/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/242 variables, 161/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/242 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/243 variables, 1/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/243 variables, 1/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/243 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 729/972 variables, 243/512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 972/972 variables, and 513 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1276 ms.
Refiners :[Domain max(s): 243/243 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1565ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 81 out of 243 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 243/243 places, 729/729 transitions.
Applied a total of 0 rules in 19 ms. Remains 243 /243 variables (removed 0) and now considering 729/729 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 243/243 places, 729/729 transitions.
RANDOM walk for 40000 steps (566 resets) in 2400 ms. (16 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 251 ms. (158 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 727401 steps, run timeout after 3001 ms. (steps per millisecond=242 ) properties seen :0 out of 1
Probabilistic random walk after 727401 steps, saw 144438 distinct states, run finished after 3001 ms. (steps per millisecond=242 ) properties seen :0
[2024-05-30 07:16:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 161/242 variables, 25/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/242 variables, 161/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/242 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/243 variables, 1/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/243 variables, 1/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/243 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 729/972 variables, 243/512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/972 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/972 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 972/972 variables, and 512 constraints, problems are : Problem set: 0 solved, 1 unsolved in 306 ms.
Refiners :[Domain max(s): 243/243 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 161/242 variables, 25/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/242 variables, 161/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/242 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/243 variables, 1/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/243 variables, 1/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/243 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 729/972 variables, 243/512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/972 variables, 1/513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/972 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/972 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 972/972 variables, and 513 constraints, problems are : Problem set: 0 solved, 1 unsolved in 5577 ms.
Refiners :[Domain max(s): 243/243 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 5910ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 81 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=27 )
Parikh walk visited 1 properties in 9 ms.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 4 factoid took 106 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-PT-AN09-LTLCardinality-00 FALSE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN09-LTLCardinality-00 finished in 29032 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&&X(p0))))'
Support contains 810 out of 972 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 972/972 places, 729/729 transitions.
Applied a total of 0 rules in 39 ms. Remains 972 /972 variables (removed 0) and now considering 729/729 (removed 0) transitions.
// Phase 1: matrix 729 rows 972 cols
[2024-05-30 07:16:58] [INFO ] Computed 243 invariants in 6 ms
[2024-05-30 07:16:59] [INFO ] Implicit Places using invariants in 821 ms returned []
[2024-05-30 07:16:59] [INFO ] Invariant cache hit.
[2024-05-30 07:17:00] [INFO ] Implicit Places using invariants and state equation in 1094 ms returned []
Implicit Place search using SMT with State Equation took 1930 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in LTL mode , in 1 iterations and 1972 ms. Remains : 972/972 places, 729/729 transitions.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN09-LTLCardinality-01
Product exploration explored 100000 steps with 50000 reset in 9471 ms.
Product exploration explored 100000 steps with 50000 reset in 9447 ms.
Computed a total of 972 stabilizing places and 729 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 972 transition count 729
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 80 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-PT-AN09-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN09-LTLCardinality-01 finished in 30617 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(p0)) U X(!p1)))'
Support contains 891 out of 972 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 972/972 places, 729/729 transitions.
Applied a total of 0 rules in 7 ms. Remains 972 /972 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2024-05-30 07:17:29] [INFO ] Invariant cache hit.
[2024-05-30 07:17:30] [INFO ] Implicit Places using invariants in 481 ms returned []
[2024-05-30 07:17:30] [INFO ] Invariant cache hit.
[2024-05-30 07:17:30] [INFO ] Implicit Places using invariants and state equation in 731 ms returned []
Implicit Place search using SMT with State Equation took 1216 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in LTL mode , in 1 iterations and 1225 ms. Remains : 972/972 places, 729/729 transitions.
Stuttering acceptance computed with spot in 128 ms :[p1, (OR (NOT p0) p1), true, p1]
Running random walk in product with property : Sudoku-PT-AN09-LTLCardinality-02
Product exploration explored 100000 steps with 50000 reset in 8076 ms.
Product exploration explored 100000 steps with 50000 reset in 8150 ms.
Computed a total of 972 stabilizing places and 729 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 972 transition count 729
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 20 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-PT-AN09-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN09-LTLCardinality-02 finished in 44830 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&&F(p1))))'
Support contains 891 out of 972 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 972/972 places, 729/729 transitions.
Applied a total of 0 rules in 15 ms. Remains 972 /972 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2024-05-30 07:18:14] [INFO ] Invariant cache hit.
[2024-05-30 07:18:14] [INFO ] Implicit Places using invariants in 499 ms returned []
[2024-05-30 07:18:14] [INFO ] Invariant cache hit.
[2024-05-30 07:18:15] [INFO ] Implicit Places using invariants and state equation in 730 ms returned []
Implicit Place search using SMT with State Equation took 1232 ms to find 0 implicit places.
[2024-05-30 07:18:15] [INFO ] Redundant transitions in 11 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1265 ms. Remains : 972/972 places, 729/729 transitions.
Stuttering acceptance computed with spot in 62 ms :[(NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : Sudoku-PT-AN09-LTLCardinality-03
Product exploration explored 100000 steps with 2380 reset in 8581 ms.
Product exploration explored 100000 steps with 2380 reset in 8653 ms.
Computed a total of 972 stabilizing places and 729 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 972 transition count 729
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) p0), (X (AND p0 (NOT p1))), (X (NOT p1)), (X p0), (X (X (AND p0 (NOT p1)))), (X (X (NOT p1))), (X (X p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 173 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 164 steps (0 resets) in 26 ms. (6 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) p0), (X (AND p0 (NOT p1))), (X (NOT p1)), (X p0), (X (X (AND p0 (NOT p1)))), (X (X (NOT p1))), (X (X p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 9 factoid took 204 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 63 ms :[(NOT p1), (NOT p1)]
[2024-05-30 07:18:53] [INFO ] Invariant cache hit.
[2024-05-30 07:18:55] [INFO ] [Real]Absence check using 243 positive place invariants in 435 ms returned sat
[2024-05-30 07:18:59] [INFO ] [Real]Absence check using state equation in 3511 ms returned sat
[2024-05-30 07:18:59] [INFO ] Solution in real domain found non-integer solution.
Could not prove EG (NOT p1)
Support contains 810 out of 972 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 : 972/972 places, 729/729 transitions.
Applied a total of 0 rules in 19 ms. Remains 972 /972 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2024-05-30 07:19:02] [INFO ] Invariant cache hit.
[2024-05-30 07:19:02] [INFO ] Implicit Places using invariants in 487 ms returned []
[2024-05-30 07:19:02] [INFO ] Invariant cache hit.
[2024-05-30 07:19:03] [INFO ] Implicit Places using invariants and state equation in 772 ms returned []
Implicit Place search using SMT with State Equation took 1262 ms to find 0 implicit places.
[2024-05-30 07:19:03] [INFO ] Redundant transitions in 8 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1306 ms. Remains : 972/972 places, 729/729 transitions.
Computed a total of 972 stabilizing places and 729 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 972 transition count 729
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 106 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 60 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 164 steps (0 resets) in 33 ms. (4 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 4 factoid took 99 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p1), (NOT p1)]
[2024-05-30 07:19:14] [INFO ] Invariant cache hit.
[2024-05-30 07:19:17] [INFO ] [Real]Absence check using 243 positive place invariants in 450 ms returned sat
[2024-05-30 07:19:20] [INFO ] [Real]Absence check using state equation in 3668 ms returned sat
[2024-05-30 07:19:20] [INFO ] Solution in real domain found non-integer solution.
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 59 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 2380 reset in 8736 ms.
Product exploration explored 100000 steps with 2380 reset in 8859 ms.
Built C files in :
/tmp/ltsmin1373838177508644895
[2024-05-30 07:19:41] [INFO ] Computing symmetric may disable matrix : 729 transitions.
[2024-05-30 07:19:41] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 07:19:41] [INFO ] Computing symmetric may enable matrix : 729 transitions.
[2024-05-30 07:19:41] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 07:19:41] [INFO ] Computing Do-Not-Accords matrix : 729 transitions.
[2024-05-30 07:19:41] [INFO ] Computation of Completed DNA matrix. took 22 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 07:19:41] [INFO ] Built C files in 164ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1373838177508644895
Running compilation step : cd /tmp/ltsmin1373838177508644895;'/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 2596 ms.
Running link step : cd /tmp/ltsmin1373838177508644895;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 55 ms.
Running LTSmin : cd /tmp/ltsmin1373838177508644895;'/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/stateBased10573360547213318890.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 810 out of 972 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 972/972 places, 729/729 transitions.
Applied a total of 0 rules in 13 ms. Remains 972 /972 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2024-05-30 07:19:56] [INFO ] Invariant cache hit.
[2024-05-30 07:19:57] [INFO ] Implicit Places using invariants in 1084 ms returned []
[2024-05-30 07:19:57] [INFO ] Invariant cache hit.
[2024-05-30 07:19:58] [INFO ] Implicit Places using invariants and state equation in 1067 ms returned []
Implicit Place search using SMT with State Equation took 2154 ms to find 0 implicit places.
[2024-05-30 07:19:58] [INFO ] Redundant transitions in 4 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2182 ms. Remains : 972/972 places, 729/729 transitions.
Built C files in :
/tmp/ltsmin13861912439360433882
[2024-05-30 07:19:58] [INFO ] Computing symmetric may disable matrix : 729 transitions.
[2024-05-30 07:19:58] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 07:19:58] [INFO ] Computing symmetric may enable matrix : 729 transitions.
[2024-05-30 07:19:58] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 07:19:59] [INFO ] Computing Do-Not-Accords matrix : 729 transitions.
[2024-05-30 07:19:59] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 07:19:59] [INFO ] Built C files in 111ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13861912439360433882
Running compilation step : cd /tmp/ltsmin13861912439360433882;'/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 2376 ms.
Running link step : cd /tmp/ltsmin13861912439360433882;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin13861912439360433882;'/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/stateBased12245620773179279928.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-30 07:20:14] [INFO ] Flatten gal took : 62 ms
[2024-05-30 07:20:14] [INFO ] Flatten gal took : 53 ms
[2024-05-30 07:20:14] [INFO ] Time to serialize gal into /tmp/LTL13340850488321153324.gal : 10 ms
[2024-05-30 07:20:14] [INFO ] Time to serialize properties into /tmp/LTL10587482265152264070.prop : 14 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/LTL13340850488321153324.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14637481721040590168.hoa' '-atoms' '/tmp/LTL10587482265152264070.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/LTL10587482265152264070.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14637481721040590168.hoa
Detected timeout of ITS tools.
[2024-05-30 07:20:29] [INFO ] Flatten gal took : 38 ms
[2024-05-30 07:20:29] [INFO ] Flatten gal took : 38 ms
[2024-05-30 07:20:29] [INFO ] Time to serialize gal into /tmp/LTL17572481507159574846.gal : 6 ms
[2024-05-30 07:20:29] [INFO ] Time to serialize properties into /tmp/LTL4196172918395548838.ltl : 4 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/LTL17572481507159574846.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4196172918395548838.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(("((((((((Rows_0_0+Rows_0_1)+(Rows_0_2+Rows_0_3))+((Rows_0_4+Rows_0_5)+(Rows_0_6+Rows_0_7)))+(((Rows_0_8+Rows_1_0)+(Rows_1_1+Rows...12272
Formula 0 simplified : G(!"((((((((Rows_0_0+Rows_0_1)+(Rows_0_2+Rows_0_3))+((Rows_0_4+Rows_0_5)+(Rows_0_6+Rows_0_7)))+(((Rows_0_8+Rows_1_0)+(Rows_1_1+Rows_...12266
Detected timeout of ITS tools.
[2024-05-30 07:20:44] [INFO ] Flatten gal took : 33 ms
[2024-05-30 07:20:44] [INFO ] Applying decomposition
[2024-05-30 07:20:44] [INFO ] Flatten gal took : 33 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/graph7750075495657395478.txt' '-o' '/tmp/graph7750075495657395478.bin' '-w' '/tmp/graph7750075495657395478.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7750075495657395478.bin' '-l' '-1' '-v' '-w' '/tmp/graph7750075495657395478.weights' '-q' '0' '-e' '0.001'
[2024-05-30 07:20:45] [INFO ] Decomposing Gal with order
[2024-05-30 07:20:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 07:20:46] [INFO ] Removed a total of 648 redundant transitions.
[2024-05-30 07:20:46] [INFO ] Flatten gal took : 616 ms
[2024-05-30 07:20:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 729 labels/synchronizations in 47 ms.
[2024-05-30 07:20:46] [INFO ] Time to serialize gal into /tmp/LTL6455078931130274374.gal : 8 ms
[2024-05-30 07:20:46] [INFO ] Time to serialize properties into /tmp/LTL16236624514521082220.ltl : 188 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/LTL6455078931130274374.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16236624514521082220.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(("((((((((gu0.Rows_0_0+gu0.Rows_0_1)+(gu0.Rows_0_2+gu0.Rows_0_3))+((gu0.Rows_0_4+gu0.Rows_0_5)+(gu0.Rows_0_6+gu0.Rows_0_7)))+(((g...15836
Formula 0 simplified : G(!"((((((((gu0.Rows_0_0+gu0.Rows_0_1)+(gu0.Rows_0_2+gu0.Rows_0_3))+((gu0.Rows_0_4+gu0.Rows_0_5)+(gu0.Rows_0_6+gu0.Rows_0_7)))+(((gu...15830
Detected timeout of ITS tools.
Treatment of property Sudoku-PT-AN09-LTLCardinality-03 finished in 167194 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 81 out of 972 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 972/972 places, 729/729 transitions.
Graph (complete) has 2187 edges and 972 vertex of which 243 are kept as prefixes of interest. Removing 729 places using SCC suffix rule.3 ms
Discarding 729 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 13 ms. Remains 243 /972 variables (removed 729) and now considering 729/729 (removed 0) transitions.
// Phase 1: matrix 729 rows 243 cols
[2024-05-30 07:21:01] [INFO ] Computed 26 invariants in 11 ms
[2024-05-30 07:21:02] [INFO ] Implicit Places using invariants in 517 ms returned []
[2024-05-30 07:21:02] [INFO ] Invariant cache hit.
[2024-05-30 07:21:03] [INFO ] Implicit Places using invariants and state equation in 977 ms returned []
Implicit Place search using SMT with State Equation took 1497 ms to find 0 implicit places.
[2024-05-30 07:21:03] [INFO ] Redundant transitions in 4 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Starting structural reductions in SI_LTL mode, iteration 1 : 243/972 places, 729/729 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1523 ms. Remains : 243/972 places, 729/729 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN09-LTLCardinality-04
Product exploration explored 100000 steps with 1417 reset in 4530 ms.
Product exploration explored 100000 steps with 1421 reset in 4596 ms.
Computed a total of 243 stabilizing places and 729 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 243 transition count 729
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 100 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 66 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (565 resets) in 1952 ms. (20 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 300 ms. (132 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 543179 steps, run timeout after 3001 ms. (steps per millisecond=180 ) properties seen :0 out of 1
Probabilistic random walk after 543179 steps, saw 116616 distinct states, run finished after 3001 ms. (steps per millisecond=180 ) properties seen :0
[2024-05-30 07:21:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 153/234 variables, 17/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/234 variables, 153/251 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/234 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 9/243 variables, 9/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/243 variables, 9/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/243 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 729/972 variables, 243/512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/972 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/972 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 972/972 variables, and 512 constraints, problems are : Problem set: 0 solved, 1 unsolved in 295 ms.
Refiners :[Domain max(s): 243/243 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 153/234 variables, 17/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/234 variables, 153/251 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/234 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 9/243 variables, 9/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/243 variables, 9/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/243 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 729/972 variables, 243/512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 972/972 variables, and 513 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1240 ms.
Refiners :[Domain max(s): 243/243 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1567ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 81 out of 243 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 243/243 places, 729/729 transitions.
Applied a total of 0 rules in 7 ms. Remains 243 /243 variables (removed 0) and now considering 729/729 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 243/243 places, 729/729 transitions.
RANDOM walk for 40000 steps (566 resets) in 2207 ms. (18 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 253 ms. (157 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 558998 steps, run timeout after 3001 ms. (steps per millisecond=186 ) properties seen :0 out of 1
Probabilistic random walk after 558998 steps, saw 119053 distinct states, run finished after 3001 ms. (steps per millisecond=186 ) properties seen :0
[2024-05-30 07:21:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 153/234 variables, 17/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/234 variables, 153/251 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/234 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 9/243 variables, 9/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/243 variables, 9/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/243 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 729/972 variables, 243/512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/972 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/972 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 972/972 variables, and 512 constraints, problems are : Problem set: 0 solved, 1 unsolved in 291 ms.
Refiners :[Domain max(s): 243/243 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 153/234 variables, 17/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/234 variables, 153/251 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/234 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 9/243 variables, 9/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/243 variables, 9/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/243 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 729/972 variables, 243/512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/972 variables, 1/513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/972 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 972/972 variables, and 513 constraints, problems are : Problem set: 0 solved, 1 unsolved in 13509 ms.
Refiners :[Domain max(s): 243/243 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 13825ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 81 out of 243 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 243/243 places, 729/729 transitions.
Applied a total of 0 rules in 17 ms. Remains 243 /243 variables (removed 0) and now considering 729/729 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 243/243 places, 729/729 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 243/243 places, 729/729 transitions.
Applied a total of 0 rules in 6 ms. Remains 243 /243 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2024-05-30 07:21:37] [INFO ] Invariant cache hit.
[2024-05-30 07:21:38] [INFO ] Implicit Places using invariants in 454 ms returned []
[2024-05-30 07:21:38] [INFO ] Invariant cache hit.
[2024-05-30 07:21:39] [INFO ] Implicit Places using invariants and state equation in 965 ms returned []
Implicit Place search using SMT with State Equation took 1423 ms to find 0 implicit places.
[2024-05-30 07:21:39] [INFO ] Redundant transitions in 8 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1442 ms. Remains : 243/243 places, 729/729 transitions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 99 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 p0), (NOT p0)]
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Support contains 81 out of 243 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 243/243 places, 729/729 transitions.
Applied a total of 0 rules in 6 ms. Remains 243 /243 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2024-05-30 07:21:39] [INFO ] Invariant cache hit.
[2024-05-30 07:21:40] [INFO ] Implicit Places using invariants in 449 ms returned []
[2024-05-30 07:21:40] [INFO ] Invariant cache hit.
[2024-05-30 07:21:41] [INFO ] Implicit Places using invariants and state equation in 937 ms returned []
Implicit Place search using SMT with State Equation took 1390 ms to find 0 implicit places.
[2024-05-30 07:21:41] [INFO ] Redundant transitions in 6 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1412 ms. Remains : 243/243 places, 729/729 transitions.
Computed a total of 243 stabilizing places and 729 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 243 transition count 729
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 74 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (565 resets) in 2311 ms. (17 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 262 ms. (152 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 567114 steps, run timeout after 3001 ms. (steps per millisecond=188 ) properties seen :0 out of 1
Probabilistic random walk after 567114 steps, saw 120422 distinct states, run finished after 3001 ms. (steps per millisecond=188 ) properties seen :0
[2024-05-30 07:21:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 153/234 variables, 17/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/234 variables, 153/251 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/234 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 9/243 variables, 9/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/243 variables, 9/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/243 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 729/972 variables, 243/512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/972 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/972 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 972/972 variables, and 512 constraints, problems are : Problem set: 0 solved, 1 unsolved in 296 ms.
Refiners :[Domain max(s): 243/243 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 153/234 variables, 17/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/234 variables, 153/251 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/234 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 9/243 variables, 9/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/243 variables, 9/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/243 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 729/972 variables, 243/512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 972/972 variables, and 513 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1238 ms.
Refiners :[Domain max(s): 243/243 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1561ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 81 out of 243 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 243/243 places, 729/729 transitions.
Applied a total of 0 rules in 10 ms. Remains 243 /243 variables (removed 0) and now considering 729/729 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 243/243 places, 729/729 transitions.
RANDOM walk for 40000 steps (566 resets) in 2335 ms. (17 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 258 ms. (154 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 570326 steps, run timeout after 3001 ms. (steps per millisecond=190 ) properties seen :0 out of 1
Probabilistic random walk after 570326 steps, saw 121106 distinct states, run finished after 3001 ms. (steps per millisecond=190 ) properties seen :0
[2024-05-30 07:21:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 153/234 variables, 17/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/234 variables, 153/251 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/234 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 9/243 variables, 9/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/243 variables, 9/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/243 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 729/972 variables, 243/512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/972 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/972 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 972/972 variables, and 512 constraints, problems are : Problem set: 0 solved, 1 unsolved in 267 ms.
Refiners :[Domain max(s): 243/243 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 153/234 variables, 17/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/234 variables, 153/251 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/234 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 9/243 variables, 9/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/243 variables, 9/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/243 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 729/972 variables, 243/512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/972 variables, 1/513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/972 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 972/972 variables, and 513 constraints, problems are : Problem set: 0 solved, 1 unsolved in 13646 ms.
Refiners :[Domain max(s): 243/243 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 13948ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 81 out of 243 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 243/243 places, 729/729 transitions.
Applied a total of 0 rules in 15 ms. Remains 243 /243 variables (removed 0) and now considering 729/729 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 243/243 places, 729/729 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 243/243 places, 729/729 transitions.
Applied a total of 0 rules in 5 ms. Remains 243 /243 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2024-05-30 07:22:07] [INFO ] Invariant cache hit.
[2024-05-30 07:22:07] [INFO ] Implicit Places using invariants in 461 ms returned []
[2024-05-30 07:22:07] [INFO ] Invariant cache hit.
[2024-05-30 07:22:08] [INFO ] Implicit Places using invariants and state equation in 951 ms returned []
Implicit Place search using SMT with State Equation took 1414 ms to find 0 implicit places.
[2024-05-30 07:22:08] [INFO ] Redundant transitions in 9 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1432 ms. Remains : 243/243 places, 729/729 transitions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 85 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1418 reset in 4545 ms.
Product exploration explored 100000 steps with 1418 reset in 4599 ms.
Built C files in :
/tmp/ltsmin11189049497105799442
[2024-05-30 07:22:17] [INFO ] Computing symmetric may disable matrix : 729 transitions.
[2024-05-30 07:22:17] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 07:22:17] [INFO ] Computing symmetric may enable matrix : 729 transitions.
[2024-05-30 07:22:17] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 07:22:18] [INFO ] Computing Do-Not-Accords matrix : 729 transitions.
[2024-05-30 07:22:18] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 07:22:18] [INFO ] Built C files in 98ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11189049497105799442
Running compilation step : cd /tmp/ltsmin11189049497105799442;'/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 2098 ms.
Running link step : cd /tmp/ltsmin11189049497105799442;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin11189049497105799442;'/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/stateBased13748110330419923448.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 81 out of 243 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 243/243 places, 729/729 transitions.
Applied a total of 0 rules in 12 ms. Remains 243 /243 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2024-05-30 07:22:33] [INFO ] Invariant cache hit.
[2024-05-30 07:22:33] [INFO ] Implicit Places using invariants in 448 ms returned []
[2024-05-30 07:22:33] [INFO ] Invariant cache hit.
[2024-05-30 07:22:34] [INFO ] Implicit Places using invariants and state equation in 919 ms returned []
Implicit Place search using SMT with State Equation took 1368 ms to find 0 implicit places.
[2024-05-30 07:22:34] [INFO ] Redundant transitions in 5 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1395 ms. Remains : 243/243 places, 729/729 transitions.
Built C files in :
/tmp/ltsmin9480046951546920357
[2024-05-30 07:22:34] [INFO ] Computing symmetric may disable matrix : 729 transitions.
[2024-05-30 07:22:34] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 07:22:34] [INFO ] Computing symmetric may enable matrix : 729 transitions.
[2024-05-30 07:22:34] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 07:22:34] [INFO ] Computing Do-Not-Accords matrix : 729 transitions.
[2024-05-30 07:22:34] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 07:22:34] [INFO ] Built C files in 106ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9480046951546920357
Running compilation step : cd /tmp/ltsmin9480046951546920357;'/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 2161 ms.
Running link step : cd /tmp/ltsmin9480046951546920357;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin9480046951546920357;'/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/stateBased5694401619584652694.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-30 07:22:49] [INFO ] Flatten gal took : 37 ms
[2024-05-30 07:22:49] [INFO ] Flatten gal took : 36 ms
[2024-05-30 07:22:49] [INFO ] Time to serialize gal into /tmp/LTL3538444378876510631.gal : 4 ms
[2024-05-30 07:22:49] [INFO ] Time to serialize properties into /tmp/LTL9333436620878019949.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/LTL3538444378876510631.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15308405202819376085.hoa' '-atoms' '/tmp/LTL9333436620878019949.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/LTL9333436620878019949.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15308405202819376085.hoa
Detected timeout of ITS tools.
[2024-05-30 07:23:04] [INFO ] Flatten gal took : 27 ms
[2024-05-30 07:23:04] [INFO ] Flatten gal took : 27 ms
[2024-05-30 07:23:04] [INFO ] Time to serialize gal into /tmp/LTL400171631858447777.gal : 5 ms
[2024-05-30 07:23:04] [INFO ] Time to serialize properties into /tmp/LTL3660989413096544981.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/LTL400171631858447777.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3660989413096544981.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...274
Read 1 LTL properties
Checking formula 0 : !((G(F("((((((((Rows_0_0+Rows_0_1)+(Rows_0_2+Rows_0_3))+((Rows_0_4+Rows_0_5)+(Rows_0_6+Rows_0_7)))+(((Rows_0_8+Rows_1_0)+(Rows_1_1+Row...927
Formula 0 simplified : FG!"((((((((Rows_0_0+Rows_0_1)+(Rows_0_2+Rows_0_3))+((Rows_0_4+Rows_0_5)+(Rows_0_6+Rows_0_7)))+(((Rows_0_8+Rows_1_0)+(Rows_1_1+Rows_...921
Detected timeout of ITS tools.
[2024-05-30 07:23:19] [INFO ] Flatten gal took : 24 ms
[2024-05-30 07:23:19] [INFO ] Applying decomposition
[2024-05-30 07:23:19] [INFO ] Flatten gal took : 24 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/graph11022539986723822990.txt' '-o' '/tmp/graph11022539986723822990.bin' '-w' '/tmp/graph11022539986723822990.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11022539986723822990.bin' '-l' '-1' '-v' '-w' '/tmp/graph11022539986723822990.weights' '-q' '0' '-e' '0.001'
[2024-05-30 07:23:20] [INFO ] Decomposing Gal with order
[2024-05-30 07:23:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 07:23:20] [INFO ] Removed a total of 1944 redundant transitions.
[2024-05-30 07:23:20] [INFO ] Flatten gal took : 83 ms
[2024-05-30 07:23:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2024-05-30 07:23:20] [INFO ] Time to serialize gal into /tmp/LTL600768966168075015.gal : 4 ms
[2024-05-30 07:23:20] [INFO ] Time to serialize properties into /tmp/LTL2123086126338783458.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/LTL600768966168075015.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2123086126338783458.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...274
Read 1 LTL properties
Checking formula 0 : !((G(F("((((((((gu0.Rows_0_0+gu0.Rows_0_1)+(gu0.Rows_0_2+gu0.Rows_0_3))+((gu0.Rows_0_4+gu0.Rows_0_5)+(gu0.Rows_0_6+gu0.Rows_0_7)))+(((...1251
Formula 0 simplified : FG!"((((((((gu0.Rows_0_0+gu0.Rows_0_1)+(gu0.Rows_0_2+gu0.Rows_0_3))+((gu0.Rows_0_4+gu0.Rows_0_5)+(gu0.Rows_0_6+gu0.Rows_0_7)))+(((gu...1245
Detected timeout of ITS tools.
Treatment of property Sudoku-PT-AN09-LTLCardinality-04 finished in 153690 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))'
Support contains 729 out of 972 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 972/972 places, 729/729 transitions.
Applied a total of 0 rules in 25 ms. Remains 972 /972 variables (removed 0) and now considering 729/729 (removed 0) transitions.
// Phase 1: matrix 729 rows 972 cols
[2024-05-30 07:23:35] [INFO ] Computed 243 invariants in 5 ms
[2024-05-30 07:23:36] [INFO ] Implicit Places using invariants in 1306 ms returned []
[2024-05-30 07:23:36] [INFO ] Invariant cache hit.
[2024-05-30 07:23:37] [INFO ] Implicit Places using invariants and state equation in 1379 ms returned []
Implicit Place search using SMT with State Equation took 2689 ms to find 0 implicit places.
[2024-05-30 07:23:37] [INFO ] Redundant transitions in 10 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2734 ms. Remains : 972/972 places, 729/729 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-PT-AN09-LTLCardinality-05
Product exploration explored 100000 steps with 50000 reset in 8402 ms.
Product exploration explored 100000 steps with 50000 reset in 8490 ms.
Computed a total of 972 stabilizing places and 729 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 972 transition count 729
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 19 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-PT-AN09-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN09-LTLCardinality-05 finished in 28979 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) U p1)))'
Support contains 810 out of 972 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 972/972 places, 729/729 transitions.
Applied a total of 0 rules in 9 ms. Remains 972 /972 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2024-05-30 07:24:04] [INFO ] Invariant cache hit.
[2024-05-30 07:24:04] [INFO ] Implicit Places using invariants in 736 ms returned []
[2024-05-30 07:24:04] [INFO ] Invariant cache hit.
[2024-05-30 07:24:06] [INFO ] Implicit Places using invariants and state equation in 1059 ms returned []
Implicit Place search using SMT with State Equation took 1798 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in LTL mode , in 1 iterations and 1809 ms. Remains : 972/972 places, 729/729 transitions.
Stuttering acceptance computed with spot in 120 ms :[(NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN09-LTLCardinality-06
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Sudoku-PT-AN09-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN09-LTLCardinality-06 finished in 1954 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 972 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 972/972 places, 729/729 transitions.
Graph (complete) has 2187 edges and 972 vertex of which 243 are kept as prefixes of interest. Removing 729 places using SCC suffix rule.1 ms
Discarding 729 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 12 ms. Remains 243 /972 variables (removed 729) and now considering 729/729 (removed 0) transitions.
// Phase 1: matrix 729 rows 243 cols
[2024-05-30 07:24:06] [INFO ] Computed 26 invariants in 16 ms
[2024-05-30 07:24:06] [INFO ] Implicit Places using invariants in 551 ms returned []
[2024-05-30 07:24:06] [INFO ] Invariant cache hit.
[2024-05-30 07:24:07] [INFO ] Implicit Places using invariants and state equation in 1220 ms returned []
Implicit Place search using SMT with State Equation took 1777 ms to find 0 implicit places.
[2024-05-30 07:24:07] [INFO ] Redundant transitions in 5 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Starting structural reductions in SI_LTL mode, iteration 1 : 243/972 places, 729/729 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1800 ms. Remains : 243/972 places, 729/729 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-PT-AN09-LTLCardinality-09
Stuttering criterion allowed to conclude after 846 steps with 11 reset in 45 ms.
FORMULA Sudoku-PT-AN09-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN09-LTLCardinality-09 finished in 1892 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)))'
Support contains 2 out of 972 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 972/972 places, 729/729 transitions.
Reduce places removed 728 places and 0 transitions.
Iterating post reduction 0 with 728 rules applied. Total rules applied 728 place count 244 transition count 729
Applied a total of 728 rules in 21 ms. Remains 244 /972 variables (removed 728) and now considering 729/729 (removed 0) transitions.
// Phase 1: matrix 729 rows 244 cols
[2024-05-30 07:24:08] [INFO ] Computed 26 invariants in 19 ms
[2024-05-30 07:24:08] [INFO ] Implicit Places using invariants in 631 ms returned []
[2024-05-30 07:24:08] [INFO ] Invariant cache hit.
[2024-05-30 07:24:09] [INFO ] Implicit Places using invariants and state equation in 1172 ms returned []
Implicit Place search using SMT with State Equation took 1808 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Starting structural reductions in LTL mode, iteration 1 : 244/972 places, 729/729 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1831 ms. Remains : 244/972 places, 729/729 transitions.
Stuttering acceptance computed with spot in 89 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN09-LTLCardinality-12
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Sudoku-PT-AN09-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN09-LTLCardinality-12 finished in 1945 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((F(p1)&&p0)))) U X(p2)))'
Support contains 6 out of 972 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 972/972 places, 729/729 transitions.
Reduce places removed 727 places and 0 transitions.
Iterating post reduction 0 with 727 rules applied. Total rules applied 727 place count 245 transition count 729
Applied a total of 727 rules in 12 ms. Remains 245 /972 variables (removed 727) and now considering 729/729 (removed 0) transitions.
// Phase 1: matrix 729 rows 245 cols
[2024-05-30 07:24:10] [INFO ] Computed 26 invariants in 17 ms
[2024-05-30 07:24:10] [INFO ] Implicit Places using invariants in 629 ms returned []
[2024-05-30 07:24:10] [INFO ] Invariant cache hit.
[2024-05-30 07:24:11] [INFO ] Implicit Places using invariants and state equation in 1060 ms returned []
Implicit Place search using SMT with State Equation took 1692 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Starting structural reductions in LTL mode, iteration 1 : 245/972 places, 729/729 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1705 ms. Remains : 245/972 places, 729/729 transitions.
Stuttering acceptance computed with spot in 216 ms :[(NOT p2), (NOT p2), (OR (NOT p2) (AND p0 p1)), (AND p1 p0), true, p1]
Running random walk in product with property : Sudoku-PT-AN09-LTLCardinality-13
Entered a terminal (fully accepting) state of product in 12949 steps with 6345 reset in 902 ms.
FORMULA Sudoku-PT-AN09-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN09-LTLCardinality-13 finished in 2845 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(!(!G(X(p0)) U (!p0 U !p1)))))'
Support contains 4 out of 972 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 972/972 places, 729/729 transitions.
Reduce places removed 727 places and 0 transitions.
Iterating post reduction 0 with 727 rules applied. Total rules applied 727 place count 245 transition count 729
Applied a total of 727 rules in 15 ms. Remains 245 /972 variables (removed 727) and now considering 729/729 (removed 0) transitions.
// Phase 1: matrix 729 rows 245 cols
[2024-05-30 07:24:12] [INFO ] Computed 26 invariants in 10 ms
[2024-05-30 07:24:13] [INFO ] Implicit Places using invariants in 634 ms returned []
[2024-05-30 07:24:13] [INFO ] Invariant cache hit.
[2024-05-30 07:24:14] [INFO ] Implicit Places using invariants and state equation in 1163 ms returned []
Implicit Place search using SMT with State Equation took 1807 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Starting structural reductions in LTL mode, iteration 1 : 245/972 places, 729/729 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1823 ms. Remains : 245/972 places, 729/729 transitions.
Stuttering acceptance computed with spot in 243 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : Sudoku-PT-AN09-LTLCardinality-15
Entered a terminal (fully accepting) state of product in 2788 steps with 39 reset in 155 ms.
FORMULA Sudoku-PT-AN09-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN09-LTLCardinality-15 finished in 2247 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&&F(p1))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
[2024-05-30 07:24:15] [INFO ] Flatten gal took : 32 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin10886018052485748996
[2024-05-30 07:24:15] [INFO ] Computing symmetric may disable matrix : 729 transitions.
[2024-05-30 07:24:15] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 07:24:15] [INFO ] Computing symmetric may enable matrix : 729 transitions.
[2024-05-30 07:24:15] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 07:24:15] [INFO ] Applying decomposition
[2024-05-30 07:24:15] [INFO ] Flatten gal took : 34 ms
[2024-05-30 07:24:15] [INFO ] Computing Do-Not-Accords matrix : 729 transitions.
[2024-05-30 07:24:15] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 07:24:15] [INFO ] Built C files in 186ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10886018052485748996
Running compilation step : cd /tmp/ltsmin10886018052485748996;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '360' '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/graph8617837974162624500.txt' '-o' '/tmp/graph8617837974162624500.bin' '-w' '/tmp/graph8617837974162624500.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8617837974162624500.bin' '-l' '-1' '-v' '-w' '/tmp/graph8617837974162624500.weights' '-q' '0' '-e' '0.001'
[2024-05-30 07:24:16] [INFO ] Decomposing Gal with order
[2024-05-30 07:24:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 07:24:16] [INFO ] Removed a total of 648 redundant transitions.
[2024-05-30 07:24:16] [INFO ] Flatten gal took : 446 ms
[2024-05-30 07:24:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 729 labels/synchronizations in 31 ms.
[2024-05-30 07:24:17] [INFO ] Time to serialize gal into /tmp/LTLCardinality18159698433416442341.gal : 4 ms
[2024-05-30 07:24:17] [INFO ] Time to serialize properties into /tmp/LTLCardinality8396237404213206585.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/LTLCardinality18159698433416442341.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality8396237404213206585.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...298
Read 2 LTL properties
Checking formula 0 : !((F(("((((((((gu0.Rows_0_0+gu0.Rows_0_1)+(gu0.Rows_0_2+gu0.Rows_0_3))+((gu0.Rows_0_4+gu0.Rows_0_5)+(gu0.Rows_0_6+gu0.Rows_0_7)))+(((g...15836
Formula 0 simplified : G(!"((((((((gu0.Rows_0_0+gu0.Rows_0_1)+(gu0.Rows_0_2+gu0.Rows_0_3))+((gu0.Rows_0_4+gu0.Rows_0_5)+(gu0.Rows_0_6+gu0.Rows_0_7)))+(((gu...15830
Compilation finished in 2671 ms.
Running link step : cd /tmp/ltsmin10886018052485748996;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin10886018052485748996;'/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' '--ltl' '<>(((LTLAPp0==true)&&<>((LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin10886018052485748996;'/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' '--ltl' '<>(((LTLAPp0==true)&&<>((LTLAPp1==true))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin10886018052485748996;'/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' '--ltl' '[](<>((LTLAPp2==true)))' '--buchi-type=spotba'
ITS-tools command line returned an error code 137
[2024-05-30 07:45:18] [INFO ] Applying decomposition
[2024-05-30 07:45:18] [INFO ] Flatten gal took : 78 ms
[2024-05-30 07:45:18] [INFO ] Decomposing Gal with order
[2024-05-30 07:45:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 07:45:18] [INFO ] Removed a total of 1274 redundant transitions.
[2024-05-30 07:45:18] [INFO ] Flatten gal took : 187 ms
[2024-05-30 07:45:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 13 ms.
[2024-05-30 07:45:18] [INFO ] Time to serialize gal into /tmp/LTLCardinality18071685333848044988.gal : 22 ms
[2024-05-30 07:45:18] [INFO ] Time to serialize properties into /tmp/LTLCardinality8243335532587526314.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/LTLCardinality18071685333848044988.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality8243335532587526314.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...298
Read 2 LTL properties
Checking formula 0 : !((F(("((((((((gu97.Rows_0_0+gu60.Rows_0_1)+(gu76.Rows_0_2+gu98.Rows_0_3))+((gu79.Rows_0_4+gu74.Rows_0_5)+(gu81.Rows_0_6+gu99.Rows_0_7...16720
Formula 0 simplified : G(!"((((((((gu97.Rows_0_0+gu60.Rows_0_1)+(gu76.Rows_0_2+gu98.Rows_0_3))+((gu79.Rows_0_4+gu74.Rows_0_5)+(gu81.Rows_0_6+gu99.Rows_0_7)...16714
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 1/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.013: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.013: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.013: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.013: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.017: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.013: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.020: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.078: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.088: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.094: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.106: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.106: Initializing POR dependencies: labels 732, guards 729
pins2lts-mc-linux64( 5/ 8), 0.110: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.111: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.130: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.164: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 14.553: LTL layer: formula: [](<>((LTLAPp2==true)))
pins2lts-mc-linux64( 3/ 8), 14.553: "[](<>((LTLAPp2==true)))" is not a file, parsing as formula...
pins2lts-mc-linux64( 3/ 8), 14.554: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 14.810: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 14.962: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 14.980: There are 734 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 14.980: State length is 973, there are 732 groups
pins2lts-mc-linux64( 0/ 8), 14.980: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 14.980: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 14.980: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 14.980: Visible groups: 0 / 732, labels: 1 / 734
pins2lts-mc-linux64( 0/ 8), 14.980: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 14.980: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 6/ 8), 16.803: [Blue] ~71 levels ~960 states ~127384 transitions
pins2lts-mc-linux64( 6/ 8), 16.856: [Blue] ~71 levels ~1920 states ~130856 transitions
pins2lts-mc-linux64( 6/ 8), 16.952: [Blue] ~71 levels ~3840 states ~138720 transitions
pins2lts-mc-linux64( 6/ 8), 17.200: [Blue] ~71 levels ~7680 states ~156280 transitions
pins2lts-mc-linux64( 6/ 8), 17.719: [Blue] ~71 levels ~15360 states ~194760 transitions
pins2lts-mc-linux64( 6/ 8), 18.726: [Blue] ~71 levels ~30720 states ~276648 transitions
pins2lts-mc-linux64( 6/ 8), 20.923: [Blue] ~71 levels ~61440 states ~454784 transitions
pins2lts-mc-linux64( 6/ 8), 25.609: [Blue] ~71 levels ~122880 states ~858696 transitions
pins2lts-mc-linux64( 6/ 8), 34.899: [Blue] ~71 levels ~245760 states ~1709416 transitions
pins2lts-mc-linux64( 6/ 8), 58.464: [Blue] ~71 levels ~491520 states ~3304720 transitions
pins2lts-mc-linux64( 6/ 8), 98.629: [Blue] ~71 levels ~983040 states ~7079352 transitions
pins2lts-mc-linux64( 3/ 8), 176.655: [Blue] ~71 levels ~1966080 states ~14283656 transitions
pins2lts-mc-linux64( 7/ 8), 340.166: [Blue] ~71 levels ~3932160 states ~29716552 transitions
pins2lts-mc-linux64( 2/ 8), 681.711: [Blue] ~72 levels ~7864320 states ~62481224 transitions
pins2lts-mc-linux64( 4/ 8), 848.769: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 848.856:
pins2lts-mc-linux64( 0/ 8), 848.856: Explored 9424981 states 78337853 transitions, fanout: 8.312
pins2lts-mc-linux64( 0/ 8), 848.857: Total exploration time 833.840 sec (833.760 sec minimum, 833.806 sec on average)
pins2lts-mc-linux64( 0/ 8), 848.857: States per second: 11303, Transitions per second: 93948
pins2lts-mc-linux64( 0/ 8), 848.857:
pins2lts-mc-linux64( 0/ 8), 848.857: State space has 9544122 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 848.857: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 848.857: blue states: 9424981 (98.75%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 848.857: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 848.857: all-red states: 0 (0.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 848.857:
pins2lts-mc-linux64( 0/ 8), 848.857: Total memory used for local state coloring: 0.0MB
pins2lts-mc-linux64( 0/ 8), 848.857:
pins2lts-mc-linux64( 0/ 8), 848.857: Queue width: 8B, total height: 581, memory: 0.00MB
pins2lts-mc-linux64( 0/ 8), 848.857: Tree memory: 328.8MB, 36.1 B/state, compr.: 0.9%
pins2lts-mc-linux64( 0/ 8), 848.857: Tree fill ratio (roots/leafs): 7.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 848.857: Stored 739 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 848.857: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 848.857: Est. total memory use: 328.8MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin10886018052485748996;'/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' '--ltl' '[](<>((LTLAPp2==true)))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin10886018052485748996;'/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' '--ltl' '[](<>((LTLAPp2==true)))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:241)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:176)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:114)
at java.base/java.lang.Thread.run(Thread.java:840)
ITS-tools command line returned an error code 137
[2024-05-30 08:00:35] [INFO ] Flatten gal took : 46 ms
[2024-05-30 08:00:35] [INFO ] Input system was already deterministic with 729 transitions.
[2024-05-30 08:00:35] [INFO ] Transformed 972 places.
[2024-05-30 08:00:35] [INFO ] Transformed 729 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-30 08:00:36] [INFO ] Time to serialize gal into /tmp/LTLCardinality5381829018125028233.gal : 4 ms
[2024-05-30 08:00:36] [INFO ] Time to serialize properties into /tmp/LTLCardinality8529224304402775000.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/LTLCardinality5381829018125028233.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality8529224304402775000.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--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...342
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F(("((((((((Rows_0_0+Rows_0_1)+(Rows_0_2+Rows_0_3))+((Rows_0_4+Rows_0_5)+(Rows_0_6+Rows_0_7)))+(((Rows_0_8+Rows_1_0)+(Rows_1_1+Rows...12272
Formula 0 simplified : G(!"((((((((Rows_0_0+Rows_0_1)+(Rows_0_2+Rows_0_3))+((Rows_0_4+Rows_0_5)+(Rows_0_6+Rows_0_7)))+(((Rows_0_8+Rows_1_0)+(Rows_1_1+Rows_...12266
ITS-tools command line returned an error code 137
Total runtime 3316691 ms.
BK_STOP 1717056647489
--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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="Sudoku-PT-AN09"
export BK_EXAMINATION="LTLCardinality"
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 Sudoku-PT-AN09, examination is LTLCardinality"
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-171690532800635"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Sudoku-PT-AN09.tgz
mv Sudoku-PT-AN09 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;