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.r312-tall-171662337800083.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 QuasiCertifProtocol-PT-18, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r312-tall-171662337800083
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 46K Apr 13 04:07 CTLCardinality.txt
-rw-r--r-- 1 mcc users 318K Apr 13 04:07 CTLCardinality.xml
-rw-r--r-- 1 mcc users 20K Apr 13 04:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 135K Apr 13 04:01 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 16K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 29K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.8K Apr 13 04:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 76K Apr 13 04:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Apr 13 04:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 98K Apr 13 04:10 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.3K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 360K 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 QuasiCertifProtocol-PT-18-LTLCardinality-00
FORMULA_NAME QuasiCertifProtocol-PT-18-LTLCardinality-01
FORMULA_NAME QuasiCertifProtocol-PT-18-LTLCardinality-02
FORMULA_NAME QuasiCertifProtocol-PT-18-LTLCardinality-03
FORMULA_NAME QuasiCertifProtocol-PT-18-LTLCardinality-04
FORMULA_NAME QuasiCertifProtocol-PT-18-LTLCardinality-05
FORMULA_NAME QuasiCertifProtocol-PT-18-LTLCardinality-06
FORMULA_NAME QuasiCertifProtocol-PT-18-LTLCardinality-07
FORMULA_NAME QuasiCertifProtocol-PT-18-LTLCardinality-08
FORMULA_NAME QuasiCertifProtocol-PT-18-LTLCardinality-09
FORMULA_NAME QuasiCertifProtocol-PT-18-LTLCardinality-10
FORMULA_NAME QuasiCertifProtocol-PT-18-LTLCardinality-11
FORMULA_NAME QuasiCertifProtocol-PT-18-LTLCardinality-12
FORMULA_NAME QuasiCertifProtocol-PT-18-LTLCardinality-13
FORMULA_NAME QuasiCertifProtocol-PT-18-LTLCardinality-14
FORMULA_NAME QuasiCertifProtocol-PT-18-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716665614266

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-PT-18
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-05-25 19:33:35] [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-25 19:33:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 19:33:35] [INFO ] Load time of PNML (sax parser for PT used): 95 ms
[2024-05-25 19:33:35] [INFO ] Transformed 1398 places.
[2024-05-25 19:33:35] [INFO ] Transformed 296 transitions.
[2024-05-25 19:33:35] [INFO ] Parsed PT model containing 1398 places and 296 transitions and 3119 arcs in 188 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA QuasiCertifProtocol-PT-18-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-18-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-18-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-18-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-18-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 566 out of 1398 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1398/1398 places, 296/296 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1397 transition count 296
Applied a total of 1 rules in 109 ms. Remains 1397 /1398 variables (removed 1) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 1397 cols
[2024-05-25 19:33:35] [INFO ] Computed 1102 invariants in 41 ms
[2024-05-25 19:33:36] [INFO ] Implicit Places using invariants in 1134 ms returned []
[2024-05-25 19:33:36] [INFO ] Invariant cache hit.
[2024-05-25 19:33:40] [INFO ] Implicit Places using invariants and state equation in 3251 ms returned [834, 835, 836, 837, 838, 839, 840, 841, 842, 843, 947, 948, 950, 951, 952, 953, 954]
Discarding 17 places :
Implicit Place search using SMT with State Equation took 4416 ms to find 17 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1380/1398 places, 296/296 transitions.
Applied a total of 0 rules in 23 ms. Remains 1380 /1380 variables (removed 0) and now considering 296/296 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 4564 ms. Remains : 1380/1398 places, 296/296 transitions.
Support contains 566 out of 1380 places after structural reductions.
[2024-05-25 19:33:40] [INFO ] Flatten gal took : 107 ms
[2024-05-25 19:33:40] [INFO ] Flatten gal took : 61 ms
[2024-05-25 19:33:40] [INFO ] Input system was already deterministic with 296 transitions.
RANDOM walk for 40000 steps (1768 resets) in 1470 ms. (27 steps per ms) remains 15/18 properties
BEST_FIRST walk for 4004 steps (12 resets) in 52 ms. (75 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (12 resets) in 24 ms. (160 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (11 resets) in 20 ms. (190 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (12 resets) in 19 ms. (200 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (12 resets) in 20 ms. (190 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (16 resets) in 18 ms. (210 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (13 resets) in 24 ms. (160 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (13 resets) in 14 ms. (266 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (12 resets) in 20 ms. (190 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (12 resets) in 18 ms. (210 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (12 resets) in 17 ms. (222 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (13 resets) in 13 ms. (286 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (13 resets) in 20 ms. (190 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (13 resets) in 16 ms. (235 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 15/15 properties
// Phase 1: matrix 296 rows 1380 cols
[2024-05-25 19:33:41] [INFO ] Computed 1085 invariants in 21 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/506 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 4/510 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/510 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 506/1016 variables, 744/745 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1016 variables, 0/745 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 364/1380 variables, 340/1085 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1380 variables, 0/1085 constraints. Problems are: Problem set: 0 solved, 15 unsolved
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp16 is UNSAT
At refinement iteration 7 (OVERLAPS) 296/1676 variables, 1380/2465 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1676 variables, 0/2465 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 9 (OVERLAPS) 0/1676 variables, 0/2465 constraints. Problems are: Problem set: 3 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1676/1676 variables, and 2465 constraints, problems are : Problem set: 3 solved, 12 unsolved in 4281 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1084/1084 constraints, State Equation: 1380/1380 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/501 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 4/505 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/505 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 508/1013 variables, 742/743 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1013 variables, 0/743 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 367/1380 variables, 342/1085 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1380 variables, 0/1085 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 296/1676 variables, 1380/2465 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1676 variables, 12/2477 constraints. Problems are: Problem set: 3 solved, 12 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1676/1676 variables, and 2477 constraints, problems are : Problem set: 3 solved, 12 unsolved in 5023 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1084/1084 constraints, State Equation: 1380/1380 constraints, PredecessorRefiner: 12/15 constraints, Known Traps: 0/0 constraints]
After SMT, in 9399ms problems are : Problem set: 3 solved, 12 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 501 out of 1380 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1380/1380 places, 296/296 transitions.
Graph (complete) has 9153 edges and 1380 vertex of which 1361 are kept as prefixes of interest. Removing 19 places using SCC suffix rule.9 ms
Discarding 19 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 57 transitions
Reduce isomorphic transitions removed 57 transitions.
Iterating post reduction 0 with 57 rules applied. Total rules applied 58 place count 1361 transition count 239
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 59 place count 1361 transition count 238
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 60 place count 1360 transition count 238
Applied a total of 60 rules in 146 ms. Remains 1360 /1380 variables (removed 20) and now considering 238/296 (removed 58) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 146 ms. Remains : 1360/1380 places, 238/296 transitions.
RANDOM walk for 40000 steps (1244 resets) in 1137 ms. (35 steps per ms) remains 9/12 properties
BEST_FIRST walk for 40003 steps (84 resets) in 308 ms. (129 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (83 resets) in 123 ms. (322 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (83 resets) in 145 ms. (274 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (84 resets) in 104 ms. (380 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (84 resets) in 96 ms. (412 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (100 resets) in 159 ms. (250 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (72 resets) in 77 ms. (512 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (84 resets) in 56 ms. (701 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (83 resets) in 56 ms. (701 steps per ms) remains 9/9 properties
// Phase 1: matrix 238 rows 1360 cols
[2024-05-25 19:33:51] [INFO ] Computed 1123 invariants in 6 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/442 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 5/447 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/447 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 533/980 variables, 762/763 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/980 variables, 0/763 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 342/1322 variables, 342/1105 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1322 variables, 0/1105 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 238/1560 variables, 1322/2427 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1560 variables, 0/2427 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 38/1598 variables, 38/2465 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1598 variables, 18/2483 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1598 variables, 0/2483 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (OVERLAPS) 0/1598 variables, 0/2483 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1598/1598 variables, and 2483 constraints, problems are : Problem set: 0 solved, 9 unsolved in 2950 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1122/1122 constraints, State Equation: 1360/1360 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/442 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 5/447 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/447 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 533/980 variables, 762/763 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/980 variables, 0/763 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 342/1322 variables, 342/1105 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1322 variables, 0/1105 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 238/1560 variables, 1322/2427 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1560 variables, 8/2435 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1560 variables, 0/2435 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 38/1598 variables, 38/2473 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1598 variables, 18/2491 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1598 variables, 1/2492 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1598 variables, 0/2492 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (OVERLAPS) 0/1598 variables, 0/2492 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1598/1598 variables, and 2492 constraints, problems are : Problem set: 0 solved, 9 unsolved in 36565 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1122/1122 constraints, State Equation: 1360/1360 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 39565ms problems are : Problem set: 0 solved, 9 unsolved
Finished Parikh walk after 12464 steps, including 138 resets, run visited all 2 properties in 85 ms. (steps per millisecond=146 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 9 properties in 784 ms.
Successfully simplified 3 atomic propositions for a total of 11 simplifications.
Computed a total of 1380 stabilizing places and 296 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1380 transition count 296
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(X(G(p0))))'
Support contains 361 out of 1380 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1380/1380 places, 296/296 transitions.
Reduce places removed 41 places and 0 transitions.
Iterating post reduction 0 with 41 rules applied. Total rules applied 41 place count 1339 transition count 296
Applied a total of 41 rules in 27 ms. Remains 1339 /1380 variables (removed 41) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 1339 cols
[2024-05-25 19:34:32] [INFO ] Computed 1045 invariants in 29 ms
[2024-05-25 19:34:33] [INFO ] Implicit Places using invariants in 928 ms returned []
[2024-05-25 19:34:33] [INFO ] Invariant cache hit.
[2024-05-25 19:34:38] [INFO ] Implicit Places using invariants and state equation in 5210 ms returned [916, 917]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 6146 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1337/1380 places, 296/296 transitions.
Applied a total of 0 rules in 257 ms. Remains 1337 /1337 variables (removed 0) and now considering 296/296 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 6432 ms. Remains : 1337/1380 places, 296/296 transitions.
Stuttering acceptance computed with spot in 285 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-18-LTLCardinality-00
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 3 ms.
FORMULA QuasiCertifProtocol-PT-18-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-18-LTLCardinality-00 finished in 6778 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||G(p1))))'
Support contains 76 out of 1380 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1380/1380 places, 296/296 transitions.
Graph (complete) has 9153 edges and 1380 vertex of which 1338 are kept as prefixes of interest. Removing 42 places using SCC suffix rule.15 ms
Discarding 42 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 1337 transition count 293
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 1337 transition count 293
Applied a total of 4 rules in 146 ms. Remains 1337 /1380 variables (removed 43) and now considering 293/296 (removed 3) transitions.
// Phase 1: matrix 293 rows 1337 cols
[2024-05-25 19:34:39] [INFO ] Computed 1046 invariants in 20 ms
[2024-05-25 19:34:42] [INFO ] Implicit Places using invariants in 3829 ms returned []
[2024-05-25 19:34:42] [INFO ] Invariant cache hit.
[2024-05-25 19:34:46] [INFO ] Implicit Places using invariants and state equation in 3944 ms returned [933, 934]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 7779 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1335/1380 places, 293/296 transitions.
Applied a total of 0 rules in 57 ms. Remains 1335 /1335 variables (removed 0) and now considering 293/293 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 7982 ms. Remains : 1335/1380 places, 293/296 transitions.
Stuttering acceptance computed with spot in 30 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : QuasiCertifProtocol-PT-18-LTLCardinality-02
Product exploration explored 100000 steps with 10831 reset in 472 ms.
Product exploration explored 100000 steps with 10779 reset in 375 ms.
Computed a total of 1335 stabilizing places and 293 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1335 transition count 293
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 7 factoid took 481 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 44 ms :[(AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (1762 resets) in 340 ms. (117 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (172 resets) in 161 ms. (246 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (123 resets) in 75 ms. (526 steps per ms) remains 2/2 properties
// Phase 1: matrix 293 rows 1335 cols
[2024-05-25 19:34:48] [INFO ] Computed 1044 invariants in 12 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 399/475 variables, 378/378 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/475 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 139/614 variables, 475/853 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/614 variables, 0/853 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1014/1628 variables, 860/1713 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1628 variables, 666/2379 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1628 variables, 0/2379 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/1628 variables, 0/2379 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1628/1628 variables, and 2379 constraints, problems are : Problem set: 0 solved, 2 unsolved in 575 ms.
Refiners :[Generalized P Invariants (flows): 1044/1044 constraints, State Equation: 1335/1335 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 399/475 variables, 378/378 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/475 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 139/614 variables, 475/853 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/614 variables, 0/853 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1014/1628 variables, 860/1713 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1628 variables, 666/2379 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1628 variables, 2/2381 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1628 variables, 0/2381 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/1628 variables, 0/2381 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1628/1628 variables, and 2381 constraints, problems are : Problem set: 0 solved, 2 unsolved in 900 ms.
Refiners :[Generalized P Invariants (flows): 1044/1044 constraints, State Equation: 1335/1335 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 1514ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 32 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=16 )
Parikh walk visited 2 properties in 3 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 7 factoid took 777 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 28 ms :[(AND (NOT p0) (NOT p1))]
[2024-05-25 19:34:51] [INFO ] Invariant cache hit.
[2024-05-25 19:34:52] [INFO ] [Real]Absence check using 0 positive and 1044 generalized place invariants in 1190 ms returned sat
[2024-05-25 19:35:00] [INFO ] [Real]Absence check using state equation in 8029 ms returned sat
[2024-05-25 19:35:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 19:35:02] [INFO ] [Nat]Absence check using 0 positive and 1044 generalized place invariants in 1292 ms returned sat
[2024-05-25 19:35:11] [INFO ] [Nat]Absence check using state equation in 8901 ms returned sat
[2024-05-25 19:35:11] [INFO ] Computed and/alt/rep : 212/250/212 causal constraints (skipped 61 transitions) in 21 ms.
[2024-05-25 19:35:11] [INFO ] Added : 0 causal constraints over 0 iterations in 139 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 76 out of 1335 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1335/1335 places, 293/293 transitions.
Applied a total of 0 rules in 47 ms. Remains 1335 /1335 variables (removed 0) and now considering 293/293 (removed 0) transitions.
[2024-05-25 19:35:11] [INFO ] Invariant cache hit.
[2024-05-25 19:35:13] [INFO ] Implicit Places using invariants in 1206 ms returned []
[2024-05-25 19:35:13] [INFO ] Invariant cache hit.
[2024-05-25 19:35:18] [INFO ] Implicit Places using invariants and state equation in 5750 ms returned []
Implicit Place search using SMT with State Equation took 6960 ms to find 0 implicit places.
[2024-05-25 19:35:18] [INFO ] Redundant transitions in 47 ms returned []
Running 273 sub problems to find dead transitions.
[2024-05-25 19:35:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1315 variables, 702/702 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1315 variables, 0/702 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 2 (OVERLAPS) 19/1334 variables, 342/1044 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1334 variables, 0/1044 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 4 (OVERLAPS) 293/1627 variables, 1334/2378 constraints. Problems are: Problem set: 0 solved, 273 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 10.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 1.0)
(s40 1.0)
(s41 0.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 0.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 1.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 1.0)
(s97 0.0)
(s98 1.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 1.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 0.0)
(s511 1.0)
(s512 1.0)
(s513 0.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 0.0)
(s525 1.0)
(s526 0.0)
(s527 0.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 0.0)
(s541 0.0)
(s542 0.0)
(s543 0.0)
(s544 0.0)
(s545 0.0)
(s546 1.0)
(s547 1.0)
(s548 0.0)
(s549 0.0)
(s550 0.0)
(s551 0.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 0.0)
(s561 0.0)
(s562 1.0)
(s563 0.0)
(s564 1.0)
(s565 1.0)
(s566 1.0)
(s567 1.0)
(s568 1.0)
(s569 1.0)
(s570 1.0)
(s571 1.0)
(s572 1.0)
(s573 1.0)
(s574 1.0)
(s575 1.0)
(s576 0.0)
(s577 1.0)
(s578 0.0)
(s579 0.0)
(s580 1.0)timeout

(s581 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1627/1628 variables, and 2378 constraints, problems are : Problem set: 0 solved, 273 unsolved in 30025 ms.
Refiners :[Generalized P Invariants (flows): 1044/1044 constraints, State Equation: 1334/1335 constraints, PredecessorRefiner: 273/273 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 273 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1315 variables, 702/702 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1315 variables, 0/702 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 2 (OVERLAPS) 19/1334 variables, 342/1044 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1334 variables, 0/1044 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 4 (OVERLAPS) 293/1627 variables, 1334/2378 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1627 variables, 273/2651 constraints. Problems are: Problem set: 0 solved, 273 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1627/1628 variables, and 2651 constraints, problems are : Problem set: 0 solved, 273 unsolved in 30021 ms.
Refiners :[Generalized P Invariants (flows): 1044/1044 constraints, State Equation: 1334/1335 constraints, PredecessorRefiner: 273/273 constraints, Known Traps: 0/0 constraints]
After SMT, in 60356ms problems are : Problem set: 0 solved, 273 unsolved
Search for dead transitions found 0 dead transitions in 60361ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 67424 ms. Remains : 1335/1335 places, 293/293 transitions.
Computed a total of 1335 stabilizing places and 293 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1335 transition count 293
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 7 factoid took 480 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[(AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (1766 resets) in 273 ms. (145 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (172 resets) in 103 ms. (384 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (127 resets) in 96 ms. (412 steps per ms) remains 2/2 properties
[2024-05-25 19:36:20] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 399/475 variables, 378/378 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/475 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 139/614 variables, 475/853 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/614 variables, 0/853 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1014/1628 variables, 860/1713 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1628 variables, 666/2379 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1628 variables, 0/2379 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/1628 variables, 0/2379 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1628/1628 variables, and 2379 constraints, problems are : Problem set: 0 solved, 2 unsolved in 575 ms.
Refiners :[Generalized P Invariants (flows): 1044/1044 constraints, State Equation: 1335/1335 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 399/475 variables, 378/378 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/475 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 139/614 variables, 475/853 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/614 variables, 0/853 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1014/1628 variables, 860/1713 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1628 variables, 666/2379 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1628 variables, 2/2381 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1628 variables, 0/2381 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/1628 variables, 0/2381 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1628/1628 variables, and 2381 constraints, problems are : Problem set: 0 solved, 2 unsolved in 907 ms.
Refiners :[Generalized P Invariants (flows): 1044/1044 constraints, State Equation: 1335/1335 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 1502ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 32 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=16 )
Parikh walk visited 2 properties in 2 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 7 factoid took 641 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 41 ms :[(AND (NOT p0) (NOT p1))]
[2024-05-25 19:36:22] [INFO ] Invariant cache hit.
[2024-05-25 19:36:24] [INFO ] [Real]Absence check using 0 positive and 1044 generalized place invariants in 1176 ms returned sat
[2024-05-25 19:36:32] [INFO ] [Real]Absence check using state equation in 8144 ms returned sat
[2024-05-25 19:36:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 19:36:34] [INFO ] [Nat]Absence check using 0 positive and 1044 generalized place invariants in 1353 ms returned sat
[2024-05-25 19:36:43] [INFO ] [Nat]Absence check using state equation in 9193 ms returned sat
[2024-05-25 19:36:43] [INFO ] Computed and/alt/rep : 212/250/212 causal constraints (skipped 61 transitions) in 23 ms.
[2024-05-25 19:36:43] [INFO ] Added : 0 causal constraints over 0 iterations in 148 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 42 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 10754 reset in 379 ms.
Product exploration explored 100000 steps with 10811 reset in 365 ms.
Built C files in :
/tmp/ltsmin9315719977602559322
[2024-05-25 19:36:44] [INFO ] Computing symmetric may disable matrix : 293 transitions.
[2024-05-25 19:36:44] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 19:36:44] [INFO ] Computing symmetric may enable matrix : 293 transitions.
[2024-05-25 19:36:44] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 19:36:44] [INFO ] Computing Do-Not-Accords matrix : 293 transitions.
[2024-05-25 19:36:44] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 19:36:44] [INFO ] Built C files in 71ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9315719977602559322
Running compilation step : cd /tmp/ltsmin9315719977602559322;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1348 ms.
Running link step : cd /tmp/ltsmin9315719977602559322;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin9315719977602559322;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1783450044047367563.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 76 out of 1335 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1335/1335 places, 293/293 transitions.
Applied a total of 0 rules in 47 ms. Remains 1335 /1335 variables (removed 0) and now considering 293/293 (removed 0) transitions.
[2024-05-25 19:36:59] [INFO ] Invariant cache hit.
[2024-05-25 19:37:00] [INFO ] Implicit Places using invariants in 1275 ms returned []
[2024-05-25 19:37:00] [INFO ] Invariant cache hit.
[2024-05-25 19:37:06] [INFO ] Implicit Places using invariants and state equation in 5785 ms returned []
Implicit Place search using SMT with State Equation took 7065 ms to find 0 implicit places.
[2024-05-25 19:37:06] [INFO ] Redundant transitions in 25 ms returned []
Running 273 sub problems to find dead transitions.
[2024-05-25 19:37:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1315 variables, 702/702 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1315 variables, 0/702 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 2 (OVERLAPS) 19/1334 variables, 342/1044 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1334 variables, 0/1044 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 4 (OVERLAPS) 293/1627 variables, 1334/2378 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1627 variables, 0/2378 constraints. Problems are: Problem set: 0 solved, 273 unsolved
SMT process timed out in 30331ms, After SMT, problems are : Problem set: 0 solved, 273 unsolved
Search for dead transitions found 0 dead transitions in 30338ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 37485 ms. Remains : 1335/1335 places, 293/293 transitions.
Built C files in :
/tmp/ltsmin6607228163290043792
[2024-05-25 19:37:36] [INFO ] Computing symmetric may disable matrix : 293 transitions.
[2024-05-25 19:37:36] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 19:37:36] [INFO ] Computing symmetric may enable matrix : 293 transitions.
[2024-05-25 19:37:36] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 19:37:36] [INFO ] Computing Do-Not-Accords matrix : 293 transitions.
[2024-05-25 19:37:36] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 19:37:36] [INFO ] Built C files in 42ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6607228163290043792
Running compilation step : cd /tmp/ltsmin6607228163290043792;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1210 ms.
Running link step : cd /tmp/ltsmin6607228163290043792;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin6607228163290043792;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8471764321498759646.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-25 19:37:52] [INFO ] Flatten gal took : 41 ms
[2024-05-25 19:37:52] [INFO ] Flatten gal took : 40 ms
[2024-05-25 19:37:52] [INFO ] Time to serialize gal into /tmp/LTL8380359820977192972.gal : 7 ms
[2024-05-25 19:37:52] [INFO ] Time to serialize properties into /tmp/LTL14642852579092512515.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8380359820977192972.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4989021635639688675.hoa' '-atoms' '/tmp/LTL14642852579092512515.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/LTL14642852579092512515.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4989021635639688675.hoa
Detected timeout of ITS tools.
[2024-05-25 19:38:07] [INFO ] Flatten gal took : 43 ms
[2024-05-25 19:38:07] [INFO ] Flatten gal took : 35 ms
[2024-05-25 19:38:07] [INFO ] Time to serialize gal into /tmp/LTL9057786888076545412.gal : 7 ms
[2024-05-25 19:38:07] [INFO ] Time to serialize properties into /tmp/LTL15455771275314240061.ltl : 8 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/LTL9057786888076545412.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15455771275314240061.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("((((((n3_3+n3_2)+(n3_1+n3_0))+((n3_7+n3_6)+(n3_5+n3_4)))+(((n3_16+n3_17)+(n3_18+n3_8))+((n3_9+n3_10)+(n3_11+n3_12))))+((n3_13...711
Formula 0 simplified : G(!"(((((((n1_4+n1_5)+(n1_2+n1_3))+((n1_0+n1_1)+(n1_12+n1_13)))+(((n1_10+n1_11)+(n1_8+n1_9))+((n1_6+n1_7)+(n1_16+n1_17))))+((n1_14+n...705
Detected timeout of ITS tools.
[2024-05-25 19:38:22] [INFO ] Flatten gal took : 40 ms
[2024-05-25 19:38:22] [INFO ] Applying decomposition
[2024-05-25 19:38:22] [INFO ] Flatten gal took : 29 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/graph2042129660067360193.txt' '-o' '/tmp/graph2042129660067360193.bin' '-w' '/tmp/graph2042129660067360193.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2042129660067360193.bin' '-l' '-1' '-v' '-w' '/tmp/graph2042129660067360193.weights' '-q' '0' '-e' '0.001'
[2024-05-25 19:38:22] [INFO ] Decomposing Gal with order
[2024-05-25 19:38:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 19:38:22] [INFO ] Removed a total of 210 redundant transitions.
[2024-05-25 19:38:22] [INFO ] Flatten gal took : 193 ms
[2024-05-25 19:38:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 318 labels/synchronizations in 120 ms.
[2024-05-25 19:38:23] [INFO ] Time to serialize gal into /tmp/LTL5138371679179900456.gal : 74 ms
[2024-05-25 19:38:23] [INFO ] Time to serialize properties into /tmp/LTL2407035881748266333.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/LTL5138371679179900456.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2407035881748266333.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("((((((gu58.n3_3+gu58.n3_2)+(gu58.n3_1+gu58.n3_0))+((gu58.n3_7+gu58.n3_6)+(gu58.n3_5+gu58.n3_4)))+(((gu58.n3_16+gu58.n3_17)+(g...1167
Formula 0 simplified : G(!"(((((((gi3.gu55.n1_4+gi3.gu55.n1_5)+(gi3.gu55.n1_2+gi3.gu55.n1_3))+((gi3.gu55.n1_0+gi3.gu55.n1_1)+(gi3.gu55.n1_12+gi3.gu55.n1_13...1161
Detected timeout of ITS tools.
Treatment of property QuasiCertifProtocol-PT-18-LTLCardinality-02 finished in 239520 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 20 out of 1380 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1380/1380 places, 296/296 transitions.
Graph (complete) has 9153 edges and 1380 vertex of which 1319 are kept as prefixes of interest. Removing 61 places using SCC suffix rule.6 ms
Discarding 61 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 1317 transition count 292
Applied a total of 3 rules in 81 ms. Remains 1317 /1380 variables (removed 63) and now considering 292/296 (removed 4) transitions.
// Phase 1: matrix 292 rows 1317 cols
[2024-05-25 19:38:38] [INFO ] Computed 1027 invariants in 15 ms
[2024-05-25 19:38:39] [INFO ] Implicit Places using invariants in 1352 ms returned []
[2024-05-25 19:38:39] [INFO ] Invariant cache hit.
[2024-05-25 19:38:45] [INFO ] Implicit Places using invariants and state equation in 5589 ms returned [914, 915, 1156, 1157, 1158, 1159, 1160, 1161, 1164, 1165, 1166, 1167, 1168, 1169, 1170, 1171, 1277, 1278, 1279, 1280, 1283]
Discarding 21 places :
Implicit Place search using SMT with State Equation took 6947 ms to find 21 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1296/1380 places, 292/296 transitions.
Applied a total of 0 rules in 38 ms. Remains 1296 /1296 variables (removed 0) and now considering 292/292 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 7066 ms. Remains : 1296/1380 places, 292/296 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-18-LTLCardinality-03
Stuttering criterion allowed to conclude after 22 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-PT-18-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-18-LTLCardinality-03 finished in 7120 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(X(G((p0||X(G((F(G(p1)) U p2)))))))))'
Support contains 59 out of 1380 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1380/1380 places, 296/296 transitions.
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 1359 transition count 296
Applied a total of 21 rules in 34 ms. Remains 1359 /1380 variables (removed 21) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 1359 cols
[2024-05-25 19:38:45] [INFO ] Computed 1064 invariants in 11 ms
[2024-05-25 19:38:46] [INFO ] Implicit Places using invariants in 1328 ms returned []
[2024-05-25 19:38:46] [INFO ] Invariant cache hit.
[2024-05-25 19:38:53] [INFO ] Implicit Places using invariants and state equation in 6300 ms returned [916, 917]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 7630 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1357/1380 places, 296/296 transitions.
Applied a total of 0 rules in 30 ms. Remains 1357 /1357 variables (removed 0) and now considering 296/296 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 7696 ms. Remains : 1357/1380 places, 296/296 transitions.
Stuttering acceptance computed with spot in 539 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p1), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : QuasiCertifProtocol-PT-18-LTLCardinality-04
Product exploration explored 100000 steps with 4418 reset in 286 ms.
Product exploration explored 100000 steps with 4418 reset in 309 ms.
Computed a total of 1357 stabilizing places and 296 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1357 transition count 296
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (G p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 213 ms. Reduced automaton from 11 states, 22 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 57 ms :[(NOT p2), (NOT p2)]
RANDOM walk for 40000 steps (1766 resets) in 120 ms. (330 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (172 resets) in 92 ms. (430 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2126756 steps, run timeout after 3001 ms. (steps per millisecond=708 ) properties seen :0 out of 1
Probabilistic random walk after 2126756 steps, saw 298222 distinct states, run finished after 3004 ms. (steps per millisecond=707 ) properties seen :0
// Phase 1: matrix 296 rows 1357 cols
[2024-05-25 19:38:58] [INFO ] Computed 1062 invariants in 20 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 60/80 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 312/392 variables, 155/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/392 variables, 54/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/392 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 520/912 variables, 441/670 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/912 variables, 0/670 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 29/941 variables, 342/1012 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/941 variables, 29/1041 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/941 variables, 0/1041 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 332/1273 variables, 324/1365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1273 variables, 332/1697 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1273 variables, 0/1697 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 380/1653 variables, 380/2077 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1653 variables, 342/2419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1653 variables, 0/2419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/1653 variables, 0/2419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1653/1653 variables, and 2419 constraints, problems are : Problem set: 0 solved, 1 unsolved in 532 ms.
Refiners :[Generalized P Invariants (flows): 1062/1062 constraints, State Equation: 1357/1357 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 60/80 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 312/392 variables, 155/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/392 variables, 54/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/392 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/392 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 520/912 variables, 441/671 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/912 variables, 0/671 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 29/941 variables, 342/1013 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/941 variables, 29/1042 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/941 variables, 0/1042 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 332/1273 variables, 324/1366 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1273 variables, 332/1698 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1273 variables, 0/1698 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 380/1653 variables, 380/2078 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1653 variables, 342/2420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1653 variables, 0/2420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/1653 variables, 0/2420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1653/1653 variables, and 2420 constraints, problems are : Problem set: 0 solved, 1 unsolved in 725 ms.
Refiners :[Generalized P Invariants (flows): 1062/1062 constraints, State Equation: 1357/1357 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1288ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 27 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=27 )
Parikh walk visited 1 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (G p1))]
False Knowledge obtained : [(F (NOT p2))]
Knowledge based reduction with 6 factoid took 254 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 79 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 65 ms :[(NOT p2), (NOT p2)]
Support contains 20 out of 1357 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 : 1357/1357 places, 296/296 transitions.
Graph (complete) has 8708 edges and 1357 vertex of which 996 are kept as prefixes of interest. Removing 361 places using SCC suffix rule.6 ms
Discarding 361 places :
Also discarding 0 output transitions
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 19 place count 978 transition count 260
Iterating global reduction 0 with 18 rules applied. Total rules applied 37 place count 978 transition count 260
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 41 place count 976 transition count 258
Applied a total of 41 rules in 155 ms. Remains 976 /1357 variables (removed 381) and now considering 258/296 (removed 38) transitions.
// Phase 1: matrix 258 rows 976 cols
[2024-05-25 19:38:59] [INFO ] Computed 720 invariants in 10 ms
[2024-05-25 19:39:00] [INFO ] Implicit Places using invariants in 843 ms returned []
[2024-05-25 19:39:00] [INFO ] Invariant cache hit.
[2024-05-25 19:39:04] [INFO ] Implicit Places using invariants and state equation in 3534 ms returned []
Implicit Place search using SMT with State Equation took 4380 ms to find 0 implicit places.
[2024-05-25 19:39:04] [INFO ] Redundant transitions in 25 ms returned []
Running 238 sub problems to find dead transitions.
[2024-05-25 19:39:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/955 variables, 720/720 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/955 variables, 0/720 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 2 (OVERLAPS) 258/1213 variables, 955/1675 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1213 variables, 0/1675 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 4 (OVERLAPS) 21/1234 variables, 21/1696 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1234 variables, 0/1696 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 6 (OVERLAPS) 0/1234 variables, 0/1696 constraints. Problems are: Problem set: 0 solved, 238 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1234/1234 variables, and 1696 constraints, problems are : Problem set: 0 solved, 238 unsolved in 30009 ms.
Refiners :[Generalized P Invariants (flows): 720/720 constraints, State Equation: 976/976 constraints, PredecessorRefiner: 238/238 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 238 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/955 variables, 720/720 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/955 variables, 0/720 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 2 (OVERLAPS) 258/1213 variables, 955/1675 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1213 variables, 198/1873 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1213 variables, 0/1873 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 5 (OVERLAPS) 21/1234 variables, 21/1894 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1234 variables, 40/1934 constraints. Problems are: Problem set: 0 solved, 238 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1234/1234 variables, and 1934 constraints, problems are : Problem set: 0 solved, 238 unsolved in 30020 ms.
Refiners :[Generalized P Invariants (flows): 720/720 constraints, State Equation: 976/976 constraints, PredecessorRefiner: 238/238 constraints, Known Traps: 0/0 constraints]
After SMT, in 60220ms problems are : Problem set: 0 solved, 238 unsolved
Search for dead transitions found 0 dead transitions in 60223ms
Starting structural reductions in SI_LTL mode, iteration 1 : 976/1357 places, 258/296 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 64792 ms. Remains : 976/1357 places, 258/296 transitions.
Computed a total of 976 stabilizing places and 258 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 976 transition count 258
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), (X (X p2)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 101 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[(NOT p2), (NOT p2)]
RANDOM walk for 40000 steps (1768 resets) in 121 ms. (327 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (172 resets) in 34 ms. (1142 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2203743 steps, run timeout after 3001 ms. (steps per millisecond=734 ) properties seen :0 out of 1
Probabilistic random walk after 2203743 steps, saw 308305 distinct states, run finished after 3001 ms. (steps per millisecond=734 ) properties seen :0
[2024-05-25 19:40:07] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 61/81 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 293/374 variables, 155/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/374 variables, 54/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/374 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 480/854 variables, 421/650 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/854 variables, 0/650 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 29/883 variables, 342/992 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/883 variables, 29/1021 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/883 variables, 0/1021 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 332/1215 variables, 324/1345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1215 variables, 332/1677 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1215 variables, 0/1677 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 19/1234 variables, 19/1696 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1234 variables, 0/1696 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/1234 variables, 0/1696 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1234/1234 variables, and 1696 constraints, problems are : Problem set: 0 solved, 1 unsolved in 408 ms.
Refiners :[Generalized P Invariants (flows): 720/720 constraints, State Equation: 976/976 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 61/81 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 293/374 variables, 155/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/374 variables, 54/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/374 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/374 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 480/854 variables, 421/651 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/854 variables, 0/651 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 29/883 variables, 342/993 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/883 variables, 29/1022 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/883 variables, 0/1022 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 332/1215 variables, 324/1346 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1215 variables, 332/1678 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1215 variables, 0/1678 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 19/1234 variables, 19/1697 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1234 variables, 0/1697 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/1234 variables, 0/1697 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1234/1234 variables, and 1697 constraints, problems are : Problem set: 0 solved, 1 unsolved in 524 ms.
Refiners :[Generalized P Invariants (flows): 720/720 constraints, State Equation: 976/976 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 938ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 23 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=23 )
Parikh walk visited 1 properties in 0 ms.
Knowledge obtained : [p2, (X p2), (X (X p2)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT p2))]
Knowledge based reduction with 4 factoid took 111 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 75 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 61 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 64 ms :[(NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 4423 reset in 231 ms.
Product exploration explored 100000 steps with 4424 reset in 245 ms.
Built C files in :
/tmp/ltsmin13658625494618177621
[2024-05-25 19:40:09] [INFO ] Computing symmetric may disable matrix : 258 transitions.
[2024-05-25 19:40:09] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 19:40:09] [INFO ] Computing symmetric may enable matrix : 258 transitions.
[2024-05-25 19:40:09] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 19:40:09] [INFO ] Computing Do-Not-Accords matrix : 258 transitions.
[2024-05-25 19:40:09] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 19:40:09] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13658625494618177621
Running compilation step : cd /tmp/ltsmin13658625494618177621;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 950 ms.
Running link step : cd /tmp/ltsmin13658625494618177621;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin13658625494618177621;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased17622553861479259805.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 20 out of 976 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 976/976 places, 258/258 transitions.
Graph (complete) has 9067 edges and 976 vertex of which 936 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.4 ms
Discarding 40 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 20 place count 917 transition count 218
Iterating global reduction 0 with 19 rules applied. Total rules applied 39 place count 917 transition count 218
Applied a total of 39 rules in 50 ms. Remains 917 /976 variables (removed 59) and now considering 218/258 (removed 40) transitions.
// Phase 1: matrix 218 rows 917 cols
[2024-05-25 19:40:24] [INFO ] Computed 702 invariants in 9 ms
[2024-05-25 19:40:25] [INFO ] Implicit Places using invariants in 874 ms returned []
[2024-05-25 19:40:25] [INFO ] Invariant cache hit.
[2024-05-25 19:40:27] [INFO ] Implicit Places using invariants and state equation in 2143 ms returned []
Implicit Place search using SMT with State Equation took 3019 ms to find 0 implicit places.
[2024-05-25 19:40:27] [INFO ] Redundant transitions in 21 ms returned []
Running 198 sub problems to find dead transitions.
[2024-05-25 19:40:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/916 variables, 702/702 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/916 variables, 0/702 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (OVERLAPS) 218/1134 variables, 916/1618 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1134 variables, 0/1618 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (OVERLAPS) 1/1135 variables, 1/1619 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1135 variables, 0/1619 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (OVERLAPS) 0/1135 variables, 0/1619 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1135/1135 variables, and 1619 constraints, problems are : Problem set: 0 solved, 198 unsolved in 26680 ms.
Refiners :[Generalized P Invariants (flows): 702/702 constraints, State Equation: 917/917 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 198 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/916 variables, 702/702 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/916 variables, 0/702 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (OVERLAPS) 218/1134 variables, 916/1618 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1134 variables, 198/1816 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1134 variables, 0/1816 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (OVERLAPS) 1/1135 variables, 1/1817 constraints. Problems are: Problem set: 0 solved, 198 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1135/1135 variables, and 1817 constraints, problems are : Problem set: 0 solved, 198 unsolved in 30016 ms.
Refiners :[Generalized P Invariants (flows): 702/702 constraints, State Equation: 917/917 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 0/0 constraints]
After SMT, in 56841ms problems are : Problem set: 0 solved, 198 unsolved
Search for dead transitions found 0 dead transitions in 56843ms
Starting structural reductions in SI_LTL mode, iteration 1 : 917/976 places, 218/258 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 59939 ms. Remains : 917/976 places, 218/258 transitions.
Built C files in :
/tmp/ltsmin18314242247587328082
[2024-05-25 19:41:24] [INFO ] Computing symmetric may disable matrix : 218 transitions.
[2024-05-25 19:41:24] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 19:41:24] [INFO ] Computing symmetric may enable matrix : 218 transitions.
[2024-05-25 19:41:24] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 19:41:24] [INFO ] Computing Do-Not-Accords matrix : 218 transitions.
[2024-05-25 19:41:24] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 19:41:24] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18314242247587328082
Running compilation step : cd /tmp/ltsmin18314242247587328082;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 840 ms.
Running link step : cd /tmp/ltsmin18314242247587328082;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin18314242247587328082;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8434678595058957203.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-25 19:41:39] [INFO ] Flatten gal took : 30 ms
[2024-05-25 19:41:39] [INFO ] Flatten gal took : 27 ms
[2024-05-25 19:41:39] [INFO ] Time to serialize gal into /tmp/LTL15909781839033608287.gal : 4 ms
[2024-05-25 19:41:39] [INFO ] Time to serialize properties into /tmp/LTL10205546126881156564.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15909781839033608287.gal' '-t' 'CGAL' '-hoa' '/tmp/aut254422950620648301.hoa' '-atoms' '/tmp/LTL10205546126881156564.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/LTL10205546126881156564.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut254422950620648301.hoa
Detected timeout of ITS tools.
[2024-05-25 19:41:54] [INFO ] Flatten gal took : 20 ms
[2024-05-25 19:41:54] [INFO ] Flatten gal took : 20 ms
[2024-05-25 19:41:54] [INFO ] Time to serialize gal into /tmp/LTL5486281668055592132.gal : 4 ms
[2024-05-25 19:41:54] [INFO ] Time to serialize properties into /tmp/LTL17076534563245684223.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/LTL5486281668055592132.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17076534563245684223.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 : !((("(AstopOK>=1)")U(X(X(G(("(AstopOK>=1)")||(X(G((F(G("((((((s6_1+s6_0)+(s6_3+s6_2))+((s6_5+s6_4)+(s6_7+s6_6)))+(((s6_10+s6_11)+(s6_8...617
Formula 0 simplified : !"(AstopOK>=1)" R XXF(!"(AstopOK>=1)" & XF(GF!"((((((s6_1+s6_0)+(s6_3+s6_2))+((s6_5+s6_4)+(s6_7+s6_6)))+(((s6_10+s6_11)+(s6_8+s6_9))...601
Detected timeout of ITS tools.
[2024-05-25 19:42:10] [INFO ] Flatten gal took : 20 ms
[2024-05-25 19:42:10] [INFO ] Applying decomposition
[2024-05-25 19:42:10] [INFO ] Flatten gal took : 20 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/graph10098091283301418494.txt' '-o' '/tmp/graph10098091283301418494.bin' '-w' '/tmp/graph10098091283301418494.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10098091283301418494.bin' '-l' '-1' '-v' '-w' '/tmp/graph10098091283301418494.weights' '-q' '0' '-e' '0.001'
[2024-05-25 19:42:10] [INFO ] Decomposing Gal with order
[2024-05-25 19:42:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 19:42:10] [INFO ] Removed a total of 198 redundant transitions.
[2024-05-25 19:42:10] [INFO ] Flatten gal took : 49 ms
[2024-05-25 19:42:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 176 labels/synchronizations in 26 ms.
[2024-05-25 19:42:10] [INFO ] Time to serialize gal into /tmp/LTL2814202264303098470.gal : 10 ms
[2024-05-25 19:42:10] [INFO ] Time to serialize properties into /tmp/LTL6857787863530101860.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/LTL2814202264303098470.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6857787863530101860.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 : !((("(gi1.gi0.gi1.gu34.AstopOK>=1)")U(X(X(G(("(gi1.gi0.gi1.gu34.AstopOK>=1)")||(X(G((F(G("((((((gu64.s6_1+gu64.s6_0)+(gu64.s6_3+gu64.s...941
Formula 0 simplified : !"(gi1.gi0.gi1.gu34.AstopOK>=1)" R XXF(!"(gi1.gi0.gi1.gu34.AstopOK>=1)" & XF(GF!"((((((gu64.s6_1+gu64.s6_0)+(gu64.s6_3+gu64.s6_2))+(...925
Detected timeout of ITS tools.
Treatment of property QuasiCertifProtocol-PT-18-LTLCardinality-04 finished in 219829 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(F(!p0))||(F(!p0)&&(p1||F(((p2&&X(F(p3)))||G(F(p3)))))))))'
Support contains 77 out of 1380 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1380/1380 places, 296/296 transitions.
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 1359 transition count 296
Applied a total of 21 rules in 37 ms. Remains 1359 /1380 variables (removed 21) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 1359 cols
[2024-05-25 19:42:25] [INFO ] Computed 1065 invariants in 18 ms
[2024-05-25 19:42:26] [INFO ] Implicit Places using invariants in 1350 ms returned []
[2024-05-25 19:42:26] [INFO ] Invariant cache hit.
[2024-05-25 19:42:30] [INFO ] Implicit Places using invariants and state equation in 4059 ms returned [917, 918]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 5410 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1357/1380 places, 296/296 transitions.
Applied a total of 0 rules in 40 ms. Remains 1357 /1357 variables (removed 0) and now considering 296/296 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 5487 ms. Remains : 1357/1380 places, 296/296 transitions.
Stuttering acceptance computed with spot in 254 ms :[p0, (AND p0 (NOT p3)), (AND p0 (NOT p3)), p0, (AND p0 (NOT p3)), (AND p0 (NOT p3))]
Running random walk in product with property : QuasiCertifProtocol-PT-18-LTLCardinality-05
Stuttering criterion allowed to conclude after 21 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-PT-18-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-18-LTLCardinality-05 finished in 5776 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(F(p0))))'
Support contains 2 out of 1380 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1380/1380 places, 296/296 transitions.
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 1340 transition count 296
Applied a total of 40 rules in 32 ms. Remains 1340 /1380 variables (removed 40) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 1340 cols
[2024-05-25 19:42:31] [INFO ] Computed 1045 invariants in 26 ms
[2024-05-25 19:42:32] [INFO ] Implicit Places using invariants in 1341 ms returned []
[2024-05-25 19:42:32] [INFO ] Invariant cache hit.
[2024-05-25 19:42:37] [INFO ] Implicit Places using invariants and state equation in 5345 ms returned [917, 918]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 6687 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1338/1380 places, 296/296 transitions.
Applied a total of 0 rules in 31 ms. Remains 1338 /1338 variables (removed 0) and now considering 296/296 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 6750 ms. Remains : 1338/1380 places, 296/296 transitions.
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-18-LTLCardinality-08
Product exploration explored 100000 steps with 33333 reset in 280 ms.
Product exploration explored 100000 steps with 33333 reset in 283 ms.
Computed a total of 1338 stabilizing places and 296 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1338 transition count 296
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 (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 14 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-PT-18-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-PT-18-LTLCardinality-08 finished in 7642 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 1380 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1380/1380 places, 296/296 transitions.
Graph (complete) has 9153 edges and 1380 vertex of which 1319 are kept as prefixes of interest. Removing 61 places using SCC suffix rule.4 ms
Discarding 61 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 1316 transition count 291
Applied a total of 5 rules in 85 ms. Remains 1316 /1380 variables (removed 64) and now considering 291/296 (removed 5) transitions.
// Phase 1: matrix 291 rows 1316 cols
[2024-05-25 19:42:38] [INFO ] Computed 1027 invariants in 19 ms
[2024-05-25 19:42:40] [INFO ] Implicit Places using invariants in 1364 ms returned []
[2024-05-25 19:42:40] [INFO ] Invariant cache hit.
[2024-05-25 19:42:42] [INFO ] Implicit Places using invariants and state equation in 2134 ms returned [913, 914, 1155, 1156, 1157, 1158, 1159, 1160, 1163, 1164, 1165, 1166, 1167, 1168, 1169, 1170, 1276, 1277, 1278, 1279, 1282]
Discarding 21 places :
Implicit Place search using SMT with State Equation took 3500 ms to find 21 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1295/1380 places, 291/296 transitions.
Applied a total of 0 rules in 41 ms. Remains 1295 /1295 variables (removed 0) and now considering 291/291 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3626 ms. Remains : 1295/1380 places, 291/296 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-18-LTLCardinality-10
Stuttering criterion allowed to conclude after 24 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-18-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-18-LTLCardinality-10 finished in 3680 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 1380 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1380/1380 places, 296/296 transitions.
Graph (complete) has 9153 edges and 1380 vertex of which 958 are kept as prefixes of interest. Removing 422 places using SCC suffix rule.5 ms
Discarding 422 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 37 place count 921 transition count 221
Iterating global reduction 0 with 36 rules applied. Total rules applied 73 place count 921 transition count 221
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 77 place count 919 transition count 219
Applied a total of 77 rules in 74 ms. Remains 919 /1380 variables (removed 461) and now considering 219/296 (removed 77) transitions.
// Phase 1: matrix 219 rows 919 cols
[2024-05-25 19:42:42] [INFO ] Computed 703 invariants in 4 ms
[2024-05-25 19:42:43] [INFO ] Implicit Places using invariants in 766 ms returned []
[2024-05-25 19:42:43] [INFO ] Invariant cache hit.
[2024-05-25 19:42:45] [INFO ] Implicit Places using invariants and state equation in 2501 ms returned [516, 517, 758, 759, 760, 761, 762, 763, 766, 767, 768, 769, 770, 771, 772, 773, 879, 880, 881, 882, 885]
Discarding 21 places :
Implicit Place search using SMT with State Equation took 3269 ms to find 21 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 898/1380 places, 219/296 transitions.
Applied a total of 0 rules in 24 ms. Remains 898 /898 variables (removed 0) and now considering 219/219 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3368 ms. Remains : 898/1380 places, 219/296 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-18-LTLCardinality-11
Product exploration explored 100000 steps with 4208 reset in 230 ms.
Product exploration explored 100000 steps with 4204 reset in 241 ms.
Computed a total of 898 stabilizing places and 219 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 898 transition count 219
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 44 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-PT-18-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-PT-18-LTLCardinality-11 finished in 4109 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 1 out of 1380 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1380/1380 places, 296/296 transitions.
Graph (complete) has 9153 edges and 1380 vertex of which 1320 are kept as prefixes of interest. Removing 60 places using SCC suffix rule.4 ms
Discarding 60 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 1317 transition count 291
Applied a total of 5 rules in 84 ms. Remains 1317 /1380 variables (removed 63) and now considering 291/296 (removed 5) transitions.
// Phase 1: matrix 291 rows 1317 cols
[2024-05-25 19:42:46] [INFO ] Computed 1028 invariants in 16 ms
[2024-05-25 19:42:47] [INFO ] Implicit Places using invariants in 1278 ms returned []
[2024-05-25 19:42:47] [INFO ] Invariant cache hit.
[2024-05-25 19:42:52] [INFO ] Implicit Places using invariants and state equation in 4068 ms returned [914, 915, 1156, 1157, 1158, 1159, 1160, 1161, 1164, 1165, 1166, 1167, 1168, 1169, 1170, 1171, 1277, 1278, 1279, 1280, 1283]
Discarding 21 places :
Implicit Place search using SMT with State Equation took 5348 ms to find 21 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1296/1380 places, 291/296 transitions.
Applied a total of 0 rules in 38 ms. Remains 1296 /1296 variables (removed 0) and now considering 291/291 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 5472 ms. Remains : 1296/1380 places, 291/296 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-18-LTLCardinality-12
Stuttering criterion allowed to conclude after 22 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-18-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-18-LTLCardinality-12 finished in 5523 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 1 out of 1380 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1380/1380 places, 296/296 transitions.
Graph (complete) has 9153 edges and 1380 vertex of which 972 are kept as prefixes of interest. Removing 408 places using SCC suffix rule.4 ms
Discarding 408 places :
Also discarding 7 output transitions
Drop transitions (Output transitions of discarded places.) removed 7 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 971 transition count 282
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 37 place count 941 transition count 222
Iterating global reduction 1 with 30 rules applied. Total rules applied 67 place count 941 transition count 222
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 71 place count 939 transition count 220
Applied a total of 71 rules in 70 ms. Remains 939 /1380 variables (removed 441) and now considering 220/296 (removed 76) transitions.
// Phase 1: matrix 220 rows 939 cols
[2024-05-25 19:42:52] [INFO ] Computed 721 invariants in 12 ms
[2024-05-25 19:42:52] [INFO ] Implicit Places using invariants in 721 ms returned []
[2024-05-25 19:42:52] [INFO ] Invariant cache hit.
[2024-05-25 19:42:54] [INFO ] Implicit Places using invariants and state equation in 1625 ms returned [516, 517, 758, 759, 760, 761, 762, 763, 766, 767, 768, 769, 770, 771, 772, 773, 899, 900, 901, 902, 905]
Discarding 21 places :
Implicit Place search using SMT with State Equation took 2349 ms to find 21 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 918/1380 places, 220/296 transitions.
Applied a total of 0 rules in 22 ms. Remains 918 /918 variables (removed 0) and now considering 220/220 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2441 ms. Remains : 918/1380 places, 220/296 transitions.
Stuttering acceptance computed with spot in 59 ms :[p0, p0]
Running random walk in product with property : QuasiCertifProtocol-PT-18-LTLCardinality-14
Product exploration explored 100000 steps with 4155 reset in 309 ms.
Product exploration explored 100000 steps with 4155 reset in 277 ms.
Computed a total of 918 stabilizing places and 220 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 918 transition count 220
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)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 92 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 89 ms :[p0, p0]
RANDOM walk for 40005 steps (1543 resets) in 174 ms. (228 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (70 resets) in 77 ms. (512 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2854133 steps, run timeout after 3001 ms. (steps per millisecond=951 ) properties seen :0 out of 1
Probabilistic random walk after 2854133 steps, saw 392857 distinct states, run finished after 3001 ms. (steps per millisecond=951 ) properties seen :0
// Phase 1: matrix 220 rows 918 cols
[2024-05-25 19:42:58] [INFO ] Computed 702 invariants in 5 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 41/43 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 19/62 variables, 18/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/62 variables, 19/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/62 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 137/199 variables, 58/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/199 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 19/218 variables, 18/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/218 variables, 19/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/218 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 538/756 variables, 420/573 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/756 variables, 0/573 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 29/785 variables, 342/915 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/785 variables, 29/944 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/785 variables, 0/944 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 332/1117 variables, 324/1268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1117 variables, 332/1600 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1117 variables, 0/1600 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 21/1138 variables, 20/1620 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1138 variables, 0/1620 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1138 variables, 0/1620 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1138/1138 variables, and 1620 constraints, problems are : Problem set: 0 solved, 1 unsolved in 440 ms.
Refiners :[Generalized P Invariants (flows): 702/702 constraints, State Equation: 918/918 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 41/43 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 19/62 variables, 18/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/62 variables, 19/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/62 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 137/199 variables, 58/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/199 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 19/218 variables, 18/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/218 variables, 19/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/218 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 538/756 variables, 420/574 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/756 variables, 0/574 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 29/785 variables, 342/916 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/785 variables, 29/945 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/785 variables, 0/945 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 332/1117 variables, 324/1269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1117 variables, 332/1601 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1117 variables, 0/1601 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 21/1138 variables, 20/1621 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1138 variables, 0/1621 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1138 variables, 0/1621 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1138/1138 variables, and 1621 constraints, problems are : Problem set: 0 solved, 1 unsolved in 425 ms.
Refiners :[Generalized P Invariants (flows): 702/702 constraints, State Equation: 918/918 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 876ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 83 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=41 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 93 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 87 ms :[p0, p0]
Stuttering acceptance computed with spot in 61 ms :[p0, p0]
Support contains 1 out of 918 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 918/918 places, 220/220 transitions.
Applied a total of 0 rules in 27 ms. Remains 918 /918 variables (removed 0) and now considering 220/220 (removed 0) transitions.
[2024-05-25 19:42:59] [INFO ] Invariant cache hit.
[2024-05-25 19:43:00] [INFO ] Implicit Places using invariants in 865 ms returned []
[2024-05-25 19:43:00] [INFO ] Invariant cache hit.
[2024-05-25 19:43:02] [INFO ] Implicit Places using invariants and state equation in 1612 ms returned []
Implicit Place search using SMT with State Equation took 2481 ms to find 0 implicit places.
[2024-05-25 19:43:02] [INFO ] Redundant transitions in 22 ms returned [183]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 179 sub problems to find dead transitions.
// Phase 1: matrix 219 rows 918 cols
[2024-05-25 19:43:02] [INFO ] Computed 702 invariants in 8 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/898 variables, 702/702 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/898 variables, 0/702 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 2 (OVERLAPS) 219/1117 variables, 898/1600 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1117 variables, 0/1600 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 4 (OVERLAPS) 20/1137 variables, 20/1620 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1137 variables, 0/1620 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 6 (OVERLAPS) 0/1137 variables, 0/1620 constraints. Problems are: Problem set: 0 solved, 179 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1137/1137 variables, and 1620 constraints, problems are : Problem set: 0 solved, 179 unsolved in 22933 ms.
Refiners :[Generalized P Invariants (flows): 702/702 constraints, State Equation: 918/918 constraints, PredecessorRefiner: 179/179 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 179 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/898 variables, 702/702 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/898 variables, 0/702 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 2 (OVERLAPS) 219/1117 variables, 898/1600 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1117 variables, 177/1777 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1117 variables, 0/1777 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 5 (OVERLAPS) 20/1137 variables, 20/1797 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1137 variables, 2/1799 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1137 variables, 0/1799 constraints. Problems are: Problem set: 0 solved, 179 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1137/1137 variables, and 1799 constraints, problems are : Problem set: 0 solved, 179 unsolved in 30020 ms.
Refiners :[Generalized P Invariants (flows): 702/702 constraints, State Equation: 918/918 constraints, PredecessorRefiner: 179/179 constraints, Known Traps: 0/0 constraints]
After SMT, in 53103ms problems are : Problem set: 0 solved, 179 unsolved
Search for dead transitions found 0 dead transitions in 53105ms
Starting structural reductions in SI_LTL mode, iteration 1 : 918/918 places, 219/220 transitions.
Graph (complete) has 8857 edges and 918 vertex of which 195 are kept as prefixes of interest. Removing 723 places using SCC suffix rule.2 ms
Discarding 723 places :
Also discarding 20 output transitions
Drop transitions (Output transitions of discarded places.) removed 20 transitions
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 19 place count 177 transition count 163
Iterating global reduction 0 with 18 rules applied. Total rules applied 37 place count 177 transition count 163
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 55 place count 159 transition count 127
Iterating global reduction 0 with 18 rules applied. Total rules applied 73 place count 159 transition count 127
Applied a total of 73 rules in 17 ms. Remains 159 /918 variables (removed 759) and now considering 127/219 (removed 92) transitions.
// Phase 1: matrix 127 rows 159 cols
[2024-05-25 19:43:55] [INFO ] Computed 36 invariants in 1 ms
[2024-05-25 19:43:55] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-05-25 19:43:55] [INFO ] Invariant cache hit.
[2024-05-25 19:43:55] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 199 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 159/918 places, 127/220 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 55862 ms. Remains : 159/918 places, 127/220 transitions.
Computed a total of 159 stabilizing places and 127 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 159 transition count 127
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)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 84 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[p0, p0]
RANDOM walk for 40000 steps (1548 resets) in 104 ms. (380 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (72 resets) in 27 ms. (1428 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 3063741 steps, run timeout after 3001 ms. (steps per millisecond=1020 ) properties seen :0 out of 1
Probabilistic random walk after 3063741 steps, saw 416472 distinct states, run finished after 3001 ms. (steps per millisecond=1020 ) properties seen :0
[2024-05-25 19:43:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 41/43 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 19/62 variables, 18/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/62 variables, 19/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/62 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 83/145 variables, 40/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/145 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 19/164 variables, 18/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/164 variables, 19/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/164 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 103/267 variables, 41/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/267 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 19/286 variables, 19/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/286 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/286 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 286/286 variables, and 195 constraints, problems are : Problem set: 0 solved, 1 unsolved in 96 ms.
Refiners :[Generalized P Invariants (flows): 36/36 constraints, State Equation: 159/159 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 41/43 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 19/62 variables, 18/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/62 variables, 19/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/62 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 83/145 variables, 40/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/145 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 19/164 variables, 18/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/164 variables, 19/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/164 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 103/267 variables, 41/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/267 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 19/286 variables, 19/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/286 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/286 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 286/286 variables, and 196 constraints, problems are : Problem set: 0 solved, 1 unsolved in 92 ms.
Refiners :[Generalized P Invariants (flows): 36/36 constraints, State Equation: 159/159 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 190ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 70 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=35 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 108 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 64 ms :[p0, p0]
Stuttering acceptance computed with spot in 63 ms :[p0, p0]
Stuttering acceptance computed with spot in 65 ms :[p0, p0]
Product exploration explored 100000 steps with 4147 reset in 218 ms.
Product exploration explored 100000 steps with 4156 reset in 247 ms.
Built C files in :
/tmp/ltsmin1215031906060249588
[2024-05-25 19:43:59] [INFO ] Computing symmetric may disable matrix : 127 transitions.
[2024-05-25 19:43:59] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 19:43:59] [INFO ] Computing symmetric may enable matrix : 127 transitions.
[2024-05-25 19:43:59] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 19:43:59] [INFO ] Computing Do-Not-Accords matrix : 127 transitions.
[2024-05-25 19:43:59] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 19:43:59] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1215031906060249588
Running compilation step : cd /tmp/ltsmin1215031906060249588;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 327 ms.
Running link step : cd /tmp/ltsmin1215031906060249588;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin1215031906060249588;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6827809905453224299.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 159 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 159/159 places, 127/127 transitions.
Applied a total of 0 rules in 7 ms. Remains 159 /159 variables (removed 0) and now considering 127/127 (removed 0) transitions.
[2024-05-25 19:44:15] [INFO ] Invariant cache hit.
[2024-05-25 19:44:15] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-05-25 19:44:15] [INFO ] Invariant cache hit.
[2024-05-25 19:44:15] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 201 ms to find 0 implicit places.
[2024-05-25 19:44:15] [INFO ] Redundant transitions in 18 ms returned [122]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 86 sub problems to find dead transitions.
// Phase 1: matrix 126 rows 159 cols
[2024-05-25 19:44:15] [INFO ] Computed 36 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/139 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 2 (OVERLAPS) 126/265 variables, 139/175 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/265 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 4 (OVERLAPS) 20/285 variables, 20/195 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 6 (OVERLAPS) 0/285 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Real declared 285/285 variables, and 195 constraints, problems are : Problem set: 0 solved, 86 unsolved in 2220 ms.
Refiners :[Generalized P Invariants (flows): 36/36 constraints, State Equation: 159/159 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 86 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/139 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 2 (OVERLAPS) 126/265 variables, 139/175 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/265 variables, 84/259 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/265 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 5 (OVERLAPS) 20/285 variables, 20/279 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/285 variables, 2/281 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/285 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 8 (OVERLAPS) 0/285 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Int declared 285/285 variables, and 281 constraints, problems are : Problem set: 0 solved, 86 unsolved in 3819 ms.
Refiners :[Generalized P Invariants (flows): 36/36 constraints, State Equation: 159/159 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 0/0 constraints]
After SMT, in 6078ms problems are : Problem set: 0 solved, 86 unsolved
Search for dead transitions found 0 dead transitions in 6079ms
Starting structural reductions in SI_LTL mode, iteration 1 : 159/159 places, 126/127 transitions.
Graph (complete) has 1011 edges and 159 vertex of which 158 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Applied a total of 1 rules in 9 ms. Remains 158 /159 variables (removed 1) and now considering 125/126 (removed 1) transitions.
// Phase 1: matrix 125 rows 158 cols
[2024-05-25 19:44:21] [INFO ] Computed 36 invariants in 1 ms
[2024-05-25 19:44:21] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-25 19:44:21] [INFO ] Invariant cache hit.
[2024-05-25 19:44:21] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 204 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 158/159 places, 125/127 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 6531 ms. Remains : 158/159 places, 125/127 transitions.
Built C files in :
/tmp/ltsmin3218331150938591398
[2024-05-25 19:44:21] [INFO ] Computing symmetric may disable matrix : 125 transitions.
[2024-05-25 19:44:21] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 19:44:21] [INFO ] Computing symmetric may enable matrix : 125 transitions.
[2024-05-25 19:44:21] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 19:44:21] [INFO ] Computing Do-Not-Accords matrix : 125 transitions.
[2024-05-25 19:44:21] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 19:44:21] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3218331150938591398
Running compilation step : cd /tmp/ltsmin3218331150938591398;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 307 ms.
Running link step : cd /tmp/ltsmin3218331150938591398;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin3218331150938591398;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased2630440003686663299.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-25 19:44:36] [INFO ] Flatten gal took : 4 ms
[2024-05-25 19:44:36] [INFO ] Flatten gal took : 4 ms
[2024-05-25 19:44:36] [INFO ] Time to serialize gal into /tmp/LTL8122350841518282834.gal : 1 ms
[2024-05-25 19:44:36] [INFO ] Time to serialize properties into /tmp/LTL3049582277089926371.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/LTL8122350841518282834.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5243281230881793425.hoa' '-atoms' '/tmp/LTL3049582277089926371.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/LTL3049582277089926371.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5243281230881793425.hoa
Detected timeout of ITS tools.
[2024-05-25 19:44:51] [INFO ] Flatten gal took : 4 ms
[2024-05-25 19:44:51] [INFO ] Flatten gal took : 4 ms
[2024-05-25 19:44:51] [INFO ] Time to serialize gal into /tmp/LTL16375816218111488819.gal : 2 ms
[2024-05-25 19:44:51] [INFO ] Time to serialize properties into /tmp/LTL545742216524643200.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/LTL16375816218111488819.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL545742216524643200.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(F("(AstopOK<1)"))))
Formula 0 simplified : FG!"(AstopOK<1)"
Detected timeout of ITS tools.
[2024-05-25 19:45:06] [INFO ] Flatten gal took : 4 ms
[2024-05-25 19:45:06] [INFO ] Applying decomposition
[2024-05-25 19:45:06] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph6293915029305863080.txt' '-o' '/tmp/graph6293915029305863080.bin' '-w' '/tmp/graph6293915029305863080.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6293915029305863080.bin' '-l' '-1' '-v' '-w' '/tmp/graph6293915029305863080.weights' '-q' '0' '-e' '0.001'
[2024-05-25 19:45:06] [INFO ] Decomposing Gal with order
[2024-05-25 19:45:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 19:45:06] [INFO ] Removed a total of 136 redundant transitions.
[2024-05-25 19:45:06] [INFO ] Flatten gal took : 10 ms
[2024-05-25 19:45:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 60 labels/synchronizations in 3 ms.
[2024-05-25 19:45:06] [INFO ] Time to serialize gal into /tmp/LTL432039486243496025.gal : 2 ms
[2024-05-25 19:45:06] [INFO ] Time to serialize properties into /tmp/LTL7847493568700647660.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/LTL432039486243496025.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7847493568700647660.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...253
Read 1 LTL properties
Checking formula 0 : !((G(F("(i20.i0.u9.AstopOK<1)"))))
Formula 0 simplified : FG!"(i20.i0.u9.AstopOK<1)"
Reverse transition relation is NOT exact ! Due to transitions t168, t172, t173, t175, t176, t180, t181, t183, t184, t186, t195, t200, t202, t204, t218, t22...381
Computing Next relation with stutter on 3.40804e+08 deadlock states
Detected timeout of ITS tools.
Treatment of property QuasiCertifProtocol-PT-18-LTLCardinality-14 finished in 149726 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U X(p1))))'
Support contains 4 out of 1380 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1380/1380 places, 296/296 transitions.
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 1340 transition count 296
Applied a total of 40 rules in 33 ms. Remains 1340 /1380 variables (removed 40) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 1340 cols
[2024-05-25 19:45:21] [INFO ] Computed 1046 invariants in 8 ms
[2024-05-25 19:45:23] [INFO ] Implicit Places using invariants in 1241 ms returned []
[2024-05-25 19:45:23] [INFO ] Invariant cache hit.
[2024-05-25 19:45:26] [INFO ] Implicit Places using invariants and state equation in 3359 ms returned [916, 917]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 4603 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1338/1380 places, 296/296 transitions.
Applied a total of 0 rules in 32 ms. Remains 1338 /1338 variables (removed 0) and now considering 296/296 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 4669 ms. Remains : 1338/1380 places, 296/296 transitions.
Stuttering acceptance computed with spot in 180 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-PT-18-LTLCardinality-15
Product exploration explored 100000 steps with 10710 reset in 224 ms.
Product exploration explored 100000 steps with 10748 reset in 238 ms.
Computed a total of 1338 stabilizing places and 296 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1338 transition count 296
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 (NOT p1)), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (G p1))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 6 factoid took 272 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 153 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
RANDOM walk for 40000 steps (1767 resets) in 127 ms. (312 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (172 resets) in 85 ms. (465 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (128 resets) in 31 ms. (1250 steps per ms) remains 2/2 properties
// Phase 1: matrix 296 rows 1338 cols
[2024-05-25 19:45:27] [INFO ] Computed 1044 invariants in 7 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 3/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 34/41 variables, 17/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 24/65 variables, 41/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 199/264 variables, 79/138 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/264 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 219/483 variables, 200/338 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/483 variables, 19/357 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/483 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 142/625 variables, 142/499 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/625 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 649/1274 variables, 839/1338 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1274 variables, 24/1362 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1274 variables, 0/1362 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 70/1344 variables, 388/1750 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1344 variables, 70/1820 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1344 variables, 0/1820 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 272/1616 variables, 272/2092 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1616 variables, 272/2364 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1616 variables, 0/2364 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 18/1634 variables, 18/2382 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1634 variables, 0/2382 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 0/1634 variables, 0/2382 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1634/1634 variables, and 2382 constraints, problems are : Problem set: 0 solved, 2 unsolved in 690 ms.
Refiners :[Generalized P Invariants (flows): 1044/1044 constraints, State Equation: 1338/1338 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 3/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 34/41 variables, 17/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 24/65 variables, 41/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 199/264 variables, 79/138 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/264 variables, 2/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/264 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 219/483 variables, 200/340 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/483 variables, 19/359 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/483 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 142/625 variables, 142/501 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/625 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf1 is UNSAT
At refinement iteration 15 (OVERLAPS) 649/1274 variables, 839/1340 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1274 variables, 24/1364 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1274 variables, 0/1364 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 70/1344 variables, 388/1752 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1344 variables, 70/1822 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1344 variables, 0/1822 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 272/1616 variables, 272/2094 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1616 variables, 272/2366 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1616 variables, 0/2366 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 18/1634 variables, 18/2384 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1634 variables, 0/2384 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/1634 variables, 0/2384 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1634/1634 variables, and 2384 constraints, problems are : Problem set: 1 solved, 1 unsolved in 658 ms.
Refiners :[Generalized P Invariants (flows): 1044/1044 constraints, State Equation: 1338/1338 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 1364ms problems are : Problem set: 1 solved, 1 unsolved
Finished Parikh walk after 121 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=40 )
Parikh walk visited 1 properties in 3 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (G p1)), (G (OR p1 p0))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F p1), (F (NOT (AND (NOT p1) p0))), (F (NOT p0))]
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 127 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-PT-18-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-PT-18-LTLCardinality-15 finished in 7554 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||G(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' '!((p0 U X(X(G((p0||X(G((F(G(p1)) U p2)))))))))'
Found a Lengthening insensitive property : QuasiCertifProtocol-PT-18-LTLCardinality-04
Stuttering acceptance computed with spot in 470 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p1), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 59 out of 1380 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1380/1380 places, 296/296 transitions.
Graph (complete) has 9153 edges and 1380 vertex of which 998 are kept as prefixes of interest. Removing 382 places using SCC suffix rule.7 ms
Discarding 382 places :
Also discarding 0 output transitions
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 19 place count 980 transition count 260
Iterating global reduction 0 with 18 rules applied. Total rules applied 37 place count 980 transition count 260
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 41 place count 978 transition count 258
Applied a total of 41 rules in 66 ms. Remains 978 /1380 variables (removed 402) and now considering 258/296 (removed 38) transitions.
// Phase 1: matrix 258 rows 978 cols
[2024-05-25 19:45:30] [INFO ] Computed 721 invariants in 5 ms
[2024-05-25 19:45:31] [INFO ] Implicit Places using invariants in 864 ms returned []
[2024-05-25 19:45:31] [INFO ] Invariant cache hit.
[2024-05-25 19:45:34] [INFO ] Implicit Places using invariants and state equation in 3116 ms returned [535, 536]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 3982 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 976/1380 places, 258/296 transitions.
Applied a total of 0 rules in 23 ms. Remains 976 /976 variables (removed 0) and now considering 258/258 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 4071 ms. Remains : 976/1380 places, 258/296 transitions.
Running random walk in product with property : QuasiCertifProtocol-PT-18-LTLCardinality-04
Product exploration explored 100000 steps with 4421 reset in 246 ms.
Product exploration explored 100000 steps with 4416 reset in 262 ms.
Computed a total of 976 stabilizing places and 258 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 976 transition count 258
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (G p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 198 ms. Reduced automaton from 11 states, 22 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(NOT p2), (NOT p2)]
RANDOM walk for 40000 steps (1767 resets) in 132 ms. (300 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (172 resets) in 40 ms. (975 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2238846 steps, run timeout after 3001 ms. (steps per millisecond=746 ) properties seen :0 out of 1
Probabilistic random walk after 2238846 steps, saw 312244 distinct states, run finished after 3001 ms. (steps per millisecond=746 ) properties seen :0
// Phase 1: matrix 258 rows 976 cols
[2024-05-25 19:45:38] [INFO ] Computed 720 invariants in 12 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 61/81 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 293/374 variables, 155/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/374 variables, 54/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/374 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 480/854 variables, 421/650 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/854 variables, 0/650 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 29/883 variables, 342/992 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/883 variables, 29/1021 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/883 variables, 0/1021 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 332/1215 variables, 324/1345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1215 variables, 332/1677 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1215 variables, 0/1677 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 19/1234 variables, 19/1696 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1234 variables, 0/1696 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/1234 variables, 0/1696 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1234/1234 variables, and 1696 constraints, problems are : Problem set: 0 solved, 1 unsolved in 395 ms.
Refiners :[Generalized P Invariants (flows): 720/720 constraints, State Equation: 976/976 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 61/81 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 293/374 variables, 155/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/374 variables, 54/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/374 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/374 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 480/854 variables, 421/651 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/854 variables, 0/651 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 29/883 variables, 342/993 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/883 variables, 29/1022 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/883 variables, 0/1022 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 332/1215 variables, 324/1346 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1215 variables, 332/1678 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1215 variables, 0/1678 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 19/1234 variables, 19/1697 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1234 variables, 0/1697 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/1234 variables, 0/1697 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1234/1234 variables, and 1697 constraints, problems are : Problem set: 0 solved, 1 unsolved in 555 ms.
Refiners :[Generalized P Invariants (flows): 720/720 constraints, State Equation: 976/976 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 968ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 23 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=23 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (G p1))]
False Knowledge obtained : [(F (NOT p2))]
Knowledge based reduction with 6 factoid took 276 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 81 ms :[(NOT p2), (NOT p2)]
Support contains 20 out of 976 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 : 976/976 places, 258/258 transitions.
Applied a total of 0 rules in 28 ms. Remains 976 /976 variables (removed 0) and now considering 258/258 (removed 0) transitions.
[2024-05-25 19:45:39] [INFO ] Invariant cache hit.
[2024-05-25 19:45:40] [INFO ] Implicit Places using invariants in 847 ms returned []
[2024-05-25 19:45:40] [INFO ] Invariant cache hit.
[2024-05-25 19:45:44] [INFO ] Implicit Places using invariants and state equation in 3577 ms returned []
Implicit Place search using SMT with State Equation took 4424 ms to find 0 implicit places.
[2024-05-25 19:45:44] [INFO ] Redundant transitions in 23 ms returned []
Running 238 sub problems to find dead transitions.
[2024-05-25 19:45:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/955 variables, 720/720 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/955 variables, 0/720 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 2 (OVERLAPS) 258/1213 variables, 955/1675 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1213 variables, 0/1675 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 4 (OVERLAPS) 21/1234 variables, 21/1696 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1234 variables, 0/1696 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 6 (OVERLAPS) 0/1234 variables, 0/1696 constraints. Problems are: Problem set: 0 solved, 238 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1234/1234 variables, and 1696 constraints, problems are : Problem set: 0 solved, 238 unsolved in 30011 ms.
Refiners :[Generalized P Invariants (flows): 720/720 constraints, State Equation: 976/976 constraints, PredecessorRefiner: 238/238 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 238 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/955 variables, 720/720 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/955 variables, 0/720 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 2 (OVERLAPS) 258/1213 variables, 955/1675 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1213 variables, 198/1873 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1213 variables, 0/1873 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 5 (OVERLAPS) 21/1234 variables, 21/1894 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1234 variables, 40/1934 constraints. Problems are: Problem set: 0 solved, 238 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1234/1234 variables, and 1934 constraints, problems are : Problem set: 0 solved, 238 unsolved in 30020 ms.
Refiners :[Generalized P Invariants (flows): 720/720 constraints, State Equation: 976/976 constraints, PredecessorRefiner: 238/238 constraints, Known Traps: 0/0 constraints]
After SMT, in 60219ms problems are : Problem set: 0 solved, 238 unsolved
Search for dead transitions found 0 dead transitions in 60223ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 64710 ms. Remains : 976/976 places, 258/258 transitions.
Computed a total of 976 stabilizing places and 258 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 976 transition count 258
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), (X (X p2)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 92 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p2), (NOT p2)]
RANDOM walk for 40000 steps (1764 resets) in 151 ms. (263 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (172 resets) in 37 ms. (1052 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2215565 steps, run timeout after 3001 ms. (steps per millisecond=738 ) properties seen :0 out of 1
Probabilistic random walk after 2215565 steps, saw 309694 distinct states, run finished after 3001 ms. (steps per millisecond=738 ) properties seen :0
[2024-05-25 19:46:47] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 61/81 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 293/374 variables, 155/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/374 variables, 54/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/374 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 480/854 variables, 421/650 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/854 variables, 0/650 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 29/883 variables, 342/992 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/883 variables, 29/1021 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/883 variables, 0/1021 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 332/1215 variables, 324/1345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1215 variables, 332/1677 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1215 variables, 0/1677 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 19/1234 variables, 19/1696 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1234 variables, 0/1696 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/1234 variables, 0/1696 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1234/1234 variables, and 1696 constraints, problems are : Problem set: 0 solved, 1 unsolved in 386 ms.
Refiners :[Generalized P Invariants (flows): 720/720 constraints, State Equation: 976/976 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 61/81 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 293/374 variables, 155/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/374 variables, 54/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/374 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/374 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 480/854 variables, 421/651 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/854 variables, 0/651 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 29/883 variables, 342/993 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/883 variables, 29/1022 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/883 variables, 0/1022 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 332/1215 variables, 324/1346 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1215 variables, 332/1678 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1215 variables, 0/1678 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 19/1234 variables, 19/1697 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1234 variables, 0/1697 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/1234 variables, 0/1697 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1234/1234 variables, and 1697 constraints, problems are : Problem set: 0 solved, 1 unsolved in 530 ms.
Refiners :[Generalized P Invariants (flows): 720/720 constraints, State Equation: 976/976 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 922ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 24 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=12 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [p2, (X p2), (X (X p2)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT p2))]
Knowledge based reduction with 4 factoid took 120 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 85 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 86 ms :[(NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 4415 reset in 236 ms.
Product exploration explored 100000 steps with 4420 reset in 244 ms.
Built C files in :
/tmp/ltsmin16869592284936449224
[2024-05-25 19:46:49] [INFO ] Computing symmetric may disable matrix : 258 transitions.
[2024-05-25 19:46:49] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 19:46:49] [INFO ] Computing symmetric may enable matrix : 258 transitions.
[2024-05-25 19:46:49] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 19:46:49] [INFO ] Computing Do-Not-Accords matrix : 258 transitions.
[2024-05-25 19:46:49] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 19:46:49] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16869592284936449224
Running compilation step : cd /tmp/ltsmin16869592284936449224;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 960 ms.
Running link step : cd /tmp/ltsmin16869592284936449224;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin16869592284936449224;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased5136262695821182270.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 20 out of 976 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 976/976 places, 258/258 transitions.
Graph (complete) has 9067 edges and 976 vertex of which 936 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.1 ms
Discarding 40 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 20 place count 917 transition count 218
Iterating global reduction 0 with 19 rules applied. Total rules applied 39 place count 917 transition count 218
Applied a total of 39 rules in 38 ms. Remains 917 /976 variables (removed 59) and now considering 218/258 (removed 40) transitions.
// Phase 1: matrix 218 rows 917 cols
[2024-05-25 19:47:04] [INFO ] Computed 702 invariants in 14 ms
[2024-05-25 19:47:05] [INFO ] Implicit Places using invariants in 881 ms returned []
[2024-05-25 19:47:05] [INFO ] Invariant cache hit.
[2024-05-25 19:47:07] [INFO ] Implicit Places using invariants and state equation in 2091 ms returned []
Implicit Place search using SMT with State Equation took 2973 ms to find 0 implicit places.
[2024-05-25 19:47:07] [INFO ] Redundant transitions in 24 ms returned []
Running 198 sub problems to find dead transitions.
[2024-05-25 19:47:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/916 variables, 702/702 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/916 variables, 0/702 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (OVERLAPS) 218/1134 variables, 916/1618 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1134 variables, 0/1618 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (OVERLAPS) 1/1135 variables, 1/1619 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1135 variables, 0/1619 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (OVERLAPS) 0/1135 variables, 0/1619 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1135/1135 variables, and 1619 constraints, problems are : Problem set: 0 solved, 198 unsolved in 26098 ms.
Refiners :[Generalized P Invariants (flows): 702/702 constraints, State Equation: 917/917 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 198 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/916 variables, 702/702 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/916 variables, 0/702 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (OVERLAPS) 218/1134 variables, 916/1618 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1134 variables, 198/1816 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1134 variables, 0/1816 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (OVERLAPS) 1/1135 variables, 1/1817 constraints. Problems are: Problem set: 0 solved, 198 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1135/1135 variables, and 1817 constraints, problems are : Problem set: 0 solved, 198 unsolved in 30022 ms.
Refiners :[Generalized P Invariants (flows): 702/702 constraints, State Equation: 917/917 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 0/0 constraints]
After SMT, in 56267ms problems are : Problem set: 0 solved, 198 unsolved
Search for dead transitions found 0 dead transitions in 56269ms
Starting structural reductions in SI_LTL mode, iteration 1 : 917/976 places, 218/258 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 59315 ms. Remains : 917/976 places, 218/258 transitions.
Built C files in :
/tmp/ltsmin3732161561736981278
[2024-05-25 19:48:04] [INFO ] Computing symmetric may disable matrix : 218 transitions.
[2024-05-25 19:48:04] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 19:48:04] [INFO ] Computing symmetric may enable matrix : 218 transitions.
[2024-05-25 19:48:04] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 19:48:04] [INFO ] Computing Do-Not-Accords matrix : 218 transitions.
[2024-05-25 19:48:04] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 19:48:04] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3732161561736981278
Running compilation step : cd /tmp/ltsmin3732161561736981278;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 831 ms.
Running link step : cd /tmp/ltsmin3732161561736981278;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin3732161561736981278;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased9673165677919561343.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-25 19:48:19] [INFO ] Flatten gal took : 17 ms
[2024-05-25 19:48:19] [INFO ] Flatten gal took : 17 ms
[2024-05-25 19:48:19] [INFO ] Time to serialize gal into /tmp/LTL10464849151919596528.gal : 4 ms
[2024-05-25 19:48:19] [INFO ] Time to serialize properties into /tmp/LTL7056615563906810252.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/LTL10464849151919596528.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16878806323110076687.hoa' '-atoms' '/tmp/LTL7056615563906810252.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/LTL7056615563906810252.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16878806323110076687.hoa
Detected timeout of ITS tools.
[2024-05-25 19:48:34] [INFO ] Flatten gal took : 23 ms
[2024-05-25 19:48:34] [INFO ] Flatten gal took : 17 ms
[2024-05-25 19:48:34] [INFO ] Time to serialize gal into /tmp/LTL6211938027801802330.gal : 3 ms
[2024-05-25 19:48:34] [INFO ] Time to serialize properties into /tmp/LTL17464381661489989347.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/LTL6211938027801802330.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17464381661489989347.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 : !((("(AstopOK>=1)")U(X(X(G(("(AstopOK>=1)")||(X(G((F(G("((((((s6_1+s6_0)+(s6_3+s6_2))+((s6_5+s6_4)+(s6_7+s6_6)))+(((s6_10+s6_11)+(s6_8...617
Formula 0 simplified : !"(AstopOK>=1)" R XXF(!"(AstopOK>=1)" & XF(GF!"((((((s6_1+s6_0)+(s6_3+s6_2))+((s6_5+s6_4)+(s6_7+s6_6)))+(((s6_10+s6_11)+(s6_8+s6_9))...601
Detected timeout of ITS tools.
[2024-05-25 19:48:49] [INFO ] Flatten gal took : 20 ms
[2024-05-25 19:48:49] [INFO ] Applying decomposition
[2024-05-25 19:48:49] [INFO ] Flatten gal took : 18 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/graph17472712895277355613.txt' '-o' '/tmp/graph17472712895277355613.bin' '-w' '/tmp/graph17472712895277355613.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17472712895277355613.bin' '-l' '-1' '-v' '-w' '/tmp/graph17472712895277355613.weights' '-q' '0' '-e' '0.001'
[2024-05-25 19:48:49] [INFO ] Decomposing Gal with order
[2024-05-25 19:48:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 19:48:49] [INFO ] Removed a total of 195 redundant transitions.
[2024-05-25 19:48:49] [INFO ] Flatten gal took : 39 ms
[2024-05-25 19:48:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 188 labels/synchronizations in 22 ms.
[2024-05-25 19:48:49] [INFO ] Time to serialize gal into /tmp/LTL4241284431896091415.gal : 8 ms
[2024-05-25 19:48:49] [INFO ] Time to serialize properties into /tmp/LTL6097483207720507038.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/LTL4241284431896091415.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6097483207720507038.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 : !((("(gi2.gi0.gu33.AstopOK>=1)")U(X(X(G(("(gi2.gi0.gu33.AstopOK>=1)")||(X(G((F(G("((((((gu1.s6_1+gu1.s6_0)+(gu1.s6_3+gu1.s6_2))+((gu1....895
Formula 0 simplified : !"(gi2.gi0.gu33.AstopOK>=1)" R XXF(!"(gi2.gi0.gu33.AstopOK>=1)" & XF(GF!"((((((gu1.s6_1+gu1.s6_0)+(gu1.s6_3+gu1.s6_2))+((gu1.s6_5+gu...879
Detected timeout of ITS tools.
Treatment of property QuasiCertifProtocol-PT-18-LTLCardinality-04 finished in 215119 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)))'
[2024-05-25 19:49:04] [INFO ] Flatten gal took : 27 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin4284474728089937310
[2024-05-25 19:49:04] [INFO ] Computing symmetric may disable matrix : 296 transitions.
[2024-05-25 19:49:04] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 19:49:04] [INFO ] Applying decomposition
[2024-05-25 19:49:04] [INFO ] Computing symmetric may enable matrix : 296 transitions.
[2024-05-25 19:49:04] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 19:49:04] [INFO ] Computing Do-Not-Accords matrix : 296 transitions.
[2024-05-25 19:49:04] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 19:49:04] [INFO ] Flatten gal took : 28 ms
[2024-05-25 19:49:04] [INFO ] Built C files in 41ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4284474728089937310
Running compilation step : cd /tmp/ltsmin4284474728089937310;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph3855542837938405248.txt' '-o' '/tmp/graph3855542837938405248.bin' '-w' '/tmp/graph3855542837938405248.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3855542837938405248.bin' '-l' '-1' '-v' '-w' '/tmp/graph3855542837938405248.weights' '-q' '0' '-e' '0.001'
[2024-05-25 19:49:04] [INFO ] Decomposing Gal with order
[2024-05-25 19:49:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 19:49:05] [INFO ] Removed a total of 152 redundant transitions.
[2024-05-25 19:49:05] [INFO ] Flatten gal took : 53 ms
[2024-05-25 19:49:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 145 labels/synchronizations in 14 ms.
[2024-05-25 19:49:05] [INFO ] Time to serialize gal into /tmp/LTLCardinality17228074603696166797.gal : 7 ms
[2024-05-25 19:49:05] [INFO ] Time to serialize properties into /tmp/LTLCardinality26045728619353656.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/LTLCardinality17228074603696166797.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality26045728619353656.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...296
Read 3 LTL properties
Checking formula 0 : !((F(("(((((((gi5.gi10.gu38.n1_4+gi5.gi10.gu38.n1_5)+(gi5.gi10.gu38.n1_2+gi5.gi10.gu38.n1_3))+((gi5.gi10.gu38.n1_0+gi5.gi10.gu38.n1_1)...1300
Formula 0 simplified : G(!"(((((((gi5.gi10.gu38.n1_4+gi5.gi10.gu38.n1_5)+(gi5.gi10.gu38.n1_2+gi5.gi10.gu38.n1_3))+((gi5.gi10.gu38.n1_0+gi5.gi10.gu38.n1_1)+...1294
Compilation finished in 1331 ms.
Running link step : cd /tmp/ltsmin4284474728089937310;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin4284474728089937310;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>(((LTLAPp0==true)||[]((LTLAPp1==true))))' '--buchi-type=spotba'
LTSmin run took 75880 ms.
FORMULA QuasiCertifProtocol-PT-18-LTLCardinality-02 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin4284474728089937310;'/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' '((LTLAPp2==true) U X(X([](((LTLAPp2==true)||X([]((<>([]((LTLAPp3==true))) U (LTLAPp4==true)))))))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.032: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.032: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.236: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.236: LTL layer: formula: ((LTLAPp2==true) U X(X([](((LTLAPp2==true)||X([]((<>([]((LTLAPp3==true))) U (LTLAPp4==true)))))))))
pins2lts-mc-linux64( 0/ 8), 0.236: "((LTLAPp2==true) U X(X([](((LTLAPp2==true)||X([]((<>([]((LTLAPp3==true))) U (LTLAPp4==true)))))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.237: Using Spin LTL semantics
pins2lts-mc-linux64( 1/ 8), 0.248: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.251: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.254: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.255: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.259: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.262: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.268: buchi has 12 states
pins2lts-mc-linux64( 4/ 8), 0.267: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.405: There are 302 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.405: State length is 1381, there are 320 groups
pins2lts-mc-linux64( 0/ 8), 0.405: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.405: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.405: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.405: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 7/ 8), 0.465: [Blue] ~21 levels ~960 states ~4752 transitions
pins2lts-mc-linux64( 7/ 8), 0.506: [Blue] ~21 levels ~1920 states ~8608 transitions
pins2lts-mc-linux64( 7/ 8), 0.561: [Blue] ~21 levels ~3840 states ~19096 transitions
pins2lts-mc-linux64( 1/ 8), 0.696: [Blue] ~25 levels ~7680 states ~28416 transitions
pins2lts-mc-linux64( 1/ 8), 0.873: [Blue] ~25 levels ~15360 states ~59672 transitions
pins2lts-mc-linux64( 1/ 8), 1.257: [Blue] ~25 levels ~30720 states ~129968 transitions
pins2lts-mc-linux64( 1/ 8), 1.941: [Blue] ~25 levels ~61440 states ~283744 transitions
pins2lts-mc-linux64( 1/ 8), 3.241: [Blue] ~25 levels ~122880 states ~615312 transitions
pins2lts-mc-linux64( 1/ 8), 5.794: [Blue] ~25 levels ~245760 states ~1345848 transitions
pins2lts-mc-linux64( 1/ 8), 10.804: [Blue] ~25 levels ~491520 states ~2896696 transitions
pins2lts-mc-linux64( 1/ 8), 20.321: [Blue] ~25 levels ~983040 states ~6201824 transitions
pins2lts-mc-linux64( 1/ 8), 38.385: [Blue] ~25 levels ~1966080 states ~12739544 transitions
pins2lts-mc-linux64( 0/ 8), 75.127: [Blue] ~25 levels ~3932160 states ~27108416 transitions
pins2lts-mc-linux64( 1/ 8), 149.943: [Blue] ~25 levels ~7864320 states ~57626072 transitions
pins2lts-mc-linux64( 1/ 8), 305.914: [Blue] ~26 levels ~15728640 states ~117757808 transitions
pins2lts-mc-linux64( 0/ 8), 314.073: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 314.152:
pins2lts-mc-linux64( 0/ 8), 314.152: Explored 14376629 states 112580416 transitions, fanout: 7.831
pins2lts-mc-linux64( 0/ 8), 314.152: Total exploration time 313.720 sec (313.650 sec minimum, 313.676 sec on average)
pins2lts-mc-linux64( 0/ 8), 314.153: States per second: 45826, Transitions per second: 358856
pins2lts-mc-linux64( 0/ 8), 314.153:
pins2lts-mc-linux64( 0/ 8), 314.153: State space has 14368954 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 314.153: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 314.153: blue states: 14376629 (100.05%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 314.153: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 314.153: all-red states: 0 (0.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 314.153:
pins2lts-mc-linux64( 0/ 8), 314.153: Total memory used for local state coloring: 0.0MB
pins2lts-mc-linux64( 0/ 8), 314.153:
pins2lts-mc-linux64( 0/ 8), 314.153: Queue width: 8B, total height: 200, memory: 0.00MB
pins2lts-mc-linux64( 0/ 8), 314.153: Tree memory: 365.6MB, 26.7 B/state, compr.: 0.5%
pins2lts-mc-linux64( 0/ 8), 314.153: Tree fill ratio (roots/leafs): 10.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 314.153: Stored 298 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 314.153: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 314.153: Est. total memory use: 365.6MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin4284474728089937310;'/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' '((LTLAPp2==true) U X(X([](((LTLAPp2==true)||X([]((<>([]((LTLAPp3==true))) U (LTLAPp4==true)))))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin4284474728089937310;'/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' '((LTLAPp2==true) U X(X([](((LTLAPp2==true)||X([]((<>([]((LTLAPp3==true))) U (LTLAPp4==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-25 20:03:00] [INFO ] Flatten gal took : 26 ms
[2024-05-25 20:03:00] [INFO ] Time to serialize gal into /tmp/LTLCardinality13626846416715750842.gal : 4 ms
[2024-05-25 20:03:00] [INFO ] Time to serialize properties into /tmp/LTLCardinality17749909925834956044.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/LTLCardinality13626846416715750842.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality17749909925834956044.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 2 LTL properties
Checking formula 0 : !((("(AstopOK>=1)")U(X(X(G(("(AstopOK>=1)")||(X(G((F(G("((((((s6_1+s6_0)+(s6_3+s6_2))+((s6_5+s6_4)+(s6_7+s6_6)))+(((s6_10+s6_11)+(s6_8...617
Formula 0 simplified : !"(AstopOK>=1)" R XXF(!"(AstopOK>=1)" & XF(GF!"((((((s6_1+s6_0)+(s6_3+s6_2))+((s6_5+s6_4)+(s6_7+s6_6)))+(((s6_10+s6_11)+(s6_8+s6_9))...601
ITS-tools command line returned an error code 137
[2024-05-25 20:14:11] [INFO ] Flatten gal took : 36 ms
[2024-05-25 20:14:11] [INFO ] Input system was already deterministic with 296 transitions.
[2024-05-25 20:14:11] [INFO ] Transformed 1380 places.
[2024-05-25 20:14:11] [INFO ] Transformed 296 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-25 20:14:11] [INFO ] Time to serialize gal into /tmp/LTLCardinality63602959609543718.gal : 8 ms
[2024-05-25 20:14:11] [INFO ] Time to serialize properties into /tmp/LTLCardinality488550364398291561.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/LTLCardinality63602959609543718.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality488550364398291561.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...339
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((("(AstopOK>=1)")U(X(X(G(("(AstopOK>=1)")||(X(G((F(G("((((((s6_1+s6_0)+(s6_3+s6_2))+((s6_5+s6_4)+(s6_7+s6_6)))+(((s6_10+s6_11)+(s6_8...617
Formula 0 simplified : !"(AstopOK>=1)" R XXF(!"(AstopOK>=1)" & XF(GF!"((((((s6_1+s6_0)+(s6_3+s6_2))+((s6_5+s6_4)+(s6_7+s6_6)))+(((s6_10+s6_11)+(s6_8+s6_9))...601
ITS-tools command line returned an error code 137
Total runtime 3091119 ms.

BK_STOP 1716668706859

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="QuasiCertifProtocol-PT-18"
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 QuasiCertifProtocol-PT-18, 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 r312-tall-171662337800083"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/QuasiCertifProtocol-PT-18.tgz
mv QuasiCertifProtocol-PT-18 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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;