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-171662335700036.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-22, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r311-tall-171662335700036
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 600K
-rw-r--r-- 1 mcc users 7.7K Apr 13 04:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K Apr 13 04:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Apr 13 04:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Apr 13 04:03 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 3.7K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 13 04:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 143K Apr 13 04:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Apr 13 04:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K Apr 13 04:17 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 104K 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-22-LTLFireability-00
FORMULA_NAME QuasiCertifProtocol-COL-22-LTLFireability-01
FORMULA_NAME QuasiCertifProtocol-COL-22-LTLFireability-02
FORMULA_NAME QuasiCertifProtocol-COL-22-LTLFireability-03
FORMULA_NAME QuasiCertifProtocol-COL-22-LTLFireability-04
FORMULA_NAME QuasiCertifProtocol-COL-22-LTLFireability-05
FORMULA_NAME QuasiCertifProtocol-COL-22-LTLFireability-06
FORMULA_NAME QuasiCertifProtocol-COL-22-LTLFireability-07
FORMULA_NAME QuasiCertifProtocol-COL-22-LTLFireability-08
FORMULA_NAME QuasiCertifProtocol-COL-22-LTLFireability-09
FORMULA_NAME QuasiCertifProtocol-COL-22-LTLFireability-10
FORMULA_NAME QuasiCertifProtocol-COL-22-LTLFireability-11
FORMULA_NAME QuasiCertifProtocol-COL-22-LTLFireability-12
FORMULA_NAME QuasiCertifProtocol-COL-22-LTLFireability-13
FORMULA_NAME QuasiCertifProtocol-COL-22-LTLFireability-14
FORMULA_NAME QuasiCertifProtocol-COL-22-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716647936990

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-COL-22
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-25 14:38:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-25 14:38:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 14:38:58] [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 14:38:58] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-25 14:38:58] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 619 ms
[2024-05-25 14:38:58] [INFO ] Imported 30 HL places and 26 HL transitions for a total of 1966 PT places and 356.0 transition bindings in 21 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
[2024-05-25 14:38:59] [INFO ] Built PT skeleton of HLPN with 30 places and 26 transitions 77 arcs in 5 ms.
[2024-05-25 14:38:59] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Computed a total of 30 stabilizing places and 26 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 30 transition count 26
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Remains 12 properties that can be checked using skeleton over-approximation.
Computed a total of 30 stabilizing places and 26 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 30 transition count 26
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Reduction of identical properties reduced properties to check from 16 to 13
RANDOM walk for 29183 steps (908 resets) in 343 ms. (84 steps per ms) remains 0/13 properties
[2024-05-25 14:38:59] [INFO ] Flatten gal took : 19 ms
[2024-05-25 14:38:59] [INFO ] Flatten gal took : 5 ms
Domain [tsid(23), tsid(23)] of place n9 breaks symmetries in sort tsid
[2024-05-25 14:38:59] [INFO ] Unfolded HLPN to a Petri net with 1966 places and 356 transitions 4323 arcs in 67 ms.
[2024-05-25 14:38:59] [INFO ] Unfolded 16 HLPN properties in 0 ms.
Initial state reduction rules removed 1 formulas.
FORMULA QuasiCertifProtocol-COL-22-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 811 out of 1966 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1966/1966 places, 356/356 transitions.
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 0 with 50 rules applied. Total rules applied 50 place count 1916 transition count 356
Applied a total of 50 rules in 163 ms. Remains 1916 /1966 variables (removed 50) and now considering 356/356 (removed 0) transitions.
// Phase 1: matrix 356 rows 1916 cols
[2024-05-25 14:38:59] [INFO ] Computed 1562 invariants in 120 ms
[2024-05-25 14:39:02] [INFO ] Implicit Places using invariants in 2262 ms returned []
[2024-05-25 14:39:02] [INFO ] Invariant cache hit.
[2024-05-25 14:39:05] [INFO ] Implicit Places using invariants and state equation in 3078 ms returned []
Implicit Place search using SMT with State Equation took 5374 ms to find 0 implicit places.
Running 332 sub problems to find dead transitions.
[2024-05-25 14:39:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1915 variables, 1562/1562 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1915 variables, 0/1562 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 356/2271 variables, 1915/3477 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2271/2272 variables, and 3477 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30023 ms.
Refiners :[Generalized P Invariants (flows): 1562/1562 constraints, State Equation: 1915/1916 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 332 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1915 variables, 1562/1562 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1915 variables, 0/1562 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 356/2271 variables, 1915/3477 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2271 variables, 332/3809 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2271/2272 variables, and 3809 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30020 ms.
Refiners :[Generalized P Invariants (flows): 1562/1562 constraints, State Equation: 1915/1916 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 0/0 constraints]
After SMT, in 60638ms problems are : Problem set: 0 solved, 332 unsolved
Search for dead transitions found 0 dead transitions in 60659ms
Starting structural reductions in LTL mode, iteration 1 : 1916/1966 places, 356/356 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 66214 ms. Remains : 1916/1966 places, 356/356 transitions.
Support contains 811 out of 1916 places after structural reductions.
[2024-05-25 14:40:05] [INFO ] Flatten gal took : 148 ms
[2024-05-25 14:40:06] [INFO ] Flatten gal took : 109 ms
[2024-05-25 14:40:06] [INFO ] Input system was already deterministic with 356 transitions.
Reduction of identical properties reduced properties to check from 20 to 19
RANDOM walk for 40000 steps (1482 resets) in 2248 ms. (17 steps per ms) remains 15/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 66 ms. (59 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 84 ms. (47 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (9 resets) in 322 ms. (12 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (10 resets) in 15 ms. (250 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (9 resets) in 22 ms. (174 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (9 resets) in 16 ms. (235 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (11 resets) in 22 ms. (174 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (11 resets) in 50 ms. (78 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 147 ms. (27 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (11 resets) in 18 ms. (210 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 15/15 properties
[2024-05-25 14:40:07] [INFO ] Invariant cache hit.
Problem AtomicPropp3 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 528/528 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 0/528 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 2 (OVERLAPS) 575/1340 variables, 550/1078 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1340 variables, 0/1078 constraints. Problems are: Problem set: 1 solved, 14 unsolved
Problem AtomicPropp16 is UNSAT
At refinement iteration 4 (OVERLAPS) 355/1695 variables, 1340/2418 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1695 variables, 0/2418 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 6 (OVERLAPS) 577/2272 variables, 576/2994 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2272 variables, 484/3478 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2272 variables, 0/3478 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 9 (OVERLAPS) 0/2272 variables, 0/3478 constraints. Problems are: Problem set: 2 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2272/2272 variables, and 3478 constraints, problems are : Problem set: 2 solved, 13 unsolved in 5023 ms.
Refiners :[Generalized P Invariants (flows): 1562/1562 constraints, State Equation: 1916/1916 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/764 variables, 528/528 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/764 variables, 0/528 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 575/1339 variables, 550/1078 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1339 variables, 0/1078 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 355/1694 variables, 1339/2417 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1694 variables, 7/2424 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1694 variables, 0/2424 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 578/2272 variables, 577/3001 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2272 variables, 484/3485 constraints. Problems are: Problem set: 2 solved, 13 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2272/2272 variables, and 3491 constraints, problems are : Problem set: 2 solved, 13 unsolved in 5073 ms.
Refiners :[Generalized P Invariants (flows): 1562/1562 constraints, State Equation: 1916/1916 constraints, PredecessorRefiner: 13/15 constraints, Known Traps: 0/0 constraints]
After SMT, in 10227ms problems are : Problem set: 2 solved, 13 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 764 out of 1916 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Graph (complete) has 15277 edges and 1916 vertex of which 1892 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.9 ms
Discarding 24 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Applied a total of 1 rules in 90 ms. Remains 1892 /1916 variables (removed 24) and now considering 354/356 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 90 ms. Remains : 1892/1916 places, 354/356 transitions.
RANDOM walk for 40000 steps (1485 resets) in 1002 ms. (39 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (70 resets) in 203 ms. (196 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (85 resets) in 926 ms. (43 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (88 resets) in 99 ms. (400 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (84 resets) in 215 ms. (185 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (92 resets) in 86 ms. (459 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (85 resets) in 108 ms. (367 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (32 resets) in 127 ms. (312 steps per ms) remains 12/13 properties
BEST_FIRST walk for 40003 steps (82 resets) in 113 ms. (350 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (67 resets) in 163 ms. (243 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (90 resets) in 108 ms. (367 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (85 resets) in 178 ms. (223 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (88 resets) in 104 ms. (380 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (69 resets) in 150 ms. (264 steps per ms) remains 12/12 properties
Finished probabilistic random walk after 4614 steps, run visited all 12 properties in 141 ms. (steps per millisecond=32 )
Probabilistic random walk after 4614 steps, saw 4496 distinct states, run finished after 148 ms. (steps per millisecond=31 ) properties seen :12
Successfully simplified 2 atomic propositions for a total of 15 simplifications.
Computed a total of 1916 stabilizing places and 356 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1916 transition count 356
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(!p0) U (X(G(!p0))||(X(!p0)&&(X(p1) U (X(G(p1))||(X(p1)&&G(p2))))))))'
Support contains 577 out of 1916 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Applied a total of 0 rules in 121 ms. Remains 1916 /1916 variables (removed 0) and now considering 356/356 (removed 0) transitions.
[2024-05-25 14:40:19] [INFO ] Invariant cache hit.
[2024-05-25 14:40:21] [INFO ] Implicit Places using invariants in 1842 ms returned []
[2024-05-25 14:40:21] [INFO ] Invariant cache hit.
[2024-05-25 14:40:24] [INFO ] Implicit Places using invariants and state equation in 3103 ms returned []
Implicit Place search using SMT with State Equation took 4953 ms to find 0 implicit places.
Running 332 sub problems to find dead transitions.
[2024-05-25 14:40:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1915 variables, 1562/1562 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1915 variables, 0/1562 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 356/2271 variables, 1915/3477 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2271/2272 variables, and 3477 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30020 ms.
Refiners :[Generalized P Invariants (flows): 1562/1562 constraints, State Equation: 1915/1916 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 332 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1915 variables, 1562/1562 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1915 variables, 0/1562 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 356/2271 variables, 1915/3477 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2271 variables, 332/3809 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2271/2272 variables, and 3809 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30018 ms.
Refiners :[Generalized P Invariants (flows): 1562/1562 constraints, State Equation: 1915/1916 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 0/0 constraints]
After SMT, in 60490ms problems are : Problem set: 0 solved, 332 unsolved
Search for dead transitions found 0 dead transitions in 60496ms
Finished structural reductions in LTL mode , in 1 iterations and 65573 ms. Remains : 1916/1916 places, 356/356 transitions.
Stuttering acceptance computed with spot in 627 ms :[true, p0, (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) (NOT p1)), (AND p0 (NOT p2)), (NOT p1), (NOT p1), (AND p0 (NOT p1)), (AND p0 (NOT p1)), p0, p0, (NOT p2)]
Running random walk in product with property : QuasiCertifProtocol-COL-22-LTLFireability-00
Product exploration explored 100000 steps with 3716 reset in 1135 ms.
Product exploration explored 100000 steps with 3710 reset in 1055 ms.
Computed a total of 1916 stabilizing places and 356 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1916 transition count 356
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 p0) p1), (X (NOT p2)), (X (NOT (AND p2 (NOT p0) p1))), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND p2 p0 p1)))), (F (G (NOT p2))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (AND (NOT p2) (NOT p0) (NOT p1))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (AND (NOT p2) (NOT p0) p1)), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X p1), (X (NOT p1)), (X (X (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (X (X (AND (NOT p2) (NOT p0) p1))), (X (X (NOT (AND (NOT p2) (NOT p0) p1))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 17 factoid took 651 ms. Reduced automaton from 12 states, 53 edges and 3 AP (stutter sensitive) to 17 states, 82 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 728 ms :[true, (AND p0 (NOT p2)), (AND (NOT p2) p0 (NOT p1)), (NOT p2), (AND (NOT p1) (NOT p2)), p0, (AND p0 (NOT p1)), (NOT p1), (NOT p1), (NOT p1), p0, p0, p0, p0, p0, p0, (AND p0 (NOT p1))]
RANDOM walk for 40000 steps (1485 resets) in 1075 ms. (37 steps per ms) remains 13/18 properties
BEST_FIRST walk for 40004 steps (92 resets) in 810 ms. (49 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (71 resets) in 1720 ms. (23 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (115 resets) in 1672 ms. (23 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (46 resets) in 129 ms. (307 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (45 resets) in 714 ms. (55 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (120 resets) in 520 ms. (76 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (118 resets) in 568 ms. (70 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (46 resets) in 599 ms. (66 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (51 resets) in 550 ms. (72 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (51 resets) in 603 ms. (66 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (120 resets) in 571 ms. (69 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (70 resets) in 677 ms. (59 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (68 resets) in 117 ms. (339 steps per ms) remains 13/13 properties
[2024-05-25 14:41:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/577 variables, 506/506 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/577 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 529/1106 variables, 506/1012 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1106 variables, 0/1012 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Problem apf6 is UNSAT
Problem apf7 is UNSAT
At refinement iteration 4 (OVERLAPS) 254/1360 variables, 1106/2118 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1360 variables, 0/2118 constraints. Problems are: Problem set: 2 solved, 11 unsolved
Problem apf2 is UNSAT
Problem apf5 is UNSAT
Problem apf12 is UNSAT
Problem apf1 is UNSAT
At refinement iteration 6 (OVERLAPS) 785/2145 variables, 691/2809 constraints. Problems are: Problem set: 5 solved, 8 unsolved
Problem apf1 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/2145 variables, 484/3293 constraints. Problems are: Problem set: 6 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2145 variables, 0/3293 constraints. Problems are: Problem set: 6 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 23/2168 variables, 22/3315 constraints. Problems are: Problem set: 6 solved, 7 unsolved
SMT process timed out in 5906ms, After SMT, problems are : Problem set: 6 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 577 out of 1916 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Graph (complete) has 15277 edges and 1916 vertex of which 1363 are kept as prefixes of interest. Removing 553 places using SCC suffix rule.7 ms
Discarding 553 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Drop transitions (Empty/Sink Transition effects.) removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 29 rules applied. Total rules applied 30 place count 1363 transition count 325
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 32 place count 1361 transition count 325
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 54 place count 1339 transition count 303
Iterating global reduction 2 with 22 rules applied. Total rules applied 76 place count 1339 transition count 303
Free-agglomeration rule (complex) applied 23 times.
Iterating global reduction 2 with 23 rules applied. Total rules applied 99 place count 1339 transition count 280
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 2 with 23 rules applied. Total rules applied 122 place count 1316 transition count 280
Applied a total of 122 rules in 156 ms. Remains 1316 /1916 variables (removed 600) and now considering 280/356 (removed 76) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 157 ms. Remains : 1316/1916 places, 280/356 transitions.
RANDOM walk for 40000 steps (1539 resets) in 934 ms. (42 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (89 resets) in 556 ms. (71 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (48 resets) in 181 ms. (219 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (48 resets) in 749 ms. (53 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (51 resets) in 667 ms. (59 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (51 resets) in 657 ms. (60 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (75 resets) in 719 ms. (55 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (75 resets) in 127 ms. (312 steps per ms) remains 7/7 properties
Finished probabilistic random walk after 3709 steps, run visited all 7 properties in 152 ms. (steps per millisecond=24 )
Probabilistic random walk after 3709 steps, saw 3616 distinct states, run finished after 153 ms. (steps per millisecond=24 ) properties seen :7
Found 6 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT p2)), (X (NOT (AND p2 (NOT p0) p1))), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND p2 p0 p1)))), (F (G (NOT p2))), (F (G (NOT p0))), (F (G (NOT p1))), (G (OR p1 (NOT p2) (NOT p0))), (G (OR (NOT p1) (NOT p2) (NOT p0))), (G (OR (NOT p1) (NOT p2))), (G (OR (NOT p1) (NOT p2) p0)), (G (OR (NOT p1) p2 (NOT p0))), (G (OR (NOT p2) (NOT p0)))]
False Knowledge obtained : [(X (AND (NOT p2) (NOT p0) (NOT p1))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (AND (NOT p2) (NOT p0) p1)), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X p1), (X (NOT p1)), (X (X (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (X (X (AND (NOT p2) (NOT p0) p1))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (F (NOT (OR p1 (NOT p2)))), (F (NOT (OR p1 p2 p0))), (F (NOT (OR p1 p2))), (F (NOT (OR p1 p2 (NOT p0)))), (F (NOT (OR p2 (NOT p0)))), (F (NOT (OR p1 (NOT p0)))), (F (NOT (AND p1 (NOT p2) (NOT p0)))), (F p2), (F (NOT p1)), (F p0), (F (NOT (AND p1 (NOT p2)))), (F (NOT (OR p1 (NOT p2) p0)))]
Property proved to be false thanks to negative knowledge :(F (NOT (OR p1 p2 (NOT p0))))
Knowledge based reduction with 23 factoid took 834 ms. Reduced automaton from 17 states, 82 edges and 3 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-COL-22-LTLFireability-00 FALSE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-22-LTLFireability-00 finished in 81458 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&F(p1))))'
Support contains 47 out of 1916 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Graph (complete) has 15277 edges and 1916 vertex of which 1892 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.19 ms
Discarding 24 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 1891 transition count 353
Applied a total of 3 rules in 347 ms. Remains 1891 /1916 variables (removed 25) and now considering 353/356 (removed 3) transitions.
// Phase 1: matrix 353 rows 1891 cols
[2024-05-25 14:41:41] [INFO ] Computed 1540 invariants in 60 ms
[2024-05-25 14:41:43] [INFO ] Implicit Places using invariants in 2084 ms returned []
[2024-05-25 14:41:43] [INFO ] Invariant cache hit.
[2024-05-25 14:41:48] [INFO ] Implicit Places using invariants and state equation in 4782 ms returned [1680, 1681, 1682, 1683, 1684, 1685, 1686, 1687, 1688, 1689, 1690, 1691, 1692, 1693, 1694, 1695, 1696, 1697, 1698, 1699, 1700, 1701, 1702, 1726, 1727, 1728, 1729, 1730, 1731, 1732, 1733, 1734, 1735, 1736, 1737, 1738, 1739, 1740, 1741, 1742, 1743, 1744, 1745, 1746, 1747, 1748]
Discarding 46 places :
Implicit Place search using SMT with State Equation took 6877 ms to find 46 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1845/1916 places, 353/356 transitions.
Applied a total of 0 rules in 86 ms. Remains 1845 /1845 variables (removed 0) and now considering 353/353 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 7312 ms. Remains : 1845/1916 places, 353/356 transitions.
Stuttering acceptance computed with spot in 89 ms :[(NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : QuasiCertifProtocol-COL-22-LTLFireability-01
Stuttering criterion allowed to conclude after 26 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-COL-22-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-22-LTLFireability-01 finished in 7420 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F((p0&&X(p1)))))))'
Support contains 70 out of 1916 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Applied a total of 0 rules in 72 ms. Remains 1916 /1916 variables (removed 0) and now considering 356/356 (removed 0) transitions.
// Phase 1: matrix 356 rows 1916 cols
[2024-05-25 14:41:48] [INFO ] Computed 1562 invariants in 34 ms
[2024-05-25 14:41:51] [INFO ] Implicit Places using invariants in 2245 ms returned []
[2024-05-25 14:41:51] [INFO ] Invariant cache hit.
[2024-05-25 14:41:54] [INFO ] Implicit Places using invariants and state equation in 3493 ms returned [1749, 1750, 1751, 1752, 1753, 1754, 1755, 1756, 1757, 1758, 1759, 1760, 1761, 1762, 1763, 1764, 1765, 1766, 1767, 1768, 1769, 1770, 1771]
Discarding 23 places :
Implicit Place search using SMT with State Equation took 5741 ms to find 23 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1893/1916 places, 356/356 transitions.
Applied a total of 0 rules in 64 ms. Remains 1893 /1893 variables (removed 0) and now considering 356/356 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 5877 ms. Remains : 1893/1916 places, 356/356 transitions.
Stuttering acceptance computed with spot in 196 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : QuasiCertifProtocol-COL-22-LTLFireability-02
Stuttering criterion allowed to conclude after 30 steps with 1 reset in 1 ms.
FORMULA QuasiCertifProtocol-COL-22-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-22-LTLFireability-02 finished in 6099 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(!p0))))'
Support contains 46 out of 1916 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Applied a total of 0 rules in 68 ms. Remains 1916 /1916 variables (removed 0) and now considering 356/356 (removed 0) transitions.
[2024-05-25 14:41:54] [INFO ] Invariant cache hit.
[2024-05-25 14:41:57] [INFO ] Implicit Places using invariants in 2242 ms returned []
[2024-05-25 14:41:57] [INFO ] Invariant cache hit.
[2024-05-25 14:42:03] [INFO ] Implicit Places using invariants and state equation in 6301 ms returned [1749, 1750, 1751, 1752, 1753, 1754, 1755, 1756, 1757, 1758, 1759, 1760, 1761, 1762, 1763, 1764, 1765, 1766, 1767, 1768, 1769, 1770, 1771]
Discarding 23 places :
Implicit Place search using SMT with State Equation took 8552 ms to find 23 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1893/1916 places, 356/356 transitions.
Applied a total of 0 rules in 68 ms. Remains 1893 /1893 variables (removed 0) and now considering 356/356 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 8688 ms. Remains : 1893/1916 places, 356/356 transitions.
Stuttering acceptance computed with spot in 110 ms :[p0, p0, p0]
Running random walk in product with property : QuasiCertifProtocol-COL-22-LTLFireability-03
Product exploration explored 100000 steps with 33333 reset in 439 ms.
Product exploration explored 100000 steps with 33333 reset in 437 ms.
Computed a total of 1893 stabilizing places and 356 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1893 transition count 356
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 (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 18 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-COL-22-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-22-LTLFireability-03 finished in 10034 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p0) U (X(X(X(p1)))&&F(p2))))))'
Support contains 71 out of 1916 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Applied a total of 0 rules in 74 ms. Remains 1916 /1916 variables (removed 0) and now considering 356/356 (removed 0) transitions.
[2024-05-25 14:42:04] [INFO ] Invariant cache hit.
[2024-05-25 14:42:07] [INFO ] Implicit Places using invariants in 2202 ms returned []
[2024-05-25 14:42:07] [INFO ] Invariant cache hit.
[2024-05-25 14:42:11] [INFO ] Implicit Places using invariants and state equation in 3911 ms returned [1749, 1750, 1751, 1752, 1753, 1754, 1755, 1756, 1757, 1758, 1759, 1760, 1761, 1762, 1763, 1764, 1765, 1766, 1767, 1768, 1769, 1770, 1771]
Discarding 23 places :
Implicit Place search using SMT with State Equation took 6115 ms to find 23 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1893/1916 places, 356/356 transitions.
Applied a total of 0 rules in 67 ms. Remains 1893 /1893 variables (removed 0) and now considering 356/356 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 6256 ms. Remains : 1893/1916 places, 356/356 transitions.
Stuttering acceptance computed with spot in 590 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (NOT p1), (NOT p1), (NOT p1), true, (AND (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-22-LTLFireability-04
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-22-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-22-LTLFireability-04 finished in 6875 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0 U X((F(!p1)&&X(X(G(!p2)))))))))'
Support contains 71 out of 1916 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Graph (complete) has 15277 edges and 1916 vertex of which 1892 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.6 ms
Discarding 24 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 1891 transition count 353
Applied a total of 3 rules in 164 ms. Remains 1891 /1916 variables (removed 25) and now considering 353/356 (removed 3) transitions.
// Phase 1: matrix 353 rows 1891 cols
[2024-05-25 14:42:11] [INFO ] Computed 1540 invariants in 33 ms
[2024-05-25 14:42:13] [INFO ] Implicit Places using invariants in 2106 ms returned []
[2024-05-25 14:42:14] [INFO ] Invariant cache hit.
[2024-05-25 14:42:24] [INFO ] Implicit Places using invariants and state equation in 10089 ms returned [1726, 1727, 1728, 1729, 1730, 1731, 1732, 1733, 1734, 1735, 1736, 1737, 1738, 1739, 1740, 1741, 1742, 1743, 1744, 1745, 1746, 1747, 1748]
Discarding 23 places :
Implicit Place search using SMT with State Equation took 12201 ms to find 23 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1868/1916 places, 353/356 transitions.
Applied a total of 0 rules in 78 ms. Remains 1868 /1868 variables (removed 0) and now considering 353/353 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 12443 ms. Remains : 1868/1916 places, 353/356 transitions.
Stuttering acceptance computed with spot in 707 ms :[(OR p1 p2), (OR p1 p2), (OR p1 p2), p2, p2, p1, p2, p2, p2, (AND p1 p2), p2, p2, p2, p2]
Running random walk in product with property : QuasiCertifProtocol-COL-22-LTLFireability-05
Product exploration explored 100000 steps with 3715 reset in 431 ms.
Product exploration explored 100000 steps with 3718 reset in 496 ms.
Computed a total of 1868 stabilizing places and 353 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1868 transition count 353
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p1)), (X (X (NOT p1))), (F (G (NOT p0))), (F (G (NOT p1))), (F (G (NOT p2)))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 21 ms. Reduced automaton from 14 states, 61 edges and 3 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-COL-22-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-22-LTLFireability-05 finished in 14447 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)||G(F(p1)))))'
Support contains 47 out of 1916 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Applied a total of 0 rules in 68 ms. Remains 1916 /1916 variables (removed 0) and now considering 356/356 (removed 0) transitions.
// Phase 1: matrix 356 rows 1916 cols
[2024-05-25 14:42:26] [INFO ] Computed 1562 invariants in 31 ms
[2024-05-25 14:42:28] [INFO ] Implicit Places using invariants in 2265 ms returned []
[2024-05-25 14:42:28] [INFO ] Invariant cache hit.
[2024-05-25 14:42:34] [INFO ] Implicit Places using invariants and state equation in 6280 ms returned [1749, 1750, 1751, 1752, 1753, 1754, 1755, 1756, 1757, 1758, 1759, 1760, 1761, 1762, 1763, 1764, 1765, 1766, 1767, 1768, 1769, 1770, 1771]
Discarding 23 places :
Implicit Place search using SMT with State Equation took 8553 ms to find 23 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1893/1916 places, 356/356 transitions.
Applied a total of 0 rules in 60 ms. Remains 1893 /1893 variables (removed 0) and now considering 356/356 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 8681 ms. Remains : 1893/1916 places, 356/356 transitions.
Stuttering acceptance computed with spot in 165 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-COL-22-LTLFireability-06
Stuttering criterion allowed to conclude after 27 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-22-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-22-LTLFireability-06 finished in 8861 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 46 out of 1916 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Graph (complete) has 15277 edges and 1916 vertex of which 1892 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.4 ms
Discarding 24 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
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 1890 transition count 352
Applied a total of 5 rules in 146 ms. Remains 1890 /1916 variables (removed 26) and now considering 352/356 (removed 4) transitions.
// Phase 1: matrix 352 rows 1890 cols
[2024-05-25 14:42:35] [INFO ] Computed 1540 invariants in 32 ms
[2024-05-25 14:42:37] [INFO ] Implicit Places using invariants in 2190 ms returned []
[2024-05-25 14:42:37] [INFO ] Invariant cache hit.
[2024-05-25 14:42:56] [INFO ] Implicit Places using invariants and state equation in 19057 ms returned [1726, 1727, 1728, 1729, 1730, 1731, 1732, 1733, 1734, 1735, 1736, 1737, 1738, 1739, 1740, 1741, 1742, 1743, 1744, 1745, 1746, 1747, 1748]
Discarding 23 places :
Implicit Place search using SMT with State Equation took 21249 ms to find 23 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1867/1916 places, 352/356 transitions.
Applied a total of 0 rules in 75 ms. Remains 1867 /1867 variables (removed 0) and now considering 352/352 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 21471 ms. Remains : 1867/1916 places, 352/356 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-22-LTLFireability-07
Stuttering criterion allowed to conclude after 25 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-22-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-22-LTLFireability-07 finished in 21524 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((F(G(!p0))&&(G(F(p2))||p1))))'
Support contains 576 out of 1916 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Graph (complete) has 15277 edges and 1916 vertex of which 1892 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.4 ms
Discarding 24 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 1889 transition count 351
Applied a total of 5 rules in 82 ms. Remains 1889 /1916 variables (removed 27) and now considering 351/356 (removed 5) transitions.
// Phase 1: matrix 351 rows 1889 cols
[2024-05-25 14:42:56] [INFO ] Computed 1540 invariants in 30 ms
[2024-05-25 14:42:58] [INFO ] Implicit Places using invariants in 1762 ms returned []
[2024-05-25 14:42:58] [INFO ] Invariant cache hit.
[2024-05-25 14:43:01] [INFO ] Implicit Places using invariants and state equation in 3277 ms returned [1680, 1681, 1682, 1683, 1684, 1685, 1686, 1687, 1688, 1689, 1690, 1691, 1692, 1693, 1694, 1695, 1696, 1697, 1698, 1699, 1700, 1701, 1702]
Discarding 23 places :
Implicit Place search using SMT with State Equation took 5042 ms to find 23 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1866/1916 places, 351/356 transitions.
Applied a total of 0 rules in 45 ms. Remains 1866 /1866 variables (removed 0) and now considering 351/351 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 5169 ms. Remains : 1866/1916 places, 351/356 transitions.
Stuttering acceptance computed with spot in 159 ms :[(OR p0 (AND (NOT p1) (NOT p2))), p0, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : QuasiCertifProtocol-COL-22-LTLFireability-08
Product exploration explored 100000 steps with 3475 reset in 563 ms.
Product exploration explored 100000 steps with 3473 reset in 567 ms.
Computed a total of 1866 stabilizing places and 351 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1866 transition count 351
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) p2 (NOT p0)), (X p2), (X (NOT p0)), (X (NOT p1)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X p2)), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (G (NOT p1))), (F (G p2)), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 12 factoid took 21 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-COL-22-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-22-LTLFireability-08 finished in 6857 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(p0))&&(X(p1) U p2))))'
Support contains 599 out of 1916 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Applied a total of 0 rules in 36 ms. Remains 1916 /1916 variables (removed 0) and now considering 356/356 (removed 0) transitions.
// Phase 1: matrix 356 rows 1916 cols
[2024-05-25 14:43:03] [INFO ] Computed 1562 invariants in 34 ms
[2024-05-25 14:43:05] [INFO ] Implicit Places using invariants in 1795 ms returned []
[2024-05-25 14:43:05] [INFO ] Invariant cache hit.
[2024-05-25 14:43:11] [INFO ] Implicit Places using invariants and state equation in 5819 ms returned []
Implicit Place search using SMT with State Equation took 7615 ms to find 0 implicit places.
Running 332 sub problems to find dead transitions.
[2024-05-25 14:43:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1915 variables, 1562/1562 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1915 variables, 0/1562 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 356/2271 variables, 1915/3477 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2271/2272 variables, and 3477 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30013 ms.
Refiners :[Generalized P Invariants (flows): 1562/1562 constraints, State Equation: 1915/1916 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 332 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1915 variables, 1562/1562 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1915 variables, 0/1562 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 356/2271 variables, 1915/3477 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2271 variables, 332/3809 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2271/2272 variables, and 3809 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30030 ms.
Refiners :[Generalized P Invariants (flows): 1562/1562 constraints, State Equation: 1915/1916 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 0/0 constraints]
After SMT, in 60465ms problems are : Problem set: 0 solved, 332 unsolved
Search for dead transitions found 0 dead transitions in 60470ms
Finished structural reductions in LTL mode , in 1 iterations and 68124 ms. Remains : 1916/1916 places, 356/356 transitions.
Stuttering acceptance computed with spot in 197 ms :[(NOT p0), (OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2) (NOT p1)), true, (OR (NOT p2) (NOT p0))]
Running random walk in product with property : QuasiCertifProtocol-COL-22-LTLFireability-10
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-22-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-22-LTLFireability-10 finished in 68341 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||G(!p1)))&&X(X(G(!p2)))))'
Support contains 599 out of 1916 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Applied a total of 0 rules in 33 ms. Remains 1916 /1916 variables (removed 0) and now considering 356/356 (removed 0) transitions.
[2024-05-25 14:44:11] [INFO ] Invariant cache hit.
[2024-05-25 14:44:13] [INFO ] Implicit Places using invariants in 1789 ms returned []
[2024-05-25 14:44:13] [INFO ] Invariant cache hit.
[2024-05-25 14:44:19] [INFO ] Implicit Places using invariants and state equation in 5616 ms returned []
Implicit Place search using SMT with State Equation took 7410 ms to find 0 implicit places.
Running 332 sub problems to find dead transitions.
[2024-05-25 14:44:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1915 variables, 1562/1562 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1915 variables, 0/1562 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 356/2271 variables, 1915/3477 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2271/2272 variables, and 3477 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30024 ms.
Refiners :[Generalized P Invariants (flows): 1562/1562 constraints, State Equation: 1915/1916 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 332 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1915 variables, 1562/1562 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1915 variables, 0/1562 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 356/2271 variables, 1915/3477 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2271 variables, 332/3809 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2271/2272 variables, and 3809 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30020 ms.
Refiners :[Generalized P Invariants (flows): 1562/1562 constraints, State Equation: 1915/1916 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 0/0 constraints]
After SMT, in 60445ms problems are : Problem set: 0 solved, 332 unsolved
Search for dead transitions found 0 dead transitions in 60451ms
Finished structural reductions in LTL mode , in 1 iterations and 67896 ms. Remains : 1916/1916 places, 356/356 transitions.
Stuttering acceptance computed with spot in 201 ms :[true, (OR p2 p1), (OR p2 p1), (OR p2 (AND p0 p1)), (OR p2 (AND p0 p1)), (OR p2 (AND p0 p1))]
Running random walk in product with property : QuasiCertifProtocol-COL-22-LTLFireability-11
Product exploration explored 100000 steps with 3714 reset in 496 ms.
Product exploration explored 100000 steps with 3713 reset in 527 ms.
Computed a total of 1916 stabilizing places and 356 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1916 transition count 356
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT (AND p0 p1))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (OR p1 p2)))), (X (X (NOT (OR (AND p0 p1) p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p1))), (F (G (NOT p1))), (F (G (NOT p2))), (F (G (NOT p0)))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 11 factoid took 890 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 186 ms :[true, (OR p2 p1), (OR p2 (AND p0 p1)), (OR p2 (AND p0 p1)), (OR p2 (AND p0 p1))]
Reduction of identical properties reduced properties to check from 8 to 7
RANDOM walk for 40000 steps (1483 resets) in 483 ms. (82 steps per ms) remains 4/7 properties
BEST_FIRST walk for 40003 steps (92 resets) in 635 ms. (62 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (92 resets) in 615 ms. (64 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (49 resets) in 765 ms. (52 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (90 resets) in 124 ms. (320 steps per ms) remains 4/4 properties
[2024-05-25 14:45:23] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/599 variables, 506/506 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/599 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 552/1151 variables, 528/1034 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1151 variables, 0/1034 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 120/1271 variables, 1151/2185 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1271 variables, 0/2185 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 403/1674 variables, 167/2352 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1674 variables, 0/2352 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 46/1720 variables, 44/2396 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1720 variables, 46/2442 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1720 variables, 0/2442 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 552/2272 variables, 552/2994 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2272 variables, 484/3478 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2272 variables, 0/3478 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/2272 variables, 0/3478 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2272/2272 variables, and 3478 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2914 ms.
Refiners :[Generalized P Invariants (flows): 1562/1562 constraints, State Equation: 1916/1916 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/599 variables, 506/506 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/599 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 552/1151 variables, 528/1034 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1151 variables, 0/1034 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 120/1271 variables, 1151/2185 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1271 variables, 0/2185 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 403/1674 variables, 167/2352 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1674 variables, 4/2356 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1674 variables, 0/2356 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 46/1720 variables, 44/2400 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1720 variables, 46/2446 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1720 variables, 0/2446 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 552/2272 variables, 552/2998 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SMT process timed out in 7999ms, After SMT, problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 599 out of 1916 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Graph (complete) has 15277 edges and 1916 vertex of which 765 are kept as prefixes of interest. Removing 1151 places using SCC suffix rule.4 ms
Discarding 1151 places :
Also discarding 71 output transitions
Drop transitions (Output transitions of discarded places.) removed 71 transitions
Drop transitions (Empty/Sink Transition effects.) removed 141 transitions
Reduce isomorphic transitions removed 141 transitions.
Discarding 46 places :
Implicit places reduction removed 46 places
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 188 rules applied. Total rules applied 189 place count 719 transition count 143
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 190 place count 718 transition count 143
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 46 Pre rules applied. Total rules applied 190 place count 718 transition count 97
Deduced a syphon composed of 46 places in 1 ms
Ensure Unique test removed 23 places
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 2 with 115 rules applied. Total rules applied 305 place count 649 transition count 97
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 305 place count 649 transition count 96
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 307 place count 648 transition count 96
Applied a total of 307 rules in 62 ms. Remains 648 /1916 variables (removed 1268) and now considering 96/356 (removed 260) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62 ms. Remains : 648/1916 places, 96/356 transitions.
RANDOM walk for 40000 steps (1600 resets) in 669 ms. (59 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (97 resets) in 611 ms. (65 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (98 resets) in 592 ms. (67 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (64 resets) in 692 ms. (57 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (102 resets) in 111 ms. (357 steps per ms) remains 4/4 properties
Finished probabilistic random walk after 902 steps, run visited all 4 properties in 19 ms. (steps per millisecond=47 )
Probabilistic random walk after 902 steps, saw 856 distinct states, run finished after 20 ms. (steps per millisecond=45 ) properties seen :4
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT (AND p0 p1))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (OR p1 p2)))), (X (X (NOT (OR (AND p0 p1) p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p1))), (F (G (NOT p1))), (F (G (NOT p2))), (F (G (NOT p0)))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (F (NOT (AND (OR (NOT p0) (NOT p1)) (NOT p2)))), (F (NOT (OR (NOT p0) p1 p2))), (F p0), (F (NOT (AND (NOT p1) (NOT p2)))), (F p2), (F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT (AND (NOT p0) (NOT p2)))), (F p1)]
Knowledge based reduction with 11 factoid took 1506 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 152 ms :[true, (OR p2 p1), (OR p2 (AND p0 p1)), (OR p2 (AND p0 p1)), (OR p2 (AND p0 p1))]
Stuttering acceptance computed with spot in 177 ms :[true, (OR p2 p1), (OR p2 (AND p0 p1)), (OR p2 (AND p0 p1)), (OR p2 (AND p0 p1))]
Support contains 599 out of 1916 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Applied a total of 0 rules in 30 ms. Remains 1916 /1916 variables (removed 0) and now considering 356/356 (removed 0) transitions.
[2024-05-25 14:45:33] [INFO ] Invariant cache hit.
[2024-05-25 14:45:35] [INFO ] Implicit Places using invariants in 1722 ms returned []
[2024-05-25 14:45:35] [INFO ] Invariant cache hit.
[2024-05-25 14:45:41] [INFO ] Implicit Places using invariants and state equation in 5690 ms returned []
Implicit Place search using SMT with State Equation took 7417 ms to find 0 implicit places.
Running 332 sub problems to find dead transitions.
[2024-05-25 14:45:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1915 variables, 1562/1562 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1915 variables, 0/1562 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 356/2271 variables, 1915/3477 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2271/2272 variables, and 3477 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30037 ms.
Refiners :[Generalized P Invariants (flows): 1562/1562 constraints, State Equation: 1915/1916 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 332 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1915 variables, 1562/1562 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1915 variables, 0/1562 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 356/2271 variables, 1915/3477 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2271 variables, 332/3809 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2271/2272 variables, and 3809 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30021 ms.
Refiners :[Generalized P Invariants (flows): 1562/1562 constraints, State Equation: 1915/1916 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 0/0 constraints]
After SMT, in 60437ms problems are : Problem set: 0 solved, 332 unsolved
Search for dead transitions found 0 dead transitions in 60441ms
Finished structural reductions in LTL mode , in 1 iterations and 67890 ms. Remains : 1916/1916 places, 356/356 transitions.
Computed a total of 1916 stabilizing places and 356 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1916 transition count 356
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (X (NOT p2))), (X (X (NOT (OR p1 p2)))), (X (X (NOT (OR (AND p0 p1) p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p1))), (F (G (NOT p1))), (F (G (NOT p2))), (F (G (NOT p0)))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 9 factoid took 588 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 177 ms :[true, (OR p2 p1), (OR p2 (AND p0 p1)), (OR p2 (AND p0 p1)), (OR p2 (AND p0 p1))]
Reduction of identical properties reduced properties to check from 8 to 7
RANDOM walk for 40000 steps (1483 resets) in 697 ms. (57 steps per ms) remains 4/7 properties
BEST_FIRST walk for 40004 steps (87 resets) in 657 ms. (60 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (50 resets) in 708 ms. (56 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (83 resets) in 618 ms. (64 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (92 resets) in 89 ms. (444 steps per ms) remains 4/4 properties
[2024-05-25 14:46:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/599 variables, 506/506 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/599 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 552/1151 variables, 528/1034 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/1151 variables, 0/1034 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 120/1271 variables, 1151/2185 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1271 variables, 0/2185 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 403/1674 variables, 167/2352 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1674 variables, 0/2352 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 46/1720 variables, 44/2396 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1720 variables, 46/2442 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1720 variables, 0/2442 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 552/2272 variables, 552/2994 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2272 variables, 484/3478 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2272 variables, 0/3478 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/2272 variables, 0/3478 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2272/2272 variables, and 3478 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2842 ms.
Refiners :[Generalized P Invariants (flows): 1562/1562 constraints, State Equation: 1916/1916 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/599 variables, 506/506 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/599 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 552/1151 variables, 528/1034 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1151 variables, 0/1034 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 120/1271 variables, 1151/2185 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1271 variables, 0/2185 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 403/1674 variables, 167/2352 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1674 variables, 4/2356 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1674 variables, 0/2356 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 46/1720 variables, 44/2400 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1720 variables, 46/2446 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1720 variables, 0/2446 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 552/2272 variables, 552/2998 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2272 variables, 484/3482 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2272 variables, 0/3482 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 0/2272 variables, 0/3482 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2272/2272 variables, and 3482 constraints, problems are : Problem set: 0 solved, 4 unsolved in 5016 ms.
Refiners :[Generalized P Invariants (flows): 1562/1562 constraints, State Equation: 1916/1916 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 7921ms problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 599 out of 1916 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Graph (complete) has 15277 edges and 1916 vertex of which 765 are kept as prefixes of interest. Removing 1151 places using SCC suffix rule.5 ms
Discarding 1151 places :
Also discarding 71 output transitions
Drop transitions (Output transitions of discarded places.) removed 71 transitions
Drop transitions (Empty/Sink Transition effects.) removed 141 transitions
Reduce isomorphic transitions removed 141 transitions.
Discarding 46 places :
Implicit places reduction removed 46 places
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 188 rules applied. Total rules applied 189 place count 719 transition count 143
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 190 place count 718 transition count 143
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 46 Pre rules applied. Total rules applied 190 place count 718 transition count 97
Deduced a syphon composed of 46 places in 0 ms
Ensure Unique test removed 23 places
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 2 with 115 rules applied. Total rules applied 305 place count 649 transition count 97
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 305 place count 649 transition count 96
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 307 place count 648 transition count 96
Applied a total of 307 rules in 30 ms. Remains 648 /1916 variables (removed 1268) and now considering 96/356 (removed 260) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 648/1916 places, 96/356 transitions.
RANDOM walk for 40000 steps (1600 resets) in 494 ms. (80 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (99 resets) in 610 ms. (65 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (64 resets) in 729 ms. (54 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (95 resets) in 611 ms. (65 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (97 resets) in 97 ms. (408 steps per ms) remains 4/4 properties
Finished probabilistic random walk after 902 steps, run visited all 4 properties in 22 ms. (steps per millisecond=41 )
Probabilistic random walk after 902 steps, saw 856 distinct states, run finished after 22 ms. (steps per millisecond=41 ) properties seen :4
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (X (NOT p2))), (X (X (NOT (OR p1 p2)))), (X (X (NOT (OR (AND p0 p1) p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p1))), (F (G (NOT p1))), (F (G (NOT p2))), (F (G (NOT p0)))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (F (NOT (AND (NOT p2) (NOT p0)))), (F (NOT (AND (NOT p1) (NOT p2)))), (F p0), (F (NOT (AND (NOT p1) (NOT p2)))), (F p2), (F (NOT (OR p1 p2 (NOT p0)))), (F (NOT (AND (OR (NOT p1) (NOT p0)) (NOT p2)))), (F p1)]
Knowledge based reduction with 9 factoid took 1135 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 165 ms :[true, (OR p2 p1), (OR p2 (AND p0 p1)), (OR p2 (AND p0 p1)), (OR p2 (AND p0 p1))]
Stuttering acceptance computed with spot in 170 ms :[true, (OR p2 p1), (OR p2 (AND p0 p1)), (OR p2 (AND p0 p1)), (OR p2 (AND p0 p1))]
Stuttering acceptance computed with spot in 181 ms :[true, (OR p2 p1), (OR p2 (AND p0 p1)), (OR p2 (AND p0 p1)), (OR p2 (AND p0 p1))]
Product exploration explored 100000 steps with 3716 reset in 488 ms.
Product exploration explored 100000 steps with 3715 reset in 511 ms.
Applying partial POR strategy [true, true, true, false, false]
Stuttering acceptance computed with spot in 202 ms :[true, (OR p2 p1), (OR p2 (AND p0 p1)), (OR p2 (AND p0 p1)), (OR p2 (AND p0 p1))]
Support contains 599 out of 1916 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Graph (complete) has 15277 edges and 1916 vertex of which 1892 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.7 ms
Discarding 24 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1892 transition count 355
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 2 rules in 235 ms. Remains 1892 /1916 variables (removed 24) and now considering 355/356 (removed 1) transitions.
[2024-05-25 14:46:55] [INFO ] Redundant transitions in 50 ms returned []
Running 331 sub problems to find dead transitions.
// Phase 1: matrix 355 rows 1892 cols
[2024-05-25 14:46:55] [INFO ] Computed 1540 invariants in 31 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1891 variables, 1540/1540 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1891 variables, 0/1540 constraints. Problems are: Problem set: 0 solved, 331 unsolved
Problem TDEAD163 is UNSAT
Problem TDEAD351 is UNSAT
At refinement iteration 2 (OVERLAPS) 355/2246 variables, 1891/3431 constraints. Problems are: Problem set: 2 solved, 329 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2246/2247 variables, and 3431 constraints, problems are : Problem set: 2 solved, 329 unsolved in 30033 ms.
Refiners :[Generalized P Invariants (flows): 1540/1540 constraints, State Equation: 1891/1892 constraints, PredecessorRefiner: 331/331 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 329 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1890 variables, 1540/1540 constraints. Problems are: Problem set: 2 solved, 329 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1890 variables, 0/1540 constraints. Problems are: Problem set: 2 solved, 329 unsolved
At refinement iteration 2 (OVERLAPS) 354/2244 variables, 1890/3430 constraints. Problems are: Problem set: 2 solved, 329 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2244 variables, 329/3759 constraints. Problems are: Problem set: 2 solved, 329 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2244/2247 variables, and 3759 constraints, problems are : Problem set: 2 solved, 329 unsolved in 30021 ms.
Refiners :[Generalized P Invariants (flows): 1540/1540 constraints, State Equation: 1890/1892 constraints, PredecessorRefiner: 329/331 constraints, Known Traps: 0/0 constraints]
After SMT, in 60452ms problems are : Problem set: 2 solved, 329 unsolved
Search for dead transitions found 2 dead transitions in 60458ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 1892/1916 places, 353/356 transitions.
Graph (complete) has 15758 edges and 1892 vertex of which 1891 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 50 ms. Remains 1891 /1892 variables (removed 1) and now considering 353/353 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 1891/1916 places, 353/356 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60803 ms. Remains : 1891/1916 places, 353/356 transitions.
Support contains 599 out of 1916 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Applied a total of 0 rules in 41 ms. Remains 1916 /1916 variables (removed 0) and now considering 356/356 (removed 0) transitions.
// Phase 1: matrix 356 rows 1916 cols
[2024-05-25 14:47:56] [INFO ] Computed 1562 invariants in 27 ms
[2024-05-25 14:47:58] [INFO ] Implicit Places using invariants in 1816 ms returned []
[2024-05-25 14:47:58] [INFO ] Invariant cache hit.
[2024-05-25 14:48:03] [INFO ] Implicit Places using invariants and state equation in 5645 ms returned []
Implicit Place search using SMT with State Equation took 7465 ms to find 0 implicit places.
Running 332 sub problems to find dead transitions.
[2024-05-25 14:48:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1915 variables, 1562/1562 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1915 variables, 0/1562 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 356/2271 variables, 1915/3477 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2271/2272 variables, and 3477 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30017 ms.
Refiners :[Generalized P Invariants (flows): 1562/1562 constraints, State Equation: 1915/1916 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 332 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1915 variables, 1562/1562 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1915 variables, 0/1562 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 356/2271 variables, 1915/3477 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2271 variables, 332/3809 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2271/2272 variables, and 3809 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30022 ms.
Refiners :[Generalized P Invariants (flows): 1562/1562 constraints, State Equation: 1915/1916 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 0/0 constraints]
After SMT, in 60418ms problems are : Problem set: 0 solved, 332 unsolved
Search for dead transitions found 0 dead transitions in 60423ms
Finished structural reductions in LTL mode , in 1 iterations and 67930 ms. Remains : 1916/1916 places, 356/356 transitions.
Treatment of property QuasiCertifProtocol-COL-22-LTLFireability-11 finished in 292619 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))&&(F(!p1)||X(!p2))))'
Support contains 599 out of 1916 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Applied a total of 0 rules in 29 ms. Remains 1916 /1916 variables (removed 0) and now considering 356/356 (removed 0) transitions.
[2024-05-25 14:49:04] [INFO ] Invariant cache hit.
[2024-05-25 14:49:06] [INFO ] Implicit Places using invariants in 1859 ms returned []
[2024-05-25 14:49:06] [INFO ] Invariant cache hit.
[2024-05-25 14:49:11] [INFO ] Implicit Places using invariants and state equation in 5654 ms returned []
Implicit Place search using SMT with State Equation took 7516 ms to find 0 implicit places.
Running 332 sub problems to find dead transitions.
[2024-05-25 14:49:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1915 variables, 1562/1562 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1915 variables, 0/1562 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 356/2271 variables, 1915/3477 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2271/2272 variables, and 3477 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30017 ms.
Refiners :[Generalized P Invariants (flows): 1562/1562 constraints, State Equation: 1915/1916 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 332 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1915 variables, 1562/1562 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1915 variables, 0/1562 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 356/2271 variables, 1915/3477 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2271 variables, 332/3809 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2271/2272 variables, and 3809 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30014 ms.
Refiners :[Generalized P Invariants (flows): 1562/1562 constraints, State Equation: 1915/1916 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 0/0 constraints]
After SMT, in 60415ms problems are : Problem set: 0 solved, 332 unsolved
Search for dead transitions found 0 dead transitions in 60420ms
Finished structural reductions in LTL mode , in 1 iterations and 67968 ms. Remains : 1916/1916 places, 356/356 transitions.
Stuttering acceptance computed with spot in 173 ms :[(OR (NOT p0) (AND p1 p2)), (NOT p0), (NOT p0), (AND p1 p2), p1]
Running random walk in product with property : QuasiCertifProtocol-COL-22-LTLFireability-12
Stuttering criterion allowed to conclude after 25 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-22-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-22-LTLFireability-12 finished in 68175 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 1 out of 1916 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Applied a total of 0 rules in 64 ms. Remains 1916 /1916 variables (removed 0) and now considering 356/356 (removed 0) transitions.
[2024-05-25 14:50:12] [INFO ] Invariant cache hit.
[2024-05-25 14:50:14] [INFO ] Implicit Places using invariants in 2213 ms returned []
[2024-05-25 14:50:14] [INFO ] Invariant cache hit.
[2024-05-25 14:50:21] [INFO ] Implicit Places using invariants and state equation in 6258 ms returned [1749, 1750, 1751, 1752, 1753, 1754, 1755, 1756, 1757, 1758, 1759, 1760, 1761, 1762, 1763, 1764, 1765, 1766, 1767, 1768, 1769, 1770, 1771]
Discarding 23 places :
Implicit Place search using SMT with State Equation took 8472 ms to find 23 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1893/1916 places, 356/356 transitions.
Applied a total of 0 rules in 60 ms. Remains 1893 /1893 variables (removed 0) and now considering 356/356 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 8596 ms. Remains : 1893/1916 places, 356/356 transitions.
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : QuasiCertifProtocol-COL-22-LTLFireability-13
Entered a terminal (fully accepting) state of product in 97 steps with 48 reset in 1 ms.
FORMULA QuasiCertifProtocol-COL-22-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-22-LTLFireability-13 finished in 8692 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0&&X(G(p1)))))))'
Support contains 24 out of 1916 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Applied a total of 0 rules in 65 ms. Remains 1916 /1916 variables (removed 0) and now considering 356/356 (removed 0) transitions.
[2024-05-25 14:50:21] [INFO ] Invariant cache hit.
[2024-05-25 14:50:23] [INFO ] Implicit Places using invariants in 2160 ms returned []
[2024-05-25 14:50:23] [INFO ] Invariant cache hit.
[2024-05-25 14:50:29] [INFO ] Implicit Places using invariants and state equation in 6205 ms returned [1749, 1750, 1751, 1752, 1753, 1754, 1755, 1756, 1757, 1758, 1759, 1760, 1761, 1762, 1763, 1764, 1765, 1766, 1767, 1768, 1769, 1770, 1771]
Discarding 23 places :
Implicit Place search using SMT with State Equation took 8377 ms to find 23 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1893/1916 places, 356/356 transitions.
Applied a total of 0 rules in 60 ms. Remains 1893 /1893 variables (removed 0) and now considering 356/356 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 8502 ms. Remains : 1893/1916 places, 356/356 transitions.
Stuttering acceptance computed with spot in 132 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-COL-22-LTLFireability-14
Stuttering criterion allowed to conclude after 25 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-22-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-22-LTLFireability-14 finished in 8649 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||(G(p0) U (X(G(!p2))||p1)))))'
Support contains 48 out of 1916 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Applied a total of 0 rules in 64 ms. Remains 1916 /1916 variables (removed 0) and now considering 356/356 (removed 0) transitions.
[2024-05-25 14:50:29] [INFO ] Invariant cache hit.
[2024-05-25 14:50:32] [INFO ] Implicit Places using invariants in 2143 ms returned []
[2024-05-25 14:50:32] [INFO ] Invariant cache hit.
[2024-05-25 14:50:35] [INFO ] Implicit Places using invariants and state equation in 3548 ms returned [1749, 1750, 1751, 1752, 1753, 1754, 1755, 1756, 1757, 1758, 1759, 1760, 1761, 1762, 1763, 1764, 1765, 1766, 1767, 1768, 1769, 1770, 1771]
Discarding 23 places :
Implicit Place search using SMT with State Equation took 5696 ms to find 23 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1893/1916 places, 356/356 transitions.
Applied a total of 0 rules in 58 ms. Remains 1893 /1893 variables (removed 0) and now considering 356/356 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 5818 ms. Remains : 1893/1916 places, 356/356 transitions.
Stuttering acceptance computed with spot in 101 ms :[true, (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p1) p2), p2]
Running random walk in product with property : QuasiCertifProtocol-COL-22-LTLFireability-15
Product exploration explored 100000 steps with 31418 reset in 473 ms.
Product exploration explored 100000 steps with 31512 reset in 492 ms.
Computed a total of 1893 stabilizing places and 356 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1893 transition count 356
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT p1)), (X (X (NOT p2))), (F (G (NOT p0))), (F (G (NOT p1))), (F (G (NOT p2)))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 6 factoid took 322 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 110 ms :[true, (AND (NOT p0) p2), (AND (NOT p0) p2), p2]
RANDOM walk for 40000 steps (1486 resets) in 203 ms. (196 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (66 resets) in 92 ms. (430 steps per ms) remains 1/1 properties
// Phase 1: matrix 356 rows 1893 cols
[2024-05-25 14:50:37] [INFO ] Computed 1540 invariants in 128 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 207/231 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/231 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1334/1565 variables, 1196/1220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1565 variables, 968/2188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1565 variables, 0/2188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 529/2094 variables, 506/2694 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2094 variables, 529/3223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2094 variables, 0/3223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 144/2238 variables, 138/3361 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2238 variables, 66/3427 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2238 variables, 0/3427 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 11/2249 variables, 6/3433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2249 variables, 0/3433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/2249 variables, 0/3433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2249/2249 variables, and 3433 constraints, problems are : Problem set: 0 solved, 1 unsolved in 823 ms.
Refiners :[Generalized P Invariants (flows): 1540/1540 constraints, State Equation: 1893/1893 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 207/231 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/231 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1334/1565 variables, 1196/1220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1565 variables, 968/2188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1565 variables, 1/2189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1565 variables, 0/2189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 529/2094 variables, 506/2695 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2094 variables, 529/3224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2094 variables, 0/3224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 144/2238 variables, 138/3362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2238 variables, 66/3428 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2238 variables, 0/3428 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 11/2249 variables, 6/3434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2249 variables, 0/3434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/2249 variables, 0/3434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2249/2249 variables, and 3434 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1268 ms.
Refiners :[Generalized P Invariants (flows): 1540/1540 constraints, State Equation: 1893/1893 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 2242ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 121 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=40 )
Parikh walk visited 1 properties in 10 ms.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT p1)), (X (X (NOT p2))), (F (G (NOT p0))), (F (G (NOT p1))), (F (G (NOT p2)))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (F p2), (F (NOT p0))]
Knowledge based reduction with 6 factoid took 335 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 ms :[true, (AND (NOT p0) p2), (AND (NOT p0) p2), p2]
Stuttering acceptance computed with spot in 132 ms :[true, (AND (NOT p0) p2), (AND (NOT p0) p2), p2]
Support contains 25 out of 1893 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 1893/1893 places, 356/356 transitions.
Applied a total of 0 rules in 59 ms. Remains 1893 /1893 variables (removed 0) and now considering 356/356 (removed 0) transitions.
[2024-05-25 14:50:40] [INFO ] Invariant cache hit.
[2024-05-25 14:50:42] [INFO ] Implicit Places using invariants in 2073 ms returned []
[2024-05-25 14:50:42] [INFO ] Invariant cache hit.
[2024-05-25 14:50:46] [INFO ] Implicit Places using invariants and state equation in 3753 ms returned []
Implicit Place search using SMT with State Equation took 5828 ms to find 0 implicit places.
Running 332 sub problems to find dead transitions.
[2024-05-25 14:50:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1892 variables, 1540/1540 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1892 variables, 0/1540 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 356/2248 variables, 1892/3432 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2248/2249 variables, and 3432 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30014 ms.
Refiners :[Generalized P Invariants (flows): 1540/1540 constraints, State Equation: 1892/1893 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 332 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1892 variables, 1540/1540 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1892 variables, 0/1540 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 356/2248 variables, 1892/3432 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2248 variables, 332/3764 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2248/2249 variables, and 3764 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30019 ms.
Refiners :[Generalized P Invariants (flows): 1540/1540 constraints, State Equation: 1892/1893 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 0/0 constraints]
After SMT, in 60439ms problems are : Problem set: 0 solved, 332 unsolved
Search for dead transitions found 0 dead transitions in 60444ms
Finished structural reductions in LTL mode , in 1 iterations and 66332 ms. Remains : 1893/1893 places, 356/356 transitions.
Computed a total of 1893 stabilizing places and 356 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1893 transition count 356
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p2)), (X (X (NOT p2))), (F (G (NOT p0))), (F (G (NOT p2)))]
False Knowledge obtained : [(X (NOT p0)), (X p0)]
Knowledge based reduction with 4 factoid took 163 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 119 ms :[true, (AND (NOT p0) p2), (AND (NOT p0) p2), p2]
RANDOM walk for 40000 steps (1485 resets) in 190 ms. (209 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (71 resets) in 102 ms. (388 steps per ms) remains 1/1 properties
[2024-05-25 14:51:47] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 207/231 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/231 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1334/1565 variables, 1196/1220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1565 variables, 968/2188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1565 variables, 0/2188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 529/2094 variables, 506/2694 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2094 variables, 529/3223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2094 variables, 0/3223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 144/2238 variables, 138/3361 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2238 variables, 66/3427 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2238 variables, 0/3427 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 11/2249 variables, 6/3433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2249 variables, 0/3433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/2249 variables, 0/3433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2249/2249 variables, and 3433 constraints, problems are : Problem set: 0 solved, 1 unsolved in 824 ms.
Refiners :[Generalized P Invariants (flows): 1540/1540 constraints, State Equation: 1893/1893 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 207/231 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/231 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1334/1565 variables, 1196/1220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1565 variables, 968/2188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1565 variables, 1/2189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1565 variables, 0/2189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 529/2094 variables, 506/2695 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2094 variables, 529/3224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2094 variables, 0/3224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 144/2238 variables, 138/3362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2238 variables, 66/3428 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2238 variables, 0/3428 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 11/2249 variables, 6/3434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2249 variables, 0/3434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/2249 variables, 0/3434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2249/2249 variables, and 3434 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1278 ms.
Refiners :[Generalized P Invariants (flows): 1540/1540 constraints, State Equation: 1893/1893 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 2118ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 121 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=40 )
Parikh walk visited 1 properties in 3 ms.
Knowledge obtained : [(AND p0 (NOT p2)), (X (X (NOT p2))), (F (G (NOT p0))), (F (G (NOT p2)))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (F p2), (F (NOT p0))]
Knowledge based reduction with 4 factoid took 219 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 122 ms :[true, (AND (NOT p0) p2), (AND (NOT p0) p2), p2]
Stuttering acceptance computed with spot in 122 ms :[true, (AND (NOT p0) p2), (AND (NOT p0) p2), p2]
Stuttering acceptance computed with spot in 119 ms :[true, (AND (NOT p0) p2), (AND (NOT p0) p2), p2]
Product exploration explored 100000 steps with 31043 reset in 474 ms.
Product exploration explored 100000 steps with 32037 reset in 487 ms.
Applying partial POR strategy [true, false, false, true]
Stuttering acceptance computed with spot in 118 ms :[true, (AND (NOT p0) p2), (AND (NOT p0) p2), p2]
Support contains 25 out of 1893 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1893/1893 places, 356/356 transitions.
Graph (complete) has 14725 edges and 1893 vertex of which 1869 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.5 ms
Discarding 24 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 1869 transition count 356
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 3 rules in 149 ms. Remains 1869 /1893 variables (removed 24) and now considering 356/356 (removed 0) transitions.
[2024-05-25 14:51:51] [INFO ] Redundant transitions in 29 ms returned []
Running 332 sub problems to find dead transitions.
// Phase 1: matrix 356 rows 1869 cols
[2024-05-25 14:51:51] [INFO ] Computed 1518 invariants in 156 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1868 variables, 1518/1518 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1868 variables, 0/1518 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
At refinement iteration 2 (OVERLAPS) 356/2224 variables, 1868/3386 constraints. Problems are: Problem set: 4 solved, 328 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2224/2225 variables, and 3386 constraints, problems are : Problem set: 4 solved, 328 unsolved in 30019 ms.
Refiners :[Generalized P Invariants (flows): 1518/1518 constraints, State Equation: 1868/1869 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 328 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1866 variables, 1518/1518 constraints. Problems are: Problem set: 4 solved, 328 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1866 variables, 0/1518 constraints. Problems are: Problem set: 4 solved, 328 unsolved
At refinement iteration 2 (OVERLAPS) 354/2220 variables, 1866/3384 constraints. Problems are: Problem set: 4 solved, 328 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2220 variables, 328/3712 constraints. Problems are: Problem set: 4 solved, 328 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2220/2225 variables, and 3712 constraints, problems are : Problem set: 4 solved, 328 unsolved in 30021 ms.
Refiners :[Generalized P Invariants (flows): 1518/1518 constraints, State Equation: 1866/1869 constraints, PredecessorRefiner: 328/332 constraints, Known Traps: 0/0 constraints]
After SMT, in 60610ms problems are : Problem set: 4 solved, 328 unsolved
Search for dead transitions found 4 dead transitions in 60613ms
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 : 1869/1893 places, 352/356 transitions.
Graph (complete) has 15711 edges and 1869 vertex of which 1867 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 ms
Discarding 2 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 74 ms. Remains 1867 /1869 variables (removed 2) and now considering 352/352 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 1867/1893 places, 352/356 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60879 ms. Remains : 1867/1893 places, 352/356 transitions.
Support contains 25 out of 1893 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1893/1893 places, 356/356 transitions.
Applied a total of 0 rules in 59 ms. Remains 1893 /1893 variables (removed 0) and now considering 356/356 (removed 0) transitions.
// Phase 1: matrix 356 rows 1893 cols
[2024-05-25 14:52:52] [INFO ] Computed 1540 invariants in 114 ms
[2024-05-25 14:52:54] [INFO ] Implicit Places using invariants in 2160 ms returned []
[2024-05-25 14:52:54] [INFO ] Invariant cache hit.
[2024-05-25 14:52:58] [INFO ] Implicit Places using invariants and state equation in 3768 ms returned []
Implicit Place search using SMT with State Equation took 5930 ms to find 0 implicit places.
Running 332 sub problems to find dead transitions.
[2024-05-25 14:52:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1892 variables, 1540/1540 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1892 variables, 0/1540 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 356/2248 variables, 1892/3432 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2248/2249 variables, and 3432 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30013 ms.
Refiners :[Generalized P Invariants (flows): 1540/1540 constraints, State Equation: 1892/1893 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 332 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1892 variables, 1540/1540 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1892 variables, 0/1540 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 356/2248 variables, 1892/3432 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2248 variables, 332/3764 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2248/2249 variables, and 3764 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30028 ms.
Refiners :[Generalized P Invariants (flows): 1540/1540 constraints, State Equation: 1892/1893 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 0/0 constraints]
After SMT, in 60437ms problems are : Problem set: 0 solved, 332 unsolved
Search for dead transitions found 0 dead transitions in 60444ms
Finished structural reductions in LTL mode , in 1 iterations and 66434 ms. Remains : 1893/1893 places, 356/356 transitions.
Treatment of property QuasiCertifProtocol-COL-22-LTLFireability-15 finished in 208922 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||G(!p1)))&&X(X(G(!p2)))))'
Found a Lengthening insensitive property : QuasiCertifProtocol-COL-22-LTLFireability-11
Stuttering acceptance computed with spot in 235 ms :[true, (OR p2 p1), (OR p2 p1), (OR p2 (AND p0 p1)), (OR p2 (AND p0 p1)), (OR p2 (AND p0 p1))]
Support contains 599 out of 1916 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Graph (complete) has 15277 edges and 1916 vertex of which 1892 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.7 ms
Discarding 24 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 1891 transition count 353
Applied a total of 3 rules in 89 ms. Remains 1891 /1916 variables (removed 25) and now considering 353/356 (removed 3) transitions.
// Phase 1: matrix 353 rows 1891 cols
[2024-05-25 14:53:59] [INFO ] Computed 1540 invariants in 20 ms
[2024-05-25 14:54:00] [INFO ] Implicit Places using invariants in 1669 ms returned []
[2024-05-25 14:54:00] [INFO ] Invariant cache hit.
[2024-05-25 14:54:06] [INFO ] Implicit Places using invariants and state equation in 5140 ms returned []
Implicit Place search using SMT with State Equation took 6811 ms to find 0 implicit places.
Running 329 sub problems to find dead transitions.
[2024-05-25 14:54:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1890 variables, 1540/1540 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1890 variables, 0/1540 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 2 (OVERLAPS) 353/2243 variables, 1890/3430 constraints. Problems are: Problem set: 0 solved, 329 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2243/2244 variables, and 3430 constraints, problems are : Problem set: 0 solved, 329 unsolved in 30022 ms.
Refiners :[Generalized P Invariants (flows): 1540/1540 constraints, State Equation: 1890/1891 constraints, PredecessorRefiner: 329/329 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 329 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1890 variables, 1540/1540 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1890 variables, 0/1540 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 2 (OVERLAPS) 353/2243 variables, 1890/3430 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2243 variables, 329/3759 constraints. Problems are: Problem set: 0 solved, 329 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 2243/2244 variables, and 3759 constraints, problems are : Problem set: 0 solved, 329 unsolved in 30024 ms.
Refiners :[Generalized P Invariants (flows): 1540/1540 constraints, State Equation: 1890/1891 constraints, PredecessorRefiner: 329/329 constraints, Known Traps: 0/0 constraints]
After SMT, in 60421ms problems are : Problem set: 0 solved, 329 unsolved
Search for dead transitions found 0 dead transitions in 60425ms
Starting structural reductions in LI_LTL mode, iteration 1 : 1891/1916 places, 353/356 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 67326 ms. Remains : 1891/1916 places, 353/356 transitions.
Running random walk in product with property : QuasiCertifProtocol-COL-22-LTLFireability-11
Product exploration explored 100000 steps with 3710 reset in 482 ms.
Product exploration explored 100000 steps with 3713 reset in 509 ms.
Computed a total of 1891 stabilizing places and 353 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1891 transition count 353
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT (AND p0 p1))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (OR p1 p2)))), (X (X (NOT (OR (AND p0 p1) p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p1))), (F (G (NOT p1))), (F (G (NOT p2))), (F (G (NOT p0)))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 11 factoid took 829 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 182 ms :[true, (OR p2 p1), (OR p2 (AND p0 p1)), (OR p2 (AND p0 p1)), (OR p2 (AND p0 p1))]
Reduction of identical properties reduced properties to check from 8 to 7
RANDOM walk for 40000 steps (1484 resets) in 434 ms. (91 steps per ms) remains 4/7 properties
BEST_FIRST walk for 40004 steps (81 resets) in 786 ms. (50 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (90 resets) in 772 ms. (51 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (50 resets) in 871 ms. (45 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (87 resets) in 156 ms. (254 steps per ms) remains 4/4 properties
[2024-05-25 14:55:09] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/599 variables, 506/506 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/599 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 552/1151 variables, 528/1034 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1151 variables, 0/1034 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 121/1272 variables, 1151/2185 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1272 variables, 0/2185 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 420/1692 variables, 188/2373 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1692 variables, 22/2395 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1692 variables, 0/2395 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 552/2244 variables, 552/2947 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2244 variables, 484/3431 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2244 variables, 0/3431 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 0/2244 variables, 0/3431 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2244/2244 variables, and 3431 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2383 ms.
Refiners :[Generalized P Invariants (flows): 1540/1540 constraints, State Equation: 1891/1891 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/599 variables, 506/506 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/599 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 552/1151 variables, 528/1034 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1151 variables, 0/1034 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 121/1272 variables, 1151/2185 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1272 variables, 0/2185 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 420/1692 variables, 188/2373 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1692 variables, 22/2395 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1692 variables, 4/2399 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1692 variables, 0/2399 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 552/2244 variables, 552/2951 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2244 variables, 484/3435 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2244/2244 variables, and 3435 constraints, problems are : Problem set: 0 solved, 4 unsolved in 5016 ms.
Refiners :[Generalized P Invariants (flows): 1540/1540 constraints, State Equation: 1891/1891 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 7459ms problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 599 out of 1891 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1891/1891 places, 353/353 transitions.
Graph (complete) has 15758 edges and 1891 vertex of which 764 are kept as prefixes of interest. Removing 1127 places using SCC suffix rule.9 ms
Discarding 1127 places :
Also discarding 69 output transitions
Drop transitions (Output transitions of discarded places.) removed 69 transitions
Drop transitions (Empty/Sink Transition effects.) removed 141 transitions
Reduce isomorphic transitions removed 141 transitions.
Discarding 46 places :
Implicit places reduction removed 46 places
Iterating post reduction 0 with 187 rules applied. Total rules applied 188 place count 718 transition count 143
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 46 Pre rules applied. Total rules applied 188 place count 718 transition count 97
Deduced a syphon composed of 46 places in 0 ms
Ensure Unique test removed 23 places
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 1 with 115 rules applied. Total rules applied 303 place count 649 transition count 97
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 303 place count 649 transition count 96
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 305 place count 648 transition count 96
Applied a total of 305 rules in 28 ms. Remains 648 /1891 variables (removed 1243) and now considering 96/353 (removed 257) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 648/1891 places, 96/353 transitions.
RANDOM walk for 40000 steps (1600 resets) in 1154 ms. (34 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (97 resets) in 764 ms. (52 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (99 resets) in 759 ms. (52 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (64 resets) in 855 ms. (46 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (97 resets) in 140 ms. (283 steps per ms) remains 4/4 properties
Finished probabilistic random walk after 902 steps, run visited all 4 properties in 24 ms. (steps per millisecond=37 )
Probabilistic random walk after 902 steps, saw 856 distinct states, run finished after 24 ms. (steps per millisecond=37 ) properties seen :4
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT (AND p0 p1))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (OR p1 p2)))), (X (X (NOT (OR (AND p0 p1) p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p1))), (F (G (NOT p1))), (F (G (NOT p2))), (F (G (NOT p0)))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (F (NOT (AND (OR (NOT p0) (NOT p1)) (NOT p2)))), (F (NOT (OR (NOT p0) p1 p2))), (F p0), (F (NOT (AND (NOT p1) (NOT p2)))), (F p2), (F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT (AND (NOT p0) (NOT p2)))), (F p1)]
Knowledge based reduction with 11 factoid took 1451 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 175 ms :[true, (OR p2 p1), (OR p2 (AND p0 p1)), (OR p2 (AND p0 p1)), (OR p2 (AND p0 p1))]
Stuttering acceptance computed with spot in 148 ms :[true, (OR p2 p1), (OR p2 (AND p0 p1)), (OR p2 (AND p0 p1)), (OR p2 (AND p0 p1))]
Support contains 599 out of 1891 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1891/1891 places, 353/353 transitions.
Applied a total of 0 rules in 32 ms. Remains 1891 /1891 variables (removed 0) and now considering 353/353 (removed 0) transitions.
[2024-05-25 14:55:20] [INFO ] Invariant cache hit.
[2024-05-25 14:55:21] [INFO ] Implicit Places using invariants in 1628 ms returned []
[2024-05-25 14:55:21] [INFO ] Invariant cache hit.
[2024-05-25 14:55:26] [INFO ] Implicit Places using invariants and state equation in 5131 ms returned []
Implicit Place search using SMT with State Equation took 6761 ms to find 0 implicit places.
Running 329 sub problems to find dead transitions.
[2024-05-25 14:55:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1890 variables, 1540/1540 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1890 variables, 0/1540 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 2 (OVERLAPS) 353/2243 variables, 1890/3430 constraints. Problems are: Problem set: 0 solved, 329 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2243/2244 variables, and 3430 constraints, problems are : Problem set: 0 solved, 329 unsolved in 30012 ms.
Refiners :[Generalized P Invariants (flows): 1540/1540 constraints, State Equation: 1890/1891 constraints, PredecessorRefiner: 329/329 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 329 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1890 variables, 1540/1540 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1890 variables, 0/1540 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 2 (OVERLAPS) 353/2243 variables, 1890/3430 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2243 variables, 329/3759 constraints. Problems are: Problem set: 0 solved, 329 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2243/2244 variables, and 3759 constraints, problems are : Problem set: 0 solved, 329 unsolved in 30013 ms.
Refiners :[Generalized P Invariants (flows): 1540/1540 constraints, State Equation: 1890/1891 constraints, PredecessorRefiner: 329/329 constraints, Known Traps: 0/0 constraints]
After SMT, in 60395ms problems are : Problem set: 0 solved, 329 unsolved
Search for dead transitions found 0 dead transitions in 60400ms
Finished structural reductions in LTL mode , in 1 iterations and 67196 ms. Remains : 1891/1891 places, 353/353 transitions.
Computed a total of 1891 stabilizing places and 353 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1891 transition count 353
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (X (NOT p2))), (X (X (NOT (OR p1 p2)))), (X (X (NOT (OR (AND p0 p1) p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p1))), (F (G (NOT p1))), (F (G (NOT p2))), (F (G (NOT p0)))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 9 factoid took 579 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 159 ms :[true, (OR p2 p1), (OR p2 (AND p0 p1)), (OR p2 (AND p0 p1)), (OR p2 (AND p0 p1))]
Reduction of identical properties reduced properties to check from 8 to 7
RANDOM walk for 40000 steps (1483 resets) in 1015 ms. (39 steps per ms) remains 4/7 properties
BEST_FIRST walk for 40004 steps (90 resets) in 769 ms. (51 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (50 resets) in 874 ms. (45 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (86 resets) in 852 ms. (46 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (86 resets) in 84 ms. (470 steps per ms) remains 4/4 properties
[2024-05-25 14:56:29] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/599 variables, 506/506 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/599 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 552/1151 variables, 528/1034 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1151 variables, 0/1034 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 121/1272 variables, 1151/2185 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1272 variables, 0/2185 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 420/1692 variables, 188/2373 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1692 variables, 22/2395 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1692 variables, 0/2395 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 552/2244 variables, 552/2947 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2244 variables, 484/3431 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2244 variables, 0/3431 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 0/2244 variables, 0/3431 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2244/2244 variables, and 3431 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2295 ms.
Refiners :[Generalized P Invariants (flows): 1540/1540 constraints, State Equation: 1891/1891 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/599 variables, 506/506 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/599 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 552/1151 variables, 528/1034 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1151 variables, 0/1034 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 121/1272 variables, 1151/2185 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1272 variables, 0/2185 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 420/1692 variables, 188/2373 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1692 variables, 22/2395 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1692 variables, 4/2399 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1692 variables, 0/2399 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 552/2244 variables, 552/2951 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2244 variables, 484/3435 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2244/2244 variables, and 3435 constraints, problems are : Problem set: 0 solved, 4 unsolved in 5009 ms.
Refiners :[Generalized P Invariants (flows): 1540/1540 constraints, State Equation: 1891/1891 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 7362ms problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 599 out of 1891 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1891/1891 places, 353/353 transitions.
Graph (complete) has 15758 edges and 1891 vertex of which 764 are kept as prefixes of interest. Removing 1127 places using SCC suffix rule.3 ms
Discarding 1127 places :
Also discarding 69 output transitions
Drop transitions (Output transitions of discarded places.) removed 69 transitions
Drop transitions (Empty/Sink Transition effects.) removed 141 transitions
Reduce isomorphic transitions removed 141 transitions.
Discarding 46 places :
Implicit places reduction removed 46 places
Iterating post reduction 0 with 187 rules applied. Total rules applied 188 place count 718 transition count 143
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 46 Pre rules applied. Total rules applied 188 place count 718 transition count 97
Deduced a syphon composed of 46 places in 0 ms
Ensure Unique test removed 23 places
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 1 with 115 rules applied. Total rules applied 303 place count 649 transition count 97
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 303 place count 649 transition count 96
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 305 place count 648 transition count 96
Applied a total of 305 rules in 22 ms. Remains 648 /1891 variables (removed 1243) and now considering 96/353 (removed 257) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 648/1891 places, 96/353 transitions.
RANDOM walk for 40000 steps (1600 resets) in 941 ms. (42 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (100 resets) in 743 ms. (53 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (64 resets) in 833 ms. (47 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (97 resets) in 778 ms. (51 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (100 resets) in 163 ms. (243 steps per ms) remains 4/4 properties
Finished probabilistic random walk after 902 steps, run visited all 4 properties in 19 ms. (steps per millisecond=47 )
Probabilistic random walk after 902 steps, saw 856 distinct states, run finished after 19 ms. (steps per millisecond=47 ) properties seen :4
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (X (NOT p2))), (X (X (NOT (OR p1 p2)))), (X (X (NOT (OR (AND p0 p1) p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p1))), (F (G (NOT p1))), (F (G (NOT p2))), (F (G (NOT p0)))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (F (NOT (AND (NOT p2) (NOT p0)))), (F (NOT (AND (NOT p1) (NOT p2)))), (F p0), (F (NOT (AND (NOT p1) (NOT p2)))), (F p2), (F (NOT (OR p1 p2 (NOT p0)))), (F (NOT (AND (OR (NOT p1) (NOT p0)) (NOT p2)))), (F p1)]
Knowledge based reduction with 9 factoid took 1026 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 169 ms :[true, (OR p2 p1), (OR p2 (AND p0 p1)), (OR p2 (AND p0 p1)), (OR p2 (AND p0 p1))]
Stuttering acceptance computed with spot in 163 ms :[true, (OR p2 p1), (OR p2 (AND p0 p1)), (OR p2 (AND p0 p1)), (OR p2 (AND p0 p1))]
Stuttering acceptance computed with spot in 142 ms :[true, (OR p2 p1), (OR p2 (AND p0 p1)), (OR p2 (AND p0 p1)), (OR p2 (AND p0 p1))]
Product exploration explored 100000 steps with 3718 reset in 478 ms.
Product exploration explored 100000 steps with 3718 reset in 508 ms.
Applying partial POR strategy [true, true, true, false, false]
Stuttering acceptance computed with spot in 163 ms :[true, (OR p2 p1), (OR p2 (AND p0 p1)), (OR p2 (AND p0 p1)), (OR p2 (AND p0 p1))]
Support contains 599 out of 1891 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1891/1891 places, 353/353 transitions.
Applied a total of 0 rules in 44 ms. Remains 1891 /1891 variables (removed 0) and now considering 353/353 (removed 0) transitions.
[2024-05-25 14:56:40] [INFO ] Redundant transitions in 17 ms returned []
Running 329 sub problems to find dead transitions.
[2024-05-25 14:56:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1890 variables, 1540/1540 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1890 variables, 0/1540 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 2 (OVERLAPS) 353/2243 variables, 1890/3430 constraints. Problems are: Problem set: 0 solved, 329 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 13.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 0.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 0.0)
(s541 0.0)
(s542 0.0)
(s543 0.0)
(s544 0.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 0.0)
(s550 0.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 0.0)
(s558 0.0)
(s559 0.0)
(s560 0.0)
(s561 0.0)
(s562 0.0)
(s563 0.0)
(s564 0.0)
(s565 0.0)
(s566 0.0)
(s567 0.0)
(s568 0.0)
(s569 0.0)
(s570 0.0)
(s571 0.0)
(s572 0.0)
(s573 0.0)
(s574 0.0)
(s575 0.0)
(s576 0.0)
(s577 0.0)
(s578 0.0)
(s579 0.0)
(s580 0.0)
(s581 0.0)
(s582 0.0)
(s583 0.0)
(s584 0.0)
(s585 0.0)
(s586 0.0)
(s587 0.0)
(s588 0.0)
(s589 0.0)
(s590 0.0)
(s591 0.0)
(s592 0.0)
(s593 0.0)
(s594 0.0)
(s595 0.0)
(s596 0.0)
(s597 0.0)
(s598 0.0)
(s599 0.0)
(s600 0.0)
(s601 0.0)
(s602 0.0)
(s603 0.0)
(s604 0.0)
(s605 0.0)
(s606 0.0)
(s607 0.0)
(s608 0.0)
(s609 0.0)
(s610 0.0)
(s611 0.0)
(s612 0.0)
(s613 0.0)
(s614 0.0)
(s615 0.0)
(s616 0.0)
(s617 0.0)
(s618 0.0)
(s619 0.0)
(s620 0.0)
(s621 0.0)
(s622 0.0)
(s623 0.0)
(s624 0.0)
(s625 0.0)
(s626 0.0)
(s627 0.0)
(s628 0.0)
(s629 0.0)
(s630 0.0)
(s631 0.0)
(s632 0.0)
(s633 0.0)
(s634 0.0)
(s635 0.0)
(s636 0.0)
(s637 0.0)
(s638 0.0)
(s639 0.0)
(s640 0.0)
(s641 0.0)
(s642 0.0)
(s643 0.0)
(s644 0.0)
(s645 0.0)
(s646 0.0)
(s647 0.0)
(s648 0.0)
(s649 0.0)
(s650 0.0)
(s651 0.0)
(s652 0.0)
(s653 0.0)
(s654 0.0)
(s655 0.0)
(s656 0.0)
(s657 0.0)
(s658 0.0)
(s659 0.0)
(s660 0.0)
(s661 0.0)
(s662 0.0)
(s663 0.0)
(s664 0.0)
(s665 0.0)
(s666 0.0)
(s667 0.0)
(s668 0.0)
(s669 0.0)
(s670 0.0)
(s671 0.0)
(s672 0.0)
(s673 0.0)
(s674 0.0)
(s675 0.0)
(s676 0.0)
(s677 0.0)
(s678 0.0)
(s679 0.0)
(s680 0.0)
(s681 0.0)
(s682 0.0)
(s683 0.0)
(s684 0.0)
(s685 0.0)
(s686 0.0)
(s687 0.0)
(s688 0.0)
(s689 0.0)
(s690 0.0)
(s691 0.0)
(s692 0.0)
(s693 0.0)
(s694 0.0)
(s695 0.0)
(s696 0.0)
(s697 0.0)
(s698 0.0)
(s699 0.0)
(s700 0.0)
(s701 0.0)
(s702 0.0)
(s703 0.0)
(s704 0.0)
(s705 0.0)
(s706 0.0)
(s707 0.0)
(s708 0.0)
(s709 0.0)
(s710 0.0)
(s711 0.0)
(s712 0.0)
(s713 0.0)
(s714 0.0)
(s715 0.0)
(s716 0.0)
(s717 0.0)
(s718 0.0)
(s719 0.0)
(s720 0.0)
(s721 0.0)
(s722 0.0)
(s723 0.0)
(s724 0.0)
(s725 0.0)
(s726 0.0)
(s727 0.0)
(s728 0.0)
(s729 0.0)
(s730 0.0)
(s731 0.0)
(s732 0.0)
(s733 0.0)
(s734 0.0)
(s735 0.0)
(s736 0.0)
(s737 0.0)
(s738 0.0)
(s739 0.0)
(s740 0.0)
(s741 0.0)
(s742 0.0)
(s743 0.0)
(s744 0.0)
(s745 0.0)
(s746 0.0)
(s747 0.0)
(s748 0.0)
(s749 0.0)
(s750 0.0)
(s751 0.0)
(s752 0.0)
(s753 0.0)
(s754 0.0)
(s755 0.0)
(s756 0.0)
(s757 0.0)
(s758 0.0)
(s759 0.0)
(s760 0.0)
(s761 0.0)
(s762 0.0)
(s763 0.0)
(s764 0.0)
(s765 0.0)
(s766 0.0)
(s767 0.0)
(s768 0.0)
(s769 0.0)
(s770 0.0)
(s771 0.0)
(s772 0.0)
(s773 0.0)
(s774 0.0)
(s775 0.0)
(s776 0.0)
(s777 0.0)
(s778 0.0)
(s779 0.0)
(s780 0.0)
(s781 0.0)
(s782 0.0)
(s783 0.0)
(s784 0.0)
(s785 0.0)
(s786 0.0)
(s787 0.0)
(s788 0.0)
(s789 0.0)
(s790 0.0)
(s791 0.0)
(s792 0.0)
(s793 0.0)
(s794 0.0)
(s795 0.0)
(s796 0.0)
(s797 0.0)
(s798 0.0)
(s799 0.0)
(s800 0.0)
(s801 0.0)
(s802 0.0)
(s803 0.0)
(s804 0.0)
(s805 0.0)
(s806 0.0)
(s807 0.0)
(s808 0.0)
(s809 0.0)
(s810 0.0)
(s811 0.0)
(s812 0.0)
(s813 0.0)
(s814 0.0)
(s815 0.0)
(s816 0.0)
(s817 0.0)
(s818 0.0)
(s819 0.0)
(s820 0.0)
(s821 0.0)
(s822 0.0)
(s823 0.0)
(s824 0.0)
(s825 0.0)
(s826 0.0)
(s827 0.0)
(s828 0.0)
(s829 0.0)
(s830 0.0)
(s831 0.0)
(s832 0.0)
(s833 0.0)
(s834 0.0)
(s835 0.0)
(s836 0.0)
(s837 0.0)
(s838 0.0)
(s839 0.0)
(s840 0.0)
(s841 0.0)
(s842 0.0)
(s843 0.0)
(s844 0.0)
(s845 0.0)
(s846 0.0)
(s847 0.0)
(s848 0.0)
(s849 0.0)
(s850 0.0)
(s851 0.0)
(s852 0.0)
(s853 0.0)
(s854 0.0)
(s855 0.0)
(s856 0.0)
(s857 0.0)
(s858 0.0)
(s859 0.0)
(s860 0.0)
(s861 0.0)
(s862 0.0)
(s863 0.0)
(s864 0.0)
(s865 0.0)
(s866 0.0)
(s867 0.0)
(s868 0.0)
(s869 0.0)
(s870 0.0)
(s871 0.0)
(s872 0.0)
(s873 0.0)
(s874 0.0)
(s875 0.0)
(s876 0.0)
(s877 0.0)
(s878 0.0)
(s879 0.0)
(s880 0.0)
(s881 0.0)
(s882 0.0)
(s883 0.0)
(s884 0.0)
(s885 0.0)
(s886 0.0)
(s887 0.0)
(s888 0.0)
(s889 0.0)
(s890 0.0)
(s891 0.0)
(s892 0.0)
(s893 0.0)
(s894 0.0)
(s895 0.0)
(s896 0.0)
(s897 0.0)
(s898 0.0)
(s899 0.0)
(s900 0.0)
(s901 0.0)
(s902 0.0)
(s903 0.0)
(s904 0.0)
(s905 0.0)
(s906 0.0)
(s907 0.0)
(s908 0.0)
(s909 0.0)
(s910 0.0)
(s911 0.0)
(s912 0.0)
(s913 0.0)
(s914 0.0)
(s915 0.0)
(s916 0.0)
(s917 0.0)
(s918 0.0)
(s919 0.0)
(s920 0.0)
(s921 0.0)
(s922 0.0)
(s923 0.0)
(s924 0.0)
(s925 0.0)
(s926 0.0)
(s927 0.0)
(s928 0.0)
(s929 0.0)
(s930 0.0)
(s931 0.0)
(s932 0.0)
(s933 0.0)
(s934 0.0)
(s935 0.0)
(s936 0.0)
(s937 0.0)
(s938 0.0)
(s939 0.0)
(s940 0.0)
(s941 0.0)
(s942 0.0)
(s943 0.0)
(s944 0.0)
(s945 0.0)
(s946 0.0)
(s947 0.0)
(s948 0.0)
(s949 0.0)
(s950 0.0)
(s951 0.0)
(s952 0.0)
(s953 0.0)
(s954 0.0)
(s955 0.0)
(s956 0.0)
(s957 0.0)
(s958 0.0)
(s959 0.0)
(s960 0.0)
(s961 0.0)
(s962 0.0)
(s963 0.0)
(s964 0.0)
(s965 0.0)
(s966 0.0)
(s967 0.0)
(s968 0.0)
(s969 0.0)
(s970 0.0)
(s971 0.0)
(s972 0.0)
(s973 0.0)
(s974 0.0)
(s975 0.0)
(s976 0.0)
(s977 0.0)
(s978 0.0)
(s979 0.0)
(s980 0.0)
(s981 0.0)
(s982 0.0)
(s983 0.0)
(s984 0.0)
(s985 0.0)
(s986 0.0)
(s987 0.0)
(s988 0.0)
(s989 0.0)
(s990 0.0)
(s991 0.0)
(s992 0.0)
(s993 0.0)
(s994 0.0)
(s995 0.0)
(s996 0.0)
(s997 0.0)
(s998 0.0)
(s999 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2243/2244 variables, and 3430 constraints, problems are : Problem set: 0 solved, 329 unsolved in 30013 ms.
Refiners :[Generalized P Invariants (flows): 1540/1540 constraints, State Equation: 1890/1891 constraints, PredecessorRefiner: 329/329 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 329 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1890 variables, 1540/1540 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1890 variables, 0/1540 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 2 (OVERLAPS) 353/2243 variables, 1890/3430 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2243 variables, 329/3759 constraints. Problems are: Problem set: 0 solved, 329 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2243/2244 variables, and 3759 constraints, problems are : Problem set: 0 solved, 329 unsolved in 30020 ms.
Refiners :[Generalized P Invariants (flows): 1540/1540 constraints, State Equation: 1890/1891 constraints, PredecessorRefiner: 329/329 constraints, Known Traps: 0/0 constraints]
After SMT, in 60470ms problems are : Problem set: 0 solved, 329 unsolved
Search for dead transitions found 0 dead transitions in 60475ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60545 ms. Remains : 1891/1891 places, 353/353 transitions.
Support contains 599 out of 1891 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1891/1891 places, 353/353 transitions.
Applied a total of 0 rules in 29 ms. Remains 1891 /1891 variables (removed 0) and now considering 353/353 (removed 0) transitions.
[2024-05-25 14:57:41] [INFO ] Invariant cache hit.
[2024-05-25 14:57:43] [INFO ] Implicit Places using invariants in 1644 ms returned []
[2024-05-25 14:57:43] [INFO ] Invariant cache hit.
[2024-05-25 14:57:48] [INFO ] Implicit Places using invariants and state equation in 5179 ms returned []
Implicit Place search using SMT with State Equation took 6824 ms to find 0 implicit places.
Running 329 sub problems to find dead transitions.
[2024-05-25 14:57:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1890 variables, 1540/1540 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1890 variables, 0/1540 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 2 (OVERLAPS) 353/2243 variables, 1890/3430 constraints. Problems are: Problem set: 0 solved, 329 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2243/2244 variables, and 3430 constraints, problems are : Problem set: 0 solved, 329 unsolved in 30017 ms.
Refiners :[Generalized P Invariants (flows): 1540/1540 constraints, State Equation: 1890/1891 constraints, PredecessorRefiner: 329/329 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 329 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1890 variables, 1540/1540 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1890 variables, 0/1540 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 2 (OVERLAPS) 353/2243 variables, 1890/3430 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2243 variables, 329/3759 constraints. Problems are: Problem set: 0 solved, 329 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2243/2244 variables, and 3759 constraints, problems are : Problem set: 0 solved, 329 unsolved in 30021 ms.
Refiners :[Generalized P Invariants (flows): 1540/1540 constraints, State Equation: 1890/1891 constraints, PredecessorRefiner: 329/329 constraints, Known Traps: 0/0 constraints]
After SMT, in 60424ms problems are : Problem set: 0 solved, 329 unsolved
Search for dead transitions found 0 dead transitions in 60428ms
Finished structural reductions in LTL mode , in 1 iterations and 67283 ms. Remains : 1891/1891 places, 353/353 transitions.
Treatment of property QuasiCertifProtocol-COL-22-LTLFireability-11 finished in 289874 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||(G(p0) U (X(G(!p2))||p1)))))'
[2024-05-25 14:58:48] [INFO ] Flatten gal took : 57 ms
[2024-05-25 14:58:48] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 4 ms.
[2024-05-25 14:58:48] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1916 places, 356 transitions and 4110 arcs took 7 ms.
Total runtime 1190696 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running QuasiCertifProtocol-COL-22

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/406/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 1916
TRANSITIONS: 356
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.023s, Sys 0.000s]


SAVING FILE /home/mcc/execution/406/model (.net / .def) ...
EXPORT TIME: [User 0.003s, 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: 2272
MODEL NAME: /home/mcc/execution/406/model
1916 places, 356 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
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 LTLFireability -timeout 360 -rebuildPNML
Error in allocating array of size 4194304 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

Error in allocating array of size 8388608 at unique_table.cc, line 313
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-22"
export BK_EXAMINATION="LTLFireability"
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-22, examination is LTLFireability"
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-171662335700036"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/QuasiCertifProtocol-COL-22.tgz
mv QuasiCertifProtocol-COL-22 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;