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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 512K
-rw-r--r-- 1 mcc users 7.9K Apr 13 04:07 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Apr 13 04:07 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Apr 13 04:00 CTLFireability.txt
-rw-r--r-- 1 mcc users 85K Apr 13 04:00 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.9K Apr 13 04:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 62K Apr 13 04:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Apr 13 04:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 13 04:10 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 93K 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-18-LTLCardinality-00
FORMULA_NAME QuasiCertifProtocol-COL-18-LTLCardinality-01
FORMULA_NAME QuasiCertifProtocol-COL-18-LTLCardinality-02
FORMULA_NAME QuasiCertifProtocol-COL-18-LTLCardinality-03
FORMULA_NAME QuasiCertifProtocol-COL-18-LTLCardinality-04
FORMULA_NAME QuasiCertifProtocol-COL-18-LTLCardinality-05
FORMULA_NAME QuasiCertifProtocol-COL-18-LTLCardinality-06
FORMULA_NAME QuasiCertifProtocol-COL-18-LTLCardinality-07
FORMULA_NAME QuasiCertifProtocol-COL-18-LTLCardinality-08
FORMULA_NAME QuasiCertifProtocol-COL-18-LTLCardinality-09
FORMULA_NAME QuasiCertifProtocol-COL-18-LTLCardinality-10
FORMULA_NAME QuasiCertifProtocol-COL-18-LTLCardinality-11
FORMULA_NAME QuasiCertifProtocol-COL-18-LTLCardinality-12
FORMULA_NAME QuasiCertifProtocol-COL-18-LTLCardinality-13
FORMULA_NAME QuasiCertifProtocol-COL-18-LTLCardinality-14
FORMULA_NAME QuasiCertifProtocol-COL-18-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717218028194

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-18
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 05:00:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 05:00:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 05:00: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-06-01 05:00:29] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 05:00:30] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 591 ms
[2024-06-01 05:00:30] [INFO ] Imported 30 HL places and 26 HL transitions for a total of 1398 PT places and 296.0 transition bindings in 20 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
[2024-06-01 05:00:30] [INFO ] Built PT skeleton of HLPN with 30 places and 26 transitions 77 arcs in 4 ms.
[2024-06-01 05:00:30] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 4 formulas.
FORMULA QuasiCertifProtocol-COL-18-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-18-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-18-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-18-LTLCardinality-09 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).
RANDOM walk for 40027 steps (1465 resets) in 573 ms. (69 steps per ms) remains 3/25 properties
BEST_FIRST walk for 40004 steps (522 resets) in 303 ms. (131 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (815 resets) in 211 ms. (188 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (527 resets) in 137 ms. (289 steps per ms) remains 3/3 properties
// Phase 1: matrix 26 rows 30 cols
[2024-06-01 05:00:30] [INFO ] Computed 5 invariants in 7 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 5/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 8/16 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 16/32 variables, 16/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/32 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 15/47 variables, 8/28 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/47 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 6/53 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/53 variables, 2/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/53 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 3/56 variables, 4/35 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/56 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/56 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 56/56 variables, and 35 constraints, problems are : Problem set: 0 solved, 3 unsolved in 360 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: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 5/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 8/16 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 16/32 variables, 16/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/32 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/32 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 15/47 variables, 8/29 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/47 variables, 2/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/47 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 6/53 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/53 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/53 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 3/56 variables, 4/38 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/56 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 0/56 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 56/56 variables, and 38 constraints, problems are : Problem set: 0 solved, 3 unsolved in 103 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 500ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 66 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=33 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 3 properties in 6 ms.
[2024-06-01 05:00:31] [INFO ] Flatten gal took : 18 ms
[2024-06-01 05:00:31] [INFO ] Flatten gal took : 5 ms
Domain [tsid(19), tsid(19)] of place n9 breaks symmetries in sort tsid
[2024-06-01 05:00:31] [INFO ] Unfolded HLPN to a Petri net with 1398 places and 296 transitions 3119 arcs in 23 ms.
[2024-06-01 05:00:31] [INFO ] Unfolded 12 HLPN properties in 0 ms.
Support contains 1339 out of 1398 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1398/1398 places, 296/296 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1397 transition count 296
Applied a total of 1 rules in 20 ms. Remains 1397 /1398 variables (removed 1) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 1397 cols
[2024-06-01 05:00:31] [INFO ] Computed 1102 invariants in 46 ms
[2024-06-01 05:00:31] [INFO ] Implicit Places using invariants in 471 ms returned []
[2024-06-01 05:00:31] [INFO ] Invariant cache hit.
[2024-06-01 05:00:32] [INFO ] Implicit Places using invariants and state equation in 743 ms returned [1219, 1220, 1221, 1222, 1223, 1224, 1225, 1226, 1227, 1228, 1229, 1230, 1231, 1232, 1233, 1234, 1235, 1236, 1237]
Discarding 19 places :
Implicit Place search using SMT with State Equation took 1227 ms to find 19 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1378/1398 places, 296/296 transitions.
Applied a total of 0 rules in 6 ms. Remains 1378 /1378 variables (removed 0) and now considering 296/296 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1262 ms. Remains : 1378/1398 places, 296/296 transitions.
Support contains 1339 out of 1378 places after structural reductions.
[2024-06-01 05:00:32] [INFO ] Flatten gal took : 90 ms
[2024-06-01 05:00:32] [INFO ] Flatten gal took : 80 ms
[2024-06-01 05:00:33] [INFO ] Input system was already deterministic with 296 transitions.
Support contains 1338 out of 1378 places (down from 1339) after GAL structural reductions.
RANDOM walk for 40000 steps (1766 resets) in 2779 ms. (14 steps per ms) remains 19/24 properties
BEST_FIRST walk for 4004 steps (10 resets) in 57 ms. (69 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (12 resets) in 34 ms. (114 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (12 resets) in 47 ms. (83 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (11 resets) in 31 ms. (125 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (11 resets) in 27 ms. (143 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (16 resets) in 28 ms. (138 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (13 resets) in 20 ms. (190 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (12 resets) in 30 ms. (129 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (12 resets) in 30 ms. (129 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (16 resets) in 30 ms. (129 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (13 resets) in 50 ms. (78 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (12 resets) in 25 ms. (154 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (11 resets) in 48 ms. (81 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (12 resets) in 27 ms. (143 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (12 resets) in 36 ms. (108 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (13 resets) in 44 ms. (88 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (11 resets) in 23 ms. (166 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (11 resets) in 40 ms. (97 steps per ms) remains 19/19 properties
// Phase 1: matrix 296 rows 1378 cols
[2024-06-01 05:00:34] [INFO ] Computed 1083 invariants in 25 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1279 variables, 702/702 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1279 variables, 0/702 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (OVERLAPS) 78/1357 variables, 21/723 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1357 variables, 342/1065 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1357 variables, 0/1065 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (OVERLAPS) 19/1376 variables, 18/1083 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1376 variables, 0/1083 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (OVERLAPS) 294/1670 variables, 1376/2459 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1670 variables, 0/2459 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (OVERLAPS) 4/1674 variables, 2/2461 constraints. Problems are: Problem set: 0 solved, 19 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1674/1674 variables, and 2461 constraints, problems are : Problem set: 0 solved, 19 unsolved in 5021 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 1062/1062 constraints, State Equation: 1378/1378 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 19 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1279 variables, 702/702 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1279 variables, 0/702 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (OVERLAPS) 78/1357 variables, 21/723 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1357 variables, 342/1065 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-06-01 05:00:40] [INFO ] Deduced a trap composed of 10 places in 526 ms of which 69 ms to minimize.
[2024-06-01 05:00:41] [INFO ] Deduced a trap composed of 11 places in 437 ms of which 9 ms to minimize.
[2024-06-01 05:00:41] [INFO ] Deduced a trap composed of 10 places in 397 ms of which 7 ms to minimize.
[2024-06-01 05:00:42] [INFO ] Deduced a trap composed of 10 places in 389 ms of which 8 ms to minimize.
[2024-06-01 05:00:42] [INFO ] Deduced a trap composed of 9 places in 400 ms of which 7 ms to minimize.
[2024-06-01 05:00:43] [INFO ] Deduced a trap composed of 10 places in 372 ms of which 8 ms to minimize.
[2024-06-01 05:00:43] [INFO ] Deduced a trap composed of 10 places in 396 ms of which 7 ms to minimize.
[2024-06-01 05:00:43] [INFO ] Deduced a trap composed of 10 places in 408 ms of which 8 ms to minimize.
[2024-06-01 05:00:44] [INFO ] Deduced a trap composed of 9 places in 381 ms of which 7 ms to minimize.
[2024-06-01 05:00:44] [INFO ] Deduced a trap composed of 8 places in 375 ms of which 7 ms to minimize.
SMT process timed out in 10584ms, After SMT, problems are : Problem set: 0 solved, 19 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1279 out of 1378 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1378/1378 places, 296/296 transitions.
Graph (complete) has 9223 edges and 1378 vertex of which 1358 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.6 ms
Discarding 20 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 59 transitions
Reduce isomorphic transitions removed 59 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 60 rules applied. Total rules applied 61 place count 1358 transition count 236
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 62 place count 1357 transition count 236
Applied a total of 62 rules in 47 ms. Remains 1357 /1378 variables (removed 21) and now considering 236/296 (removed 60) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 1357/1378 places, 236/296 transitions.
RANDOM walk for 40000 steps (1242 resets) in 1812 ms. (22 steps per ms) remains 12/19 properties
BEST_FIRST walk for 40004 steps (82 resets) in 290 ms. (137 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (83 resets) in 104 ms. (380 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (84 resets) in 139 ms. (285 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (84 resets) in 103 ms. (384 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (100 resets) in 135 ms. (294 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (84 resets) in 125 ms. (317 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (63 resets) in 111 ms. (357 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (100 resets) in 124 ms. (320 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (84 resets) in 254 ms. (156 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (83 resets) in 335 ms. (119 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (84 resets) in 274 ms. (145 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (83 resets) in 118 ms. (336 steps per ms) remains 12/12 properties
// Phase 1: matrix 236 rows 1357 cols
[2024-06-01 05:00:45] [INFO ] Computed 1121 invariants in 14 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1218 variables, 324/324 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1218 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 98/1316 variables, 779/1103 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1316 variables, 0/1103 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 232/1548 variables, 1316/2419 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1548 variables, 0/2419 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 45/1593 variables, 41/2460 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1593 variables, 18/2478 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1593 variables, 0/2478 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (OVERLAPS) 0/1593 variables, 0/2478 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1593/1593 variables, and 2478 constraints, problems are : Problem set: 0 solved, 12 unsolved in 5048 ms.
Refiners :[Generalized P Invariants (flows): 1121/1121 constraints, State Equation: 1357/1357 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1218 variables, 324/324 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1218 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 98/1316 variables, 779/1103 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1316 variables, 0/1103 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 232/1548 variables, 1316/2419 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1548 variables, 9/2428 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1548 variables, 0/2428 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 45/1593 variables, 41/2469 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1593 variables, 18/2487 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1593/1593 variables, and 2490 constraints, problems are : Problem set: 0 solved, 12 unsolved in 45026 ms.
Refiners :[Generalized P Invariants (flows): 1121/1121 constraints, State Equation: 1357/1357 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
After SMT, in 50175ms problems are : Problem set: 0 solved, 12 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1218 out of 1357 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1357/1357 places, 236/236 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Discarding 19 places :
Implicit places reduction removed 19 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 1338 transition count 213
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 43 place count 1337 transition count 213
Applied a total of 43 rules in 71 ms. Remains 1337 /1357 variables (removed 20) and now considering 213/236 (removed 23) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71 ms. Remains : 1337/1357 places, 213/236 transitions.
RANDOM walk for 40000 steps (972 resets) in 1248 ms. (32 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (79 resets) in 289 ms. (137 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (79 resets) in 134 ms. (296 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (79 resets) in 140 ms. (283 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (79 resets) in 116 ms. (341 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40000 steps (92 resets) in 147 ms. (270 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (79 resets) in 143 ms. (277 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (59 resets) in 115 ms. (344 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40000 steps (92 resets) in 138 ms. (287 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (79 resets) in 267 ms. (149 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (80 resets) in 316 ms. (126 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (80 resets) in 277 ms. (143 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (79 resets) in 128 ms. (310 steps per ms) remains 12/12 properties
Interrupted probabilistic random walk after 822245 steps, run timeout after 3001 ms. (steps per millisecond=273 ) properties seen :11 out of 12
Probabilistic random walk after 822245 steps, saw 112084 distinct states, run finished after 3005 ms. (steps per millisecond=273 ) properties seen :11
// Phase 1: matrix 213 rows 1337 cols
[2024-06-01 05:01:40] [INFO ] Computed 1124 invariants in 18 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 135/154 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 23/177 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/177 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/178 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/178 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1159/1337 variables, 1103/1124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1337 variables, 0/1124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 213/1550 variables, 1337/2461 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1550 variables, 0/2461 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1550 variables, 0/2461 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1550/1550 variables, and 2461 constraints, problems are : Problem set: 0 solved, 1 unsolved in 676 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 1104/1104 constraints, State Equation: 1337/1337 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/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 135/154 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 23/177 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/177 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/178 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/178 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1159/1337 variables, 1103/1124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1337 variables, 0/1124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 213/1550 variables, 1337/2461 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1550 variables, 1/2462 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1550 variables, 0/2462 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/1550 variables, 0/2462 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1550/1550 variables, and 2462 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1220 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 1104/1104 constraints, State Equation: 1337/1337 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1929ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 101 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=25 )
Parikh walk visited 1 properties in 5 ms.
Computed a total of 1378 stabilizing places and 296 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1378 transition count 296
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(X(G(p0))))'
Support contains 361 out of 1378 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1378/1378 places, 296/296 transitions.
Reduce places removed 41 places and 0 transitions.
Iterating post reduction 0 with 41 rules applied. Total rules applied 41 place count 1337 transition count 296
Applied a total of 41 rules in 80 ms. Remains 1337 /1378 variables (removed 41) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 1337 cols
[2024-06-01 05:01:42] [INFO ] Computed 1044 invariants in 79 ms
[2024-06-01 05:01:43] [INFO ] Implicit Places using invariants in 1104 ms returned []
[2024-06-01 05:01:43] [INFO ] Invariant cache hit.
[2024-06-01 05:01:46] [INFO ] Implicit Places using invariants and state equation in 2431 ms returned []
Implicit Place search using SMT with State Equation took 3543 ms to find 0 implicit places.
Running 276 sub problems to find dead transitions.
[2024-06-01 05:01:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1336 variables, 1044/1044 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1336 variables, 0/1044 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 296/1632 variables, 1336/2380 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1632 variables, 0/2380 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 1/1633 variables, 1/2381 constraints. Problems are: Problem set: 0 solved, 276 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1633/1633 variables, and 2381 constraints, problems are : Problem set: 0 solved, 276 unsolved in 30021 ms.
Refiners :[Generalized P Invariants (flows): 1044/1044 constraints, State Equation: 1337/1337 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 276 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1336 variables, 1044/1044 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1336 variables, 0/1044 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 296/1632 variables, 1336/2380 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1632 variables, 276/2656 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1632 variables, 0/2656 constraints. Problems are: Problem set: 0 solved, 276 unsolved
SMT process timed out in 60386ms, After SMT, problems are : Problem set: 0 solved, 276 unsolved
Search for dead transitions found 0 dead transitions in 60393ms
Starting structural reductions in LTL mode, iteration 1 : 1337/1378 places, 296/296 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64029 ms. Remains : 1337/1378 places, 296/296 transitions.
Stuttering acceptance computed with spot in 222 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-18-LTLCardinality-00
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-COL-18-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-18-LTLCardinality-00 finished in 64314 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))))'
Support contains 76 out of 1378 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1378/1378 places, 296/296 transitions.
Graph (complete) has 9223 edges and 1378 vertex of which 1336 are kept as prefixes of interest. Removing 42 places using SCC suffix rule.19 ms
Discarding 42 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 1335 transition count 293
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 1335 transition count 293
Applied a total of 4 rules in 406 ms. Remains 1335 /1378 variables (removed 43) and now considering 293/296 (removed 3) transitions.
// Phase 1: matrix 293 rows 1335 cols
[2024-06-01 05:02:47] [INFO ] Computed 1044 invariants in 7 ms
[2024-06-01 05:02:48] [INFO ] Implicit Places using invariants in 1297 ms returned []
[2024-06-01 05:02:48] [INFO ] Invariant cache hit.
[2024-06-01 05:02:55] [INFO ] Implicit Places using invariants and state equation in 6902 ms returned []
Implicit Place search using SMT with State Equation took 8202 ms to find 0 implicit places.
[2024-06-01 05:02:55] [INFO ] Redundant transitions in 39 ms returned []
Running 273 sub problems to find dead transitions.
[2024-06-01 05:02:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1315 variables, 702/702 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1315 variables, 0/702 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 2 (OVERLAPS) 19/1334 variables, 342/1044 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1334 variables, 0/1044 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 4 (OVERLAPS) 293/1627 variables, 1334/2378 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1627 variables, 0/2378 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 6 (OVERLAPS) 1/1628 variables, 1/2379 constraints. Problems are: Problem set: 0 solved, 273 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1628/1628 variables, and 2379 constraints, problems are : Problem set: 0 solved, 273 unsolved in 30012 ms.
Refiners :[Generalized P Invariants (flows): 1044/1044 constraints, State Equation: 1335/1335 constraints, PredecessorRefiner: 273/273 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 273 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1315 variables, 702/702 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1315 variables, 0/702 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 2 (OVERLAPS) 19/1334 variables, 342/1044 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1334 variables, 0/1044 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 4 (OVERLAPS) 293/1627 variables, 1334/2378 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1627 variables, 273/2651 constraints. Problems are: Problem set: 0 solved, 273 unsolved
(s1157 0timeout
^^^^^^^^
(error "Invalid token: 0timeout")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1627/1628 variables, and 2651 constraints, problems are : Problem set: 0 solved, 273 unsolved in 30050 ms.
Refiners :[Generalized P Invariants (flows): 1044/1044 constraints, State Equation: 1334/1335 constraints, PredecessorRefiner: 273/273 constraints, Known Traps: 0/0 constraints]
After SMT, in 60375ms problems are : Problem set: 0 solved, 273 unsolved
Search for dead transitions found 0 dead transitions in 60379ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1335/1378 places, 293/296 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 69042 ms. Remains : 1335/1378 places, 293/296 transitions.
Stuttering acceptance computed with spot in 126 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : QuasiCertifProtocol-COL-18-LTLCardinality-02
Product exploration explored 100000 steps with 10765 reset in 547 ms.
Product exploration explored 100000 steps with 10866 reset in 374 ms.
Computed a total of 1335 stabilizing places and 293 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1335 transition count 293
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 p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 7 factoid took 453 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[(AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (1766 resets) in 568 ms. (70 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (172 resets) in 264 ms. (150 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (131 resets) in 70 ms. (563 steps per ms) remains 2/2 properties
[2024-06-01 05:03:57] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 399/475 variables, 378/378 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/475 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 139/614 variables, 475/853 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/614 variables, 0/853 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1014/1628 variables, 860/1713 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1628 variables, 666/2379 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1628 variables, 0/2379 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/1628 variables, 0/2379 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1628/1628 variables, and 2379 constraints, problems are : Problem set: 0 solved, 2 unsolved in 887 ms.
Refiners :[Generalized P Invariants (flows): 1044/1044 constraints, State Equation: 1335/1335 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 399/475 variables, 378/378 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/475 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 139/614 variables, 475/853 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/614 variables, 0/853 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1014/1628 variables, 860/1713 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1628 variables, 666/2379 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1628 variables, 2/2381 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1628 variables, 0/2381 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/1628 variables, 0/2381 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1628/1628 variables, and 2381 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1194 ms.
Refiners :[Generalized P Invariants (flows): 1044/1044 constraints, State Equation: 1335/1335 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 2128ms problems are : Problem set: 0 solved, 2 unsolved
Finished Parikh walk after 30 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=15 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 2 properties in 4 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 7 factoid took 669 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 47 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 42 ms :[(AND (NOT p0) (NOT p1))]
[2024-06-01 05:04:00] [INFO ] Invariant cache hit.
[2024-06-01 05:04:02] [INFO ] [Real]Absence check using 0 positive and 1044 generalized place invariants in 1304 ms returned sat
[2024-06-01 05:04:08] [INFO ] [Real]Absence check using state equation in 6036 ms returned sat
[2024-06-01 05:04:08] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:04:10] [INFO ] [Nat]Absence check using 0 positive and 1044 generalized place invariants in 1294 ms returned sat
[2024-06-01 05:04:15] [INFO ] [Nat]Absence check using state equation in 5572 ms returned sat
[2024-06-01 05:04:16] [INFO ] Computed and/alt/rep : 212/250/212 causal constraints (skipped 61 transitions) in 28 ms.
[2024-06-01 05:04:16] [INFO ] Added : 0 causal constraints over 0 iterations in 154 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 76 out of 1335 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1335/1335 places, 293/293 transitions.
Applied a total of 0 rules in 81 ms. Remains 1335 /1335 variables (removed 0) and now considering 293/293 (removed 0) transitions.
[2024-06-01 05:04:16] [INFO ] Invariant cache hit.
[2024-06-01 05:04:17] [INFO ] Implicit Places using invariants in 1194 ms returned []
[2024-06-01 05:04:17] [INFO ] Invariant cache hit.
[2024-06-01 05:04:24] [INFO ] Implicit Places using invariants and state equation in 7111 ms returned []
Implicit Place search using SMT with State Equation took 8315 ms to find 0 implicit places.
[2024-06-01 05:04:24] [INFO ] Redundant transitions in 34 ms returned []
Running 273 sub problems to find dead transitions.
[2024-06-01 05:04:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1315 variables, 702/702 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1315 variables, 0/702 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 2 (OVERLAPS) 19/1334 variables, 342/1044 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1334 variables, 0/1044 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 4 (OVERLAPS) 293/1627 variables, 1334/2378 constraints. Problems are: Problem set: 0 solved, 273 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1627/1628 variables, and 2378 constraints, problems are : Problem set: 0 solved, 273 unsolved in 30024 ms.
Refiners :[Generalized P Invariants (flows): 1044/1044 constraints, State Equation: 1334/1335 constraints, PredecessorRefiner: 273/273 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 273 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1315 variables, 702/702 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1315 variables, 0/702 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 2 (OVERLAPS) 19/1334 variables, 342/1044 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1334 variables, 0/1044 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 4 (OVERLAPS) 293/1627 variables, 1334/2378 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1627 variables, 273/2651 constraints. Problems are: Problem set: 0 solved, 273 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1627/1628 variables, and 2651 constraints, problems are : Problem set: 0 solved, 273 unsolved in 30012 ms.
Refiners :[Generalized P Invariants (flows): 1044/1044 constraints, State Equation: 1334/1335 constraints, PredecessorRefiner: 273/273 constraints, Known Traps: 0/0 constraints]
After SMT, in 60321ms problems are : Problem set: 0 solved, 273 unsolved
Search for dead transitions found 0 dead transitions in 60324ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 68796 ms. Remains : 1335/1335 places, 293/293 transitions.
Computed a total of 1335 stabilizing places and 293 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1335 transition count 293
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)), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (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 (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 7 factoid took 533 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (1767 resets) in 367 ms. (108 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (172 resets) in 127 ms. (312 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (120 resets) in 118 ms. (336 steps per ms) remains 2/2 properties
[2024-06-01 05:05:26] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 399/475 variables, 378/378 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/475 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 139/614 variables, 475/853 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/614 variables, 0/853 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1014/1628 variables, 860/1713 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1628 variables, 666/2379 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1628 variables, 0/2379 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/1628 variables, 0/2379 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1628/1628 variables, and 2379 constraints, problems are : Problem set: 0 solved, 2 unsolved in 663 ms.
Refiners :[Generalized P Invariants (flows): 1044/1044 constraints, State Equation: 1335/1335 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 399/475 variables, 378/378 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/475 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 139/614 variables, 475/853 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/614 variables, 0/853 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1014/1628 variables, 860/1713 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1628 variables, 666/2379 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1628 variables, 2/2381 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1628 variables, 0/2381 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/1628 variables, 0/2381 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1628/1628 variables, and 2381 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1172 ms.
Refiners :[Generalized P Invariants (flows): 1044/1044 constraints, State Equation: 1335/1335 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 1860ms problems are : Problem set: 0 solved, 2 unsolved
Finished Parikh walk after 32 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=16 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 2 properties in 3 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (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 (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 7 factoid took 648 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 46 ms :[(AND (NOT p0) (NOT p1))]
[2024-06-01 05:05:28] [INFO ] Invariant cache hit.
[2024-06-01 05:05:30] [INFO ] [Real]Absence check using 0 positive and 1044 generalized place invariants in 1245 ms returned sat
[2024-06-01 05:05:36] [INFO ] [Real]Absence check using state equation in 6052 ms returned sat
[2024-06-01 05:05:36] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:05:38] [INFO ] [Nat]Absence check using 0 positive and 1044 generalized place invariants in 1208 ms returned sat
[2024-06-01 05:05:43] [INFO ] [Nat]Absence check using state equation in 5455 ms returned sat
[2024-06-01 05:05:43] [INFO ] Computed and/alt/rep : 212/250/212 causal constraints (skipped 61 transitions) in 22 ms.
[2024-06-01 05:05:43] [INFO ] Added : 0 causal constraints over 0 iterations in 130 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 38 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 10747 reset in 381 ms.
Product exploration explored 100000 steps with 10815 reset in 339 ms.
Support contains 76 out of 1335 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1335/1335 places, 293/293 transitions.
Applied a total of 0 rules in 41 ms. Remains 1335 /1335 variables (removed 0) and now considering 293/293 (removed 0) transitions.
[2024-06-01 05:05:44] [INFO ] Invariant cache hit.
[2024-06-01 05:05:45] [INFO ] Implicit Places using invariants in 1157 ms returned []
[2024-06-01 05:05:45] [INFO ] Invariant cache hit.
[2024-06-01 05:05:52] [INFO ] Implicit Places using invariants and state equation in 6878 ms returned []
Implicit Place search using SMT with State Equation took 8069 ms to find 0 implicit places.
[2024-06-01 05:05:52] [INFO ] Redundant transitions in 27 ms returned []
Running 273 sub problems to find dead transitions.
[2024-06-01 05:05:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1315 variables, 702/702 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1315 variables, 0/702 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 2 (OVERLAPS) 19/1334 variables, 342/1044 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1334 variables, 0/1044 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 4 (OVERLAPS) 293/1627 variables, 1334/2378 constraints. Problems are: Problem set: 0 solved, 273 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1627/1628 variables, and 2378 constraints, problems are : Problem set: 0 solved, 273 unsolved in 30011 ms.
Refiners :[Generalized P Invariants (flows): 1044/1044 constraints, State Equation: 1334/1335 constraints, PredecessorRefiner: 273/273 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 273 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1315 variables, 702/702 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1315 variables, 0/702 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 2 (OVERLAPS) 19/1334 variables, 342/1044 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1334 variables, 0/1044 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 4 (OVERLAPS) 293/1627 variables, 1334/2378 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1627 variables, 273/2651 constraints. Problems are: Problem set: 0 solved, 273 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1627/1628 variables, and 2651 constraints, problems are : Problem set: 0 solved, 273 unsolved in 30018 ms.
Refiners :[Generalized P Invariants (flows): 1044/1044 constraints, State Equation: 1334/1335 constraints, PredecessorRefiner: 273/273 constraints, Known Traps: 0/0 constraints]
After SMT, in 60303ms problems are : Problem set: 0 solved, 273 unsolved
Search for dead transitions found 0 dead transitions in 60306ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 68454 ms. Remains : 1335/1335 places, 293/293 transitions.
Treatment of property QuasiCertifProtocol-COL-18-LTLCardinality-02 finished in 246414 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 20 out of 1378 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1378/1378 places, 296/296 transitions.
Graph (complete) has 9223 edges and 1378 vertex of which 1317 are kept as prefixes of interest. Removing 61 places using SCC suffix rule.6 ms
Discarding 61 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 1315 transition count 292
Applied a total of 3 rules in 82 ms. Remains 1315 /1378 variables (removed 63) and now considering 292/296 (removed 4) transitions.
// Phase 1: matrix 292 rows 1315 cols
[2024-06-01 05:06:53] [INFO ] Computed 1026 invariants in 71 ms
[2024-06-01 05:06:54] [INFO ] Implicit Places using invariants in 1253 ms returned []
[2024-06-01 05:06:54] [INFO ] Invariant cache hit.
[2024-06-01 05:07:01] [INFO ] Implicit Places using invariants and state equation in 6755 ms returned [1160, 1161, 1162, 1163, 1164, 1165, 1166, 1167, 1168, 1169, 1170, 1171, 1172, 1173, 1174, 1175, 1176, 1177, 1178]
Discarding 19 places :
Implicit Place search using SMT with State Equation took 8011 ms to find 19 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1296/1378 places, 292/296 transitions.
Applied a total of 0 rules in 43 ms. Remains 1296 /1296 variables (removed 0) and now considering 292/292 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 8136 ms. Remains : 1296/1378 places, 292/296 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-18-LTLCardinality-03
Stuttering criterion allowed to conclude after 24 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-COL-18-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-18-LTLCardinality-03 finished in 8200 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 X(X(G((p0||X(G((F(G(p1)) U p2)))))))))'
Support contains 59 out of 1378 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1378/1378 places, 296/296 transitions.
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 1357 transition count 296
Applied a total of 21 rules in 35 ms. Remains 1357 /1378 variables (removed 21) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 1357 cols
[2024-06-01 05:07:01] [INFO ] Computed 1062 invariants in 30 ms
[2024-06-01 05:07:02] [INFO ] Implicit Places using invariants in 1265 ms returned []
[2024-06-01 05:07:02] [INFO ] Invariant cache hit.
[2024-06-01 05:07:05] [INFO ] Implicit Places using invariants and state equation in 2948 ms returned []
Implicit Place search using SMT with State Equation took 4216 ms to find 0 implicit places.
Running 276 sub problems to find dead transitions.
[2024-06-01 05:07:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1336 variables, 720/720 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1336 variables, 0/720 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 19/1355 variables, 342/1062 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1355 variables, 0/1062 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 296/1651 variables, 1355/2417 constraints. Problems are: Problem set: 0 solved, 276 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1651/1653 variables, and 2417 constraints, problems are : Problem set: 0 solved, 276 unsolved in 30013 ms.
Refiners :[Generalized P Invariants (flows): 1062/1062 constraints, State Equation: 1355/1357 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 276 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1336 variables, 720/720 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1336 variables, 0/720 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 19/1355 variables, 342/1062 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1355 variables, 0/1062 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 296/1651 variables, 1355/2417 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1651 variables, 274/2691 constraints. Problems are: Problem set: 0 solved, 276 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1651/1653 variables, and 2691 constraints, problems are : Problem set: 0 solved, 276 unsolved in 30021 ms.
Refiners :[Generalized P Invariants (flows): 1062/1062 constraints, State Equation: 1355/1357 constraints, PredecessorRefiner: 274/276 constraints, Known Traps: 0/0 constraints]
After SMT, in 60347ms problems are : Problem set: 0 solved, 276 unsolved
Search for dead transitions found 0 dead transitions in 60353ms
Starting structural reductions in LTL mode, iteration 1 : 1357/1378 places, 296/296 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64607 ms. Remains : 1357/1378 places, 296/296 transitions.
Stuttering acceptance computed with spot in 586 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p1), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : QuasiCertifProtocol-COL-18-LTLCardinality-04
Product exploration explored 100000 steps with 4413 reset in 299 ms.
Product exploration explored 100000 steps with 4420 reset in 296 ms.
Computed a total of 1357 stabilizing places and 296 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1357 transition count 296
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) p2 p1), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (G p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 201 ms. Reduced automaton from 11 states, 22 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p2), (NOT p2)]
RANDOM walk for 40000 steps (1768 resets) in 121 ms. (327 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (172 resets) in 101 ms. (392 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 674 steps, run visited all 1 properties in 6 ms. (steps per millisecond=112 )
Probabilistic random walk after 674 steps, saw 654 distinct states, run finished after 9 ms. (steps per millisecond=74 ) properties seen :1
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (G p1))]
False Knowledge obtained : [(F (NOT p2))]
Knowledge based reduction with 6 factoid took 281 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 85 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 89 ms :[(NOT p2), (NOT p2)]
Support contains 20 out of 1357 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 1357/1357 places, 296/296 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 4 place count 1355 transition count 294
Applied a total of 4 rules in 67 ms. Remains 1355 /1357 variables (removed 2) and now considering 294/296 (removed 2) transitions.
// Phase 1: matrix 294 rows 1355 cols
[2024-06-01 05:08:08] [INFO ] Computed 1062 invariants in 27 ms
[2024-06-01 05:08:09] [INFO ] Implicit Places using invariants in 1248 ms returned []
[2024-06-01 05:08:09] [INFO ] Invariant cache hit.
[2024-06-01 05:08:15] [INFO ] Implicit Places using invariants and state equation in 6236 ms returned []
Implicit Place search using SMT with State Equation took 7485 ms to find 0 implicit places.
[2024-06-01 05:08:15] [INFO ] Redundant transitions in 25 ms returned []
Running 274 sub problems to find dead transitions.
[2024-06-01 05:08:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1334 variables, 720/720 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1334 variables, 0/720 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 2 (OVERLAPS) 19/1353 variables, 342/1062 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1353 variables, 0/1062 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 4 (OVERLAPS) 294/1647 variables, 1353/2415 constraints. Problems are: Problem set: 0 solved, 274 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1647/1649 variables, and 2415 constraints, problems are : Problem set: 0 solved, 274 unsolved in 30020 ms.
Refiners :[Generalized P Invariants (flows): 1062/1062 constraints, State Equation: 1353/1355 constraints, PredecessorRefiner: 274/274 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 274 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1334 variables, 720/720 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1334 variables, 0/720 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 2 (OVERLAPS) 19/1353 variables, 342/1062 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1353 variables, 0/1062 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 4 (OVERLAPS) 294/1647 variables, 1353/2415 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1647 variables, 272/2687 constraints. Problems are: Problem set: 0 solved, 274 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1647/1649 variables, and 2687 constraints, problems are : Problem set: 0 solved, 274 unsolved in 30019 ms.
Refiners :[Generalized P Invariants (flows): 1062/1062 constraints, State Equation: 1353/1355 constraints, PredecessorRefiner: 272/274 constraints, Known Traps: 0/0 constraints]
After SMT, in 60344ms problems are : Problem set: 0 solved, 274 unsolved
Search for dead transitions found 0 dead transitions in 60351ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1355/1357 places, 294/296 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 67935 ms. Remains : 1355/1357 places, 294/296 transitions.
Computed a total of 1355 stabilizing places and 294 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1355 transition count 294
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 : [p2, (X p2), (X (X p2)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 108 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 68 ms :[(NOT p2), (NOT p2)]
RANDOM walk for 40000 steps (1768 resets) in 120 ms. (330 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (172 resets) in 45 ms. (869 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 653 steps, run visited all 1 properties in 5 ms. (steps per millisecond=130 )
Probabilistic random walk after 653 steps, saw 634 distinct states, run finished after 5 ms. (steps per millisecond=130 ) properties seen :1
Knowledge obtained : [p2, (X p2), (X (X p2)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT p2))]
Knowledge based reduction with 4 factoid took 97 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 74 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 81 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 103 ms :[(NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 4416 reset in 230 ms.
Product exploration explored 100000 steps with 4417 reset in 253 ms.
Support contains 20 out of 1355 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1355/1355 places, 294/294 transitions.
Graph (complete) has 9428 edges and 1355 vertex of which 1315 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.2 ms
Discarding 40 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Applied a total of 1 rules in 58 ms. Remains 1315 /1355 variables (removed 40) and now considering 292/294 (removed 2) transitions.
// Phase 1: matrix 292 rows 1315 cols
[2024-06-01 05:09:17] [INFO ] Computed 1026 invariants in 74 ms
[2024-06-01 05:09:18] [INFO ] Implicit Places using invariants in 1280 ms returned []
[2024-06-01 05:09:18] [INFO ] Invariant cache hit.
[2024-06-01 05:09:23] [INFO ] Implicit Places using invariants and state equation in 4738 ms returned []
Implicit Place search using SMT with State Equation took 6020 ms to find 0 implicit places.
[2024-06-01 05:09:23] [INFO ] Redundant transitions in 20 ms returned []
Running 272 sub problems to find dead transitions.
[2024-06-01 05:09:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1314 variables, 1026/1026 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1314 variables, 0/1026 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 2 (OVERLAPS) 292/1606 variables, 1314/2340 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1606 variables, 0/2340 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 4 (OVERLAPS) 1/1607 variables, 1/2341 constraints. Problems are: Problem set: 0 solved, 272 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1607/1607 variables, and 2341 constraints, problems are : Problem set: 0 solved, 272 unsolved in 30015 ms.
Refiners :[Generalized P Invariants (flows): 1026/1026 constraints, State Equation: 1315/1315 constraints, PredecessorRefiner: 272/272 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 272 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1314 variables, 1026/1026 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1314 variables, 0/1026 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 2 (OVERLAPS) 292/1606 variables, 1314/2340 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1606 variables, 272/2612 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1606 variables, 0/2612 constraints. Problems are: Problem set: 0 solved, 272 unsolved
SMT process timed out in 60298ms, After SMT, problems are : Problem set: 0 solved, 272 unsolved
Search for dead transitions found 0 dead transitions in 60303ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1315/1355 places, 292/294 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 66407 ms. Remains : 1315/1355 places, 292/294 transitions.
Treatment of property QuasiCertifProtocol-COL-18-LTLCardinality-04 finished in 202634 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(F(!p0))||(F(!p0)&&(p1||F((G(F(p2))||(p3&&X(F(p2))))))))))'
Support contains 77 out of 1378 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1378/1378 places, 296/296 transitions.
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 1357 transition count 296
Applied a total of 21 rules in 31 ms. Remains 1357 /1378 variables (removed 21) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 1357 cols
[2024-06-01 05:10:23] [INFO ] Computed 1063 invariants in 16 ms
[2024-06-01 05:10:25] [INFO ] Implicit Places using invariants in 1250 ms returned []
[2024-06-01 05:10:25] [INFO ] Invariant cache hit.
[2024-06-01 05:10:32] [INFO ] Implicit Places using invariants and state equation in 7063 ms returned []
Implicit Place search using SMT with State Equation took 8318 ms to find 0 implicit places.
Running 276 sub problems to find dead transitions.
[2024-06-01 05:10:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1336 variables, 720/720 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1336 variables, 0/720 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 20/1356 variables, 343/1063 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1356 variables, 0/1063 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 296/1652 variables, 1356/2419 constraints. Problems are: Problem set: 0 solved, 276 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1652/1653 variables, and 2419 constraints, problems are : Problem set: 0 solved, 276 unsolved in 30018 ms.
Refiners :[Generalized P Invariants (flows): 1063/1063 constraints, State Equation: 1356/1357 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 276 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1336 variables, 720/720 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1336 variables, 0/720 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 20/1356 variables, 343/1063 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1356 variables, 0/1063 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 296/1652 variables, 1356/2419 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1652 variables, 276/2695 constraints. Problems are: Problem set: 0 solved, 276 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1652/1653 variables, and 2695 constraints, problems are : Problem set: 0 solved, 276 unsolved in 30017 ms.
Refiners :[Generalized P Invariants (flows): 1063/1063 constraints, State Equation: 1356/1357 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints]
After SMT, in 60303ms problems are : Problem set: 0 solved, 276 unsolved
Search for dead transitions found 0 dead transitions in 60307ms
Starting structural reductions in LTL mode, iteration 1 : 1357/1378 places, 296/296 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 68658 ms. Remains : 1357/1378 places, 296/296 transitions.
Stuttering acceptance computed with spot in 275 ms :[p0, (AND p0 (NOT p2)), (AND p0 (NOT p2)), p0, (AND p0 (NOT p2)), (AND p0 (NOT p2))]
Running random walk in product with property : QuasiCertifProtocol-COL-18-LTLCardinality-05
Stuttering criterion allowed to conclude after 24 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-18-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-18-LTLCardinality-05 finished in 68960 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)&&X(p1)))||(F(p1)&&F(p2))))'
Support contains 420 out of 1378 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1378/1378 places, 296/296 transitions.
Reduce places removed 41 places and 0 transitions.
Iterating post reduction 0 with 41 rules applied. Total rules applied 41 place count 1337 transition count 296
Applied a total of 41 rules in 22 ms. Remains 1337 /1378 variables (removed 41) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 1337 cols
[2024-06-01 05:11:32] [INFO ] Computed 1044 invariants in 67 ms
[2024-06-01 05:11:33] [INFO ] Implicit Places using invariants in 907 ms returned []
[2024-06-01 05:11:33] [INFO ] Invariant cache hit.
[2024-06-01 05:11:35] [INFO ] Implicit Places using invariants and state equation in 1365 ms returned []
Implicit Place search using SMT with State Equation took 2274 ms to find 0 implicit places.
Running 276 sub problems to find dead transitions.
[2024-06-01 05:11:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1336 variables, 1044/1044 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1336 variables, 0/1044 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 296/1632 variables, 1336/2380 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1632 variables, 0/2380 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 1/1633 variables, 1/2381 constraints. Problems are: Problem set: 0 solved, 276 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 10.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1633/1633 variables, and 2381 constraints, problems are : Problem set: 0 solved, 276 unsolved in 30015 ms.
Refiners :[Generalized P Invariants (flows): 1044/1044 constraints, State Equation: 1337/1337 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 276 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1336 variables, 1044/1044 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1336 variables, 0/1044 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 296/1632 variables, 1336/2380 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1632 variables, 276/2656 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1632 variables, 0/2656 constraints. Problems are: Problem set: 0 solved, 276 unsolved
SMT process timed out in 60316ms, After SMT, problems are : Problem set: 0 solved, 276 unsolved
Search for dead transitions found 0 dead transitions in 60320ms
Starting structural reductions in LTL mode, iteration 1 : 1337/1378 places, 296/296 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62617 ms. Remains : 1337/1378 places, 296/296 transitions.
Stuttering acceptance computed with spot in 230 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2))), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : QuasiCertifProtocol-COL-18-LTLCardinality-08
Product exploration explored 100000 steps with 7253 reset in 305 ms.
Product exploration explored 100000 steps with 7267 reset in 331 ms.
Computed a total of 1337 stabilizing places and 296 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1337 transition count 296
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) p2 p0), (X p2), (X (NOT p1)), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p0)), (F (OR (G p1) (G (NOT p1)))), (F (G p2)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 13 factoid took 458 ms. Reduced automaton from 6 states, 8 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 58 steps (0 resets) in 4 ms. (11 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) p2 p0), (X p2), (X (NOT p1)), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p0)), (F (OR (G p1) (G (NOT p1)))), (F (G p2)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 13 factoid took 604 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 87 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 79 ms :[(NOT p1), (NOT p1)]
[2024-06-01 05:12:37] [INFO ] Invariant cache hit.
[2024-06-01 05:12:39] [INFO ] [Real]Absence check using 0 positive and 1044 generalized place invariants in 1311 ms returned sat
[2024-06-01 05:12:44] [INFO ] [Real]Absence check using state equation in 4571 ms returned sat
[2024-06-01 05:12:44] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:12:46] [INFO ] [Nat]Absence check using 0 positive and 1044 generalized place invariants in 1342 ms returned sat
[2024-06-01 05:12:54] [INFO ] [Nat]Absence check using state equation in 8099 ms returned sat
[2024-06-01 05:12:54] [INFO ] Computed and/alt/rep : 216/254/216 causal constraints (skipped 60 transitions) in 21 ms.
[2024-06-01 05:12:55] [INFO ] Added : 124 causal constraints over 25 iterations in 1382 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 20 out of 1337 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 1337/1337 places, 296/296 transitions.
Graph (complete) has 8669 edges and 1337 vertex of which 1317 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.5 ms
Discarding 20 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 1317 transition count 294
Applied a total of 3 rules in 49 ms. Remains 1317 /1337 variables (removed 20) and now considering 294/296 (removed 2) transitions.
// Phase 1: matrix 294 rows 1317 cols
[2024-06-01 05:12:55] [INFO ] Computed 1026 invariants in 70 ms
[2024-06-01 05:12:56] [INFO ] Implicit Places using invariants in 922 ms returned []
[2024-06-01 05:12:56] [INFO ] Invariant cache hit.
[2024-06-01 05:12:57] [INFO ] Implicit Places using invariants and state equation in 1270 ms returned []
Implicit Place search using SMT with State Equation took 2194 ms to find 0 implicit places.
[2024-06-01 05:12:57] [INFO ] Redundant transitions in 21 ms returned []
Running 274 sub problems to find dead transitions.
[2024-06-01 05:12:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1316 variables, 1026/1026 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1316 variables, 0/1026 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 2 (OVERLAPS) 294/1610 variables, 1316/2342 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1610 variables, 0/2342 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 4 (OVERLAPS) 1/1611 variables, 1/2343 constraints. Problems are: Problem set: 0 solved, 274 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1611/1611 variables, and 2343 constraints, problems are : Problem set: 0 solved, 274 unsolved in 30018 ms.
Refiners :[Generalized P Invariants (flows): 1026/1026 constraints, State Equation: 1317/1317 constraints, PredecessorRefiner: 274/274 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 274 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1316 variables, 1026/1026 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1316 variables, 0/1026 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 2 (OVERLAPS) 294/1610 variables, 1316/2342 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1610 variables, 274/2616 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1610 variables, 0/2616 constraints. Problems are: Problem set: 0 solved, 274 unsolved
SMT process timed out in 60326ms, After SMT, problems are : Problem set: 0 solved, 274 unsolved
Search for dead transitions found 0 dead transitions in 60329ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1317/1337 places, 294/296 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 62603 ms. Remains : 1317/1337 places, 294/296 transitions.
Computed a total of 1317 stabilizing places and 294 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1317 transition count 294
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 114 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 74 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 47 steps (0 resets) in 5 ms. (7 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 4 factoid took 115 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 69 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p1), (NOT p1)]
[2024-06-01 05:13:58] [INFO ] Invariant cache hit.
[2024-06-01 05:14:00] [INFO ] [Real]Absence check using 0 positive and 1026 generalized place invariants in 1257 ms returned sat
[2024-06-01 05:14:05] [INFO ] [Real]Absence check using state equation in 4535 ms returned sat
[2024-06-01 05:14:05] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:14:06] [INFO ] [Nat]Absence check using 0 positive and 1026 generalized place invariants in 1269 ms returned sat
[2024-06-01 05:14:12] [INFO ] [Nat]Absence check using state equation in 5501 ms returned sat
[2024-06-01 05:14:12] [INFO ] Computed and/alt/rep : 213/251/213 causal constraints (skipped 61 transitions) in 21 ms.
[2024-06-01 05:14:13] [INFO ] Added : 74 causal constraints over 15 iterations in 894 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 83 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 7250 reset in 279 ms.
Product exploration explored 100000 steps with 7243 reset in 294 ms.
Support contains 20 out of 1317 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1317/1317 places, 294/294 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1316 transition count 292
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1315 transition count 292
Applied a total of 2 rules in 55 ms. Remains 1315 /1317 variables (removed 2) and now considering 292/294 (removed 2) transitions.
// Phase 1: matrix 292 rows 1315 cols
[2024-06-01 05:14:13] [INFO ] Computed 1026 invariants in 71 ms
[2024-06-01 05:14:15] [INFO ] Implicit Places using invariants in 1296 ms returned []
[2024-06-01 05:14:15] [INFO ] Invariant cache hit.
[2024-06-01 05:14:17] [INFO ] Implicit Places using invariants and state equation in 1986 ms returned [1160, 1161, 1162, 1163, 1164, 1165, 1166, 1167, 1168, 1169, 1170, 1171, 1172, 1173, 1174, 1175, 1176, 1177, 1178]
Discarding 19 places :
Implicit Place search using SMT with State Equation took 3285 ms to find 19 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1296/1317 places, 292/294 transitions.
Applied a total of 0 rules in 46 ms. Remains 1296 /1296 variables (removed 0) and now considering 292/292 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3387 ms. Remains : 1296/1317 places, 292/294 transitions.
Treatment of property QuasiCertifProtocol-COL-18-LTLCardinality-08 finished in 164392 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 20 out of 1378 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1378/1378 places, 296/296 transitions.
Graph (complete) has 9223 edges and 1378 vertex of which 119 are kept as prefixes of interest. Removing 1259 places using SCC suffix rule.2 ms
Discarding 1259 places :
Also discarding 118 output transitions
Drop transitions (Output transitions of discarded places.) removed 118 transitions
Ensure Unique test removed 94 transitions
Reduce isomorphic transitions removed 94 transitions.
Iterating post reduction 0 with 94 rules applied. Total rules applied 95 place count 119 transition count 84
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 97 place count 118 transition count 83
Applied a total of 97 rules in 13 ms. Remains 118 /1378 variables (removed 1260) and now considering 83/296 (removed 213) transitions.
// Phase 1: matrix 83 rows 118 cols
[2024-06-01 05:14:17] [INFO ] Computed 36 invariants in 1 ms
[2024-06-01 05:14:17] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-06-01 05:14:17] [INFO ] Invariant cache hit.
[2024-06-01 05:14:17] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
[2024-06-01 05:14:17] [INFO ] Redundant transitions in 15 ms returned []
Running 62 sub problems to find dead transitions.
[2024-06-01 05:14:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/117 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 2 (OVERLAPS) 83/200 variables, 117/153 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/200 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 4 (OVERLAPS) 1/201 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/201 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 6 (OVERLAPS) 0/201 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 62 unsolved
No progress, stopping.
After SMT solving in domain Real declared 201/201 variables, and 154 constraints, problems are : Problem set: 0 solved, 62 unsolved in 1216 ms.
Refiners :[Generalized P Invariants (flows): 36/36 constraints, State Equation: 118/118 constraints, PredecessorRefiner: 62/62 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 62 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/117 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 2 (OVERLAPS) 83/200 variables, 117/153 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/200 variables, 62/215 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 5 (OVERLAPS) 1/201 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/201 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 7 (OVERLAPS) 0/201 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 62 unsolved
No progress, stopping.
After SMT solving in domain Int declared 201/201 variables, and 216 constraints, problems are : Problem set: 0 solved, 62 unsolved in 1604 ms.
Refiners :[Generalized P Invariants (flows): 36/36 constraints, State Equation: 118/118 constraints, PredecessorRefiner: 62/62 constraints, Known Traps: 0/0 constraints]
After SMT, in 2840ms problems are : Problem set: 0 solved, 62 unsolved
Search for dead transitions found 0 dead transitions in 2841ms
Starting structural reductions in SI_LTL mode, iteration 1 : 118/1378 places, 83/296 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3022 ms. Remains : 118/1378 places, 83/296 transitions.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-18-LTLCardinality-10
Product exploration explored 100000 steps with 4320 reset in 247 ms.
Product exploration explored 100000 steps with 4311 reset in 269 ms.
Computed a total of 118 stabilizing places and 83 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 118 transition count 83
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 : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 101 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
RANDOM walk for 29033 steps (1141 resets) in 130 ms. (221 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 109 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Support contains 20 out of 118 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 118/118 places, 83/83 transitions.
Applied a total of 0 rules in 4 ms. Remains 118 /118 variables (removed 0) and now considering 83/83 (removed 0) transitions.
[2024-06-01 05:14:21] [INFO ] Invariant cache hit.
[2024-06-01 05:14:21] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-06-01 05:14:21] [INFO ] Invariant cache hit.
[2024-06-01 05:14:21] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 164 ms to find 0 implicit places.
[2024-06-01 05:14:21] [INFO ] Redundant transitions in 14 ms returned []
Running 62 sub problems to find dead transitions.
[2024-06-01 05:14:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/117 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 2 (OVERLAPS) 83/200 variables, 117/153 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/200 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 4 (OVERLAPS) 1/201 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/201 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 6 (OVERLAPS) 0/201 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 62 unsolved
No progress, stopping.
After SMT solving in domain Real declared 201/201 variables, and 154 constraints, problems are : Problem set: 0 solved, 62 unsolved in 1197 ms.
Refiners :[Generalized P Invariants (flows): 36/36 constraints, State Equation: 118/118 constraints, PredecessorRefiner: 62/62 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 62 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/117 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 2 (OVERLAPS) 83/200 variables, 117/153 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/200 variables, 62/215 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 5 (OVERLAPS) 1/201 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/201 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 7 (OVERLAPS) 0/201 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 62 unsolved
No progress, stopping.
After SMT solving in domain Int declared 201/201 variables, and 216 constraints, problems are : Problem set: 0 solved, 62 unsolved in 1601 ms.
Refiners :[Generalized P Invariants (flows): 36/36 constraints, State Equation: 118/118 constraints, PredecessorRefiner: 62/62 constraints, Known Traps: 0/0 constraints]
After SMT, in 2819ms problems are : Problem set: 0 solved, 62 unsolved
Search for dead transitions found 0 dead transitions in 2819ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 3008 ms. Remains : 118/118 places, 83/83 transitions.
Computed a total of 118 stabilizing places and 83 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 118 transition count 83
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 : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 88 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
RANDOM walk for 40000 steps (1570 resets) in 157 ms. (253 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (68 resets) in 68 ms. (579 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 675 steps, run visited all 1 properties in 6 ms. (steps per millisecond=112 )
Probabilistic random walk after 675 steps, saw 656 distinct states, run finished after 6 ms. (steps per millisecond=112 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 91 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Product exploration explored 100000 steps with 4315 reset in 249 ms.
Product exploration explored 100000 steps with 4314 reset in 268 ms.
Support contains 20 out of 118 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 118/118 places, 83/83 transitions.
Applied a total of 0 rules in 2 ms. Remains 118 /118 variables (removed 0) and now considering 83/83 (removed 0) transitions.
[2024-06-01 05:14:25] [INFO ] Invariant cache hit.
[2024-06-01 05:14:25] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-06-01 05:14:25] [INFO ] Invariant cache hit.
[2024-06-01 05:14:25] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 167 ms to find 0 implicit places.
[2024-06-01 05:14:25] [INFO ] Redundant transitions in 17 ms returned []
Running 62 sub problems to find dead transitions.
[2024-06-01 05:14:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/117 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 2 (OVERLAPS) 83/200 variables, 117/153 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/200 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 4 (OVERLAPS) 1/201 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/201 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 6 (OVERLAPS) 0/201 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 62 unsolved
No progress, stopping.
After SMT solving in domain Real declared 201/201 variables, and 154 constraints, problems are : Problem set: 0 solved, 62 unsolved in 1335 ms.
Refiners :[Generalized P Invariants (flows): 36/36 constraints, State Equation: 118/118 constraints, PredecessorRefiner: 62/62 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 62 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/117 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 2 (OVERLAPS) 83/200 variables, 117/153 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/200 variables, 62/215 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 5 (OVERLAPS) 1/201 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/201 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 7 (OVERLAPS) 0/201 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 62 unsolved
No progress, stopping.
After SMT solving in domain Int declared 201/201 variables, and 216 constraints, problems are : Problem set: 0 solved, 62 unsolved in 1632 ms.
Refiners :[Generalized P Invariants (flows): 36/36 constraints, State Equation: 118/118 constraints, PredecessorRefiner: 62/62 constraints, Known Traps: 0/0 constraints]
After SMT, in 2985ms problems are : Problem set: 0 solved, 62 unsolved
Search for dead transitions found 0 dead transitions in 2986ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 3185 ms. Remains : 118/118 places, 83/83 transitions.
Treatment of property QuasiCertifProtocol-COL-18-LTLCardinality-10 finished in 11265 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||F((p1&&X(p2)&&F(!p2))))))'
Support contains 382 out of 1378 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1378/1378 places, 296/296 transitions.
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 1338 transition count 296
Applied a total of 40 rules in 20 ms. Remains 1338 /1378 variables (removed 40) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 1338 cols
[2024-06-01 05:14:28] [INFO ] Computed 1044 invariants in 19 ms
[2024-06-01 05:14:29] [INFO ] Implicit Places using invariants in 1026 ms returned []
[2024-06-01 05:14:29] [INFO ] Invariant cache hit.
[2024-06-01 05:14:31] [INFO ] Implicit Places using invariants and state equation in 1648 ms returned []
Implicit Place search using SMT with State Equation took 2676 ms to find 0 implicit places.
Running 276 sub problems to find dead transitions.
[2024-06-01 05:14:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1336 variables, 1044/1044 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1336 variables, 0/1044 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 296/1632 variables, 1336/2380 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1632 variables, 0/2380 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 2/1634 variables, 2/2382 constraints. Problems are: Problem set: 0 solved, 276 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1634/1634 variables, and 2382 constraints, problems are : Problem set: 0 solved, 276 unsolved in 30017 ms.
Refiners :[Generalized P Invariants (flows): 1044/1044 constraints, State Equation: 1338/1338 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 276 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1336 variables, 1044/1044 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1336 variables, 0/1044 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 296/1632 variables, 1336/2380 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1632 variables, 143/2523 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1632 variables, 0/2523 constraints. Problems are: Problem set: 0 solved, 276 unsolved
SMT process timed out in 60327ms, After SMT, problems are : Problem set: 0 solved, 276 unsolved
Search for dead transitions found 0 dead transitions in 60332ms
Starting structural reductions in LTL mode, iteration 1 : 1338/1378 places, 296/296 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63030 ms. Remains : 1338/1378 places, 296/296 transitions.
Stuttering acceptance computed with spot in 251 ms :[(NOT p0), true, (NOT p2), p2]
Running random walk in product with property : QuasiCertifProtocol-COL-18-LTLCardinality-11
Stuttering criterion allowed to conclude after 21 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-COL-18-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-18-LTLCardinality-11 finished in 63308 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 19 out of 1378 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1378/1378 places, 296/296 transitions.
Graph (complete) has 9223 edges and 1378 vertex of which 1317 are kept as prefixes of interest. Removing 61 places using SCC suffix rule.3 ms
Discarding 61 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 1314 transition count 291
Applied a total of 5 rules in 66 ms. Remains 1314 /1378 variables (removed 64) and now considering 291/296 (removed 5) transitions.
// Phase 1: matrix 291 rows 1314 cols
[2024-06-01 05:15:31] [INFO ] Computed 1026 invariants in 79 ms
[2024-06-01 05:15:33] [INFO ] Implicit Places using invariants in 1221 ms returned []
[2024-06-01 05:15:33] [INFO ] Invariant cache hit.
[2024-06-01 05:15:39] [INFO ] Implicit Places using invariants and state equation in 6586 ms returned [1160, 1161, 1162, 1163, 1164, 1165, 1166, 1167, 1168, 1169, 1170, 1171, 1172, 1173, 1174, 1175, 1176, 1177, 1178]
Discarding 19 places :
Implicit Place search using SMT with State Equation took 7826 ms to find 19 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1295/1378 places, 291/296 transitions.
Applied a total of 0 rules in 32 ms. Remains 1295 /1295 variables (removed 0) and now considering 291/291 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 7925 ms. Remains : 1295/1378 places, 291/296 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-18-LTLCardinality-12
Stuttering criterion allowed to conclude after 24 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-18-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-18-LTLCardinality-12 finished in 7976 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))))'
Support contains 741 out of 1378 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1378/1378 places, 296/296 transitions.
Reduce places removed 41 places and 0 transitions.
Iterating post reduction 0 with 41 rules applied. Total rules applied 41 place count 1337 transition count 296
Applied a total of 41 rules in 7 ms. Remains 1337 /1378 variables (removed 41) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 1337 cols
[2024-06-01 05:15:39] [INFO ] Computed 1044 invariants in 76 ms
[2024-06-01 05:15:40] [INFO ] Implicit Places using invariants in 740 ms returned []
[2024-06-01 05:15:40] [INFO ] Invariant cache hit.
[2024-06-01 05:15:42] [INFO ] Implicit Places using invariants and state equation in 1452 ms returned []
Implicit Place search using SMT with State Equation took 2194 ms to find 0 implicit places.
Running 276 sub problems to find dead transitions.
[2024-06-01 05:15:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1336 variables, 1044/1044 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1336 variables, 0/1044 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 296/1632 variables, 1336/2380 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1632 variables, 0/2380 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 1/1633 variables, 1/2381 constraints. Problems are: Problem set: 0 solved, 276 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1633/1633 variables, and 2381 constraints, problems are : Problem set: 0 solved, 276 unsolved in 30015 ms.
Refiners :[Generalized P Invariants (flows): 1044/1044 constraints, State Equation: 1337/1337 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 276 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1336 variables, 1044/1044 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1336 variables, 0/1044 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 296/1632 variables, 1336/2380 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1632 variables, 276/2656 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1632 variables, 0/2656 constraints. Problems are: Problem set: 0 solved, 276 unsolved
SMT process timed out in 60284ms, After SMT, problems are : Problem set: 0 solved, 276 unsolved
Search for dead transitions found 0 dead transitions in 60288ms
Starting structural reductions in LTL mode, iteration 1 : 1337/1378 places, 296/296 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62490 ms. Remains : 1337/1378 places, 296/296 transitions.
Stuttering acceptance computed with spot in 119 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : QuasiCertifProtocol-COL-18-LTLCardinality-13
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-18-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-18-LTLCardinality-13 finished in 62630 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((X(F(p1))||p0))))'
Support contains 38 out of 1378 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1378/1378 places, 296/296 transitions.
Graph (complete) has 9223 edges and 1378 vertex of which 1317 are kept as prefixes of interest. Removing 61 places using SCC suffix rule.2 ms
Discarding 61 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 1314 transition count 291
Applied a total of 5 rules in 61 ms. Remains 1314 /1378 variables (removed 64) and now considering 291/296 (removed 5) transitions.
// Phase 1: matrix 291 rows 1314 cols
[2024-06-01 05:16:42] [INFO ] Computed 1026 invariants in 80 ms
[2024-06-01 05:16:43] [INFO ] Implicit Places using invariants in 1212 ms returned []
[2024-06-01 05:16:43] [INFO ] Invariant cache hit.
[2024-06-01 05:16:50] [INFO ] Implicit Places using invariants and state equation in 6733 ms returned [1160, 1161, 1162, 1163, 1164, 1165, 1166, 1167, 1168, 1169, 1170, 1171, 1172, 1173, 1174, 1175, 1176, 1177, 1178]
Discarding 19 places :
Implicit Place search using SMT with State Equation took 7961 ms to find 19 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1295/1378 places, 291/296 transitions.
Applied a total of 0 rules in 30 ms. Remains 1295 /1295 variables (removed 0) and now considering 291/291 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 8052 ms. Remains : 1295/1378 places, 291/296 transitions.
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : QuasiCertifProtocol-COL-18-LTLCardinality-14
Product exploration explored 100000 steps with 4208 reset in 399 ms.
Product exploration explored 100000 steps with 4208 reset in 431 ms.
Computed a total of 1295 stabilizing places and 291 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1295 transition count 291
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)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 8 factoid took 350 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 64 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 40000 steps (1680 resets) in 209 ms. (190 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40004 steps (75 resets) in 56 ms. (701 steps per ms) remains 1/1 properties
// Phase 1: matrix 291 rows 1295 cols
[2024-06-01 05:16:52] [INFO ] Computed 1008 invariants in 120 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 57/76 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 913/989 variables, 742/761 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/989 variables, 324/1085 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/989 variables, 0/1085 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 19/1008 variables, 342/1427 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1008 variables, 19/1446 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1008 variables, 0/1446 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 342/1350 variables, 324/1770 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1350 variables, 342/2112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1350 variables, 0/2112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 152/1502 variables, 95/2207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1502 variables, 0/2207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 80/1582 variables, 76/2283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1582 variables, 18/2301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1582 variables, 0/2301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 4/1586 variables, 2/2303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1586 variables, 0/2303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1586 variables, 0/2303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1586/1586 variables, and 2303 constraints, problems are : Problem set: 0 solved, 1 unsolved in 672 ms.
Refiners :[Generalized P Invariants (flows): 1008/1008 constraints, State Equation: 1295/1295 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/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 57/76 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 913/989 variables, 742/761 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/989 variables, 324/1085 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/989 variables, 1/1086 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/989 variables, 0/1086 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 19/1008 variables, 342/1428 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1008 variables, 19/1447 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1008 variables, 0/1447 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 342/1350 variables, 324/1771 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1350 variables, 342/2113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1350 variables, 0/2113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 152/1502 variables, 95/2208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1502 variables, 0/2208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 80/1582 variables, 76/2284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1582 variables, 18/2302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1582 variables, 0/2302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 4/1586 variables, 2/2304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1586 variables, 0/2304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1586 variables, 0/2304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1586/1586 variables, and 2304 constraints, problems are : Problem set: 0 solved, 1 unsolved in 870 ms.
Refiners :[Generalized P Invariants (flows): 1008/1008 constraints, State Equation: 1295/1295 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1704ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 102 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=51 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 8 factoid took 570 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 57 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-06-01 05:16:54] [INFO ] Invariant cache hit.
[2024-06-01 05:16:56] [INFO ] [Real]Absence check using 0 positive and 1008 generalized place invariants in 958 ms returned sat
[2024-06-01 05:16:59] [INFO ] [Real]Absence check using state equation in 3610 ms returned sat
[2024-06-01 05:16:59] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:17:01] [INFO ] [Nat]Absence check using 0 positive and 1008 generalized place invariants in 942 ms returned sat
[2024-06-01 05:17:05] [INFO ] [Nat]Absence check using state equation in 4057 ms returned sat
[2024-06-01 05:17:05] [INFO ] Computed and/alt/rep : 191/229/191 causal constraints (skipped 61 transitions) in 31 ms.
[2024-06-01 05:17:05] [INFO ] Added : 0 causal constraints over 0 iterations in 142 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 38 out of 1295 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1295/1295 places, 291/291 transitions.
Applied a total of 0 rules in 30 ms. Remains 1295 /1295 variables (removed 0) and now considering 291/291 (removed 0) transitions.
[2024-06-01 05:17:05] [INFO ] Invariant cache hit.
[2024-06-01 05:17:06] [INFO ] Implicit Places using invariants in 1165 ms returned []
[2024-06-01 05:17:06] [INFO ] Invariant cache hit.
[2024-06-01 05:17:13] [INFO ] Implicit Places using invariants and state equation in 6485 ms returned []
Implicit Place search using SMT with State Equation took 7686 ms to find 0 implicit places.
[2024-06-01 05:17:13] [INFO ] Redundant transitions in 19 ms returned []
Running 252 sub problems to find dead transitions.
[2024-06-01 05:17:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1276 variables, 1008/1008 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1276 variables, 0/1008 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (OVERLAPS) 291/1567 variables, 1276/2284 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1567 variables, 0/2284 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 4 (OVERLAPS) 19/1586 variables, 19/2303 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1586 variables, 0/2303 constraints. Problems are: Problem set: 0 solved, 252 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1586/1586 variables, and 2303 constraints, problems are : Problem set: 0 solved, 252 unsolved in 30012 ms.
Refiners :[Generalized P Invariants (flows): 1008/1008 constraints, State Equation: 1295/1295 constraints, PredecessorRefiner: 252/252 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 252 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1276 variables, 1008/1008 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1276 variables, 0/1008 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (OVERLAPS) 291/1567 variables, 1276/2284 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1567 variables, 252/2536 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1567 variables, 0/2536 constraints. Problems are: Problem set: 0 solved, 252 unsolved
SMT process timed out in 60306ms, After SMT, problems are : Problem set: 0 solved, 252 unsolved
Search for dead transitions found 0 dead transitions in 60308ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 68063 ms. Remains : 1295/1295 places, 291/291 transitions.
Computed a total of 1295 stabilizing places and 291 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1295 transition count 291
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)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 8 factoid took 405 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 92 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 40000 steps (1688 resets) in 143 ms. (277 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40004 steps (75 resets) in 46 ms. (851 steps per ms) remains 1/1 properties
[2024-06-01 05:18:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 57/76 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 913/989 variables, 742/761 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/989 variables, 324/1085 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/989 variables, 0/1085 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 19/1008 variables, 342/1427 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1008 variables, 19/1446 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1008 variables, 0/1446 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 342/1350 variables, 324/1770 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1350 variables, 342/2112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1350 variables, 0/2112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 152/1502 variables, 95/2207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1502 variables, 0/2207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 80/1582 variables, 76/2283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1582 variables, 18/2301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1582 variables, 0/2301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 4/1586 variables, 2/2303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1586 variables, 0/2303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1586 variables, 0/2303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1586/1586 variables, and 2303 constraints, problems are : Problem set: 0 solved, 1 unsolved in 745 ms.
Refiners :[Generalized P Invariants (flows): 1008/1008 constraints, State Equation: 1295/1295 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/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 57/76 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 913/989 variables, 742/761 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/989 variables, 324/1085 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/989 variables, 1/1086 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/989 variables, 0/1086 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 19/1008 variables, 342/1428 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1008 variables, 19/1447 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1008 variables, 0/1447 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 342/1350 variables, 324/1771 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1350 variables, 342/2113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1350 variables, 0/2113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 152/1502 variables, 95/2208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1502 variables, 0/2208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 80/1582 variables, 76/2284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1582 variables, 18/2302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1582 variables, 0/2302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 4/1586 variables, 2/2304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1586 variables, 0/2304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1586 variables, 0/2304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1586/1586 variables, and 2304 constraints, problems are : Problem set: 0 solved, 1 unsolved in 951 ms.
Refiners :[Generalized P Invariants (flows): 1008/1008 constraints, State Equation: 1295/1295 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1705ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 102 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=34 )
Parikh walk visited 1 properties in 3 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 8 factoid took 593 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 85 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))]
[2024-06-01 05:18:16] [INFO ] Invariant cache hit.
[2024-06-01 05:18:18] [INFO ] [Real]Absence check using 0 positive and 1008 generalized place invariants in 986 ms returned sat
[2024-06-01 05:18:21] [INFO ] [Real]Absence check using state equation in 3738 ms returned sat
[2024-06-01 05:18:21] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:18:23] [INFO ] [Nat]Absence check using 0 positive and 1008 generalized place invariants in 972 ms returned sat
[2024-06-01 05:18:27] [INFO ] [Nat]Absence check using state equation in 4352 ms returned sat
[2024-06-01 05:18:27] [INFO ] Computed and/alt/rep : 191/229/191 causal constraints (skipped 61 transitions) in 24 ms.
[2024-06-01 05:18:27] [INFO ] Added : 0 causal constraints over 0 iterations in 122 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 4208 reset in 388 ms.
Product exploration explored 100000 steps with 4207 reset in 383 ms.
Support contains 38 out of 1295 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1295/1295 places, 291/291 transitions.
Applied a total of 0 rules in 31 ms. Remains 1295 /1295 variables (removed 0) and now considering 291/291 (removed 0) transitions.
[2024-06-01 05:18:28] [INFO ] Invariant cache hit.
[2024-06-01 05:18:29] [INFO ] Implicit Places using invariants in 1267 ms returned []
[2024-06-01 05:18:29] [INFO ] Invariant cache hit.
[2024-06-01 05:18:36] [INFO ] Implicit Places using invariants and state equation in 6713 ms returned []
Implicit Place search using SMT with State Equation took 7983 ms to find 0 implicit places.
[2024-06-01 05:18:36] [INFO ] Redundant transitions in 21 ms returned []
Running 252 sub problems to find dead transitions.
[2024-06-01 05:18:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1276 variables, 1008/1008 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1276 variables, 0/1008 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (OVERLAPS) 291/1567 variables, 1276/2284 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1567 variables, 0/2284 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 4 (OVERLAPS) 19/1586 variables, 19/2303 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1586 variables, 0/2303 constraints. Problems are: Problem set: 0 solved, 252 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1586/1586 variables, and 2303 constraints, problems are : Problem set: 0 solved, 252 unsolved in 30009 ms.
Refiners :[Generalized P Invariants (flows): 1008/1008 constraints, State Equation: 1295/1295 constraints, PredecessorRefiner: 252/252 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 252 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1276 variables, 1008/1008 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1276 variables, 0/1008 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (OVERLAPS) 291/1567 variables, 1276/2284 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1567 variables, 252/2536 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1567 variables, 0/2536 constraints. Problems are: Problem set: 0 solved, 252 unsolved
SMT process timed out in 60324ms, After SMT, problems are : Problem set: 0 solved, 252 unsolved
Search for dead transitions found 0 dead transitions in 60328ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 68368 ms. Remains : 1295/1295 places, 291/291 transitions.
Treatment of property QuasiCertifProtocol-COL-18-LTLCardinality-14 finished in 174608 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) U p1)))'
Support contains 382 out of 1378 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1378/1378 places, 296/296 transitions.
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 1338 transition count 296
Applied a total of 40 rules in 17 ms. Remains 1338 /1378 variables (removed 40) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 1338 cols
[2024-06-01 05:19:37] [INFO ] Computed 1044 invariants in 20 ms
[2024-06-01 05:19:37] [INFO ] Implicit Places using invariants in 889 ms returned []
[2024-06-01 05:19:37] [INFO ] Invariant cache hit.
[2024-06-01 05:19:41] [INFO ] Implicit Places using invariants and state equation in 3650 ms returned []
Implicit Place search using SMT with State Equation took 4553 ms to find 0 implicit places.
Running 276 sub problems to find dead transitions.
[2024-06-01 05:19:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1336 variables, 1044/1044 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1336 variables, 0/1044 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 296/1632 variables, 1336/2380 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1632 variables, 0/2380 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 2/1634 variables, 2/2382 constraints. Problems are: Problem set: 0 solved, 276 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 10.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1634/1634 variables, and 2382 constraints, problems are : Problem set: 0 solved, 276 unsolved in 30015 ms.
Refiners :[Generalized P Invariants (flows): 1044/1044 constraints, State Equation: 1338/1338 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 276 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1336 variables, 1044/1044 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1336 variables, 0/1044 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 296/1632 variables, 1336/2380 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1632 variables, 48/2428 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1632 variables, 0/2428 constraints. Problems are: Problem set: 0 solved, 276 unsolved
SMT process timed out in 60336ms, After SMT, problems are : Problem set: 0 solved, 276 unsolved
Search for dead transitions found 0 dead transitions in 60339ms
Starting structural reductions in LTL mode, iteration 1 : 1338/1378 places, 296/296 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64911 ms. Remains : 1338/1378 places, 296/296 transitions.
Stuttering acceptance computed with spot in 151 ms :[(NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-18-LTLCardinality-15
Product exploration explored 100000 steps with 50000 reset in 338 ms.
Product exploration explored 100000 steps with 50000 reset in 348 ms.
Computed a total of 1338 stabilizing places and 296 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1338 transition count 296
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (X (X (NOT p1)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 20 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-COL-18-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-18-LTLCardinality-15 finished in 66014 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))))'
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 X(X(G((p0||X(G((F(G(p1)) U p2)))))))))'
Found a Lengthening insensitive property : QuasiCertifProtocol-COL-18-LTLCardinality-04
Stuttering acceptance computed with spot in 538 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p1), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 59 out of 1378 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1378/1378 places, 296/296 transitions.
Graph (complete) has 9223 edges and 1378 vertex of which 1357 are kept as prefixes of interest. Removing 21 places using SCC suffix rule.6 ms
Discarding 21 places :
Also discarding 0 output 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 1355 transition count 294
Applied a total of 5 rules in 70 ms. Remains 1355 /1378 variables (removed 23) and now considering 294/296 (removed 2) transitions.
// Phase 1: matrix 294 rows 1355 cols
[2024-06-01 05:20:44] [INFO ] Computed 1062 invariants in 31 ms
[2024-06-01 05:20:45] [INFO ] Implicit Places using invariants in 1232 ms returned []
[2024-06-01 05:20:45] [INFO ] Invariant cache hit.
[2024-06-01 05:20:51] [INFO ] Implicit Places using invariants and state equation in 6091 ms returned []
Implicit Place search using SMT with State Equation took 7329 ms to find 0 implicit places.
Running 274 sub problems to find dead transitions.
[2024-06-01 05:20:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1334 variables, 720/720 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1334 variables, 0/720 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 2 (OVERLAPS) 19/1353 variables, 342/1062 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1353 variables, 0/1062 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 4 (OVERLAPS) 294/1647 variables, 1353/2415 constraints. Problems are: Problem set: 0 solved, 274 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1647/1649 variables, and 2415 constraints, problems are : Problem set: 0 solved, 274 unsolved in 30016 ms.
Refiners :[Generalized P Invariants (flows): 1062/1062 constraints, State Equation: 1353/1355 constraints, PredecessorRefiner: 274/274 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 274 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1334 variables, 720/720 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1334 variables, 0/720 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 2 (OVERLAPS) 19/1353 variables, 342/1062 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1353 variables, 0/1062 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 4 (OVERLAPS) 294/1647 variables, 1353/2415 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1647 variables, 272/2687 constraints. Problems are: Problem set: 0 solved, 274 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1647/1649 variables, and 2687 constraints, problems are : Problem set: 0 solved, 274 unsolved in 30013 ms.
Refiners :[Generalized P Invariants (flows): 1062/1062 constraints, State Equation: 1353/1355 constraints, PredecessorRefiner: 272/274 constraints, Known Traps: 0/0 constraints]
After SMT, in 60338ms problems are : Problem set: 0 solved, 274 unsolved
Search for dead transitions found 0 dead transitions in 60343ms
Starting structural reductions in LI_LTL mode, iteration 1 : 1355/1378 places, 294/296 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 67743 ms. Remains : 1355/1378 places, 294/296 transitions.
Running random walk in product with property : QuasiCertifProtocol-COL-18-LTLCardinality-04
Product exploration explored 100000 steps with 4419 reset in 253 ms.
Product exploration explored 100000 steps with 4418 reset in 271 ms.
Computed a total of 1355 stabilizing places and 294 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1355 transition count 294
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) p2 p1), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (G p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 285 ms. Reduced automaton from 11 states, 22 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(NOT p2), (NOT p2)]
RANDOM walk for 40000 steps (1767 resets) in 117 ms. (338 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (172 resets) in 36 ms. (1081 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 653 steps, run visited all 1 properties in 5 ms. (steps per millisecond=130 )
Probabilistic random walk after 653 steps, saw 634 distinct states, run finished after 5 ms. (steps per millisecond=130 ) properties seen :1
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (G p1))]
False Knowledge obtained : [(F (NOT p2))]
Knowledge based reduction with 6 factoid took 261 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 87 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 79 ms :[(NOT p2), (NOT p2)]
Support contains 20 out of 1355 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 1355/1355 places, 294/294 transitions.
Applied a total of 0 rules in 39 ms. Remains 1355 /1355 variables (removed 0) and now considering 294/294 (removed 0) transitions.
[2024-06-01 05:21:53] [INFO ] Invariant cache hit.
[2024-06-01 05:21:54] [INFO ] Implicit Places using invariants in 1176 ms returned []
[2024-06-01 05:21:54] [INFO ] Invariant cache hit.
[2024-06-01 05:22:00] [INFO ] Implicit Places using invariants and state equation in 5818 ms returned []
Implicit Place search using SMT with State Equation took 6995 ms to find 0 implicit places.
[2024-06-01 05:22:00] [INFO ] Redundant transitions in 24 ms returned []
Running 274 sub problems to find dead transitions.
[2024-06-01 05:22:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1334 variables, 720/720 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1334 variables, 0/720 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 2 (OVERLAPS) 19/1353 variables, 342/1062 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1353 variables, 0/1062 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 4 (OVERLAPS) 294/1647 variables, 1353/2415 constraints. Problems are: Problem set: 0 solved, 274 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1647/1649 variables, and 2415 constraints, problems are : Problem set: 0 solved, 274 unsolved in 30020 ms.
Refiners :[Generalized P Invariants (flows): 1062/1062 constraints, State Equation: 1353/1355 constraints, PredecessorRefiner: 274/274 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 274 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1334 variables, 720/720 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1334 variables, 0/720 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 2 (OVERLAPS) 19/1353 variables, 342/1062 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1353 variables, 0/1062 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 4 (OVERLAPS) 294/1647 variables, 1353/2415 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1647 variables, 272/2687 constraints. Problems are: Problem set: 0 solved, 274 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1647/1649 variables, and 2687 constraints, problems are : Problem set: 0 solved, 274 unsolved in 30019 ms.
Refiners :[Generalized P Invariants (flows): 1062/1062 constraints, State Equation: 1353/1355 constraints, PredecessorRefiner: 272/274 constraints, Known Traps: 0/0 constraints]
After SMT, in 60321ms problems are : Problem set: 0 solved, 274 unsolved
Search for dead transitions found 0 dead transitions in 60324ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 67389 ms. Remains : 1355/1355 places, 294/294 transitions.
Computed a total of 1355 stabilizing places and 294 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1355 transition count 294
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 : [p2, (X p2), (X (X p2)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 90 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 65 ms :[(NOT p2), (NOT p2)]
RANDOM walk for 40000 steps (1769 resets) in 132 ms. (300 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (172 resets) in 44 ms. (888 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 653 steps, run visited all 1 properties in 5 ms. (steps per millisecond=130 )
Probabilistic random walk after 653 steps, saw 634 distinct states, run finished after 6 ms. (steps per millisecond=108 ) properties seen :1
Knowledge obtained : [p2, (X p2), (X (X p2)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT p2))]
Knowledge based reduction with 4 factoid took 130 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 78 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 107 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 57 ms :[(NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 4420 reset in 222 ms.
Product exploration explored 100000 steps with 4414 reset in 237 ms.
Support contains 20 out of 1355 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1355/1355 places, 294/294 transitions.
Graph (complete) has 9428 edges and 1355 vertex of which 1315 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.2 ms
Discarding 40 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Applied a total of 1 rules in 33 ms. Remains 1315 /1355 variables (removed 40) and now considering 292/294 (removed 2) transitions.
// Phase 1: matrix 292 rows 1315 cols
[2024-06-01 05:23:02] [INFO ] Computed 1026 invariants in 62 ms
[2024-06-01 05:23:03] [INFO ] Implicit Places using invariants in 1227 ms returned []
[2024-06-01 05:23:03] [INFO ] Invariant cache hit.
[2024-06-01 05:23:08] [INFO ] Implicit Places using invariants and state equation in 4829 ms returned []
Implicit Place search using SMT with State Equation took 6063 ms to find 0 implicit places.
[2024-06-01 05:23:08] [INFO ] Redundant transitions in 26 ms returned []
Running 272 sub problems to find dead transitions.
[2024-06-01 05:23:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1314 variables, 1026/1026 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1314 variables, 0/1026 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 2 (OVERLAPS) 292/1606 variables, 1314/2340 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1606 variables, 0/2340 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 4 (OVERLAPS) 1/1607 variables, 1/2341 constraints. Problems are: Problem set: 0 solved, 272 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1607/1607 variables, and 2341 constraints, problems are : Problem set: 0 solved, 272 unsolved in 30018 ms.
Refiners :[Generalized P Invariants (flows): 1026/1026 constraints, State Equation: 1315/1315 constraints, PredecessorRefiner: 272/272 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 272 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1314 variables, 1026/1026 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1314 variables, 0/1026 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 2 (OVERLAPS) 292/1606 variables, 1314/2340 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1606 variables, 272/2612 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1606 variables, 0/2612 constraints. Problems are: Problem set: 0 solved, 272 unsolved
SMT process timed out in 60288ms, After SMT, problems are : Problem set: 0 solved, 272 unsolved
Search for dead transitions found 0 dead transitions in 60291ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1315/1355 places, 292/294 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 66421 ms. Remains : 1315/1355 places, 292/294 transitions.
Treatment of property QuasiCertifProtocol-COL-18-LTLCardinality-04 finished in 205149 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)&&X(p1)))||(F(p1)&&F(p2))))'
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)))'
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((X(F(p1))||p0))))'
[2024-06-01 05:24:08] [INFO ] Flatten gal took : 46 ms
[2024-06-01 05:24:08] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2024-06-01 05:24:08] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1378 places, 296 transitions and 3095 arcs took 7 ms.
Total runtime 1419461 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA QuasiCertifProtocol-COL-18-LTLCardinality-02 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : QuasiCertifProtocol-COL-18-LTLCardinality-04
Could not compute solution for formula : QuasiCertifProtocol-COL-18-LTLCardinality-08
Could not compute solution for formula : QuasiCertifProtocol-COL-18-LTLCardinality-10
Could not compute solution for formula : QuasiCertifProtocol-COL-18-LTLCardinality-14

BK_STOP 1717219629478

--------------------
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-18-LTLCardinality-02
ltl formula formula --ltl=/tmp/2057/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 1378 places, 296 transitions and 3095 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.040 real 0.000 user 0.020 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2057/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2057/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2057/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2057/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): There are 1338 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 1379, there are 304 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( 3/ 4): ~12 levels ~10000 states ~22936 transitions
pnml2lts-mc( 1/ 4): ~12 levels ~20000 states ~51304 transitions
pnml2lts-mc( 2/ 4): ~12 levels ~40000 states ~106436 transitions
pnml2lts-mc( 3/ 4): ~12 levels ~80000 states ~253896 transitions
pnml2lts-mc( 3/ 4): ~12 levels ~160000 states ~554164 transitions
pnml2lts-mc( 3/ 4): ~12 levels ~320000 states ~1255680 transitions
pnml2lts-mc( 3/ 4): ~12 levels ~640000 states ~2824168 transitions
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: 709044
pnml2lts-mc( 0/ 4): unique states count: 709044
pnml2lts-mc( 0/ 4): unique transitions count: 3306780
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 2598209
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 709224
pnml2lts-mc( 0/ 4): - cum. max stack depth: 48
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 709224 states 3308813 transitions, fanout: 4.665
pnml2lts-mc( 0/ 4): Total exploration time 12.060 sec (12.060 sec minimum, 12.060 sec on average)
pnml2lts-mc( 0/ 4): States per second: 58808, Transitions per second: 274363
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 35.2MB, 52.0 B/state, compr.: 0.9%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 2.0%/46.0%
pnml2lts-mc( 0/ 4): Stored 299 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 35.2MB (~256.0MB paged-in)
ltl formula name QuasiCertifProtocol-COL-18-LTLCardinality-04
ltl formula formula --ltl=/tmp/2057/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1378 places, 296 transitions and 3095 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.040 real 0.020 user 0.010 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2057/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2057/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2057/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2057/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 12 states
pnml2lts-mc( 0/ 4): There are 1338 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 1379, there are 320 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( 3/ 4): ~22 levels ~10000 states ~49100 transitions
pnml2lts-mc( 3/ 4): ~22 levels ~20000 states ~99544 transitions
pnml2lts-mc( 3/ 4): ~23 levels ~40000 states ~204632 transitions
pnml2lts-mc( 2/ 4): ~25 levels ~80000 states ~407304 transitions
pnml2lts-mc( 3/ 4): ~23 levels ~160000 states ~932660 transitions
pnml2lts-mc( 3/ 4): ~23 levels ~320000 states ~1905092 transitions
pnml2lts-mc( 3/ 4): ~24 levels ~640000 states ~3910364 transitions
pnml2lts-mc( 2/ 4): ~25 levels ~1280000 states ~8298360 transitions
pnml2lts-mc( 2/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 2204261
pnml2lts-mc( 0/ 4): unique states count: 2204335
pnml2lts-mc( 0/ 4): unique transitions count: 15110858
pnml2lts-mc( 0/ 4): - self-loop count: 8775
pnml2lts-mc( 0/ 4): - claim dead count: 12896492
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 2204338
pnml2lts-mc( 0/ 4): - cum. max stack depth: 107
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 2204338 states 15110917 transitions, fanout: 6.855
pnml2lts-mc( 0/ 4): Total exploration time 38.660 sec (38.640 sec minimum, 38.647 sec on average)
pnml2lts-mc( 0/ 4): States per second: 57019, Transitions per second: 390867
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 80.8MB, 38.4 B/state, compr.: 0.7%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 6.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 299 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 80.8MB (~256.0MB paged-in)
ltl formula name QuasiCertifProtocol-COL-18-LTLCardinality-08
ltl formula formula --ltl=/tmp/2057/ltl_2_
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 1378 places, 296 transitions and 3095 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.040 real 0.010 user 0.020 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2057/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2057/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2057/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2057/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 11 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 1339 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 1379, there are 320 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( 1/ 4): ~23 levels ~10000 states ~13480 transitions
pnml2lts-mc( 1/ 4): ~23 levels ~20000 states ~26892 transitions
pnml2lts-mc( 1/ 4): ~23 levels ~40000 states ~54640 transitions
pnml2lts-mc( 1/ 4): ~23 levels ~80000 states ~111960 transitions
pnml2lts-mc( 1/ 4): ~23 levels ~160000 states ~228788 transitions
pnml2lts-mc( 1/ 4): ~23 levels ~320000 states ~479212 transitions
pnml2lts-mc( 1/ 4): ~24 levels ~640000 states ~1305084 transitions
pnml2lts-mc( 1/ 4): ~24 levels ~1280000 states ~3347096 transitions
pnml2lts-mc( 1/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 2227325
pnml2lts-mc( 0/ 4): unique states count: 2227394
pnml2lts-mc( 0/ 4): unique transitions count: 7209139
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 4980663
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 2227397
pnml2lts-mc( 0/ 4): - cum. max stack depth: 100
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 2227397 states 7209195 transitions, fanout: 3.237
pnml2lts-mc( 0/ 4): Total exploration time 49.900 sec (49.810 sec minimum, 49.850 sec on average)
pnml2lts-mc( 0/ 4): States per second: 44637, Transitions per second: 144473
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 81.0MB, 38.1 B/state, compr.: 0.7%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 6.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 299 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 81.0MB (~256.0MB paged-in)
ltl formula name QuasiCertifProtocol-COL-18-LTLCardinality-10
ltl formula formula --ltl=/tmp/2057/ltl_3_
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 1378 places, 296 transitions and 3095 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.040 real 0.010 user 0.010 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2057/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2057/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2057/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2057/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): There are 1338 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 1379, there are 300 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( 3/ 4): ~23 levels ~10000 states ~44652 transitions
pnml2lts-mc( 1/ 4): ~23 levels ~20000 states ~96376 transitions
pnml2lts-mc( 0/ 4): ~23 levels ~40000 states ~199076 transitions
pnml2lts-mc( 0/ 4): ~23 levels ~80000 states ~456632 transitions
pnml2lts-mc( 0/ 4): ~23 levels ~160000 states ~929656 transitions
pnml2lts-mc( 0/ 4): ~23 levels ~320000 states ~1903512 transitions
pnml2lts-mc( 3/ 4): ~24 levels ~640000 states ~4141732 transitions
pnml2lts-mc( 0/ 4): ~24 levels ~1280000 states ~8660280 transitions
pnml2lts-mc( 3/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 2202619
pnml2lts-mc( 0/ 4): unique states count: 2202689
pnml2lts-mc( 0/ 4): unique transitions count: 15169066
pnml2lts-mc( 0/ 4): - self-loop count: 2496
pnml2lts-mc( 0/ 4): - claim dead count: 12963007
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 2202692
pnml2lts-mc( 0/ 4): - cum. max stack depth: 98
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 2202692 states 15169127 transitions, fanout: 6.887
pnml2lts-mc( 0/ 4): Total exploration time 38.350 sec (38.320 sec minimum, 38.333 sec on average)
pnml2lts-mc( 0/ 4): States per second: 57437, Transitions per second: 395544
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 80.8MB, 38.5 B/state, compr.: 0.7%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 6.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 299 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 80.8MB (~256.0MB paged-in)
ltl formula name QuasiCertifProtocol-COL-18-LTLCardinality-14
ltl formula formula --ltl=/tmp/2057/ltl_4_
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 1378 places, 296 transitions and 3095 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.030 real 0.010 user 0.020 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2057/ltl_4_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2057/ltl_4_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2057/ltl_4_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2057/ltl_4_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): There are 1338 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 1379, there are 302 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): ~23 levels ~10000 states ~44288 transitions
pnml2lts-mc( 1/ 4): ~23 levels ~20000 states ~95716 transitions
pnml2lts-mc( 1/ 4): ~23 levels ~40000 states ~206840 transitions
pnml2lts-mc( 1/ 4): ~23 levels ~80000 states ~462488 transitions
pnml2lts-mc( 1/ 4): ~23 levels ~160000 states ~944976 transitions
pnml2lts-mc( 1/ 4): ~23 levels ~320000 states ~1942224 transitions
pnml2lts-mc( 1/ 4): ~24 levels ~640000 states ~4014984 transitions
pnml2lts-mc( 2/ 4): ~24 levels ~1280000 states ~8916496 transitions
pnml2lts-mc( 3/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 2178016
pnml2lts-mc( 0/ 4): unique states count: 2178082
pnml2lts-mc( 0/ 4): unique transitions count: 14952176
pnml2lts-mc( 0/ 4): - self-loop count: 4525
pnml2lts-mc( 0/ 4): - claim dead count: 12768665
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 2178087
pnml2lts-mc( 0/ 4): - cum. max stack depth: 100
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 2178087 states 14952333 transitions, fanout: 6.865
pnml2lts-mc( 0/ 4): Total exploration time 37.890 sec (37.850 sec minimum, 37.872 sec on average)
pnml2lts-mc( 0/ 4): States per second: 57484, Transitions per second: 394625
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 80.6MB, 38.8 B/state, compr.: 0.7%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 6.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 299 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 80.6MB (~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-18"
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-18, 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-171662337700027"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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