About the Execution of LTSMin+red for QuasiCertifProtocol-COL-22
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 9411.184 | 1425960.00 | 2368152.00 | 3245.90 | FFFTFTFFTFF?FFF? | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r520-tall-171662337700036.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 ltsminxred
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 r520-tall-171662337700036
=====================================================================
--------------------
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 1717218273121
Invoking MCC driver with
BK_TOOL=ltsminxred
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 ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 05:04:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 05:04:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 05:04:34] [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-06-01 05:04:34] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 05:04:34] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 586 ms
[2024-06-01 05:04:35] [INFO ] Imported 30 HL places and 26 HL transitions for a total of 1966 PT places and 356.0 transition bindings in 20 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
[2024-06-01 05:04:35] [INFO ] Built PT skeleton of HLPN with 30 places and 26 transitions 77 arcs in 5 ms.
[2024-06-01 05:04:35] [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 37671 steps (1178 resets) in 401 ms. (93 steps per ms) remains 0/13 properties
[2024-06-01 05:04:35] [INFO ] Flatten gal took : 16 ms
[2024-06-01 05:04:35] [INFO ] Flatten gal took : 4 ms
Domain [tsid(23), tsid(23)] of place n9 breaks symmetries in sort tsid
[2024-06-01 05:04:35] [INFO ] Unfolded HLPN to a Petri net with 1966 places and 356 transitions 4323 arcs in 76 ms.
[2024-06-01 05:04:35] [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 150 ms. Remains 1916 /1966 variables (removed 50) and now considering 356/356 (removed 0) transitions.
// Phase 1: matrix 356 rows 1916 cols
[2024-06-01 05:04:35] [INFO ] Computed 1562 invariants in 126 ms
[2024-06-01 05:04:37] [INFO ] Implicit Places using invariants in 1967 ms returned []
[2024-06-01 05:04:37] [INFO ] Invariant cache hit.
[2024-06-01 05:04:40] [INFO ] Implicit Places using invariants and state equation in 2990 ms returned []
Implicit Place search using SMT with State Equation took 4986 ms to find 0 implicit places.
Running 332 sub problems to find dead transitions.
[2024-06-01 05:04:40] [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 30034 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 30036 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 60672ms problems are : Problem set: 0 solved, 332 unsolved
Search for dead transitions found 0 dead transitions in 60692ms
Starting structural reductions in LTL mode, iteration 1 : 1916/1966 places, 356/356 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65849 ms. Remains : 1916/1966 places, 356/356 transitions.
Support contains 811 out of 1916 places after structural reductions.
[2024-06-01 05:05:41] [INFO ] Flatten gal took : 179 ms
[2024-06-01 05:05:42] [INFO ] Flatten gal took : 151 ms
[2024-06-01 05:05:42] [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 (1486 resets) in 1253 ms. (31 steps per ms) remains 15/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 115 ms. (34 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 100 ms. (39 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (10 resets) in 267 ms. (14 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (10 resets) in 31 ms. (125 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (10 resets) in 19 ms. (200 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (9 resets) in 56 ms. (70 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 219 ms. (18 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (10 resets) in 21 ms. (181 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (10 resets) in 24 ms. (160 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (9 resets) in 19 ms. (200 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 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-06-01 05:05:43] [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 5015 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 5038 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 10150ms 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.8 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 91 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 91 ms. Remains : 1892/1916 places, 354/356 transitions.
RANDOM walk for 40000 steps (1482 resets) in 1074 ms. (37 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (68 resets) in 202 ms. (197 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (89 resets) in 589 ms. (67 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (90 resets) in 86 ms. (459 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (92 resets) in 120 ms. (330 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (94 resets) in 113 ms. (350 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (98 resets) in 96 ms. (412 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (32 resets) in 97 ms. (408 steps per ms) remains 12/13 properties
BEST_FIRST walk for 40004 steps (87 resets) in 112 ms. (354 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (71 resets) in 177 ms. (224 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (90 resets) in 67 ms. (588 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (82 resets) in 113 ms. (350 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (88 resets) in 120 ms. (330 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (69 resets) in 152 ms. (261 steps per ms) remains 12/12 properties
Finished probabilistic random walk after 4614 steps, run visited all 12 properties in 111 ms. (steps per millisecond=41 )
Probabilistic random walk after 4614 steps, saw 4496 distinct states, run finished after 116 ms. (steps per millisecond=39 ) 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 114 ms. Remains 1916 /1916 variables (removed 0) and now considering 356/356 (removed 0) transitions.
[2024-06-01 05:05:55] [INFO ] Invariant cache hit.
[2024-06-01 05:05:56] [INFO ] Implicit Places using invariants in 1703 ms returned []
[2024-06-01 05:05:56] [INFO ] Invariant cache hit.
[2024-06-01 05:05:59] [INFO ] Implicit Places using invariants and state equation in 3027 ms returned []
Implicit Place search using SMT with State Equation took 4732 ms to find 0 implicit places.
Running 332 sub problems to find dead transitions.
[2024-06-01 05:05:59] [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 30015 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 60456ms problems are : Problem set: 0 solved, 332 unsolved
Search for dead transitions found 0 dead transitions in 60462ms
Finished structural reductions in LTL mode , in 1 iterations and 65311 ms. Remains : 1916/1916 places, 356/356 transitions.
Stuttering acceptance computed with spot in 587 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 3717 reset in 1118 ms.
Product exploration explored 100000 steps with 3714 reset in 1024 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 612 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 667 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 (1487 resets) in 1415 ms. (28 steps per ms) remains 13/18 properties
BEST_FIRST walk for 40004 steps (88 resets) in 1737 ms. (23 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (71 resets) in 1315 ms. (30 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (118 resets) in 1475 ms. (27 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (44 resets) in 159 ms. (250 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (45 resets) in 623 ms. (64 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (120 resets) in 651 ms. (61 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (117 resets) in 695 ms. (57 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (46 resets) in 700 ms. (57 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (49 resets) in 643 ms. (62 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (49 resets) in 725 ms. (55 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (120 resets) in 674 ms. (59 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (69 resets) in 624 ms. (64 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (70 resets) in 167 ms. (238 steps per ms) remains 13/13 properties
[2024-06-01 05:07:08] [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 apf1 is UNSAT
Problem apf6 is UNSAT
Problem apf7 is UNSAT
At refinement iteration 4 (OVERLAPS) 254/1360 variables, 1106/2118 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1360 variables, 0/2118 constraints. Problems are: Problem set: 3 solved, 10 unsolved
Problem apf2 is UNSAT
Problem apf5 is UNSAT
Problem apf12 is UNSAT
At refinement iteration 6 (OVERLAPS) 785/2145 variables, 691/2809 constraints. Problems are: Problem set: 6 solved, 7 unsolved
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
At refinement iteration 10 (INCLUDED_ONLY) 0/2168 variables, 23/3338 constraints. Problems are: Problem set: 6 solved, 7 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2168/2272 variables, and 3338 constraints, problems are : Problem set: 6 solved, 7 unsolved in 5012 ms.
Refiners :[Generalized P Invariants (flows): 1518/1562 constraints, State Equation: 1820/1916 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 6 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/577 variables, 506/506 constraints. Problems are: Problem set: 6 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/577 variables, 0/506 constraints. Problems are: Problem set: 6 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 529/1106 variables, 506/1012 constraints. Problems are: Problem set: 6 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1106 variables, 0/1012 constraints. Problems are: Problem set: 6 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 254/1360 variables, 1106/2118 constraints. Problems are: Problem set: 6 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1360 variables, 0/2118 constraints. Problems are: Problem set: 6 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 785/2145 variables, 691/2809 constraints. Problems are: Problem set: 6 solved, 7 unsolved
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, 7/3300 constraints. Problems are: Problem set: 6 solved, 7 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2145/2272 variables, and 3300 constraints, problems are : Problem set: 6 solved, 7 unsolved in 5011 ms.
Refiners :[Generalized P Invariants (flows): 1496/1562 constraints, State Equation: 1797/1916 constraints, PredecessorRefiner: 7/13 constraints, Known Traps: 0/0 constraints]
After SMT, in 10997ms 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.11 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 144 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 144 ms. Remains : 1316/1916 places, 280/356 transitions.
RANDOM walk for 40000 steps (1546 resets) in 1502 ms. (26 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (92 resets) in 581 ms. (68 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (49 resets) in 180 ms. (221 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (48 resets) in 606 ms. (65 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (51 resets) in 641 ms. (62 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (51 resets) in 694 ms. (57 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (72 resets) in 618 ms. (64 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (73 resets) in 117 ms. (339 steps per ms) remains 7/7 properties
Finished probabilistic random walk after 3709 steps, run visited all 7 properties in 168 ms. (steps per millisecond=22 )
Probabilistic random walk after 3709 steps, saw 3616 distinct states, run finished after 169 ms. (steps per millisecond=21 ) 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 803 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 86446 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.27 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 208 ms. Remains 1891 /1916 variables (removed 25) and now considering 353/356 (removed 3) transitions.
// Phase 1: matrix 353 rows 1891 cols
[2024-06-01 05:07:21] [INFO ] Computed 1540 invariants in 43 ms
[2024-06-01 05:07:23] [INFO ] Implicit Places using invariants in 2155 ms returned []
[2024-06-01 05:07:23] [INFO ] Invariant cache hit.
[2024-06-01 05:07:28] [INFO ] Implicit Places using invariants and state equation in 4572 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 6733 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 85 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 7026 ms. Remains : 1845/1916 places, 353/356 transitions.
Stuttering acceptance computed with spot in 64 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 27 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-22-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-22-LTLFireability-01 finished in 7112 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 69 ms. Remains 1916 /1916 variables (removed 0) and now considering 356/356 (removed 0) transitions.
// Phase 1: matrix 356 rows 1916 cols
[2024-06-01 05:07:28] [INFO ] Computed 1562 invariants in 38 ms
[2024-06-01 05:07:30] [INFO ] Implicit Places using invariants in 2216 ms returned []
[2024-06-01 05:07:30] [INFO ] Invariant cache hit.
[2024-06-01 05:07:34] [INFO ] Implicit Places using invariants and state equation in 3201 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 5419 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 61 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 5551 ms. Remains : 1893/1916 places, 356/356 transitions.
Stuttering acceptance computed with spot in 173 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 25 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-22-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-22-LTLFireability-02 finished in 5749 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 66 ms. Remains 1916 /1916 variables (removed 0) and now considering 356/356 (removed 0) transitions.
[2024-06-01 05:07:34] [INFO ] Invariant cache hit.
[2024-06-01 05:07:36] [INFO ] Implicit Places using invariants in 2223 ms returned []
[2024-06-01 05:07:36] [INFO ] Invariant cache hit.
[2024-06-01 05:07:42] [INFO ] Implicit Places using invariants and state equation in 6250 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 8479 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 72 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 8617 ms. Remains : 1893/1916 places, 356/356 transitions.
Stuttering acceptance computed with spot in 99 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 427 ms.
Product exploration explored 100000 steps with 33333 reset in 416 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 17 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 9909 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 70 ms. Remains 1916 /1916 variables (removed 0) and now considering 356/356 (removed 0) transitions.
[2024-06-01 05:07:44] [INFO ] Invariant cache hit.
[2024-06-01 05:07:46] [INFO ] Implicit Places using invariants in 2097 ms returned []
[2024-06-01 05:07:46] [INFO ] Invariant cache hit.
[2024-06-01 05:07:50] [INFO ] Implicit Places using invariants and state equation in 3602 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 5706 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 65 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 5843 ms. Remains : 1893/1916 places, 356/356 transitions.
Stuttering acceptance computed with spot in 567 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
Stuttering criterion allowed to conclude after 25 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 6441 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.11 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 177 ms. Remains 1891 /1916 variables (removed 25) and now considering 353/356 (removed 3) transitions.
// Phase 1: matrix 353 rows 1891 cols
[2024-06-01 05:07:50] [INFO ] Computed 1540 invariants in 26 ms
[2024-06-01 05:07:53] [INFO ] Implicit Places using invariants in 2132 ms returned []
[2024-06-01 05:07:53] [INFO ] Invariant cache hit.
[2024-06-01 05:08:03] [INFO ] Implicit Places using invariants and state equation in 10014 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 12157 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 12413 ms. Remains : 1868/1916 places, 353/356 transitions.
Stuttering acceptance computed with spot in 620 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 3717 reset in 418 ms.
Product exploration explored 100000 steps with 3718 reset in 507 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 14 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 14333 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 75 ms. Remains 1916 /1916 variables (removed 0) and now considering 356/356 (removed 0) transitions.
// Phase 1: matrix 356 rows 1916 cols
[2024-06-01 05:08:05] [INFO ] Computed 1562 invariants in 24 ms
[2024-06-01 05:08:07] [INFO ] Implicit Places using invariants in 2206 ms returned []
[2024-06-01 05:08:07] [INFO ] Invariant cache hit.
[2024-06-01 05:08:13] [INFO ] Implicit Places using invariants and state equation in 6020 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 8237 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 8377 ms. Remains : 1893/1916 places, 356/356 transitions.
Stuttering acceptance computed with spot in 136 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 1 ms.
FORMULA QuasiCertifProtocol-COL-22-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-22-LTLFireability-06 finished in 8532 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 1 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 156 ms. Remains 1890 /1916 variables (removed 26) and now considering 352/356 (removed 4) transitions.
// Phase 1: matrix 352 rows 1890 cols
[2024-06-01 05:08:13] [INFO ] Computed 1540 invariants in 30 ms
[2024-06-01 05:08:15] [INFO ] Implicit Places using invariants in 2081 ms returned []
[2024-06-01 05:08:15] [INFO ] Invariant cache hit.
[2024-06-01 05:08:34] [INFO ] Implicit Places using invariants and state equation in 18702 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 20785 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 78 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 21019 ms. Remains : 1867/1916 places, 352/356 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-22-LTLFireability-07
Stuttering criterion allowed to conclude after 28 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 21064 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 83 ms. Remains 1889 /1916 variables (removed 27) and now considering 351/356 (removed 5) transitions.
// Phase 1: matrix 351 rows 1889 cols
[2024-06-01 05:08:34] [INFO ] Computed 1540 invariants in 23 ms
[2024-06-01 05:08:36] [INFO ] Implicit Places using invariants in 1781 ms returned []
[2024-06-01 05:08:36] [INFO ] Invariant cache hit.
[2024-06-01 05:08:39] [INFO ] Implicit Places using invariants and state equation in 3095 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 4879 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 53 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 5015 ms. Remains : 1866/1916 places, 351/356 transitions.
Stuttering acceptance computed with spot in 131 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 3472 reset in 546 ms.
Product exploration explored 100000 steps with 3468 reset in 534 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 13 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 6608 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 37 ms. Remains 1916 /1916 variables (removed 0) and now considering 356/356 (removed 0) transitions.
// Phase 1: matrix 356 rows 1916 cols
[2024-06-01 05:08:41] [INFO ] Computed 1562 invariants in 32 ms
[2024-06-01 05:08:43] [INFO ] Implicit Places using invariants in 1759 ms returned []
[2024-06-01 05:08:43] [INFO ] Invariant cache hit.
[2024-06-01 05:08:48] [INFO ] Implicit Places using invariants and state equation in 5585 ms returned []
Implicit Place search using SMT with State Equation took 7349 ms to find 0 implicit places.
Running 332 sub problems to find dead transitions.
[2024-06-01 05:08:48] [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
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2271/2272 variables, and 3477 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30016 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 30015 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 60400ms problems are : Problem set: 0 solved, 332 unsolved
Search for dead transitions found 0 dead transitions in 60406ms
Finished structural reductions in LTL mode , in 1 iterations and 67795 ms. Remains : 1916/1916 places, 356/356 transitions.
Stuttering acceptance computed with spot in 179 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 67993 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 32 ms. Remains 1916 /1916 variables (removed 0) and now considering 356/356 (removed 0) transitions.
[2024-06-01 05:09:49] [INFO ] Invariant cache hit.
[2024-06-01 05:09:50] [INFO ] Implicit Places using invariants in 1686 ms returned []
[2024-06-01 05:09:50] [INFO ] Invariant cache hit.
[2024-06-01 05:09:56] [INFO ] Implicit Places using invariants and state equation in 5576 ms returned []
Implicit Place search using SMT with State Equation took 7263 ms to find 0 implicit places.
Running 332 sub problems to find dead transitions.
[2024-06-01 05:09:56] [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 30012 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
Error getting values : (error "ParserException while parsing response: ((s0 12)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 0)
(s348 0)
(s349 0)
(s350 0)
(s351 0)
(s352 0)
(s353 0)
(s354 0)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 0)
(s362 0)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 0)
(s369 0)
(s370 0)
(s371 0)
(s372 0)
(s373 0)
(s374 0)
(s375 0)
(s376 0)
(s377 0)
(s378 0)
(s379 0)
(s380 0)
(s381 0)
(s382 0)
(s383 0)
(s384 0)
(s385 0)
(s386 0)
(s387 0)
(s388 0)
(s389 0)
(s390 0)
(s391 0)
(s392 0)
(s393 0)
(s394 0)
(s395 0)
(s396 0)
(s397 0)
(s398 0)
(s399 0)
(s400 0)
(s401 0)
(s402 0)
(s403 0)
(s404 0)
(s405 0)
(s406 0)
(s407 0)
(s408 0)
(s409 0)
(s410 0)
(s411 0)
(s412 0)
(s413 0)
(s414 0)
(s415 0)
(s416 0)
(s417 0)
(s418 0)
(s419 0)
(s420 0)
(s421 0)
(s422 0)
(s423 0)
(s424 0)
(s425 0)
(s426 0)
(s427 0)
(s428 0)
(s429 0)
(s430 0)
(s431 0)
(s432 0)
(s433 0)
(s434 0)
(s435 0)
(s436 0)
(s437 0)
(s438 0)
(s439 0)
(s440 0)
(s441 0)
(s442 0)
(s443 0)
(s444 0)
(s445 0)
(s446 0)
(s447 0)
(s448 0)
(s449 0)
(s450 0)
(s451 0)
(s452 0)
(s453 0)
(s454 0)
(s455 0)
(s456 0)
(s457 0)
(s458 0)
(s459 0)
(s460 0)
(s461 0)
(s462 0)
(s463 0)
(s464 0)
(s465 0)
(s466 0)
(s467 0)
(s468 0)
(s469 0)
(s470 0)
(s471 0)
(s472 0)
(s473 0)
(s474 0)
(s475 0)
(s476 0)
(s477 0)
(s478 0)
(s479 0)
(s480 0)
(s481 0)
(s482 0)
(s483 0)
(s484 0)
(s485 0)
(s486 0)
(s487 0)
(s488 0)
(s489 0)
(s490 0)
(s491 0)
(s492 0)
(s493 0)
(s494 0)
(s495 0)
(s496 0)
(s497 0)
(s498 0)
(s499 0)
(s500 0)
(s501 0)
(s502 0)
(s503 0)
(s504 0)
(s505 0)
(s506 0)
(s507 0)
(s508 0)
(s509 0)
(s510 0)
(s511 0)
(s512 0)
(s513 0)
(s514 0)
(s515 0)
(s516 0)
(s517 0)
(s518 0)
(s519 0)
(s520 0)
(s521 0)
(s522 0)
(s523 0)
(s524 0)
(s525 0)
(s526 0)
(s527 0)
(s528 0)
(s529 0)
(s530 0)
(s531 0)
(s532 0)
(s533 0)
(s534 0)
(s535 0)
(s536 0)
(s537 0)
(s538 0)
(s539 0)
(s540 0)
(s541 0)
(s542 0)
(s543 0)
(s544 0)
(s545 0)
(s546 0)
(s547 0)
(s548 0)
(s549 0)
(s550 0)
(s551 0)
(s552 0)
(s553 0)
(s554 0)
(s555 0)
(s556 0)
(s557 0)
(s558 0)
(s559 0)
(s560 0)
(s561 0)
(s562 0)
(s563 0)
(s564 0)
(s565 0)
(s566 0)
(s567 0)
(s568 0)
(s569 0)
(s570 0)
(s571 0)
(s572 0)
(s573 0)
(s574 0)
(s575 0)
(s576 0)
(s577 0)
(s578 0)
(s579 0)
(s580 0)
(s581 0)
(s582 0)
(s583 0)
(s584 0)
(s585 0)
(s586 0)
(s587 0)
(s588 0)
(s589 0)
(s590 0)
(s591 0)
(s592 0)
(s593 0)
(s594 0)
(s595 0)
(s596 0)
(s597 0)
(s598 0)
(s599 0)
(s600 0)
(s601 0)
(s602 0)
(s603 0)
(s604 0)
(s605 0)
(s606 0)
(s607 0)
(s608 0)
(s609 0)
(s610 0)
(s611 0)
(s612 0)
(s613 0)
(s614 0)
(s615 0)
(s616 0)
(s617 0)
(s618 0)
(s619 0)
(s620 0)
(s621 0)
(s622 0)
(s623 0)
(s624 0)
(s625 0)
(s626 0)
(s627 0)
(s628 0)
(s629 0)
(s630 0)
(s631 0)
(s632 0)
(s633 0)
(s634 0)
(s635 0)
(s636 0)
(s637 0)
(s638 0)
(s639 0)
(s640 0)
(s641 0)
(s642 0)
(s643 0)
(s644 0)
(s645 0)
(s646 0)
(s647 0)
(s648 0)
(s649 0)
(s650 0)
(s651 0)
(s652 0)
(s653 0)
(s654 0)
(s655 0)
(s656 0)
(s657 0)
(s658 0)
(s659 0)
(s660 0)
(s661 0)
(s662 0)
(s663 0)
(s664 0)
(s665 0)
(s666 0)
(s667 0)
(s668 0)
(s669 0)
(s670 0)
(s671 0)
(s672 0)
(s673 0)
(s674 0)
(s675 0)
(s676 0)
(s677 0)
(s678 0)
(s679 0)
(s680 0)
(s681 0)
(s682 0)
(s683 0)
(s684 0)
(s685 0)
(s686 0)
(s687 0)
(s688 0)
(s689 0)
(s690 0)
(s691 0)
(s692 0)
(s693 0)
(s694 0)
(s695 0)
(s696 0)
(s697 0)
(s698 0)
(s699 0)
(s700 0)
(s701 0)
(s702 0)
(s703 0)
(s704 0)
(s705 0)
(s706 0)
(s707 0)
(s708 0)
(s709 0)
(s710 0)
(s711 0)
(s712 0)
(s713 0)
(s714 0)
(s715 0)
(s716 0)
(s717 0)
(s718 0)
(s719 0)
(s720 0)
(s721 0)
(s722 0)
(s723 0)
(s724 0)
(s725 0)
(s726 0)
(s727 0)
(s728 0)
(s729 0)
(s730 0)
(s731 0)
(s732 0)
(s733 0)
(s734 0)
(s735 0)
(s736 0)
(s737 0)
(s738 0)
(s739 0)
(s740 0)
(s741 0)
(s742 0)
(s743 0)
(s744 0)
(s745 0)
(s746 0)
(s747 0)
(s748 0)
(s749 0)
(s750 0)
(s751 0)
(s752 0)
(s753 0)
(s754 0)
(s755 0)
(s756 0)
(s757 0)
(s758 0)
(s759 0)
(s760 0)
(s761 0)
(s762 0)
(s763 0)
(s764 0)
(s765 0)
(s766 0)
(s767 0)
(s768 0)
(s769 0)
(s770 0)
(s771 0)
(s772 0)
(s773 0)
(s774 0)
(s775 0)
(s776 0)
(s777 0)
(s778 0)
(s779 0)
(s780 0)
(s781 0)
(s782 0)
(s783 0)
(s784 0)
(s785 0)
(s786 0)
(s787 0)
(s788 0)
(s789 0)
(s790 0)
(s791 0)
(s792 0)
(s793 0)
(s794 0)
(s795 0)
(s796 0)
(s797 0)
(s798 0)
(s799 0)
(s800 0)
(s801 0)
(s802 0)
(s803 0)
(s804 0)
(s805 0)
(s806 0)
(s807 0)
(s808 0)
(s809 0)
(s810 0)
(s811 0)
(s812 0)
(s813 0)
(s814 0)
(s815 0)
(s816 0)
(s817 0)
(s818 0)
(s819 0)
(s820 0)
(s821 0)
(s822 0)
(s823 0)
(s824 0)
(s825 0)
(s826 0)
(s827 0)
(s828 0)
(s829 0)
(s830 0)
(s831 0)
(s832 0)
(s833 0)timeout
(s834 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
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 60401ms problems are : Problem set: 0 solved, 332 unsolved
Search for dead transitions found 0 dead transitions in 60404ms
Finished structural reductions in LTL mode , in 1 iterations and 67701 ms. Remains : 1916/1916 places, 356/356 transitions.
Stuttering acceptance computed with spot in 287 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 3710 reset in 493 ms.
Product exploration explored 100000 steps with 3716 reset in 542 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 837 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 162 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 (1482 resets) in 337 ms. (118 steps per ms) remains 4/7 properties
BEST_FIRST walk for 40004 steps (87 resets) in 567 ms. (70 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (85 resets) in 563 ms. (70 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (49 resets) in 680 ms. (58 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (93 resets) in 124 ms. (320 steps per ms) remains 4/4 properties
[2024-06-01 05:11:00] [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 2851 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 5032 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 7946ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Finished Parikh walk after 98 steps, including 0 resets, run visited all 4 properties in 8 ms. (steps per millisecond=12 )
Parikh walk visited 4 properties in 18 ms.
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 1483 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 173 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 183 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 37 ms. Remains 1916 /1916 variables (removed 0) and now considering 356/356 (removed 0) transitions.
[2024-06-01 05:11:10] [INFO ] Invariant cache hit.
[2024-06-01 05:11:11] [INFO ] Implicit Places using invariants in 1693 ms returned []
[2024-06-01 05:11:11] [INFO ] Invariant cache hit.
[2024-06-01 05:11:17] [INFO ] Implicit Places using invariants and state equation in 5630 ms returned []
Implicit Place search using SMT with State Equation took 7326 ms to find 0 implicit places.
Running 332 sub problems to find dead transitions.
[2024-06-01 05:11:17] [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 30027 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 30027 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 60429ms problems are : Problem set: 0 solved, 332 unsolved
Search for dead transitions found 0 dead transitions in 60434ms
Finished structural reductions in LTL mode , in 1 iterations and 67800 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 542 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 161 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 (1480 resets) in 381 ms. (104 steps per ms) remains 4/7 properties
BEST_FIRST walk for 40004 steps (89 resets) in 532 ms. (75 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (48 resets) in 619 ms. (64 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (84 resets) in 535 ms. (74 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (87 resets) in 75 ms. (526 steps per ms) remains 4/4 properties
[2024-06-01 05:12:19] [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 2753 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 5014 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 7829ms 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 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 55 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 55 ms. Remains : 648/1916 places, 96/356 transitions.
RANDOM walk for 40000 steps (1600 resets) in 633 ms. (63 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (96 resets) in 521 ms. (76 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (64 resets) in 609 ms. (65 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (103 resets) in 524 ms. (76 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (101 resets) in 68 ms. (579 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 1099 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 188 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 179 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 201 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 3715 reset in 505 ms.
Product exploration explored 100000 steps with 3716 reset in 512 ms.
Applying partial POR strategy [true, true, true, false, false]
Stuttering acceptance computed with spot in 184 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 1 ms
Applied a total of 2 rules in 229 ms. Remains 1892 /1916 variables (removed 24) and now considering 355/356 (removed 1) transitions.
[2024-06-01 05:12:31] [INFO ] Redundant transitions in 47 ms returned []
Running 331 sub problems to find dead transitions.
// Phase 1: matrix 355 rows 1892 cols
[2024-06-01 05:12:31] [INFO ] Computed 1540 invariants in 24 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
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2246/2247 variables, and 3431 constraints, problems are : Problem set: 2 solved, 329 unsolved in 30016 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
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 2244/2247 variables, and 3759 constraints, problems are : Problem set: 2 solved, 329 unsolved in 30024 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 60444ms problems are : Problem set: 2 solved, 329 unsolved
Search for dead transitions found 2 dead transitions in 60450ms
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.5 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 47 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 60783 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 50 ms. Remains 1916 /1916 variables (removed 0) and now considering 356/356 (removed 0) transitions.
// Phase 1: matrix 356 rows 1916 cols
[2024-06-01 05:13:32] [INFO ] Computed 1562 invariants in 28 ms
[2024-06-01 05:13:33] [INFO ] Implicit Places using invariants in 1745 ms returned []
[2024-06-01 05:13:33] [INFO ] Invariant cache hit.
[2024-06-01 05:13:39] [INFO ] Implicit Places using invariants and state equation in 5454 ms returned []
Implicit Place search using SMT with State Equation took 7201 ms to find 0 implicit places.
Running 332 sub problems to find dead transitions.
[2024-06-01 05:13:39] [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
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 0.0)
(s1000 0.0)
(s1001 0.0)
(s1002 0.0)
(s1003 0.0)
(s1004 0.0)
(s1005 0.0)
(s1006 0.0)
(s1007 0.0)
(s1008 0.0)
(s1009 0.0)
(s1010 0.0)
(s1011 0.0)
(s1012 0.0)
(s1013 0.0)
(s1014 0.0)
(s1015 0.0)
(s1016 0.0)
(s1017 0.0)
(s1018 0.0)
(s1019 0.0)
(s1020 0.0)
(s1021 0.0)
(s1022 0.0)
(s1023 0.0)
(s1024 0.0)
(s1025 0.0)
(s1026 0.0)
(s1027 0.0)
(s1028 0.0)
(s1029 0.0)
(s1030 0.0)
(s1031 0.0)
(s1032 0.0)
(s1033 0.0)
(s1034 0.0)
(s1035 0.0)
(s1036 0.0)
(s1037 0.0)
(s1038 0.0)
(s1039 0.0)
(s1040 0.0)
(s1041 0.0)
(s1042 0.0)
(s1043 0.0)
(s1044 0.0)
(s1045 0.0)
(s1046 0.0)
(s1047 0.0)
(s1048 0.0)
(s1049 0.0)
(s1050 0.0)
(s1051 0.0)
(s1052 0.0)
(s1053 0.0)
(s1054 0.0)
(s1055 0.0)
(s1056 0.0)
(s1057 0.0)
(s1058 0.0)
(s1059 0.0)
(s1060 0.0)
(s1061 0.0)
(s1062 0.0)
(s1063 0.0)
(s1064 0.0)
(s1065 0.0)
(s1066 0.0)
(s1067 0.0)
(s1068 0.0)
(s1069 0.0)
(s1070 0.0)
(s1071 0.0)
(s1072 0.0)
(s1073 0.0)
(s1074 0.0)
(s1075 0.0)
(s1076 0.0)
(s1077 0.0)
(s1078 0.0)
(s1079 0.0)
(s1080 0.0)
(s1081 0.0)
(s1082 0.0)
(s1083 0.0)
(s1084 0.0)
(s1085 0.0)
(s1086 0.0)
(s1087 0.0)
(s1088 0.0)
(s1089 0.0)
(s1090 0.0)
(s1091 0.0)
(s1092 0.0)
(s1093 0.0)
(s1094 0.0)
(s1095 0.0)
(s1096 0.0)
(s1097 0.0)
(s1098 0.0)
(s1099 0.0)
(s1100 0.0)
(s1101 0.0)
(s1102 0.0)
(s1103 0.0)
(s1104 0.0)
(s1105 0.0)timeout
(s1106 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
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 30015 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 30028 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 60421ms problems are : Problem set: 0 solved, 332 unsolved
Search for dead transitions found 0 dead transitions in 60440ms
Finished structural reductions in LTL mode , in 1 iterations and 67693 ms. Remains : 1916/1916 places, 356/356 transitions.
Treatment of property QuasiCertifProtocol-COL-22-LTLFireability-11 finished in 290721 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-06-01 05:14:40] [INFO ] Invariant cache hit.
[2024-06-01 05:14:41] [INFO ] Implicit Places using invariants in 1788 ms returned []
[2024-06-01 05:14:41] [INFO ] Invariant cache hit.
[2024-06-01 05:14:47] [INFO ] Implicit Places using invariants and state equation in 5325 ms returned []
Implicit Place search using SMT with State Equation took 7119 ms to find 0 implicit places.
Running 332 sub problems to find dead transitions.
[2024-06-01 05:14:47] [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 30019 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 30024 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 60418ms
Finished structural reductions in LTL mode , in 1 iterations and 67579 ms. Remains : 1916/1916 places, 356/356 transitions.
Stuttering acceptance computed with spot in 175 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 67777 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 59 ms. Remains 1916 /1916 variables (removed 0) and now considering 356/356 (removed 0) transitions.
[2024-06-01 05:15:47] [INFO ] Invariant cache hit.
[2024-06-01 05:15:49] [INFO ] Implicit Places using invariants in 2105 ms returned []
[2024-06-01 05:15:49] [INFO ] Invariant cache hit.
[2024-06-01 05:15:55] [INFO ] Implicit Places using invariants and state equation in 5844 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 7953 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 8070 ms. Remains : 1893/1916 places, 356/356 transitions.
Stuttering acceptance computed with spot in 80 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 15 steps with 7 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-22-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-22-LTLFireability-13 finished in 8162 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 60 ms. Remains 1916 /1916 variables (removed 0) and now considering 356/356 (removed 0) transitions.
[2024-06-01 05:15:55] [INFO ] Invariant cache hit.
[2024-06-01 05:15:58] [INFO ] Implicit Places using invariants in 2112 ms returned []
[2024-06-01 05:15:58] [INFO ] Invariant cache hit.
[2024-06-01 05:16:03] [INFO ] Implicit Places using invariants and state equation in 5871 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 7985 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 8105 ms. Remains : 1893/1916 places, 356/356 transitions.
Stuttering acceptance computed with spot in 148 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 8272 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 60 ms. Remains 1916 /1916 variables (removed 0) and now considering 356/356 (removed 0) transitions.
[2024-06-01 05:16:04] [INFO ] Invariant cache hit.
[2024-06-01 05:16:06] [INFO ] Implicit Places using invariants in 2076 ms returned []
[2024-06-01 05:16:06] [INFO ] Invariant cache hit.
[2024-06-01 05:16:09] [INFO ] Implicit Places using invariants and state equation in 3426 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 5524 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 55 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 5639 ms. Remains : 1893/1916 places, 356/356 transitions.
Stuttering acceptance computed with spot in 111 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 31310 reset in 484 ms.
Product exploration explored 100000 steps with 31391 reset in 518 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 285 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 103 ms :[true, (AND (NOT p0) p2), (AND (NOT p0) p2), p2]
RANDOM walk for 40000 steps (1482 resets) in 200 ms. (199 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (68 resets) in 100 ms. (396 steps per ms) remains 1/1 properties
// Phase 1: matrix 356 rows 1893 cols
[2024-06-01 05:16:11] [INFO ] Computed 1540 invariants in 122 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 822 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 1299 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 2275ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 121 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=60 )
Parikh walk visited 1 properties in 3 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 259 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 114 ms :[true, (AND (NOT p0) p2), (AND (NOT p0) p2), p2]
Stuttering acceptance computed with spot in 101 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 65 ms. Remains 1893 /1893 variables (removed 0) and now considering 356/356 (removed 0) transitions.
[2024-06-01 05:16:14] [INFO ] Invariant cache hit.
[2024-06-01 05:16:16] [INFO ] Implicit Places using invariants in 2040 ms returned []
[2024-06-01 05:16:16] [INFO ] Invariant cache hit.
[2024-06-01 05:16:20] [INFO ] Implicit Places using invariants and state equation in 3532 ms returned []
Implicit Place search using SMT with State Equation took 5574 ms to find 0 implicit places.
Running 332 sub problems to find dead transitions.
[2024-06-01 05:16:20] [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 30021 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 30024 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 60401ms problems are : Problem set: 0 solved, 332 unsolved
Search for dead transitions found 0 dead transitions in 60405ms
Finished structural reductions in LTL mode , in 1 iterations and 66048 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 161 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 99 ms :[true, (AND (NOT p0) p2), (AND (NOT p0) p2), p2]
RANDOM walk for 40000 steps (1486 resets) in 207 ms. (192 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (68 resets) in 87 ms. (454 steps per ms) remains 1/1 properties
[2024-06-01 05:17:21] [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 836 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 1308 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 2164ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 121 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=24 )
Parikh walk visited 1 properties in 5 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 200 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 101 ms :[true, (AND (NOT p0) p2), (AND (NOT p0) p2), p2]
Stuttering acceptance computed with spot in 99 ms :[true, (AND (NOT p0) p2), (AND (NOT p0) p2), p2]
Stuttering acceptance computed with spot in 106 ms :[true, (AND (NOT p0) p2), (AND (NOT p0) p2), p2]
Product exploration explored 100000 steps with 31214 reset in 499 ms.
Product exploration explored 100000 steps with 31716 reset in 505 ms.
Applying partial POR strategy [true, false, false, true]
Stuttering acceptance computed with spot in 120 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.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
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 138 ms. Remains 1869 /1893 variables (removed 24) and now considering 356/356 (removed 0) transitions.
[2024-06-01 05:17:25] [INFO ] Redundant transitions in 37 ms returned []
Running 332 sub problems to find dead transitions.
// Phase 1: matrix 356 rows 1869 cols
[2024-06-01 05:17:25] [INFO ] Computed 1518 invariants in 162 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 30014 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 30024 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 60576ms problems are : Problem set: 4 solved, 328 unsolved
Search for dead transitions found 4 dead transitions in 60580ms
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 70 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 60840 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 56 ms. Remains 1893 /1893 variables (removed 0) and now considering 356/356 (removed 0) transitions.
// Phase 1: matrix 356 rows 1893 cols
[2024-06-01 05:18:26] [INFO ] Computed 1540 invariants in 140 ms
[2024-06-01 05:18:28] [INFO ] Implicit Places using invariants in 2260 ms returned []
[2024-06-01 05:18:28] [INFO ] Invariant cache hit.
[2024-06-01 05:18:32] [INFO ] Implicit Places using invariants and state equation in 3733 ms returned []
Implicit Place search using SMT with State Equation took 5999 ms to find 0 implicit places.
Running 332 sub problems to find dead transitions.
[2024-06-01 05:18:32] [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 30016 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 30016 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 60430ms problems are : Problem set: 0 solved, 332 unsolved
Search for dead transitions found 0 dead transitions in 60440ms
Finished structural reductions in LTL mode , in 1 iterations and 66498 ms. Remains : 1893/1893 places, 356/356 transitions.
Treatment of property QuasiCertifProtocol-COL-22-LTLFireability-15 finished in 208398 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 291 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.8 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 83 ms. Remains 1891 /1916 variables (removed 25) and now considering 353/356 (removed 3) transitions.
// Phase 1: matrix 353 rows 1891 cols
[2024-06-01 05:19:33] [INFO ] Computed 1540 invariants in 26 ms
[2024-06-01 05:19:34] [INFO ] Implicit Places using invariants in 1845 ms returned []
[2024-06-01 05:19:34] [INFO ] Invariant cache hit.
[2024-06-01 05:19:40] [INFO ] Implicit Places using invariants and state equation in 5217 ms returned []
Implicit Place search using SMT with State Equation took 7064 ms to find 0 implicit places.
Running 329 sub problems to find dead transitions.
[2024-06-01 05:19: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
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 30011 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 60437ms problems are : Problem set: 0 solved, 329 unsolved
Search for dead transitions found 0 dead transitions in 60442ms
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 67590 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 3718 reset in 492 ms.
Product exploration explored 100000 steps with 3712 reset in 527 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 836 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 165 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 (1487 resets) in 745 ms. (53 steps per ms) remains 4/7 properties
BEST_FIRST walk for 40004 steps (89 resets) in 628 ms. (63 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (85 resets) in 616 ms. (64 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (49 resets) in 666 ms. (59 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (91 resets) in 168 ms. (236 steps per ms) remains 4/4 properties
[2024-06-01 05:20:43] [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 2511 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
At refinement iteration 12 (INCLUDED_ONLY) 0/2244 variables, 0/3435 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/2244 variables, 0/3435 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2244/2244 variables, and 3435 constraints, problems are : Problem set: 0 solved, 4 unsolved in 5018 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 7612ms 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.1 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 21 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 21 ms. Remains : 648/1891 places, 96/353 transitions.
RANDOM walk for 40000 steps (1600 resets) in 1216 ms. (32 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (101 resets) in 601 ms. (66 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (102 resets) in 729 ms. (54 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (64 resets) in 664 ms. (60 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (99 resets) in 121 ms. (327 steps per ms) remains 4/4 properties
Finished probabilistic random walk after 902 steps, run visited all 4 properties in 21 ms. (steps per millisecond=42 )
Probabilistic random walk after 902 steps, saw 856 distinct states, run finished after 21 ms. (steps per millisecond=42 ) 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 1516 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 179 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 183 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 33 ms. Remains 1891 /1891 variables (removed 0) and now considering 353/353 (removed 0) transitions.
[2024-06-01 05:20:54] [INFO ] Invariant cache hit.
[2024-06-01 05:20:56] [INFO ] Implicit Places using invariants in 1777 ms returned []
[2024-06-01 05:20:56] [INFO ] Invariant cache hit.
[2024-06-01 05:21:01] [INFO ] Implicit Places using invariants and state equation in 5446 ms returned []
Implicit Place search using SMT with State Equation took 7226 ms to find 0 implicit places.
Running 329 sub problems to find dead transitions.
[2024-06-01 05:21:01] [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 30022 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 60445ms problems are : Problem set: 0 solved, 329 unsolved
Search for dead transitions found 0 dead transitions in 60450ms
Finished structural reductions in LTL mode , in 1 iterations and 67712 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 674 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 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 (1482 resets) in 1143 ms. (34 steps per ms) remains 4/7 properties
BEST_FIRST walk for 40004 steps (80 resets) in 679 ms. (58 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (51 resets) in 643 ms. (62 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (89 resets) in 604 ms. (66 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (90 resets) in 128 ms. (310 steps per ms) remains 4/4 properties
[2024-06-01 05:22:04] [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 2490 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
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 5020 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 7572ms 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 33 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 34 ms. Remains : 648/1891 places, 96/353 transitions.
RANDOM walk for 40000 steps (1600 resets) in 1223 ms. (32 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (98 resets) in 601 ms. (66 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (64 resets) in 668 ms. (59 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (102 resets) in 601 ms. (66 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (100 resets) in 119 ms. (333 steps per ms) remains 4/4 properties
Finished probabilistic random walk after 902 steps, run visited all 4 properties in 28 ms. (steps per millisecond=32 )
Probabilistic random walk after 902 steps, saw 856 distinct states, run finished after 28 ms. (steps per millisecond=32 ) 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 1179 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 181 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 187 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 176 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 3714 reset in 500 ms.
Product exploration explored 100000 steps with 3718 reset in 530 ms.
Applying partial POR strategy [true, true, true, false, false]
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 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 50 ms. Remains 1891 /1891 variables (removed 0) and now considering 353/353 (removed 0) transitions.
[2024-06-01 05:22:15] [INFO ] Redundant transitions in 19 ms returned []
Running 329 sub problems to find dead transitions.
[2024-06-01 05:22:15] [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 30026 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 30025 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 60502ms problems are : Problem set: 0 solved, 329 unsolved
Search for dead transitions found 0 dead transitions in 60506ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60587 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-06-01 05:23:16] [INFO ] Invariant cache hit.
[2024-06-01 05:23:18] [INFO ] Implicit Places using invariants in 1731 ms returned []
[2024-06-01 05:23:18] [INFO ] Invariant cache hit.
[2024-06-01 05:23:23] [INFO ] Implicit Places using invariants and state equation in 5196 ms returned []
Implicit Place search using SMT with State Equation took 6929 ms to find 0 implicit places.
Running 329 sub problems to find dead transitions.
[2024-06-01 05:23:23] [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 "Error writing to Z3 solver: java.io.IOException: Broken pipe")
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 30016 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 30027 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 60427ms problems are : Problem set: 0 solved, 329 unsolved
Search for dead transitions found 0 dead transitions in 60433ms
Finished structural reductions in LTL mode , in 1 iterations and 67392 ms. Remains : 1891/1891 places, 353/353 transitions.
Treatment of property QuasiCertifProtocol-COL-22-LTLFireability-11 finished in 291221 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-06-01 05:24:24] [INFO ] Flatten gal took : 62 ms
[2024-06-01 05:24:24] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 4 ms.
[2024-06-01 05:24:24] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1916 places, 356 transitions and 4110 arcs took 9 ms.
Total runtime 1189781 ms.
There are residual formulas that ITS could not solve within timeout
Could not compute solution for formula : QuasiCertifProtocol-COL-22-LTLFireability-11
Could not compute solution for formula : QuasiCertifProtocol-COL-22-LTLFireability-15
BK_STOP 1717219699081
--------------------
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
mcc2024
ltl formula name QuasiCertifProtocol-COL-22-LTLFireability-11
ltl formula formula --ltl=/tmp/2253/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1916 places, 356 transitions and 4110 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.090 real 0.020 user 0.020 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2253/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2253/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2253/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2253/ltl_0_
terminate called after throwing an instance of 'std::runtime_error'
what(): too many children for formula
ltl formula name QuasiCertifProtocol-COL-22-LTLFireability-15
ltl formula formula --ltl=/tmp/2253/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1916 places, 356 transitions and 4110 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.060 real 0.030 user 0.000 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2253/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2253/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2253/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2253/ltl_1_
pnml2lts-mc( 3/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***
Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
pnml2lts-mc( 1/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
pnml2lts-mc( 0/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
malloc_consolidate(): unaligned fastbin chunk detected
*** segmentation fault ***
Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
*** segmentation fault ***
Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): unaligned fastbin chunk detected
malloc_consolidate(): unaligned fastbin chunk detected
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="ltsminxred"
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 ltsminxred"
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 r520-tall-171662337700036"
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 '
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 ;