About the Execution of ITS-Tools for Sudoku-COL-AN13
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16202.331 | 2458152.00 | 3125596.00 | 10007.60 | TTTFT?T?TFFT?FF? | 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-171690532500507.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-COL-AN13, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r400-tall-171690532500507
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 440K
-rw-r--r-- 1 mcc users 6.1K Apr 12 11:00 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K Apr 12 11:00 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Apr 12 10:13 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Apr 12 10:13 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 3.8K Apr 23 08:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 08:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 08:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 08:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 12 12:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 155K Apr 12 12:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Apr 12 11:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 41K Apr 12 11:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 08:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 08:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 6.5K 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-COL-AN13-LTLCardinality-00
FORMULA_NAME Sudoku-COL-AN13-LTLCardinality-01
FORMULA_NAME Sudoku-COL-AN13-LTLCardinality-02
FORMULA_NAME Sudoku-COL-AN13-LTLCardinality-03
FORMULA_NAME Sudoku-COL-AN13-LTLCardinality-04
FORMULA_NAME Sudoku-COL-AN13-LTLCardinality-05
FORMULA_NAME Sudoku-COL-AN13-LTLCardinality-06
FORMULA_NAME Sudoku-COL-AN13-LTLCardinality-07
FORMULA_NAME Sudoku-COL-AN13-LTLCardinality-08
FORMULA_NAME Sudoku-COL-AN13-LTLCardinality-09
FORMULA_NAME Sudoku-COL-AN13-LTLCardinality-10
FORMULA_NAME Sudoku-COL-AN13-LTLCardinality-11
FORMULA_NAME Sudoku-COL-AN13-LTLCardinality-12
FORMULA_NAME Sudoku-COL-AN13-LTLCardinality-13
FORMULA_NAME Sudoku-COL-AN13-LTLCardinality-14
FORMULA_NAME Sudoku-COL-AN13-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1717036305226
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Sudoku-COL-AN13
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
LTLCardinality COL
Running Version 202405141337
[2024-05-30 02:31:46] [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 02:31:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 02:31:46] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-30 02:31:46] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-30 02:31:46] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 466 ms
[2024-05-30 02:31:46] [INFO ] Imported 4 HL places and 1 HL transitions for a total of 2704 PT places and 2197.0 transition bindings in 11 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 16 ms.
Working with output stream class java.io.PrintStream
[2024-05-30 02:31:47] [INFO ] Built PT skeleton of HLPN with 4 places and 1 transitions 4 arcs in 3 ms.
[2024-05-30 02:31:47] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 3 formulas.
FORMULA Sudoku-COL-AN13-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN13-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN13-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 4 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 1
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Remains 13 properties that can be checked using skeleton over-approximation.
Computed a total of 4 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 1
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
RANDOM walk for 40352 steps (232 resets) in 167 ms. (240 steps per ms) remains 7/23 properties
BEST_FIRST walk for 40352 steps (232 resets) in 59 ms. (672 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40352 steps (232 resets) in 40 ms. (984 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40352 steps (232 resets) in 78 ms. (510 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40352 steps (232 resets) in 72 ms. (552 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40352 steps (232 resets) in 49 ms. (807 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40352 steps (232 resets) in 40 ms. (984 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40352 steps (232 resets) in 56 ms. (707 steps per ms) remains 7/7 properties
// Phase 1: matrix 1 rows 4 cols
[2024-05-30 02:31:47] [INFO ] Computed 3 invariants in 4 ms
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp22 is UNSAT
After SMT solving in domain Real declared 4/5 variables, and 3 constraints, problems are : Problem set: 7 solved, 0 unsolved in 96 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/4 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
After SMT, in 135ms problems are : Problem set: 7 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 7 atomic propositions for a total of 13 simplifications.
FORMULA Sudoku-COL-AN13-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN13-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-30 02:31:47] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2024-05-30 02:31:47] [INFO ] Flatten gal took : 12 ms
FORMULA Sudoku-COL-AN13-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN13-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-30 02:31:47] [INFO ] Flatten gal took : 1 ms
Domain [N(13), N(13)] of place Rows breaks symmetries in sort N
[2024-05-30 02:31:47] [INFO ] Unfolded HLPN to a Petri net with 2704 places and 2197 transitions 8788 arcs in 44 ms.
[2024-05-30 02:31:47] [INFO ] Unfolded 9 HLPN properties in 3 ms.
Support contains 2704 out of 2704 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 28 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
// Phase 1: matrix 2197 rows 2704 cols
[2024-05-30 02:31:47] [INFO ] Computed 507 invariants in 35 ms
[2024-05-30 02:31:48] [INFO ] Implicit Places using invariants in 644 ms returned []
[2024-05-30 02:31:48] [INFO ] Invariant cache hit.
[2024-05-30 02:31:50] [INFO ] Implicit Places using invariants and state equation in 1520 ms returned []
Implicit Place search using SMT with State Equation took 2181 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 2227 ms. Remains : 2704/2704 places, 2197/2197 transitions.
Support contains 2704 out of 2704 places after structural reductions.
[2024-05-30 02:31:50] [INFO ] Flatten gal took : 230 ms
[2024-05-30 02:31:50] [INFO ] Flatten gal took : 161 ms
[2024-05-30 02:31:51] [INFO ] Input system was already deterministic with 2197 transitions.
RANDOM walk for 40000 steps (268 resets) in 15142 ms. (2 steps per ms) remains 13/19 properties
BEST_FIRST walk for 40004 steps (8 resets) in 612 ms. (65 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 3118 ms. (12 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 450 ms. (88 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 448 ms. (89 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 582 ms. (68 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 469 ms. (85 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 438 ms. (91 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 982 ms. (40 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 707 ms. (56 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 681 ms. (58 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1101 ms. (36 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 595 ms. (67 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1986 ms. (20 steps per ms) remains 13/13 properties
[2024-05-30 02:31:58] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2704/4901 variables, and 507 constraints, problems are : Problem set: 0 solved, 13 unsolved in 5037 ms.
Refiners :[Positive P Invariants (semi-flows): 507/507 constraints, State Equation: 0/2704 constraints, PredecessorRefiner: 0/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
Problem AtomicPropp8 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2704/4901 variables, and 507 constraints, problems are : Problem set: 1 solved, 12 unsolved in 5013 ms.
Refiners :[Positive P Invariants (semi-flows): 507/507 constraints, State Equation: 0/2704 constraints, PredecessorRefiner: 0/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 11261ms problems are : Problem set: 1 solved, 12 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2704 out of 2704 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 96 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 97 ms. Remains : 2704/2704 places, 2197/2197 transitions.
RANDOM walk for 40000 steps (268 resets) in 12267 ms. (3 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 472 ms. (84 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 2497 ms. (16 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 498 ms. (80 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 430 ms. (92 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 429 ms. (93 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 489 ms. (81 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 926 ms. (43 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 555 ms. (71 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 611 ms. (65 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 946 ms. (42 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 576 ms. (69 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1990 ms. (20 steps per ms) remains 12/12 properties
Probabilistic random walk after 164730 steps, saw 164611 distinct states, run finished after 15074 ms. (steps per millisecond=10 ) properties seen :0
[2024-05-30 02:32:30] [INFO ] Invariant cache hit.
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp18 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2704 variables, 507/507 constraints. Problems are: Problem set: 4 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2704 variables, 0/507 constraints. Problems are: Problem set: 4 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 2197/4901 variables, 2704/3211 constraints. Problems are: Problem set: 4 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/4901 variables, 0/3211 constraints. Problems are: Problem set: 4 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 0/4901 variables, 0/3211 constraints. Problems are: Problem set: 4 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4901/4901 variables, and 3211 constraints, problems are : Problem set: 4 solved, 8 unsolved in 21391 ms.
Refiners :[Positive P Invariants (semi-flows): 507/507 constraints, State Equation: 2704/2704 constraints, PredecessorRefiner: 8/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2704 variables, 507/507 constraints. Problems are: Problem set: 4 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2704 variables, 0/507 constraints. Problems are: Problem set: 4 solved, 8 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4901/4901 variables, and 3211 constraints, problems are : Problem set: 4 solved, 8 unsolved in 45033 ms.
Refiners :[Positive P Invariants (semi-flows): 507/507 constraints, State Equation: 2704/2704 constraints, PredecessorRefiner: 8/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 67303ms problems are : Problem set: 4 solved, 8 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2704 out of 2704 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 35 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 2704/2704 places, 2197/2197 transitions.
Successfully simplified 5 atomic propositions for a total of 9 simplifications.
Computed a total of 2704 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2704 transition count 2197
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((p0&&((p1||F(p2)) U p3))))'
Support contains 2535 out of 2704 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 35 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2024-05-30 02:33:38] [INFO ] Invariant cache hit.
[2024-05-30 02:33:38] [INFO ] Implicit Places using invariants in 771 ms returned []
[2024-05-30 02:33:38] [INFO ] Invariant cache hit.
[2024-05-30 02:33:40] [INFO ] Implicit Places using invariants and state equation in 1996 ms returned []
Implicit Place search using SMT with State Equation took 2773 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 2808 ms. Remains : 2704/2704 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 302 ms :[(OR (NOT p0) (NOT p3)), (OR (NOT p0) (NOT p3)), true, (NOT p2), (NOT p3)]
Running random walk in product with property : Sudoku-COL-AN13-LTLCardinality-01
Product exploration timeout after 41210 steps with 20605 reset in 10001 ms.
Product exploration timeout after 40640 steps with 20320 reset in 10001 ms.
Computed a total of 2704 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2704 transition count 2197
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 p0 p3 (NOT p1) (NOT p2)), (X (NOT (AND p0 (NOT p3) (NOT p1) (NOT p2)))), (X (NOT p2)), (X p3), (X (NOT (AND p0 (NOT p3)))), (X p0), (X (NOT p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 11 factoid took 15 ms. Reduced automaton from 5 states, 8 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-COL-AN13-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN13-LTLCardinality-01 finished in 24196 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 169 out of 2704 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Reduce places removed 2197 places and 0 transitions.
Iterating post reduction 0 with 2197 rules applied. Total rules applied 2197 place count 507 transition count 2197
Applied a total of 2197 rules in 149 ms. Remains 507 /2704 variables (removed 2197) and now considering 2197/2197 (removed 0) transitions.
// Phase 1: matrix 2197 rows 507 cols
[2024-05-30 02:34:02] [INFO ] Computed 38 invariants in 102 ms
[2024-05-30 02:34:02] [INFO ] Implicit Places using invariants in 521 ms returned []
[2024-05-30 02:34:02] [INFO ] Invariant cache hit.
[2024-05-30 02:34:07] [INFO ] Implicit Places using invariants and state equation in 4859 ms returned []
Implicit Place search using SMT with State Equation took 5382 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 : 507/2704 places, 2197/2197 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5541 ms. Remains : 507/2704 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN13-LTLCardinality-02
Product exploration timeout after 53200 steps with 26600 reset in 10001 ms.
Product exploration timeout after 52970 steps with 26485 reset in 10001 ms.
Computed a total of 507 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 507 transition count 2197
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), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 37 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-COL-AN13-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN13-LTLCardinality-02 finished in 26047 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(p0)))))'
Support contains 2197 out of 2704 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 39 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
// Phase 1: matrix 2197 rows 2704 cols
[2024-05-30 02:34:28] [INFO ] Computed 507 invariants in 16 ms
[2024-05-30 02:34:29] [INFO ] Implicit Places using invariants in 1404 ms returned []
[2024-05-30 02:34:29] [INFO ] Invariant cache hit.
[2024-05-30 02:34:32] [INFO ] Implicit Places using invariants and state equation in 2986 ms returned []
Implicit Place search using SMT with State Equation took 4393 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 4434 ms. Remains : 2704/2704 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 147 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN13-LTLCardinality-03
Stuttering criterion allowed to conclude after 146 steps with 0 reset in 28 ms.
FORMULA Sudoku-COL-AN13-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN13-LTLCardinality-03 finished in 4643 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X((p0 U (X(p1) U (X(G(p1))||(p1&&X(p1))))))))'
Support contains 2366 out of 2704 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 22 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2024-05-30 02:34:33] [INFO ] Invariant cache hit.
[2024-05-30 02:34:34] [INFO ] Implicit Places using invariants in 1034 ms returned []
[2024-05-30 02:34:34] [INFO ] Invariant cache hit.
[2024-05-30 02:34:36] [INFO ] Implicit Places using invariants and state equation in 2527 ms returned []
Implicit Place search using SMT with State Equation took 3564 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 3590 ms. Remains : 2704/2704 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 269 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), true, (NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Sudoku-COL-AN13-LTLCardinality-05
Product exploration timeout after 42970 steps with 289 reset in 10001 ms.
Product exploration timeout after 42480 steps with 286 reset in 10001 ms.
Computed a total of 2704 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2704 transition count 2197
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 p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (AND p0 (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 179 ms. Reduced automaton from 8 states, 18 edges and 2 AP (stutter sensitive) to 6 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 179 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), true, (NOT p1)]
RANDOM walk for 40000 steps (268 resets) in 5882 ms. (6 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1718 ms. (23 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1741 ms. (22 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 477 ms. (83 steps per ms) remains 3/3 properties
[2024-05-30 02:35:00] [INFO ] Invariant cache hit.
Problem apf0 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2366 variables, 169/169 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2366 variables, 0/169 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2704/4901 variables, and 507 constraints, problems are : Problem set: 1 solved, 2 unsolved in 2554 ms.
Refiners :[Positive P Invariants (semi-flows): 507/507 constraints, State Equation: 0/2704 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2366 variables, 169/169 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2366 variables, 0/169 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2704/4901 variables, and 507 constraints, problems are : Problem set: 1 solved, 2 unsolved in 2531 ms.
Refiners :[Positive P Invariants (semi-flows): 507/507 constraints, State Equation: 0/2704 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 5446ms problems are : Problem set: 1 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2366 out of 2704 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 64 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65 ms. Remains : 2704/2704 places, 2197/2197 transitions.
RANDOM walk for 40000 steps (268 resets) in 8039 ms. (4 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1700 ms. (23 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 430 ms. (92 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 418854 steps, run timeout after 9001 ms. (steps per millisecond=46 ) properties seen :0 out of 2
Probabilistic random walk after 418854 steps, saw 248500 distinct states, run finished after 9014 ms. (steps per millisecond=46 ) properties seen :0
[2024-05-30 02:35:18] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2366 variables, 169/169 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2366 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 338/2704 variables, 338/507 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2704 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 2197/4901 variables, 2704/3211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4901 variables, 0/3211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/4901 variables, 0/3211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4901/4901 variables, and 3211 constraints, problems are : Problem set: 0 solved, 2 unsolved in 33128 ms.
Refiners :[Positive P Invariants (semi-flows): 507/507 constraints, State Equation: 2704/2704 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2366 variables, 169/169 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2366 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2704/4901 variables, and 507 constraints, problems are : Problem set: 0 solved, 2 unsolved in 15809 ms.
Refiners :[Positive P Invariants (semi-flows): 507/507 constraints, State Equation: 0/2704 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 49210ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 2366 out of 2704 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 36 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 2704/2704 places, 2197/2197 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 32 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2024-05-30 02:36:07] [INFO ] Invariant cache hit.
[2024-05-30 02:36:08] [INFO ] Implicit Places using invariants in 1095 ms returned []
[2024-05-30 02:36:08] [INFO ] Invariant cache hit.
[2024-05-30 02:36:11] [INFO ] Implicit Places using invariants and state equation in 2735 ms returned []
Implicit Place search using SMT with State Equation took 3834 ms to find 0 implicit places.
[2024-05-30 02:36:11] [INFO ] Redundant transitions in 107 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 3986 ms. Remains : 2704/2704 places, 2197/2197 transitions.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (AND p0 (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (G (OR p0 (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p1))), (F (NOT p1)), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 10 factoid took 330 ms. Reduced automaton from 6 states, 11 edges and 2 AP (stutter sensitive) to 6 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 213 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), true, (NOT p1)]
Stuttering acceptance computed with spot in 210 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), true, (NOT p1)]
Support contains 2366 out of 2704 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 29 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2024-05-30 02:36:12] [INFO ] Invariant cache hit.
[2024-05-30 02:36:13] [INFO ] Implicit Places using invariants in 1005 ms returned []
[2024-05-30 02:36:13] [INFO ] Invariant cache hit.
[2024-05-30 02:36:16] [INFO ] Implicit Places using invariants and state equation in 2618 ms returned []
Implicit Place search using SMT with State Equation took 3627 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 3657 ms. Remains : 2704/2704 places, 2197/2197 transitions.
Computed a total of 2704 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2704 transition count 2197
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 p1 p0), (X p0), (X (NOT p1)), (X (AND p0 (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 135 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 202 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), true, (NOT p1)]
RANDOM walk for 40000 steps (268 resets) in 6577 ms. (6 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 528 ms. (75 steps per ms) remains 1/1 properties
[2024-05-30 02:36:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2197/2366 variables, 169/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2366 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2704/4901 variables, and 507 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1351 ms.
Refiners :[Positive P Invariants (semi-flows): 507/507 constraints, State Equation: 0/2704 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2197/2366 variables, 169/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2366 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2704/4901 variables, and 507 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1363 ms.
Refiners :[Positive P Invariants (semi-flows): 507/507 constraints, State Equation: 0/2704 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 2753ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 169 out of 2704 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Graph (complete) has 6591 edges and 2704 vertex of which 507 are kept as prefixes of interest. Removing 2197 places using SCC suffix rule.6 ms
Discarding 2197 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 48 ms. Remains 507 /2704 variables (removed 2197) and now considering 2197/2197 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 507/2704 places, 2197/2197 transitions.
RANDOM walk for 40000 steps (268 resets) in 6443 ms. (6 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 520 ms. (76 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 437432 steps, run timeout after 6001 ms. (steps per millisecond=72 ) properties seen :0 out of 1
Probabilistic random walk after 437432 steps, saw 250168 distinct states, run finished after 6001 ms. (steps per millisecond=72 ) properties seen :0
// Phase 1: matrix 2197 rows 507 cols
[2024-05-30 02:36:30] [INFO ] Computed 38 invariants in 62 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 332/501 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/501 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/507 variables, 6/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/507 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2197/2704 variables, 507/545 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2704 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/2704 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2704/2704 variables, and 545 constraints, problems are : Problem set: 0 solved, 1 unsolved in 646 ms.
Refiners :[Generalized P Invariants (flows): 38/38 constraints, State Equation: 507/507 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 332/501 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/501 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/507 variables, 6/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/507 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2197/2704 variables, 507/545 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2704 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/2704 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2704/2704 variables, and 545 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1072 ms.
Refiners :[Generalized P Invariants (flows): 38/38 constraints, State Equation: 507/507 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 1834ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 167 steps, including 0 resets, run visited all 1 properties in 8 ms. (steps per millisecond=20 )
Parikh walk visited 1 properties in 16 ms.
Knowledge obtained : [(AND p1 p0), (X p0), (X (NOT p1)), (X (AND p0 (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR (NOT p0) p1))), (F (NOT p0))]
Knowledge based reduction with 6 factoid took 230 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 174 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), true, (NOT p1)]
Stuttering acceptance computed with spot in 177 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), true, (NOT p1)]
Stuttering acceptance computed with spot in 205 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), true, (NOT p1)]
Product exploration timeout after 44880 steps with 302 reset in 10001 ms.
Product exploration timeout after 44820 steps with 302 reset in 10001 ms.
Applying partial POR strategy [true, false, false, false, true, false]
Stuttering acceptance computed with spot in 189 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), true, (NOT p1)]
Support contains 2366 out of 2704 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 89 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2024-05-30 02:36:53] [INFO ] Redundant transitions in 33 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 135 ms. Remains : 2704/2704 places, 2197/2197 transitions.
Built C files in :
/tmp/ltsmin13485741699289114043
[2024-05-30 02:36:53] [INFO ] Built C files in 45ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13485741699289114043
Running compilation step : cd /tmp/ltsmin13485741699289114043;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13485741699289114043;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13485741699289114043;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 2366 out of 2704 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 24 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
// Phase 1: matrix 2197 rows 2704 cols
[2024-05-30 02:36:56] [INFO ] Computed 507 invariants in 14 ms
[2024-05-30 02:36:57] [INFO ] Implicit Places using invariants in 1139 ms returned []
[2024-05-30 02:36:57] [INFO ] Invariant cache hit.
[2024-05-30 02:37:00] [INFO ] Implicit Places using invariants and state equation in 2633 ms returned []
Implicit Place search using SMT with State Equation took 3776 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 3801 ms. Remains : 2704/2704 places, 2197/2197 transitions.
Built C files in :
/tmp/ltsmin2321731433260619790
[2024-05-30 02:37:00] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2321731433260619790
Running compilation step : cd /tmp/ltsmin2321731433260619790;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2321731433260619790;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2321731433260619790;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-30 02:37:03] [INFO ] Flatten gal took : 102 ms
[2024-05-30 02:37:03] [INFO ] Flatten gal took : 110 ms
[2024-05-30 02:37:03] [INFO ] Time to serialize gal into /tmp/LTL5936166535633619003.gal : 25 ms
[2024-05-30 02:37:03] [INFO ] Time to serialize properties into /tmp/LTL6333909397406480090.prop : 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/LTL5936166535633619003.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2219466212304389709.hoa' '-atoms' '/tmp/LTL6333909397406480090.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL6333909397406480090.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2219466212304389709.hoa
Detected timeout of ITS tools.
[2024-05-30 02:37:19] [INFO ] Flatten gal took : 96 ms
[2024-05-30 02:37:19] [INFO ] Flatten gal took : 104 ms
[2024-05-30 02:37:19] [INFO ] Time to serialize gal into /tmp/LTL14403288300838158307.gal : 16 ms
[2024-05-30 02:37:19] [INFO ] Time to serialize properties into /tmp/LTL1536878038190952383.ltl : 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/LTL14403288300838158307.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1536878038190952383.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 : !(((G("(((((((((Cells_0+Cells_1)+(Cells_2+Cells_3))+((Cells_4+Cells_5)+(Cells_6+Cells_7)))+(((Cells_8+Cells_9)+(Cells_10+Cells_11))+((...113732
Formula 0 simplified : F!"(((((((((Cells_0+Cells_1)+(Cells_2+Cells_3))+((Cells_4+Cells_5)+(Cells_6+Cells_7)))+(((Cells_8+Cells_9)+(Cells_10+Cells_11))+((Ce...113718
Detected timeout of ITS tools.
[2024-05-30 02:37:34] [INFO ] Flatten gal took : 88 ms
[2024-05-30 02:37:34] [INFO ] Applying decomposition
[2024-05-30 02:37:34] [INFO ] Flatten gal took : 90 ms
[2024-05-30 02:37:52] [WARNING] Could not apply decomposition. Using flat GAL structure.
java.util.concurrent.TimeoutException: Subprocess running '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph17358017776571917789.txt' '-o' '/tmp/graph17358017776571917789.bin' '-w' '/tmp/graph17358017776571917789.weights' killed by timeout after 10 SECONDS
at fr.lip6.move.gal.process.Runner.waitForOrTimeout(Runner.java:76)
at fr.lip6.move.gal.process.Runner.runTool(Runner.java:47)
at fr.lip6.move.gal.process.Runner.runTool(Runner.java:27)
at fr.lip6.move.gal.louvain.GraphBuilder.convertGraphToBin(GraphBuilder.java:258)
at fr.lip6.move.gal.louvain.GraphBuilder.computeLouvain(GraphBuilder.java:189)
at fr.lip6.move.gal.louvain.GraphBuilder.computeLouvain(GraphBuilder.java:157)
at fr.lip6.move.gal.application.mcc.MccTranslator.applyOrder(MccTranslator.java:114)
at fr.lip6.move.gal.application.mcc.MccTranslator.flattenSpec(MccTranslator.java:230)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.verifyWithSDD(GlobalPropertySolver.java:719)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:342)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:958)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-30 02:37:52] [INFO ] Flatten gal took : 98 ms
[2024-05-30 02:37:52] [INFO ] Time to serialize gal into /tmp/LTL4131957102365204972.gal : 17 ms
[2024-05-30 02:37:52] [INFO ] Time to serialize properties into /tmp/LTL8210171801292371878.ltl : 7 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/LTL4131957102365204972.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8210171801292371878.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...275
Read 1 LTL properties
Checking formula 0 : !(((G("(((((((((Cells_0+Cells_1)+(Cells_2+Cells_3))+((Cells_4+Cells_5)+(Cells_6+Cells_7)))+(((Cells_8+Cells_9)+(Cells_10+Cells_11))+((...113732
Formula 0 simplified : F!"(((((((((Cells_0+Cells_1)+(Cells_2+Cells_3))+((Cells_4+Cells_5)+(Cells_6+Cells_7)))+(((Cells_8+Cells_9)+(Cells_10+Cells_11))+((Ce...113718
Detected timeout of ITS tools.
Treatment of property Sudoku-COL-AN13-LTLCardinality-05 finished in 214846 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((p0 U p1)&&G(F(p2)))))'
Support contains 338 out of 2704 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Graph (complete) has 6591 edges and 2704 vertex of which 507 are kept as prefixes of interest. Removing 2197 places using SCC suffix rule.5 ms
Discarding 2197 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 30 ms. Remains 507 /2704 variables (removed 2197) and now considering 2197/2197 (removed 0) transitions.
// Phase 1: matrix 2197 rows 507 cols
[2024-05-30 02:38:07] [INFO ] Computed 38 invariants in 54 ms
[2024-05-30 02:38:08] [INFO ] Implicit Places using invariants in 317 ms returned []
[2024-05-30 02:38:08] [INFO ] Invariant cache hit.
[2024-05-30 02:38:12] [INFO ] Implicit Places using invariants and state equation in 4471 ms returned []
Implicit Place search using SMT with State Equation took 4790 ms to find 0 implicit places.
[2024-05-30 02:38:12] [INFO ] Redundant transitions in 115 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 : 507/2704 places, 2197/2197 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4942 ms. Remains : 507/2704 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 151 ms :[(OR (NOT p2) (NOT p1)), (NOT p2), (NOT p2), (NOT p1)]
Running random walk in product with property : Sudoku-COL-AN13-LTLCardinality-07
Product exploration timeout after 78850 steps with 531 reset in 10001 ms.
Product exploration timeout after 77990 steps with 526 reset in 10001 ms.
Computed a total of 507 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 507 transition count 2197
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 p2 p1), (X p1), (X p2), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 121 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 86 ms :[(NOT p2), (NOT p2)]
RANDOM walk for 40000 steps (268 resets) in 5275 ms. (7 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 548 ms. (72 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 233769 steps, run timeout after 3001 ms. (steps per millisecond=77 ) properties seen :0 out of 1
Probabilistic random walk after 233769 steps, saw 218466 distinct states, run finished after 3001 ms. (steps per millisecond=77 ) properties seen :0
[2024-05-30 02:38:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 326/495 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/495 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 12/507 variables, 12/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/507 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2197/2704 variables, 507/545 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2704 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/2704 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2704/2704 variables, and 545 constraints, problems are : Problem set: 0 solved, 1 unsolved in 692 ms.
Refiners :[Generalized P Invariants (flows): 38/38 constraints, State Equation: 507/507 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 326/495 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/495 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 12/507 variables, 12/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/507 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2704/2704 variables, and 545 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1214 ms.
Refiners :[Generalized P Invariants (flows): 38/38 constraints, State Equation: 507/507 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 1946ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 168 steps, including 0 resets, run visited all 1 properties in 7 ms. (steps per millisecond=24 )
Parikh walk visited 1 properties in 7 ms.
Knowledge obtained : [(AND p2 p1), (X p1), (X p2), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p2))]
Knowledge based reduction with 5 factoid took 160 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 p2), (NOT p2)]
Stuttering acceptance computed with spot in 64 ms :[(NOT p2), (NOT p2)]
Support contains 169 out of 507 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 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 17 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2024-05-30 02:38:40] [INFO ] Invariant cache hit.
[2024-05-30 02:38:40] [INFO ] Implicit Places using invariants in 234 ms returned []
[2024-05-30 02:38:40] [INFO ] Invariant cache hit.
[2024-05-30 02:38:45] [INFO ] Implicit Places using invariants and state equation in 4650 ms returned []
Implicit Place search using SMT with State Equation took 4886 ms to find 0 implicit places.
[2024-05-30 02:38:45] [INFO ] Redundant transitions in 38 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 1ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 4952 ms. Remains : 507/507 places, 2197/2197 transitions.
Computed a total of 507 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 507 transition count 2197
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 : [p2, (X p2), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 83 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 86 ms :[(NOT p2), (NOT p2)]
RANDOM walk for 40000 steps (268 resets) in 5144 ms. (7 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 498 ms. (80 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 235299 steps, run timeout after 3001 ms. (steps per millisecond=78 ) properties seen :0 out of 1
Probabilistic random walk after 235299 steps, saw 218689 distinct states, run finished after 3001 ms. (steps per millisecond=78 ) properties seen :0
[2024-05-30 02:38:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 326/495 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/495 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 12/507 variables, 12/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/507 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2197/2704 variables, 507/545 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2704 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/2704 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2704/2704 variables, and 545 constraints, problems are : Problem set: 0 solved, 1 unsolved in 712 ms.
Refiners :[Generalized P Invariants (flows): 38/38 constraints, State Equation: 507/507 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 326/495 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/495 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 12/507 variables, 12/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/507 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2704/2704 variables, and 545 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1200 ms.
Refiners :[Generalized P Invariants (flows): 38/38 constraints, State Equation: 507/507 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 1959ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 168 steps, including 0 resets, run visited all 1 properties in 8 ms. (steps per millisecond=21 )
Parikh walk visited 1 properties in 9 ms.
Knowledge obtained : [p2, (X p2), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT p2))]
Knowledge based reduction with 3 factoid took 130 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 80 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 72 ms :[(NOT p2), (NOT p2)]
Product exploration timeout after 79040 steps with 533 reset in 10001 ms.
Product exploration timeout after 77520 steps with 522 reset in 10001 ms.
Built C files in :
/tmp/ltsmin9388582375953141350
[2024-05-30 02:39:12] [INFO ] Too many transitions (2197) to apply POR reductions. Disabling POR matrices.
[2024-05-30 02:39:12] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9388582375953141350
Running compilation step : cd /tmp/ltsmin9388582375953141350;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9388582375953141350;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9388582375953141350;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 169 out of 507 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 22 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2024-05-30 02:39:15] [INFO ] Invariant cache hit.
[2024-05-30 02:39:16] [INFO ] Implicit Places using invariants in 384 ms returned []
[2024-05-30 02:39:16] [INFO ] Invariant cache hit.
[2024-05-30 02:39:21] [INFO ] Implicit Places using invariants and state equation in 5277 ms returned []
Implicit Place search using SMT with State Equation took 5662 ms to find 0 implicit places.
[2024-05-30 02:39:21] [INFO ] Redundant transitions in 33 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 5732 ms. Remains : 507/507 places, 2197/2197 transitions.
Built C files in :
/tmp/ltsmin13726933440805510520
[2024-05-30 02:39:21] [INFO ] Too many transitions (2197) to apply POR reductions. Disabling POR matrices.
[2024-05-30 02:39:21] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13726933440805510520
Running compilation step : cd /tmp/ltsmin13726933440805510520;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13726933440805510520;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13726933440805510520;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-30 02:39:24] [INFO ] Flatten gal took : 69 ms
[2024-05-30 02:39:24] [INFO ] Flatten gal took : 69 ms
[2024-05-30 02:39:24] [INFO ] Time to serialize gal into /tmp/LTL6228660801615673249.gal : 13 ms
[2024-05-30 02:39:24] [INFO ] Time to serialize properties into /tmp/LTL16051430147689512417.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6228660801615673249.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7582783216942317413.hoa' '-atoms' '/tmp/LTL16051430147689512417.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/LTL16051430147689512417.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7582783216942317413.hoa
Detected timeout of ITS tools.
[2024-05-30 02:39:39] [INFO ] Flatten gal took : 62 ms
[2024-05-30 02:39:40] [INFO ] Flatten gal took : 61 ms
[2024-05-30 02:39:40] [INFO ] Time to serialize gal into /tmp/LTL8565345710976189047.gal : 8 ms
[2024-05-30 02:39:40] [INFO ] Time to serialize properties into /tmp/LTL9619973851512063878.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/LTL8565345710976189047.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9619973851512063878.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...275
Read 1 LTL properties
Checking formula 0 : !((F((("(((((((((Rows_0+Rows_1)+(Rows_2+Rows_3))+((Rows_4+Rows_5)+(Rows_6+Rows_7)))+(((Rows_8+Rows_9)+(Rows_10+Rows_11))+((Rows_12+Row...9312
Formula 0 simplified : FG!"(((((((((Rows_0+Rows_1)+(Rows_2+Rows_3))+((Rows_4+Rows_5)+(Rows_6+Rows_7)))+(((Rows_8+Rows_9)+(Rows_10+Rows_11))+((Rows_12+Rows_...7544
Detected timeout of ITS tools.
[2024-05-30 02:39:55] [INFO ] Flatten gal took : 64 ms
[2024-05-30 02:39:55] [INFO ] Applying decomposition
[2024-05-30 02:39:55] [INFO ] Flatten gal took : 77 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/graph8677036283818300586.txt' '-o' '/tmp/graph8677036283818300586.bin' '-w' '/tmp/graph8677036283818300586.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8677036283818300586.bin' '-l' '-1' '-v' '-w' '/tmp/graph8677036283818300586.weights' '-q' '0' '-e' '0.001'
[2024-05-30 02:39:55] [INFO ] Decomposing Gal with order
[2024-05-30 02:39:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 02:39:57] [INFO ] Removed a total of 6084 redundant transitions.
[2024-05-30 02:39:57] [INFO ] Flatten gal took : 1437 ms
[2024-05-30 02:39:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 17 ms.
[2024-05-30 02:39:57] [INFO ] Time to serialize gal into /tmp/LTL219363050034404767.gal : 12 ms
[2024-05-30 02:39:57] [INFO ] Time to serialize properties into /tmp/LTL9120924701888499581.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/LTL219363050034404767.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9120924701888499581.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 : !((F((("(((((((((gu0.Rows_0+gu0.Rows_1)+(gu0.Rows_2+gu0.Rows_3))+((gu0.Rows_4+gu0.Rows_5)+(gu0.Rows_6+gu0.Rows_7)))+(((gu0.Rows_8+gu0....13030
Formula 0 simplified : FG!"(((((((((gu0.Rows_0+gu0.Rows_1)+(gu0.Rows_2+gu0.Rows_3))+((gu0.Rows_4+gu0.Rows_5)+(gu0.Rows_6+gu0.Rows_7)))+(((gu0.Rows_8+gu0.Ro...10586
Detected timeout of ITS tools.
Treatment of property Sudoku-COL-AN13-LTLCardinality-07 finished in 124550 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 169 out of 2704 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Reduce places removed 2197 places and 0 transitions.
Iterating post reduction 0 with 2197 rules applied. Total rules applied 2197 place count 507 transition count 2197
Applied a total of 2197 rules in 32 ms. Remains 507 /2704 variables (removed 2197) and now considering 2197/2197 (removed 0) transitions.
[2024-05-30 02:40:12] [INFO ] Invariant cache hit.
[2024-05-30 02:40:12] [INFO ] Implicit Places using invariants in 392 ms returned []
[2024-05-30 02:40:12] [INFO ] Invariant cache hit.
[2024-05-30 02:40:17] [INFO ] Implicit Places using invariants and state equation in 4752 ms returned []
Implicit Place search using SMT with State Equation took 5149 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 : 507/2704 places, 2197/2197 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5182 ms. Remains : 507/2704 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 99 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN13-LTLCardinality-09
Product exploration timeout after 75980 steps with 512 reset in 10002 ms.
Product exploration timeout after 75300 steps with 507 reset in 10001 ms.
Computed a total of 507 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 507 transition count 2197
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), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 81 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 67 ms :[true, (NOT p0)]
RANDOM walk for 40000 steps (268 resets) in 5221 ms. (7 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 466 ms. (85 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 227448 steps, run timeout after 3001 ms. (steps per millisecond=75 ) properties seen :0 out of 1
Probabilistic random walk after 227448 steps, saw 217260 distinct states, run finished after 3001 ms. (steps per millisecond=75 ) properties seen :0
[2024-05-30 02:40:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 332/501 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/501 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/507 variables, 6/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/507 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2704/2704 variables, and 545 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1378 ms.
Refiners :[Generalized P Invariants (flows): 38/38 constraints, State Equation: 507/507 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 332/501 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/501 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/507 variables, 6/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/507 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2704/2704 variables, and 545 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1326 ms.
Refiners :[Generalized P Invariants (flows): 38/38 constraints, State Equation: 507/507 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 2757ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 169 steps, including 0 resets, run visited all 1 properties in 7 ms. (steps per millisecond=24 )
Parikh walk visited 1 properties in 7 ms.
Knowledge obtained : [p0, (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 3 factoid took 130 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-COL-AN13-LTLCardinality-09 FALSE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN13-LTLCardinality-09 finished in 33235 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 2535 out of 2704 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 28 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
// Phase 1: matrix 2197 rows 2704 cols
[2024-05-30 02:40:45] [INFO ] Computed 507 invariants in 13 ms
[2024-05-30 02:40:46] [INFO ] Implicit Places using invariants in 701 ms returned []
[2024-05-30 02:40:46] [INFO ] Invariant cache hit.
[2024-05-30 02:40:48] [INFO ] Implicit Places using invariants and state equation in 2061 ms returned []
Implicit Place search using SMT with State Equation took 2765 ms to find 0 implicit places.
[2024-05-30 02:40:48] [INFO ] Redundant transitions in 39 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 2838 ms. Remains : 2704/2704 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN13-LTLCardinality-10
Stuttering criterion allowed to conclude after 145 steps with 0 reset in 31 ms.
FORMULA Sudoku-COL-AN13-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN13-LTLCardinality-10 finished in 2970 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 507 out of 2704 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Graph (complete) has 6591 edges and 2704 vertex of which 507 are kept as prefixes of interest. Removing 2197 places using SCC suffix rule.6 ms
Discarding 2197 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 27 ms. Remains 507 /2704 variables (removed 2197) and now considering 2197/2197 (removed 0) transitions.
// Phase 1: matrix 2197 rows 507 cols
[2024-05-30 02:40:48] [INFO ] Computed 38 invariants in 56 ms
[2024-05-30 02:40:48] [INFO ] Implicit Places using invariants in 148 ms returned []
[2024-05-30 02:40:48] [INFO ] Invariant cache hit.
[2024-05-30 02:40:50] [INFO ] Implicit Places using invariants and state equation in 1643 ms returned []
Implicit Place search using SMT with State Equation took 1794 ms to find 0 implicit places.
[2024-05-30 02:40:50] [INFO ] Redundant transitions in 37 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 : 507/2704 places, 2197/2197 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1863 ms. Remains : 507/2704 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-COL-AN13-LTLCardinality-12
Product exploration timeout after 59550 steps with 401 reset in 10002 ms.
Product exploration timeout after 59610 steps with 402 reset in 10003 ms.
Computed a total of 507 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 507 transition count 2197
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), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 88 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
RANDOM walk for 40000 steps (268 resets) in 6258 ms. (6 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1191 ms. (33 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 97982 steps, run timeout after 3010 ms. (steps per millisecond=32 ) properties seen :0 out of 1
Probabilistic random walk after 97982 steps, saw 97914 distinct states, run finished after 3010 ms. (steps per millisecond=32 ) properties seen :0
[2024-05-30 02:41:16] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/507 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/507 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2704/2704 variables, and 545 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1172 ms.
Refiners :[Generalized P Invariants (flows): 38/38 constraints, State Equation: 507/507 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/507 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/507 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2704/2704 variables, and 545 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1308 ms.
Refiners :[Generalized P Invariants (flows): 38/38 constraints, State Equation: 507/507 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 2540ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 507 out of 507 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 11 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 507/507 places, 2197/2197 transitions.
RANDOM walk for 40000 steps (268 resets) in 7801 ms. (5 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1414 ms. (28 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 226352 steps, run timeout after 6001 ms. (steps per millisecond=37 ) properties seen :0 out of 1
Probabilistic random walk after 226352 steps, saw 216985 distinct states, run finished after 6001 ms. (steps per millisecond=37 ) properties seen :0
[2024-05-30 02:41:27] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/507 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/507 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 2197/2704 variables, 507/545 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2704 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 0/2704 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2704/2704 variables, and 545 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1220 ms.
Refiners :[Generalized P Invariants (flows): 38/38 constraints, State Equation: 507/507 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/507 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/507 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 2197/2704 variables, 507/545 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2704 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 0/2704 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2704/2704 variables, and 545 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1618 ms.
Refiners :[Generalized P Invariants (flows): 38/38 constraints, State Equation: 507/507 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 2951ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 167 steps, including 0 resets, run visited all 1 properties in 11 ms. (steps per millisecond=15 )
Parikh walk visited 1 properties in 11 ms.
Knowledge obtained : [p0, (X p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 98 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Support contains 507 out of 507 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 9 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2024-05-30 02:41:30] [INFO ] Invariant cache hit.
[2024-05-30 02:41:30] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-30 02:41:30] [INFO ] Invariant cache hit.
[2024-05-30 02:41:32] [INFO ] Implicit Places using invariants and state equation in 1608 ms returned []
Implicit Place search using SMT with State Equation took 1687 ms to find 0 implicit places.
[2024-05-30 02:41:32] [INFO ] Redundant transitions in 37 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 1743 ms. Remains : 507/507 places, 2197/2197 transitions.
Computed a total of 507 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 507 transition count 2197
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), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 85 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
RANDOM walk for 40000 steps (268 resets) in 8570 ms. (4 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1511 ms. (26 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 226372 steps, run timeout after 6001 ms. (steps per millisecond=37 ) properties seen :0 out of 1
Probabilistic random walk after 226372 steps, saw 216989 distinct states, run finished after 6001 ms. (steps per millisecond=37 ) properties seen :0
[2024-05-30 02:41:41] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/507 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/507 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2704/2704 variables, and 545 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1170 ms.
Refiners :[Generalized P Invariants (flows): 38/38 constraints, State Equation: 507/507 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/507 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/507 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2704/2704 variables, and 545 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1337 ms.
Refiners :[Generalized P Invariants (flows): 38/38 constraints, State Equation: 507/507 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 2581ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 507 out of 507 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 16 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 507/507 places, 2197/2197 transitions.
RANDOM walk for 40000 steps (268 resets) in 7674 ms. (5 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1474 ms. (27 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 226358 steps, run timeout after 6001 ms. (steps per millisecond=37 ) properties seen :0 out of 1
Probabilistic random walk after 226358 steps, saw 216985 distinct states, run finished after 6001 ms. (steps per millisecond=37 ) properties seen :0
[2024-05-30 02:41:52] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/507 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/507 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 2197/2704 variables, 507/545 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2704 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 0/2704 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2704/2704 variables, and 545 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1252 ms.
Refiners :[Generalized P Invariants (flows): 38/38 constraints, State Equation: 507/507 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/507 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/507 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 2197/2704 variables, 507/545 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2704 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 0/2704 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2704/2704 variables, and 545 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1591 ms.
Refiners :[Generalized P Invariants (flows): 38/38 constraints, State Equation: 507/507 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 2913ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 167 steps, including 0 resets, run visited all 1 properties in 11 ms. (steps per millisecond=15 )
Parikh walk visited 1 properties in 10 ms.
Knowledge obtained : [p0, (X p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 110 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Product exploration timeout after 60000 steps with 404 reset in 10002 ms.
Product exploration timeout after 59620 steps with 402 reset in 10003 ms.
Built C files in :
/tmp/ltsmin8217960647986268162
[2024-05-30 02:42:15] [INFO ] Too many transitions (2197) to apply POR reductions. Disabling POR matrices.
[2024-05-30 02:42:15] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8217960647986268162
Running compilation step : cd /tmp/ltsmin8217960647986268162;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8217960647986268162;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8217960647986268162;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 507 out of 507 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 6 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2024-05-30 02:42:18] [INFO ] Invariant cache hit.
[2024-05-30 02:42:18] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-30 02:42:18] [INFO ] Invariant cache hit.
[2024-05-30 02:42:20] [INFO ] Implicit Places using invariants and state equation in 1600 ms returned []
Implicit Place search using SMT with State Equation took 1681 ms to find 0 implicit places.
[2024-05-30 02:42:20] [INFO ] Redundant transitions in 35 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 1731 ms. Remains : 507/507 places, 2197/2197 transitions.
Built C files in :
/tmp/ltsmin7275418640031943542
[2024-05-30 02:42:20] [INFO ] Too many transitions (2197) to apply POR reductions. Disabling POR matrices.
[2024-05-30 02:42:20] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7275418640031943542
Running compilation step : cd /tmp/ltsmin7275418640031943542;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7275418640031943542;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7275418640031943542;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-30 02:42:24] [INFO ] Flatten gal took : 122 ms
[2024-05-30 02:42:24] [INFO ] Flatten gal took : 114 ms
[2024-05-30 02:42:24] [INFO ] Time to serialize gal into /tmp/LTL14969339310700663223.gal : 11 ms
[2024-05-30 02:42:24] [INFO ] Time to serialize properties into /tmp/LTL13320954181724419987.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14969339310700663223.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3179363865547147128.hoa' '-atoms' '/tmp/LTL13320954181724419987.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL13320954181724419987.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3179363865547147128.hoa
Detected timeout of ITS tools.
[2024-05-30 02:42:39] [INFO ] Flatten gal took : 68 ms
[2024-05-30 02:42:39] [INFO ] Flatten gal took : 69 ms
[2024-05-30 02:42:39] [INFO ] Time to serialize gal into /tmp/LTL13586840701785346352.gal : 55 ms
[2024-05-30 02:42:39] [INFO ] Time to serialize properties into /tmp/LTL3664934220670259331.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/LTL13586840701785346352.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3664934220670259331.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(G("((((((((((Cells_0+Cells_1)+(Cells_2+Cells_3))+((Cells_4+Cells_5)+(Cells_6+Cells_7)))+(((Cells_8+Cells_9)+(Cells_10+Cells_11))+...5961
Formula 0 simplified : GF!"((((((((((Cells_0+Cells_1)+(Cells_2+Cells_3))+((Cells_4+Cells_5)+(Cells_6+Cells_7)))+(((Cells_8+Cells_9)+(Cells_10+Cells_11))+((...5955
Detected timeout of ITS tools.
[2024-05-30 02:42:54] [INFO ] Flatten gal took : 77 ms
[2024-05-30 02:42:54] [INFO ] Applying decomposition
[2024-05-30 02:42:54] [INFO ] Flatten gal took : 76 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/graph1327443440944866821.txt' '-o' '/tmp/graph1327443440944866821.bin' '-w' '/tmp/graph1327443440944866821.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1327443440944866821.bin' '-l' '-1' '-v' '-w' '/tmp/graph1327443440944866821.weights' '-q' '0' '-e' '0.001'
[2024-05-30 02:42:54] [INFO ] Decomposing Gal with order
[2024-05-30 02:42:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 02:42:57] [INFO ] Removed a total of 2028 redundant transitions.
[2024-05-30 02:42:57] [INFO ] Flatten gal took : 2710 ms
[2024-05-30 02:42:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 2197 labels/synchronizations in 174 ms.
[2024-05-30 02:42:58] [INFO ] Time to serialize gal into /tmp/LTL1402581444418976967.gal : 15 ms
[2024-05-30 02:42:58] [INFO ] Time to serialize properties into /tmp/LTL9507832601632198159.ltl : 6 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/LTL1402581444418976967.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9507832601632198159.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...275
Read 1 LTL properties
Checking formula 0 : !((F(G("((((((((((gu1.Cells_0+gu1.Cells_1)+(gu1.Cells_2+gu1.Cells_3))+((gu1.Cells_4+gu1.Cells_5)+(gu1.Cells_6+gu1.Cells_7)))+(((gu1.Ce...7989
Formula 0 simplified : GF!"((((((((((gu1.Cells_0+gu1.Cells_1)+(gu1.Cells_2+gu1.Cells_3))+((gu1.Cells_4+gu1.Cells_5)+(gu1.Cells_6+gu1.Cells_7)))+(((gu1.Cell...7983
Detected timeout of ITS tools.
Treatment of property Sudoku-COL-AN13-LTLCardinality-12 finished in 144546 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 2366 out of 2704 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 32 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
// Phase 1: matrix 2197 rows 2704 cols
[2024-05-30 02:43:13] [INFO ] Computed 507 invariants in 11 ms
[2024-05-30 02:43:14] [INFO ] Implicit Places using invariants in 981 ms returned []
[2024-05-30 02:43:14] [INFO ] Invariant cache hit.
[2024-05-30 02:43:16] [INFO ] Implicit Places using invariants and state equation in 2374 ms returned []
Implicit Place search using SMT with State Equation took 3356 ms to find 0 implicit places.
[2024-05-30 02:43:16] [INFO ] Redundant transitions in 34 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 3435 ms. Remains : 2704/2704 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-COL-AN13-LTLCardinality-15
Product exploration timeout after 41300 steps with 480 reset in 10002 ms.
Product exploration timeout after 41000 steps with 476 reset in 10002 ms.
Computed a total of 2704 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2704 transition count 2197
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 (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 77 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
RANDOM walk for 340 steps (0 resets) in 103 ms. (3 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 92 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
[2024-05-30 02:43:39] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
Support contains 2366 out of 2704 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 31 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2024-05-30 02:43:54] [INFO ] Invariant cache hit.
[2024-05-30 02:43:55] [INFO ] Implicit Places using invariants in 926 ms returned []
[2024-05-30 02:43:55] [INFO ] Invariant cache hit.
[2024-05-30 02:43:57] [INFO ] Implicit Places using invariants and state equation in 2520 ms returned []
Implicit Place search using SMT with State Equation took 3449 ms to find 0 implicit places.
[2024-05-30 02:43:57] [INFO ] Redundant transitions in 38 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 3522 ms. Remains : 2704/2704 places, 2197/2197 transitions.
Computed a total of 2704 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2704 transition count 2197
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 (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 71 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 58 ms :[(NOT p0)]
RANDOM walk for 340 steps (0 resets) in 117 ms. (2 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 94 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
[2024-05-30 02:44:00] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Product exploration timeout after 41380 steps with 481 reset in 10001 ms.
Product exploration timeout after 41220 steps with 479 reset in 10001 ms.
Built C files in :
/tmp/ltsmin3907654966692594329
[2024-05-30 02:44:35] [INFO ] Too many transitions (2197) to apply POR reductions. Disabling POR matrices.
[2024-05-30 02:44:35] [INFO ] Built C files in 35ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3907654966692594329
Running compilation step : cd /tmp/ltsmin3907654966692594329;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3907654966692594329;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3907654966692594329;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 2366 out of 2704 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 29 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2024-05-30 02:44:38] [INFO ] Invariant cache hit.
[2024-05-30 02:44:39] [INFO ] Implicit Places using invariants in 980 ms returned []
[2024-05-30 02:44:39] [INFO ] Invariant cache hit.
[2024-05-30 02:44:41] [INFO ] Implicit Places using invariants and state equation in 2556 ms returned []
Implicit Place search using SMT with State Equation took 3539 ms to find 0 implicit places.
[2024-05-30 02:44:41] [INFO ] Redundant transitions in 39 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 1ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 3612 ms. Remains : 2704/2704 places, 2197/2197 transitions.
Built C files in :
/tmp/ltsmin8044966099136501513
[2024-05-30 02:44:41] [INFO ] Too many transitions (2197) to apply POR reductions. Disabling POR matrices.
[2024-05-30 02:44:41] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8044966099136501513
Running compilation step : cd /tmp/ltsmin8044966099136501513;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8044966099136501513;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8044966099136501513;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-30 02:44:44] [INFO ] Flatten gal took : 95 ms
[2024-05-30 02:44:45] [INFO ] Flatten gal took : 86 ms
[2024-05-30 02:44:45] [INFO ] Time to serialize gal into /tmp/LTL4294666066661847061.gal : 11 ms
[2024-05-30 02:44:45] [INFO ] Time to serialize properties into /tmp/LTL10571658770164201785.prop : 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/LTL4294666066661847061.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16467630724379205418.hoa' '-atoms' '/tmp/LTL10571658770164201785.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL10571658770164201785.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16467630724379205418.hoa
Detected timeout of ITS tools.
[2024-05-30 02:45:00] [INFO ] Flatten gal took : 80 ms
[2024-05-30 02:45:00] [INFO ] Flatten gal took : 84 ms
[2024-05-30 02:45:00] [INFO ] Time to serialize gal into /tmp/LTL3799055220719702620.gal : 11 ms
[2024-05-30 02:45:00] [INFO ] Time to serialize properties into /tmp/LTL6579587682855893552.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/LTL3799055220719702620.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6579587682855893552.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...275
Read 1 LTL properties
Checking formula 0 : !((F("((((((((((Columns_0+Columns_1)+(Columns_2+Columns_3))+((Columns_4+Columns_5)+(Columns_6+Columns_7)))+(((Columns_8+Columns_9)+(Co...57193
Formula 0 simplified : G!"((((((((((Columns_0+Columns_1)+(Columns_2+Columns_3))+((Columns_4+Columns_5)+(Columns_6+Columns_7)))+(((Columns_8+Columns_9)+(Col...57189
Detected timeout of ITS tools.
[2024-05-30 02:45:15] [INFO ] Flatten gal took : 80 ms
[2024-05-30 02:45:15] [INFO ] Applying decomposition
[2024-05-30 02:45:15] [INFO ] Flatten gal took : 80 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/graph13160849116983729147.txt' '-o' '/tmp/graph13160849116983729147.bin' '-w' '/tmp/graph13160849116983729147.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13160849116983729147.bin' '-l' '-1' '-v' '-w' '/tmp/graph13160849116983729147.weights' '-q' '0' '-e' '0.001'
[2024-05-30 02:45:26] [INFO ] Decomposing Gal with order
[2024-05-30 02:45:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 02:45:29] [INFO ] Removed a total of 2028 redundant transitions.
[2024-05-30 02:45:29] [INFO ] Flatten gal took : 2622 ms
[2024-05-30 02:45:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 2197 labels/synchronizations in 74 ms.
[2024-05-30 02:45:29] [INFO ] Time to serialize gal into /tmp/LTL16193431434666310283.gal : 12 ms
[2024-05-30 02:45:29] [INFO ] Time to serialize properties into /tmp/LTL15646150250847524181.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/LTL16193431434666310283.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15646150250847524181.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F("((((((((((gu1.Columns_0+gu1.Columns_1)+(gu1.Columns_2+gu1.Columns_3))+((gu1.Columns_4+gu1.Columns_5)+(gu1.Columns_6+gu1.Columns_...75445
Formula 0 simplified : G!"((((((((((gu1.Columns_0+gu1.Columns_1)+(gu1.Columns_2+gu1.Columns_3))+((gu1.Columns_4+gu1.Columns_5)+(gu1.Columns_6+gu1.Columns_7...75441
Detected timeout of ITS tools.
Treatment of property Sudoku-COL-AN13-LTLCardinality-15 finished in 151550 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X((p0 U (X(p1) U (X(G(p1))||(p1&&X(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' '!(F(((p0 U p1)&&G(F(p2)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
[2024-05-30 02:45:45] [INFO ] Flatten gal took : 85 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin18146696972092939444
[2024-05-30 02:45:45] [INFO ] Too many transitions (2197) to apply POR reductions. Disabling POR matrices.
[2024-05-30 02:45:45] [INFO ] Built C files in 44ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18146696972092939444
Running compilation step : cd /tmp/ltsmin18146696972092939444;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '180' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-30 02:45:45] [INFO ] Applying decomposition
[2024-05-30 02:45:45] [INFO ] Flatten gal took : 87 ms
Compilation finished in 8372 ms.
Running link step : cd /tmp/ltsmin18146696972092939444;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 65 ms.
Running LTSmin : cd /tmp/ltsmin18146696972092939444;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([]((LTLAPp0==true))||X(((LTLAPp0==true) U (X((LTLAPp1==true)) U (X([]((LTLAPp1==true)))||((LTLAPp1==true)&&X((LTLAPp1==true))))))))' '--buchi-type=spotba'
[2024-05-30 02:46:29] [WARNING] Could not apply decomposition. Using flat GAL structure.
java.util.concurrent.TimeoutException: Subprocess running '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph9930957919908209058.txt' '-o' '/tmp/graph9930957919908209058.bin' '-w' '/tmp/graph9930957919908209058.weights' killed by timeout after 10 SECONDS
at fr.lip6.move.gal.process.Runner.waitForOrTimeout(Runner.java:76)
at fr.lip6.move.gal.process.Runner.runTool(Runner.java:47)
at fr.lip6.move.gal.process.Runner.runTool(Runner.java:27)
at fr.lip6.move.gal.louvain.GraphBuilder.convertGraphToBin(GraphBuilder.java:258)
at fr.lip6.move.gal.louvain.GraphBuilder.computeLouvain(GraphBuilder.java:189)
at fr.lip6.move.gal.louvain.GraphBuilder.computeLouvain(GraphBuilder.java:157)
at fr.lip6.move.gal.application.mcc.MccTranslator.applyOrder(MccTranslator.java:114)
at fr.lip6.move.gal.application.mcc.MccTranslator.flattenSpec(MccTranslator.java:230)
at fr.lip6.move.gal.application.runner.its.MultiOrderRunner.runMultiITS(MultiOrderRunner.java:106)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:1011)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-30 02:46:29] [INFO ] Flatten gal took : 263 ms
[2024-05-30 02:46:30] [INFO ] Time to serialize gal into /tmp/LTLCardinality13031317371318147011.gal : 23 ms
[2024-05-30 02:46:30] [INFO ] Time to serialize properties into /tmp/LTLCardinality8845599912034616355.ltl : 15 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/LTLCardinality13031317371318147011.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality8845599912034616355.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 4 LTL properties
Checking formula 0 : !(((G("(((((((((Cells_0+Cells_1)+(Cells_2+Cells_3))+((Cells_4+Cells_5)+(Cells_6+Cells_7)))+(((Cells_8+Cells_9)+(Cells_10+Cells_11))+((...113732
Formula 0 simplified : F!"(((((((((Cells_0+Cells_1)+(Cells_2+Cells_3))+((Cells_4+Cells_5)+(Cells_6+Cells_7)))+(((Cells_8+Cells_9)+(Cells_10+Cells_11))+((Ce...113718
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.002: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.021: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.021: LTL layer: formula: ([]((LTLAPp0==true))||X(((LTLAPp0==true) U (X((LTLAPp1==true)) U (X([]((LTLAPp1==true)))||((LTLAPp1==true)&&X((LTLAPp1==true))))))))
pins2lts-mc-linux64( 1/ 8), 0.022: "([]((LTLAPp0==true))||X(((LTLAPp0==true) U (X((LTLAPp1==true)) U (X([]((LTLAPp1==true)))||((LTLAPp1==true)&&X((LTLAPp1==true))))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.023: Using Spin LTL semantics
pins2lts-mc-linux64( 2/ 8), 0.028: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.045: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.067: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.080: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.087: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.087: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.089: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.128: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 4.175: DFS-FIFO for weak LTL, using special progress label 2205
pins2lts-mc-linux64( 0/ 8), 4.175: There are 2206 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 4.175: State length is 2705, there are 2215 groups
pins2lts-mc-linux64( 0/ 8), 4.175: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 4.175: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 4.175: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 4.175: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 3/ 8), 39.501: ~1 levels ~960 states ~2073896 transitions
pins2lts-mc-linux64( 3/ 8), 53.334: ~1 levels ~1920 states ~4147496 transitions
pins2lts-mc-linux64( 3/ 8), 81.270: ~1 levels ~3840 states ~8294696 transitions
pins2lts-mc-linux64( 7/ 8), 108.172: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 142.512:
pins2lts-mc-linux64( 0/ 8), 142.512: mean standard work distribution: 2.8% (states) 3.2% (transitions)
pins2lts-mc-linux64( 0/ 8), 142.512:
pins2lts-mc-linux64( 0/ 8), 142.512: Explored 5475 states 11701761 transitions, fanout: 2137.308
pins2lts-mc-linux64( 0/ 8), 142.512: Total exploration time 138.320 sec (105.660 sec minimum, 128.470 sec on average)
pins2lts-mc-linux64( 0/ 8), 142.512: States per second: 40, Transitions per second: 84599
pins2lts-mc-linux64( 0/ 8), 142.512:
pins2lts-mc-linux64( 0/ 8), 142.512: Progress states detected: 8571086
pins2lts-mc-linux64( 0/ 8), 142.512: Redundant explorations: -99.9361
pins2lts-mc-linux64( 0/ 8), 142.512:
pins2lts-mc-linux64( 0/ 8), 142.512: Queue width: 8B, total height: 10932550, memory: 83.41MB
pins2lts-mc-linux64( 0/ 8), 142.512: Tree memory: 321.4MB, 39.3 B/state, compr.: 0.4%
pins2lts-mc-linux64( 0/ 8), 142.512: Tree fill ratio (roots/leafs): 6.0%/100.0%
pins2lts-mc-linux64( 0/ 8), 142.512: Stored 2289 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 142.512: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 142.512: Est. total memory use: 404.8MB (~1107.4MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin18146696972092939444;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([]((LTLAPp0==true))||X(((LTLAPp0==true) U (X((LTLAPp1==true)) U (X([]((LTLAPp1==true)))||((LTLAPp1==true)&&X((LTLAPp1==true))))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin18146696972092939444;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([]((LTLAPp0==true))||X(((LTLAPp0==true) U (X((LTLAPp1==true)) U (X([]((LTLAPp1==true)))||((LTLAPp1==true)&&X((LTLAPp1==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 02:55:49] [INFO ] Applying decomposition
[2024-05-30 02:55:49] [INFO ] Flatten gal took : 101 ms
[2024-05-30 02:55:49] [INFO ] Decomposing Gal with order
[2024-05-30 02:55:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 02:55:50] [INFO ] Removed a total of 5421 redundant transitions.
[2024-05-30 02:55:50] [INFO ] Flatten gal took : 183 ms
[2024-05-30 02:55:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 10 ms.
[2024-05-30 02:55:51] [INFO ] Time to serialize gal into /tmp/LTLCardinality16807403238384880908.gal : 19 ms
[2024-05-30 02:55:51] [INFO ] Time to serialize properties into /tmp/LTLCardinality17749251586662845647.ltl : 11 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/LTLCardinality16807403238384880908.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality17749251586662845647.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...299
Read 4 LTL properties
Checking formula 0 : !(((G("(((((((((gNN0.Cells_0+gNN1.Cells_1)+(gNN2.Cells_2+gNN3.Cells_3))+((gNN4.Cells_4+gNN5.Cells_5)+(gNN6.Cells_6+gNN7.Cells_7)))+(((...190530
Formula 0 simplified : F!"(((((((((gNN0.Cells_0+gNN1.Cells_1)+(gNN2.Cells_2+gNN3.Cells_3))+((gNN4.Cells_4+gNN5.Cells_5)+(gNN6.Cells_6+gNN7.Cells_7)))+(((gN...190516
ITS-tools command line returned an error code 137
[2024-05-30 03:04:33] [INFO ] Flatten gal took : 99 ms
[2024-05-30 03:04:34] [INFO ] Input system was already deterministic with 2197 transitions.
[2024-05-30 03:04:34] [INFO ] Transformed 2704 places.
[2024-05-30 03:04:34] [INFO ] Transformed 2197 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 03:04:35] [INFO ] Time to serialize gal into /tmp/LTLCardinality3695434002100096921.gal : 12 ms
[2024-05-30 03:04:35] [INFO ] Time to serialize properties into /tmp/LTLCardinality8623078822522009030.ltl : 13 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/LTLCardinality3695434002100096921.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality8623078822522009030.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 4 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !(((G("(((((((((Cells_0+Cells_1)+(Cells_2+Cells_3))+((Cells_4+Cells_5)+(Cells_6+Cells_7)))+(((Cells_8+Cells_9)+(Cells_10+Cells_11))+((...113732
Formula 0 simplified : F!"(((((((((Cells_0+Cells_1)+(Cells_2+Cells_3))+((Cells_4+Cells_5)+(Cells_6+Cells_7)))+(((Cells_8+Cells_9)+(Cells_10+Cells_11))+((Ce...113718
ITS-tools command line returned an error code 137
Total runtime 2456596 ms.
BK_STOP 1717038763378
--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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-COL-AN13"
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-COL-AN13, 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-171690532500507"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Sudoku-COL-AN13.tgz
mv Sudoku-COL-AN13 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 ;