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.r311-tall-171662335700043.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 greatspnxred
Input is QuasiCertifProtocol-COL-28, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r311-tall-171662335700043
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 648K
-rw-r--r-- 1 mcc users 7.5K Apr 13 03:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Apr 13 03:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Apr 13 03:37 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Apr 13 03:37 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.2K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 13 04:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 154K Apr 13 04:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 13 03:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 92K Apr 13 03:54 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 120K 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-28-LTLCardinality-00
FORMULA_NAME QuasiCertifProtocol-COL-28-LTLCardinality-01
FORMULA_NAME QuasiCertifProtocol-COL-28-LTLCardinality-02
FORMULA_NAME QuasiCertifProtocol-COL-28-LTLCardinality-03
FORMULA_NAME QuasiCertifProtocol-COL-28-LTLCardinality-04
FORMULA_NAME QuasiCertifProtocol-COL-28-LTLCardinality-05
FORMULA_NAME QuasiCertifProtocol-COL-28-LTLCardinality-06
FORMULA_NAME QuasiCertifProtocol-COL-28-LTLCardinality-07
FORMULA_NAME QuasiCertifProtocol-COL-28-LTLCardinality-08
FORMULA_NAME QuasiCertifProtocol-COL-28-LTLCardinality-09
FORMULA_NAME QuasiCertifProtocol-COL-28-LTLCardinality-10
FORMULA_NAME QuasiCertifProtocol-COL-28-LTLCardinality-11
FORMULA_NAME QuasiCertifProtocol-COL-28-LTLCardinality-12
FORMULA_NAME QuasiCertifProtocol-COL-28-LTLCardinality-13
FORMULA_NAME QuasiCertifProtocol-COL-28-LTLCardinality-14
FORMULA_NAME QuasiCertifProtocol-COL-28-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716651021087

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-COL-28
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-25 15:30:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-25 15:30:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 15:30:22] [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 15:30:22] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-25 15:30:22] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 604 ms
[2024-05-25 15:30:22] [INFO ] Imported 30 HL places and 26 HL transitions for a total of 2998 PT places and 446.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 15:30:23] [INFO ] Built PT skeleton of HLPN with 30 places and 26 transitions 77 arcs in 6 ms.
[2024-05-25 15:30:23] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 1 formulas.
FORMULA QuasiCertifProtocol-COL-28-LTLCardinality-03 FALSE 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 15 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 40046 steps (1016 resets) in 787 ms. (50 steps per ms) remains 17/31 properties
BEST_FIRST walk for 4007 steps (33 resets) in 89 ms. (44 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (33 resets) in 46 ms. (85 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (56 resets) in 107 ms. (37 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4009 steps (34 resets) in 84 ms. (47 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (32 resets) in 87 ms. (45 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4005 steps (29 resets) in 83 ms. (47 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4008 steps (55 resets) in 60 ms. (65 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (32 resets) in 98 ms. (40 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (32 resets) in 55 ms. (71 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4009 steps (33 resets) in 92 ms. (43 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (32 resets) in 77 ms. (51 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (32 resets) in 53 ms. (74 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (44 resets) in 116 ms. (34 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (31 resets) in 64 ms. (61 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (56 resets) in 72 ms. (54 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (44 resets) in 65 ms. (60 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4010 steps (33 resets) in 44 ms. (89 steps per ms) remains 17/17 properties
// Phase 1: matrix 26 rows 30 cols
[2024-05-25 15:30:23] [INFO ] Computed 5 invariants in 6 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp16 is UNSAT
At refinement iteration 1 (OVERLAPS) 9/28 variables, 5/5 constraints. Problems are: Problem set: 3 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/5 constraints. Problems are: Problem set: 3 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 26/54 variables, 28/33 constraints. Problems are: Problem set: 3 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/33 constraints. Problems are: Problem set: 3 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 2/56 variables, 2/35 constraints. Problems are: Problem set: 3 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/56 variables, 0/35 constraints. Problems are: Problem set: 3 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 0/56 variables, 0/35 constraints. Problems are: Problem set: 3 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 56/56 variables, and 35 constraints, problems are : Problem set: 3 solved, 14 unsolved in 412 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 10/27 variables, 5/5 constraints. Problems are: Problem set: 3 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/5 constraints. Problems are: Problem set: 3 solved, 14 unsolved
Problem AtomicPropp12 is UNSAT
At refinement iteration 3 (OVERLAPS) 26/53 variables, 27/32 constraints. Problems are: Problem set: 4 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 7/39 constraints. Problems are: Problem set: 4 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 0/39 constraints. Problems are: Problem set: 4 solved, 13 unsolved
At refinement iteration 6 (OVERLAPS) 3/56 variables, 3/42 constraints. Problems are: Problem set: 4 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/56 variables, 6/48 constraints. Problems are: Problem set: 4 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/56 variables, 0/48 constraints. Problems are: Problem set: 4 solved, 13 unsolved
At refinement iteration 9 (OVERLAPS) 0/56 variables, 0/48 constraints. Problems are: Problem set: 4 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 56/56 variables, and 48 constraints, problems are : Problem set: 4 solved, 13 unsolved in 385 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 13/17 constraints, Known Traps: 0/0 constraints]
After SMT, in 838ms problems are : Problem set: 4 solved, 13 unsolved
Fused 13 Parikh solutions to 10 different solutions.
Finished Parikh walk after 7839 steps, including 41 resets, run visited all 13 properties in 33 ms. (steps per millisecond=237 )
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 )
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 38 ms.
Successfully simplified 4 atomic propositions for a total of 15 simplifications.
FORMULA QuasiCertifProtocol-COL-28-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-28-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-28-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-28-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-25 15:30:24] [INFO ] Flatten gal took : 17 ms
[2024-05-25 15:30:24] [INFO ] Flatten gal took : 4 ms
Domain [tsid(29), tsid(29)] of place n9 breaks symmetries in sort tsid
[2024-05-25 15:30:24] [INFO ] Unfolded HLPN to a Petri net with 2998 places and 446 transitions 6489 arcs in 31 ms.
[2024-05-25 15:30:24] [INFO ] Unfolded 11 HLPN properties in 1 ms.
Support contains 2038 out of 2998 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2998/2998 places, 446/446 transitions.
Applied a total of 0 rules in 104 ms. Remains 2998 /2998 variables (removed 0) and now considering 446/446 (removed 0) transitions.
// Phase 1: matrix 446 rows 2998 cols
[2024-05-25 15:30:25] [INFO ] Computed 2553 invariants in 104 ms
[2024-05-25 15:30:26] [INFO ] Implicit Places using invariants in 1864 ms returned []
[2024-05-25 15:30:26] [INFO ] Invariant cache hit.
[2024-05-25 15:30:31] [INFO ] Implicit Places using invariants and state equation in 5044 ms returned []
Implicit Place search using SMT with State Equation took 6918 ms to find 0 implicit places.
Running 416 sub problems to find dead transitions.
[2024-05-25 15:30:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2935 variables, 1708/1708 constraints. Problems are: Problem set: 0 solved, 416 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2935/3444 variables, and 1708 constraints, problems are : Problem set: 0 solved, 416 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 0/4 constraints, Generalized P Invariants (flows): 1708/2549 constraints, State Equation: 0/2998 constraints, PredecessorRefiner: 416/416 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 416 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2935 variables, 1708/1708 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2935 variables, 0/1708 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 2 (OVERLAPS) 63/2998 variables, 4/1712 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2998 variables, 841/2553 constraints. Problems are: Problem set: 0 solved, 416 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2998/3444 variables, and 2553 constraints, problems are : Problem set: 0 solved, 416 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 2549/2549 constraints, State Equation: 0/2998 constraints, PredecessorRefiner: 0/416 constraints, Known Traps: 0/0 constraints]
After SMT, in 60901ms problems are : Problem set: 0 solved, 416 unsolved
Search for dead transitions found 0 dead transitions in 60912ms
Finished structural reductions in LTL mode , in 1 iterations and 67953 ms. Remains : 2998/2998 places, 446/446 transitions.
Support contains 2038 out of 2998 places after structural reductions.
[2024-05-25 15:31:33] [INFO ] Flatten gal took : 199 ms
[2024-05-25 15:31:33] [INFO ] Flatten gal took : 119 ms
[2024-05-25 15:31:33] [INFO ] Input system was already deterministic with 446 transitions.
Support contains 2037 out of 2998 places (down from 2038) after GAL structural reductions.
RANDOM walk for 40000 steps (1207 resets) in 3042 ms. (13 steps per ms) remains 15/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 52 ms. (75 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 111 ms. (35 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 108 ms. (36 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 140 ms. (28 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 15/15 properties
[2024-05-25 15:31:34] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1977 variables, 1624/1624 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1977 variables, 0/1624 constraints. Problems are: Problem set: 0 solved, 15 unsolved
Problem AtomicPropp6 is UNSAT
At refinement iteration 2 (OVERLAPS) 92/2069 variables, 3/1627 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2069 variables, 0/1627 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 4 (OVERLAPS) 1/2070 variables, 1/1628 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2070 variables, 0/1628 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 6 (OVERLAPS) 928/2998 variables, 925/2553 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2998 variables, 0/2553 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 8 (OVERLAPS) 446/3444 variables, 2998/5551 constraints. Problems are: Problem set: 1 solved, 14 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3444/3444 variables, and 5551 constraints, problems are : Problem set: 1 solved, 14 unsolved in 5027 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 2549/2549 constraints, State Equation: 2998/2998 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1977 variables, 1624/1624 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1977 variables, 0/1624 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 2 (OVERLAPS) 92/2069 variables, 3/1627 constraints. Problems are: Problem set: 1 solved, 14 unsolved
[2024-05-25 15:31:43] [INFO ] Deduced a trap composed of 5 places in 1205 ms of which 117 ms to minimize.
[2024-05-25 15:31:45] [INFO ] Deduced a trap composed of 5 places in 1114 ms of which 16 ms to minimize.
SMT process timed out in 11087ms, After SMT, problems are : Problem set: 1 solved, 14 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1977 out of 2998 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2998/2998 places, 446/446 transitions.
Graph (complete) has 30318 edges and 2998 vertex of which 2967 are kept as prefixes of interest. Removing 31 places using SCC suffix rule.16 ms
Discarding 31 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 58 transitions
Reduce isomorphic transitions removed 58 transitions.
Iterating post reduction 0 with 58 rules applied. Total rules applied 59 place count 2967 transition count 388
Applied a total of 59 rules in 96 ms. Remains 2967 /2998 variables (removed 31) and now considering 388/446 (removed 58) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 97 ms. Remains : 2967/2998 places, 388/446 transitions.
RANDOM walk for 40000 steps (1211 resets) in 2628 ms. (15 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (54 resets) in 287 ms. (138 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (57 resets) in 300 ms. (132 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (59 resets) in 810 ms. (49 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (54 resets) in 207 ms. (192 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (64 resets) in 205 ms. (194 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (52 resets) in 222 ms. (179 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (54 resets) in 195 ms. (204 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (58 resets) in 266 ms. (149 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (56 resets) in 162 ms. (245 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (55 resets) in 225 ms. (177 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (80 resets) in 254 ms. (156 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (55 resets) in 713 ms. (56 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (66 resets) in 749 ms. (53 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (80 resets) in 246 ms. (161 steps per ms) remains 14/14 properties
Finished probabilistic random walk after 5151 steps, run visited all 14 properties in 299 ms. (steps per millisecond=17 )
Probabilistic random walk after 5151 steps, saw 5002 distinct states, run finished after 302 ms. (steps per millisecond=17 ) properties seen :14
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
Computed a total of 2998 stabilizing places and 446 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2998 transition count 446
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' '!(F(G(p0)))'
Support contains 29 out of 2998 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2998/2998 places, 446/446 transitions.
Graph (complete) has 30318 edges and 2998 vertex of which 2906 are kept as prefixes of interest. Removing 92 places using SCC suffix rule.25 ms
Discarding 92 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 2903 transition count 441
Applied a total of 5 rules in 564 ms. Remains 2903 /2998 variables (removed 95) and now considering 441/446 (removed 5) transitions.
// Phase 1: matrix 441 rows 2903 cols
[2024-05-25 15:31:49] [INFO ] Computed 2464 invariants in 120 ms
[2024-05-25 15:31:53] [INFO ] Implicit Places using invariants in 4318 ms returned []
[2024-05-25 15:31:53] [INFO ] Invariant cache hit.
[2024-05-25 15:32:16] [INFO ] Implicit Places using invariants and state equation in 23445 ms returned [2640, 2641, 2642, 2643, 2644, 2645, 2646, 2647, 2648, 2649, 2650, 2651, 2652, 2653, 2654, 2655, 2656, 2657, 2658, 2659, 2660, 2661, 2662, 2663, 2664, 2665, 2666, 2667, 2668, 2698, 2699, 2700, 2701, 2702, 2703, 2704, 2705, 2706, 2707, 2708, 2709, 2710, 2711, 2712, 2713, 2714, 2715, 2716, 2717, 2718, 2719, 2720, 2721, 2722, 2723, 2724, 2725, 2726]
Discarding 58 places :
Implicit Place search using SMT with State Equation took 27783 ms to find 58 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 2845/2998 places, 441/446 transitions.
Applied a total of 0 rules in 205 ms. Remains 2845 /2845 variables (removed 0) and now considering 441/441 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 28553 ms. Remains : 2845/2998 places, 441/446 transitions.
Stuttering acceptance computed with spot in 158 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-28-LTLCardinality-00
Product exploration explored 100000 steps with 2815 reset in 532 ms.
Product exploration explored 100000 steps with 2811 reset in 474 ms.
Computed a total of 2845 stabilizing places and 441 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2845 transition count 441
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 26 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-COL-28-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-28-LTLCardinality-00 finished in 30259 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))&&F(p1))))'
Support contains 61 out of 2998 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2998/2998 places, 446/446 transitions.
Graph (complete) has 30318 edges and 2998 vertex of which 2937 are kept as prefixes of interest. Removing 61 places using SCC suffix rule.12 ms
Discarding 61 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 2936 transition count 445
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 2936 transition count 445
Applied a total of 4 rules in 539 ms. Remains 2936 /2998 variables (removed 62) and now considering 445/446 (removed 1) transitions.
// Phase 1: matrix 445 rows 2936 cols
[2024-05-25 15:32:19] [INFO ] Computed 2492 invariants in 43 ms
[2024-05-25 15:32:23] [INFO ] Implicit Places using invariants in 4202 ms returned []
[2024-05-25 15:32:23] [INFO ] Invariant cache hit.
[2024-05-25 15:32:34] [INFO ] Implicit Places using invariants and state equation in 10420 ms returned [2727, 2728, 2729, 2730, 2731, 2732, 2733, 2734, 2735, 2736, 2737, 2738, 2739, 2740, 2741, 2742, 2743, 2744, 2745, 2746, 2747, 2748, 2749, 2750, 2751, 2752, 2753, 2754, 2755]
Discarding 29 places :
Implicit Place search using SMT with State Equation took 14626 ms to find 29 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 2907/2998 places, 445/446 transitions.
Applied a total of 0 rules in 170 ms. Remains 2907 /2907 variables (removed 0) and now considering 445/445 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 15335 ms. Remains : 2907/2998 places, 445/446 transitions.
Stuttering acceptance computed with spot in 119 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-COL-28-LTLCardinality-01
Stuttering criterion allowed to conclude after 31 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-COL-28-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-28-LTLCardinality-01 finished in 15477 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) U (p1||G(!p0))))'
Support contains 843 out of 2998 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2998/2998 places, 446/446 transitions.
Graph (complete) has 30318 edges and 2998 vertex of which 2938 are kept as prefixes of interest. Removing 60 places using SCC suffix rule.8 ms
Discarding 60 places :
Also discarding 0 output 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 2935 transition count 443
Applied a total of 5 rules in 200 ms. Remains 2935 /2998 variables (removed 63) and now considering 443/446 (removed 3) transitions.
// Phase 1: matrix 443 rows 2935 cols
[2024-05-25 15:32:34] [INFO ] Computed 2493 invariants in 67 ms
[2024-05-25 15:32:37] [INFO ] Implicit Places using invariants in 2648 ms returned []
[2024-05-25 15:32:37] [INFO ] Invariant cache hit.
[2024-05-25 15:32:51] [INFO ] Implicit Places using invariants and state equation in 14639 ms returned [2670, 2671, 2672, 2673, 2674, 2675, 2676, 2677, 2678, 2679, 2680, 2681, 2682, 2683, 2684, 2685, 2686, 2687, 2688, 2689, 2690, 2691, 2692, 2693, 2694, 2695, 2696, 2697, 2698, 2728, 2729, 2730, 2731, 2732, 2733, 2734, 2735, 2736, 2737, 2738, 2739, 2740, 2741, 2742, 2743, 2744, 2745, 2746, 2747, 2748, 2749, 2750, 2751, 2752, 2753, 2754, 2755, 2756]
Discarding 58 places :
Implicit Place search using SMT with State Equation took 17293 ms to find 58 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 2877/2998 places, 443/446 transitions.
Applied a total of 0 rules in 93 ms. Remains 2877 /2877 variables (removed 0) and now considering 443/443 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 17587 ms. Remains : 2877/2998 places, 443/446 transitions.
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p1) p0), (NOT p0), p0, true]
Running random walk in product with property : QuasiCertifProtocol-COL-28-LTLCardinality-02
Product exploration explored 100000 steps with 3142 reset in 2311 ms.
Product exploration explored 100000 steps with 3106 reset in 2176 ms.
Computed a total of 2877 stabilizing places and 443 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2877 transition count 443
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) p0), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT 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)))]
Knowledge based reduction with 9 factoid took 412 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter insensitive) to 4 states, 8 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 137 ms :[(AND p0 (NOT p1)), (NOT p0), p0, true]
RANDOM walk for 40000 steps (1127 resets) in 1571 ms. (25 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (20 resets) in 704 ms. (56 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (32 resets) in 563 ms. (70 steps per ms) remains 2/2 properties
// Phase 1: matrix 443 rows 2877 cols
[2024-05-25 15:32:58] [INFO ] Computed 2436 invariants in 69 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/843 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 29/872 variables, 812/812 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/872 variables, 0/812 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 812/1684 variables, 784/1596 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1684 variables, 0/1596 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 262/1946 variables, 1684/3280 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1946 variables, 0/3280 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 410/2356 variables, 234/3514 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2356 variables, 0/3514 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 29/2385 variables, 28/3542 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2385 variables, 29/3571 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2385 variables, 0/3571 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 933/3318 variables, 929/4500 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3318 variables, 812/5312 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3318 variables, 0/5312 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 2/3320 variables, 1/5313 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3320 variables, 0/5313 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/3320 variables, 0/5313 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3320/3320 variables, and 5313 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1947 ms.
Refiners :[Generalized P Invariants (flows): 2436/2436 constraints, State Equation: 2877/2877 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/843 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 29/872 variables, 812/812 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/872 variables, 0/812 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 812/1684 variables, 784/1596 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1684 variables, 0/1596 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 262/1946 variables, 1684/3280 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1946 variables, 0/3280 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 410/2356 variables, 234/3514 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2356 variables, 2/3516 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2356/3320 variables, and 3516 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3538 ms.
Refiners :[Generalized P Invariants (flows): 1596/2436 constraints, State Equation: 1918/2877 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 5631ms problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 843 out of 2877 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2877/2877 places, 443/443 transitions.
Graph (complete) has 30106 edges and 2877 vertex of which 2007 are kept as prefixes of interest. Removing 870 places using SCC suffix rule.5 ms
Discarding 870 places :
Also discarding 29 output transitions
Drop transitions (Output transitions of discarded places.) removed 29 transitions
Drop transitions (Empty/Sink Transition effects.) removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 0 with 63 rules applied. Total rules applied 64 place count 2007 transition count 351
Discarding 28 places :
Symmetric choice reduction at 1 with 28 rule applications. Total rules 92 place count 1979 transition count 323
Iterating global reduction 1 with 28 rules applied. Total rules applied 120 place count 1979 transition count 323
Applied a total of 120 rules in 95 ms. Remains 1979 /2877 variables (removed 898) and now considering 323/443 (removed 120) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 95 ms. Remains : 1979/2877 places, 323/443 transitions.
RANDOM walk for 40000 steps (1157 resets) in 1618 ms. (24 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (24 resets) in 557 ms. (71 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (34 resets) in 439 ms. (90 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 5281 steps, run visited all 2 properties in 207 ms. (steps per millisecond=25 )
Probabilistic random walk after 5281 steps, saw 5166 distinct states, run finished after 209 ms. (steps per millisecond=25 ) properties seen :2
Knowledge obtained : [(AND (NOT p1) p0), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT 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))), (F p1), (F (NOT (OR p0 p1))), (F (NOT (AND p0 (NOT p1)))), (F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT (OR p0 p1)))
Knowledge based reduction with 9 factoid took 463 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-COL-28-LTLCardinality-02 FALSE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-28-LTLCardinality-02 finished in 31279 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||F(p1))))'
Support contains 58 out of 2998 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2998/2998 places, 446/446 transitions.
Reduce places removed 62 places and 0 transitions.
Iterating post reduction 0 with 62 rules applied. Total rules applied 62 place count 2936 transition count 446
Applied a total of 62 rules in 157 ms. Remains 2936 /2998 variables (removed 62) and now considering 446/446 (removed 0) transitions.
// Phase 1: matrix 446 rows 2936 cols
[2024-05-25 15:33:05] [INFO ] Computed 2492 invariants in 55 ms
[2024-05-25 15:33:09] [INFO ] Implicit Places using invariants in 4220 ms returned []
[2024-05-25 15:33:09] [INFO ] Invariant cache hit.
[2024-05-25 15:33:21] [INFO ] Implicit Places using invariants and state equation in 11810 ms returned [2727, 2728, 2729, 2730, 2731, 2732, 2733, 2734, 2735, 2736, 2737, 2738, 2739, 2740, 2741, 2742, 2743, 2744, 2745, 2746, 2747, 2748, 2749, 2750, 2751, 2752, 2753, 2754, 2755]
Discarding 29 places :
Implicit Place search using SMT with State Equation took 16038 ms to find 29 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2907/2998 places, 446/446 transitions.
Applied a total of 0 rules in 160 ms. Remains 2907 /2907 variables (removed 0) and now considering 446/446 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 16355 ms. Remains : 2907/2998 places, 446/446 transitions.
Stuttering acceptance computed with spot in 105 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : QuasiCertifProtocol-COL-28-LTLCardinality-05
Product exploration explored 100000 steps with 50000 reset in 676 ms.
Product exploration explored 100000 steps with 50000 reset in 712 ms.
Computed a total of 2907 stabilizing places and 446 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2907 transition count 446
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 p0) (NOT p1)))), (X p0), (X p1), (X (NOT (AND p0 (NOT p1)))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 11 factoid took 19 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-COL-28-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-28-LTLCardinality-05 finished in 18339 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(p1)))'
Support contains 871 out of 2998 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2998/2998 places, 446/446 transitions.
Reduce places removed 62 places and 0 transitions.
Iterating post reduction 0 with 62 rules applied. Total rules applied 62 place count 2936 transition count 446
Applied a total of 62 rules in 76 ms. Remains 2936 /2998 variables (removed 62) and now considering 446/446 (removed 0) transitions.
[2024-05-25 15:33:24] [INFO ] Invariant cache hit.
[2024-05-25 15:33:26] [INFO ] Implicit Places using invariants in 2546 ms returned []
[2024-05-25 15:33:26] [INFO ] Invariant cache hit.
[2024-05-25 15:33:30] [INFO ] Implicit Places using invariants and state equation in 3761 ms returned [2727, 2728, 2729, 2730, 2731, 2732, 2733, 2734, 2735, 2736, 2737, 2738, 2739, 2740, 2741, 2742, 2743, 2744, 2745, 2746, 2747, 2748, 2749, 2750, 2751, 2752, 2753, 2754, 2755]
Discarding 29 places :
Implicit Place search using SMT with State Equation took 6311 ms to find 29 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2907/2998 places, 446/446 transitions.
Applied a total of 0 rules in 71 ms. Remains 2907 /2907 variables (removed 0) and now considering 446/446 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 6458 ms. Remains : 2907/2998 places, 446/446 transitions.
Stuttering acceptance computed with spot in 160 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-28-LTLCardinality-07
Entered a terminal (fully accepting) state of product in 18 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-28-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-28-LTLCardinality-07 finished in 6635 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 31 out of 2998 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2998/2998 places, 446/446 transitions.
Graph (complete) has 30318 edges and 2998 vertex of which 2906 are kept as prefixes of interest. Removing 92 places using SCC suffix rule.6 ms
Discarding 92 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 2905 transition count 443
Applied a total of 3 rules in 306 ms. Remains 2905 /2998 variables (removed 93) and now considering 443/446 (removed 3) transitions.
// Phase 1: matrix 443 rows 2905 cols
[2024-05-25 15:33:30] [INFO ] Computed 2464 invariants in 46 ms
[2024-05-25 15:33:34] [INFO ] Implicit Places using invariants in 3922 ms returned []
[2024-05-25 15:33:34] [INFO ] Invariant cache hit.
[2024-05-25 15:33:51] [INFO ] Implicit Places using invariants and state equation in 17095 ms returned [2698, 2699, 2700, 2701, 2702, 2703, 2704, 2705, 2706, 2707, 2708, 2709, 2710, 2711, 2712, 2713, 2714, 2715, 2716, 2717, 2718, 2719, 2720, 2721, 2722, 2723, 2724, 2725, 2726]
Discarding 29 places :
Implicit Place search using SMT with State Equation took 21027 ms to find 29 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 2876/2998 places, 443/446 transitions.
Applied a total of 0 rules in 171 ms. Remains 2876 /2876 variables (removed 0) and now considering 443/443 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 21506 ms. Remains : 2876/2998 places, 443/446 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-28-LTLCardinality-10
Stuttering criterion allowed to conclude after 35 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-COL-28-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-28-LTLCardinality-10 finished in 21551 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 30 out of 2998 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2998/2998 places, 446/446 transitions.
Graph (complete) has 30318 edges and 2998 vertex of which 269 are kept as prefixes of interest. Removing 2729 places using SCC suffix rule.9 ms
Discarding 2729 places :
Also discarding 145 output transitions
Drop transitions (Output transitions of discarded places.) removed 145 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 115 transitions
Reduce isomorphic transitions removed 115 transitions.
Iterating post reduction 0 with 115 rules applied. Total rules applied 116 place count 268 transition count 185
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 117 place count 268 transition count 185
Applied a total of 117 rules in 23 ms. Remains 268 /2998 variables (removed 2730) and now considering 185/446 (removed 261) transitions.
// Phase 1: matrix 185 rows 268 cols
[2024-05-25 15:33:52] [INFO ] Computed 84 invariants in 1 ms
[2024-05-25 15:33:52] [INFO ] Implicit Places using invariants in 148 ms returned []
[2024-05-25 15:33:52] [INFO ] Invariant cache hit.
[2024-05-25 15:33:52] [INFO ] Implicit Places using invariants and state equation in 226 ms returned [147, 148, 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 162, 163, 164, 165, 166, 167, 168, 169, 170, 171, 172, 173, 174, 175]
Discarding 29 places :
Implicit Place search using SMT with State Equation took 376 ms to find 29 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 239/2998 places, 185/446 transitions.
Applied a total of 0 rules in 4 ms. Remains 239 /239 variables (removed 0) and now considering 185/185 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 403 ms. Remains : 239/2998 places, 185/446 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-28-LTLCardinality-11
Stuttering criterion allowed to conclude after 37 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-28-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-28-LTLCardinality-11 finished in 482 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((X(G(p1))||p0))))'
Support contains 59 out of 2998 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2998/2998 places, 446/446 transitions.
Reduce places removed 61 places and 0 transitions.
Iterating post reduction 0 with 61 rules applied. Total rules applied 61 place count 2937 transition count 446
Applied a total of 61 rules in 135 ms. Remains 2937 /2998 variables (removed 61) and now considering 446/446 (removed 0) transitions.
// Phase 1: matrix 446 rows 2937 cols
[2024-05-25 15:33:52] [INFO ] Computed 2492 invariants in 35 ms
[2024-05-25 15:33:57] [INFO ] Implicit Places using invariants in 4258 ms returned []
[2024-05-25 15:33:57] [INFO ] Invariant cache hit.
[2024-05-25 15:34:08] [INFO ] Implicit Places using invariants and state equation in 11310 ms returned [2727, 2728, 2729, 2730, 2731, 2732, 2733, 2734, 2735, 2736, 2737, 2738, 2739, 2740, 2741, 2742, 2743, 2744, 2745, 2746, 2747, 2748, 2749, 2750, 2751, 2752, 2753, 2754, 2755]
Discarding 29 places :
Implicit Place search using SMT with State Equation took 15571 ms to find 29 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2908/2998 places, 446/446 transitions.
Applied a total of 0 rules in 138 ms. Remains 2908 /2908 variables (removed 0) and now considering 446/446 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 15845 ms. Remains : 2908/2998 places, 446/446 transitions.
Stuttering acceptance computed with spot in 121 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : QuasiCertifProtocol-COL-28-LTLCardinality-12
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-28-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-28-LTLCardinality-12 finished in 15984 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X((G(F(p0))||G(p1)))) U G(p2))))'
Support contains 88 out of 2998 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2998/2998 places, 446/446 transitions.
Reduce places removed 62 places and 0 transitions.
Iterating post reduction 0 with 62 rules applied. Total rules applied 62 place count 2936 transition count 446
Applied a total of 62 rules in 134 ms. Remains 2936 /2998 variables (removed 62) and now considering 446/446 (removed 0) transitions.
// Phase 1: matrix 446 rows 2936 cols
[2024-05-25 15:34:08] [INFO ] Computed 2492 invariants in 49 ms
[2024-05-25 15:34:12] [INFO ] Implicit Places using invariants in 3971 ms returned []
[2024-05-25 15:34:12] [INFO ] Invariant cache hit.
[2024-05-25 15:34:19] [INFO ] Implicit Places using invariants and state equation in 6903 ms returned []
Implicit Place search using SMT with State Equation took 10877 ms to find 0 implicit places.
Running 416 sub problems to find dead transitions.
[2024-05-25 15:34:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2935 variables, 2492/2492 constraints. Problems are: Problem set: 0 solved, 416 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2935/3382 variables, and 2492 constraints, problems are : Problem set: 0 solved, 416 unsolved in 30019 ms.
Refiners :[Generalized P Invariants (flows): 2492/2492 constraints, State Equation: 0/2936 constraints, PredecessorRefiner: 416/416 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 416 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2935 variables, 2492/2492 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2935 variables, 0/2492 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 2 (OVERLAPS) 446/3381 variables, 2935/5427 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3381 variables, 416/5843 constraints. Problems are: Problem set: 0 solved, 416 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3381/3382 variables, and 5843 constraints, problems are : Problem set: 0 solved, 416 unsolved in 30026 ms.
Refiners :[Generalized P Invariants (flows): 2492/2492 constraints, State Equation: 2935/2936 constraints, PredecessorRefiner: 416/416 constraints, Known Traps: 0/0 constraints]
After SMT, in 60706ms problems are : Problem set: 0 solved, 416 unsolved
Search for dead transitions found 0 dead transitions in 60712ms
Starting structural reductions in LTL mode, iteration 1 : 2936/2998 places, 446/446 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 71734 ms. Remains : 2936/2998 places, 446/446 transitions.
Stuttering acceptance computed with spot in 328 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) p1)]
Running random walk in product with property : QuasiCertifProtocol-COL-28-LTLCardinality-13
Product exploration explored 100000 steps with 3024 reset in 402 ms.
Product exploration explored 100000 steps with 3026 reset in 448 ms.
Computed a total of 2936 stabilizing places and 446 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2936 transition count 446
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 p2) (NOT p1) p0), (X (NOT p2)), (X (X (NOT p2))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 267 ms. Reduced automaton from 9 states, 20 edges and 3 AP (stutter sensitive) to 9 states, 20 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 390 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) p1)]
RANDOM walk for 40000 steps (1210 resets) in 485 ms. (82 steps per ms) remains 4/10 properties
BEST_FIRST walk for 40004 steps (44 resets) in 161 ms. (246 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (61 resets) in 134 ms. (296 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (62 resets) in 94 ms. (421 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (59 resets) in 90 ms. (439 steps per ms) remains 4/4 properties
[2024-05-25 15:35:23] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1711/1799 variables, 1652/1652 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1799 variables, 0/1652 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 350/2149 variables, 1799/3451 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2149 variables, 0/3451 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1108/3257 variables, 1018/4469 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3257 variables, 784/5253 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3257 variables, 0/5253 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 121/3378 variables, 117/5370 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3378 variables, 56/5426 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3378 variables, 0/5426 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 4/3382 variables, 2/5428 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3382 variables, 0/5428 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/3382 variables, 0/5428 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
Problem apf1 is UNSAT
After SMT solving in domain Real declared 3382/3382 variables, and 5428 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2974 ms.
Refiners :[Generalized P Invariants (flows): 2492/2492 constraints, State Equation: 2936/2936 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 1711/1799 variables, 1652/1652 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1799 variables, 0/1652 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 350/2149 variables, 1799/3451 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2149 variables, 0/3451 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1108/3257 variables, 1018/4469 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3257 variables, 784/5253 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3257 variables, 3/5256 constraints. Problems are: Problem set: 1 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3257/3382 variables, and 5256 constraints, problems are : Problem set: 1 solved, 3 unsolved in 3919 ms.
Refiners :[Generalized P Invariants (flows): 2436/2492 constraints, State Equation: 2817/2936 constraints, PredecessorRefiner: 3/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 6928ms problems are : Problem set: 1 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 473 ms.
Support contains 88 out of 2936 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2936/2936 places, 446/446 transitions.
Graph (complete) has 29179 edges and 2936 vertex of which 2065 are kept as prefixes of interest. Removing 871 places using SCC suffix rule.2 ms
Discarding 871 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Drop transitions (Empty/Sink Transition effects.) removed 33 transitions
Reduce isomorphic transitions removed 33 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 34 rules applied. Total rules applied 35 place count 2065 transition count 410
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 37 place count 2064 transition count 409
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 38 place count 2063 transition count 409
Discarding 28 places :
Symmetric choice reduction at 3 with 28 rule applications. Total rules 66 place count 2035 transition count 381
Iterating global reduction 3 with 28 rules applied. Total rules applied 94 place count 2035 transition count 381
Free-agglomeration rule (complex) applied 29 times.
Iterating global reduction 3 with 29 rules applied. Total rules applied 123 place count 2035 transition count 352
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 3 with 29 rules applied. Total rules applied 152 place count 2006 transition count 352
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 153 place count 2005 transition count 351
Applied a total of 153 rules in 332 ms. Remains 2005 /2936 variables (removed 931) and now considering 351/446 (removed 95) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 333 ms. Remains : 2005/2936 places, 351/446 transitions.
RANDOM walk for 40000 steps (1157 resets) in 551 ms. (72 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (44 resets) in 166 ms. (239 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (44 resets) in 155 ms. (256 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (33 resets) in 102 ms. (388 steps per ms) remains 3/3 properties
Finished probabilistic random walk after 5743 steps, run visited all 3 properties in 152 ms. (steps per millisecond=37 )
Probabilistic random walk after 5743 steps, saw 5628 distinct states, run finished after 154 ms. (steps per millisecond=37 ) properties seen :3
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (NOT p2)), (X (X (NOT p2))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (G (OR (NOT p1) p2 p0))]
False Knowledge obtained : [(F (NOT (OR p1 p0))), (F (NOT (OR (NOT p1) (NOT p2)))), (F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT (OR (NOT p1) p2))), (F p2), (F (NOT (OR p1 p2 p0))), (F (NOT p0)), (F (NOT (OR p1 (NOT p2)))), (F p1)]
Knowledge based reduction with 7 factoid took 1019 ms. Reduced automaton from 9 states, 20 edges and 3 AP (stutter sensitive) to 9 states, 19 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 350 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) p1)]
Stuttering acceptance computed with spot in 335 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) p1)]
[2024-05-25 15:35:32] [INFO ] Invariant cache hit.
[2024-05-25 15:35:41] [INFO ] [Real]Absence check using 0 positive and 2492 generalized place invariants in 7390 ms returned sat
[2024-05-25 15:35:47] [INFO ] [Real]Absence check using state equation in 6694 ms returned unknown
Could not prove EG (NOT p2)
Support contains 88 out of 2936 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2936/2936 places, 446/446 transitions.
Applied a total of 0 rules in 137 ms. Remains 2936 /2936 variables (removed 0) and now considering 446/446 (removed 0) transitions.
[2024-05-25 15:35:48] [INFO ] Invariant cache hit.
[2024-05-25 15:35:52] [INFO ] Implicit Places using invariants in 3975 ms returned []
[2024-05-25 15:35:52] [INFO ] Invariant cache hit.
[2024-05-25 15:35:58] [INFO ] Implicit Places using invariants and state equation in 6834 ms returned []
Implicit Place search using SMT with State Equation took 10813 ms to find 0 implicit places.
Running 416 sub problems to find dead transitions.
[2024-05-25 15:35:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2935 variables, 2492/2492 constraints. Problems are: Problem set: 0 solved, 416 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2935/3382 variables, and 2492 constraints, problems are : Problem set: 0 solved, 416 unsolved in 30021 ms.
Refiners :[Generalized P Invariants (flows): 2492/2492 constraints, State Equation: 0/2936 constraints, PredecessorRefiner: 416/416 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 416 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2935 variables, 2492/2492 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2935 variables, 0/2492 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 2 (OVERLAPS) 446/3381 variables, 2935/5427 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3381 variables, 416/5843 constraints. Problems are: Problem set: 0 solved, 416 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3381/3382 variables, and 5843 constraints, problems are : Problem set: 0 solved, 416 unsolved in 30021 ms.
Refiners :[Generalized P Invariants (flows): 2492/2492 constraints, State Equation: 2935/2936 constraints, PredecessorRefiner: 416/416 constraints, Known Traps: 0/0 constraints]
After SMT, in 60672ms problems are : Problem set: 0 solved, 416 unsolved
Search for dead transitions found 0 dead transitions in 60682ms
Finished structural reductions in LTL mode , in 1 iterations and 71634 ms. Remains : 2936/2936 places, 446/446 transitions.
Computed a total of 2936 stabilizing places and 446 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2936 transition count 446
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 p2) (NOT p1) p0), (X (NOT p2)), (X (X (NOT p2))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 286 ms. Reduced automaton from 9 states, 19 edges and 3 AP (stutter sensitive) to 9 states, 19 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 351 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) p1)]
RANDOM walk for 40000 steps (1209 resets) in 299 ms. (133 steps per ms) remains 3/9 properties
BEST_FIRST walk for 40004 steps (44 resets) in 96 ms. (412 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (62 resets) in 114 ms. (347 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (60 resets) in 73 ms. (540 steps per ms) remains 3/3 properties
[2024-05-25 15:37:00] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 1711/1799 variables, 1652/1652 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1799 variables, 0/1652 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 350/2149 variables, 1799/3451 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2149 variables, 0/3451 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1108/3257 variables, 1018/4469 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3257 variables, 784/5253 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3257 variables, 0/5253 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 121/3378 variables, 117/5370 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3378 variables, 56/5426 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3378 variables, 0/5426 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 4/3382 variables, 2/5428 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3382 variables, 0/5428 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/3382 variables, 0/5428 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3382/3382 variables, and 5428 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2215 ms.
Refiners :[Generalized P Invariants (flows): 2492/2492 constraints, State Equation: 2936/2936 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 1711/1799 variables, 1652/1652 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1799 variables, 0/1652 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 350/2149 variables, 1799/3451 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2149 variables, 0/3451 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1108/3257 variables, 1018/4469 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3257 variables, 784/5253 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3257 variables, 3/5256 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3257 variables, 0/5256 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 121/3378 variables, 117/5373 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3378 variables, 56/5429 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3378 variables, 0/5429 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 4/3382 variables, 2/5431 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3382 variables, 0/5431 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/3382 variables, 0/5431 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3382/3382 variables, and 5431 constraints, problems are : Problem set: 0 solved, 3 unsolved in 5021 ms.
Refiners :[Generalized P Invariants (flows): 2492/2492 constraints, State Equation: 2936/2936 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 7255ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 88 out of 2936 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2936/2936 places, 446/446 transitions.
Graph (complete) has 29179 edges and 2936 vertex of which 2065 are kept as prefixes of interest. Removing 871 places using SCC suffix rule.3 ms
Discarding 871 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Drop transitions (Empty/Sink Transition effects.) removed 33 transitions
Reduce isomorphic transitions removed 33 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 34 rules applied. Total rules applied 35 place count 2065 transition count 410
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 37 place count 2064 transition count 409
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 38 place count 2063 transition count 409
Discarding 28 places :
Symmetric choice reduction at 3 with 28 rule applications. Total rules 66 place count 2035 transition count 381
Iterating global reduction 3 with 28 rules applied. Total rules applied 94 place count 2035 transition count 381
Free-agglomeration rule (complex) applied 29 times.
Iterating global reduction 3 with 29 rules applied. Total rules applied 123 place count 2035 transition count 352
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 3 with 29 rules applied. Total rules applied 152 place count 2006 transition count 352
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 153 place count 2005 transition count 351
Applied a total of 153 rules in 332 ms. Remains 2005 /2936 variables (removed 931) and now considering 351/446 (removed 95) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 332 ms. Remains : 2005/2936 places, 351/446 transitions.
RANDOM walk for 40000 steps (1159 resets) in 574 ms. (69 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (32 resets) in 109 ms. (363 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (44 resets) in 115 ms. (344 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (34 resets) in 75 ms. (526 steps per ms) remains 3/3 properties
Finished probabilistic random walk after 5743 steps, run visited all 3 properties in 95 ms. (steps per millisecond=60 )
Probabilistic random walk after 5743 steps, saw 5628 distinct states, run finished after 95 ms. (steps per millisecond=60 ) properties seen :3
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (NOT p2)), (X (X (NOT p2))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (OR (NOT p1) p2))), (F (NOT (OR p1 p0))), (F (NOT (OR p1 (NOT p2)))), (F (NOT (AND (NOT p1) (NOT p2)))), (F p2), (F (NOT (OR (NOT p1) (NOT p2)))), (F (NOT (OR p2 p0))), (F p1), (F (NOT p0))]
Knowledge based reduction with 6 factoid took 986 ms. Reduced automaton from 9 states, 19 edges and 3 AP (stutter sensitive) to 9 states, 19 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 342 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) p1)]
Stuttering acceptance computed with spot in 334 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) p1)]
[2024-05-25 15:37:10] [INFO ] Invariant cache hit.
[2024-05-25 15:37:18] [INFO ] [Real]Absence check using 0 positive and 2492 generalized place invariants in 7320 ms returned sat
[2024-05-25 15:37:25] [INFO ] [Real]Absence check using state equation in 6784 ms returned unknown
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 326 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) p1)]
Product exploration explored 100000 steps with 3025 reset in 346 ms.
Product exploration explored 100000 steps with 3025 reset in 393 ms.
Applying partial POR strategy [false, false, false, false, true, true, true, true, true]
Stuttering acceptance computed with spot in 330 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) p1)]
Support contains 88 out of 2936 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2936/2936 places, 446/446 transitions.
Graph (complete) has 29179 edges and 2936 vertex of which 2906 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.6 ms
Discarding 30 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 2906 transition count 446
Deduced a syphon composed of 2 places in 1 ms
Applied a total of 3 rules in 552 ms. Remains 2906 /2936 variables (removed 30) and now considering 446/446 (removed 0) transitions.
[2024-05-25 15:37:27] [INFO ] Redundant transitions in 39 ms returned []
Running 416 sub problems to find dead transitions.
// Phase 1: matrix 446 rows 2906 cols
[2024-05-25 15:37:27] [INFO ] Computed 2464 invariants in 41 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2905 variables, 2464/2464 constraints. Problems are: Problem set: 0 solved, 416 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 2905/3352 variables, and 2464 constraints, problems are : Problem set: 0 solved, 416 unsolved in 30024 ms.
Refiners :[Generalized P Invariants (flows): 2464/2464 constraints, State Equation: 0/2906 constraints, PredecessorRefiner: 416/416 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 416 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2905 variables, 2464/2464 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2905 variables, 0/2464 constraints. Problems are: Problem set: 0 solved, 416 unsolved
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD440 is UNSAT
At refinement iteration 2 (OVERLAPS) 446/3351 variables, 2905/5369 constraints. Problems are: Problem set: 4 solved, 412 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3351 variables, 412/5781 constraints. Problems are: Problem set: 4 solved, 412 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3351/3352 variables, and 5781 constraints, problems are : Problem set: 4 solved, 412 unsolved in 30019 ms.
Refiners :[Generalized P Invariants (flows): 2464/2464 constraints, State Equation: 2905/2906 constraints, PredecessorRefiner: 412/416 constraints, Known Traps: 0/0 constraints]
After SMT, in 60652ms problems are : Problem set: 4 solved, 412 unsolved
Search for dead transitions found 4 dead transitions in 60656ms
Found 4 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 2906/2936 places, 442/446 transitions.
Graph (complete) has 30771 edges and 2906 vertex of which 2904 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.7 ms
Discarding 2 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 177 ms. Remains 2904 /2906 variables (removed 2) and now considering 442/442 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 2904/2936 places, 442/446 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 61435 ms. Remains : 2904/2936 places, 442/446 transitions.
Support contains 88 out of 2936 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2936/2936 places, 446/446 transitions.
Applied a total of 0 rules in 153 ms. Remains 2936 /2936 variables (removed 0) and now considering 446/446 (removed 0) transitions.
// Phase 1: matrix 446 rows 2936 cols
[2024-05-25 15:38:28] [INFO ] Computed 2492 invariants in 51 ms
[2024-05-25 15:38:33] [INFO ] Implicit Places using invariants in 4246 ms returned []
[2024-05-25 15:38:33] [INFO ] Invariant cache hit.
[2024-05-25 15:38:39] [INFO ] Implicit Places using invariants and state equation in 6556 ms returned []
Implicit Place search using SMT with State Equation took 10805 ms to find 0 implicit places.
Running 416 sub problems to find dead transitions.
[2024-05-25 15:38:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2935 variables, 2492/2492 constraints. Problems are: Problem set: 0 solved, 416 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2935/3382 variables, and 2492 constraints, problems are : Problem set: 0 solved, 416 unsolved in 30017 ms.
Refiners :[Generalized P Invariants (flows): 2492/2492 constraints, State Equation: 0/2936 constraints, PredecessorRefiner: 416/416 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 416 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2935 variables, 2492/2492 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2935 variables, 0/2492 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 2 (OVERLAPS) 446/3381 variables, 2935/5427 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3381 variables, 416/5843 constraints. Problems are: Problem set: 0 solved, 416 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3381/3382 variables, and 5843 constraints, problems are : Problem set: 0 solved, 416 unsolved in 30023 ms.
Refiners :[Generalized P Invariants (flows): 2492/2492 constraints, State Equation: 2935/2936 constraints, PredecessorRefiner: 416/416 constraints, Known Traps: 0/0 constraints]
After SMT, in 60637ms problems are : Problem set: 0 solved, 416 unsolved
Search for dead transitions found 0 dead transitions in 60654ms
Finished structural reductions in LTL mode , in 1 iterations and 71614 ms. Remains : 2936/2936 places, 446/446 transitions.
Treatment of property QuasiCertifProtocol-COL-28-LTLCardinality-13 finished in 331973 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((p0 U (G(p0)||(p0&&(p1||F(!p2)))))) U (!p0&&G(p3))))'
Support contains 1016 out of 2998 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2998/2998 places, 446/446 transitions.
Graph (complete) has 30318 edges and 2998 vertex of which 2965 are kept as prefixes of interest. Removing 33 places using SCC suffix rule.13 ms
Discarding 33 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 2964 transition count 445
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 2964 transition count 445
Applied a total of 4 rules in 330 ms. Remains 2964 /2998 variables (removed 34) and now considering 445/446 (removed 1) transitions.
// Phase 1: matrix 445 rows 2964 cols
[2024-05-25 15:39:40] [INFO ] Computed 2521 invariants in 19 ms
[2024-05-25 15:39:47] [INFO ] Implicit Places using invariants in 6568 ms returned []
[2024-05-25 15:39:47] [INFO ] Invariant cache hit.
[2024-05-25 15:40:03] [INFO ] Implicit Places using invariants and state equation in 15553 ms returned [2727, 2728, 2729, 2730, 2731, 2732, 2733, 2734, 2735, 2736, 2737, 2738, 2739, 2740, 2741, 2742, 2743, 2744, 2745, 2746, 2747, 2748, 2749, 2750, 2751, 2752, 2753, 2754, 2755]
Discarding 29 places :
Implicit Place search using SMT with State Equation took 22123 ms to find 29 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 2935/2998 places, 445/446 transitions.
Applied a total of 0 rules in 113 ms. Remains 2935 /2935 variables (removed 0) and now considering 445/445 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 22568 ms. Remains : 2935/2998 places, 445/446 transitions.
Stuttering acceptance computed with spot in 245 ms :[(OR (NOT p3) p0), (NOT p0), (NOT p3), (AND (NOT p0) p2)]
Running random walk in product with property : QuasiCertifProtocol-COL-28-LTLCardinality-14
Product exploration explored 100000 steps with 3026 reset in 729 ms.
Product exploration explored 100000 steps with 3024 reset in 678 ms.
Computed a total of 2935 stabilizing places and 445 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2935 transition count 445
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) p3 (NOT p1) p2), (X p2), (X p3), (X (AND (NOT p0) p2)), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND p0 (NOT p1) p2))), (X (AND (NOT p0) p3)), (X (NOT (OR p0 (NOT p3)))), (X (NOT p0)), (X (NOT p1)), (X (NOT (AND p0 (NOT p3) (NOT p1) p2))), (X (X p2)), (X (X p3)), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (AND (NOT p0) p3))), (X (X (NOT (OR p0 (NOT p3))))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND p0 (NOT p3) (NOT p1) p2)))), (F (G (NOT p0))), (F (G p3)), (F (G (NOT p1))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 25 factoid took 177 ms. Reduced automaton from 4 states, 12 edges and 4 AP (stutter insensitive) to 4 states, 12 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 191 ms :[(OR (NOT p3) p0), (NOT p0), (NOT p3), (AND (NOT p0) p2)]
Reduction of identical properties reduced properties to check from 10 to 9
RANDOM walk for 40000 steps (1208 resets) in 2506 ms. (15 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (65 resets) in 638 ms. (62 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (80 resets) in 204 ms. (195 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (67 resets) in 705 ms. (56 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (80 resets) in 298 ms. (133 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (80 resets) in 1171 ms. (34 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (80 resets) in 277 ms. (143 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (80 resets) in 267 ms. (149 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (54 resets) in 611 ms. (65 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (80 resets) in 1059 ms. (37 steps per ms) remains 9/9 properties
Interrupted probabilistic random walk after 472278 steps, run timeout after 6001 ms. (steps per millisecond=78 ) properties seen :0 out of 9
Probabilistic random walk after 472278 steps, saw 81255 distinct states, run finished after 6004 ms. (steps per millisecond=78 ) properties seen :0
// Phase 1: matrix 445 rows 2935 cols
[2024-05-25 15:40:13] [INFO ] Computed 2492 invariants in 21 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1016 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 899/1915 variables, 1652/1652 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1915 variables, 0/1652 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 812/2727 variables, 784/2436 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2727 variables, 0/2436 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 354/3081 variables, 2727/5163 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3081 variables, 0/5163 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 299/3380 variables, 208/5371 constraints. Problems are: Problem set: 0 solved, 9 unsolved
SMT process timed out in 5546ms, After SMT, problems are : Problem set: 0 solved, 9 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1016 out of 2935 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2935/2935 places, 445/445 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 91 transitions
Reduce isomorphic transitions removed 91 transitions.
Discarding 29 places :
Implicit places reduction removed 29 places
Iterating post reduction 0 with 120 rules applied. Total rules applied 120 place count 2906 transition count 354
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 120 place count 2906 transition count 353
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 122 place count 2905 transition count 353
Applied a total of 122 rules in 120 ms. Remains 2905 /2935 variables (removed 30) and now considering 353/445 (removed 92) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 120 ms. Remains : 2905/2935 places, 353/445 transitions.
RANDOM walk for 40000 steps (1248 resets) in 2803 ms. (14 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (66 resets) in 621 ms. (64 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (80 resets) in 223 ms. (178 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (66 resets) in 654 ms. (61 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (80 resets) in 249 ms. (160 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (80 resets) in 1033 ms. (38 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (80 resets) in 273 ms. (146 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (80 resets) in 241 ms. (165 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (59 resets) in 614 ms. (65 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (80 resets) in 1077 ms. (37 steps per ms) remains 9/9 properties
Finished probabilistic random walk after 3751 steps, run visited all 9 properties in 202 ms. (steps per millisecond=18 )
Probabilistic random walk after 3751 steps, saw 3604 distinct states, run finished after 202 ms. (steps per millisecond=18 ) properties seen :9
Knowledge obtained : [(AND (NOT p0) p3 (NOT p1) p2), (X p2), (X p3), (X (AND (NOT p0) p2)), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND p0 (NOT p1) p2))), (X (AND (NOT p0) p3)), (X (NOT (OR p0 (NOT p3)))), (X (NOT p0)), (X (NOT p1)), (X (NOT (AND p0 (NOT p3) (NOT p1) p2))), (X (X p2)), (X (X p3)), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (AND (NOT p0) p3))), (X (X (NOT (OR p0 (NOT p3))))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND p0 (NOT p3) (NOT p1) p2)))), (F (G (NOT p0))), (F (G p3)), (F (G (NOT p1))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p1 (NOT p2)))), (F (NOT (OR p0 p3))), (F (NOT (AND (NOT p0) p3))), (F (NOT (AND (NOT p0) p3))), (F (NOT p2)), (F (NOT (AND (NOT p0) p2))), (F (NOT p3)), (F p1), (F p0), (F (NOT (OR (NOT p0) p3 p1 (NOT p2))))]
Knowledge based reduction with 25 factoid took 687 ms. Reduced automaton from 4 states, 12 edges and 4 AP (stutter insensitive) to 4 states, 12 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 168 ms :[(OR (NOT p3) p0), (NOT p0), (NOT p3), (AND (NOT p0) p2)]
Stuttering acceptance computed with spot in 201 ms :[(OR (NOT p3) p0), (NOT p0), (NOT p3), (AND (NOT p0) p2)]
Support contains 1016 out of 2935 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2935/2935 places, 445/445 transitions.
Applied a total of 0 rules in 95 ms. Remains 2935 /2935 variables (removed 0) and now considering 445/445 (removed 0) transitions.
[2024-05-25 15:40:23] [INFO ] Invariant cache hit.
[2024-05-25 15:40:26] [INFO ] Implicit Places using invariants in 3428 ms returned []
[2024-05-25 15:40:26] [INFO ] Invariant cache hit.
[2024-05-25 15:40:45] [INFO ] Implicit Places using invariants and state equation in 19200 ms returned []
Implicit Place search using SMT with State Equation took 22630 ms to find 0 implicit places.
[2024-05-25 15:40:45] [INFO ] Redundant transitions in 34 ms returned []
Running 415 sub problems to find dead transitions.
[2024-05-25 15:40:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2905 variables, 1680/1680 constraints. Problems are: Problem set: 0 solved, 415 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2905/3380 variables, and 1680 constraints, problems are : Problem set: 0 solved, 415 unsolved in 30015 ms.
Refiners :[Generalized P Invariants (flows): 1680/2492 constraints, State Equation: 0/2935 constraints, PredecessorRefiner: 415/415 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 415 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2905 variables, 1680/1680 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2905 variables, 0/1680 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 2 (OVERLAPS) 29/2934 variables, 812/2492 constraints. Problems are: Problem set: 0 solved, 415 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2934/3380 variables, and 2492 constraints, problems are : Problem set: 0 solved, 415 unsolved in 30021 ms.
Refiners :[Generalized P Invariants (flows): 2492/2492 constraints, State Equation: 0/2935 constraints, PredecessorRefiner: 0/415 constraints, Known Traps: 0/0 constraints]
After SMT, in 60758ms problems are : Problem set: 0 solved, 415 unsolved
Search for dead transitions found 0 dead transitions in 60764ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 83535 ms. Remains : 2935/2935 places, 445/445 transitions.
Computed a total of 2935 stabilizing places and 445 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2935 transition count 445
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) p3 (NOT p1) p2), (X p2), (X p3), (X (AND (NOT p0) p2)), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND p0 (NOT p1) p2))), (X (AND (NOT p0) p3)), (X (NOT (OR p0 (NOT p3)))), (X (NOT p0)), (X (NOT p1)), (X (NOT (AND p0 (NOT p3) (NOT p1) p2))), (X (X p2)), (X (X p3)), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (AND (NOT p0) p3))), (X (X (NOT (OR p0 (NOT p3))))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND p0 (NOT p3) (NOT p1) p2)))), (F (G (NOT p0))), (F (G p3)), (F (G (NOT p1))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 25 factoid took 183 ms. Reduced automaton from 4 states, 12 edges and 4 AP (stutter insensitive) to 4 states, 12 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 194 ms :[(OR (NOT p3) p0), (NOT p0), (NOT p3), (AND (NOT p0) p2)]
Reduction of identical properties reduced properties to check from 10 to 9
RANDOM walk for 40000 steps (1208 resets) in 3010 ms. (13 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (66 resets) in 859 ms. (46 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (80 resets) in 270 ms. (147 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (66 resets) in 913 ms. (43 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (80 resets) in 328 ms. (121 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (80 resets) in 1550 ms. (25 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (80 resets) in 344 ms. (115 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (80 resets) in 282 ms. (141 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (58 resets) in 792 ms. (50 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (80 resets) in 1398 ms. (28 steps per ms) remains 9/9 properties
Interrupted probabilistic random walk after 769190 steps, run timeout after 9001 ms. (steps per millisecond=85 ) properties seen :0 out of 9
Probabilistic random walk after 769190 steps, saw 121637 distinct states, run finished after 9001 ms. (steps per millisecond=85 ) properties seen :0
[2024-05-25 15:41:59] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1016 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 899/1915 variables, 1652/1652 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1915 variables, 0/1652 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 812/2727 variables, 784/2436 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2727 variables, 0/2436 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 354/3081 variables, 2727/5163 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3081 variables, 0/5163 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 299/3380 variables, 208/5371 constraints. Problems are: Problem set: 0 solved, 9 unsolved
SMT process timed out in 5434ms, After SMT, problems are : Problem set: 0 solved, 9 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1016 out of 2935 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2935/2935 places, 445/445 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 91 transitions
Reduce isomorphic transitions removed 91 transitions.
Discarding 29 places :
Implicit places reduction removed 29 places
Iterating post reduction 0 with 120 rules applied. Total rules applied 120 place count 2906 transition count 354
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 120 place count 2906 transition count 353
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 122 place count 2905 transition count 353
Applied a total of 122 rules in 110 ms. Remains 2905 /2935 variables (removed 30) and now considering 353/445 (removed 92) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 110 ms. Remains : 2905/2935 places, 353/445 transitions.
RANDOM walk for 40000 steps (1245 resets) in 2707 ms. (14 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (68 resets) in 802 ms. (49 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (80 resets) in 187 ms. (212 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (69 resets) in 633 ms. (63 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (80 resets) in 259 ms. (153 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (80 resets) in 983 ms. (40 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (80 resets) in 247 ms. (161 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (80 resets) in 231 ms. (172 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (57 resets) in 596 ms. (67 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (80 resets) in 1023 ms. (39 steps per ms) remains 9/9 properties
Finished probabilistic random walk after 3751 steps, run visited all 9 properties in 206 ms. (steps per millisecond=18 )
Probabilistic random walk after 3751 steps, saw 3604 distinct states, run finished after 206 ms. (steps per millisecond=18 ) properties seen :9
Knowledge obtained : [(AND (NOT p0) p3 (NOT p1) p2), (X p2), (X p3), (X (AND (NOT p0) p2)), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND p0 (NOT p1) p2))), (X (AND (NOT p0) p3)), (X (NOT (OR p0 (NOT p3)))), (X (NOT p0)), (X (NOT p1)), (X (NOT (AND p0 (NOT p3) (NOT p1) p2))), (X (X p2)), (X (X p3)), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (AND (NOT p0) p3))), (X (X (NOT (OR p0 (NOT p3))))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND p0 (NOT p3) (NOT p1) p2)))), (F (G (NOT p0))), (F (G p3)), (F (G (NOT p1))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p1 (NOT p2)))), (F (NOT (OR p0 p3))), (F (NOT (AND (NOT p0) p3))), (F (NOT (AND (NOT p0) p3))), (F (NOT p2)), (F (NOT (AND (NOT p0) p2))), (F (NOT p3)), (F p1), (F p0), (F (NOT (OR (NOT p0) p3 p1 (NOT p2))))]
Knowledge based reduction with 25 factoid took 587 ms. Reduced automaton from 4 states, 12 edges and 4 AP (stutter insensitive) to 4 states, 12 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 192 ms :[(OR (NOT p3) p0), (NOT p0), (NOT p3), (AND (NOT p0) p2)]
Stuttering acceptance computed with spot in 196 ms :[(OR (NOT p3) p0), (NOT p0), (NOT p3), (AND (NOT p0) p2)]
Stuttering acceptance computed with spot in 209 ms :[(OR (NOT p3) p0), (NOT p0), (NOT p3), (AND (NOT p0) p2)]
Product exploration explored 100000 steps with 3025 reset in 593 ms.
Product exploration explored 100000 steps with 3025 reset in 612 ms.
Support contains 1016 out of 2935 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2935/2935 places, 445/445 transitions.
Applied a total of 0 rules in 93 ms. Remains 2935 /2935 variables (removed 0) and now considering 445/445 (removed 0) transitions.
[2024-05-25 15:42:10] [INFO ] Invariant cache hit.
[2024-05-25 15:42:13] [INFO ] Implicit Places using invariants in 3229 ms returned []
[2024-05-25 15:42:13] [INFO ] Invariant cache hit.
[2024-05-25 15:42:32] [INFO ] Implicit Places using invariants and state equation in 19604 ms returned []
Implicit Place search using SMT with State Equation took 22837 ms to find 0 implicit places.
[2024-05-25 15:42:32] [INFO ] Redundant transitions in 29 ms returned []
Running 415 sub problems to find dead transitions.
[2024-05-25 15:42:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2905 variables, 1680/1680 constraints. Problems are: Problem set: 0 solved, 415 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2905/3380 variables, and 1680 constraints, problems are : Problem set: 0 solved, 415 unsolved in 30015 ms.
Refiners :[Generalized P Invariants (flows): 1680/2492 constraints, State Equation: 0/2935 constraints, PredecessorRefiner: 415/415 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 415 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2905 variables, 1680/1680 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2905 variables, 0/1680 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 2 (OVERLAPS) 29/2934 variables, 812/2492 constraints. Problems are: Problem set: 0 solved, 415 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 2934/3380 variables, and 2492 constraints, problems are : Problem set: 0 solved, 415 unsolved in 30018 ms.
Refiners :[Generalized P Invariants (flows): 2492/2492 constraints, State Equation: 0/2935 constraints, PredecessorRefiner: 0/415 constraints, Known Traps: 0/0 constraints]
After SMT, in 60610ms problems are : Problem set: 0 solved, 415 unsolved
Search for dead transitions found 0 dead transitions in 60614ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 83585 ms. Remains : 2935/2935 places, 445/445 transitions.
Treatment of property QuasiCertifProtocol-COL-28-LTLCardinality-14 finished in 233039 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 30 out of 2998 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2998/2998 places, 446/446 transitions.
Graph (complete) has 30318 edges and 2998 vertex of which 2096 are kept as prefixes of interest. Removing 902 places using SCC suffix rule.7 ms
Discarding 902 places :
Also discarding 29 output transitions
Drop transitions (Output transitions of discarded places.) removed 29 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 0 with 28 rules applied. Total rules applied 29 place count 2095 transition count 388
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 31 place count 2095 transition count 388
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 2094 transition count 387
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 2094 transition count 387
Applied a total of 33 rules in 280 ms. Remains 2094 /2998 variables (removed 904) and now considering 387/446 (removed 59) transitions.
// Phase 1: matrix 387 rows 2094 cols
[2024-05-25 15:43:33] [INFO ] Computed 1708 invariants in 14 ms
[2024-05-25 15:43:36] [INFO ] Implicit Places using invariants in 3093 ms returned []
[2024-05-25 15:43:36] [INFO ] Invariant cache hit.
[2024-05-25 15:43:41] [INFO ] Implicit Places using invariants and state equation in 4707 ms returned [1829, 1830, 1831, 1832, 1833, 1834, 1835, 1836, 1837, 1838, 1839, 1840, 1841, 1842, 1843, 1844, 1845, 1846, 1847, 1848, 1849, 1850, 1851, 1852, 1853, 1854, 1855, 1856, 1857, 1858, 1859, 1860, 1861, 1862, 1863, 1864, 1865, 1866, 1867, 1868, 1869, 1870, 1871, 1872, 1873, 1874, 1875, 1876, 1877, 1878, 1879, 1880, 1881, 1882, 1883, 1884, 1885, 1886]
Discarding 58 places :
Implicit Place search using SMT with State Equation took 7806 ms to find 58 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 2036/2998 places, 387/446 transitions.
Applied a total of 0 rules in 85 ms. Remains 2036 /2036 variables (removed 0) and now considering 387/387 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 8171 ms. Remains : 2036/2998 places, 387/446 transitions.
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-28-LTLCardinality-15
Product exploration explored 100000 steps with 4070 reset in 405 ms.
Product exploration explored 100000 steps with 4088 reset in 409 ms.
Computed a total of 2036 stabilizing places and 387 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2036 transition count 387
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 195 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 117 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 126 steps (0 resets) in 4 ms. (25 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 189 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 55 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 387 rows 2036 cols
[2024-05-25 15:43:43] [INFO ] Computed 1652 invariants in 15 ms
[2024-05-25 15:43:47] [INFO ] [Real]Absence check using 0 positive and 1652 generalized place invariants in 3479 ms returned sat
[2024-05-25 15:43:58] [INFO ] [Real]Absence check using state equation in 10659 ms returned sat
[2024-05-25 15:43:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 15:44:02] [INFO ] [Nat]Absence check using 0 positive and 1652 generalized place invariants in 3427 ms returned sat
[2024-05-25 15:44:11] [INFO ] [Nat]Absence check using state equation in 8754 ms returned sat
[2024-05-25 15:44:11] [INFO ] Computed and/alt/rep : 264/323/264 causal constraints (skipped 63 transitions) in 33 ms.
[2024-05-25 15:44:11] [INFO ] Added : 30 causal constraints over 6 iterations in 730 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 30 out of 2036 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2036/2036 places, 387/387 transitions.
Applied a total of 0 rules in 87 ms. Remains 2036 /2036 variables (removed 0) and now considering 387/387 (removed 0) transitions.
[2024-05-25 15:44:11] [INFO ] Invariant cache hit.
[2024-05-25 15:44:14] [INFO ] Implicit Places using invariants in 2961 ms returned []
[2024-05-25 15:44:14] [INFO ] Invariant cache hit.
[2024-05-25 15:44:19] [INFO ] Implicit Places using invariants and state equation in 4791 ms returned []
Implicit Place search using SMT with State Equation took 7767 ms to find 0 implicit places.
[2024-05-25 15:44:19] [INFO ] Redundant transitions in 2 ms returned []
Running 327 sub problems to find dead transitions.
[2024-05-25 15:44:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1977 variables, 1652/1652 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1977 variables, 0/1652 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 2 (OVERLAPS) 387/2364 variables, 1977/3629 constraints. Problems are: Problem set: 0 solved, 327 unsolved
(s249 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 1.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.0timeout
)
(s250 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2364/2423 variables, and 3629 constraints, problems are : Problem set: 0 solved, 327 unsolved in 30022 ms.
Refiners :[Generalized P Invariants (flows): 1652/1652 constraints, State Equation: 1977/2036 constraints, PredecessorRefiner: 327/327 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 327 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1977 variables, 1652/1652 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1977 variables, 0/1652 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 2 (OVERLAPS) 387/2364 variables, 1977/3629 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2364 variables, 261/3890 constraints. Problems are: Problem set: 0 solved, 327 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 2364/2423 variables, and 3890 constraints, problems are : Problem set: 0 solved, 327 unsolved in 30033 ms.
Refiners :[Generalized P Invariants (flows): 1652/1652 constraints, State Equation: 1977/2036 constraints, PredecessorRefiner: 261/327 constraints, Known Traps: 0/0 constraints]
After SMT, in 60462ms problems are : Problem set: 0 solved, 327 unsolved
Search for dead transitions found 0 dead transitions in 60467ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 68334 ms. Remains : 2036/2036 places, 387/387 transitions.
Computed a total of 2036 stabilizing places and 387 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2036 transition count 387
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 238 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 73 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 98 steps (0 resets) in 4 ms. (19 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 216 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
[2024-05-25 15:45:21] [INFO ] Invariant cache hit.
[2024-05-25 15:45:25] [INFO ] [Real]Absence check using 0 positive and 1652 generalized place invariants in 3445 ms returned sat
[2024-05-25 15:45:35] [INFO ] [Real]Absence check using state equation in 10542 ms returned sat
[2024-05-25 15:45:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 15:45:39] [INFO ] [Nat]Absence check using 0 positive and 1652 generalized place invariants in 3454 ms returned sat
[2024-05-25 15:45:48] [INFO ] [Nat]Absence check using state equation in 8896 ms returned sat
[2024-05-25 15:45:48] [INFO ] Computed and/alt/rep : 264/323/264 causal constraints (skipped 63 transitions) in 32 ms.
[2024-05-25 15:45:49] [INFO ] Added : 30 causal constraints over 6 iterations in 636 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 4148 reset in 397 ms.
Product exploration explored 100000 steps with 4097 reset in 419 ms.
Support contains 30 out of 2036 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2036/2036 places, 387/387 transitions.
Applied a total of 0 rules in 84 ms. Remains 2036 /2036 variables (removed 0) and now considering 387/387 (removed 0) transitions.
[2024-05-25 15:45:50] [INFO ] Invariant cache hit.
[2024-05-25 15:45:53] [INFO ] Implicit Places using invariants in 2980 ms returned []
[2024-05-25 15:45:53] [INFO ] Invariant cache hit.
[2024-05-25 15:45:57] [INFO ] Implicit Places using invariants and state equation in 4698 ms returned []
Implicit Place search using SMT with State Equation took 7681 ms to find 0 implicit places.
[2024-05-25 15:45:57] [INFO ] Redundant transitions in 4 ms returned []
Running 327 sub problems to find dead transitions.
[2024-05-25 15:45:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1977 variables, 1652/1652 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1977 variables, 0/1652 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 2 (OVERLAPS) 387/2364 variables, 1977/3629 constraints. Problems are: Problem set: 0 solved, 327 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2364/2423 variables, and 3629 constraints, problems are : Problem set: 0 solved, 327 unsolved in 30016 ms.
Refiners :[Generalized P Invariants (flows): 1652/1652 constraints, State Equation: 1977/2036 constraints, PredecessorRefiner: 327/327 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 327 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1977 variables, 1652/1652 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1977 variables, 0/1652 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 2 (OVERLAPS) 387/2364 variables, 1977/3629 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2364 variables, 261/3890 constraints. Problems are: Problem set: 0 solved, 327 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2364/2423 variables, and 3890 constraints, problems are : Problem set: 0 solved, 327 unsolved in 30020 ms.
Refiners :[Generalized P Invariants (flows): 1652/1652 constraints, State Equation: 1977/2036 constraints, PredecessorRefiner: 261/327 constraints, Known Traps: 0/0 constraints]
After SMT, in 60441ms problems are : Problem set: 0 solved, 327 unsolved
Search for dead transitions found 0 dead transitions in 60447ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 68227 ms. Remains : 2036/2036 places, 387/387 transitions.
Treatment of property QuasiCertifProtocol-COL-28-LTLCardinality-15 finished in 204900 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X((G(F(p0))||G(p1)))) U G(p2))))'
Found a Lengthening insensitive property : QuasiCertifProtocol-COL-28-LTLCardinality-13
Stuttering acceptance computed with spot in 399 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) p1)]
Support contains 88 out of 2998 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 2998/2998 places, 446/446 transitions.
Graph (complete) has 30318 edges and 2998 vertex of which 2906 are kept as prefixes of interest. Removing 92 places using SCC suffix rule.11 ms
Discarding 92 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 2903 transition count 441
Applied a total of 5 rules in 315 ms. Remains 2903 /2998 variables (removed 95) and now considering 441/446 (removed 5) transitions.
// Phase 1: matrix 441 rows 2903 cols
[2024-05-25 15:46:59] [INFO ] Computed 2464 invariants in 49 ms
[2024-05-25 15:47:03] [INFO ] Implicit Places using invariants in 4190 ms returned []
[2024-05-25 15:47:03] [INFO ] Invariant cache hit.
[2024-05-25 15:47:10] [INFO ] Implicit Places using invariants and state equation in 6742 ms returned [2640, 2641, 2642, 2643, 2644, 2645, 2646, 2647, 2648, 2649, 2650, 2651, 2652, 2653, 2654, 2655, 2656, 2657, 2658, 2659, 2660, 2661, 2662, 2663, 2664, 2665, 2666, 2667, 2668]
Discarding 29 places :
Implicit Place search using SMT with State Equation took 10939 ms to find 29 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 2874/2998 places, 441/446 transitions.
Applied a total of 0 rules in 156 ms. Remains 2874 /2874 variables (removed 0) and now considering 441/441 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 11410 ms. Remains : 2874/2998 places, 441/446 transitions.
Running random walk in product with property : QuasiCertifProtocol-COL-28-LTLCardinality-13
Product exploration explored 100000 steps with 2814 reset in 452 ms.
Product exploration explored 100000 steps with 2816 reset in 479 ms.
Computed a total of 2874 stabilizing places and 441 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2874 transition count 441
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 p2) (NOT p1) p0), (X (NOT p2)), (X (X (NOT p2))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 285 ms. Reduced automaton from 9 states, 20 edges and 3 AP (stutter sensitive) to 9 states, 20 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 371 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) p1)]
RANDOM walk for 40000 steps (1122 resets) in 349 ms. (114 steps per ms) remains 5/10 properties
BEST_FIRST walk for 40004 steps (28 resets) in 145 ms. (274 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (42 resets) in 188 ms. (211 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40004 steps (44 resets) in 189 ms. (210 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (32 resets) in 147 ms. (270 steps per ms) remains 4/4 properties
// Phase 1: matrix 441 rows 2874 cols
[2024-05-25 15:47:12] [INFO ] Computed 2436 invariants in 47 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1682/1770 variables, 1624/1624 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1770 variables, 0/1624 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 350/2120 variables, 1770/3394 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2120 variables, 0/3394 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1137/3257 variables, 1046/4440 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3257 variables, 784/5224 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3257 variables, 0/5224 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 29/3286 variables, 28/5252 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3286 variables, 29/5281 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3286 variables, 0/5281 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 29/3315 variables, 29/5310 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3315 variables, 0/5310 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/3315 variables, 0/5310 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
Problem apf1 is UNSAT
After SMT solving in domain Real declared 3315/3315 variables, and 5310 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2833 ms.
Refiners :[Generalized P Invariants (flows): 2436/2436 constraints, State Equation: 2874/2874 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 1682/1770 variables, 1624/1624 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1770 variables, 0/1624 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 350/2120 variables, 1770/3394 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2120 variables, 0/3394 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1137/3257 variables, 1046/4440 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3257 variables, 784/5224 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3257 variables, 3/5227 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3257 variables, 0/5227 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 29/3286 variables, 28/5255 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3286 variables, 29/5284 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3286 variables, 0/5284 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 29/3315 variables, 29/5313 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3315 variables, 0/5313 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/3315 variables, 0/5313 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3315/3315 variables, and 5313 constraints, problems are : Problem set: 1 solved, 3 unsolved in 3606 ms.
Refiners :[Generalized P Invariants (flows): 2436/2436 constraints, State Equation: 2874/2874 constraints, PredecessorRefiner: 3/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 6531ms problems are : Problem set: 1 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Finished Parikh walk after 147 steps, including 0 resets, run visited all 3 properties in 12 ms. (steps per millisecond=12 )
Parikh walk visited 3 properties in 12 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (NOT p2)), (X (X (NOT p2))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (G (OR (NOT p1) p2 p0))]
False Knowledge obtained : [(F (NOT (OR p1 p0))), (F (NOT (OR (NOT p1) (NOT p2)))), (F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT (OR (NOT p1) p2))), (F p2), (F (NOT (OR p1 p2 p0))), (F (NOT p0)), (F (NOT (OR p1 (NOT p2)))), (F p1)]
Knowledge based reduction with 7 factoid took 1140 ms. Reduced automaton from 9 states, 20 edges and 3 AP (stutter sensitive) to 9 states, 19 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 418 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) p1)]
Stuttering acceptance computed with spot in 511 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) p1)]
[2024-05-25 15:47:21] [INFO ] Invariant cache hit.
[2024-05-25 15:47:29] [INFO ] [Real]Absence check using 0 positive and 2436 generalized place invariants in 6980 ms returned sat
[2024-05-25 15:47:36] [INFO ] [Real]Absence check using state equation in 7054 ms returned unknown
Could not prove EG (NOT p2)
Support contains 88 out of 2874 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2874/2874 places, 441/441 transitions.
Applied a total of 0 rules in 133 ms. Remains 2874 /2874 variables (removed 0) and now considering 441/441 (removed 0) transitions.
[2024-05-25 15:47:36] [INFO ] Invariant cache hit.
[2024-05-25 15:47:40] [INFO ] Implicit Places using invariants in 4017 ms returned []
[2024-05-25 15:47:40] [INFO ] Invariant cache hit.
[2024-05-25 15:47:47] [INFO ] Implicit Places using invariants and state equation in 6447 ms returned []
Implicit Place search using SMT with State Equation took 10466 ms to find 0 implicit places.
Running 382 sub problems to find dead transitions.
[2024-05-25 15:47:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2845 variables, 2436/2436 constraints. Problems are: Problem set: 0 solved, 382 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2845/3315 variables, and 2436 constraints, problems are : Problem set: 0 solved, 382 unsolved in 30013 ms.
Refiners :[Generalized P Invariants (flows): 2436/2436 constraints, State Equation: 0/2874 constraints, PredecessorRefiner: 382/382 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 382 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2845 variables, 2436/2436 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2845 variables, 0/2436 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 2 (OVERLAPS) 441/3286 variables, 2845/5281 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3286 variables, 382/5663 constraints. Problems are: Problem set: 0 solved, 382 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3286/3315 variables, and 5663 constraints, problems are : Problem set: 0 solved, 382 unsolved in 30027 ms.
Refiners :[Generalized P Invariants (flows): 2436/2436 constraints, State Equation: 2845/2874 constraints, PredecessorRefiner: 382/382 constraints, Known Traps: 0/0 constraints]
After SMT, in 60642ms problems are : Problem set: 0 solved, 382 unsolved
Search for dead transitions found 0 dead transitions in 60649ms
Finished structural reductions in LTL mode , in 1 iterations and 71250 ms. Remains : 2874/2874 places, 441/441 transitions.
Computed a total of 2874 stabilizing places and 441 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2874 transition count 441
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 p2) (NOT p1) p0), (X (NOT p2)), (X (X (NOT p2))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 288 ms. Reduced automaton from 9 states, 19 edges and 3 AP (stutter sensitive) to 9 states, 19 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 386 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) p1)]
RANDOM walk for 40000 steps (1126 resets) in 962 ms. (41 steps per ms) remains 3/9 properties
BEST_FIRST walk for 40004 steps (28 resets) in 116 ms. (341 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (44 resets) in 110 ms. (360 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (32 resets) in 88 ms. (449 steps per ms) remains 3/3 properties
[2024-05-25 15:48:49] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 1682/1770 variables, 1624/1624 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1770 variables, 0/1624 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 350/2120 variables, 1770/3394 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2120 variables, 0/3394 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1137/3257 variables, 1046/4440 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3257 variables, 784/5224 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3257 variables, 0/5224 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 29/3286 variables, 28/5252 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3286 variables, 29/5281 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3286 variables, 0/5281 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 29/3315 variables, 29/5310 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3315 variables, 0/5310 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/3315 variables, 0/5310 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3315/3315 variables, and 5310 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2152 ms.
Refiners :[Generalized P Invariants (flows): 2436/2436 constraints, State Equation: 2874/2874 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 1682/1770 variables, 1624/1624 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1770 variables, 0/1624 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 350/2120 variables, 1770/3394 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2120 variables, 0/3394 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1137/3257 variables, 1046/4440 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3257 variables, 784/5224 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3257 variables, 3/5227 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3257 variables, 0/5227 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 29/3286 variables, 28/5255 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3286 variables, 29/5284 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3286 variables, 0/5284 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 29/3315 variables, 29/5313 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3315 variables, 0/5313 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/3315 variables, 0/5313 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3315/3315 variables, and 5313 constraints, problems are : Problem set: 0 solved, 3 unsolved in 4643 ms.
Refiners :[Generalized P Invariants (flows): 2436/2436 constraints, State Equation: 2874/2874 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 6814ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Finished Parikh walk after 148 steps, including 0 resets, run visited all 3 properties in 10 ms. (steps per millisecond=14 )
Parikh walk visited 3 properties in 10 ms.
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (NOT p2)), (X (X (NOT p2))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (OR (NOT p1) p2))), (F (NOT (OR p1 p0))), (F (NOT (OR p1 (NOT p2)))), (F (NOT (AND (NOT p1) (NOT p2)))), (F p2), (F (NOT (OR (NOT p1) (NOT p2)))), (F (NOT (OR p2 p0))), (F p1), (F (NOT p0))]
Knowledge based reduction with 6 factoid took 1031 ms. Reduced automaton from 9 states, 19 edges and 3 AP (stutter sensitive) to 9 states, 19 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 471 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) p1)]
Stuttering acceptance computed with spot in 369 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) p1)]
[2024-05-25 15:48:58] [INFO ] Invariant cache hit.
[2024-05-25 15:49:06] [INFO ] [Real]Absence check using 0 positive and 2436 generalized place invariants in 7159 ms returned sat
[2024-05-25 15:49:13] [INFO ] [Real]Absence check using state equation in 6958 ms returned unknown
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 373 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) p1)]
Product exploration explored 100000 steps with 2817 reset in 461 ms.
Product exploration explored 100000 steps with 2809 reset in 481 ms.
Applying partial POR strategy [false, false, false, false, true, true, true, true, true]
Stuttering acceptance computed with spot in 374 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) p1)]
Support contains 88 out of 2874 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2874/2874 places, 441/441 transitions.
Applied a total of 0 rules in 153 ms. Remains 2874 /2874 variables (removed 0) and now considering 441/441 (removed 0) transitions.
[2024-05-25 15:49:15] [INFO ] Redundant transitions in 25 ms returned []
Running 382 sub problems to find dead transitions.
[2024-05-25 15:49:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2845 variables, 2436/2436 constraints. Problems are: Problem set: 0 solved, 382 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2845/3315 variables, and 2436 constraints, problems are : Problem set: 0 solved, 382 unsolved in 30022 ms.
Refiners :[Generalized P Invariants (flows): 2436/2436 constraints, State Equation: 0/2874 constraints, PredecessorRefiner: 382/382 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 382 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2845 variables, 2436/2436 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2845 variables, 0/2436 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 2 (OVERLAPS) 441/3286 variables, 2845/5281 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3286 variables, 382/5663 constraints. Problems are: Problem set: 0 solved, 382 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3286/3315 variables, and 5663 constraints, problems are : Problem set: 0 solved, 382 unsolved in 30032 ms.
Refiners :[Generalized P Invariants (flows): 2436/2436 constraints, State Equation: 2845/2874 constraints, PredecessorRefiner: 382/382 constraints, Known Traps: 0/0 constraints]
After SMT, in 60645ms problems are : Problem set: 0 solved, 382 unsolved
Search for dead transitions found 0 dead transitions in 60649ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60837 ms. Remains : 2874/2874 places, 441/441 transitions.
Support contains 88 out of 2874 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2874/2874 places, 441/441 transitions.
Applied a total of 0 rules in 133 ms. Remains 2874 /2874 variables (removed 0) and now considering 441/441 (removed 0) transitions.
[2024-05-25 15:50:15] [INFO ] Invariant cache hit.
[2024-05-25 15:50:19] [INFO ] Implicit Places using invariants in 4036 ms returned []
[2024-05-25 15:50:19] [INFO ] Invariant cache hit.
[2024-05-25 15:50:26] [INFO ] Implicit Places using invariants and state equation in 6232 ms returned []
Implicit Place search using SMT with State Equation took 10272 ms to find 0 implicit places.
Running 382 sub problems to find dead transitions.
[2024-05-25 15:50:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2845 variables, 2436/2436 constraints. Problems are: Problem set: 0 solved, 382 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2845/3315 variables, and 2436 constraints, problems are : Problem set: 0 solved, 382 unsolved in 30018 ms.
Refiners :[Generalized P Invariants (flows): 2436/2436 constraints, State Equation: 0/2874 constraints, PredecessorRefiner: 382/382 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 382 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2845 variables, 2436/2436 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2845 variables, 0/2436 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 2 (OVERLAPS) 441/3286 variables, 2845/5281 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3286 variables, 382/5663 constraints. Problems are: Problem set: 0 solved, 382 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3286/3315 variables, and 5663 constraints, problems are : Problem set: 0 solved, 382 unsolved in 30019 ms.
Refiners :[Generalized P Invariants (flows): 2436/2436 constraints, State Equation: 2845/2874 constraints, PredecessorRefiner: 382/382 constraints, Known Traps: 0/0 constraints]
After SMT, in 60622ms problems are : Problem set: 0 solved, 382 unsolved
Search for dead transitions found 0 dead transitions in 60629ms
Finished structural reductions in LTL mode , in 1 iterations and 71037 ms. Remains : 2874/2874 places, 441/441 transitions.
Treatment of property QuasiCertifProtocol-COL-28-LTLCardinality-13 finished in 268267 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((p0 U (G(p0)||(p0&&(p1||F(!p2)))))) U (!p0&&G(p3))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
[2024-05-25 15:51:27] [INFO ] Flatten gal took : 86 ms
[2024-05-25 15:51:27] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-05-25 15:51:27] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2998 places, 446 transitions and 6489 arcs took 7 ms.
Total runtime 1264905 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running QuasiCertifProtocol-COL-28

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/411/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 2998
TRANSITIONS: 446
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.036s, Sys 0.004s]


SAVING FILE /home/mcc/execution/411/model (.net / .def) ...
EXPORT TIME: [User 0.005s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 2328
MODEL NAME: /home/mcc/execution/411/model
2998 places, 446 transitions.

No place bound informations found.
No place bound informations found.
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
No place bound informations found.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.

BK_TIME_CONFINEMENT_REACHED

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

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-28"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is QuasiCertifProtocol-COL-28, 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 r311-tall-171662335700043"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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