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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 512K
-rw-r--r-- 1 mcc users 7.9K Apr 13 04:07 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Apr 13 04:07 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Apr 13 04:00 CTLFireability.txt
-rw-r--r-- 1 mcc users 85K Apr 13 04:00 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 4.0K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.9K Apr 13 04:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 62K Apr 13 04:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Apr 13 04:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 13 04:10 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 93K 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-COL-18-LTLCardinality-00
FORMULA_NAME QuasiCertifProtocol-COL-18-LTLCardinality-01
FORMULA_NAME QuasiCertifProtocol-COL-18-LTLCardinality-02
FORMULA_NAME QuasiCertifProtocol-COL-18-LTLCardinality-03
FORMULA_NAME QuasiCertifProtocol-COL-18-LTLCardinality-04
FORMULA_NAME QuasiCertifProtocol-COL-18-LTLCardinality-05
FORMULA_NAME QuasiCertifProtocol-COL-18-LTLCardinality-06
FORMULA_NAME QuasiCertifProtocol-COL-18-LTLCardinality-07
FORMULA_NAME QuasiCertifProtocol-COL-18-LTLCardinality-08
FORMULA_NAME QuasiCertifProtocol-COL-18-LTLCardinality-09
FORMULA_NAME QuasiCertifProtocol-COL-18-LTLCardinality-10
FORMULA_NAME QuasiCertifProtocol-COL-18-LTLCardinality-11
FORMULA_NAME QuasiCertifProtocol-COL-18-LTLCardinality-12
FORMULA_NAME QuasiCertifProtocol-COL-18-LTLCardinality-13
FORMULA_NAME QuasiCertifProtocol-COL-18-LTLCardinality-14
FORMULA_NAME QuasiCertifProtocol-COL-18-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716656004198

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-COL-18
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
LTLCardinality COL
Running Version 202405141337
[2024-05-25 16:53:25] [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 16:53:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 16:53:25] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-25 16:53:25] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-25 16:53:26] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 646 ms
[2024-05-25 16:53:26] [INFO ] Imported 30 HL places and 26 HL transitions for a total of 1398 PT places and 296.0 transition bindings in 19 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
[2024-05-25 16:53:26] [INFO ] Built PT skeleton of HLPN with 30 places and 26 transitions 77 arcs in 5 ms.
[2024-05-25 16:53:26] [INFO ] Skeletonized 16 HLPN properties in 6 ms.
Initial state reduction rules removed 4 formulas.
FORMULA QuasiCertifProtocol-COL-18-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-18-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-18-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-18-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 30 stabilizing places and 26 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 30 transition count 26
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Remains 12 properties that can be checked using skeleton over-approximation.
Computed a total of 30 stabilizing places and 26 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 30 transition count 26
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
RANDOM walk for 40013 steps (1479 resets) in 750 ms. (53 steps per ms) remains 13/25 properties
BEST_FIRST walk for 40003 steps (530 resets) in 393 ms. (101 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (525 resets) in 227 ms. (175 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (525 resets) in 168 ms. (236 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (522 resets) in 147 ms. (270 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (531 resets) in 114 ms. (347 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40010 steps (814 resets) in 104 ms. (381 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40000 steps (664 resets) in 114 ms. (347 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (815 resets) in 132 ms. (300 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (532 resets) in 138 ms. (287 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40007 steps (524 resets) in 227 ms. (175 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (529 resets) in 62 ms. (634 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (527 resets) in 71 ms. (555 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (525 resets) in 85 ms. (465 steps per ms) remains 13/13 properties
// Phase 1: matrix 26 rows 30 cols
[2024-05-25 16:53:27] [INFO ] Computed 5 invariants in 6 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 14/27 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 26/53 variables, 27/32 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 3/56 variables, 3/35 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/56 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 0/56 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 56/56 variables, and 35 constraints, problems are : Problem set: 0 solved, 13 unsolved in 326 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 14/27 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 26/53 variables, 27/32 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 11/43 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (OVERLAPS) 3/56 variables, 3/46 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/56 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/56 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (OVERLAPS) 0/56 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 56/56 variables, and 48 constraints, problems are : Problem set: 0 solved, 13 unsolved in 418 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
After SMT, in 806ms problems are : Problem set: 0 solved, 13 unsolved
Fused 13 Parikh solutions to 11 different solutions.
Finished Parikh walk after 63 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=31 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 13 properties in 221 ms.
[2024-05-25 16:53:28] [INFO ] Flatten gal took : 18 ms
[2024-05-25 16:53:28] [INFO ] Flatten gal took : 5 ms
Domain [tsid(19), tsid(19)] of place n9 breaks symmetries in sort tsid
[2024-05-25 16:53:28] [INFO ] Unfolded HLPN to a Petri net with 1398 places and 296 transitions 3119 arcs in 22 ms.
[2024-05-25 16:53:28] [INFO ] Unfolded 12 HLPN properties in 1 ms.
Support contains 1339 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 19 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 16:53:28] [INFO ] Computed 1102 invariants in 73 ms
[2024-05-25 16:53:29] [INFO ] Implicit Places using invariants in 480 ms returned []
[2024-05-25 16:53:29] [INFO ] Invariant cache hit.
[2024-05-25 16:53:29] [INFO ] Implicit Places using invariants and state equation in 726 ms returned [1219, 1220, 1221, 1222, 1223, 1224, 1225, 1226, 1227, 1228, 1229, 1230, 1231, 1232, 1233, 1234, 1235, 1236, 1237]
Discarding 19 places :
Implicit Place search using SMT with State Equation took 1219 ms to find 19 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1378/1398 places, 296/296 transitions.
Applied a total of 0 rules in 7 ms. Remains 1378 /1378 variables (removed 0) and now considering 296/296 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1255 ms. Remains : 1378/1398 places, 296/296 transitions.
Support contains 1339 out of 1378 places after structural reductions.
[2024-05-25 16:53:30] [INFO ] Flatten gal took : 86 ms
[2024-05-25 16:53:30] [INFO ] Flatten gal took : 64 ms
[2024-05-25 16:53:30] [INFO ] Input system was already deterministic with 296 transitions.
Support contains 1338 out of 1378 places (down from 1339) after GAL structural reductions.
RANDOM walk for 40000 steps (1767 resets) in 2571 ms. (15 steps per ms) remains 19/24 properties
BEST_FIRST walk for 4004 steps (12 resets) in 56 ms. (70 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (9 resets) in 26 ms. (148 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (11 resets) in 21 ms. (182 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (11 resets) in 32 ms. (121 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (12 resets) in 27 ms. (143 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (16 resets) in 42 ms. (93 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (11 resets) in 25 ms. (154 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (13 resets) in 26 ms. (148 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (12 resets) in 27 ms. (143 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (16 resets) in 29 ms. (133 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (14 resets) in 38 ms. (102 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (13 resets) in 31 ms. (125 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (13 resets) in 38 ms. (102 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (11 resets) in 22 ms. (174 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (12 resets) in 45 ms. (87 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (11 resets) in 42 ms. (93 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (12 resets) in 26 ms. (148 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (12 resets) in 52 ms. (75 steps per ms) remains 19/19 properties
// Phase 1: matrix 296 rows 1378 cols
[2024-05-25 16:53:31] [INFO ] Computed 1083 invariants in 23 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1279 variables, 702/702 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1279 variables, 0/702 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (OVERLAPS) 78/1357 variables, 21/723 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1357 variables, 342/1065 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1357 variables, 0/1065 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (OVERLAPS) 19/1376 variables, 18/1083 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1376 variables, 0/1083 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (OVERLAPS) 294/1670 variables, 1376/2459 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1670 variables, 0/2459 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (OVERLAPS) 4/1674 variables, 2/2461 constraints. Problems are: Problem set: 0 solved, 19 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1674/1674 variables, and 2461 constraints, problems are : Problem set: 0 solved, 19 unsolved in 5025 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 1062/1062 constraints, State Equation: 1378/1378 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 19 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1279 variables, 702/702 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1279 variables, 0/702 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (OVERLAPS) 78/1357 variables, 21/723 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1357 variables, 342/1065 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-05-25 16:53:37] [INFO ] Deduced a trap composed of 10 places in 523 ms of which 63 ms to minimize.
[2024-05-25 16:53:38] [INFO ] Deduced a trap composed of 11 places in 485 ms of which 7 ms to minimize.
[2024-05-25 16:53:39] [INFO ] Deduced a trap composed of 10 places in 502 ms of which 13 ms to minimize.
[2024-05-25 16:53:39] [INFO ] Deduced a trap composed of 10 places in 440 ms of which 7 ms to minimize.
[2024-05-25 16:53:39] [INFO ] Deduced a trap composed of 9 places in 423 ms of which 8 ms to minimize.
[2024-05-25 16:53:40] [INFO ] Deduced a trap composed of 10 places in 391 ms of which 7 ms to minimize.
[2024-05-25 16:53:40] [INFO ] Deduced a trap composed of 10 places in 418 ms of which 13 ms to minimize.
[2024-05-25 16:53:41] [INFO ] Deduced a trap composed of 10 places in 396 ms of which 8 ms to minimize.
[2024-05-25 16:53:41] [INFO ] Deduced a trap composed of 9 places in 391 ms of which 7 ms to minimize.
SMT process timed out in 10382ms, After SMT, problems are : Problem set: 0 solved, 19 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1279 out of 1378 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1378/1378 places, 296/296 transitions.
Graph (complete) has 9223 edges and 1378 vertex of which 1358 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.8 ms
Discarding 20 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 59 transitions
Reduce isomorphic transitions removed 59 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 60 rules applied. Total rules applied 61 place count 1358 transition count 236
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 62 place count 1357 transition count 236
Applied a total of 62 rules in 55 ms. Remains 1357 /1378 variables (removed 21) and now considering 236/296 (removed 60) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65 ms. Remains : 1357/1378 places, 236/296 transitions.
RANDOM walk for 40000 steps (1242 resets) in 2713 ms. (14 steps per ms) remains 12/19 properties
BEST_FIRST walk for 40003 steps (82 resets) in 569 ms. (70 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (84 resets) in 170 ms. (233 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (84 resets) in 188 ms. (211 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (84 resets) in 172 ms. (231 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (100 resets) in 213 ms. (186 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (84 resets) in 180 ms. (221 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (64 resets) in 191 ms. (208 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (100 resets) in 222 ms. (179 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (84 resets) in 400 ms. (99 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (84 resets) in 500 ms. (79 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (84 resets) in 301 ms. (132 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (83 resets) in 140 ms. (283 steps per ms) remains 12/12 properties
// Phase 1: matrix 236 rows 1357 cols
[2024-05-25 16:53:43] [INFO ] Computed 1121 invariants in 26 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1218 variables, 324/324 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1218 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 98/1316 variables, 779/1103 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1316 variables, 0/1103 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 232/1548 variables, 1316/2419 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1548 variables, 0/2419 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 45/1593 variables, 41/2460 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1593 variables, 18/2478 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1593 variables, 0/2478 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (OVERLAPS) 0/1593 variables, 0/2478 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1593/1593 variables, and 2478 constraints, problems are : Problem set: 0 solved, 12 unsolved in 5069 ms.
Refiners :[Generalized P Invariants (flows): 1121/1121 constraints, State Equation: 1357/1357 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1218 variables, 324/324 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1218 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 98/1316 variables, 779/1103 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1316 variables, 0/1103 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 232/1548 variables, 1316/2419 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1548 variables, 9/2428 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1548 variables, 0/2428 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 45/1593 variables, 41/2469 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1593 variables, 18/2487 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1593/1593 variables, and 2490 constraints, problems are : Problem set: 0 solved, 12 unsolved in 45028 ms.
Refiners :[Generalized P Invariants (flows): 1121/1121 constraints, State Equation: 1357/1357 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
After SMT, in 50192ms problems are : Problem set: 0 solved, 12 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1218 out of 1357 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1357/1357 places, 236/236 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Discarding 19 places :
Implicit places reduction removed 19 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 1338 transition count 213
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 43 place count 1337 transition count 213
Applied a total of 43 rules in 39 ms. Remains 1337 /1357 variables (removed 20) and now considering 213/236 (removed 23) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 1337/1357 places, 213/236 transitions.
RANDOM walk for 40000 steps (972 resets) in 1364 ms. (29 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (80 resets) in 313 ms. (127 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (80 resets) in 119 ms. (333 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (79 resets) in 148 ms. (268 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (80 resets) in 137 ms. (289 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40000 steps (92 resets) in 174 ms. (228 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (80 resets) in 144 ms. (275 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (61 resets) in 146 ms. (272 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40000 steps (92 resets) in 175 ms. (227 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (80 resets) in 306 ms. (130 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (79 resets) in 314 ms. (126 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (79 resets) in 301 ms. (132 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (80 resets) in 133 ms. (298 steps per ms) remains 12/12 properties
Interrupted probabilistic random walk after 871574 steps, run timeout after 3001 ms. (steps per millisecond=290 ) properties seen :11 out of 12
Probabilistic random walk after 871574 steps, saw 117237 distinct states, run finished after 3007 ms. (steps per millisecond=289 ) properties seen :11
// Phase 1: matrix 213 rows 1337 cols
[2024-05-25 16:54:38] [INFO ] Computed 1124 invariants in 10 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 135/154 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 23/177 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/177 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/178 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/178 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1159/1337 variables, 1103/1124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1337 variables, 0/1124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 213/1550 variables, 1337/2461 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1550 variables, 0/2461 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1550 variables, 0/2461 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1550/1550 variables, and 2461 constraints, problems are : Problem set: 0 solved, 1 unsolved in 752 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 1104/1104 constraints, State Equation: 1337/1337 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/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 135/154 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 23/177 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/177 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/178 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/178 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1159/1337 variables, 1103/1124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1337 variables, 0/1124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 213/1550 variables, 1337/2461 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1550 variables, 1/2462 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1550 variables, 0/2462 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/1550 variables, 0/2462 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1550/1550 variables, and 2462 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1179 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 1104/1104 constraints, State Equation: 1337/1337 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1960ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 101 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=25 )
Parikh walk visited 1 properties in 6 ms.
Computed a total of 1378 stabilizing places and 296 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1378 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 1378 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1378/1378 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 1337 transition count 296
Applied a total of 41 rules in 82 ms. Remains 1337 /1378 variables (removed 41) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 1337 cols
[2024-05-25 16:54:40] [INFO ] Computed 1044 invariants in 68 ms
[2024-05-25 16:54:41] [INFO ] Implicit Places using invariants in 1099 ms returned []
[2024-05-25 16:54:41] [INFO ] Invariant cache hit.
[2024-05-25 16:54:43] [INFO ] Implicit Places using invariants and state equation in 2403 ms returned []
Implicit Place search using SMT with State Equation took 3506 ms to find 0 implicit places.
Running 276 sub problems to find dead transitions.
[2024-05-25 16:54:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1336 variables, 1044/1044 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1336 variables, 0/1044 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 296/1632 variables, 1336/2380 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1632 variables, 0/2380 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 1/1633 variables, 1/2381 constraints. Problems are: Problem set: 0 solved, 276 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1633/1633 variables, and 2381 constraints, problems are : Problem set: 0 solved, 276 unsolved in 30021 ms.
Refiners :[Generalized P Invariants (flows): 1044/1044 constraints, State Equation: 1337/1337 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 276 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1336 variables, 1044/1044 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1336 variables, 0/1044 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 296/1632 variables, 1336/2380 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1632 variables, 276/2656 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1632 variables, 0/2656 constraints. Problems are: Problem set: 0 solved, 276 unsolved
SMT process timed out in 60361ms, After SMT, problems are : Problem set: 0 solved, 276 unsolved
Search for dead transitions found 0 dead transitions in 60367ms
Starting structural reductions in LTL mode, iteration 1 : 1337/1378 places, 296/296 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63960 ms. Remains : 1337/1378 places, 296/296 transitions.
Stuttering acceptance computed with spot in 228 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-18-LTLCardinality-00
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 2 ms.
FORMULA QuasiCertifProtocol-COL-18-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-18-LTLCardinality-00 finished in 64248 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 1378 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1378/1378 places, 296/296 transitions.
Graph (complete) has 9223 edges and 1378 vertex of which 1336 are kept as prefixes of interest. Removing 42 places using SCC suffix rule.10 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 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 1335 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 1335 transition count 293
Applied a total of 4 rules in 304 ms. Remains 1335 /1378 variables (removed 43) and now considering 293/296 (removed 3) transitions.
// Phase 1: matrix 293 rows 1335 cols
[2024-05-25 16:55:44] [INFO ] Computed 1044 invariants in 7 ms
[2024-05-25 16:55:46] [INFO ] Implicit Places using invariants in 1231 ms returned []
[2024-05-25 16:55:46] [INFO ] Invariant cache hit.
[2024-05-25 16:55:53] [INFO ] Implicit Places using invariants and state equation in 7053 ms returned []
Implicit Place search using SMT with State Equation took 8285 ms to find 0 implicit places.
[2024-05-25 16:55:53] [INFO ] Redundant transitions in 37 ms returned []
Running 273 sub problems to find dead transitions.
[2024-05-25 16:55:53] [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
At refinement iteration 6 (OVERLAPS) 1/1628 variables, 1/2379 constraints. Problems are: Problem set: 0 solved, 273 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1628/1628 variables, and 2379 constraints, problems are : Problem set: 0 solved, 273 unsolved in 30017 ms.
Refiners :[Generalized P Invariants (flows): 1044/1044 constraints, State Equation: 1335/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 30016 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 60301ms problems are : Problem set: 0 solved, 273 unsolved
Search for dead transitions found 0 dead transitions in 60305ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1335/1378 places, 293/296 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 68941 ms. Remains : 1335/1378 places, 293/296 transitions.
Stuttering acceptance computed with spot in 35 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : QuasiCertifProtocol-COL-18-LTLCardinality-02
Product exploration explored 100000 steps with 10835 reset in 422 ms.
Product exploration explored 100000 steps with 10792 reset in 334 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 501 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 31 ms :[(AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (1764 resets) in 244 ms. (163 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (172 resets) in 194 ms. (205 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (130 resets) in 58 ms. (678 steps per ms) remains 2/2 properties
[2024-05-25 16:56:55] [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 717 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 1202 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 1935ms problems are : Problem set: 0 solved, 2 unsolved
Finished Parikh walk after 32 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=10 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
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 776 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 28 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 44 ms :[(AND (NOT p0) (NOT p1))]
[2024-05-25 16:56:58] [INFO ] Invariant cache hit.
[2024-05-25 16:56:59] [INFO ] [Real]Absence check using 0 positive and 1044 generalized place invariants in 1243 ms returned sat
[2024-05-25 16:57:05] [INFO ] [Real]Absence check using state equation in 5851 ms returned sat
[2024-05-25 16:57:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:57:07] [INFO ] [Nat]Absence check using 0 positive and 1044 generalized place invariants in 1234 ms returned sat
[2024-05-25 16:57:12] [INFO ] [Nat]Absence check using state equation in 5286 ms returned sat
[2024-05-25 16:57:12] [INFO ] Computed and/alt/rep : 212/250/212 causal constraints (skipped 61 transitions) in 21 ms.
[2024-05-25 16:57:12] [INFO ] Added : 0 causal constraints over 0 iterations in 131 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 52 ms. Remains 1335 /1335 variables (removed 0) and now considering 293/293 (removed 0) transitions.
[2024-05-25 16:57:12] [INFO ] Invariant cache hit.
[2024-05-25 16:57:14] [INFO ] Implicit Places using invariants in 1405 ms returned []
[2024-05-25 16:57:14] [INFO ] Invariant cache hit.
[2024-05-25 16:57:21] [INFO ] Implicit Places using invariants and state equation in 6922 ms returned []
Implicit Place search using SMT with State Equation took 8329 ms to find 0 implicit places.
[2024-05-25 16:57:21] [INFO ] Redundant transitions in 20 ms returned []
Running 273 sub problems to find dead transitions.
[2024-05-25 16:57:21] [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
At refinement iteration 6 (OVERLAPS) 1/1628 variables, 1/2379 constraints. Problems are: Problem set: 0 solved, 273 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1628/1628 variables, and 2379 constraints, problems are : Problem set: 0 solved, 273 unsolved in 30014 ms.
Refiners :[Generalized P Invariants (flows): 1044/1044 constraints, State Equation: 1335/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
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
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 30014 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 60345ms problems are : Problem set: 0 solved, 273 unsolved
Search for dead transitions found 0 dead transitions in 60349ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 68758 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 469 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 30 ms :[(AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (1767 resets) in 160 ms. (248 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (172 resets) in 108 ms. (367 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (125 resets) in 74 ms. (533 steps per ms) remains 2/2 properties
[2024-05-25 16:58:22] [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 707 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 1200 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 1921ms problems are : Problem set: 0 solved, 2 unsolved
Finished Parikh walk after 31 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=15 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
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 597 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 41 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 40 ms :[(AND (NOT p0) (NOT p1))]
[2024-05-25 16:58:25] [INFO ] Invariant cache hit.
[2024-05-25 16:58:26] [INFO ] [Real]Absence check using 0 positive and 1044 generalized place invariants in 1276 ms returned sat
[2024-05-25 16:58:32] [INFO ] [Real]Absence check using state equation in 6029 ms returned sat
[2024-05-25 16:58:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:58:34] [INFO ] [Nat]Absence check using 0 positive and 1044 generalized place invariants in 1248 ms returned sat
[2024-05-25 16:58:39] [INFO ] [Nat]Absence check using state equation in 5330 ms returned sat
[2024-05-25 16:58:39] [INFO ] Computed and/alt/rep : 212/250/212 causal constraints (skipped 61 transitions) in 25 ms.
[2024-05-25 16:58:40] [INFO ] Added : 0 causal constraints over 0 iterations in 139 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 39 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 10849 reset in 333 ms.
Product exploration explored 100000 steps with 10820 reset in 322 ms.
Built C files in :
/tmp/ltsmin5183307907168465581
[2024-05-25 16:58:40] [INFO ] Computing symmetric may disable matrix : 293 transitions.
[2024-05-25 16:58:40] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 16:58:40] [INFO ] Computing symmetric may enable matrix : 293 transitions.
[2024-05-25 16:58:40] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 16:58:40] [INFO ] Computing Do-Not-Accords matrix : 293 transitions.
[2024-05-25 16:58:40] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 16:58:40] [INFO ] Built C files in 78ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5183307907168465581
Running compilation step : cd /tmp/ltsmin5183307907168465581;'/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 1396 ms.
Running link step : cd /tmp/ltsmin5183307907168465581;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 153 ms.
Running LTSmin : cd /tmp/ltsmin5183307907168465581;'/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/stateBased16243723203737424920.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 53 ms. Remains 1335 /1335 variables (removed 0) and now considering 293/293 (removed 0) transitions.
[2024-05-25 16:58:55] [INFO ] Invariant cache hit.
[2024-05-25 16:58:57] [INFO ] Implicit Places using invariants in 1180 ms returned []
[2024-05-25 16:58:57] [INFO ] Invariant cache hit.
[2024-05-25 16:59:04] [INFO ] Implicit Places using invariants and state equation in 7297 ms returned []
Implicit Place search using SMT with State Equation took 8478 ms to find 0 implicit places.
[2024-05-25 16:59:04] [INFO ] Redundant transitions in 20 ms returned []
Running 273 sub problems to find dead transitions.
[2024-05-25 16:59:04] [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
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 30017 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
Error getting values : (error "ParserException while parsing response: ((s0 10)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 0)
(s348 0)
(s349 0)
(s350 0)
(s351 0)
(s352 0)
(s353 0)
(s354 0)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 0)
(s362 0)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 0)
(s369 0)
(s370 0)
(s371 0)
(s372 0)
(s373 0)
(s374 0)
(s375 0)
(s376 0)
(s377 0)
(s378 0)
(s379 0)
(s380 0)
(s381 0)
(s382 0)
(s383 0)
(s384 0)
(s385 0)
(s386 0)
(s387 0)
(s388 0)
(s389 0)
(s390 0)
(s391 0)
(s392 0)
(s393 0)
(s394 0)
(s395 0)
(s396 0)
(s397 0)
(s398 0)
(s399 0)
(s400 0)
(s401 0)
(s402 0)
(s403 0)
(s404 0)
(s405 0)
(s406 0)
(s407 0)
(s408 0)
(s409 0)
(s410 0)
(s411 0)
(s412 0)
(s413 0)
(s414 0)
(s415 0)
(s416 0)
(s417 0)
(s418 0)
(s419 0)
(s420 0)
(s421 0)
(s422 0)
(s423 0)
(s424 0)
(s425 0)
(s426 0)
(s427 0)
(s428 0)
(s429 0)
(s430 0)
(s431 0)
(s432 0)
(s433 0)
(s434 0)
(s435 0)
(s436 0)
(s437 0)
(s438 0)
(s439 0)
(s440 0)
(s441 0)
(s442 0)
(s443 0)
(s444 0)
(s445 0)
(s446 0)
(s447 0)
(s448 0)
(s449 0)
(s450 0)
(s451 0)
(s452 0)
(s453 0)
(s454 0)
(s455 0)
(s456 0)
(s457 0)
(s458 0)
(s459 0)
(s460 0)
(s461 0)
(s462 0)
(s463 0)
(s464 0)
(s465 0)
(s466 0)
(s467 0)
(s468 0)
(s469 0)
(s470 0)
(s471 0)
(s472 0)
(s473 0)
(s474 0)
(s475 0)
(s476 0)
(s477 0)
(s478 0)
(s479 0)
(s480 0)
(s481 0)
(s482 0)
(s483 0)
(s484 0)
(s485 0)
(s486 0)
(s487 0)
(s488 0)
(s489 0)
(s490 0)
(s491 0)
(s492 0)
(s493 0)
(s494 0)
(s495 0)
(s496 0)
(s497 0)
(s498 0)
(s499 0)
(s500 0)
(s501 0)
(s502 0)
(s503 0)
(s504 0)
(s505 0)
(s506 0)
(s507 0)
(s508 0)
(s509 0)
(s510 0)
(s511 0)
(s512 0)
(s513 0)
(s514 0)
(s515 0)
(s516 0)
(s517 0)
(s518 0)
(s519 0)
(s520 0)
(s521 0)
(s522 0)
(s523 0)
(s524 0)
(s525 0)
(s526 0)
(s527 0)
(s528 0)
(s529 0)
(s530 0)
(s531 0)
(s532 0)
(s533 0)
(s534 0)
(s535 0)
(s536 0)
(s537 0)
(s538 0)
(s539 0)
(s540 0)
(s541 0)
(s542 0)
(s543 0)
(s544 0)
(s545 0)
(s546 0)
(s547 0)
(s548 0)
(s549 0)
(s550 0)
(s551 0)
(s552 0)
(s553 0)
(s554 0)
(s555 0)
(s556 0)
(s557 0)
(s558 0)
(s559 0)
(s560 0)
(s561 0)
(s562 0)
(s563 0)
(s564 0)
(s565 0)
(s566 0)
(s567 0)
(s568 0)
(s569 0)
(s570 0)
(s571 0)
(s572 0)
(s573 0)
(s574 0)
(s575 0)
(s576 0)
(s577 0)
(s578 0)
(s579 0)
(s580 0)
(s581 0)
(s582 0)
(s583 0)
(s584 0)
(s585 0)
(s586 0)
(s587 0)
(s588 0)
(s589 0)
(s590 0)
(s591 0)
(s592 0)
(s593 0)
(s594 0)
(s595 0)
(s596 0)
(s597 0)
(s598 0)
(s599 0)
(s600 0)
(s601 0)
(s602 0)
(s603 0)
(s604 0)
(s605 0)
(s606 0)
(s607 0)
(s608 0)
(s609 0)
(s610 0)
(s611 0)
(s612 0)
(s613 0)
(s614 0)
(s615 0)
(s616 0)
(s617 0)
(s618 0)
(s619 0)
(s620 0)
(s621 0)
(s622 0)
(s623 0)
(s624 0)
(s625 0)
(s626 0)
(s627 0)
(s628 0)
(s629 0)
(s630 0)
(s631 0)
(s632 0)
(s633 0)
(s634 0)
(s635 0)
(s636 0)
(s637 0)
(s638 0)
(s639 0)
(s640 0)
(s641 0)
(s642 0)
(s643 0)
(s644 0)
(s645 0)
(s646 0)
(s647 0)
(s648 0)
(s649 0)
(s650 0)
(s651 0)
(s652 0)
(s653 0)
(s654 0)
(s655 0)
(s656 0)
(s657 0)
(s658 0)
(s659 0)
(s660 0)
(s661 0)
(s662 0)
(s663 0)
(s664 0)
(s665 0)
(s666 0)
(s667 0)
(s668 0)
(s669 0)
(s670 0)
(s671 0)
(s672 0)
(s673 0)
(s674 0)
(s675 0)
(s676 0)
(s677 0)
(s678 0)
(s679 0)
(s680 0)
(s681 0)
(s682 0)
(s683 0)
(s684 0)
(s685 0)
(s686 0)
(s687 0)
(s688 0)
(s689 0)
(s690 0)
(s691 0)
(s692 0)
(s693 0)
(s694 0)
(s695 0)
(s696 0)
(s697 0)
(s698 0)
(s699 0)
(s700 0)
(s701 0)
(s702 0)
(s703 0)
(s704 0)
(s705 0)
(s706 0)
(s707 0)
(s708 0)
(s709 0)
(s710 0)
(s711 0)
(s712 0)
(s713 0)
(s714 0)
(s715 0)
(s716 0)
(s717 0)
(s718 0)
(s719 0)
(s720 0)
(s721 0)
(s722 0)
(s723 0)
(s724 0)
(s725 0)
(s726 0)
(s727 0)
(s728 0)
(s729 0)
(s730 0)
(s731 0)
(s732 0)
(s733 0)
(s734 0)
(s735 0)
(s736 0)
(s737 0)
(s738 0)
(s739 0)
(s740 0)
(s741 0)
(s742 0)
(s743 0)
(s744 0)
(s745 0)
(s746 0)
(s747 0)
(s748 0)
(s749 0)
(s750 0)
(s751 0)
(s752 0)
(s753 0)
(s754 0)
(s755 0)
(s756 0)
(s757 0)
(s758 0)
(s759 0)
(s760 0)
(s761 0)
(s762 0)
(s763 0)
(s764 0)
(s765 0)
(s766 0)
(s767 0)
(s768 0)
(s769 0)
(s770 0)
(s771 0)
(s772 0)
(s773 0)
(s774 0)
(s775 0)
(s776 0)
(s777 0)
(s778 0)
(s779 0)
(s780 0)
(s781 0)
(s782 0)
(s783 0)
(s784 0)
(s785 0)
(s786 0)
(s787 0)
(s788 0)
(s789 0)
(s790 0)
(s791 0)
(s792 0)
(s793 0)
(s794 0)
(s795 0)
(s796 0)
(s797 0)
(s798 0)
(s799 0)
(s800 0)
(s801 0)
(s802 0)
(s803 0)
(s804 0)
(s805 0)
(s806 0)
(s807 0)
(s808 0)
(s809 0)
(s810 0)
(s811 0)
(s812 0)
(s813 0)
(s814 0)
(s815 0)
(s816 0)
(s817 0)
(s818 0)
(s819 0)
(s820 0)
(s821 0)
(s822 0)
(s823 0)
(s824 0)
(s825 0)
(s826 0)
(s827 0)
(s828 0)
(s829 0)
(s830 0)
(s831 0)
(s832 0)
(s833 0)
(s834 0)
(s835 0)
(s836 0)
(s837 0)
(s838 0)
(s839 0)
(s840 0)
(s841 0)
(s842 0)
(s843 0)
(s844 0)
(s845 0)
(s846 0)
(s847 0)
(s848 0)
(s849 0)
(s850 0)
(s851 0)
(s852 0)
(s853 0)
(s854 0)
(s855 0)
(s856 0)
(s857 0)
(s858 0)
(s859 0)
(s860 0)
(s861 0)
(s862 0)
(s863 0)
(s864 0)
(s865 0)
(s866 0)
(s867 0)
(s868 0)
(s869 0)
(s870 0)
(s871 0)
(s872 0)
(s873 0)
(s874 0)
(s875 0)
(s876 0)
(s877 0)
(s878 0)
(s879 0)
(s880 0)
(s881 0)
(s882 0)
(s883 0)
(s884 0)
(s885 0)
(s886 0)
(s887 0)
(s888 0)
(s889 0)
(s890 0)
(s891 0)
(s892 0)
(s893 0)
(s894 0)
(s895 0)
(s896 0)
(s897 0)
(s898 0)
(s899 0)
(s900 0)
(s901 0)
(s902 0)
(s903 0)
(s904 0)
(s905 0)
(s906 0)
(s907 0)
(s908 0)
(s909 0)
(s910 0)
(s911 0)
(s912 0)
(s913 0)
(s914 0)
(s915 0)
(s916 0)
(s917 0)
(s918 0)
(s919 0)
(s920 0)
(s921 0)
(s922 0)
(s923 0)
(s924 0)
(s925 0)
(s926 0)
(s927 0)
(s928 0)
(s929 0)
(s930 0)
(s931 0)
(s932 0)
(s933 0)
(s934 0)
(s935 0)
(s936 0)
(s937 0)
(s938 0)
(s939 0)
(s940 0)
(s941 0)
(s942 0)
(s943 0)
(s944 0)
(s945 0)
(s946 0)
(s947 0)
(s948 0)
(s949 0)
(s950 0)
(s951 0)
(s952 0)
(s953 0)
(s954 0)
(s955 0)
(s956 0)
(s957 0)
(s958 0)
(s959 0)
(s960 0)
(s961 0)
(s962 0)
(s963 0)
(s964 0)
(s965 0)
(s966 0)
(s967 0)
(s968 0)
(s969 0)
(s970 0)
(s971 0)
(s972 0)
(s973 0)
(s974 0)
(s975 0)
(s976 0)
(s977 0)
(s978 0)
(s979 0)
(s980 0)
(s981 0)
(s982 0)
(s983 0)
(s984 0)
(s985 0)
(s986 0)
(s987 0)
(s988 0)
(s989 0)
(s990 0)
(s991 0)
(s992 0)
(s993 0)
(s994 0)
(s995 0)
(s996 0)
(s997 0)
(s998 0)
(s999 0)
(s1000 0)
(s1001 0)
(s1002 0)
(s1003 0)
(s1004 0)
(s1005 0)
(s1006 0)
(s1007 0)
(s1008 0)
(s1009 0)
(s1010 0)
(s1011 0)
(s1012 0)
(s1013 0)
(s1014 0)
(s1015 0)
(s1016 0)
(s1017 0)
(s1018 0)
(s1019 0)
(s1020 0)
(s1021 0)
(s1022 0)
(s1023 0)
(s1024 0)
(s1025 0)
(s1026 0)
(s1027 0)
(s1028 0)
(s1029 0)
(s1030 0)
(s1031 0)
(s1032 0)
(s1033 0)
(s1034 0)
(s1035 0)
(s1036 0)
(s1037 0)
(s1038 0)
(s1039 0)
(s1040 0)
(s1041 0)
(s1042 0)
(s1043 0)
(s1044 0)
(s1045 0)
(s1046 0)
(s1047 0)
(s1048 0)
(s1049 0)
(s1050 0)
(s1051 0)
(s1052 0)
(s1053 0)
(s1054 0)
(s1055 0)
(s1056 0)
(s1057 0)
(s1058 0)
(s1059 0)
(s1060 0)
(s1061 0)
(s1062 0)
(s1063 0)
(s1064 0)
(s1065 0)
(s1066 0)
(s1067 0)
(s1068 0)
(s1069 0)
(s1070 0)
(s1071 0)
(s1072 0)
(s1073 0)
(s1074 0)
(s1075 0)
(s1076 0)
(s1077 0)
(s1078 0)
(s1079 0)
(s1080 0)
(s1081 0)
(s1082 0)
(s1083 0)
(s1084 0)
(s1085 0)
(s1086 0)
(s1087 0)
(s1088 0)
(s1089 0)
(s1090 0)
(s1091 0)
(s1092 0)
(s1093 0)
(s1094 0)
(s1095 0)
(s1096 0)
(s1097 0)
(s1098 1)
(s1099 1)
(s1100 1)
(s1101 1)
(s1102 1)
(s1103 0)
(s1104 0)
(s1105 0)
(s1106 0)
(s1107 0)
(s1108 0)
(s1109 0)
(s1110 0)
(s1111 0)
(s1112 0)
(s1113 0)
(s1114 0)
(s1115 0)
(s1116 0)
(s1117 0)
(s1118 0)
(s1119 0)
(s1120 0)
(s1121 0)
(s1122 0)
(s1123 0)
(s1124 0)
(s1125 0)
(s1126 0)
(s1127 0)
(s1128 0)
(s1129 0)
(s1130 0)
(s1131 0)
(s1132 0)
(s1133 0)
(s1134 0)
(s1135 0)
(s1136 0)
(s1137 0)
(s1138 0)
(s1139 0)
(s1140 0)
(s1141 0)
(s1142 0)
(s1143 0)
(s1144 0)
(s1145 0)
(s1146 0)
(s1147 0)
(s1148 0)
(s1149 0)
(s1150 0)
(s1151 0)
(s1152 0)
(s1153 0)
(s1154 0)
(s1155 0)
(s1156 0)
(s1157 0)
(s1158 0)
(s1159 0)
(s1160 1)
(s1161 1)
(s1162 1)
(s1163 1)
(s1164 1)
(s1165 1)
(s1166 1)
(s1167 1)
(s1168 1)
(s1169 1)
(s1170 1)
(s1171 1)
(s1172 1)
(s1173 timeout
1) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
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 30016 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 60279ms problems are : Problem set: 0 solved, 273 unsolved
Search for dead transitions found 0 dead transitions in 60282ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 68853 ms. Remains : 1335/1335 places, 293/293 transitions.
Built C files in :
/tmp/ltsmin6874257463346101546
[2024-05-25 17:00:04] [INFO ] Computing symmetric may disable matrix : 293 transitions.
[2024-05-25 17:00:04] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 17:00:04] [INFO ] Computing symmetric may enable matrix : 293 transitions.
[2024-05-25 17:00:04] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 17:00:04] [INFO ] Computing Do-Not-Accords matrix : 293 transitions.
[2024-05-25 17:00:04] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 17:00:04] [INFO ] Built C files in 54ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6874257463346101546
Running compilation step : cd /tmp/ltsmin6874257463346101546;'/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 1300 ms.
Running link step : cd /tmp/ltsmin6874257463346101546;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin6874257463346101546;'/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/stateBased17954155983036573297.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-25 17:00:19] [INFO ] Flatten gal took : 42 ms
[2024-05-25 17:00:19] [INFO ] Flatten gal took : 38 ms
[2024-05-25 17:00:19] [INFO ] Time to serialize gal into /tmp/LTL589677924587060692.gal : 11 ms
[2024-05-25 17:00:19] [INFO ] Time to serialize properties into /tmp/LTL3176150984973985088.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/LTL589677924587060692.gal' '-t' 'CGAL' '-hoa' '/tmp/aut969804103083023453.hoa' '-atoms' '/tmp/LTL3176150984973985088.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...315
Loading property file /tmp/LTL3176150984973985088.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut969804103083023453.hoa
Detected timeout of ITS tools.
[2024-05-25 17:00:35] [INFO ] Flatten gal took : 37 ms
[2024-05-25 17:00:35] [INFO ] Flatten gal took : 37 ms
[2024-05-25 17:00:35] [INFO ] Time to serialize gal into /tmp/LTL12855409588917823620.gal : 8 ms
[2024-05-25 17:00:35] [INFO ] Time to serialize properties into /tmp/LTL3277394012362296687.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/LTL12855409588917823620.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3277394012362296687.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_0+n3_1)+(n3_2+n3_3))+((n3_4+n3_5)+(n3_6+n3_7)))+(((n3_8+n3_9)+(n3_10+n3_11))+((n3_12+n3_13)+(n3_14+n3_15))))+((n3_16...711
Formula 0 simplified : G(!"(((((((n1_0+n1_1)+(n1_2+n1_3))+((n1_4+n1_5)+(n1_6+n1_7)))+(((n1_8+n1_9)+(n1_10+n1_11))+((n1_12+n1_13)+(n1_14+n1_15))))+((n1_16+n...705
Detected timeout of ITS tools.
[2024-05-25 17:00:50] [INFO ] Flatten gal took : 34 ms
[2024-05-25 17:00:50] [INFO ] Applying decomposition
[2024-05-25 17:00:50] [INFO ] Flatten gal took : 34 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/graph7433940659467118227.txt' '-o' '/tmp/graph7433940659467118227.bin' '-w' '/tmp/graph7433940659467118227.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7433940659467118227.bin' '-l' '-1' '-v' '-w' '/tmp/graph7433940659467118227.weights' '-q' '0' '-e' '0.001'
[2024-05-25 17:00:50] [INFO ] Decomposing Gal with order
[2024-05-25 17:00:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 17:00:50] [INFO ] Removed a total of 210 redundant transitions.
[2024-05-25 17:00:50] [INFO ] Flatten gal took : 191 ms
[2024-05-25 17:00:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 322 labels/synchronizations in 114 ms.
[2024-05-25 17:00:51] [INFO ] Time to serialize gal into /tmp/LTL6745978770250092322.gal : 15 ms
[2024-05-25 17:00:51] [INFO ] Time to serialize properties into /tmp/LTL5008406852717293241.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/LTL6745978770250092322.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5008406852717293241.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("((((((gu12.n3_0+gu12.n3_1)+(gu12.n3_2+gu12.n3_3))+((gu12.n3_4+gu12.n3_5)+(gu12.n3_6+gu12.n3_7)))+(((gu12.n3_8+gu12.n3_9)+(gu1...1091
Formula 0 simplified : G(!"(((((((gu25.n1_0+gu25.n1_1)+(gu25.n1_2+gu25.n1_3))+((gu25.n1_4+gu25.n1_5)+(gu25.n1_6+gu25.n1_7)))+(((gu25.n1_8+gu25.n1_9)+(gu25....1085
Detected timeout of ITS tools.
Treatment of property QuasiCertifProtocol-COL-18-LTLCardinality-02 finished in 321473 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 1378 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1378/1378 places, 296/296 transitions.
Graph (complete) has 9223 edges and 1378 vertex of which 1317 are kept as prefixes of interest. Removing 61 places using SCC suffix rule.10 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 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 1315 transition count 292
Applied a total of 3 rules in 106 ms. Remains 1315 /1378 variables (removed 63) and now considering 292/296 (removed 4) transitions.
// Phase 1: matrix 292 rows 1315 cols
[2024-05-25 17:01:06] [INFO ] Computed 1026 invariants in 71 ms
[2024-05-25 17:01:07] [INFO ] Implicit Places using invariants in 1270 ms returned []
[2024-05-25 17:01:07] [INFO ] Invariant cache hit.
[2024-05-25 17:01:14] [INFO ] Implicit Places using invariants and state equation in 6949 ms returned [1160, 1161, 1162, 1163, 1164, 1165, 1166, 1167, 1168, 1169, 1170, 1171, 1172, 1173, 1174, 1175, 1176, 1177, 1178]
Discarding 19 places :
Implicit Place search using SMT with State Equation took 8225 ms to find 19 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1296/1378 places, 292/296 transitions.
Applied a total of 0 rules in 39 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 8370 ms. Remains : 1296/1378 places, 292/296 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-18-LTLCardinality-03
Stuttering criterion allowed to conclude after 22 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-COL-18-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-18-LTLCardinality-03 finished in 8426 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 1378 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1378/1378 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 1357 transition count 296
Applied a total of 21 rules in 35 ms. Remains 1357 /1378 variables (removed 21) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 1357 cols
[2024-05-25 17:01:14] [INFO ] Computed 1062 invariants in 29 ms
[2024-05-25 17:01:15] [INFO ] Implicit Places using invariants in 1261 ms returned []
[2024-05-25 17:01:15] [INFO ] Invariant cache hit.
[2024-05-25 17:01:18] [INFO ] Implicit Places using invariants and state equation in 2995 ms returned []
Implicit Place search using SMT with State Equation took 4261 ms to find 0 implicit places.
Running 276 sub problems to find dead transitions.
[2024-05-25 17:01:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1336 variables, 720/720 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1336 variables, 0/720 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 19/1355 variables, 342/1062 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1355 variables, 0/1062 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 296/1651 variables, 1355/2417 constraints. Problems are: Problem set: 0 solved, 276 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1651/1653 variables, and 2417 constraints, problems are : Problem set: 0 solved, 276 unsolved in 30014 ms.
Refiners :[Generalized P Invariants (flows): 1062/1062 constraints, State Equation: 1355/1357 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 276 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1336 variables, 720/720 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1336 variables, 0/720 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 19/1355 variables, 342/1062 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1355 variables, 0/1062 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 296/1651 variables, 1355/2417 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1651 variables, 274/2691 constraints. Problems are: Problem set: 0 solved, 276 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1651/1653 variables, and 2691 constraints, problems are : Problem set: 0 solved, 276 unsolved in 30014 ms.
Refiners :[Generalized P Invariants (flows): 1062/1062 constraints, State Equation: 1355/1357 constraints, PredecessorRefiner: 274/276 constraints, Known Traps: 0/0 constraints]
After SMT, in 60283ms problems are : Problem set: 0 solved, 276 unsolved
Search for dead transitions found 0 dead transitions in 60290ms
Starting structural reductions in LTL mode, iteration 1 : 1357/1378 places, 296/296 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64590 ms. Remains : 1357/1378 places, 296/296 transitions.
Stuttering acceptance computed with spot in 463 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-COL-18-LTLCardinality-04
Product exploration explored 100000 steps with 4422 reset in 290 ms.
Product exploration explored 100000 steps with 4422 reset in 285 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 199 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 75 ms :[(NOT p2), (NOT p2)]
RANDOM walk for 40000 steps (1766 resets) in 110 ms. (360 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (172 resets) in 73 ms. (540 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 674 steps, run visited all 1 properties in 4 ms. (steps per millisecond=168 )
Probabilistic random walk after 674 steps, saw 654 distinct states, run finished after 7 ms. (steps per millisecond=96 ) properties seen :1
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 250 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)]
Stuttering acceptance computed with spot in 74 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.
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 4 place count 1355 transition count 294
Applied a total of 4 rules in 74 ms. Remains 1355 /1357 variables (removed 2) and now considering 294/296 (removed 2) transitions.
// Phase 1: matrix 294 rows 1355 cols
[2024-05-25 17:02:21] [INFO ] Computed 1062 invariants in 30 ms
[2024-05-25 17:02:22] [INFO ] Implicit Places using invariants in 1275 ms returned []
[2024-05-25 17:02:22] [INFO ] Invariant cache hit.
[2024-05-25 17:02:28] [INFO ] Implicit Places using invariants and state equation in 6133 ms returned []
Implicit Place search using SMT with State Equation took 7410 ms to find 0 implicit places.
[2024-05-25 17:02:28] [INFO ] Redundant transitions in 18 ms returned []
Running 274 sub problems to find dead transitions.
[2024-05-25 17:02:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1334 variables, 720/720 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1334 variables, 0/720 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 2 (OVERLAPS) 19/1353 variables, 342/1062 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1353 variables, 0/1062 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 4 (OVERLAPS) 294/1647 variables, 1353/2415 constraints. Problems are: Problem set: 0 solved, 274 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 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.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 0.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 0.0)
(s97 0.0)
(s98 0.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 0.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 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 0.0)
(s535 0.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 0.0)
(s547 0.0)
(s548 0.0)
(s549 0.0)
(s550 0.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 0.0)
(s558 0.0)
(s559 0.0)
(s560 0.0)
(s561 0.0)
(s562 0.0)
(s563 0.0)
(s564 0.0)
(s565 0.0)
(s566 0.0)
(s567 0.0)
(s568 0.0)
(s569 0.0)
(s570 0.0)
(s571 0.0)
(s572 0.0)
(s573 0.0)
(s574 0.0)
(s575 0.0)
(s576 0.0)
(s577 0.0)
(s578 0.0)
(s579 0.0)
(s580 0.0)
(s581 0.0)
(s582 0.0)
(s583 0.0)
(s584 0.0)
(s585 0.0)
(s586 0.0)
(s587 0.0)
(s588 0.0)
(s589 0.0)
(s590 0.0)
(s591 0.0)
(s592 0.0)
(s593 0.0)
(s594 0.0)
(s595 0.0)
(s596 0.0)
(s597 0.0)
(s598 0.0)
(s599 0.0)
(s600 0.0)
(s601 0.0)
(s602 0.0)
(s603 0.0)
(s604 0.0)
(s605 0.0)
(s606 0.0)
(s607 0.0)
(s608 0.0)
(s609 0.0)
(s610 0.0)
(s611 0.0)
(s612 0.0)
(s613 0.0)
(s614 0.0)
(s615 0.0)
(s616 0.0)
(s617 0.0)
(s618 0.0)
(s619 0.0)
(s620 0.0)
(s621 0.0)
(s622 0.0)
(s623 0.0)
(s624 0.0)
(s625 0.0)
(s626 0.0)
(s627 0.0)
(s628 0.0)
(s629 0.0)
(s630 0.0)
(s631 0.0)
(s632 0.0)
(s633 0.0)
(s634 0.0)
(s635 0.0)
(s636 0.0)
(s637 0.0)
(s638 0.0)
(s639 0.0)
(s640 0.0)
(s641 0.0)
(s642 0.0)
(s643 0.0)
(s644 0.0)
(s645 0.0)
(s646 0.0)
(s647 0.0)
(s648 0.0)
(s649 0.0)
(s650 0.0)
(s651 0.0)
(s652 0.0)
(s653 0.0)
(s654 0.0)
(s655 0.0)
(s656 0.0)
(s657 0.0)
(s658 0.0)
(s659 0.0)
(s660 0.0)
(s661 0.0)
(s662 0.0)
(s663 0.0)
(s664 0.0)
(s665 0.0)
(s666 0.0)
(s667 0.0)
(s668 0.0)
(s669 0.0)
(s670 0.0)
(s671 0.0)
(s672 0.0)
(s673 0.0)
(s674 0.0)
(s675 0.0)
(s676 0.0)
(s677 0.0)
(s678 0.0)
(s679 0.0)
(s680 0.0)
(s681 0.0)
(s682 0.0)
(s683 0.0)
(s684 0.0)
(s685 0.0)
(s686 0.0)
(s687 0.0)
(s688 0.0)
(s689 0.0)
(s690 0.0)
(s691 0.0)
(s692 0.0)
(s693 0.0)
(s694 0.0)
(s695 0.0)
(s696 0.0)
(s697 0.0)
(s698 0.0)
(s699 0.0)
(s700 0.0)
(s701 0.0)
(s702 0.0)
(s703 0.0)
(s704 0.0)
(s705 0.0)
(s706 0.0)
(s707 0.0)
(s708 0.0)
(s709 0.0)
(s710 0.0)
(s711 0.0)
(s712 0.0)
(s713 0.0)
(s714 0.0)
(s715 0.0)
(s716 0.0)
(s717 0.0)
(s718 0.0)
(s719 0.0)
(s720 0.0)
(s721 0.0)
(s722 0.0)
(s723 0.0)
(s724 0.0)
(s725 0.0)
(s726 0.0)
(s727 0.0)
(s728 0.0)
(s729 0.0)
(s730 0.0)
(s731 0.0)
(s732 0.0)
(s733 0.0)
(s734 0.0)
(s735 0.0)
(s736 0.0)
(s737 0.0)
(s738 0.0)
(s739 0.0)
(s740 0.0)
(s741 0.0)
(s742 0.0)
(s743 0.0)
(s744 0.0)
(s745 0.0)
(s746 0.0)
(s747 0.0)
(s748 0.0)
(s749 0.0)
(s750 0.0)
(s751 0.0)
(s752 0.0)
(s753 0.0)
(s754 0.0)
(s755 0.0)
(s756 0.0)
(s757 0.0)
(s758 0.0)
(s759 0.0)
(s760 0.0)
(s761 0.0)
(s762 0.0)
(s763 0.0)
(s764 0.0)
(s765 0.0)
(s766 0.0)
(s767 0.0)
(s768 0.0)
(s769 0.0)
(s770 0.0)
(s771 0.0)
(s772 0.0)
(s773 0.0)
(s774 0.0)
(s775 0.0)
(s776 0.0)
(s777 0.0)
(s778 0.0)
(s779 0.0)
(s780 0.0)
(s781 0.0)
(s782 0.0)
(s783 0.0)
(s784 0.0)
(s785 0.0)
(s786 0.0)
(s787 0.0)
(s788 0.0)
(s789 0.0)
(s790 0.0)
(s791 0.0)
(s792 0.0)
(s793 0.0)
(s794 0.0)
(s795 0.0)
(s796 0.0)
(s797 0.0)
(s798 0.0)
(s799 0.0)
(s800 0.0)
(s801 0.0)
(s802 0.0)
(s803 0.0)
(s804 0.0)
(s805 0.0)
(s806 0.0)
(s807 0.0)
(s808 0.0)
(s809 0.0)
(s810 0.0)
(s811 0.0)
(s812 0.0)
(s813 0.0)
(s814 0.0)
(s815 0.0)
(s816 0.0)
(s817 0.0)
(s818 0.0)
(s819 0.0)
(s820 0.0)
(s821 0.0)
(s822 0.0)
(s823 0.0)
(s824 0.0)
(s825 0.0)
(s826 0.0)
(s827 0.0)
(s828 0.0)
(s829 0.0)
(s830 0.0)
(s831 0.0)
(s832 0.0)
(s833 0.0)
(s834 0.0)
(s835 0.0)
(s836 0.0)
(s837 0.0)
(s838 0.0)
(s839 0.0)
(s840 0.0)
(s841 0.0)
(s842 0.0)
(s843 0.0)
(s844 0.0)
(s845 0.0)
(s846 0.0)
(s847 0.0)
(s848 0.0)
(s849 0.0)
(s850 0.0)
(s851 0.0)
(s852 0.0)
(s853 0.0)
(s854 0.0)
(s855 0.0)
(s856 0.0)
(s857 0.0)
(s858 0.0)
(s859 0.0)
(s860 0.0)
(s861 0.0)
(s862 0.0)
(s863 0.0)
(s864 0.0)
(s865 0.0)
(s866 0.0)
(s867 0.0)
(s868 0.0)
(s869 0.0)
(s870 0.0)
(s871 0.0)
(s872 0.0)
(s873 0.0)
(s874 0.0)
(s875 0.0)
(s876 0.0)
(s877 0.0)
(s878 0.0)
(s879 0.0)
(s880 0.0)
(s881 0.0)
(s882 0.0)
(s883 0.0)
(s884 0.0)
(s885 0.0)
(s886 0.0)
(s887 0.0)
(s888 0.0)
(s889 0.0)
(s890 0.0)
(s891 0.0)
(s892 0.0)
(s893 0.0)
(s894 0.0)
(s895 0.0)
(s896 0.0)
(s897 0.0)
(s898 0.0)
(s899 0.0)
(s900 0.0)
(s901 0.0)
(s902 0.0)
(s903 0.0)
(s904 0.0)
(s905 0.0)
(s906 0.0)
(s907 0.0)
(s908 0.0)
(s909 0.0)
(s910 0.0)
(s911 0.0)
(s912 0.0)
(s913 0.0)
(s914 0.0)
(s915 0.0)
(s916 0.0)
(s917 0.0)
(s918 0.0)
(s919 0.0)
(s920 0.0)
(s921 0.0)
(s922 0.0)
(s923 0.0)
(s924 0.0)
(s925 0.0)
(s926 0.0)
(s927 0.0)
(s928 0.0)
(s929 0.0)
(s930 0.0)
(s931 0.0)
(s932 0.0)
(s933 0.0)
(s934 0.0)
(s935 0.0)
(s936 0.0)
(s937 0.0)
(s938 0.0)
(s939 0.0)
(s940 0.0)
(s941 0.0)
(s942 0.0)
(s943 0.0)
(s944 0.0)
(s945 0.0)
(s946 0.0)
(s947 0.0)
(s948 0.0)
(s949 0.0)
(s950 0.0)
(s951 0.0)
(s952 0.0)
(s953 0.0)
(s954 0.0)
(s955 0.0)
(s956 0.0)
(s957 0.0)
(s958 0.0)
(s959 0.0)
(s960 0.0)
(s961 0.0)
(s962 0.0)
(s963 0.0)
(s964 0.0)
(s965 0.0)
(s966 0.0)
(s967 0.0)
(s968 0.0)
(s969 0.0)
(s970 0.0)
(s971 0.0)
(s972 0.0)
(s973 0.0)
(s974 0.0)
(s975 0.0)
(s976 0.0)
(s977 0.0)
(s978 0.0)
(s979 0.0)
(s980 0.0)
(s981 0.0)
(s982 0.0)
(s983 0.0)
(s984 0.0)
(s985 0.0)
(s986 0.0)
(s987 0.0)
(s988 0.0)
(s989 0.0)
(s990 0.0)
(s991 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1647/1649 variables, and 2415 constraints, problems are : Problem set: 0 solved, 274 unsolved in 30023 ms.
Refiners :[Generalized P Invariants (flows): 1062/1062 constraints, State Equation: 1353/1355 constraints, PredecessorRefiner: 274/274 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 274 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1334 variables, 720/720 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1334 variables, 0/720 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 2 (OVERLAPS) 19/1353 variables, 342/1062 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1353 variables, 0/1062 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 4 (OVERLAPS) 294/1647 variables, 1353/2415 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1647 variables, 272/2687 constraints. Problems are: Problem set: 0 solved, 274 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1647/1649 variables, and 2687 constraints, problems are : Problem set: 0 solved, 274 unsolved in 30020 ms.
Refiners :[Generalized P Invariants (flows): 1062/1062 constraints, State Equation: 1353/1355 constraints, PredecessorRefiner: 272/274 constraints, Known Traps: 0/0 constraints]
After SMT, in 60289ms problems are : Problem set: 0 solved, 274 unsolved
Search for dead transitions found 0 dead transitions in 60294ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1355/1357 places, 294/296 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 67801 ms. Remains : 1355/1357 places, 294/296 transitions.
Computed a total of 1355 stabilizing places and 294 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1355 transition count 294
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 63 ms :[(NOT p2), (NOT p2)]
RANDOM walk for 40000 steps (1765 resets) in 110 ms. (360 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (172 resets) in 36 ms. (1081 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 653 steps, run visited all 1 properties in 4 ms. (steps per millisecond=163 )
Probabilistic random walk after 653 steps, saw 634 distinct states, run finished after 5 ms. (steps per millisecond=130 ) properties seen :1
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 126 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 67 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 4419 reset in 218 ms.
Product exploration explored 100000 steps with 4421 reset in 238 ms.
Built C files in :
/tmp/ltsmin9992455408864329080
[2024-05-25 17:03:30] [INFO ] Computing symmetric may disable matrix : 294 transitions.
[2024-05-25 17:03:30] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 17:03:30] [INFO ] Computing symmetric may enable matrix : 294 transitions.
[2024-05-25 17:03:30] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 17:03:30] [INFO ] Computing Do-Not-Accords matrix : 294 transitions.
[2024-05-25 17:03:30] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 17:03:30] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9992455408864329080
Running compilation step : cd /tmp/ltsmin9992455408864329080;'/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 1445 ms.
Running link step : cd /tmp/ltsmin9992455408864329080;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin9992455408864329080;'/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/stateBased10590963900314516596.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 20 out of 1355 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1355/1355 places, 294/294 transitions.
Graph (complete) has 9428 edges and 1355 vertex of which 1315 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.5 ms
Discarding 40 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Applied a total of 1 rules in 58 ms. Remains 1315 /1355 variables (removed 40) and now considering 292/294 (removed 2) transitions.
// Phase 1: matrix 292 rows 1315 cols
[2024-05-25 17:03:45] [INFO ] Computed 1026 invariants in 68 ms
[2024-05-25 17:03:46] [INFO ] Implicit Places using invariants in 1217 ms returned []
[2024-05-25 17:03:46] [INFO ] Invariant cache hit.
[2024-05-25 17:03:51] [INFO ] Implicit Places using invariants and state equation in 4819 ms returned []
Implicit Place search using SMT with State Equation took 6042 ms to find 0 implicit places.
[2024-05-25 17:03:51] [INFO ] Redundant transitions in 19 ms returned []
Running 272 sub problems to find dead transitions.
[2024-05-25 17:03:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1314 variables, 1026/1026 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1314 variables, 0/1026 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 2 (OVERLAPS) 292/1606 variables, 1314/2340 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1606 variables, 0/2340 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 4 (OVERLAPS) 1/1607 variables, 1/2341 constraints. Problems are: Problem set: 0 solved, 272 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1607/1607 variables, and 2341 constraints, problems are : Problem set: 0 solved, 272 unsolved in 30013 ms.
Refiners :[Generalized P Invariants (flows): 1026/1026 constraints, State Equation: 1315/1315 constraints, PredecessorRefiner: 272/272 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 272 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1314 variables, 1026/1026 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1314 variables, 0/1026 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 2 (OVERLAPS) 292/1606 variables, 1314/2340 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1606 variables, 272/2612 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1606 variables, 0/2612 constraints. Problems are: Problem set: 0 solved, 272 unsolved
SMT process timed out in 60279ms, After SMT, problems are : Problem set: 0 solved, 272 unsolved
Search for dead transitions found 0 dead transitions in 60282ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1315/1355 places, 292/294 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 66417 ms. Remains : 1315/1355 places, 292/294 transitions.
Built C files in :
/tmp/ltsmin7391097813366050547
[2024-05-25 17:04:51] [INFO ] Computing symmetric may disable matrix : 292 transitions.
[2024-05-25 17:04:51] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 17:04:51] [INFO ] Computing symmetric may enable matrix : 292 transitions.
[2024-05-25 17:04:51] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 17:04:51] [INFO ] Computing Do-Not-Accords matrix : 292 transitions.
[2024-05-25 17:04:51] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 17:04:51] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7391097813366050547
Running compilation step : cd /tmp/ltsmin7391097813366050547;'/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 1260 ms.
Running link step : cd /tmp/ltsmin7391097813366050547;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin7391097813366050547;'/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/stateBased12725939078532952487.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-25 17:05:06] [INFO ] Flatten gal took : 40 ms
[2024-05-25 17:05:06] [INFO ] Flatten gal took : 36 ms
[2024-05-25 17:05:06] [INFO ] Time to serialize gal into /tmp/LTL5816989268656688779.gal : 4 ms
[2024-05-25 17:05:06] [INFO ] Time to serialize properties into /tmp/LTL15764487411140320721.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/LTL5816989268656688779.gal' '-t' 'CGAL' '-hoa' '/tmp/aut790425521502106494.hoa' '-atoms' '/tmp/LTL15764487411140320721.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/LTL15764487411140320721.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut790425521502106494.hoa
Detected timeout of ITS tools.
[2024-05-25 17:05:22] [INFO ] Flatten gal took : 28 ms
[2024-05-25 17:05:22] [INFO ] Flatten gal took : 28 ms
[2024-05-25 17:05:22] [INFO ] Time to serialize gal into /tmp/LTL12048107898851014516.gal : 5 ms
[2024-05-25 17:05:22] [INFO ] Time to serialize properties into /tmp/LTL11376246778586609420.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/LTL12048107898851014516.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11376246778586609420.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((("(AstopOK>=1)")U(X(X(G(("(AstopOK>=1)")||(X(G((F(G("((((((s6_0+s6_1)+(s6_2+s6_3))+((s6_4+s6_5)+(s6_6+s6_7)))+(((s6_8+s6_9)+(s6_10+...617
Formula 0 simplified : !"(AstopOK>=1)" R XXF(!"(AstopOK>=1)" & XF(GF!"((((((s6_0+s6_1)+(s6_2+s6_3))+((s6_4+s6_5)+(s6_6+s6_7)))+(((s6_8+s6_9)+(s6_10+s6_11))...601
Detected timeout of ITS tools.
[2024-05-25 17:05:37] [INFO ] Flatten gal took : 27 ms
[2024-05-25 17:05:37] [INFO ] Applying decomposition
[2024-05-25 17:05:37] [INFO ] Flatten gal took : 27 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/graph6391107218201776634.txt' '-o' '/tmp/graph6391107218201776634.bin' '-w' '/tmp/graph6391107218201776634.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6391107218201776634.bin' '-l' '-1' '-v' '-w' '/tmp/graph6391107218201776634.weights' '-q' '0' '-e' '0.001'
[2024-05-25 17:05:37] [INFO ] Decomposing Gal with order
[2024-05-25 17:05:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 17:05:37] [INFO ] Removed a total of 237 redundant transitions.
[2024-05-25 17:05:37] [INFO ] Flatten gal took : 60 ms
[2024-05-25 17:05:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 160 labels/synchronizations in 28 ms.
[2024-05-25 17:05:37] [INFO ] Time to serialize gal into /tmp/LTL13475861228984590667.gal : 11 ms
[2024-05-25 17:05:37] [INFO ] Time to serialize properties into /tmp/LTL16330744064423718520.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/LTL13475861228984590667.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16330744064423718520.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((("(gi2.gi4.gi0.gu98.AstopOK>=1)")U(X(X(G(("(gi2.gi4.gi0.gu98.AstopOK>=1)")||(X(G((F(G("((((((gu97.s6_0+gu97.s6_1)+(gu97.s6_2+gu97.s...941
Formula 0 simplified : !"(gi2.gi4.gi0.gu98.AstopOK>=1)" R XXF(!"(gi2.gi4.gi0.gu98.AstopOK>=1)" & XF(GF!"((((((gu97.s6_0+gu97.s6_1)+(gu97.s6_2+gu97.s6_3))+(...925
Detected timeout of ITS tools.
Treatment of property QuasiCertifProtocol-COL-18-LTLCardinality-04 finished in 278160 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((G(F(p2))||(p3&&X(F(p2))))))))))'
Support contains 77 out of 1378 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1378/1378 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 1357 transition count 296
Applied a total of 21 rules in 29 ms. Remains 1357 /1378 variables (removed 21) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 1357 cols
[2024-05-25 17:05:52] [INFO ] Computed 1063 invariants in 15 ms
[2024-05-25 17:05:53] [INFO ] Implicit Places using invariants in 1245 ms returned []
[2024-05-25 17:05:53] [INFO ] Invariant cache hit.
[2024-05-25 17:06:01] [INFO ] Implicit Places using invariants and state equation in 7091 ms returned []
Implicit Place search using SMT with State Equation took 8337 ms to find 0 implicit places.
Running 276 sub problems to find dead transitions.
[2024-05-25 17:06:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1336 variables, 720/720 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1336 variables, 0/720 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 20/1356 variables, 343/1063 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1356 variables, 0/1063 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 296/1652 variables, 1356/2419 constraints. Problems are: Problem set: 0 solved, 276 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1652/1653 variables, and 2419 constraints, problems are : Problem set: 0 solved, 276 unsolved in 30015 ms.
Refiners :[Generalized P Invariants (flows): 1063/1063 constraints, State Equation: 1356/1357 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 276 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1336 variables, 720/720 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1336 variables, 0/720 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 20/1356 variables, 343/1063 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1356 variables, 0/1063 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 296/1652 variables, 1356/2419 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1652 variables, 276/2695 constraints. Problems are: Problem set: 0 solved, 276 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1652/1653 variables, and 2695 constraints, problems are : Problem set: 0 solved, 276 unsolved in 30015 ms.
Refiners :[Generalized P Invariants (flows): 1063/1063 constraints, State Equation: 1356/1357 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints]
After SMT, in 60282ms problems are : Problem set: 0 solved, 276 unsolved
Search for dead transitions found 0 dead transitions in 60286ms
Starting structural reductions in LTL mode, iteration 1 : 1357/1378 places, 296/296 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 68654 ms. Remains : 1357/1378 places, 296/296 transitions.
Stuttering acceptance computed with spot in 226 ms :[p0, (AND p0 (NOT p2)), (AND p0 (NOT p2)), p0, (AND p0 (NOT p2)), (AND p0 (NOT p2))]
Running random walk in product with property : QuasiCertifProtocol-COL-18-LTLCardinality-05
Stuttering criterion allowed to conclude after 22 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-COL-18-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-18-LTLCardinality-05 finished in 68921 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((F(p0)&&X(p1)))||(F(p1)&&F(p2))))'
Support contains 420 out of 1378 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1378/1378 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 1337 transition count 296
Applied a total of 41 rules in 16 ms. Remains 1337 /1378 variables (removed 41) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 1337 cols
[2024-05-25 17:07:01] [INFO ] Computed 1044 invariants in 65 ms
[2024-05-25 17:07:02] [INFO ] Implicit Places using invariants in 881 ms returned []
[2024-05-25 17:07:02] [INFO ] Invariant cache hit.
[2024-05-25 17:07:03] [INFO ] Implicit Places using invariants and state equation in 1275 ms returned []
Implicit Place search using SMT with State Equation took 2160 ms to find 0 implicit places.
Running 276 sub problems to find dead transitions.
[2024-05-25 17:07:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1336 variables, 1044/1044 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1336 variables, 0/1044 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 296/1632 variables, 1336/2380 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1632 variables, 0/2380 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 1/1633 variables, 1/2381 constraints. Problems are: Problem set: 0 solved, 276 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 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.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 0.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 0.0)
(s97 0.0)
(s98 0.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 0.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 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1633/1633 variables, and 2381 constraints, problems are : Problem set: 0 solved, 276 unsolved in 30019 ms.
Refiners :[Generalized P Invariants (flows): 1044/1044 constraints, State Equation: 1337/1337 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 276 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1336 variables, 1044/1044 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1336 variables, 0/1044 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 296/1632 variables, 1336/2380 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1632 variables, 276/2656 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1632 variables, 0/2656 constraints. Problems are: Problem set: 0 solved, 276 unsolved
SMT process timed out in 60293ms, After SMT, problems are : Problem set: 0 solved, 276 unsolved
Search for dead transitions found 0 dead transitions in 60297ms
Starting structural reductions in LTL mode, iteration 1 : 1337/1378 places, 296/296 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62474 ms. Remains : 1337/1378 places, 296/296 transitions.
Stuttering acceptance computed with spot in 247 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2))), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : QuasiCertifProtocol-COL-18-LTLCardinality-08
Product exploration explored 100000 steps with 7264 reset in 287 ms.
Product exploration explored 100000 steps with 7229 reset in 299 ms.
Computed a total of 1337 stabilizing places and 296 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1337 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 p1) p2 p0), (X p2), (X (NOT p1)), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p0)), (F (OR (G p1) (G (NOT p1)))), (F (G p2)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 13 factoid took 468 ms. Reduced automaton from 6 states, 8 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 50 steps (0 resets) in 4 ms. (10 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) p2 p0), (X p2), (X (NOT p1)), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p0)), (F (OR (G p1) (G (NOT p1)))), (F (G p2)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 13 factoid took 586 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 p1), (NOT p1)]
Stuttering acceptance computed with spot in 72 ms :[(NOT p1), (NOT p1)]
[2024-05-25 17:08:06] [INFO ] Invariant cache hit.
[2024-05-25 17:08:08] [INFO ] [Real]Absence check using 0 positive and 1044 generalized place invariants in 1351 ms returned sat
[2024-05-25 17:08:12] [INFO ] [Real]Absence check using state equation in 4607 ms returned sat
[2024-05-25 17:08:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 17:08:14] [INFO ] [Nat]Absence check using 0 positive and 1044 generalized place invariants in 1411 ms returned sat
[2024-05-25 17:08:22] [INFO ] [Nat]Absence check using state equation in 8261 ms returned sat
[2024-05-25 17:08:22] [INFO ] Computed and/alt/rep : 216/254/216 causal constraints (skipped 60 transitions) in 22 ms.
[2024-05-25 17:08:24] [INFO ] Added : 124 causal constraints over 25 iterations in 1341 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 20 out of 1337 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 : 1337/1337 places, 296/296 transitions.
Graph (complete) has 8669 edges and 1337 vertex of which 1317 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.4 ms
Discarding 20 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 1317 transition count 294
Applied a total of 3 rules in 50 ms. Remains 1317 /1337 variables (removed 20) and now considering 294/296 (removed 2) transitions.
// Phase 1: matrix 294 rows 1317 cols
[2024-05-25 17:08:24] [INFO ] Computed 1026 invariants in 66 ms
[2024-05-25 17:08:25] [INFO ] Implicit Places using invariants in 884 ms returned []
[2024-05-25 17:08:25] [INFO ] Invariant cache hit.
[2024-05-25 17:08:26] [INFO ] Implicit Places using invariants and state equation in 1260 ms returned []
Implicit Place search using SMT with State Equation took 2148 ms to find 0 implicit places.
[2024-05-25 17:08:26] [INFO ] Redundant transitions in 19 ms returned []
Running 274 sub problems to find dead transitions.
[2024-05-25 17:08:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1316 variables, 1026/1026 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1316 variables, 0/1026 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 2 (OVERLAPS) 294/1610 variables, 1316/2342 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1610 variables, 0/2342 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 4 (OVERLAPS) 1/1611 variables, 1/2343 constraints. Problems are: Problem set: 0 solved, 274 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1611/1611 variables, and 2343 constraints, problems are : Problem set: 0 solved, 274 unsolved in 30011 ms.
Refiners :[Generalized P Invariants (flows): 1026/1026 constraints, State Equation: 1317/1317 constraints, PredecessorRefiner: 274/274 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 274 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1316 variables, 1026/1026 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1316 variables, 0/1026 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 2 (OVERLAPS) 294/1610 variables, 1316/2342 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1610 variables, 274/2616 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1610 variables, 0/2616 constraints. Problems are: Problem set: 0 solved, 274 unsolved
SMT process timed out in 60287ms, After SMT, problems are : Problem set: 0 solved, 274 unsolved
Search for dead transitions found 0 dead transitions in 60292ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1317/1337 places, 294/296 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 62518 ms. Remains : 1317/1337 places, 294/296 transitions.
Computed a total of 1317 stabilizing places and 294 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1317 transition count 294
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 86 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 67 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 46 steps (0 resets) in 4 ms. (9 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 4 factoid took 125 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 67 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p1), (NOT p1)]
[2024-05-25 17:09:27] [INFO ] Invariant cache hit.
[2024-05-25 17:09:29] [INFO ] [Real]Absence check using 0 positive and 1026 generalized place invariants in 1261 ms returned sat
[2024-05-25 17:09:33] [INFO ] [Real]Absence check using state equation in 4570 ms returned sat
[2024-05-25 17:09:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 17:09:35] [INFO ] [Nat]Absence check using 0 positive and 1026 generalized place invariants in 1298 ms returned sat
[2024-05-25 17:09:40] [INFO ] [Nat]Absence check using state equation in 5457 ms returned sat
[2024-05-25 17:09:40] [INFO ] Computed and/alt/rep : 213/251/213 causal constraints (skipped 61 transitions) in 22 ms.
[2024-05-25 17:09:41] [INFO ] Added : 74 causal constraints over 15 iterations in 909 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 66 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 7234 reset in 264 ms.
Product exploration explored 100000 steps with 7246 reset in 277 ms.
Built C files in :
/tmp/ltsmin15359450323482156751
[2024-05-25 17:09:42] [INFO ] Computing symmetric may disable matrix : 294 transitions.
[2024-05-25 17:09:42] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 17:09:42] [INFO ] Computing symmetric may enable matrix : 294 transitions.
[2024-05-25 17:09:42] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 17:09:42] [INFO ] Computing Do-Not-Accords matrix : 294 transitions.
[2024-05-25 17:09:42] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 17:09:42] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15359450323482156751
Running compilation step : cd /tmp/ltsmin15359450323482156751;'/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 1245 ms.
Running link step : cd /tmp/ltsmin15359450323482156751;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin15359450323482156751;'/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/stateBased4813358293540802687.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 20 out of 1317 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1317/1317 places, 294/294 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1316 transition count 292
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1315 transition count 292
Applied a total of 2 rules in 59 ms. Remains 1315 /1317 variables (removed 2) and now considering 292/294 (removed 2) transitions.
// Phase 1: matrix 292 rows 1315 cols
[2024-05-25 17:09:57] [INFO ] Computed 1026 invariants in 65 ms
[2024-05-25 17:09:58] [INFO ] Implicit Places using invariants in 1288 ms returned []
[2024-05-25 17:09:58] [INFO ] Invariant cache hit.
[2024-05-25 17:10:00] [INFO ] Implicit Places using invariants and state equation in 1983 ms returned [1160, 1161, 1162, 1163, 1164, 1165, 1166, 1167, 1168, 1169, 1170, 1171, 1172, 1173, 1174, 1175, 1176, 1177, 1178]
Discarding 19 places :
Implicit Place search using SMT with State Equation took 3274 ms to find 19 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1296/1317 places, 292/294 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 3371 ms. Remains : 1296/1317 places, 292/294 transitions.
Built C files in :
/tmp/ltsmin1703252271874668780
[2024-05-25 17:10:00] [INFO ] Computing symmetric may disable matrix : 292 transitions.
[2024-05-25 17:10:00] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 17:10:00] [INFO ] Computing symmetric may enable matrix : 292 transitions.
[2024-05-25 17:10:00] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 17:10:00] [INFO ] Computing Do-Not-Accords matrix : 292 transitions.
[2024-05-25 17:10:00] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 17:10:00] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1703252271874668780
Running compilation step : cd /tmp/ltsmin1703252271874668780;'/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 1203 ms.
Running link step : cd /tmp/ltsmin1703252271874668780;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin1703252271874668780;'/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/stateBased4178158435686323688.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-25 17:10:15] [INFO ] Flatten gal took : 27 ms
[2024-05-25 17:10:15] [INFO ] Flatten gal took : 26 ms
[2024-05-25 17:10:16] [INFO ] Time to serialize gal into /tmp/LTL16711925128377376366.gal : 4 ms
[2024-05-25 17:10:16] [INFO ] Time to serialize properties into /tmp/LTL631212496952847058.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/LTL16711925128377376366.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16445424169881332064.hoa' '-atoms' '/tmp/LTL631212496952847058.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/LTL631212496952847058.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16445424169881332064.hoa
Detected timeout of ITS tools.
[2024-05-25 17:10:31] [INFO ] Flatten gal took : 27 ms
[2024-05-25 17:10:31] [INFO ] Flatten gal took : 25 ms
[2024-05-25 17:10:31] [INFO ] Time to serialize gal into /tmp/LTL8439953132155076699.gal : 6 ms
[2024-05-25 17:10:31] [INFO ] Time to serialize properties into /tmp/LTL13866842736927964697.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/LTL8439953132155076699.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13866842736927964697.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((X((F("((((((c1_0+c1_1)+(c1_2+c1_3))+((c1_4+c1_5)+(c1_6+c1_7)))+(((c1_8+c1_9)+(c1_10+c1_11))+((c1_12+c1_13)+(c1_14+c1_15))))+((c1_1...3815
Formula 0 simplified : X(G!"((((((c1_0+c1_1)+(c1_2+c1_3))+((c1_4+c1_5)+(c1_6+c1_7)))+(((c1_8+c1_9)+(c1_10+c1_11))+((c1_12+c1_13)+(c1_14+c1_15))))+((c1_16+c...3801
Detected timeout of ITS tools.
[2024-05-25 17:10:46] [INFO ] Flatten gal took : 34 ms
[2024-05-25 17:10:46] [INFO ] Applying decomposition
[2024-05-25 17:10:46] [INFO ] Flatten gal took : 25 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/graph5336681790538624413.txt' '-o' '/tmp/graph5336681790538624413.bin' '-w' '/tmp/graph5336681790538624413.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5336681790538624413.bin' '-l' '-1' '-v' '-w' '/tmp/graph5336681790538624413.weights' '-q' '0' '-e' '0.001'
[2024-05-25 17:10:46] [INFO ] Decomposing Gal with order
[2024-05-25 17:10:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 17:10:46] [INFO ] Removed a total of 209 redundant transitions.
[2024-05-25 17:10:46] [INFO ] Flatten gal took : 59 ms
[2024-05-25 17:10:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 150 labels/synchronizations in 28 ms.
[2024-05-25 17:10:46] [INFO ] Time to serialize gal into /tmp/LTL14927443873624530995.gal : 15 ms
[2024-05-25 17:10:46] [INFO ] Time to serialize properties into /tmp/LTL11253234401036445019.ltl : 7 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14927443873624530995.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11253234401036445019.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !(((X((F("((((((gi1.gi3.gu31.c1_0+gi1.gi3.gu31.c1_1)+(gi1.gi3.gu31.c1_2+gi1.gi3.gu31.c1_3))+((gi1.gi3.gu31.c1_4+gi1.gi3.gu31.c1_5)+(gi...6599
Formula 0 simplified : X(G!"((((((gi1.gi3.gu31.c1_0+gi1.gi3.gu31.c1_1)+(gi1.gi3.gu31.c1_2+gi1.gi3.gu31.c1_3))+((gi1.gi3.gu31.c1_4+gi1.gi3.gu31.c1_5)+(gi1.g...6585
Detected timeout of ITS tools.
Treatment of property QuasiCertifProtocol-COL-18-LTLCardinality-08 finished in 240253 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 1378 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1378/1378 places, 296/296 transitions.
Graph (complete) has 9223 edges and 1378 vertex of which 119 are kept as prefixes of interest. Removing 1259 places using SCC suffix rule.5 ms
Discarding 1259 places :
Also discarding 118 output transitions
Drop transitions (Output transitions of discarded places.) removed 118 transitions
Ensure Unique test removed 94 transitions
Reduce isomorphic transitions removed 94 transitions.
Iterating post reduction 0 with 94 rules applied. Total rules applied 95 place count 119 transition count 84
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 1 with 2 rules applied. Total rules applied 97 place count 118 transition count 83
Applied a total of 97 rules in 17 ms. Remains 118 /1378 variables (removed 1260) and now considering 83/296 (removed 213) transitions.
// Phase 1: matrix 83 rows 118 cols
[2024-05-25 17:11:01] [INFO ] Computed 36 invariants in 1 ms
[2024-05-25 17:11:01] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-05-25 17:11:01] [INFO ] Invariant cache hit.
[2024-05-25 17:11:02] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 156 ms to find 0 implicit places.
[2024-05-25 17:11:02] [INFO ] Redundant transitions in 12 ms returned []
Running 62 sub problems to find dead transitions.
[2024-05-25 17:11:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/117 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 2 (OVERLAPS) 83/200 variables, 117/153 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/200 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 4 (OVERLAPS) 1/201 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/201 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 6 (OVERLAPS) 0/201 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 62 unsolved
No progress, stopping.
After SMT solving in domain Real declared 201/201 variables, and 154 constraints, problems are : Problem set: 0 solved, 62 unsolved in 1193 ms.
Refiners :[Generalized P Invariants (flows): 36/36 constraints, State Equation: 118/118 constraints, PredecessorRefiner: 62/62 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 62 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/117 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 2 (OVERLAPS) 83/200 variables, 117/153 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/200 variables, 62/215 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 5 (OVERLAPS) 1/201 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/201 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 7 (OVERLAPS) 0/201 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 62 unsolved
No progress, stopping.
After SMT solving in domain Int declared 201/201 variables, and 216 constraints, problems are : Problem set: 0 solved, 62 unsolved in 1616 ms.
Refiners :[Generalized P Invariants (flows): 36/36 constraints, State Equation: 118/118 constraints, PredecessorRefiner: 62/62 constraints, Known Traps: 0/0 constraints]
After SMT, in 2827ms problems are : Problem set: 0 solved, 62 unsolved
Search for dead transitions found 0 dead transitions in 2828ms
Starting structural reductions in SI_LTL mode, iteration 1 : 118/1378 places, 83/296 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3018 ms. Remains : 118/1378 places, 83/296 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-18-LTLCardinality-10
Product exploration explored 100000 steps with 4318 reset in 255 ms.
Product exploration explored 100000 steps with 4314 reset in 251 ms.
Computed a total of 118 stabilizing places and 83 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 118 transition count 83
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 69 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
RANDOM walk for 31321 steps (1231 resets) in 104 ms. (298 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 154 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Support contains 20 out of 118 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 118/118 places, 83/83 transitions.
Applied a total of 0 rules in 5 ms. Remains 118 /118 variables (removed 0) and now considering 83/83 (removed 0) transitions.
[2024-05-25 17:11:05] [INFO ] Invariant cache hit.
[2024-05-25 17:11:05] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-05-25 17:11:05] [INFO ] Invariant cache hit.
[2024-05-25 17:11:06] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 171 ms to find 0 implicit places.
[2024-05-25 17:11:06] [INFO ] Redundant transitions in 12 ms returned []
Running 62 sub problems to find dead transitions.
[2024-05-25 17:11:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/117 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 2 (OVERLAPS) 83/200 variables, 117/153 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/200 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 4 (OVERLAPS) 1/201 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/201 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 6 (OVERLAPS) 0/201 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 62 unsolved
No progress, stopping.
After SMT solving in domain Real declared 201/201 variables, and 154 constraints, problems are : Problem set: 0 solved, 62 unsolved in 1188 ms.
Refiners :[Generalized P Invariants (flows): 36/36 constraints, State Equation: 118/118 constraints, PredecessorRefiner: 62/62 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 62 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/117 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 2 (OVERLAPS) 83/200 variables, 117/153 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/200 variables, 62/215 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 5 (OVERLAPS) 1/201 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/201 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 7 (OVERLAPS) 0/201 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 62 unsolved
No progress, stopping.
After SMT solving in domain Int declared 201/201 variables, and 216 constraints, problems are : Problem set: 0 solved, 62 unsolved in 1591 ms.
Refiners :[Generalized P Invariants (flows): 36/36 constraints, State Equation: 118/118 constraints, PredecessorRefiner: 62/62 constraints, Known Traps: 0/0 constraints]
After SMT, in 2804ms problems are : Problem set: 0 solved, 62 unsolved
Search for dead transitions found 0 dead transitions in 2805ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2999 ms. Remains : 118/118 places, 83/83 transitions.
Computed a total of 118 stabilizing places and 83 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 118 transition count 83
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 91 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
RANDOM walk for 34464 steps (1354 resets) in 163 ms. (210 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 104 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Product exploration explored 100000 steps with 4313 reset in 239 ms.
Product exploration explored 100000 steps with 4314 reset in 251 ms.
Built C files in :
/tmp/ltsmin16762983244126189178
[2024-05-25 17:11:09] [INFO ] Computing symmetric may disable matrix : 83 transitions.
[2024-05-25 17:11:09] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 17:11:09] [INFO ] Computing symmetric may enable matrix : 83 transitions.
[2024-05-25 17:11:09] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 17:11:09] [INFO ] Computing Do-Not-Accords matrix : 83 transitions.
[2024-05-25 17:11:09] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 17:11:09] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16762983244126189178
Running compilation step : cd /tmp/ltsmin16762983244126189178;'/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 227 ms.
Running link step : cd /tmp/ltsmin16762983244126189178;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin16762983244126189178;'/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/stateBased11417505001772985048.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 20 out of 118 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 118/118 places, 83/83 transitions.
Applied a total of 0 rules in 4 ms. Remains 118 /118 variables (removed 0) and now considering 83/83 (removed 0) transitions.
[2024-05-25 17:11:24] [INFO ] Invariant cache hit.
[2024-05-25 17:11:24] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-05-25 17:11:24] [INFO ] Invariant cache hit.
[2024-05-25 17:11:25] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 163 ms to find 0 implicit places.
[2024-05-25 17:11:25] [INFO ] Redundant transitions in 12 ms returned []
Running 62 sub problems to find dead transitions.
[2024-05-25 17:11:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/117 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 2 (OVERLAPS) 83/200 variables, 117/153 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/200 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 4 (OVERLAPS) 1/201 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/201 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 6 (OVERLAPS) 0/201 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 62 unsolved
No progress, stopping.
After SMT solving in domain Real declared 201/201 variables, and 154 constraints, problems are : Problem set: 0 solved, 62 unsolved in 1183 ms.
Refiners :[Generalized P Invariants (flows): 36/36 constraints, State Equation: 118/118 constraints, PredecessorRefiner: 62/62 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 62 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/117 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 2 (OVERLAPS) 83/200 variables, 117/153 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/200 variables, 62/215 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 5 (OVERLAPS) 1/201 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/201 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 7 (OVERLAPS) 0/201 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 62 unsolved
No progress, stopping.
After SMT solving in domain Int declared 201/201 variables, and 216 constraints, problems are : Problem set: 0 solved, 62 unsolved in 1582 ms.
Refiners :[Generalized P Invariants (flows): 36/36 constraints, State Equation: 118/118 constraints, PredecessorRefiner: 62/62 constraints, Known Traps: 0/0 constraints]
After SMT, in 2785ms problems are : Problem set: 0 solved, 62 unsolved
Search for dead transitions found 0 dead transitions in 2786ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2970 ms. Remains : 118/118 places, 83/83 transitions.
Built C files in :
/tmp/ltsmin17148236387169280718
[2024-05-25 17:11:27] [INFO ] Computing symmetric may disable matrix : 83 transitions.
[2024-05-25 17:11:27] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 17:11:27] [INFO ] Computing symmetric may enable matrix : 83 transitions.
[2024-05-25 17:11:27] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 17:11:27] [INFO ] Computing Do-Not-Accords matrix : 83 transitions.
[2024-05-25 17:11:27] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 17:11:27] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17148236387169280718
Running compilation step : cd /tmp/ltsmin17148236387169280718;'/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 240 ms.
Running link step : cd /tmp/ltsmin17148236387169280718;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin17148236387169280718;'/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/stateBased16529777336568369214.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-25 17:11:42] [INFO ] Flatten gal took : 3 ms
[2024-05-25 17:11:42] [INFO ] Flatten gal took : 3 ms
[2024-05-25 17:11:42] [INFO ] Time to serialize gal into /tmp/LTL9373141451997477245.gal : 0 ms
[2024-05-25 17:11:42] [INFO ] Time to serialize properties into /tmp/LTL18030313528302633337.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/LTL9373141451997477245.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15596513551505060437.hoa' '-atoms' '/tmp/LTL18030313528302633337.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/LTL18030313528302633337.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15596513551505060437.hoa
Detected timeout of ITS tools.
[2024-05-25 17:11:58] [INFO ] Flatten gal took : 3 ms
[2024-05-25 17:11:58] [INFO ] Flatten gal took : 3 ms
[2024-05-25 17:11:58] [INFO ] Time to serialize gal into /tmp/LTL2097893473843925830.gal : 0 ms
[2024-05-25 17:11:58] [INFO ] Time to serialize properties into /tmp/LTL9121370727196624663.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/LTL2097893473843925830.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9121370727196624663.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("((((((n4_0+n4_1)+(n4_2+n4_3))+((n4_4+n4_5)+(n4_6+n4_7)))+(((n4_8+n4_9)+(n4_10+n4_11))+((n4_12+n4_13)+(n4_14+n4_15))))+((n4_16+...183
Formula 0 simplified : GF!"((((((n4_0+n4_1)+(n4_2+n4_3))+((n4_4+n4_5)+(n4_6+n4_7)))+(((n4_8+n4_9)+(n4_10+n4_11))+((n4_12+n4_13)+(n4_14+n4_15))))+((n4_16+n4...177
Detected timeout of ITS tools.
[2024-05-25 17:12:13] [INFO ] Flatten gal took : 9 ms
[2024-05-25 17:12:13] [INFO ] Applying decomposition
[2024-05-25 17:12:13] [INFO ] Flatten gal took : 3 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/graph11849207898868336939.txt' '-o' '/tmp/graph11849207898868336939.bin' '-w' '/tmp/graph11849207898868336939.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11849207898868336939.bin' '-l' '-1' '-v' '-w' '/tmp/graph11849207898868336939.weights' '-q' '0' '-e' '0.001'
[2024-05-25 17:12:13] [INFO ] Decomposing Gal with order
[2024-05-25 17:12:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 17:12:13] [INFO ] Removed a total of 64 redundant transitions.
[2024-05-25 17:12:13] [INFO ] Flatten gal took : 11 ms
[2024-05-25 17:12:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 27 labels/synchronizations in 2 ms.
[2024-05-25 17:12:13] [INFO ] Time to serialize gal into /tmp/LTL10723869059739879096.gal : 2 ms
[2024-05-25 17:12:13] [INFO ] Time to serialize properties into /tmp/LTL11420825891784666160.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/LTL10723869059739879096.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11420825891784666160.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F(G("((((((gu1.n4_0+gu1.n4_1)+(gu1.n4_2+gu1.n4_3))+((gu1.n4_4+gu1.n4_5)+(gu1.n4_6+gu1.n4_7)))+(((gu1.n4_8+gu1.n4_9)+(gu1.n4_10+gu1....263
Formula 0 simplified : GF!"((((((gu1.n4_0+gu1.n4_1)+(gu1.n4_2+gu1.n4_3))+((gu1.n4_4+gu1.n4_5)+(gu1.n4_6+gu1.n4_7)))+(((gu1.n4_8+gu1.n4_9)+(gu1.n4_10+gu1.n4...257
Detected timeout of ITS tools.
Treatment of property QuasiCertifProtocol-COL-18-LTLCardinality-10 finished in 86342 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||F((p1&&X(p2)&&F(!p2))))))'
Support contains 382 out of 1378 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1378/1378 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 1338 transition count 296
Applied a total of 40 rules in 16 ms. Remains 1338 /1378 variables (removed 40) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 1338 cols
[2024-05-25 17:12:28] [INFO ] Computed 1044 invariants in 27 ms
[2024-05-25 17:12:29] [INFO ] Implicit Places using invariants in 1024 ms returned []
[2024-05-25 17:12:29] [INFO ] Invariant cache hit.
[2024-05-25 17:12:30] [INFO ] Implicit Places using invariants and state equation in 1688 ms returned []
Implicit Place search using SMT with State Equation took 2718 ms to find 0 implicit places.
Running 276 sub problems to find dead transitions.
[2024-05-25 17:12:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1336 variables, 1044/1044 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1336 variables, 0/1044 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 296/1632 variables, 1336/2380 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1632 variables, 0/2380 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 2/1634 variables, 2/2382 constraints. Problems are: Problem set: 0 solved, 276 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1634/1634 variables, and 2382 constraints, problems are : Problem set: 0 solved, 276 unsolved in 30019 ms.
Refiners :[Generalized P Invariants (flows): 1044/1044 constraints, State Equation: 1338/1338 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 276 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1336 variables, 1044/1044 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1336 variables, 0/1044 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 296/1632 variables, 1336/2380 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1632 variables, 143/2523 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1632 variables, 0/2523 constraints. Problems are: Problem set: 0 solved, 276 unsolved
SMT process timed out in 60304ms, After SMT, problems are : Problem set: 0 solved, 276 unsolved
Search for dead transitions found 0 dead transitions in 60312ms
Starting structural reductions in LTL mode, iteration 1 : 1338/1378 places, 296/296 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63048 ms. Remains : 1338/1378 places, 296/296 transitions.
Stuttering acceptance computed with spot in 162 ms :[(NOT p0), true, (NOT p2), p2]
Running random walk in product with property : QuasiCertifProtocol-COL-18-LTLCardinality-11
Stuttering criterion allowed to conclude after 23 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-18-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-18-LTLCardinality-11 finished in 63240 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 19 out of 1378 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1378/1378 places, 296/296 transitions.
Graph (complete) has 9223 edges and 1378 vertex of which 1317 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 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 1314 transition count 291
Applied a total of 5 rules in 72 ms. Remains 1314 /1378 variables (removed 64) and now considering 291/296 (removed 5) transitions.
// Phase 1: matrix 291 rows 1314 cols
[2024-05-25 17:13:31] [INFO ] Computed 1026 invariants in 81 ms
[2024-05-25 17:13:32] [INFO ] Implicit Places using invariants in 1259 ms returned []
[2024-05-25 17:13:32] [INFO ] Invariant cache hit.
[2024-05-25 17:13:39] [INFO ] Implicit Places using invariants and state equation in 6764 ms returned [1160, 1161, 1162, 1163, 1164, 1165, 1166, 1167, 1168, 1169, 1170, 1171, 1172, 1173, 1174, 1175, 1176, 1177, 1178]
Discarding 19 places :
Implicit Place search using SMT with State Equation took 8027 ms to find 19 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1295/1378 places, 291/296 transitions.
Applied a total of 0 rules in 38 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 8137 ms. Remains : 1295/1378 places, 291/296 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-18-LTLCardinality-12
Stuttering criterion allowed to conclude after 21 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-18-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-18-LTLCardinality-12 finished in 8190 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&F(p1))))'
Support contains 741 out of 1378 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1378/1378 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 1337 transition count 296
Applied a total of 41 rules in 21 ms. Remains 1337 /1378 variables (removed 41) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 1337 cols
[2024-05-25 17:13:39] [INFO ] Computed 1044 invariants in 64 ms
[2024-05-25 17:13:40] [INFO ] Implicit Places using invariants in 715 ms returned []
[2024-05-25 17:13:40] [INFO ] Invariant cache hit.
[2024-05-25 17:13:41] [INFO ] Implicit Places using invariants and state equation in 1465 ms returned []
Implicit Place search using SMT with State Equation took 2186 ms to find 0 implicit places.
Running 276 sub problems to find dead transitions.
[2024-05-25 17:13:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1336 variables, 1044/1044 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1336 variables, 0/1044 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 296/1632 variables, 1336/2380 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1632 variables, 0/2380 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 1/1633 variables, 1/2381 constraints. Problems are: Problem set: 0 solved, 276 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1633/1633 variables, and 2381 constraints, problems are : Problem set: 0 solved, 276 unsolved in 30016 ms.
Refiners :[Generalized P Invariants (flows): 1044/1044 constraints, State Equation: 1337/1337 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 276 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1336 variables, 1044/1044 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1336 variables, 0/1044 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 296/1632 variables, 1336/2380 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1632 variables, 276/2656 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1632 variables, 0/2656 constraints. Problems are: Problem set: 0 solved, 276 unsolved
SMT process timed out in 60291ms, After SMT, problems are : Problem set: 0 solved, 276 unsolved
Search for dead transitions found 0 dead transitions in 60294ms
Starting structural reductions in LTL mode, iteration 1 : 1337/1378 places, 296/296 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62507 ms. Remains : 1337/1378 places, 296/296 transitions.
Stuttering acceptance computed with spot in 128 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : QuasiCertifProtocol-COL-18-LTLCardinality-13
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-COL-18-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-18-LTLCardinality-13 finished in 62655 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((X(F(p1))||p0))))'
Support contains 38 out of 1378 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1378/1378 places, 296/296 transitions.
Graph (complete) has 9223 edges and 1378 vertex of which 1317 are kept as prefixes of interest. Removing 61 places using SCC suffix rule.3 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 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 1314 transition count 291
Applied a total of 5 rules in 83 ms. Remains 1314 /1378 variables (removed 64) and now considering 291/296 (removed 5) transitions.
// Phase 1: matrix 291 rows 1314 cols
[2024-05-25 17:14:42] [INFO ] Computed 1026 invariants in 69 ms
[2024-05-25 17:14:43] [INFO ] Implicit Places using invariants in 1292 ms returned []
[2024-05-25 17:14:43] [INFO ] Invariant cache hit.
[2024-05-25 17:14:50] [INFO ] Implicit Places using invariants and state equation in 6849 ms returned [1160, 1161, 1162, 1163, 1164, 1165, 1166, 1167, 1168, 1169, 1170, 1171, 1172, 1173, 1174, 1175, 1176, 1177, 1178]
Discarding 19 places :
Implicit Place search using SMT with State Equation took 8154 ms to find 19 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1295/1378 places, 291/296 transitions.
Applied a total of 0 rules in 34 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 8273 ms. Remains : 1295/1378 places, 291/296 transitions.
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : QuasiCertifProtocol-COL-18-LTLCardinality-14
Product exploration explored 100000 steps with 4207 reset in 392 ms.
Product exploration explored 100000 steps with 4209 reset in 385 ms.
Computed a total of 1295 stabilizing places and 291 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1295 transition count 291
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 (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 8 factoid took 379 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 40000 steps (1681 resets) in 162 ms. (245 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40003 steps (76 resets) in 51 ms. (769 steps per ms) remains 1/1 properties
// Phase 1: matrix 291 rows 1295 cols
[2024-05-25 17:14:52] [INFO ] Computed 1008 invariants in 112 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 57/76 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 913/989 variables, 742/761 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/989 variables, 324/1085 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/989 variables, 0/1085 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 19/1008 variables, 342/1427 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1008 variables, 19/1446 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1008 variables, 0/1446 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 342/1350 variables, 324/1770 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1350 variables, 342/2112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1350 variables, 0/2112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 152/1502 variables, 95/2207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1502 variables, 0/2207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 80/1582 variables, 76/2283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1582 variables, 18/2301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1582 variables, 0/2301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 4/1586 variables, 2/2303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1586 variables, 0/2303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1586 variables, 0/2303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1586/1586 variables, and 2303 constraints, problems are : Problem set: 0 solved, 1 unsolved in 754 ms.
Refiners :[Generalized P Invariants (flows): 1008/1008 constraints, State Equation: 1295/1295 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/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 57/76 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 913/989 variables, 742/761 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/989 variables, 324/1085 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/989 variables, 1/1086 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/989 variables, 0/1086 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 19/1008 variables, 342/1428 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1008 variables, 19/1447 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1008 variables, 0/1447 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 342/1350 variables, 324/1771 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1350 variables, 342/2113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1350 variables, 0/2113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 152/1502 variables, 95/2208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1502 variables, 0/2208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 80/1582 variables, 76/2284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1582 variables, 18/2302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1582 variables, 0/2302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 4/1586 variables, 2/2304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1586 variables, 0/2304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1586 variables, 0/2304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1586/1586 variables, and 2304 constraints, problems are : Problem set: 0 solved, 1 unsolved in 937 ms.
Refiners :[Generalized P Invariants (flows): 1008/1008 constraints, State Equation: 1295/1295 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1820ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 104 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=34 )
Parikh walk visited 1 properties in 3 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 8 factoid took 586 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-05-25 17:14:54] [INFO ] Invariant cache hit.
[2024-05-25 17:14:56] [INFO ] [Real]Absence check using 0 positive and 1008 generalized place invariants in 959 ms returned sat
[2024-05-25 17:14:59] [INFO ] [Real]Absence check using state equation in 3793 ms returned sat
[2024-05-25 17:14:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 17:15:01] [INFO ] [Nat]Absence check using 0 positive and 1008 generalized place invariants in 990 ms returned sat
[2024-05-25 17:15:05] [INFO ] [Nat]Absence check using state equation in 4356 ms returned sat
[2024-05-25 17:15:05] [INFO ] Computed and/alt/rep : 191/229/191 causal constraints (skipped 61 transitions) in 28 ms.
[2024-05-25 17:15:05] [INFO ] Added : 0 causal constraints over 0 iterations in 125 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 38 out of 1295 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1295/1295 places, 291/291 transitions.
Applied a total of 0 rules in 42 ms. Remains 1295 /1295 variables (removed 0) and now considering 291/291 (removed 0) transitions.
[2024-05-25 17:15:05] [INFO ] Invariant cache hit.
[2024-05-25 17:15:07] [INFO ] Implicit Places using invariants in 1243 ms returned []
[2024-05-25 17:15:07] [INFO ] Invariant cache hit.
[2024-05-25 17:15:13] [INFO ] Implicit Places using invariants and state equation in 6806 ms returned []
Implicit Place search using SMT with State Equation took 8055 ms to find 0 implicit places.
[2024-05-25 17:15:13] [INFO ] Redundant transitions in 20 ms returned []
Running 252 sub problems to find dead transitions.
[2024-05-25 17:15:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1276 variables, 1008/1008 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1276 variables, 0/1008 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (OVERLAPS) 291/1567 variables, 1276/2284 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1567 variables, 0/2284 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 4 (OVERLAPS) 19/1586 variables, 19/2303 constraints. Problems are: Problem set: 0 solved, 252 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1586/1586 variables, and 2303 constraints, problems are : Problem set: 0 solved, 252 unsolved in 30015 ms.
Refiners :[Generalized P Invariants (flows): 1008/1008 constraints, State Equation: 1295/1295 constraints, PredecessorRefiner: 252/252 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 252 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1276 variables, 1008/1008 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1276 variables, 0/1008 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (OVERLAPS) 291/1567 variables, 1276/2284 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1567 variables, 252/2536 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1567 variables, 0/2536 constraints. Problems are: Problem set: 0 solved, 252 unsolved
SMT process timed out in 60293ms, After SMT, problems are : Problem set: 0 solved, 252 unsolved
Search for dead transitions found 0 dead transitions in 60297ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 68419 ms. Remains : 1295/1295 places, 291/291 transitions.
Computed a total of 1295 stabilizing places and 291 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1295 transition count 291
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 (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 8 factoid took 364 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 40000 steps (1680 resets) in 126 ms. (314 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40004 steps (74 resets) in 46 ms. (851 steps per ms) remains 1/1 properties
[2024-05-25 17:16:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 57/76 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 913/989 variables, 742/761 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/989 variables, 324/1085 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/989 variables, 0/1085 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 19/1008 variables, 342/1427 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1008 variables, 19/1446 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1008 variables, 0/1446 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 342/1350 variables, 324/1770 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1350 variables, 342/2112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1350 variables, 0/2112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 152/1502 variables, 95/2207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1502 variables, 0/2207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 80/1582 variables, 76/2283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1582 variables, 18/2301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1582 variables, 0/2301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 4/1586 variables, 2/2303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1586 variables, 0/2303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1586 variables, 0/2303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1586/1586 variables, and 2303 constraints, problems are : Problem set: 0 solved, 1 unsolved in 765 ms.
Refiners :[Generalized P Invariants (flows): 1008/1008 constraints, State Equation: 1295/1295 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/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 57/76 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 913/989 variables, 742/761 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/989 variables, 324/1085 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/989 variables, 1/1086 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/989 variables, 0/1086 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 19/1008 variables, 342/1428 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1008 variables, 19/1447 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1008 variables, 0/1447 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 342/1350 variables, 324/1771 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1350 variables, 342/2113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1350 variables, 0/2113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 152/1502 variables, 95/2208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1502 variables, 0/2208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 80/1582 variables, 76/2284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1582 variables, 18/2302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1582 variables, 0/2302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 4/1586 variables, 2/2304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1586 variables, 0/2304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1586 variables, 0/2304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1586/1586 variables, and 2304 constraints, problems are : Problem set: 0 solved, 1 unsolved in 944 ms.
Refiners :[Generalized P Invariants (flows): 1008/1008 constraints, State Equation: 1295/1295 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1716ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 102 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=25 )
Parikh walk visited 1 properties in 4 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 8 factoid took 522 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-05-25 17:16:17] [INFO ] Invariant cache hit.
[2024-05-25 17:16:18] [INFO ] [Real]Absence check using 0 positive and 1008 generalized place invariants in 993 ms returned sat
[2024-05-25 17:16:22] [INFO ] [Real]Absence check using state equation in 3859 ms returned sat
[2024-05-25 17:16:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 17:16:24] [INFO ] [Nat]Absence check using 0 positive and 1008 generalized place invariants in 983 ms returned sat
[2024-05-25 17:16:28] [INFO ] [Nat]Absence check using state equation in 4293 ms returned sat
[2024-05-25 17:16:28] [INFO ] Computed and/alt/rep : 191/229/191 causal constraints (skipped 61 transitions) in 21 ms.
[2024-05-25 17:16:28] [INFO ] Added : 0 causal constraints over 0 iterations in 112 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 4207 reset in 370 ms.
Product exploration explored 100000 steps with 4209 reset in 365 ms.
Built C files in :
/tmp/ltsmin2815938673949698476
[2024-05-25 17:16:29] [INFO ] Computing symmetric may disable matrix : 291 transitions.
[2024-05-25 17:16:29] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 17:16:29] [INFO ] Computing symmetric may enable matrix : 291 transitions.
[2024-05-25 17:16:29] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 17:16:29] [INFO ] Computing Do-Not-Accords matrix : 291 transitions.
[2024-05-25 17:16:29] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 17:16:29] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2815938673949698476
Running compilation step : cd /tmp/ltsmin2815938673949698476;'/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 1243 ms.
Running link step : cd /tmp/ltsmin2815938673949698476;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin2815938673949698476;'/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/stateBased4929171881053353026.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 38 out of 1295 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1295/1295 places, 291/291 transitions.
Applied a total of 0 rules in 35 ms. Remains 1295 /1295 variables (removed 0) and now considering 291/291 (removed 0) transitions.
[2024-05-25 17:16:44] [INFO ] Invariant cache hit.
[2024-05-25 17:16:45] [INFO ] Implicit Places using invariants in 1269 ms returned []
[2024-05-25 17:16:45] [INFO ] Invariant cache hit.
[2024-05-25 17:16:52] [INFO ] Implicit Places using invariants and state equation in 6854 ms returned []
Implicit Place search using SMT with State Equation took 8125 ms to find 0 implicit places.
[2024-05-25 17:16:52] [INFO ] Redundant transitions in 21 ms returned []
Running 252 sub problems to find dead transitions.
[2024-05-25 17:16:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1276 variables, 1008/1008 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1276 variables, 0/1008 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (OVERLAPS) 291/1567 variables, 1276/2284 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1567 variables, 0/2284 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 4 (OVERLAPS) 19/1586 variables, 19/2303 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1586 variables, 0/2303 constraints. Problems are: Problem set: 0 solved, 252 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 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.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 0.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 0.0)
(s97 0.0)
(s98 0.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 0.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 timeout
0.0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1586/1586 variables, and 2303 constraints, problems are : Problem set: 0 solved, 252 unsolved in 30015 ms.
Refiners :[Generalized P Invariants (flows): 1008/1008 constraints, State Equation: 1295/1295 constraints, PredecessorRefiner: 252/252 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 252 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1276 variables, 1008/1008 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1276 variables, 0/1008 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (OVERLAPS) 291/1567 variables, 1276/2284 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1567 variables, 252/2536 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1567 variables, 0/2536 constraints. Problems are: Problem set: 0 solved, 252 unsolved
SMT process timed out in 60349ms, After SMT, problems are : Problem set: 0 solved, 252 unsolved
Search for dead transitions found 0 dead transitions in 60352ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 68537 ms. Remains : 1295/1295 places, 291/291 transitions.
Built C files in :
/tmp/ltsmin17045792266307732899
[2024-05-25 17:17:52] [INFO ] Computing symmetric may disable matrix : 291 transitions.
[2024-05-25 17:17:52] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 17:17:52] [INFO ] Computing symmetric may enable matrix : 291 transitions.
[2024-05-25 17:17:52] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 17:17:53] [INFO ] Computing Do-Not-Accords matrix : 291 transitions.
[2024-05-25 17:17:53] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 17:17:53] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17045792266307732899
Running compilation step : cd /tmp/ltsmin17045792266307732899;'/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 1267 ms.
Running link step : cd /tmp/ltsmin17045792266307732899;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin17045792266307732899;'/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/stateBased16997912359291726568.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-25 17:18:08] [INFO ] Flatten gal took : 24 ms
[2024-05-25 17:18:08] [INFO ] Flatten gal took : 23 ms
[2024-05-25 17:18:08] [INFO ] Time to serialize gal into /tmp/LTL775617693370498413.gal : 4 ms
[2024-05-25 17:18:08] [INFO ] Time to serialize properties into /tmp/LTL8225828591078058099.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/LTL775617693370498413.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12635051080550552547.hoa' '-atoms' '/tmp/LTL8225828591078058099.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/LTL8225828591078058099.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12635051080550552547.hoa
Detected timeout of ITS tools.
[2024-05-25 17:18:23] [INFO ] Flatten gal took : 22 ms
[2024-05-25 17:18:23] [INFO ] Flatten gal took : 23 ms
[2024-05-25 17:18:23] [INFO ] Time to serialize gal into /tmp/LTL8760300442809933187.gal : 4 ms
[2024-05-25 17:18:23] [INFO ] Time to serialize properties into /tmp/LTL15700543716631408629.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/LTL8760300442809933187.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15700543716631408629.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(("(((((((s6_0+s6_1)+(s6_2+s6_3))+((s6_4+s6_5)+(s6_6+s6_7)))+(((s6_8+s6_9)+(s6_10+s6_11))+((s6_12+s6_13)+(s6_14+s6_15))))+((s6_1...484
Formula 0 simplified : G(F!"(((((((s6_0+s6_1)+(s6_2+s6_3))+((s6_4+s6_5)+(s6_6+s6_7)))+(((s6_8+s6_9)+(s6_10+s6_11))+((s6_12+s6_13)+(s6_14+s6_15))))+((s6_16+...474
Detected timeout of ITS tools.
[2024-05-25 17:18:38] [INFO ] Flatten gal took : 25 ms
[2024-05-25 17:18:38] [INFO ] Applying decomposition
[2024-05-25 17:18:38] [INFO ] Flatten gal took : 23 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/graph3436394905118370866.txt' '-o' '/tmp/graph3436394905118370866.bin' '-w' '/tmp/graph3436394905118370866.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3436394905118370866.bin' '-l' '-1' '-v' '-w' '/tmp/graph3436394905118370866.weights' '-q' '0' '-e' '0.001'
[2024-05-25 17:18:38] [INFO ] Decomposing Gal with order
[2024-05-25 17:18:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 17:18:38] [INFO ] Removed a total of 218 redundant transitions.
[2024-05-25 17:18:38] [INFO ] Flatten gal took : 60 ms
[2024-05-25 17:18:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 200 labels/synchronizations in 14 ms.
[2024-05-25 17:18:38] [INFO ] Time to serialize gal into /tmp/LTL17345994113866093436.gal : 7 ms
[2024-05-25 17:18:38] [INFO ] Time to serialize properties into /tmp/LTL8436021855770335144.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/LTL17345994113866093436.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8436021855770335144.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(("(((((((gu64.s6_0+gu64.s6_1)+(gu64.s6_2+gu64.s6_3))+((gu64.s6_4+gu64.s6_5)+(gu64.s6_6+gu64.s6_7)))+(((gu64.s6_8+gu64.s6_9)+(gu...769
Formula 0 simplified : G(F!"(((((((gu64.s6_0+gu64.s6_1)+(gu64.s6_2+gu64.s6_3))+((gu64.s6_4+gu64.s6_5)+(gu64.s6_6+gu64.s6_7)))+(((gu64.s6_8+gu64.s6_9)+(gu64...759
Detected timeout of ITS tools.
Treatment of property QuasiCertifProtocol-COL-18-LTLCardinality-14 finished in 251381 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0) U p1)))'
Support contains 382 out of 1378 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1378/1378 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 1338 transition count 296
Applied a total of 40 rules in 19 ms. Remains 1338 /1378 variables (removed 40) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 1338 cols
[2024-05-25 17:18:53] [INFO ] Computed 1044 invariants in 18 ms
[2024-05-25 17:18:54] [INFO ] Implicit Places using invariants in 869 ms returned []
[2024-05-25 17:18:54] [INFO ] Invariant cache hit.
[2024-05-25 17:18:58] [INFO ] Implicit Places using invariants and state equation in 3651 ms returned []
Implicit Place search using SMT with State Equation took 4522 ms to find 0 implicit places.
Running 276 sub problems to find dead transitions.
[2024-05-25 17:18:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1336 variables, 1044/1044 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1336 variables, 0/1044 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 296/1632 variables, 1336/2380 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1632 variables, 0/2380 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 2/1634 variables, 2/2382 constraints. Problems are: Problem set: 0 solved, 276 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1634/1634 variables, and 2382 constraints, problems are : Problem set: 0 solved, 276 unsolved in 30015 ms.
Refiners :[Generalized P Invariants (flows): 1044/1044 constraints, State Equation: 1338/1338 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 276 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1336 variables, 1044/1044 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1336 variables, 0/1044 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 296/1632 variables, 1336/2380 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1632 variables, 48/2428 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1632 variables, 0/2428 constraints. Problems are: Problem set: 0 solved, 276 unsolved
SMT process timed out in 60289ms, After SMT, problems are : Problem set: 0 solved, 276 unsolved
Search for dead transitions found 0 dead transitions in 60293ms
Starting structural reductions in LTL mode, iteration 1 : 1338/1378 places, 296/296 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64835 ms. Remains : 1338/1378 places, 296/296 transitions.
Stuttering acceptance computed with spot in 142 ms :[(NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-18-LTLCardinality-15
Product exploration explored 100000 steps with 50000 reset in 335 ms.
Product exploration explored 100000 steps with 50000 reset in 345 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 p1 p0), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (X (X (NOT p1)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 20 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-COL-18-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-18-LTLCardinality-15 finished in 65924 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-COL-18-LTLCardinality-04
Stuttering acceptance computed with spot in 443 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 1378 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1378/1378 places, 296/296 transitions.
Graph (complete) has 9223 edges and 1378 vertex of which 1357 are kept as prefixes of interest. Removing 21 places using SCC suffix rule.3 ms
Discarding 21 places :
Also discarding 0 output 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 1355 transition count 294
Applied a total of 5 rules in 79 ms. Remains 1355 /1378 variables (removed 23) and now considering 294/296 (removed 2) transitions.
// Phase 1: matrix 294 rows 1355 cols
[2024-05-25 17:20:00] [INFO ] Computed 1062 invariants in 31 ms
[2024-05-25 17:20:01] [INFO ] Implicit Places using invariants in 1320 ms returned []
[2024-05-25 17:20:01] [INFO ] Invariant cache hit.
[2024-05-25 17:20:07] [INFO ] Implicit Places using invariants and state equation in 6195 ms returned []
Implicit Place search using SMT with State Equation took 7518 ms to find 0 implicit places.
Running 274 sub problems to find dead transitions.
[2024-05-25 17:20:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1334 variables, 720/720 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1334 variables, 0/720 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 2 (OVERLAPS) 19/1353 variables, 342/1062 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1353 variables, 0/1062 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 4 (OVERLAPS) 294/1647 variables, 1353/2415 constraints. Problems are: Problem set: 0 solved, 274 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 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.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 0.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 0.0)
(s97 0.0)
(s98 0.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 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.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 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 0.0)
(s535 0.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 0.0)
(s547 0.0)
(s548 0.0)
(s549 0.0)
(s550 0.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 0.0)
(s558 0.0)
(s559 0.0)
(s560 0.0)
(s561 0.0)
(s562 0.0)
(s563 0.0)
(s564 0.0)
(s565 0.0)
(s566 0.0)
(s567 0.0)
(s568 0.0)
(s569 0.0)
(s570 0.0)
(s571 0.0)
(s572 0.0)
(s573 0.0)
(s574 0.0)
(s575 0.0)
(s576 0.0)
(s577 0.0)
(s578 0.0)
(s579 0.0)
(s580 0.0)
(s581 0.0)
(s582 0.0)
(s583 0.0)
(s584 0.0)
(s585 0.0)
(s586 0.0)
(s587 0.0)
(s588 0.0)
(s589 0.0)
(s590 0.0)
(s591 0.0)
(s592 0.0)
(s593 0.0)
(s594 0.0)
(s595 0.0)
(s596 0.0)
(s597 0.0)
(s598 0.0)
(s599 0.0)
(s600 0.0)
(s601 0.0)
(s602 0.0)
(s603 0.0)
(s604 0.0)
(s605 0.0)
(s606 0.0)
(s607 0.0)
(s608 0.0)
(s609 0.0)
(s610 0.0)
(s611 0.0)
(s612 0.0)
(s613 0.0)
(s614 0.0)
(s615 0.0)
(s616 0.0)
(s617 0.0)
(s618 0.0)
(s619 0.0)
(s620 0.0)
(s621 0.0)
(s622 0.0)
(s623 0.0)
(s624 0.0)
(s625 0.0)
(s626 0.0)
(s627 0.0)
(s628 0.0)
(s629 0.0)
(s630 0.0)
(s631 0.0)
(s632 0.0)
(s633 0.0)
(s634 0.0)
(s635 0.0)
(s636 0.0)
(s637 0.0)
(s638 0.0)
(s639 0.0)
(s640 0.0)
(s641 0.0)
(s642 0.0)
(s643 0.0)
(s644 0.0)
(s645 0.0)
(s646 0.0)
(s647 0.0)
(s648 0.0)
(s649 0.0)
(s650 0.0)
(s651 0.0)
(s652 0.0)
(s653 0.0)
(s654 0.0)
(s655 0.0)
(s656 0.0)
(s657 0.0)
(s658 0.0)
(s659 0.0)
(s660 0.0)
(s661 0.0)
(s662 0.0)
(s663 0.0)
(s664 0.0)
(s665 0.0)
(s666 0.0)
(s667 0.0)
(s668 0.0)
(s669 0.0)
(s670 0.0)
(s671 0.0)
(s672 0.0)
(s673 0.0)
(s674 0.0)
(s675 0.0)
(s676 0.0)
(s677 0.0)
(s678 0.0)
(s679 0.0)
(s680 0.0)
(s681 0.0)
(s682 0.0)
(s683 0.0)
(s684 0.0)
(s685 0.0)
(s686 0.0)
(s687 0.0)
(s688 0.0)
(s689 0.0)
(s690 0.0)
(s691 0.0)
(s692 0.0)
(s693 0.0)
(s694 0.0)
(s695 0.0)
(s696 0.0)
(s697 0.0)
(s698 0.0)
(s699 0.0)
(s700 0.0)
(s701 0.0)
(s702 0.0)
(s703 0.0)
(s704 0.0)
(s705 0.0)
(s706 0.0)
(s707 0.0)
(s708 0.0)
(s709 0.0)
(s710 0.0)
(s711 0.0)
(s712 0.0)
(s713 0.0)
(s714 0.0)
(s715 0.0)
(s716 0.0)
(s717 0.0)
(s718 0.0)
(s719 0.0)
(s720 0.0)
(s721 0.0)
(s722 0.0)
(s723 0.0)
(s724 0.0)
(s725 0.0)
(s726 0.0)
(s727 0.0)
(s728 0.0)
(s729 0.0)
(s730 0.0)
(s731 0.0)
(s732 0.0)
(s733 0.0)
(s734 0.0)
(s735 0.0)
(s736 0.0)
(s737 0.0)
(s738 0.0)
(s739 0.0)
(s740 0.0)
(s741 0.0)
(s742 0.0)
(s743 0.0)
(s744 0.0)
(s745 0.0)
(s746 0.0)
(s747 0.0)
(s748 0.0)
(s749 0.0)
(s750 0.0)
(s751 0.0)
(s752 0.0)
(s753 0.0)
(s754 0.0)
(s755 0.0)
(s756 0.0)
(s757 0.0)
(s758 0.0)
(s759 0.0)
(s760 0.0)
(s761 0.0)
(s762 0.0)
(s763 0.0)
(s764 0.0)
(s765 0.0)
(s766 0.0)
(s767 0.0)
(s768 0.0)
(s769 0.0)
(s770 0.0)
(s771 0.0)
(s772 0.0)
(s773 0.0)
(s774 0.0)
(s775 0.0)
(s776 0.0)
(s777 0.0)
(s778 0.0)
(s779 0.0)
(s780 0.0)
(s781 0.0)
(s782 0.0)
(s783 0.0)
(s784 0.0)
(s785 0.0)
(s786 0.0)
(s787 0.0)
(s788 0.0)
(s789 0.0)
(s790 0.0)
(s791 0.0)
(s792 0.0)
(s793 0.0)
(s794 0.0)
(s795 0.0)
(s796 0.0)
(s797 0.0)
(s798 0.0)
(s799 0.0)
(s800 0.0)
(s801 0.0)
(s802 0.0)
(s803 0.0)
(s804 0.0)
(s805 0.0)
(s806 0.0)
(s807 0.0)
(s808 0.0)
(s809 0.0)
(s810 0.0)
(s811 0.0)
(s812 0.0)
(s813 0.0)
(s814 0.0)
(s815 0.0)
(s816 0.0)
(s817 0.0)
(s818 0.0)
(s819 0.0)
(s820 0.0)
(s821 0.0)
(s822 0.0)
(s823 0.0)
(s824 0.0)
(s825 0.0)
(s826 0.0)
(s827 0.0)
(s828 0.0)
(s829 0.0)
(s830 0.0)
(s831 0.0)
(s832 0.0)
(s833 0.0)
(s834 0.0)
(s835 0.0)
(s836 0.0)
(s837 0.0)
(s838 0.0)
(s839 0.0)
(s840 0.0)
(s841 0.0)
(s842 0.0)
(s843 0.0)
(s844 0.0)
(s845 0.0)
(s846 0.0)
(s847 0.0)
(s848 0.0)
(s849 0.0)
(s850 0.0)
(s851 0.0)
(s852 0.0)
(s853 0.0)
(s854 0.0)
(s855 0.0)
(s856 0.0)
(s857 0.0)
(s858 0.0)
(s859 0.0)
(s860 0.0)
(s861 0.0)
(s862 0.0)
(s863 0.0)
(s864 0.0)
(s865 0.0)
(s866 0.0)
(s867 0.0)
(s868 0.0)
(s869 0.0)
(s870 0.0)
(s871 0.0)
(s872 0.0)
(s873 0.0)
(s874 0.0)
(s875 0.0)
(s876 0.0)
(s877 0.0)
(s878 0.0)
(s879 0.0)
(s880 0.0)
(s881 0.0)
(s882 0.0)
(s883 0.0)
(s884 0.0)
(s885 0.0)
(s886 0.0)
(s887 0.0)
(s888 0.0)
(s889 0.0)
(s890 0.0)
(s891 0.0)
(s892 0.0)
(s893 0.0)
(s894 0.0)
(s895 0.0)
(s896 0.0)
(s897 0.0)
(s898 0.0)
(s899 0.0)
(s900 0.0)
(s901 0.0)
(s902 0.0)
(s903 0.0)
(s904 0.0)
(s905 0.0)
(s906 0.0)
(s907 0.0)
(s908 0.0)
(s909 0.0)
(s910 0.0)
(s911 0.0)
(s912 0.0)
(s913 0.0)
(s914 0.0)
(s915 0.0)
(s916 0.0)
(s917 0.0)
(s918 0.0)
(s919 0.0)
(s920 0.0)
(s921 0.0)
(s922 0.0)
(s923 0.0)
(s924 0.0)
(s925 0.0)
(s926 0.0)
(s927 0.0)
(s928 0.0)
(s929 0.0)
(s930 0.0)
(s931 0.0)
(s932 0.0)
(s933 0.0)
(s934 0.0)
(s935 0.0)
(s936 0.0)
(s937 0.0)
(s938 0.0)
(s939 0.0)
(s940 0.0)
(s941 0.0)
(s942 0.0)
(s943 0.0)
(s944 0.0)
(s945 0.0)
(s946 0.0)
(s947 0.0)
(s948 0.0)
(s949 0.0)
(s950 0.0)
(s951 0.0)
(s952 0.0)
(s953 0.0)
(s954 0.0)
(s955 0.0)
(s956 0.0)
(s957 0.0)
(s958 0.0)
(s959 0.0)
(s960 0.0)
(s961 0.0)
(s962 0.0)
(s963 0.0)
(s964 0.0)
(s965 0.0)
(s966 0.0)
(s967 0.0)
(s968 0.0)
(s969 0.0)
(s970 0.0)
(s971 0.0)
(s972 0.0)
(s973 0.0)
(s974 0.0)
(s975 0.0)
(s976 0.0)
(s977 0.0)
(s978 0.0)
(s979 0.0)
(s980 0.0)
(s981 0.0)
(s982 0.0)
(s983 0.0)
(s984 0.0)
(s985 0.0)
(s986 0.0)
(s987 0.0)
(s988 0.0)
(s989 0.0)
(s990 0.0)
(s991 0.0)
(s992 0.0)
(s993 0.0)
(s994 0.0)
(s995 0.0)
(s996 0.0)
(s997 0.0)
(s998 0.0)
(s999 0.0)
(s1000 0.0)
(s1001 0.0)
(s1002 0.0)
(s1003 0.0)
(s1004 0.0)
(s1005 0.0)
(s1006 0.0)
(s1007 0.0)
(s1008 0.0)
(s1009 0.0)
(s1010 0.0)
(s1011 0.0)
(s1012 0.0)
(s1013 0.0)
(s1014 0.0)
(s1015 0.0)
(s1016 0.0)
(s1017 0.0)
(s1018 0.0)
(s1019 0.0)
(s1020 0.0)
(s1021 0.0)
(s1022 0.0)
(s1023 0.0)
(s1024 0.0)
(s1025 0.0)
(s1026 0.0)
(s1027 0.0)
(s1028 0.0)
(s1029 0.0)
(s1030 0.0)
(s1031 0.0)
(s1032 0.0)
(s1033 0.0)
(s1034 0.0)
(s1035 0.0)
(s1036 0.0)
(s1037 0.0)
(s1038 0.0)
(s1039 0.0)
(s1040 0.0)
(s1041 0.0)
(s1042 0.0)
(s1043 0.0)
(s1044 0.0)
(s1045 0.0)
(s1046 0.0)
(s1047 0.0)
(s1048 0.0)
(s1049 0.0)
(s1050 0.0)
(s1051 0.0)
(s1052 0.0)
(s1053 0.0)
(s1054 0.0)
(s1055 0.0)
(s1056 0.0)
(s1057 0.0)
(s1058 0.0)
(s1059 0.0)
(s1060 0.0)
(s1061 0.0)
(s1062 0.0)
(s1063 0.0)
(s1064 0.0)
(s1065 0.0)
(s1066 0.0)
(s1067 0.0)
(s1068 0.0)
(s1069 0.0)
(s1070 0.0)
(s1071 0.0)
(s1072 0.0)
(s1073 0.0)
(s1074 0.0)
(s1075 0.0)
(s1076 0.0)
(s1077 0.0)
(s1078 0.0)
(s1079 0.0)
(s1080 0.0)
(s1081 0.0)
(s1082 0.0)
(s1083 0.0)
(s1084 1.0)
(s1085 1.0)
(s1086 1.0)
(s1087 1.0)
(s1088 1.0)
(s1089 1.0)
(s1090 1.0)
(s1091 1.0)
(s1092 1.0)
(s1093 1.0)
(s1094 1.0)
(s1095 1.0)
(s1096 1.0)
(s1097 1.0)
(s1098 1.0)
(s1099 1.0)
(s1100 1.0)
(s1101 1.0)
(s1102 1.0)
(s1103 0.0)
(s1104 0.0)
(s1105 0.0)
(s1106 0.0)
(s1107 0.0)
(s1108 0.0)
(s1109 0.0)
(s1110 0.0)
(s1111 0.0)
(s1112 0.0)
(s1113 0.0)
(s1114 0.0)
(s1115 0.0)
(s1116 0.0)
(s1117 0.0)
(s1118 0.0)
(s1119 0.0)
(s1120 0.0)
(s1121 0.0)
(s1122 0.0)
(s1123 0.0)
(s1124 0.0)
(s1125 0.0)
(s1126 0.0)
(s1127 0.0)
(s1128 0.0)
(s1129 0.0)
(s1130 0.0)
(s1131 0.0)
(s1132 0.0)
(s1133 0.0)
(s1134 0.0)
(s1135 0.0)
(s1136 0.0)
(s1137 0.0)
(s1138 0.0)
(s1139 0.0)
(s1140 0.0)
(s1141 0.0)
(s1142 0.0)
(s1143 0.0)
(s1144 0.0)
(s1145 0.0)
(s1146 0.0)
(s1147 0.0)
(s1148 0.0)
(s1149 0.0)
(s1150 0.0)
(s1151 0.0)
(s1152 0.0)
(s1153 0.0)
(s1154 0.0)
(s1155 0.0)
(s1156 0.0)
(s1157 0.0)
(s1158 0.0)
(s1159 0.0)
(s1160 0.0)
(s1161 0.0)
(s1162 0.0)
(s1163 0.0)
(s1164 0.0)
(s1165 0.0)
(s1166 0.0)
(s1167 0.0)
(s1168 0.0)
(s1169 0.0)
(s1170 0.0)
(s1171 0.0)
(s1172 0.0)
(s1173 0.0)
(s1174 0.0)
(s1175 0.0)
(s1176 0.0)
(s1177 0.0)
(s1178 0.0)
(s1179 1.0)
(s1180 1.0)
(s1181 1.0)
(s1182 1.0)
(s1183 1.0)
(s1184 1.0)
(s1185 1.0)
(s1186 1.0)
(s1187 1.0)
(s1188 1.0)
(s1189 1.0)
(s1190 1.0)
(s1191 1.0)
(s1192 1.0)
(s1193 1.0)
(s1194 1.0)
(s1195 1.0)
(s1196 1.0)
(s1197 1.0)
(s1198 1.0)
(s1199 1.0)
(s1200 1.0)
(s1201 1.0)
(s1202 1.0)
(s1203 1.0)
(s1204 1.0)
(s1205 1.0)
(s1206 1.0)
(s1207 1.0)
(s1208 1.0)
(s1209 1.0)
(s1210 1.0)
(s1211 1.0)
(s1212 1.0)
(s1213 1.0)
(s1214 1.0)
(s1215 1.0)
(s1216 1.0)
(s1217 0.0)
(s1218 0.0)
(s1219 0.0)
(s1220 0.0)
(s1221 0.0)
(s1222 0.0)
(s1223 0.0)
(s1224 0.0)
(s1225 0.0)
(s1226 0.0)
(s1227 0.0)
(s1228 0.0)
(s1229 0.0)
(s1230 0.0)
(s1231 0.0)
(s1232 0.0)
(s1233 0.0)
(s1234 0.0)
(s1235 0.0)
(s1236 0.0)
(s1237 0.0)
(s1238 0.0)
(s1239 0.0)
(s1240 0.0)
(s1241 0.0)
(s1242 0.0)
(s1243 0.0)
(s1244 0.0)
(s1245 0.0)
(s1246 0.0)
(s1247 0.0)
(s1248 0.0)
(s1249 0.0)
(s1250 0.0)
(s1251 0.0)
(s1252 0.0)
(s1253 0.0)
(s1254 0.0)
(s1255 0.0)
(s1256 0.0)
(s1257 0.0)
(s1258 0.0)
(s1259 0.0)
(s1260 0.0)
(s1261 0.0)
(s1262 0.0)
(s1263 0.0)
(s1264 0.0)
(s1265 0.0)
(s1266 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1647/1649 variables, and 2415 constraints, problems are : Problem set: 0 solved, 274 unsolved in 30020 ms.
Refiners :[Generalized P Invariants (flows): 1062/1062 constraints, State Equation: 1353/1355 constraints, PredecessorRefiner: 274/274 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 274 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1334 variables, 720/720 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1334 variables, 0/720 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 2 (OVERLAPS) 19/1353 variables, 342/1062 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1353 variables, 0/1062 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 4 (OVERLAPS) 294/1647 variables, 1353/2415 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1647 variables, 272/2687 constraints. Problems are: Problem set: 0 solved, 274 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1647/1649 variables, and 2687 constraints, problems are : Problem set: 0 solved, 274 unsolved in 30016 ms.
Refiners :[Generalized P Invariants (flows): 1062/1062 constraints, State Equation: 1353/1355 constraints, PredecessorRefiner: 272/274 constraints, Known Traps: 0/0 constraints]
After SMT, in 60307ms problems are : Problem set: 0 solved, 274 unsolved
Search for dead transitions found 0 dead transitions in 60311ms
Starting structural reductions in LI_LTL mode, iteration 1 : 1355/1378 places, 294/296 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 67910 ms. Remains : 1355/1378 places, 294/296 transitions.
Running random walk in product with property : QuasiCertifProtocol-COL-18-LTLCardinality-04
Product exploration explored 100000 steps with 4422 reset in 241 ms.
Product exploration explored 100000 steps with 4417 reset in 272 ms.
Computed a total of 1355 stabilizing places and 294 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1355 transition count 294
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 203 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 71 ms :[(NOT p2), (NOT p2)]
RANDOM walk for 40000 steps (1761 resets) in 114 ms. (347 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (172 resets) in 36 ms. (1081 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 653 steps, run visited all 1 properties in 5 ms. (steps per millisecond=130 )
Probabilistic random walk after 653 steps, saw 634 distinct states, run finished after 5 ms. (steps per millisecond=130 ) properties seen :1
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 362 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 74 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 82 ms :[(NOT p2), (NOT p2)]
Support contains 20 out of 1355 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 : 1355/1355 places, 294/294 transitions.
Applied a total of 0 rules in 38 ms. Remains 1355 /1355 variables (removed 0) and now considering 294/294 (removed 0) transitions.
[2024-05-25 17:21:09] [INFO ] Invariant cache hit.
[2024-05-25 17:21:11] [INFO ] Implicit Places using invariants in 1191 ms returned []
[2024-05-25 17:21:11] [INFO ] Invariant cache hit.
[2024-05-25 17:21:17] [INFO ] Implicit Places using invariants and state equation in 6193 ms returned []
Implicit Place search using SMT with State Equation took 7386 ms to find 0 implicit places.
[2024-05-25 17:21:17] [INFO ] Redundant transitions in 20 ms returned []
Running 274 sub problems to find dead transitions.
[2024-05-25 17:21:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1334 variables, 720/720 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1334 variables, 0/720 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 2 (OVERLAPS) 19/1353 variables, 342/1062 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1353 variables, 0/1062 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 4 (OVERLAPS) 294/1647 variables, 1353/2415 constraints. Problems are: Problem set: 0 solved, 274 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1647/1649 variables, and 2415 constraints, problems are : Problem set: 0 solved, 274 unsolved in 30014 ms.
Refiners :[Generalized P Invariants (flows): 1062/1062 constraints, State Equation: 1353/1355 constraints, PredecessorRefiner: 274/274 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 274 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1334 variables, 720/720 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1334 variables, 0/720 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 2 (OVERLAPS) 19/1353 variables, 342/1062 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1353 variables, 0/1062 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 4 (OVERLAPS) 294/1647 variables, 1353/2415 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1647 variables, 272/2687 constraints. Problems are: Problem set: 0 solved, 274 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1647/1649 variables, and 2687 constraints, problems are : Problem set: 0 solved, 274 unsolved in 30018 ms.
Refiners :[Generalized P Invariants (flows): 1062/1062 constraints, State Equation: 1353/1355 constraints, PredecessorRefiner: 272/274 constraints, Known Traps: 0/0 constraints]
After SMT, in 60285ms problems are : Problem set: 0 solved, 274 unsolved
Search for dead transitions found 0 dead transitions in 60289ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 67739 ms. Remains : 1355/1355 places, 294/294 transitions.
Computed a total of 1355 stabilizing places and 294 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1355 transition count 294
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 96 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p2), (NOT p2)]
RANDOM walk for 40000 steps (1770 resets) in 140 ms. (283 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (172 resets) in 38 ms. (1025 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 653 steps, run visited all 1 properties in 4 ms. (steps per millisecond=163 )
Probabilistic random walk after 653 steps, saw 634 distinct states, run finished after 4 ms. (steps per millisecond=163 ) properties seen :1
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 113 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 77 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 65 ms :[(NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 4419 reset in 240 ms.
Product exploration explored 100000 steps with 4417 reset in 249 ms.
Built C files in :
/tmp/ltsmin13055185558863631664
[2024-05-25 17:22:18] [INFO ] Computing symmetric may disable matrix : 294 transitions.
[2024-05-25 17:22:18] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 17:22:18] [INFO ] Computing symmetric may enable matrix : 294 transitions.
[2024-05-25 17:22:18] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 17:22:18] [INFO ] Computing Do-Not-Accords matrix : 294 transitions.
[2024-05-25 17:22:18] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 17:22:18] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13055185558863631664
Running compilation step : cd /tmp/ltsmin13055185558863631664;'/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 1323 ms.
Running link step : cd /tmp/ltsmin13055185558863631664;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin13055185558863631664;'/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/stateBased7418025954874657335.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 20 out of 1355 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1355/1355 places, 294/294 transitions.
Graph (complete) has 9428 edges and 1355 vertex of which 1315 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.6 ms
Discarding 40 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Applied a total of 1 rules in 42 ms. Remains 1315 /1355 variables (removed 40) and now considering 292/294 (removed 2) transitions.
// Phase 1: matrix 292 rows 1315 cols
[2024-05-25 17:22:34] [INFO ] Computed 1026 invariants in 66 ms
[2024-05-25 17:22:35] [INFO ] Implicit Places using invariants in 1289 ms returned []
[2024-05-25 17:22:35] [INFO ] Invariant cache hit.
[2024-05-25 17:22:40] [INFO ] Implicit Places using invariants and state equation in 4808 ms returned []
Implicit Place search using SMT with State Equation took 6120 ms to find 0 implicit places.
[2024-05-25 17:22:40] [INFO ] Redundant transitions in 25 ms returned []
Running 272 sub problems to find dead transitions.
[2024-05-25 17:22:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1314 variables, 1026/1026 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1314 variables, 0/1026 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 2 (OVERLAPS) 292/1606 variables, 1314/2340 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1606 variables, 0/2340 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 4 (OVERLAPS) 1/1607 variables, 1/2341 constraints. Problems are: Problem set: 0 solved, 272 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1607/1607 variables, and 2341 constraints, problems are : Problem set: 0 solved, 272 unsolved in 30017 ms.
Refiners :[Generalized P Invariants (flows): 1026/1026 constraints, State Equation: 1315/1315 constraints, PredecessorRefiner: 272/272 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 272 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1314 variables, 1026/1026 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1314 variables, 0/1026 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 2 (OVERLAPS) 292/1606 variables, 1314/2340 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1606 variables, 272/2612 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1606 variables, 0/2612 constraints. Problems are: Problem set: 0 solved, 272 unsolved
SMT process timed out in 60292ms, After SMT, problems are : Problem set: 0 solved, 272 unsolved
Search for dead transitions found 0 dead transitions in 60295ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1315/1355 places, 292/294 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 66492 ms. Remains : 1315/1355 places, 292/294 transitions.
Built C files in :
/tmp/ltsmin5206731805204634319
[2024-05-25 17:23:40] [INFO ] Computing symmetric may disable matrix : 292 transitions.
[2024-05-25 17:23:40] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 17:23:40] [INFO ] Computing symmetric may enable matrix : 292 transitions.
[2024-05-25 17:23:40] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 17:23:40] [INFO ] Computing Do-Not-Accords matrix : 292 transitions.
[2024-05-25 17:23:40] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 17:23:40] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5206731805204634319
Running compilation step : cd /tmp/ltsmin5206731805204634319;'/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 1280 ms.
Running link step : cd /tmp/ltsmin5206731805204634319;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin5206731805204634319;'/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/stateBased8411794317474893458.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-25 17:23:55] [INFO ] Flatten gal took : 25 ms
[2024-05-25 17:23:55] [INFO ] Flatten gal took : 25 ms
[2024-05-25 17:23:55] [INFO ] Time to serialize gal into /tmp/LTL8638612890080658914.gal : 4 ms
[2024-05-25 17:23:55] [INFO ] Time to serialize properties into /tmp/LTL5290643177223004752.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/LTL8638612890080658914.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12889167323408633984.hoa' '-atoms' '/tmp/LTL5290643177223004752.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/LTL5290643177223004752.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12889167323408633984.hoa
Detected timeout of ITS tools.
[2024-05-25 17:24:10] [INFO ] Flatten gal took : 32 ms
[2024-05-25 17:24:10] [INFO ] Flatten gal took : 25 ms
[2024-05-25 17:24:10] [INFO ] Time to serialize gal into /tmp/LTL11989289171159401047.gal : 4 ms
[2024-05-25 17:24:10] [INFO ] Time to serialize properties into /tmp/LTL10197613069203627724.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/LTL11989289171159401047.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10197613069203627724.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((("(AstopOK>=1)")U(X(X(G(("(AstopOK>=1)")||(X(G((F(G("((((((s6_0+s6_1)+(s6_2+s6_3))+((s6_4+s6_5)+(s6_6+s6_7)))+(((s6_8+s6_9)+(s6_10+...617
Formula 0 simplified : !"(AstopOK>=1)" R XXF(!"(AstopOK>=1)" & XF(GF!"((((((s6_0+s6_1)+(s6_2+s6_3))+((s6_4+s6_5)+(s6_6+s6_7)))+(((s6_8+s6_9)+(s6_10+s6_11))...601
Detected timeout of ITS tools.
[2024-05-25 17:24:25] [INFO ] Flatten gal took : 29 ms
[2024-05-25 17:24:25] [INFO ] Applying decomposition
[2024-05-25 17:24:25] [INFO ] Flatten gal took : 25 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/graph6197927352667210803.txt' '-o' '/tmp/graph6197927352667210803.bin' '-w' '/tmp/graph6197927352667210803.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6197927352667210803.bin' '-l' '-1' '-v' '-w' '/tmp/graph6197927352667210803.weights' '-q' '0' '-e' '0.001'
[2024-05-25 17:24:25] [INFO ] Decomposing Gal with order
[2024-05-25 17:24:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 17:24:26] [INFO ] Removed a total of 232 redundant transitions.
[2024-05-25 17:24:26] [INFO ] Flatten gal took : 46 ms
[2024-05-25 17:24:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 185 labels/synchronizations in 21 ms.
[2024-05-25 17:24:26] [INFO ] Time to serialize gal into /tmp/LTL13363649674566345712.gal : 74 ms
[2024-05-25 17:24:26] [INFO ] Time to serialize properties into /tmp/LTL3285935417350863572.ltl : 15 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13363649674566345712.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3285935417350863572.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 : !((("(gi1.gi4.gu93.AstopOK>=1)")U(X(X(G(("(gi1.gi4.gu93.AstopOK>=1)")||(X(G((F(G("((((((gu92.s6_0+gu92.s6_1)+(gu92.s6_2+gu92.s6_3))+((...933
Formula 0 simplified : !"(gi1.gi4.gu93.AstopOK>=1)" R XXF(!"(gi1.gi4.gu93.AstopOK>=1)" & XF(GF!"((((((gu92.s6_0+gu92.s6_1)+(gu92.s6_2+gu92.s6_3))+((gu92.s6...917
Detected timeout of ITS tools.
Treatment of property QuasiCertifProtocol-COL-18-LTLCardinality-04 finished in 281584 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((F(p0)&&X(p1)))||(F(p1)&&F(p2))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X(F(p1))||p0))))'
[2024-05-25 17:24:41] [INFO ] Flatten gal took : 29 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin6894886043484616689
[2024-05-25 17:24:41] [INFO ] Applying decomposition
[2024-05-25 17:24:41] [INFO ] Computing symmetric may disable matrix : 296 transitions.
[2024-05-25 17:24:41] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 17:24:41] [INFO ] Computing symmetric may enable matrix : 296 transitions.
[2024-05-25 17:24:41] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 17:24:41] [INFO ] Computing Do-Not-Accords matrix : 296 transitions.
[2024-05-25 17:24:41] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 17:24:41] [INFO ] Flatten gal took : 27 ms
[2024-05-25 17:24:41] [INFO ] Built C files in 40ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6894886043484616689
Running compilation step : cd /tmp/ltsmin6894886043484616689;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '144' '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/graph3310017100602766202.txt' '-o' '/tmp/graph3310017100602766202.bin' '-w' '/tmp/graph3310017100602766202.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3310017100602766202.bin' '-l' '-1' '-v' '-w' '/tmp/graph3310017100602766202.weights' '-q' '0' '-e' '0.001'
[2024-05-25 17:24:42] [INFO ] Decomposing Gal with order
[2024-05-25 17:24:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 17:24:42] [INFO ] Removed a total of 161 redundant transitions.
[2024-05-25 17:24:42] [INFO ] Flatten gal took : 46 ms
[2024-05-25 17:24:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 42 labels/synchronizations in 3 ms.
[2024-05-25 17:24:42] [INFO ] Time to serialize gal into /tmp/LTLCardinality15417214210536553599.gal : 5 ms
[2024-05-25 17:24:42] [INFO ] Time to serialize properties into /tmp/LTLCardinality12865627065660314355.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/LTLCardinality15417214210536553599.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality12865627065660314355.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 5 LTL properties
Checking formula 0 : !((F(("(((((((gu4.n1_0+gu4.n1_1)+(gu4.n1_2+gu4.n1_3))+((gu4.n1_4+gu4.n1_5)+(gu4.n1_6+gu4.n1_7)))+(((gu4.n1_8+gu4.n1_9)+(gu4.n1_10+gu4....1053
Formula 0 simplified : G(!"(((((((gu4.n1_0+gu4.n1_1)+(gu4.n1_2+gu4.n1_3))+((gu4.n1_4+gu4.n1_5)+(gu4.n1_6+gu4.n1_7)))+(((gu4.n1_8+gu4.n1_9)+(gu4.n1_10+gu4.n...1047
Compilation finished in 1409 ms.
Running link step : cd /tmp/ltsmin6894886043484616689;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin6894886043484616689;'/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 78525 ms.
FORMULA QuasiCertifProtocol-COL-18-LTLCardinality-02 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin6894886043484616689;'/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'
WARNING : LTSmin timed out (>144 s) on command cd /tmp/ltsmin6894886043484616689;'/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'
Running LTSmin : cd /tmp/ltsmin6894886043484616689;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(X((<>((LTLAPp5==true))&&X((LTLAPp6==true))))||(<>((LTLAPp6==true))&&<>((LTLAPp7==true))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>144 s) on command cd /tmp/ltsmin6894886043484616689;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(X((<>((LTLAPp5==true))&&X((LTLAPp6==true))))||(<>((LTLAPp6==true))&&<>((LTLAPp7==true))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin6894886043484616689;'/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' '<>([]((LTLAPp8==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>144 s) on command cd /tmp/ltsmin6894886043484616689;'/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' '<>([]((LTLAPp8==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin6894886043484616689;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([]((X(<>((LTLAPp10==true)))||(LTLAPp9==true))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>144 s) on command cd /tmp/ltsmin6894886043484616689;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([]((X(<>((LTLAPp10==true)))||(LTLAPp9==true))))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 5760 s
Running LTSmin : cd /tmp/ltsmin6894886043484616689;'/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.004: Loading model from ./gal.so
pins2lts-mc-linux64( 1/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.019: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.019: LTL layer: formula: ((LTLAPp2==true) U X(X([](((LTLAPp2==true)||X([]((<>([]((LTLAPp3==true))) U (LTLAPp4==true)))))))))
pins2lts-mc-linux64( 3/ 8), 0.019: "((LTLAPp2==true) U X(X([](((LTLAPp2==true)||X([]((<>([]((LTLAPp3==true))) U (LTLAPp4==true)))))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 4/ 8), 0.023: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.035: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.036: Using Spin LTL semantics
pins2lts-mc-linux64( 2/ 8), 0.036: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.037: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.045: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.051: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.059: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.211: There are 308 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.211: State length is 1379, there are 320 groups
pins2lts-mc-linux64( 0/ 8), 0.211: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.211: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.211: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.211: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 5/ 8), 0.291: [Blue] ~22 levels ~960 states ~4440 transitions
pins2lts-mc-linux64( 0/ 8), 0.331: [Blue] ~22 levels ~1920 states ~9856 transitions
pins2lts-mc-linux64( 0/ 8), 0.395: [Blue] ~22 levels ~3840 states ~19000 transitions
pins2lts-mc-linux64( 2/ 8), 0.538: [Blue] ~23 levels ~7680 states ~35048 transitions
pins2lts-mc-linux64( 4/ 8), 0.768: [Blue] ~22 levels ~15360 states ~72792 transitions
pins2lts-mc-linux64( 1/ 8), 1.134: [Blue] ~22 levels ~30720 states ~151576 transitions
pins2lts-mc-linux64( 1/ 8), 1.806: [Blue] ~22 levels ~61440 states ~305096 transitions
pins2lts-mc-linux64( 1/ 8), 3.196: [Blue] ~23 levels ~122880 states ~657912 transitions
pins2lts-mc-linux64( 1/ 8), 5.888: [Blue] ~23 levels ~245760 states ~1457920 transitions
pins2lts-mc-linux64( 1/ 8), 10.708: [Blue] ~23 levels ~491520 states ~2897352 transitions
pins2lts-mc-linux64( 3/ 8), 19.853: [Blue] ~23 levels ~983040 states ~5960288 transitions
pins2lts-mc-linux64( 3/ 8), 38.356: [Blue] ~24 levels ~1966080 states ~13083816 transitions
pins2lts-mc-linux64( 1/ 8), 75.013: [Blue] ~24 levels ~3932160 states ~26620392 transitions
pins2lts-mc-linux64( 1/ 8), 150.729: [Blue] ~24 levels ~7864320 states ~55348392 transitions
pins2lts-mc-linux64( 5/ 8), 186.976: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 187.120:
pins2lts-mc-linux64( 0/ 8), 187.120: Explored 9022026 states 67847349 transitions, fanout: 7.520
pins2lts-mc-linux64( 0/ 8), 187.120: Total exploration time 186.890 sec (186.750 sec minimum, 186.824 sec on average)
pins2lts-mc-linux64( 0/ 8), 187.120: States per second: 48275, Transitions per second: 363034
pins2lts-mc-linux64( 0/ 8), 187.120:
pins2lts-mc-linux64( 0/ 8), 187.120: State space has 9020160 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 187.120: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 187.120: blue states: 9022026 (100.02%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 187.120: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 187.120: all-red states: 0 (0.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 187.120:
pins2lts-mc-linux64( 0/ 8), 187.120: Total memory used for local state coloring: 0.0MB
pins2lts-mc-linux64( 0/ 8), 187.120:
pins2lts-mc-linux64( 0/ 8), 187.120: Queue width: 8B, total height: 197, memory: 0.00MB
pins2lts-mc-linux64( 0/ 8), 187.120: Tree memory: 324.8MB, 37.8 B/state, compr.: 0.7%
pins2lts-mc-linux64( 0/ 8), 187.120: Tree fill ratio (roots/leafs): 6.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 187.120: Stored 298 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 187.120: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 187.120: Est. total memory use: 324.8MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin6894886043484616689;'/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/ltsmin6894886043484616689;'/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:121)
at java.base/java.lang.Thread.run(Thread.java:840)
ITS-tools command line returned an error code 137
[2024-05-25 17:43:51] [INFO ] Applying decomposition
[2024-05-25 17:43:51] [INFO ] Flatten gal took : 27 ms
[2024-05-25 17:43:51] [INFO ] Decomposing Gal with order
[2024-05-25 17:43:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 17:43:51] [WARNING] Could not apply decomposition. Using flat GAL structure.
java.lang.RuntimeException: Could not find partition element corresponding to malicious_reservoir in partition [n6_0, n5_0, n4_0, n3_0, n2_0, n1_0, c1_0, Sstart_0, s2_0, s3_0, s4_0, s5_0, s6_0, SstopOK_0, CstopOK_0],[n6_1, n5_1, n4_1, n3_1, n2_1, n1_1, c1_1, Sstart_1, s2_1, s3_1, s4_1, s5_1, s6_1, SstopOK_1, CstopOK_1],[n6_2, n5_2, n4_2, n3_2, n2_2, n1_2, c1_2, Sstart_2, s2_2, s3_2, s4_2, s5_2, s6_2, SstopOK_2, CstopOK_2],[n6_3, n5_3, n4_3, n3_3, n2_3, n1_3, c1_3, Sstart_3, s2_3, s3_3, s4_3, s5_3, s6_3, SstopOK_3, CstopOK_3],[n6_4, n5_4, n4_4, n3_4, n2_4, n1_4, c1_4, Sstart_4, s2_4, s3_4, s4_4, s5_4, s6_4, SstopOK_4, CstopOK_4],[n6_5, n5_5, n4_5, n3_5, n2_5, n1_5, c1_5, Sstart_5, s2_5, s3_5, s4_5, s5_5, s6_5, SstopOK_5, CstopOK_5],[n6_6, n5_6, n4_6, n3_6, n2_6, n1_6, c1_6, Sstart_6, s2_6, s3_6, s4_6, s5_6, s6_6, SstopOK_6, CstopOK_6],[n6_7, n5_7, n4_7, n3_7, n2_7, n1_7, c1_7, Sstart_7, s2_7, s3_7, s4_7, s5_7, s6_7, SstopOK_7, CstopOK_7],[n6_8, n5_8, n4_8, n3_8, n2_8, n1_8, c1_8, Sstart_8, s2_8, s3_8, s4_8, s5_8, s6_8, SstopOK_8, CstopOK_8],[n6_9, n5_9, n4_9, n3_9, n2_9, n1_9, c1_9, Sstart_9, s2_9, s3_9, s4_9, s5_9, s6_9, SstopOK_9, CstopOK_9],[n6_10, n5_10, n4_10, n3_10, n2_10, n1_10, c1_10, Sstart_10, s2_10, s3_10, s4_10, s5_10, s6_10, SstopOK_10, CstopOK_10],[n6_11, n5_11, n4_11, n3_11, n2_11, n1_11, c1_11, Sstart_11, s2_11, s3_11, s4_11, s5_11, s6_11, SstopOK_11, CstopOK_11],[n6_12, n5_12, n4_12, n3_12, n2_12, n1_12, c1_12, Sstart_12, s2_12, s3_12, s4_12, s5_12, s6_12, SstopOK_12, CstopOK_12],[n6_13, n5_13, n4_13, n3_13, n2_13, n1_13, c1_13, Sstart_13, s2_13, s3_13, s4_13, s5_13, s6_13, SstopOK_13, CstopOK_13],[n6_14, n5_14, n4_14, n3_14, n2_14, n1_14, c1_14, Sstart_14, s2_14, s3_14, s4_14, s5_14, s6_14, SstopOK_14, CstopOK_14],[n6_15, n5_15, n4_15, n3_15, n2_15, n1_15, c1_15, Sstart_15, s2_15, s3_15, s4_15, s5_15, s6_15, SstopOK_15, CstopOK_15],[n6_16, n5_16, n4_16, n3_16, n2_16, n1_16, c1_16, Sstart_16, s2_16, s3_16, s4_16, s5_16, s6_16, SstopOK_16, CstopOK_16],[n6_17, n5_17, n4_17, n3_17, n2_17, n1_17, c1_17, Sstart_17, s2_17, s3_17, s4_17, s5_17, s6_17, SstopOK_17, CstopOK_17],[n6_18, n5_18, n4_18, n3_18, n2_18, n1_18, c1_18, Sstart_18, s2_18, s3_18, s4_18, s5_18, s6_18, SstopOK_18, CstopOK_18],[n9_0, n8_0, n7_0],[n9_1, n8_1, n7_1],[n9_2, n8_2, n7_2],[n9_3, n8_3, n7_3],[n9_4, n8_4, n7_4],[n9_5, n8_5, n7_5],[n9_6, n8_6, n7_6],[n9_7, n8_7, n7_7],[n9_8, n8_8, n7_8],[n9_9, n8_9, n7_9],[n9_10, n8_10, n7_10],[n9_11, n8_11, n7_11],[n9_12, n8_12, n7_12],[n9_13, n8_13, n7_13],[n9_14, n8_14, n7_14],[n9_15, n8_15, n7_15],[n9_16, n8_16, n7_16],[n9_17, n8_17, n7_17],[n9_18, n8_18, n7_18],[n9_19, n8_19, n7_19],[n9_20, n8_20, n7_20],[n9_21, n8_21, n7_21],[n9_22, n8_22, n7_22],[n9_23, n8_23, n7_23],[n9_24, n8_24, n7_24],[n9_25, n8_25, n7_25],[n9_26, n8_26, n7_26],[n9_27, n8_27, n7_27],[n9_28, n8_28, n7_28],[n9_29, n8_29, n7_29],[n9_30, n8_30, n7_30],[n9_31, n8_31, n7_31],[n9_32, n8_32, n7_32],[n9_33, n8_33, n7_33],[n9_34, n8_34, n7_34],[n9_35, n8_35, n7_35],[n9_36, n8_36, n7_36],[n9_37, n8_37, n7_37],[n9_38, n8_38, n7_38],[n9_39, n8_39, n7_39],[n9_40, n8_40, n7_40],[n9_41, n8_41, n7_41],[n9_42, n8_42, n7_42],[n9_43, n8_43, n7_43],[n9_44, n8_44, n7_44],[n9_45, n8_45, n7_45],[n9_46, n8_46, n7_46],[n9_47, n8_47, n7_47],[n9_48, n8_48, n7_48],[n9_49, n8_49, n7_49],[n9_50, n8_50, n7_50],[n9_51, n8_51, n7_51],[n9_52, n8_52, n7_52],[n9_53, n8_53, n7_53],[n9_54, n8_54, n7_54],[n9_55, n8_55, n7_55],[n9_56, n8_56, n7_56],[n9_57, n8_57, n7_57],[n9_58, n8_58, n7_58],[n9_59, n8_59, n7_59],[n9_60, n8_60, n7_60],[n9_61, n8_61, n7_61],[n9_62, n8_62, n7_62],[n9_63, n8_63, n7_63],[n9_64, n8_64, n7_64],[n9_65, n8_65, n7_65],[n9_66, n8_66, n7_66],[n9_67, n8_67, n7_67],[n9_68, n8_68, n7_68],[n9_69, n8_69, n7_69],[n9_70, n8_70, n7_70],[n9_71, n8_71, n7_71],[n9_72, n8_72, n7_72],[n9_73, n8_73, n7_73],[n9_74, n8_74, n7_74],[n9_75, n8_75, n7_75],[n9_76, n8_76, n7_76],[n9_77, n8_77, n7_77],[n9_78, n8_78, n7_78],[n9_79, n8_79, n7_79],[n9_80, n8_80, n7_80],[n9_81, n8_81, n7_81],[n9_82, n8_82, n7_82],[n9_83, n8_83, n7_83],[n9_84, n8_84, n7_84],[n9_85, n8_85, n7_85],[n9_86, n8_86, n7_86],[n9_87, n8_87, n7_87],[n9_88, n8_88, n7_88],[n9_89, n8_89, n7_89],[n9_90, n8_90, n7_90],[n9_91, n8_91, n7_91],[n9_92, n8_92, n7_92],[n9_93, n8_93, n7_93],[n9_94, n8_94, n7_94],[n9_95, n8_95, n7_95],[n9_96, n8_96, n7_96],[n9_97, n8_97, n7_97],[n9_98, n8_98, n7_98],[n9_99, n8_99, n7_99],[n9_100, n8_100, n7_100],[n9_101, n8_101, n7_101],[n9_102, n8_102, n7_102],[n9_103, n8_103, n7_103],[n9_104, n8_104, n7_104],[n9_105, n8_105, n7_105],[n9_106, n8_106, n7_106],[n9_107, n8_107, n7_107],[n9_108, n8_108, n7_108],[n9_109, n8_109, n7_109],[n9_110, n8_110, n7_110],[n9_111, n8_111, n7_111],[n9_112, n8_112, n7_112],[n9_113, n8_113, n7_113],[n9_114, n8_114, n7_114],[n9_115, n8_115, n7_115],[n9_116, n8_116, n7_116],[n9_117, n8_117, n7_117],[n9_118, n8_118, n7_118],[n9_119, n8_119, n7_119],[n9_120, n8_120, n7_120],[n9_121, n8_121, n7_121],[n9_122, n8_122, n7_122],[n9_123, n8_123, n7_123],[n9_124, n8_124, n7_124],[n9_125, n8_125, n7_125],[n9_126, n8_126, n7_126],[n9_127, n8_127, n7_127],[n9_128, n8_128, n7_128],[n9_129, n8_129, n7_129],[n9_130, n8_130, n7_130],[n9_131, n8_131, n7_131],[n9_132, n8_132, n7_132],[n9_133, n8_133, n7_133],[n9_134, n8_134, n7_134],[n9_135, n8_135, n7_135],[n9_136, n8_136, n7_136],[n9_137, n8_137, n7_137],[n9_138, n8_138, n7_138],[n9_139, n8_139, n7_139],[n9_140, n8_140, n7_140],[n9_141, n8_141, n7_141],[n9_142, n8_142, n7_142],[n9_143, n8_143, n7_143],[n9_144, n8_144, n7_144],[n9_145, n8_145, n7_145],[n9_146, n8_146, n7_146],[n9_147, n8_147, n7_147],[n9_148, n8_148, n7_148],[n9_149, n8_149, n7_149],[n9_150, n8_150, n7_150],[n9_151, n8_151, n7_151],[n9_152, n8_152, n7_152],[n9_153, n8_153, n7_153],[n9_154, n8_154, n7_154],[n9_155, n8_155, n7_155],[n9_156, n8_156, n7_156],[n9_157, n8_157, n7_157],[n9_158, n8_158, n7_158],[n9_159, n8_159, n7_159],[n9_160, n8_160, n7_160],[n9_161, n8_161, n7_161],[n9_162, n8_162, n7_162],[n9_163, n8_163, n7_163],[n9_164, n8_164, n7_164],[n9_165, n8_165, n7_165],[n9_166, n8_166, n7_166],[n9_167, n8_167, n7_167],[n9_168, n8_168, n7_168],[n9_169, n8_169, n7_169],[n9_170, n8_170, n7_170],[n9_171, n8_171, n7_171],[n9_172, n8_172, n7_172],[n9_173, n8_173, n7_173],[n9_174, n8_174, n7_174],[n9_175, n8_175, n7_175],[n9_176, n8_176, n7_176],[n9_177, n8_177, n7_177],[n9_178, n8_178, n7_178],[n9_179, n8_179, n7_179],[n9_180, n8_180, n7_180],[n9_181, n8_181, n7_181],[n9_182, n8_182, n7_182],[n9_183, n8_183, n7_183],[n9_184, n8_184, n7_184],[n9_185, n8_185, n7_185],[n9_186, n8_186, n7_186],[n9_187, n8_187, n7_187],[n9_188, n8_188, n7_188],[n9_189, n8_189, n7_189],[n9_190, n8_190, n7_190],[n9_191, n8_191, n7_191],[n9_192, n8_192, n7_192],[n9_193, n8_193, n7_193],[n9_194, n8_194, n7_194],[n9_195, n8_195, n7_195],[n9_196, n8_196, n7_196],[n9_197, n8_197, n7_197],[n9_198, n8_198, n7_198],[n9_199, n8_199, n7_199],[n9_200, n8_200, n7_200],[n9_201, n8_201, n7_201],[n9_202, n8_202, n7_202],[n9_203, n8_203, n7_203],[n9_204, n8_204, n7_204],[n9_205, n8_205, n7_205],[n9_206, n8_206, n7_206],[n9_207, n8_207, n7_207],[n9_208, n8_208, n7_208],[n9_209, n8_209, n7_209],[n9_210, n8_210, n7_210],[n9_211, n8_211, n7_211],[n9_212, n8_212, n7_212],[n9_213, n8_213, n7_213],[n9_214, n8_214, n7_214],[n9_215, n8_215, n7_215],[n9_216, n8_216, n7_216],[n9_217, n8_217, n7_217],[n9_218, n8_218, n7_218],[n9_219, n8_219, n7_219],[n9_220, n8_220, n7_220],[n9_221, n8_221, n7_221],[n9_222, n8_222, n7_222],[n9_223, n8_223, n7_223],[n9_224, n8_224, n7_224],[n9_225, n8_225, n7_225],[n9_226, n8_226, n7_226],[n9_227, n8_227, n7_227],[n9_228, n8_228, n7_228],[n9_229, n8_229, n7_229],[n9_230, n8_230, n7_230],[n9_231, n8_231, n7_231],[n9_232, n8_232, n7_232],[n9_233, n8_233, n7_233],[n9_234, n8_234, n7_234],[n9_235, n8_235, n7_235],[n9_236, n8_236, n7_236],[n9_237, n8_237, n7_237],[n9_238, n8_238, n7_238],[n9_239, n8_239, n7_239],[n9_240, n8_240, n7_240],[n9_241, n8_241, n7_241],[n9_242, n8_242, n7_242],[n9_243, n8_243, n7_243],[n9_244, n8_244, n7_244],[n9_245, n8_245, n7_245],[n9_246, n8_246, n7_246],[n9_247, n8_247, n7_247],[n9_248, n8_248, n7_248],[n9_249, n8_249, n7_249],[n9_250, n8_250, n7_250],[n9_251, n8_251, n7_251],[n9_252, n8_252, n7_252],[n9_253, n8_253, n7_253],[n9_254, n8_254, n7_254],[n9_255, n8_255, n7_255],[n9_256, n8_256, n7_256],[n9_257, n8_257, n7_257],[n9_258, n8_258, n7_258],[n9_259, n8_259, n7_259],[n9_260, n8_260, n7_260],[n9_261, n8_261, n7_261],[n9_262, n8_262, n7_262],[n9_263, n8_263, n7_263],[n9_264, n8_264, n7_264],[n9_265, n8_265, n7_265],[n9_266, n8_266, n7_266],[n9_267, n8_267, n7_267],[n9_268, n8_268, n7_268],[n9_269, n8_269, n7_269],[n9_270, n8_270, n7_270],[n9_271, n8_271, n7_271],[n9_272, n8_272, n7_272],[n9_273, n8_273, n7_273],[n9_274, n8_274, n7_274],[n9_275, n8_275, n7_275],[n9_276, n8_276, n7_276],[n9_277, n8_277, n7_277],[n9_278, n8_278, n7_278],[n9_279, n8_279, n7_279],[n9_280, n8_280, n7_280],[n9_281, n8_281, n7_281],[n9_282, n8_282, n7_282],[n9_283, n8_283, n7_283],[n9_284, n8_284, n7_284],[n9_285, n8_285, n7_285],[n9_286, n8_286, n7_286],[n9_287, n8_287, n7_287],[n9_288, n8_288, n7_288],[n9_289, n8_289, n7_289],[n9_290, n8_290, n7_290],[n9_291, n8_291, n7_291],[n9_292, n8_292, n7_292],[n9_293, n8_293, n7_293],[n9_294, n8_294, n7_294],[n9_295, n8_295, n7_295],[n9_296, n8_296, n7_296],[n9_297, n8_297, n7_297],[n9_298, n8_298, n7_298],[n9_299, n8_299, n7_299],[n9_300, n8_300, n7_300],[n9_301, n8_301, n7_301],[n9_302, n8_302, n7_302],[n9_303, n8_303, n7_303],[n9_304, n8_304, n7_304],[n9_305, n8_305, n7_305],[n9_306, n8_306, n7_306],[n9_307, n8_307, n7_307],[n9_308, n8_308, n7_308],[n9_309, n8_309, n7_309],[n9_310, n8_310, n7_310],[n9_311, n8_311, n7_311],[n9_312, n8_312, n7_312],[n9_313, n8_313, n7_313],[n9_314, n8_314, n7_314],[n9_315, n8_315, n7_315],[n9_316, n8_316, n7_316],[n9_317, n8_317, n7_317],[n9_318, n8_318, n7_318],[n9_319, n8_319, n7_319],[n9_320, n8_320, n7_320],[n9_321, n8_321, n7_321],[n9_322, n8_322, n7_322],[n9_323, n8_323, n7_323],[n9_324, n8_324, n7_324],[n9_325, n8_325, n7_325],[n9_326, n8_326, n7_326],[n9_327, n8_327, n7_327],[n9_328, n8_328, n7_328],[n9_329, n8_329, n7_329],[n9_330, n8_330, n7_330],[n9_331, n8_331, n7_331],[n9_332, n8_332, n7_332],[n9_333, n8_333, n7_333],[n9_334, n8_334, n7_334],[n9_335, n8_335, n7_335],[n9_336, n8_336, n7_336],[n9_337, n8_337, n7_337],[n9_338, n8_338, n7_338],[n9_339, n8_339, n7_339],[n9_340, n8_340, n7_340],[n9_341, n8_341, n7_341],[n9_342, n8_342, n7_342],[n9_343, n8_343, n7_343],[n9_344, n8_344, n7_344],[n9_345, n8_345, n7_345],[n9_346, n8_346, n7_346],[n9_347, n8_347, n7_347],[n9_348, n8_348, n7_348],[n9_349, n8_349, n7_349],[n9_350, n8_350, n7_350],[n9_351, n8_351, n7_351],[n9_352, n8_352, n7_352],[n9_353, n8_353, n7_353],[n9_354, n8_354, n7_354],[n9_355, n8_355, n7_355],[n9_356, n8_356, n7_356],[n9_357, n8_357, n7_357],[n9_358, n8_358, n7_358],[n9_359, n8_359, n7_359],[n9_360, n8_360, n7_360],

at fr.lip6.move.gal.instantiate.CompositeBuilder$Partition.getIndex(CompositeBuilder.java:1421)
at fr.lip6.move.gal.instantiate.CompositeBuilder.galToCompositeWithPartition(CompositeBuilder.java:556)
at fr.lip6.move.gal.instantiate.CompositeBuilder.decomposeWithOrder(CompositeBuilder.java:147)
at fr.lip6.move.gal.application.mcc.MccTranslator.applyOrder(MccTranslator.java:133)
at fr.lip6.move.gal.application.mcc.MccTranslator.flattenSpec(MccTranslator.java:230)
at fr.lip6.move.gal.application.runner.its.MultiOrderRunner.runMultiITS(MultiOrderRunner.java:124)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:1011)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-25 17:43:51] [INFO ] Flatten gal took : 26 ms
[2024-05-25 17:43:51] [INFO ] Time to serialize gal into /tmp/LTLCardinality8250504055752389250.gal : 4 ms
[2024-05-25 17:43:51] [INFO ] Time to serialize properties into /tmp/LTLCardinality4467477737596214538.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/LTLCardinality8250504055752389250.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality4467477737596214538.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...297
Read 4 LTL properties
Checking formula 0 : !((("(AstopOK>=1)")U(X(X(G(("(AstopOK>=1)")||(X(G((F(G("((((((s6_0+s6_1)+(s6_2+s6_3))+((s6_4+s6_5)+(s6_6+s6_7)))+(((s6_8+s6_9)+(s6_10+...617
Formula 0 simplified : !"(AstopOK>=1)" R XXF(!"(AstopOK>=1)" & XF(GF!"((((((s6_0+s6_1)+(s6_2+s6_3))+((s6_4+s6_5)+(s6_6+s6_7)))+(((s6_8+s6_9)+(s6_10+s6_11))...601

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

tar xzf /home/mcc/BenchKit/INPUTS/QuasiCertifProtocol-COL-18.tgz
mv QuasiCertifProtocol-COL-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 ;