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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 400K
-rw-r--r-- 1 mcc users 7.4K Apr 13 03:45 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Apr 13 03:45 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Apr 13 03:43 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K Apr 13 03:43 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.3K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 19K 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 17K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.1K Apr 13 03:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 75K Apr 13 03:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Apr 13 03:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 13 03:46 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 34K 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-02-LTLCardinality-00
FORMULA_NAME QuasiCertifProtocol-COL-02-LTLCardinality-01
FORMULA_NAME QuasiCertifProtocol-COL-02-LTLCardinality-02
FORMULA_NAME QuasiCertifProtocol-COL-02-LTLCardinality-03
FORMULA_NAME QuasiCertifProtocol-COL-02-LTLCardinality-04
FORMULA_NAME QuasiCertifProtocol-COL-02-LTLCardinality-05
FORMULA_NAME QuasiCertifProtocol-COL-02-LTLCardinality-06
FORMULA_NAME QuasiCertifProtocol-COL-02-LTLCardinality-07
FORMULA_NAME QuasiCertifProtocol-COL-02-LTLCardinality-08
FORMULA_NAME QuasiCertifProtocol-COL-02-LTLCardinality-09
FORMULA_NAME QuasiCertifProtocol-COL-02-LTLCardinality-10
FORMULA_NAME QuasiCertifProtocol-COL-02-LTLCardinality-11
FORMULA_NAME QuasiCertifProtocol-COL-02-LTLCardinality-12
FORMULA_NAME QuasiCertifProtocol-COL-02-LTLCardinality-13
FORMULA_NAME QuasiCertifProtocol-COL-02-LTLCardinality-14
FORMULA_NAME QuasiCertifProtocol-COL-02-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717217899123

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-COL-02
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 04:58:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 04:58:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 04:58:20] [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 04:58:20] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 04:58:21] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 605 ms
[2024-06-01 04:58:21] [INFO ] Imported 30 HL places and 26 HL transitions for a total of 86 PT places and 56.0 transition bindings in 19 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
[2024-06-01 04:58:21] [INFO ] Built PT skeleton of HLPN with 30 places and 26 transitions 77 arcs in 5 ms.
[2024-06-01 04:58:21] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 1 formulas.
FORMULA QuasiCertifProtocol-COL-02-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 30 stabilizing places and 26 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 30 transition count 26
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Remains 15 properties that can be checked using skeleton over-approximation.
Computed a total of 30 stabilizing places and 26 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 30 transition count 26
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
RANDOM walk for 40001 steps (5328 resets) in 1442 ms. (27 steps per ms) remains 3/24 properties
BEST_FIRST walk for 40000 steps (2966 resets) in 450 ms. (88 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (2782 resets) in 154 ms. (258 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (2824 resets) in 83 ms. (476 steps per ms) remains 3/3 properties
// Phase 1: matrix 26 rows 30 cols
[2024-06-01 04:58:22] [INFO ] Computed 5 invariants in 15 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp12 is UNSAT
At refinement iteration 1 (OVERLAPS) 17/20 variables, 3/3 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/3 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/22 variables, 2/5 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 0/5 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 26/48 variables, 22/27 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/48 variables, 0/27 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 8/56 variables, 8/35 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/56 variables, 0/35 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/56 variables, 0/35 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 56/56 variables, and 35 constraints, problems are : Problem set: 2 solved, 1 unsolved in 224 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 11/12 variables, 2/2 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/2 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/14 variables, 2/4 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 0/4 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 15/29 variables, 14/18 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/29 variables, 1/19 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/29 variables, 0/19 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 14/43 variables, 8/27 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/43 variables, 0/27 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 12/55 variables, 7/34 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/55 variables, 0/34 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/56 variables, 1/35 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/56 variables, 1/36 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/56 variables, 0/36 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/56 variables, 0/36 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 56/56 variables, and 36 constraints, problems are : Problem set: 2 solved, 1 unsolved in 92 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 1/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 366ms problems are : Problem set: 2 solved, 1 unsolved
Finished Parikh walk after 30 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=30 )
Parikh walk visited 1 properties in 6 ms.
Successfully simplified 2 atomic propositions for a total of 15 simplifications.
FORMULA QuasiCertifProtocol-COL-02-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-02-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 04:58:22] [INFO ] Flatten gal took : 19 ms
[2024-06-01 04:58:22] [INFO ] Flatten gal took : 5 ms
Domain [tsid(3), tsid(3)] of place n9 breaks symmetries in sort tsid
[2024-06-01 04:58:22] [INFO ] Unfolded HLPN to a Petri net with 86 places and 56 transitions 223 arcs in 10 ms.
[2024-06-01 04:58:22] [INFO ] Unfolded 13 HLPN properties in 0 ms.
Support contains 74 out of 86 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 56/56 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 85 transition count 56
Applied a total of 1 rules in 12 ms. Remains 85 /86 variables (removed 1) and now considering 56/56 (removed 0) transitions.
// Phase 1: matrix 56 rows 85 cols
[2024-06-01 04:58:22] [INFO ] Computed 30 invariants in 9 ms
[2024-06-01 04:58:22] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-06-01 04:58:22] [INFO ] Invariant cache hit.
[2024-06-01 04:58:22] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
Running 52 sub problems to find dead transitions.
[2024-06-01 04:58:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (OVERLAPS) 8/83 variables, 6/24 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 6/30 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 5 (OVERLAPS) 56/139 variables, 83/113 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 7 (OVERLAPS) 2/141 variables, 2/115 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/141 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 9 (OVERLAPS) 0/141 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Real declared 141/141 variables, and 115 constraints, problems are : Problem set: 0 solved, 52 unsolved in 1179 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 85/85 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 52 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (OVERLAPS) 8/83 variables, 6/24 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 6/30 constraints. Problems are: Problem set: 0 solved, 52 unsolved
[2024-06-01 04:58:24] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 11 ms to minimize.
[2024-06-01 04:58:24] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 52 unsolved
[2024-06-01 04:58:24] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 3 ms to minimize.
[2024-06-01 04:58:24] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 1 ms to minimize.
[2024-06-01 04:58:24] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2024-06-01 04:58:24] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 1 ms to minimize.
[2024-06-01 04:58:24] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/83 variables, 5/37 constraints. Problems are: Problem set: 0 solved, 52 unsolved
[2024-06-01 04:58:24] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/83 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 52 unsolved
[2024-06-01 04:58:24] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
[2024-06-01 04:58:24] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/83 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/83 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 9 (OVERLAPS) 56/139 variables, 83/123 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/139 variables, 50/173 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/139 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 12 (OVERLAPS) 2/141 variables, 2/175 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/141 variables, 2/177 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/141 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 15 (OVERLAPS) 0/141 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Int declared 141/141 variables, and 177 constraints, problems are : Problem set: 0 solved, 52 unsolved in 2065 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 85/85 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 10/10 constraints]
After SMT, in 3275ms problems are : Problem set: 0 solved, 52 unsolved
Search for dead transitions found 0 dead transitions in 3277ms
Starting structural reductions in LTL mode, iteration 1 : 85/86 places, 56/56 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3453 ms. Remains : 85/86 places, 56/56 transitions.
Support contains 74 out of 85 places after structural reductions.
[2024-06-01 04:58:26] [INFO ] Flatten gal took : 9 ms
[2024-06-01 04:58:26] [INFO ] Flatten gal took : 8 ms
[2024-06-01 04:58:26] [INFO ] Input system was already deterministic with 56 transitions.
RANDOM walk for 40000 steps (6572 resets) in 1528 ms. (26 steps per ms) remains 14/23 properties
BEST_FIRST walk for 40000 steps (2664 resets) in 169 ms. (235 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40000 steps (2664 resets) in 166 ms. (239 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (2240 resets) in 155 ms. (256 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (2245 resets) in 125 ms. (317 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (2241 resets) in 124 ms. (320 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (2258 resets) in 181 ms. (219 steps per ms) remains 13/14 properties
BEST_FIRST walk for 40003 steps (2243 resets) in 172 ms. (231 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (2235 resets) in 179 ms. (222 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (2256 resets) in 130 ms. (305 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (2236 resets) in 216 ms. (184 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (2228 resets) in 117 ms. (339 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (2263 resets) in 81 ms. (487 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (2275 resets) in 54 ms. (727 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (2264 resets) in 71 ms. (555 steps per ms) remains 13/13 properties
[2024-06-01 04:58:27] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 16/67 variables, 6/24 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 3/70 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/70 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (OVERLAPS) 53/123 variables, 70/96 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/123 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Problem AtomicPropp11 is UNSAT
At refinement iteration 8 (OVERLAPS) 17/140 variables, 14/110 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/140 variables, 4/114 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/140 variables, 0/114 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 11 (OVERLAPS) 1/141 variables, 1/115 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/141 variables, 0/115 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 13 (OVERLAPS) 0/141 variables, 0/115 constraints. Problems are: Problem set: 1 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 141/141 variables, and 115 constraints, problems are : Problem set: 1 solved, 12 unsolved in 347 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 85/85 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 18/18 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 0/18 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 16/67 variables, 6/24 constraints. Problems are: Problem set: 1 solved, 12 unsolved
[2024-06-01 04:58:27] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 1 ms to minimize.
[2024-06-01 04:58:27] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 0 ms to minimize.
[2024-06-01 04:58:27] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 3/27 constraints. Problems are: Problem set: 1 solved, 12 unsolved
[2024-06-01 04:58:27] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-06-01 04:58:27] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-06-01 04:58:27] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 0 ms to minimize.
[2024-06-01 04:58:27] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 4/31 constraints. Problems are: Problem set: 1 solved, 12 unsolved
[2024-06-01 04:58:27] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/67 variables, 1/32 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 0/32 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 3/70 variables, 2/34 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/70 variables, 0/34 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 9 (OVERLAPS) 53/123 variables, 70/104 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/123 variables, 7/111 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/123 variables, 0/111 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 12 (OVERLAPS) 17/140 variables, 14/125 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/140 variables, 4/129 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/140 variables, 5/134 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/140 variables, 0/134 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 16 (OVERLAPS) 1/141 variables, 1/135 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/141 variables, 0/135 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 18 (OVERLAPS) 0/141 variables, 0/135 constraints. Problems are: Problem set: 1 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 141/141 variables, and 135 constraints, problems are : Problem set: 1 solved, 12 unsolved in 968 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 85/85 constraints, PredecessorRefiner: 12/13 constraints, Known Traps: 8/8 constraints]
After SMT, in 1330ms problems are : Problem set: 1 solved, 12 unsolved
Fused 12 Parikh solutions to 11 different solutions.
Finished Parikh walk after 29 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=29 )
Parikh walk visited 12 properties in 230 ms.
FORMULA QuasiCertifProtocol-COL-02-LTLCardinality-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
Computed a total of 85 stabilizing places and 56 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 85 transition count 56
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(G(p0))&&F(p1)))'
Support contains 14 out of 85 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 56/56 transitions.
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 76 transition count 56
Applied a total of 9 rules in 2 ms. Remains 76 /85 variables (removed 9) and now considering 56/56 (removed 0) transitions.
// Phase 1: matrix 56 rows 76 cols
[2024-06-01 04:58:29] [INFO ] Computed 22 invariants in 4 ms
[2024-06-01 04:58:29] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-06-01 04:58:29] [INFO ] Invariant cache hit.
[2024-06-01 04:58:29] [INFO ] Implicit Places using invariants and state equation in 57 ms returned [49, 50, 51]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 117 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 73/85 places, 56/56 transitions.
Applied a total of 0 rules in 2 ms. Remains 73 /73 variables (removed 0) and now considering 56/56 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 121 ms. Remains : 73/85 places, 56/56 transitions.
Stuttering acceptance computed with spot in 270 ms :[(NOT p0), true, (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : QuasiCertifProtocol-COL-02-LTLCardinality-01
Product exploration explored 100000 steps with 16423 reset in 219 ms.
Product exploration explored 100000 steps with 16425 reset in 136 ms.
Computed a total of 73 stabilizing places and 56 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 73 transition count 56
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 p1), (X (AND p1 p0)), (X (NOT (AND (NOT p1) p0))), (X p0), (X p1), (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (G p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 195 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[true, (NOT p0)]
RANDOM walk for 40000 steps (6564 resets) in 267 ms. (149 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (2664 resets) in 82 ms. (481 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 122 steps, run visited all 1 properties in 6 ms. (steps per millisecond=20 )
Probabilistic random walk after 122 steps, saw 106 distinct states, run finished after 21 ms. (steps per millisecond=5 ) properties seen :1
Knowledge obtained : [(AND p0 p1), (X (AND p1 p0)), (X (NOT (AND (NOT p1) p0))), (X p0), (X p1), (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (G p1))]
False Knowledge obtained : [(F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 11 factoid took 231 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-COL-02-LTLCardinality-01 FALSE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-02-LTLCardinality-01 finished in 1461 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 85 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 85/85 places, 56/56 transitions.
Graph (complete) has 179 edges and 85 vertex of which 35 are kept as prefixes of interest. Removing 50 places using SCC suffix rule.2 ms
Discarding 50 places :
Also discarding 15 output transitions
Drop transitions (Output transitions of discarded places.) removed 15 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 34 transition count 29
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 33 transition count 28
Applied a total of 14 rules in 17 ms. Remains 33 /85 variables (removed 52) and now considering 28/56 (removed 28) transitions.
// Phase 1: matrix 28 rows 33 cols
[2024-06-01 04:58:30] [INFO ] Computed 6 invariants in 1 ms
[2024-06-01 04:58:30] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-06-01 04:58:30] [INFO ] Invariant cache hit.
[2024-06-01 04:58:30] [INFO ] Implicit Places using invariants and state equation in 38 ms returned [16, 17, 18]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 75 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 30/85 places, 28/56 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 93 ms. Remains : 30/85 places, 28/56 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-02-LTLCardinality-02
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-02-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-02-LTLCardinality-02 finished in 145 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((p0||X((G(p1) U (p0&&G(p1)))))))))'
Support contains 7 out of 85 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 56/56 transitions.
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 76 transition count 56
Applied a total of 9 rules in 4 ms. Remains 76 /85 variables (removed 9) and now considering 56/56 (removed 0) transitions.
// Phase 1: matrix 56 rows 76 cols
[2024-06-01 04:58:30] [INFO ] Computed 22 invariants in 2 ms
[2024-06-01 04:58:30] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-06-01 04:58:30] [INFO ] Invariant cache hit.
[2024-06-01 04:58:30] [INFO ] Implicit Places using invariants and state equation in 63 ms returned [49, 50, 51]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 122 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 73/85 places, 56/56 transitions.
Applied a total of 0 rules in 1 ms. Remains 73 /73 variables (removed 0) and now considering 56/56 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 127 ms. Remains : 73/85 places, 56/56 transitions.
Stuttering acceptance computed with spot in 266 ms :[(NOT p1), (NOT p0), (NOT p0), (NOT p0), true, (NOT p0), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : QuasiCertifProtocol-COL-02-LTLCardinality-03
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-02-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-02-LTLCardinality-03 finished in 414 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 85 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 85/85 places, 56/56 transitions.
Graph (complete) has 179 edges and 85 vertex of which 72 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.0 ms
Discarding 13 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 69 transition count 51
Applied a total of 5 rules in 7 ms. Remains 69 /85 variables (removed 16) and now considering 51/56 (removed 5) transitions.
// Phase 1: matrix 51 rows 69 cols
[2024-06-01 04:58:31] [INFO ] Computed 20 invariants in 3 ms
[2024-06-01 04:58:31] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-06-01 04:58:31] [INFO ] Invariant cache hit.
[2024-06-01 04:58:31] [INFO ] Implicit Places using invariants and state equation in 61 ms returned [40, 41, 42, 46, 47, 48]
Discarding 6 places :
Implicit Place search using SMT with State Equation took 115 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 63/85 places, 51/56 transitions.
Applied a total of 0 rules in 3 ms. Remains 63 /63 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 125 ms. Remains : 63/85 places, 51/56 transitions.
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-02-LTLCardinality-04
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-02-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-02-LTLCardinality-04 finished in 217 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(X((F(p1)&&X((F(p2) U !p0)))))))'
Support contains 13 out of 85 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 56/56 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 80 transition count 56
Applied a total of 5 rules in 6 ms. Remains 80 /85 variables (removed 5) and now considering 56/56 (removed 0) transitions.
// Phase 1: matrix 56 rows 80 cols
[2024-06-01 04:58:31] [INFO ] Computed 26 invariants in 1 ms
[2024-06-01 04:58:31] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-06-01 04:58:31] [INFO ] Invariant cache hit.
[2024-06-01 04:58:31] [INFO ] Implicit Places using invariants and state equation in 63 ms returned [50, 51, 52]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 119 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 77/85 places, 56/56 transitions.
Applied a total of 0 rules in 1 ms. Remains 77 /77 variables (removed 0) and now considering 56/56 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 127 ms. Remains : 77/85 places, 56/56 transitions.
Stuttering acceptance computed with spot in 501 ms :[(AND (NOT p0) (NOT p1)), (OR (NOT p1) p0), (AND (NOT p0) (NOT p1)), (OR (NOT p1) p0), (NOT p1), p0, (NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), false, (AND (NOT p2) (NOT p0))]
Running random walk in product with property : QuasiCertifProtocol-COL-02-LTLCardinality-05
Product exploration explored 100000 steps with 17479 reset in 189 ms.
Product exploration explored 100000 steps with 17470 reset in 134 ms.
Computed a total of 77 stabilizing places and 56 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 77 transition count 56
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 p1 p2), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (G p1)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 379 ms. Reduced automaton from 11 states, 20 edges and 3 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 238 ms :[(NOT p2), false, (AND (NOT p2) (NOT p0)), false, false, false]
RANDOM walk for 40000 steps (6580 resets) in 140 ms. (283 steps per ms) remains 3/5 properties
BEST_FIRST walk for 40003 steps (2222 resets) in 129 ms. (307 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (2242 resets) in 173 ms. (229 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40000 steps (2664 resets) in 147 ms. (270 steps per ms) remains 3/3 properties
// Phase 1: matrix 56 rows 77 cols
[2024-06-01 04:58:33] [INFO ] Computed 23 invariants in 2 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 25/32 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 42/74 variables, 32/39 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 48/122 variables, 39/78 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 16/94 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 11/133 variables, 6/100 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/133 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/133 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 133/133 variables, and 100 constraints, problems are : Problem set: 0 solved, 3 unsolved in 81 ms.
Refiners :[Generalized P Invariants (flows): 23/23 constraints, State Equation: 77/77 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 25/32 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 42/74 variables, 32/39 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/74 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf1 is UNSAT
At refinement iteration 6 (OVERLAPS) 48/122 variables, 39/79 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 16/95 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 1/96 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 0/96 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 11/133 variables, 6/102 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/133 variables, 0/102 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/133 variables, 0/102 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 133/133 variables, and 102 constraints, problems are : Problem set: 1 solved, 2 unsolved in 120 ms.
Refiners :[Generalized P Invariants (flows): 23/23 constraints, State Equation: 77/77 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 215ms problems are : Problem set: 1 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 21 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=10 )
Parikh walk visited 2 properties in 1 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 p2), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (G p1)), (F (OR (G p2) (G (NOT p2)))), (G (OR p2 (NOT p0)))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p2 p0))), (F (NOT p2)), (F (NOT (OR p2 p0)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 10 factoid took 31 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-COL-02-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-02-LTLCardinality-05 finished in 2184 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 3 out of 85 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 85/85 places, 56/56 transitions.
Graph (complete) has 179 edges and 85 vertex of which 72 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.2 ms
Discarding 13 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 69 transition count 51
Applied a total of 5 rules in 14 ms. Remains 69 /85 variables (removed 16) and now considering 51/56 (removed 5) transitions.
// Phase 1: matrix 51 rows 69 cols
[2024-06-01 04:58:33] [INFO ] Computed 20 invariants in 2 ms
[2024-06-01 04:58:33] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-06-01 04:58:33] [INFO ] Invariant cache hit.
[2024-06-01 04:58:33] [INFO ] Implicit Places using invariants and state equation in 75 ms returned [40, 41, 42, 46, 47, 48]
Discarding 6 places :
Implicit Place search using SMT with State Equation took 128 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 63/85 places, 51/56 transitions.
Applied a total of 0 rules in 3 ms. Remains 63 /63 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 145 ms. Remains : 63/85 places, 51/56 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-02-LTLCardinality-06
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-02-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-02-LTLCardinality-06 finished in 245 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 9 out of 85 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 85/85 places, 56/56 transitions.
Graph (complete) has 179 edges and 85 vertex of which 45 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.1 ms
Discarding 40 places :
Also discarding 11 output transitions
Drop transitions (Output transitions of discarded places.) removed 11 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 9 place count 44 transition count 36
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 13 place count 42 transition count 34
Applied a total of 13 rules in 5 ms. Remains 42 /85 variables (removed 43) and now considering 34/56 (removed 22) transitions.
// Phase 1: matrix 34 rows 42 cols
[2024-06-01 04:58:33] [INFO ] Computed 10 invariants in 1 ms
[2024-06-01 04:58:33] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-06-01 04:58:33] [INFO ] Invariant cache hit.
[2024-06-01 04:58:33] [INFO ] Implicit Places using invariants and state equation in 38 ms returned [22, 23, 24, 25, 26, 27]
Discarding 6 places :
Implicit Place search using SMT with State Equation took 72 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 36/85 places, 34/56 transitions.
Applied a total of 0 rules in 2 ms. Remains 36 /36 variables (removed 0) and now considering 34/34 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 79 ms. Remains : 36/85 places, 34/56 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-02-LTLCardinality-07
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-COL-02-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-02-LTLCardinality-07 finished in 124 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)||G(F(p1)))))'
Support contains 10 out of 85 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 85/85 places, 56/56 transitions.
Graph (complete) has 179 edges and 85 vertex of which 73 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.1 ms
Discarding 12 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 72 transition count 53
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 72 transition count 53
Applied a total of 4 rules in 11 ms. Remains 72 /85 variables (removed 13) and now considering 53/56 (removed 3) transitions.
// Phase 1: matrix 53 rows 72 cols
[2024-06-01 04:58:33] [INFO ] Computed 21 invariants in 2 ms
[2024-06-01 04:58:33] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-06-01 04:58:33] [INFO ] Invariant cache hit.
[2024-06-01 04:58:34] [INFO ] Implicit Places using invariants and state equation in 75 ms returned [47, 48, 49]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 135 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 69/85 places, 53/56 transitions.
Applied a total of 0 rules in 3 ms. Remains 69 /69 variables (removed 0) and now considering 53/53 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 149 ms. Remains : 69/85 places, 53/56 transitions.
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : QuasiCertifProtocol-COL-02-LTLCardinality-10
Product exploration explored 100000 steps with 17465 reset in 91 ms.
Product exploration explored 100000 steps with 17515 reset in 133 ms.
Computed a total of 69 stabilizing places and 53 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 69 transition count 53
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 5 factoid took 524 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 76 steps (12 resets) in 6 ms. (10 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F p1), (F (NOT (OR p0 p1))), (F (NOT p0)), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 5 factoid took 838 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 126 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 10 out of 69 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 69/69 places, 53/53 transitions.
Applied a total of 0 rules in 7 ms. Remains 69 /69 variables (removed 0) and now considering 53/53 (removed 0) transitions.
// Phase 1: matrix 53 rows 69 cols
[2024-06-01 04:58:36] [INFO ] Computed 18 invariants in 3 ms
[2024-06-01 04:58:36] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-06-01 04:58:36] [INFO ] Invariant cache hit.
[2024-06-01 04:58:36] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
[2024-06-01 04:58:36] [INFO ] Redundant transitions in 12 ms returned []
Running 49 sub problems to find dead transitions.
[2024-06-01 04:58:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 2 (OVERLAPS) 53/120 variables, 67/85 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 4 (OVERLAPS) 2/122 variables, 2/87 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 6 (OVERLAPS) 0/122 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 87 constraints, problems are : Problem set: 0 solved, 49 unsolved in 716 ms.
Refiners :[Generalized P Invariants (flows): 18/18 constraints, State Equation: 69/69 constraints, PredecessorRefiner: 49/49 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 49 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 2 (OVERLAPS) 53/120 variables, 67/85 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 13/98 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 5 (OVERLAPS) 2/122 variables, 2/100 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 36/136 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 8 (OVERLAPS) 0/122 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 136 constraints, problems are : Problem set: 0 solved, 49 unsolved in 955 ms.
Refiners :[Generalized P Invariants (flows): 18/18 constraints, State Equation: 69/69 constraints, PredecessorRefiner: 49/49 constraints, Known Traps: 0/0 constraints]
After SMT, in 1689ms problems are : Problem set: 0 solved, 49 unsolved
Search for dead transitions found 0 dead transitions in 1690ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1819 ms. Remains : 69/69 places, 53/53 transitions.
Computed a total of 69 stabilizing places and 53 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 69 transition count 53
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 5 factoid took 592 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 137 steps (22 resets) in 5 ms. (22 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F p1), (F (NOT (OR p0 p1))), (F (NOT p0)), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 5 factoid took 730 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 17532 reset in 83 ms.
Product exploration explored 100000 steps with 17477 reset in 88 ms.
Support contains 10 out of 69 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 69/69 places, 53/53 transitions.
Applied a total of 0 rules in 10 ms. Remains 69 /69 variables (removed 0) and now considering 53/53 (removed 0) transitions.
[2024-06-01 04:58:39] [INFO ] Invariant cache hit.
[2024-06-01 04:58:39] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-06-01 04:58:39] [INFO ] Invariant cache hit.
[2024-06-01 04:58:39] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
[2024-06-01 04:58:39] [INFO ] Redundant transitions in 12 ms returned []
Running 49 sub problems to find dead transitions.
[2024-06-01 04:58:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 2 (OVERLAPS) 53/120 variables, 67/85 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 4 (OVERLAPS) 2/122 variables, 2/87 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 6 (OVERLAPS) 0/122 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 87 constraints, problems are : Problem set: 0 solved, 49 unsolved in 696 ms.
Refiners :[Generalized P Invariants (flows): 18/18 constraints, State Equation: 69/69 constraints, PredecessorRefiner: 49/49 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 49 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 2 (OVERLAPS) 53/120 variables, 67/85 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 13/98 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 5 (OVERLAPS) 2/122 variables, 2/100 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 36/136 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 8 (OVERLAPS) 0/122 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 136 constraints, problems are : Problem set: 0 solved, 49 unsolved in 998 ms.
Refiners :[Generalized P Invariants (flows): 18/18 constraints, State Equation: 69/69 constraints, PredecessorRefiner: 49/49 constraints, Known Traps: 0/0 constraints]
After SMT, in 1717ms problems are : Problem set: 0 solved, 49 unsolved
Search for dead transitions found 0 dead transitions in 1718ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1872 ms. Remains : 69/69 places, 53/53 transitions.
Treatment of property QuasiCertifProtocol-COL-02-LTLCardinality-10 finished in 7882 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))))'
Support contains 7 out of 85 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 56/56 transitions.
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 79 transition count 56
Applied a total of 6 rules in 1 ms. Remains 79 /85 variables (removed 6) and now considering 56/56 (removed 0) transitions.
// Phase 1: matrix 56 rows 79 cols
[2024-06-01 04:58:41] [INFO ] Computed 25 invariants in 1 ms
[2024-06-01 04:58:41] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-06-01 04:58:41] [INFO ] Invariant cache hit.
[2024-06-01 04:58:41] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
Running 52 sub problems to find dead transitions.
[2024-06-01 04:58:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (OVERLAPS) 3/78 variables, 7/25 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 4 (OVERLAPS) 56/134 variables, 78/103 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 6 (OVERLAPS) 1/135 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/135 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 8 (OVERLAPS) 0/135 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Real declared 135/135 variables, and 104 constraints, problems are : Problem set: 0 solved, 52 unsolved in 899 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 79/79 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 52 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (OVERLAPS) 3/78 variables, 7/25 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 4 (OVERLAPS) 56/134 variables, 78/103 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 52/155 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/134 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 7 (OVERLAPS) 1/135 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/135 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 9 (OVERLAPS) 0/135 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Int declared 135/135 variables, and 156 constraints, problems are : Problem set: 0 solved, 52 unsolved in 1124 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 79/79 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 0/0 constraints]
After SMT, in 2040ms problems are : Problem set: 0 solved, 52 unsolved
Search for dead transitions found 0 dead transitions in 2041ms
Starting structural reductions in LTL mode, iteration 1 : 79/85 places, 56/56 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2189 ms. Remains : 79/85 places, 56/56 transitions.
Stuttering acceptance computed with spot in 135 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-02-LTLCardinality-11
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-02-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-02-LTLCardinality-11 finished in 2337 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 9 out of 85 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 85/85 places, 56/56 transitions.
Graph (complete) has 179 edges and 85 vertex of which 57 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.1 ms
Discarding 28 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 56 transition count 42
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 10 place count 54 transition count 40
Applied a total of 10 rules in 5 ms. Remains 54 /85 variables (removed 31) and now considering 40/56 (removed 16) transitions.
// Phase 1: matrix 40 rows 54 cols
[2024-06-01 04:58:44] [INFO ] Computed 16 invariants in 0 ms
[2024-06-01 04:58:44] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-06-01 04:58:44] [INFO ] Invariant cache hit.
[2024-06-01 04:58:44] [INFO ] Implicit Places using invariants and state equation in 50 ms returned [31, 32, 33, 34, 35, 36]
Discarding 6 places :
Implicit Place search using SMT with State Equation took 96 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 48/85 places, 40/56 transitions.
Applied a total of 0 rules in 2 ms. Remains 48 /48 variables (removed 0) and now considering 40/40 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 103 ms. Remains : 48/85 places, 40/56 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-02-LTLCardinality-12
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-02-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-02-LTLCardinality-12 finished in 148 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&F((p1&&X(X(F(p2))))))))'
Support contains 15 out of 85 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 56/56 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 82 transition count 56
Applied a total of 3 rules in 2 ms. Remains 82 /85 variables (removed 3) and now considering 56/56 (removed 0) transitions.
// Phase 1: matrix 56 rows 82 cols
[2024-06-01 04:58:44] [INFO ] Computed 28 invariants in 2 ms
[2024-06-01 04:58:44] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-06-01 04:58:44] [INFO ] Invariant cache hit.
[2024-06-01 04:58:44] [INFO ] Implicit Places using invariants and state equation in 70 ms returned [49, 50, 51]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 124 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 79/85 places, 56/56 transitions.
Applied a total of 0 rules in 1 ms. Remains 79 /79 variables (removed 0) and now considering 56/56 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 127 ms. Remains : 79/85 places, 56/56 transitions.
Stuttering acceptance computed with spot in 229 ms :[(NOT p2), (NOT p2), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p2) (NOT p1) (NOT p0)), true]
Running random walk in product with property : QuasiCertifProtocol-COL-02-LTLCardinality-13
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-COL-02-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-02-LTLCardinality-13 finished in 380 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0 U p1)))'
Support contains 12 out of 85 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 85/85 places, 56/56 transitions.
Graph (complete) has 179 edges and 85 vertex of which 75 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.1 ms
Discarding 10 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 72 transition count 51
Applied a total of 5 rules in 5 ms. Remains 72 /85 variables (removed 13) and now considering 51/56 (removed 5) transitions.
// Phase 1: matrix 51 rows 72 cols
[2024-06-01 04:58:44] [INFO ] Computed 23 invariants in 1 ms
[2024-06-01 04:58:44] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-06-01 04:58:44] [INFO ] Invariant cache hit.
[2024-06-01 04:58:44] [INFO ] Implicit Places using invariants and state equation in 67 ms returned [40, 41, 42, 46, 47, 48]
Discarding 6 places :
Implicit Place search using SMT with State Equation took 120 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 66/85 places, 51/56 transitions.
Applied a total of 0 rules in 2 ms. Remains 66 /66 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 127 ms. Remains : 66/85 places, 51/56 transitions.
Stuttering acceptance computed with spot in 115 ms :[(NOT p1), true, (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-COL-02-LTLCardinality-14
Product exploration explored 100000 steps with 18723 reset in 156 ms.
Product exploration explored 100000 steps with 18735 reset in 136 ms.
Computed a total of 66 stabilizing places and 51 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 66 transition count 51
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (OR p1 p0)), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (OR p1 p0))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 214 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 101 ms :[(NOT p1), true, (NOT p1)]
Reduction of identical properties reduced properties to check from 5 to 4
RANDOM walk for 40000 steps (7500 resets) in 154 ms. (258 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (1876 resets) in 116 ms. (341 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (1888 resets) in 107 ms. (370 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (1862 resets) in 69 ms. (571 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (1896 resets) in 78 ms. (506 steps per ms) remains 4/4 properties
Probably explored full state space saw : 455 states, properties seen :3
Probabilistic random walk after 1567 steps, saw 455 distinct states, run finished after 14 ms. (steps per millisecond=111 ) properties seen :3
Explored full state space saw : 455 states, properties seen :0
Exhaustive walk after 1567 steps, saw 455 distinct states, run finished after 3 ms. (steps per millisecond=522 ) properties seen :0
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (OR p1 p0)), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (OR p1 p0))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (G (OR p0 p1)), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p1)), (F p0), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 15 factoid took 501 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 91 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 99 ms :[(NOT p1), (NOT p1)]
Support contains 12 out of 66 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 66/66 places, 51/51 transitions.
Applied a total of 0 rules in 4 ms. Remains 66 /66 variables (removed 0) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 66 cols
[2024-06-01 04:58:46] [INFO ] Computed 18 invariants in 2 ms
[2024-06-01 04:58:46] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-06-01 04:58:46] [INFO ] Invariant cache hit.
[2024-06-01 04:58:46] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
[2024-06-01 04:58:46] [INFO ] Redundant transitions in 14 ms returned []
Running 44 sub problems to find dead transitions.
[2024-06-01 04:58:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (OVERLAPS) 3/63 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (OVERLAPS) 51/114 variables, 63/81 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/114 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (OVERLAPS) 3/117 variables, 3/84 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/117 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 8 (OVERLAPS) 0/117 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Real declared 117/117 variables, and 84 constraints, problems are : Problem set: 0 solved, 44 unsolved in 632 ms.
Refiners :[Generalized P Invariants (flows): 18/18 constraints, State Equation: 66/66 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 44 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (OVERLAPS) 3/63 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (OVERLAPS) 51/114 variables, 63/81 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/114 variables, 44/125 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/114 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (OVERLAPS) 3/117 variables, 3/128 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/117 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 9 (OVERLAPS) 0/117 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Int declared 117/117 variables, and 128 constraints, problems are : Problem set: 0 solved, 44 unsolved in 798 ms.
Refiners :[Generalized P Invariants (flows): 18/18 constraints, State Equation: 66/66 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 0/0 constraints]
After SMT, in 1447ms problems are : Problem set: 0 solved, 44 unsolved
Search for dead transitions found 0 dead transitions in 1448ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1579 ms. Remains : 66/66 places, 51/51 transitions.
Computed a total of 66 stabilizing places and 51 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 66 transition count 51
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 : [p1, (X p1), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 178 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 40000 steps (7496 resets) in 51 ms. (769 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (1873 resets) in 20 ms. (1904 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 174 steps, run visited all 1 properties in 3 ms. (steps per millisecond=58 )
Probabilistic random walk after 174 steps, saw 151 distinct states, run finished after 3 ms. (steps per millisecond=58 ) properties seen :1
Knowledge obtained : [p1, (X p1), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 4 factoid took 134 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 88 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 77 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 86 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 18725 reset in 87 ms.
Product exploration explored 100000 steps with 18740 reset in 93 ms.
Support contains 12 out of 66 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 66/66 places, 51/51 transitions.
Applied a total of 0 rules in 1 ms. Remains 66 /66 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2024-06-01 04:58:48] [INFO ] Invariant cache hit.
[2024-06-01 04:58:49] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-06-01 04:58:49] [INFO ] Invariant cache hit.
[2024-06-01 04:58:49] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
[2024-06-01 04:58:49] [INFO ] Redundant transitions in 13 ms returned []
Running 44 sub problems to find dead transitions.
[2024-06-01 04:58:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (OVERLAPS) 3/63 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (OVERLAPS) 51/114 variables, 63/81 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/114 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (OVERLAPS) 3/117 variables, 3/84 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/117 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 8 (OVERLAPS) 0/117 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Real declared 117/117 variables, and 84 constraints, problems are : Problem set: 0 solved, 44 unsolved in 603 ms.
Refiners :[Generalized P Invariants (flows): 18/18 constraints, State Equation: 66/66 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 44 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (OVERLAPS) 3/63 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (OVERLAPS) 51/114 variables, 63/81 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/114 variables, 44/125 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/114 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (OVERLAPS) 3/117 variables, 3/128 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/117 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 9 (OVERLAPS) 0/117 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Int declared 117/117 variables, and 128 constraints, problems are : Problem set: 0 solved, 44 unsolved in 857 ms.
Refiners :[Generalized P Invariants (flows): 18/18 constraints, State Equation: 66/66 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 0/0 constraints]
After SMT, in 1473ms problems are : Problem set: 0 solved, 44 unsolved
Search for dead transitions found 0 dead transitions in 1474ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1601 ms. Remains : 66/66 places, 51/51 transitions.
Treatment of property QuasiCertifProtocol-COL-02-LTLCardinality-14 finished in 5958 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)||G(F(p1)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0 U p1)))'
[2024-06-01 04:58:50] [INFO ] Flatten gal took : 12 ms
[2024-06-01 04:58:50] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-06-01 04:58:50] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 85 places, 56 transitions and 218 arcs took 3 ms.
Total runtime 30529 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA QuasiCertifProtocol-COL-02-LTLCardinality-10 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA QuasiCertifProtocol-COL-02-LTLCardinality-14 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717217931542

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2024
ltl formula name QuasiCertifProtocol-COL-02-LTLCardinality-10
ltl formula formula --ltl=/tmp/1342/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 85 places, 56 transitions and 218 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.010 real 0.000 user 0.000 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1342/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1342/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1342/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1342/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): There are 77 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 86, there are 64 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 2054
pnml2lts-mc( 0/ 4): unique states count: 2054
pnml2lts-mc( 0/ 4): unique transitions count: 5395
pnml2lts-mc( 0/ 4): - self-loop count: 64
pnml2lts-mc( 0/ 4): - claim dead count: 3798
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 2475
pnml2lts-mc( 0/ 4): - cum. max stack depth: 124
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 2475 states 7714 transitions, fanout: 3.117
pnml2lts-mc( 0/ 4): Total exploration time 0.020 sec (0.020 sec minimum, 0.020 sec on average)
pnml2lts-mc( 0/ 4): States per second: 123750, Transitions per second: 385700
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 18.4 B/state, compr.: 5.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 56 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name QuasiCertifProtocol-COL-02-LTLCardinality-14
ltl formula formula --ltl=/tmp/1342/ltl_1_
Warning: program compiled against libxml 210 using older 209
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
pnml2lts-mc( 0/ 4): Petri net has 85 places, 56 transitions and 218 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1342/ltl_1_
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1342/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1342/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1342/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 78 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 86, there are 63 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~32!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 612
pnml2lts-mc( 0/ 4): unique states count: 689
pnml2lts-mc( 0/ 4): unique transitions count: 1674
pnml2lts-mc( 0/ 4): - self-loop count: 49
pnml2lts-mc( 0/ 4): - claim dead count: 778
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 781
pnml2lts-mc( 0/ 4): - cum. max stack depth: 125
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 781 states 1992 transitions, fanout: 2.551
pnml2lts-mc( 0/ 4): Total exploration time 0.010 sec (0.010 sec minimum, 0.010 sec on average)
pnml2lts-mc( 0/ 4): States per second: 78100, Transitions per second: 199200
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 22.7 B/state, compr.: 6.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 56 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)

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-02"
export BK_EXAMINATION="LTLCardinality"
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-02, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r520-tall-171662337600003"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/QuasiCertifProtocol-COL-02.tgz
mv QuasiCertifProtocol-COL-02 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;