Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r311-tall-171662335800052.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is QuasiCertifProtocol-COL-32, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r311-tall-171662335800052
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 620K
-rw-r--r-- 1 mcc users 6.5K Apr 13 04:08 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Apr 13 04:08 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Apr 13 03:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Apr 13 03:47 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.6K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 13 04:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 165K Apr 13 04:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Apr 13 04:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Apr 13 04:13 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 131K 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-32-LTLFireability-00
FORMULA_NAME QuasiCertifProtocol-COL-32-LTLFireability-01
FORMULA_NAME QuasiCertifProtocol-COL-32-LTLFireability-02
FORMULA_NAME QuasiCertifProtocol-COL-32-LTLFireability-03
FORMULA_NAME QuasiCertifProtocol-COL-32-LTLFireability-04
FORMULA_NAME QuasiCertifProtocol-COL-32-LTLFireability-05
FORMULA_NAME QuasiCertifProtocol-COL-32-LTLFireability-06
FORMULA_NAME QuasiCertifProtocol-COL-32-LTLFireability-07
FORMULA_NAME QuasiCertifProtocol-COL-32-LTLFireability-08
FORMULA_NAME QuasiCertifProtocol-COL-32-LTLFireability-09
FORMULA_NAME QuasiCertifProtocol-COL-32-LTLFireability-10
FORMULA_NAME QuasiCertifProtocol-COL-32-LTLFireability-11
FORMULA_NAME QuasiCertifProtocol-COL-32-LTLFireability-12
FORMULA_NAME QuasiCertifProtocol-COL-32-LTLFireability-13
FORMULA_NAME QuasiCertifProtocol-COL-32-LTLFireability-14
FORMULA_NAME QuasiCertifProtocol-COL-32-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716654568020

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-COL-32
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-25 16:29:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-25 16:29:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 16:29:29] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-25 16:29:29] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-25 16:29:29] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 590 ms
[2024-05-25 16:29:29] [INFO ] Imported 30 HL places and 26 HL transitions for a total of 3806 PT places and 506.0 transition bindings in 20 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2024-05-25 16:29:30] [INFO ] Built PT skeleton of HLPN with 30 places and 26 transitions 77 arcs in 4 ms.
[2024-05-25 16:29:30] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 2 formulas.
FORMULA QuasiCertifProtocol-COL-32-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-32-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 30 stabilizing places and 26 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 30 transition count 26
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Remains 12 properties that can be checked using skeleton over-approximation.
Computed a total of 30 stabilizing places and 26 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 30 transition count 26
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Reduction of identical properties reduced properties to check from 19 to 16
RANDOM walk for 40053 steps (912 resets) in 489 ms. (81 steps per ms) remains 5/16 properties
BEST_FIRST walk for 40003 steps (242 resets) in 286 ms. (139 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (240 resets) in 174 ms. (228 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (241 resets) in 145 ms. (273 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (242 resets) in 94 ms. (421 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (241 resets) in 134 ms. (296 steps per ms) remains 5/5 properties
// Phase 1: matrix 26 rows 30 cols
[2024-05-25 16:29:30] [INFO ] Computed 5 invariants in 11 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 16/22 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 26/48 variables, 22/27 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem AtomicPropp18 is UNSAT
At refinement iteration 5 (OVERLAPS) 8/56 variables, 8/35 constraints. Problems are: Problem set: 1 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/56 variables, 0/35 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/56 variables, 0/35 constraints. Problems are: Problem set: 1 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 56/56 variables, and 35 constraints, problems are : Problem set: 1 solved, 4 unsolved in 389 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 9/14 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 15/29 variables, 14/18 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 1/19 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/29 variables, 0/19 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 14/43 variables, 8/27 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/43 variables, 3/30 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/43 variables, 0/30 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 12/55 variables, 7/37 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/55 variables, 0/37 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 1/56 variables, 1/38 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/56 variables, 1/39 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/56 variables, 0/39 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/56 variables, 0/39 constraints. Problems are: Problem set: 1 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 56/56 variables, and 39 constraints, problems are : Problem set: 1 solved, 4 unsolved in 176 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 4/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 616ms problems are : Problem set: 1 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Finished Parikh walk after 83 steps, including 0 resets, run visited all 4 properties in 4 ms. (steps per millisecond=20 )
Parikh walk visited 4 properties in 10 ms.
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
[2024-05-25 16:29:31] [INFO ] Flatten gal took : 18 ms
[2024-05-25 16:29:31] [INFO ] Flatten gal took : 6 ms
Domain [tsid(33), tsid(33)] of place n9 breaks symmetries in sort tsid
[2024-05-25 16:29:31] [INFO ] Unfolded HLPN to a Petri net with 3806 places and 506 transitions 8173 arcs in 37 ms.
[2024-05-25 16:29:31] [INFO ] Unfolded 14 HLPN properties in 0 ms.
Support contains 2580 out of 3806 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3806/3806 places, 506/506 transitions.
Reduce places removed 70 places and 0 transitions.
Iterating post reduction 0 with 70 rules applied. Total rules applied 70 place count 3736 transition count 506
Applied a total of 70 rules in 160 ms. Remains 3736 /3806 variables (removed 70) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3736 cols
[2024-05-25 16:29:31] [INFO ] Computed 3232 invariants in 214 ms
[2024-05-25 16:29:34] [INFO ] Implicit Places using invariants in 2569 ms returned []
[2024-05-25 16:29:34] [INFO ] Invariant cache hit.
[2024-05-25 16:29:37] [INFO ] Implicit Places using invariants and state equation in 3605 ms returned []
Implicit Place search using SMT with State Equation took 6190 ms to find 0 implicit places.
Running 472 sub problems to find dead transitions.
[2024-05-25 16:29:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3735 variables, 3232/3232 constraints. Problems are: Problem set: 0 solved, 472 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3735/4242 variables, and 3232 constraints, problems are : Problem set: 0 solved, 472 unsolved in 30043 ms.
Refiners :[Generalized P Invariants (flows): 3232/3232 constraints, State Equation: 0/3736 constraints, PredecessorRefiner: 472/472 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 472 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3735 variables, 3232/3232 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3735 variables, 0/3232 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 2 (OVERLAPS) 506/4241 variables, 3735/6967 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/4241 variables, 472/7439 constraints. Problems are: Problem set: 0 solved, 472 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4241/4242 variables, and 7439 constraints, problems are : Problem set: 0 solved, 472 unsolved in 30029 ms.
Refiners :[Generalized P Invariants (flows): 3232/3232 constraints, State Equation: 3735/3736 constraints, PredecessorRefiner: 472/472 constraints, Known Traps: 0/0 constraints]
After SMT, in 61168ms problems are : Problem set: 0 solved, 472 unsolved
Search for dead transitions found 0 dead transitions in 61181ms
Starting structural reductions in LTL mode, iteration 1 : 3736/3806 places, 506/506 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 67550 ms. Remains : 3736/3806 places, 506/506 transitions.
Support contains 2580 out of 3736 places after structural reductions.
[2024-05-25 16:30:39] [INFO ] Flatten gal took : 255 ms
[2024-05-25 16:30:39] [INFO ] Flatten gal took : 174 ms
[2024-05-25 16:30:39] [INFO ] Input system was already deterministic with 506 transitions.
Reduction of identical properties reduced properties to check from 19 to 18
RANDOM walk for 40000 steps (1070 resets) in 1387 ms. (28 steps per ms) remains 14/18 properties
BEST_FIRST walk for 40004 steps (43 resets) in 193 ms. (206 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (36 resets) in 404 ms. (98 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (37 resets) in 244 ms. (163 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (35 resets) in 225 ms. (177 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (47 resets) in 1297 ms. (30 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (40 resets) in 245 ms. (162 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (44 resets) in 115 ms. (344 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (49 resets) in 170 ms. (233 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (41 resets) in 1081 ms. (36 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (34 resets) in 167 ms. (238 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (43 resets) in 578 ms. (69 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (42 resets) in 119 ms. (333 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (37 resets) in 160 ms. (248 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (36 resets) in 198 ms. (201 steps per ms) remains 14/14 properties
[2024-05-25 16:30:42] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2512 variables, 2144/2144 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2512 variables, 0/2144 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (OVERLAPS) 33/2545 variables, 32/2176 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2545 variables, 0/2176 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (OVERLAPS) 503/3048 variables, 2545/4721 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3048 variables, 0/4721 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (OVERLAPS) 1193/4241 variables, 1190/5911 constraints. Problems are: Problem set: 0 solved, 14 unsolved
SMT process timed out in 5335ms, After SMT, problems are : Problem set: 0 solved, 14 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2512 out of 3736 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Graph (complete) has 42047 edges and 3736 vertex of which 3702 are kept as prefixes of interest. Removing 34 places using SCC suffix rule.21 ms
Discarding 34 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 3702 transition count 503
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 3701 transition count 502
Applied a total of 3 rules in 254 ms. Remains 3701 /3736 variables (removed 35) and now considering 502/506 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 255 ms. Remains : 3701/3736 places, 502/506 transitions.
RANDOM walk for 40000 steps (1006 resets) in 1339 ms. (29 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (25 resets) in 98 ms. (404 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (24 resets) in 164 ms. (242 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (24 resets) in 192 ms. (207 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (24 resets) in 156 ms. (254 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (25 resets) in 1165 ms. (34 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (25 resets) in 181 ms. (219 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (24 resets) in 98 ms. (404 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (25 resets) in 120 ms. (330 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (24 resets) in 1182 ms. (33 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (24 resets) in 174 ms. (228 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (25 resets) in 273 ms. (145 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (25 resets) in 102 ms. (388 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (24 resets) in 174 ms. (228 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (24 resets) in 177 ms. (224 steps per ms) remains 14/14 properties
Interrupted probabilistic random walk after 413957 steps, run timeout after 3001 ms. (steps per millisecond=137 ) properties seen :12 out of 14
Probabilistic random walk after 413957 steps, saw 75520 distinct states, run finished after 3004 ms. (steps per millisecond=137 ) properties seen :12
// Phase 1: matrix 502 rows 3701 cols
[2024-05-25 16:30:52] [INFO ] Computed 3201 invariants in 101 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 33/135 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 369/504 variables, 135/167 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/504 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp18 is UNSAT
At refinement iteration 5 (OVERLAPS) 3699/4203 variables, 3566/3733 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/4203 variables, 3169/6902 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4203 variables, 0/6902 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/4203 variables, 0/6902 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4203/4203 variables, and 6902 constraints, problems are : Problem set: 1 solved, 1 unsolved in 1954 ms.
Refiners :[Generalized P Invariants (flows): 3201/3201 constraints, State Equation: 3701/3701 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 33/101 variables, 32/32 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/32 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 301/402 variables, 101/133 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/402 variables, 0/133 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 500/902 variables, 299/432 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/902 variables, 1/433 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/902 variables, 0/433 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/903 variables, 33/466 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/903 variables, 1/467 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/903 variables, 0/467 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 3300/4203 variables, 3300/3767 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4203 variables, 3136/6903 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4203 variables, 0/6903 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/4203 variables, 0/6903 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4203/4203 variables, and 6903 constraints, problems are : Problem set: 1 solved, 1 unsolved in 2533 ms.
Refiners :[Generalized P Invariants (flows): 3201/3201 constraints, State Equation: 3701/3701 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 4703ms problems are : Problem set: 1 solved, 1 unsolved
Finished Parikh walk after 68 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=22 )
Parikh walk visited 1 properties in 3 ms.
FORMULA QuasiCertifProtocol-COL-32-LTLFireability-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
Computed a total of 3736 stabilizing places and 506 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3736 transition count 506
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' '!(G((F(p0)&&F(G((p1||F(p2)))))))'
Support contains 68 out of 3736 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Graph (complete) has 42047 edges and 3736 vertex of which 3702 are kept as prefixes of interest. Removing 34 places using SCC suffix rule.30 ms
Discarding 34 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 3700 transition count 502
Applied a total of 3 rules in 583 ms. Remains 3700 /3736 variables (removed 36) and now considering 502/506 (removed 4) transitions.
// Phase 1: matrix 502 rows 3700 cols
[2024-05-25 16:30:58] [INFO ] Computed 3200 invariants in 67 ms
[2024-05-25 16:31:03] [INFO ] Implicit Places using invariants in 5585 ms returned []
[2024-05-25 16:31:03] [INFO ] Invariant cache hit.
[2024-05-25 16:31:12] [INFO ] Implicit Places using invariants and state equation in 9284 ms returned [3400, 3401, 3402, 3403, 3404, 3405, 3406, 3407, 3408, 3409, 3410, 3411, 3412, 3413, 3414, 3415, 3416, 3417, 3418, 3419, 3420, 3421, 3422, 3423, 3424, 3425, 3426, 3427, 3428, 3429, 3430, 3431, 3432, 3466, 3467, 3468, 3469, 3470, 3471, 3472, 3473, 3474, 3475, 3476, 3477, 3478, 3479, 3480, 3481, 3482, 3483, 3484, 3485, 3486, 3487, 3488, 3489, 3490, 3491, 3492, 3493, 3494, 3495, 3496, 3497, 3498]
Discarding 66 places :
Implicit Place search using SMT with State Equation took 14876 ms to find 66 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 3634/3736 places, 502/506 transitions.
Applied a total of 0 rules in 242 ms. Remains 3634 /3634 variables (removed 0) and now considering 502/502 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 15704 ms. Remains : 3634/3736 places, 502/506 transitions.
Stuttering acceptance computed with spot in 224 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : QuasiCertifProtocol-COL-32-LTLFireability-00
Product exploration explored 100000 steps with 2467 reset in 690 ms.
Product exploration explored 100000 steps with 2462 reset in 620 ms.
Computed a total of 3634 stabilizing places and 502 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3634 transition count 502
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 p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X p0), (X (NOT (AND p1 (NOT p2)))), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p0)), (X (X (NOT (AND p1 (NOT p2))))), (X (X p1)), (F (G p0)), (F (G p1)), (F (G p2))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 14 factoid took 29 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-COL-32-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-32-LTLFireability-00 finished in 17987 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((!p0&&F(p1))) U X((F(p2) U (p3 U p1)))))'
Support contains 1222 out of 3736 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Applied a total of 0 rules in 106 ms. Remains 3736 /3736 variables (removed 0) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3736 cols
[2024-05-25 16:31:15] [INFO ] Computed 3232 invariants in 74 ms
[2024-05-25 16:31:18] [INFO ] Implicit Places using invariants in 3490 ms returned []
[2024-05-25 16:31:19] [INFO ] Invariant cache hit.
[2024-05-25 16:31:24] [INFO ] Implicit Places using invariants and state equation in 5070 ms returned [3499, 3500, 3501, 3502, 3503, 3504, 3505, 3506, 3507, 3508, 3509, 3510, 3511, 3512, 3513, 3514, 3515, 3516, 3517, 3518, 3519, 3520, 3521, 3522, 3523, 3524, 3525, 3526, 3527, 3528, 3529, 3530, 3531]
Discarding 33 places :
Implicit Place search using SMT with State Equation took 8577 ms to find 33 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3703/3736 places, 506/506 transitions.
Applied a total of 0 rules in 108 ms. Remains 3703 /3703 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 8793 ms. Remains : 3703/3736 places, 506/506 transitions.
Stuttering acceptance computed with spot in 258 ms :[(NOT p1), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (NOT p1), (NOT p1), (OR (NOT p1) (AND p0 (NOT p2)))]
Running random walk in product with property : QuasiCertifProtocol-COL-32-LTLFireability-01
Stuttering criterion allowed to conclude after 37 steps with 0 reset in 3 ms.
FORMULA QuasiCertifProtocol-COL-32-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-32-LTLFireability-01 finished in 9098 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U G((!p1&&X(!p1)))))'
Support contains 35 out of 3736 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Graph (complete) has 42047 edges and 3736 vertex of which 3702 are kept as prefixes of interest. Removing 34 places using SCC suffix rule.18 ms
Discarding 34 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 3700 transition count 502
Applied a total of 3 rules in 459 ms. Remains 3700 /3736 variables (removed 36) and now considering 502/506 (removed 4) transitions.
// Phase 1: matrix 502 rows 3700 cols
[2024-05-25 16:31:25] [INFO ] Computed 3200 invariants in 61 ms
[2024-05-25 16:31:31] [INFO ] Implicit Places using invariants in 6292 ms returned []
[2024-05-25 16:31:31] [INFO ] Invariant cache hit.
[2024-05-25 16:31:43] [INFO ] Implicit Places using invariants and state equation in 11777 ms returned [3400, 3401, 3402, 3403, 3404, 3405, 3406, 3407, 3408, 3409, 3410, 3411, 3412, 3413, 3414, 3415, 3416, 3417, 3418, 3419, 3420, 3421, 3422, 3423, 3424, 3425, 3426, 3427, 3428, 3429, 3430, 3431, 3432, 3466, 3467, 3468, 3469, 3470, 3471, 3472, 3473, 3474, 3475, 3476, 3477, 3478, 3479, 3480, 3481, 3482, 3483, 3484, 3485, 3486, 3487, 3488, 3489, 3490, 3491, 3492, 3493, 3494, 3495, 3496, 3497, 3498]
Discarding 66 places :
Implicit Place search using SMT with State Equation took 18075 ms to find 66 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 3634/3736 places, 502/506 transitions.
Applied a total of 0 rules in 232 ms. Remains 3634 /3634 variables (removed 0) and now considering 502/502 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 18767 ms. Remains : 3634/3736 places, 502/506 transitions.
Stuttering acceptance computed with spot in 106 ms :[p1, true, p1, p1]
Running random walk in product with property : QuasiCertifProtocol-COL-32-LTLFireability-02
Product exploration explored 100000 steps with 2462 reset in 752 ms.
Product exploration explored 100000 steps with 2463 reset in 730 ms.
Computed a total of 3634 stabilizing places and 502 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3634 transition count 502
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 272 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[true, p1]
RANDOM walk for 40000 steps (984 resets) in 306 ms. (130 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (24 resets) in 716 ms. (55 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 3673 steps, run visited all 1 properties in 20 ms. (steps per millisecond=183 )
Probabilistic random walk after 3673 steps, saw 3605 distinct states, run finished after 24 ms. (steps per millisecond=153 ) properties seen :1
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p1)]
Property proved to be false thanks to negative knowledge :(F p1)
Knowledge based reduction with 15 factoid took 251 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-32-LTLFireability-02 FALSE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-32-LTLFireability-02 finished in 21862 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((X(G(p0))||(G(p1) U !p2))))))'
Support contains 3 out of 3736 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Applied a total of 0 rules in 203 ms. Remains 3736 /3736 variables (removed 0) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3736 cols
[2024-05-25 16:31:46] [INFO ] Computed 3232 invariants in 69 ms
[2024-05-25 16:31:52] [INFO ] Implicit Places using invariants in 6116 ms returned []
[2024-05-25 16:31:52] [INFO ] Invariant cache hit.
[2024-05-25 16:32:06] [INFO ] Implicit Places using invariants and state equation in 13509 ms returned [3499, 3500, 3501, 3502, 3503, 3504, 3505, 3506, 3507, 3508, 3509, 3510, 3511, 3512, 3513, 3514, 3515, 3516, 3517, 3518, 3519, 3520, 3521, 3522, 3523, 3524, 3525, 3526, 3527, 3528, 3529, 3530, 3531]
Discarding 33 places :
Implicit Place search using SMT with State Equation took 19630 ms to find 33 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3703/3736 places, 506/506 transitions.
Applied a total of 0 rules in 197 ms. Remains 3703 /3703 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 20030 ms. Remains : 3703/3736 places, 506/506 transitions.
Stuttering acceptance computed with spot in 375 ms :[true, (OR (NOT p1) p2), (AND (NOT p0) p2), (NOT p0), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (NOT p1), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2)]
Running random walk in product with property : QuasiCertifProtocol-COL-32-LTLFireability-03
Entered a terminal (fully accepting) state of product in 20 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-32-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-32-LTLFireability-03 finished in 20439 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&F(p1)))))'
Support contains 101 out of 3736 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Applied a total of 0 rules in 213 ms. Remains 3736 /3736 variables (removed 0) and now considering 506/506 (removed 0) transitions.
[2024-05-25 16:32:06] [INFO ] Invariant cache hit.
[2024-05-25 16:32:13] [INFO ] Implicit Places using invariants in 6072 ms returned []
[2024-05-25 16:32:13] [INFO ] Invariant cache hit.
[2024-05-25 16:32:23] [INFO ] Implicit Places using invariants and state equation in 10151 ms returned [3499, 3500, 3501, 3502, 3503, 3504, 3505, 3506, 3507, 3508, 3509, 3510, 3511, 3512, 3513, 3514, 3515, 3516, 3517, 3518, 3519, 3520, 3521, 3522, 3523, 3524, 3525, 3526, 3527, 3528, 3529, 3530, 3531]
Discarding 33 places :
Implicit Place search using SMT with State Equation took 16228 ms to find 33 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3703/3736 places, 506/506 transitions.
Applied a total of 0 rules in 199 ms. Remains 3703 /3703 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 16641 ms. Remains : 3703/3736 places, 506/506 transitions.
Stuttering acceptance computed with spot in 92 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : QuasiCertifProtocol-COL-32-LTLFireability-04
Stuttering criterion allowed to conclude after 35 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-32-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-32-LTLFireability-04 finished in 16753 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((!p0&&G(((!p1 U p2) U !p0)))))'
Support contains 69 out of 3736 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Graph (complete) has 42047 edges and 3736 vertex of which 3702 are kept as prefixes of interest. Removing 34 places using SCC suffix rule.15 ms
Discarding 34 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 3700 transition count 502
Applied a total of 3 rules in 438 ms. Remains 3700 /3736 variables (removed 36) and now considering 502/506 (removed 4) transitions.
// Phase 1: matrix 502 rows 3700 cols
[2024-05-25 16:32:24] [INFO ] Computed 3200 invariants in 63 ms
[2024-05-25 16:32:29] [INFO ] Implicit Places using invariants in 5768 ms returned []
[2024-05-25 16:32:29] [INFO ] Invariant cache hit.
[2024-05-25 16:32:39] [INFO ] Implicit Places using invariants and state equation in 9376 ms returned [3400, 3401, 3402, 3403, 3404, 3405, 3406, 3407, 3408, 3409, 3410, 3411, 3412, 3413, 3414, 3415, 3416, 3417, 3418, 3419, 3420, 3421, 3422, 3423, 3424, 3425, 3426, 3427, 3428, 3429, 3430, 3431, 3432, 3466, 3467, 3468, 3469, 3470, 3471, 3472, 3473, 3474, 3475, 3476, 3477, 3478, 3479, 3480, 3481, 3482, 3483, 3484, 3485, 3486, 3487, 3488, 3489, 3490, 3491, 3492, 3493, 3494, 3495, 3496, 3497, 3498]
Discarding 66 places :
Implicit Place search using SMT with State Equation took 15150 ms to find 66 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 3634/3736 places, 502/506 transitions.
Applied a total of 0 rules in 235 ms. Remains 3634 /3634 variables (removed 0) and now considering 502/502 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 15824 ms. Remains : 3634/3736 places, 502/506 transitions.
Stuttering acceptance computed with spot in 159 ms :[p0, p0, (AND p0 (NOT p2)), p0]
Running random walk in product with property : QuasiCertifProtocol-COL-32-LTLFireability-06
Product exploration explored 100000 steps with 2464 reset in 357 ms.
Product exploration explored 100000 steps with 2461 reset in 381 ms.
Computed a total of 3634 stabilizing places and 502 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3634 transition count 502
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT p2)), (X (OR (NOT p0) p2 (NOT p1))), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (OR (AND p0 p2) (AND p0 (NOT p1))))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT p2))), (X (X (OR (NOT p0) p2 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (OR (AND p0 p2) (AND p0 (NOT p1)))))), (X (X (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (F (G (NOT p0))), (F (G (NOT p2))), (F (G p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 20 factoid took 25 ms. Reduced automaton from 4 states, 13 edges and 3 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-COL-32-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-32-LTLFireability-06 finished in 17357 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 1122 out of 3736 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Graph (complete) has 42047 edges and 3736 vertex of which 1425 are kept as prefixes of interest. Removing 2311 places using SCC suffix rule.9 ms
Discarding 2311 places :
Also discarding 101 output transitions
Drop transitions (Output transitions of discarded places.) removed 101 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 98 transitions.
Iterating post reduction 0 with 98 rules applied. Total rules applied 99 place count 1424 transition count 306
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 103 place count 1422 transition count 304
Applied a total of 103 rules in 55 ms. Remains 1422 /3736 variables (removed 2314) and now considering 304/506 (removed 202) transitions.
// Phase 1: matrix 304 rows 1422 cols
[2024-05-25 16:32:40] [INFO ] Computed 1120 invariants in 13 ms
[2024-05-25 16:32:41] [INFO ] Implicit Places using invariants in 481 ms returned []
[2024-05-25 16:32:41] [INFO ] Invariant cache hit.
[2024-05-25 16:32:42] [INFO ] Implicit Places using invariants and state equation in 833 ms returned [1222, 1223, 1224, 1225, 1226, 1227, 1228, 1229, 1230, 1231, 1232, 1233, 1234, 1235, 1236, 1237, 1238, 1239, 1240, 1241, 1242, 1243, 1244, 1245, 1246, 1247, 1248, 1249, 1250, 1251, 1252, 1253, 1254]
Discarding 33 places :
Implicit Place search using SMT with State Equation took 1316 ms to find 33 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1389/3736 places, 304/506 transitions.
Applied a total of 0 rules in 10 ms. Remains 1389 /1389 variables (removed 0) and now considering 304/304 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1381 ms. Remains : 1389/3736 places, 304/506 transitions.
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-32-LTLFireability-07
Stuttering criterion allowed to conclude after 45 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-32-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-32-LTLFireability-07 finished in 1466 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(!p0))&&F(!p1)))'
Support contains 2 out of 3736 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Applied a total of 0 rules in 208 ms. Remains 3736 /3736 variables (removed 0) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3736 cols
[2024-05-25 16:32:42] [INFO ] Computed 3232 invariants in 64 ms
[2024-05-25 16:32:48] [INFO ] Implicit Places using invariants in 6027 ms returned []
[2024-05-25 16:32:48] [INFO ] Invariant cache hit.
[2024-05-25 16:33:01] [INFO ] Implicit Places using invariants and state equation in 13329 ms returned [3499, 3500, 3501, 3502, 3503, 3504, 3505, 3506, 3507, 3508, 3509, 3510, 3511, 3512, 3513, 3514, 3515, 3516, 3517, 3518, 3519, 3520, 3521, 3522, 3523, 3524, 3525, 3526, 3527, 3528, 3529, 3530, 3531]
Discarding 33 places :
Implicit Place search using SMT with State Equation took 19362 ms to find 33 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3703/3736 places, 506/506 transitions.
Applied a total of 0 rules in 203 ms. Remains 3703 /3703 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 19775 ms. Remains : 3703/3736 places, 506/506 transitions.
Stuttering acceptance computed with spot in 122 ms :[p0, true, (OR p0 p1), (OR p1 p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-32-LTLFireability-08
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-32-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-32-LTLFireability-08 finished in 19933 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(!p0)))'
Support contains 34 out of 3736 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Applied a total of 0 rules in 208 ms. Remains 3736 /3736 variables (removed 0) and now considering 506/506 (removed 0) transitions.
[2024-05-25 16:33:02] [INFO ] Invariant cache hit.
[2024-05-25 16:33:08] [INFO ] Implicit Places using invariants in 6039 ms returned []
[2024-05-25 16:33:08] [INFO ] Invariant cache hit.
[2024-05-25 16:33:17] [INFO ] Implicit Places using invariants and state equation in 9211 ms returned [3499, 3500, 3501, 3502, 3503, 3504, 3505, 3506, 3507, 3508, 3509, 3510, 3511, 3512, 3513, 3514, 3515, 3516, 3517, 3518, 3519, 3520, 3521, 3522, 3523, 3524, 3525, 3526, 3527, 3528, 3529, 3530, 3531]
Discarding 33 places :
Implicit Place search using SMT with State Equation took 15263 ms to find 33 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3703/3736 places, 506/506 transitions.
Applied a total of 0 rules in 203 ms. Remains 3703 /3703 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 15675 ms. Remains : 3703/3736 places, 506/506 transitions.
Stuttering acceptance computed with spot in 61 ms :[p0, p0]
Running random walk in product with property : QuasiCertifProtocol-COL-32-LTLFireability-09
Stuttering criterion allowed to conclude after 35 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-32-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-32-LTLFireability-09 finished in 15749 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((G(p1)||(X(p1)&&p2))))))'
Support contains 166 out of 3736 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Applied a total of 0 rules in 187 ms. Remains 3736 /3736 variables (removed 0) and now considering 506/506 (removed 0) transitions.
[2024-05-25 16:33:18] [INFO ] Invariant cache hit.
[2024-05-25 16:33:23] [INFO ] Implicit Places using invariants in 5665 ms returned []
[2024-05-25 16:33:23] [INFO ] Invariant cache hit.
[2024-05-25 16:33:33] [INFO ] Implicit Places using invariants and state equation in 10105 ms returned [3499, 3500, 3501, 3502, 3503, 3504, 3505, 3506, 3507, 3508, 3509, 3510, 3511, 3512, 3513, 3514, 3515, 3516, 3517, 3518, 3519, 3520, 3521, 3522, 3523, 3524, 3525, 3526, 3527, 3528, 3529, 3530, 3531]
Discarding 33 places :
Implicit Place search using SMT with State Equation took 15776 ms to find 33 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3703/3736 places, 506/506 transitions.
Applied a total of 0 rules in 192 ms. Remains 3703 /3703 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 16156 ms. Remains : 3703/3736 places, 506/506 transitions.
Stuttering acceptance computed with spot in 157 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1), (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-COL-32-LTLFireability-10
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-32-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-32-LTLFireability-10 finished in 16334 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((G(p1)||X(G(p2))||p0)))'
Support contains 1190 out of 3736 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Applied a total of 0 rules in 101 ms. Remains 3736 /3736 variables (removed 0) and now considering 506/506 (removed 0) transitions.
[2024-05-25 16:33:34] [INFO ] Invariant cache hit.
[2024-05-25 16:33:37] [INFO ] Implicit Places using invariants in 3447 ms returned []
[2024-05-25 16:33:37] [INFO ] Invariant cache hit.
[2024-05-25 16:33:43] [INFO ] Implicit Places using invariants and state equation in 5220 ms returned [3499, 3500, 3501, 3502, 3503, 3504, 3505, 3506, 3507, 3508, 3509, 3510, 3511, 3512, 3513, 3514, 3515, 3516, 3517, 3518, 3519, 3520, 3521, 3522, 3523, 3524, 3525, 3526, 3527, 3528, 3529, 3530, 3531]
Discarding 33 places :
Implicit Place search using SMT with State Equation took 8672 ms to find 33 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3703/3736 places, 506/506 transitions.
Applied a total of 0 rules in 94 ms. Remains 3703 /3703 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 8869 ms. Remains : 3703/3736 places, 506/506 transitions.
Stuttering acceptance computed with spot in 154 ms :[true, (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (NOT p2), (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-COL-32-LTLFireability-12
Product exploration explored 100000 steps with 2676 reset in 757 ms.
Product exploration explored 100000 steps with 2671 reset in 755 ms.
Computed a total of 3703 stabilizing places and 506 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3703 transition count 506
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X p2), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p1 p2))), (X (NOT p0)), (X (NOT (AND p1 (NOT p2)))), (X (NOT p1)), (X (X p2)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT p0))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p1))), (F (G (NOT p0))), (F (G (NOT p1))), (F (G p2))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 22 factoid took 104 ms. Reduced automaton from 5 states, 12 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[true, (NOT p2)]
RANDOM walk for 40000 steps (1073 resets) in 389 ms. (102 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (45 resets) in 789 ms. (50 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 489865 steps, run timeout after 3001 ms. (steps per millisecond=163 ) properties seen :0 out of 1
Probabilistic random walk after 489865 steps, saw 85119 distinct states, run finished after 3001 ms. (steps per millisecond=163 ) properties seen :0
// Phase 1: matrix 506 rows 3703 cols
[2024-05-25 16:33:49] [INFO ] Computed 3200 invariants in 402 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 33/101 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 301/402 variables, 101/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/402 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 504/906 variables, 300/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/906 variables, 32/465 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/906 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 33/939 variables, 32/497 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/939 variables, 33/530 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/939 variables, 0/530 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4209/4209 variables, and 3799 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1644 ms.
Refiners :[Generalized P Invariants (flows): 96/3200 constraints, State Equation: 3703/3703 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 33/101 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 301/402 variables, 101/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/402 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 504/906 variables, 300/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/906 variables, 32/465 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/906 variables, 1/466 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/906 variables, 0/466 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 33/939 variables, 32/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/939 variables, 33/531 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/939 variables, 0/531 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4209/4209 variables, and 3800 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1863 ms.
Refiners :[Generalized P Invariants (flows): 96/3200 constraints, State Equation: 3703/3703 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 3952ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 78 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=39 )
Parikh walk visited 1 properties in 10 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X p2), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p1 p2))), (X (NOT p0)), (X (NOT (AND p1 (NOT p2)))), (X (NOT p1)), (X (X p2)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT p0))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p1))), (F (G (NOT p0))), (F (G (NOT p1))), (F (G p2))]
False Knowledge obtained : [(F (NOT p2))]
Property proved to be false thanks to negative knowledge :(F (NOT p2))
Knowledge based reduction with 22 factoid took 123 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-32-LTLFireability-12 FALSE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-32-LTLFireability-12 finished in 18822 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 1123 out of 3736 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Graph (complete) has 42047 edges and 3736 vertex of which 1425 are kept as prefixes of interest. Removing 2311 places using SCC suffix rule.11 ms
Discarding 2311 places :
Also discarding 101 output transitions
Drop transitions (Output transitions of discarded places.) removed 101 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 98 transitions.
Iterating post reduction 0 with 98 rules applied. Total rules applied 99 place count 1424 transition count 306
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 101 place count 1423 transition count 305
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 102 place count 1423 transition count 305
Applied a total of 102 rules in 61 ms. Remains 1423 /3736 variables (removed 2313) and now considering 305/506 (removed 201) transitions.
// Phase 1: matrix 305 rows 1423 cols
[2024-05-25 16:33:53] [INFO ] Computed 1120 invariants in 6 ms
[2024-05-25 16:33:53] [INFO ] Implicit Places using invariants in 469 ms returned []
[2024-05-25 16:33:53] [INFO ] Invariant cache hit.
[2024-05-25 16:33:54] [INFO ] Implicit Places using invariants and state equation in 794 ms returned [1222, 1223, 1224, 1225, 1226, 1227, 1228, 1229, 1230, 1231, 1232, 1233, 1234, 1235, 1236, 1237, 1238, 1239, 1240, 1241, 1242, 1243, 1244, 1245, 1246, 1247, 1248, 1249, 1250, 1251, 1252, 1253, 1254]
Discarding 33 places :
Implicit Place search using SMT with State Equation took 1267 ms to find 33 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1390/3736 places, 305/506 transitions.
Applied a total of 0 rules in 9 ms. Remains 1390 /1390 variables (removed 0) and now considering 305/305 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1338 ms. Remains : 1390/3736 places, 305/506 transitions.
Stuttering acceptance computed with spot in 80 ms :[(NOT p1), true, p0]
Running random walk in product with property : QuasiCertifProtocol-COL-32-LTLFireability-13
Product exploration explored 100000 steps with 2443 reset in 630 ms.
Product exploration explored 100000 steps with 2442 reset in 724 ms.
Computed a total of 1390 stabilizing places and 305 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1390 transition count 305
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 159 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 100 ms :[(NOT p1), true, p0]
RANDOM walk for 40000 steps (901 resets) in 623 ms. (64 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (24 resets) in 1109 ms. (36 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (24 resets) in 1106 ms. (36 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (24 resets) in 1107 ms. (36 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (24 resets) in 113 ms. (350 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 538397 steps, run timeout after 3001 ms. (steps per millisecond=179 ) properties seen :0 out of 4
Probabilistic random walk after 538397 steps, saw 96743 distinct states, run finished after 3001 ms. (steps per millisecond=179 ) properties seen :0
// Phase 1: matrix 305 rows 1390 cols
[2024-05-25 16:34:00] [INFO ] Computed 1088 invariants in 9 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1123 variables, 1056/1056 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1123 variables, 0/1056 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 70/1193 variables, 1123/2179 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1193 variables, 0/2179 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 233/1426 variables, 133/2312 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1426 variables, 32/2344 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1426 variables, 0/2344 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 236/1662 variables, 101/2445 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1662 variables, 0/2445 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 33/1695 variables, 33/2478 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1695 variables, 0/2478 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 0/1695 variables, 0/2478 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1695/1695 variables, and 2478 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2302 ms.
Refiners :[Generalized P Invariants (flows): 1088/1088 constraints, State Equation: 1390/1390 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1123 variables, 1056/1056 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1123 variables, 0/1056 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 70/1193 variables, 1123/2179 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1193 variables, 1/2180 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1193 variables, 0/2180 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 233/1426 variables, 133/2313 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1426 variables, 32/2345 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1426 variables, 3/2348 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1426 variables, 0/2348 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 236/1662 variables, 101/2449 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1662 variables, 0/2449 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 33/1695 variables, 33/2482 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1695 variables, 0/2482 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/1695 variables, 0/2482 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1695/1695 variables, and 2482 constraints, problems are : Problem set: 0 solved, 4 unsolved in 5013 ms.
Refiners :[Generalized P Invariants (flows): 1088/1088 constraints, State Equation: 1390/1390 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 7448ms problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1123 out of 1390 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1390/1390 places, 305/305 transitions.
Graph (complete) has 2543 edges and 1390 vertex of which 1389 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 134 transitions
Reduce isomorphic transitions removed 134 transitions.
Discarding 66 places :
Implicit places reduction removed 66 places
Iterating post reduction 0 with 200 rules applied. Total rules applied 201 place count 1323 transition count 170
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 100 Pre rules applied. Total rules applied 201 place count 1323 transition count 70
Deduced a syphon composed of 100 places in 0 ms
Ensure Unique test removed 65 places
Reduce places removed 165 places and 0 transitions.
Iterating global reduction 1 with 265 rules applied. Total rules applied 466 place count 1158 transition count 70
Applied a total of 466 rules in 54 ms. Remains 1158 /1390 variables (removed 232) and now considering 70/305 (removed 235) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 1158/1390 places, 70/305 transitions.
RANDOM walk for 155 steps (5 resets) in 8 ms. (17 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p1), (F (NOT (OR (NOT p0) p1))), (F p0), (F (NOT (AND (NOT p0) (NOT p1))))]
Property proved to be false thanks to negative knowledge :(F (NOT (OR (NOT p0) p1)))
Knowledge based reduction with 11 factoid took 219 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-COL-32-LTLFireability-13 FALSE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-32-LTLFireability-13 finished in 15236 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(!p0)||G((X(!p2)||p1))))'
Support contains 36 out of 3736 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Applied a total of 0 rules in 205 ms. Remains 3736 /3736 variables (removed 0) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3736 cols
[2024-05-25 16:34:08] [INFO ] Computed 3232 invariants in 66 ms
[2024-05-25 16:34:14] [INFO ] Implicit Places using invariants in 6039 ms returned []
[2024-05-25 16:34:14] [INFO ] Invariant cache hit.
[2024-05-25 16:34:24] [INFO ] Implicit Places using invariants and state equation in 9575 ms returned [3499, 3500, 3501, 3502, 3503, 3504, 3505, 3506, 3507, 3508, 3509, 3510, 3511, 3512, 3513, 3514, 3515, 3516, 3517, 3518, 3519, 3520, 3521, 3522, 3523, 3524, 3525, 3526, 3527, 3528, 3529, 3530, 3531]
Discarding 33 places :
Implicit Place search using SMT with State Equation took 15622 ms to find 33 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3703/3736 places, 506/506 transitions.
Applied a total of 0 rules in 198 ms. Remains 3703 /3703 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 16025 ms. Remains : 3703/3736 places, 506/506 transitions.
Stuttering acceptance computed with spot in 191 ms :[true, p2, (AND p0 p2), (AND (NOT p1) p2), (AND p2 (NOT p1) p0), p0]
Running random walk in product with property : QuasiCertifProtocol-COL-32-LTLFireability-14
Product exploration explored 100000 steps with 2679 reset in 321 ms.
Product exploration explored 100000 steps with 2676 reset in 336 ms.
Computed a total of 3703 stabilizing places and 506 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3703 transition count 506
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 p2 (NOT p1) (NOT p0)), (X p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p0 p1))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) p2)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p2))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (G p2)), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 34 factoid took 167 ms. Reduced automaton from 6 states, 18 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 47 ms :[true, p0]
RANDOM walk for 40000 steps (1070 resets) in 150 ms. (264 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (45 resets) in 69 ms. (571 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1821 steps, run visited all 1 properties in 8 ms. (steps per millisecond=227 )
Probabilistic random walk after 1821 steps, saw 1788 distinct states, run finished after 8 ms. (steps per millisecond=227 ) properties seen :1
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p0 p1))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) p2)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p2))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (G p2)), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Property proved to be false thanks to negative knowledge :(F p0)
Knowledge based reduction with 34 factoid took 214 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-32-LTLFireability-14 FALSE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-32-LTLFireability-14 finished in 17963 ms.
All properties solved by simple procedures.
Total runtime 297265 ms.
ITS solved all properties within timeout

BK_STOP 1716654866762

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML

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-32"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is QuasiCertifProtocol-COL-32, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r311-tall-171662335800052"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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