MCC'2025- Execution of r156-tall-174881254600772

About the Execution of ITS-Tools for QuasiCertifProtocol-COL-32

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
0.000	908681.00	0.00	0.00	FTFTFTTTTTFFFFFF	normal

Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r156-tall-174881254600772.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is QuasiCertifProtocol-COL-32, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r156-tall-174881254600772
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 628K
-rw-r--r-- 1 mcc users 6.9K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 153K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 86K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_pt
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 5 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 131K May 29 14:32 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME QuasiCertifProtocol-COL-32-LTLFireability-00
FORMULA_NAME QuasiCertifProtocol-COL-32-LTLFireability-01
FORMULA_NAME QuasiCertifProtocol-COL-32-LTLFireability-02
FORMULA_NAME QuasiCertifProtocol-COL-32-LTLFireability-03
FORMULA_NAME QuasiCertifProtocol-COL-32-LTLFireability-04
FORMULA_NAME QuasiCertifProtocol-COL-32-LTLFireability-05
FORMULA_NAME QuasiCertifProtocol-COL-32-LTLFireability-06
FORMULA_NAME QuasiCertifProtocol-COL-32-LTLFireability-07
FORMULA_NAME QuasiCertifProtocol-COL-32-LTLFireability-08
FORMULA_NAME QuasiCertifProtocol-COL-32-LTLFireability-09
FORMULA_NAME QuasiCertifProtocol-COL-32-LTLFireability-10
FORMULA_NAME QuasiCertifProtocol-COL-32-LTLFireability-11
FORMULA_NAME QuasiCertifProtocol-COL-32-LTLFireability-12
FORMULA_NAME QuasiCertifProtocol-COL-32-LTLFireability-13
FORMULA_NAME QuasiCertifProtocol-COL-32-LTLFireability-14
FORMULA_NAME QuasiCertifProtocol-COL-32-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1749138293931

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-COL-32
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
LTLFireability COL
Running Version 202505121319
[2025-06-05 15:44:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-05 15:44:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-05 15:44:55] [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.
[2025-06-05 15:44:55] [WARNING] Using fallBack plugin, rng conformance not checked
[2025-06-05 15:44:55] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 622 ms
[2025-06-05 15:44:55] [INFO ] Imported 30 HL places and 26 HL transitions for a total of 3806 PT places and 506.0 transition bindings in 26 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2025-06-05 15:44:56] [INFO ] Built PT skeleton of HLPN with 30 places and 26 transitions 77 arcs in 5 ms.
[2025-06-05 15:44:56] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 4 formulas.
FORMULA QuasiCertifProtocol-COL-32-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-32-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-32-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-32-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 30 stabilizing places and 26 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 30 transition count 26
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Remains 7 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 40053 steps (911 resets) in 388 ms. (102 steps per ms) remains 1/12 properties
BEST_FIRST walk for 40004 steps (242 resets) in 82 ms. (481 steps per ms) remains 1/1 properties
// Phase 1: matrix 26 rows 30 cols
[2025-06-05 15:44:56] [INFO ] Computed 5 invariants in 5 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 10/12 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/14 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 15/29 variables, 14/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/29 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 14/43 variables, 8/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/43 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 12/55 variables, 7/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/55 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/56 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/56 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/56 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/56 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 56/56 variables, and 35 constraints, problems are : Problem set: 0 solved, 1 unsolved in 190 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 10/12 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/14 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 15/29 variables, 14/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/29 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 14/43 variables, 8/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/43 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/43 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 12/55 variables, 7/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/55 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/56 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/56 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/56 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/56 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 56/56 variables, and 36 constraints, problems are : Problem set: 0 solved, 1 unsolved in 102 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 327ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 73 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=73 )
Parikh walk visited 1 properties in 5 ms.
[2025-06-05 15:44:56] [INFO ] Flatten gal took : 16 ms
[2025-06-05 15:44:56] [INFO ] Flatten gal took : 5 ms
Domain [tsid(33), tsid(33)] of place n9 breaks symmetries in sort tsid
[2025-06-05 15:44:56] [INFO ] Unfolded HLPN to a Petri net with 3806 places and 506 transitions 8173 arcs in 30 ms.
[2025-06-05 15:44:56] [INFO ] Unfolded 12 HLPN properties in 1 ms.
Support contains 336 out of 3806 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3806/3806 places, 506/506 transitions.
Reduce places removed 70 places and 0 transitions.
Iterating post reduction 0 with 70 rules applied. Total rules applied 70 place count 3736 transition count 506
Applied a total of 70 rules in 458 ms. Remains 3736 /3806 variables (removed 70) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3736 cols
[2025-06-05 15:44:57] [INFO ] Computed 3232 invariants in 160 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:45:03] [INFO ] Implicit Places using invariants in 6509 ms returned []
[2025-06-05 15:45:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:45:14] [INFO ] Implicit Places using invariants and state equation in 10941 ms returned [3499, 3500, 3501, 3502, 3503, 3504, 3505, 3506, 3507, 3508, 3509, 3510, 3511, 3512, 3513, 3514, 3515, 3516, 3517, 3518, 3519, 3520, 3521, 3522, 3523, 3524, 3525, 3526, 3527, 3528, 3529, 3530, 3531]
Discarding 33 places :
Implicit Place search using SMT with State Equation took 17475 ms to find 33 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3703/3806 places, 506/506 transitions.
Applied a total of 0 rules in 182 ms. Remains 3703 /3703 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 18121 ms. Remains : 3703/3806 places, 506/506 transitions.
Support contains 336 out of 3703 places after structural reductions.
[2025-06-05 15:45:15] [INFO ] Flatten gal took : 254 ms
[2025-06-05 15:45:15] [INFO ] Flatten gal took : 212 ms
[2025-06-05 15:45:15] [INFO ] Input system was already deterministic with 506 transitions.
Reduction of identical properties reduced properties to check from 20 to 19
RANDOM walk for 40000 steps (1066 resets) in 2526 ms. (15 steps per ms) remains 15/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 92 ms. (43 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 84 ms. (47 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 77 ms. (51 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 15/15 properties
// Phase 1: matrix 506 rows 3703 cols
[2025-06-05 15:45:17] [INFO ] Computed 3200 invariants in 497 ms
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp14 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/269 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 66/335 variables, 64/64 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/335 variables, 0/64 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 504/839 variables, 335/399 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/839 variables, 0/399 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 3369/4208 variables, 3367/3766 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4208 variables, 3136/6902 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4208 variables, 0/6902 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 1/4209 variables, 1/6903 constraints. Problems are: Problem set: 2 solved, 13 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 4209/4209 variables, and 6903 constraints, problems are : Problem set: 2 solved, 13 unsolved in 5010 ms.
Refiners :[Generalized P Invariants (flows): 3200/3200 constraints, State Equation: 3703/3703 constraints, PredecessorRefiner: 14/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 13 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 66/302 variables, 64/64 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/302 variables, 0/64 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 471/773 variables, 302/366 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/773 variables, 5/371 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/773 variables, 0/371 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 6 (OVERLAPS) 3402/4175 variables, 3367/3738 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4175 variables, 3104/6842 constraints. Problems are: Problem set: 2 solved, 13 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4175/4209 variables, and 6842 constraints, problems are : Problem set: 2 solved, 13 unsolved in 5011 ms.
Refiners :[Generalized P Invariants (flows): 3168/3200 constraints, State Equation: 3669/3703 constraints, PredecessorRefiner: 13/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10604ms problems are : Problem set: 2 solved, 13 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 236 out of 3703 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3703/3703 places, 506/506 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 3703 transition count 505
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 3702 transition count 504
Applied a total of 2 rules in 915 ms. Remains 3702 /3703 variables (removed 1) and now considering 504/506 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 916 ms. Remains : 3702/3703 places, 504/506 transitions.
RANDOM walk for 40000 steps (1008 resets) in 1323 ms. (30 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (24 resets) in 270 ms. (147 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (24 resets) in 186 ms. (213 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (24 resets) in 98 ms. (404 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (26 resets) in 97 ms. (408 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (26 resets) in 59 ms. (666 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (24 resets) in 107 ms. (370 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (24 resets) in 65 ms. (606 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (25 resets) in 106 ms. (373 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (27 resets) in 60 ms. (655 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (24 resets) in 73 ms. (540 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (24 resets) in 178 ms. (223 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (24 resets) in 182 ms. (218 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (24 resets) in 147 ms. (270 steps per ms) remains 13/13 properties
Finished probabilistic random walk after 9287 steps, run visited all 13 properties in 212 ms. (steps per millisecond=43 )
Probabilistic random walk after 9287 steps, saw 9119 distinct states, run finished after 217 ms. (steps per millisecond=42 ) properties seen :13
FORMULA QuasiCertifProtocol-COL-32-LTLFireability-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 11 simplifications.
Computed a total of 3703 stabilizing places and 506 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3703 transition count 506
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X((X((F(!p1)||X(!p2))) U (p0&&X((F(!p1)||X(!p2)))))))))'
Support contains 133 out of 3703 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3703/3703 places, 506/506 transitions.
Applied a total of 0 rules in 277 ms. Remains 3703 /3703 variables (removed 0) and now considering 506/506 (removed 0) transitions.
[2025-06-05 15:45:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:45:36] [INFO ] Implicit Places using invariants in 6379 ms returned []
[2025-06-05 15:45:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:45:58] [INFO ] Implicit Places using invariants and state equation in 21975 ms returned []
Implicit Place search using SMT with State Equation took 28360 ms to find 0 implicit places.
Running 472 sub problems to find dead transitions.
[2025-06-05 15:45:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3702 variables, 3200/3200 constraints. Problems are: Problem set: 0 solved, 472 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.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 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 1.0)
(s565 1.0)
(s566 1.0)
(s567 1.0)
(s568 1.0)
(s569 1.0)
(s570 1.0)
(s571 1.0)
(s572 1.0)
(s573 1.0)
(s574 1.0)
(s575 1.0)
(s576 1.0)
(s577 1.0)
(s578 1.0)
(s579 1.0)
(s580 1.0)
(s581 1.0)
(s582 1.0)
(s583 1.0)
(s584 1.0)
(s585 1.0)
(s586 1.0)
(s587 1.0)
(s588 1.0)
(s589 1.0)
(s590 1.0)
(s591 1.0)
(s592 1.0)
(s593 1.0)
(s594 1.0)
(s595 1.0)
(s596 1.0)
(s597 1.0)
(s598 1.0)
(s599 1.0)
(s600 1.0)
(s601 1.0)
(s602 1.0)
(s603 1.0)
(s604 1.0)
(s605 1.0)
(s606 1.0)
(s607 1.0)
(s608 1.0)
(s609 1.0)
(s610 1.0)
(s611 1.0)
(s612 1.0)
(s613 1.0)
(s614 1.0)
(s615 1.0)
(s616 1.0)
(s617 1.0)
(s618 1.0)
(s619 1.0)
(s620 1.0)
(s621 1.0)
(s622 1.0)
(s623 1.0)
(s624 1.0)
(s625 1.0)
(s626 1.0)
(s627 1.0)
(s628 1.0)
(s629 1.0)
(s630 1.0)
(s631 1.0)
(s632 1.0)
(s633 1.0)
(s634 1.0)
(s635 1.0)
(s636 1.0)
(s637 1.0)
(s638 1.0)
(s639 1.0)
(s640 1.0)
(s641 1.0)
(s642 1.0)
(s643 1.0)
(s644 1.0)
(s645 1.0)
(s646 1.0)
(s647 1.0)
(s648 1.0)
(s649 1.0)
(s650 1.0)
(s651 1.0)
(s652 1.0)
(s653 1.0)
(s654 1.0)
(s655 1.0)
(s656 1.0)
(s657 1.0)
(s658 1.0)
(s659 1.0)
(s660 1.0)
(s661 1.0)
(s662 1.0)
(s663 1.0)
(s664 1.0)
(s665 1.0)
(s666 1.0)
(s667 1.0)
(s668 1.0)
(s669 1.0)
(s670 1.0)
(s671 1.0)
(s672 1.0)
(s673 1.0)
(s674 1.0)
(s675 1.0)
(s676 1.0)
(s677 1.0)
(s678 1.0)
(s679 1.0)
(s680 1.0)
(s681 1.0)
(s682 1.0)
(s683 1.0)
(s684 1.0)
(s685 1.0)
(s686 1.0)
(s687 1.0)
(s688 1.0)
(s689 1.0)
(s690 1.0)
(s691 1.0)
(s692 1.0)
(s693 1.0)
(s694 1.0)
(s695 1.0)
(s696 1.0)
(s697 1.0)
(s698 1.0)
(s699 1.0)
(s700 1.0)
(s701 1.0)
(s702 1.0)
(s703 1.0)
(s704 1.0)
(s705 1.0)
(s706 1.0)
(s707 1.0)
(s708 1.0)
(s709 1.0)
(s710 1.0)
(s711 1.0)
(s712 1.0)
(s713 1.0)
(s714 1.0)
(s715 1.0)
(s716 1.0)
(s717 1.0)
(s718 1.0)
(s719 1.0)
(s720 1.0)
(s721 1.0)
(s722 1.0)
(s723 1.0)
(s724 1.0)
(s725 1.0)
(s726 1.0)
(s727 1.0)
(s728 1.0)
(s729 1.0)
(s730 1.0)
(s731 1.0)
(s732 1.0)
(s733 1.0)
(s734 1.0)
(s735 1.0)
(s736 1.0)
(s737 1.0)
(s738 1.0)
(s739 1.0)
(s740 1.0)
(s741 1.0)
(s742 1.0)
(s743 1.0)
(s744 1.0)
(s745 1.0)
(s746 1.0)
(s747 1.0)
(s748 1.0)
(s749 1.0)
(s750 1.0)
(s751 1.0)
(s752 1.0)
(s753 1.0)
(s754 1.0)
(s755 1.0)
(s756 1.0)
(s757 1.0)
(s758 1.0)
(s759 1.0)
(s760 1.0)
(s761 1.0)
(s762 1.0)
(s763 1.0)
(s764 1.0)
(s765 1.0)
(s766 1.0)
(s767 1.0)
(s768 1.0)
(s769 1.0)
(s770 1.0)
(s771 1.0)
(s772 1.0)
(s773 1.0)
(s774 1.0)
(s775 1.0)
(s776 1.0)
(s777 1.0)
(s778 1.0)
(s779 1.0)
(s780 1.0)
(s781 1.0)
(s782 1.0)
(s783 1.0)
(s784 1.0)
(s785 1.0)
(s786 1.0)
(s787 1.0)
(s788 1.0)
(s789 1.0)
(s790 1.0)
(s791 1.0)
(s792 1.0)
(s793 1.0)
(s794 1.0)
(s795 1.0)
(s796 1.0)
(s797 1.0)
(s798 1.0)
(s799 1.0)
(s800 1.0)
(s801 1.0)
(s802 1.0)
(s803 1.0)
(s804 1.0)
(s805 1.0)
(s806 1.0)
(s807 1.0)
(s808 1.0)
(s809 1.0)
(s810 1.0)
(s811 1.0)
(s812 1.0)
(s813 1.0)
(s814 1.0)
(s815 1.0)
(s816 1.0)
(s817 1.0)
(s818 1.0)
(s819 1.0)
(s820 1.0)
(s821 1.0)
(s822 1.0)
(s823 1.0)
(s824 1.0)
(s825 1.0)
(s826 1.0)
(s827 1.0)
(s828 1.0)
(s829 1.0)
(s830 1.0)
(s831 1.0)
(s832 1.0)
(s833 1.0)
(s834 1.0)
(s835 1.0)
(s836 1.0)
(s837 1.0)
(s838 1.0)
(s839 1.0)
(s840 1.0)
(s841 1.0)
(s842 1.0)
(s843 1.0)
(s844 1.0)
(s845 1.0)
(s846 1.0)
(s847 1.0)
(s848 1.0)
(s849 1.0)
(s850 1.0)
(s851 1.0)
(s852 1.0)
(s853 1.0)
(s854 1.0)
(s855 1.0)
(s856 1.0)
(s857 1.0)
(s858 1.0)
(s859 1.0)
(s860 1.0)
(s861 1.0)
(s862 1.0)
(s863 1.0)
(s864 1.0)
(s865 1.0)
(s866 1.0)
(s867 1.0)
(s868 1.0)
(s869 1.0)
(s870 1.0)
(s871 1.0)
(s872 1.0)
(s873 1.0)
(s874 1.0)
(s875 1.0)
(s876 1.0)
(s877 1.0)
(s878 1.0)
(s879 1.0)
(s880 1.0)
(s881 1.0)
(s882 1.0)
(s883 1.0)
(s884 1.0)
(s885 1.0)
(s886 1.0)
(s887 1.0)
(s888 1.0)
(s889 1.0)
(s890 1.0)
(s891 1.0)
(s892 1.0)
(s893 1.0)
(s894 1.0)
(s895 1.0)
(s896 1.0)
(s897 1.0)
(s898 1.0)
(s899 1.0)
(s900 1.0)
(s901 1.0)
(s902 1.0)
(s903 1.0)
(s904 1.0)
(s905 1.0)
(s906 1.0)
(s907 1.0)
(s908 1.0)
(s909 1.0)
(s910 1.0)
(s911 1.0)
(s912 1.0)
(s913 1.0)
(s914 1.0)
(s915 1.0)
(s916 1.0)
(s917 1.0)
(s918 1.0)
(s919 1.0)
(s920 1.0)
(s921 1.0)
(s922 1.0)
(s923 1.0)
(s924 1.0)
(s925 1.0)
(s926 1.0)
(s927 1.0)
(s928 1.0)
(s929 1.0)
(s930 1.0)
(s931 1.0)
(s932 1.0)
(s933 1.0)
(s934 1.0)
(s935 1.0)
(s936 1.0)
(s937 1.0)
(s938 1.0)
(s939 1.0)
(s940 1.0)
(s941 1.0)
(s942 1.0)
(s943 1.0)
(s944 1.0)
(s945 1.0)
(s946 1.0)
(s947 1.0)
(s948 1.0)
(s949 1.0)
(s950 1.0)
(s951 1.0)
(s952 1.0)
(s953 1.0)
(s954 1.0)
(s955 1.0)
(s956 1.0)
(s957 1.0)
(s958 1.0)
(s959 1.0)
(s960 1.0)
(s961 1.0)
(s962 1.0)
(s963 1.0)
(s964 1.0)
(s965 1.0)
(s966 1.0)
(s967 1.0)
(s968 1.0)
(s969 1.0)
(s970 1.0)
(s971 1.0)
(s972 1.0)
(s973 1.0)
(s974 1.0)
(s975 1.0)
(s976 1.0)
(s977 1.0)
(s978 1.0)
(s979 1.0)
(s980 1.0)
(s981 1.0)
(s982 1.0)
(s983 1.0)
(s984 1.0)
(s985 1.0)
(s986 1.0)
(s987 1.0)
(s988 1.0)
(s989 1.0)
(s990 1.0)
(s991 1.0)
(s992 1.0)
(s993 1.0)
(s994 1.0)
(s995 1.0)
(s996 1.0)
(s997 1.0)
(s998 1.0)
(s999 1.0)
(s1000 1.0)
(s1001 1.0)
(s1002 1.0)
(s1003 1.0)
(s1004 1.0)
(s1005 1.0)
(s1006 1.0)
(s1007 1.0)
(s1008 1.0)
(s1009 1.0)
(s1010 1.0)
(s1011 1.0)
(s1012 1.0)
(s1013 1.0)
(s1014 1.0)
(s1015 1.0)
(s1016 1.0)
(s1017 1.0)
(s1018 1.0)
(s1019 1.0)
(s1020 1.0)
(s1021 1.0)
(s1022 1.0)
(s1023 1.0)
(s1024 1.0)
(s1025 1.0)
(s1026 1.0)
(s1027 1.0)
(s1028 1.0)
(s1029 1.0)
(s1030 1.0)
(s1031 1.0)
(s1032 1.0)
(s1033 1.0)
(s1034 1.0)
(s1035 1.0)
(s1036 1.0)
(s1037 1.0)
(s1038 1.0)
(s1039 1.0)
(s1040 1.0)
(s1041 1.0)
(s1042 1.0)
(s1043 1.0)
(s1044 1.0)
(s1045 1.0)
(s1046 1.0)
(s1047 1.0)
(s1048 1.0)
(s1049 1.0)
(s1050 1.0)
(s1051 1.0)
(s1052 1.0)
(s1053 1.0)
(s1054 1.0)
(s1055 1.0)
(s1056 1.0)
(s1057 1.0)
(s1058 1.0)
(s1059 1.0)
(s1060 1.0)
(s1061 1.0)
(s1062 1.0)
(s1063 1.0)
(s1064 1.0)
(s1065 1.0)
(s1066 1.0)
(s1067 1.0)
(s1068 1.0)
(s1069 1.0)
(s1070 1.0)
(s1071 1.0)
(s1072 1.0)
(s1073 1.0)
(s1074 1.0)
(s1075 1.0)
(s1076 1.0)
(s1077 1.0)
(s1078 1.0)
(s1079 1.0)
(s1080 1.0)
(s1081 1.0)
(s1082 1.0)
(s1083 1.0)
(s1084 1.0)
(s1085 1.0)
(s1086 1.0)
(s1087 1.0)
(s1088 1.0)
(s1089 1.0)
(s1090 1.0)
(s1091 1.0)
(s1092 1.0)
(s1093 1.0)
(s1094 1.0)
(s1095 1.0)
(s1096 1.0)
(s1097 1.0)
(s1098 1.0)
(s1099 1.0)
(s1100 1.0)
(s1101 1.0)
(s1102 1.0)
(s1103 1.0)
(s1104 1.0)
(s1105 1.0)
(s1106 1.0)
(s1107 1.0)
(s1108 1.0)
(s1109 1.0)
(s1110 1.0)
(s1111 1.0)
(s1112 1.0)
(s1113 1.0)
(s1114 1.0)
(s1115 1.0)
(s1116 1.0)
(s1117 1.0)
(s1118 1.0)
(s1119 1.0)
(s1120 1.0)
(s1121 1.0)
(s1122 1.0)
(s1123 1.0)
(s1124 1.0)
(s1125 1.0)
(s1126 1.0)
(s1127 1.0)
(s1128 1.0)
(s1129 1.0)
(s1130 1.0)
(s1131 1.0)
(s1132 1.0)
(s1133 1.0)
(s1134 1.0)
(s1135 1.0)
(s1136 1.0)
(s1137 1.0)
(s1138 1.0)
(s1139 1.0)
(s1140 1.0)
(s1141 1.0)
(s1142 1.0)
(s1143 1.0)
(s1144 1.0)
(s1145 1.0)
(s1146 1.0)
(s1147 1.0)
(s1148 1.0)
(s1149 1.0)
(s1150 1.0)
(s1151 1.0)
(s1152 1.0)
(s1153 1.0)
(s1154 1.0)
(s1155 1.0)
(s1156 1.0)
(s1157 1.0)
(s1158 1.0)
(s1159 1.0)
(s1160 1.0)
(s1161 1.0)
(s1162 1.0)
(s1163 1.0)
(s1164 1.0)
(s1165 1.0)
(s1166 1.0)
(s1167 1.0)
(s1168 1.0)
(s1169 1.0)
(s1170 1.0)
(s1171 1.0)
(s1172 1.0)
(s1173 1.0)
(s1174 1.0)
(s1175 1.0)
(s1176 1.0)
(s1177 1.0)
(s1178 1.0)
(s1179 1.0)
(s1180 1.0)
(s1181 1.0)
(s1182 1.0)
(s1183 1.0)
(s1184 1.0)
(s1185 1.0)
(s1186 1.0)
(s1187 1.0)
(s1188 1.0)
(s1189 1.0)
(s1190 1.0)
(s1191 1.0)
(s1192 1.0)
(s1193 1.0)
(s1194 1.0)
(s1195 1.0)
(s1196 1.0)
(s1197 1.0)
(s1198 1.0)
(s1199 1.0)
(s1200 1.0)
(s1201 1.0)
(s1202 1.0)
(s1203 1.0)
(s1204 1.0)
(s1205 1.0)
(s1206 1.0)
(s1207 1.0)
(s1208 1.0)
(s1209 1.0)
(s1210 1.0)
(s1211 1.0)
(s1212 1.0)
(s1213 1.0)
(s1214 1.0)
(s1215 1.0)
(s1216 1.0)
(s1217 1.0)
(s1218 1.0)
(s1219 1.0)
(s1220 1.0)
(s1221 1.0)
(s1222 1.0)
(s1223 1.0)
(s1224 1.0)
(s1225 1.0)
(s1226 1.0)
(s1227 1.0)
(s1228 1.0)
(s1229 1.0)
(s1230 1.0)
(s1231 1.0)
(s1232 1.0)
(s1233 1.0)
(s1234 1.0)
(s1235 1.0)
(s1236 1.0)
(s1237 1.0)
(s1238 1.0)
(s1239 1.0)
(s1240 1.0)
(s1241 1.0)
(s1242 1.0)
(s1243 1.0)
(s1244 1.0)
(s1245 1.0)
(s1246 1.0)
(s1247 1.0)
(s1248 1.0)
(s1249 1.0)
(s1250 1.0)
(s1251 1.0)
(s1252 1.0)
(s1253 1.0)
(s1254 1.0)
(s1255 1.0)
(s1256 1.0)
(s1257 1.0)
(s1258 1.0)
(s1259 1.0)
(s1260 1.0)
(s1261 1.0)
(s1262 1.0)
(s1263 1.0)
(s1264 1.0)
(s1265 1.0)
(s1266 1.0)
(s1267 1.0)
(s1268 1.0)
(s1269 1.0)
(s1270 1.0)
(s1271 1.0)
(s1272 1.0)
(s1273 1.0)
(s1274 1.0)
(s1275 1.0)
(s1276 1.0)
(s1277 1.0)
(s1278 1.0)
(s1279 1.0)
(s1280 1.0)
(s1281 1.0)
(s1282 1.0)
(s1283 1.0)
(s1284 1.0)
(s1285 1.0)
(s1286 1.0)
(s1287 1.0)
(s1288 1.0)
(s1289 1.0)
(s1290 1.0)
(s1291 1.0)
(s1292 1.0)
(s1293 1.0)
(s1294 1.0)
(s1295 1.0)
(s1296 1.0)
(s1297 1.0)
(s1298 1.0)
(s1299 1.0)
(s1300 1.0)
(s1301 1.0)
(s1302 1.0)
(s1303 1.0)
(s1304 1.0)
(s1305 1.0)
(s1306 1.0)
(s1307 1.0)
(s1308 1.0)
(s1309 1.0)
(s1310 1.0)
(s1311 1.0)
(s1312 1.0)
(s1313 1.0)
(s1314 1.0)
(s1315 1.0)
(s1316 1.0)
(s1317 1.0)
(s1318 1.0)
(s1319 1.0)
(s1320 1.0)
(s1321 1.0)
(s1322 1.0)
(s1323 1.0)
(s1324 1.0)
(s1325 1.0)
(s1326 1.0)
(s1327 1.0)
(s1328 1.0)
(s1329 1.0)
(s1330 1.0)
(s1331 1.0)
(s1332 1.0)
(s1333 1.0)
(s1334 1.0)
(s1335 1.0)
(s1336 1.0)
(s1337 1.0)
(s1338 1.0)
(s1339 1.0)
(s1340 1.0)
(s1341 1.0)
(s1342 1.0)
(s1343 1.0)
(s1344 1.0)
(s1345 1.0)
(s1346 1.0)
(s1347 1.0)
(s1348 1.0)
(s1349 1.0)
(s1350 1.0)
(s1351 1.0)
(s1352 1.0)
(s1353 1.0)
(s1354 1.0)
(s1355 1.0)
(s1356 1.0)
(s1357 1.0)
(s1358 1.0)
(s1359 1.0)
(s1360 1.0)
(s1361 1.0)
(s1362 1.0)
(s1363 1.0)
(s1364 1.0)
(s1365 1.0)
(s1366 1.0)
(s1367 1.0)
(s1368 1.0)
(s1369 1.0)
(s1370 1.0)
(s1371 1.0)
(s1372 1.0)
(s1373 1.0)
(s1374 1.0)
(s1375 1.0)
(s1376 1.0)
(s1377 1.0)
(s1378 1.0)
(s1379 1.0)
(s1380 1.0)
(s1381 1.0)
(s1382 1.0)
(s1383 1.0)
(s1384 1.0)
(s1385 1.0)
(s1386 1.0)
(s1387 1.0)
(s1388 1.0)
(s1389 1.0)
(s1390 1.0)
(s1391 1.0)
(s1392 1.0)
(s1393 1.0)
(s1394 1.0)
(s1395 1.0)
(s1396 1.0)
(s1397 1.0)
(s1398 1.0)
(s1399 1.0)
(s1400 1.0)
(s1401 1.0)
(s1402 1.0)
(s1403 1.0)
(s1404 1.0)
(s1405 1.0)
(s1406 1.0)
(s1407 1.0)
(s1408 1.0)
(s1409 1.0)
(s1410 1.0)
(s1411 1.0)
(s1412 1.0)
(s1413 1.0)
(s1414 1.0)
(s1415 1.0)
(s1416 1.0)
(s1417 1.0)
(s1418 1.0)
(s1419 1.0)
(s1420 1.0)
(s1421 1.0)
(s1422 1.0)
(s1423 1.0)
(s1424 1.0)
(s1425 1.0)
(s1426 1.0)
(s1427 1.0)
(s1428 1.0)
(s1429 1.0)
(s1430 1.0)
(s1431 1.0)
(s1432 1.0)
(s1433 1.0)
(s1434 1.0)
(s1435 1.0)
(s1436 1.0)
(s1437 1.0)
(s1438 1.0)
(s1439 1.0)
(s1440 1.0)
(s1441 1.0)
(s1442 1.0)
(s1443 1.0)
(s1444 1.0)
(s1445 1.0)
(s1446 1.0)
(s1447 1.0)
(s1448 1.0)
(s1449 1.0)
(s1450 1.0)
(s1451 1.0)
(s1452 1.0)
(s1453 1.0)
(s1454 1.0)
(s1455 1.0)
(s1456 1.0)
(s1457 1.0)
(s1458 1.0)
(s1459 1.0)
(s1460 1.0)
(s1461 1.0)
(s1462 1.0)
(s1463 1.0)
(s1464 1.0)
(s1465 1.0)
(s1466 1.0)
(s1467 1.0)
(s1468 1.0)
(s1469 1.0)
(s1470 1.0)
(s1471 1.0)
(s1472 1.0)
(s1473 1.0)
(s1474 1.0)
(s1475 1.0)
(s1476 1.0)
(s1477 1.0)
(s1478 1.0)
(s1479 1.0)
(s1480 1.0)
(s1481 1.0)
(s1482 1.0)
(s1483 1.0)
(s1484 1.0)
(s1485 1.0)
(s1486 1.0)
(s1487 1.0)
(s1488 1.0)
(s1489 1.0)
(s1490 1.0)
(s1491 1.0)
(s1492 1.0)
(s1493 1.0)
(s1494 1.0)
(s1495 1.0)
(s1496 1.0)
(s1497 1.0)
(s1498 1.0)
(s1499 1.0)
(s1500 1.0)
(s1501 1.0)
(s1502 1.0)
(s1503 1.0)
(s1504 1.0)
(s1505 1.0)
(s1506 1.0)
(s1507 1.0)
(s1508 1.0)
(s1509 1.0)
(s1510 1.0)
(s1511 1.0)
(s1512 1.0)
(s1513 1.0)
(s1514 1.0)
(s1515 1.0)
(s1516 1.0)
(s1517 1.0)
(s1518 1.0)
(s1519 1.0)
(s1520 1.0)
(s1521 1.0)
(s1522 1.0)
(s1523 1.0)
(s1524 1.0)
(s1525 1.0)
(s1526 1.0)
(s1527 1.0)
(s1528 1.0)
(s1529 1.0)
(s1530 1.0)
(s1531 1.0)
(s1532 1.0)
(s1533 1.0)
(s1534 1.0)
(s1535 1.0)
(s1536 1.0)
(s1537 1.0)
(s1538 1.0)
(s1539 1.0)
(s1540 1.0)
(s1541 1.0)
(s1542 1.0)
(s1543 1.0)
(s1544 1.0)
(s1545 1.0)
(s1546 1.0)
(s1547 1.0)
(s1548 1.0)
(s1549 1.0)
(s1550 1.0)
(s1551 1.0)
(s1552 1.0)
(s1553 1.0)
(s1554 1.0)
(s1555 1.0)
(s1556 1.0)
(s1557 1.0)
(s1558 1.0)
(s1559 1.0)
(s1560 1.0)
(s1561 1.0)
(s1562 1.0)
(s1563 1.0)
(s1564 1.0)
(s1565 1.0)
(s1566 1.0)
(s1567 1.0)
(s1568 1.0)
(s1569 1.0)
(s1570 1.0)
(s1571 1.0)
(s1572 1.0)
(s1573 1.0)
(s1574 1.0)
(s1575 1.0)
(s1576 1.0)
(s1577 1.0)
(s1578 1.0)
(s1579 1.0)
(s1580 1.0)
(s1581 1.0)
(s1582 1.0)
(s1583 1.0)
(s1584 1.0)
(s1585 1.0)
(s1586 1.0)
(s1587 1.0)
(s1588 1.0)
(s1589 1.0)
(s1590 1.0)
(s1591 1.0)
(s1592 1.0)
(s1593 1.0)
(s1594 1.0)
(s1595 1.0)
(s1596 1.0)
(s1597 1.0)
(s1598 1.0)
(s1599 1.0)
(s1600 1.0)
(s1601 1.0)
(s1602 1.0)
(s1603 1.0)
(s1604 1.0)
(s1605 1.0)
(s1606 1.0)
(s1607 1.0)
(s1608 1.0)
(s1609 1.0)
(s1610 1.0)
(s1611 1.0)
(s1612 1.0)
(s1613 1.0)
(s1614 1.0)
(s1615 1.0)
(s1616 1.0)
(s1617 1.0)
(s1618 1.0)
(s1619 1.0)
(s1620 1.0)
(s1621 1.0)
(s1622 1.0)
(s1623 1.0)
(s1624 1.0)
(s1625 1.0)
(s1626 1.0)
(s1627 1.0)
(s1628 1.0)
(s1629 1.0)
(s1630 1.0)
(s1631 1.0)
(s1632 1.0)
(s1633 1.0)
(s1634 1.0)
(s1635 1.0)
(s1636 1.0)
(s1637 1.0)
(s1638 1.0)
(s1639 1.0)
(s1640 1.0)
(s1641 1.0)
(s1642 1.0)
(s1643 1.0)
(s1644 1.0)
(s1645 1.0)
(s1646 1.0)
(s1647 1.0)
(s1648 1.0)
(s1649 1.0)
(s1650 1.0)
(s1651 1.0)
(s1652 1.0)
(s1653 1.0)
(s1654 1.0)
(s1655 1.0)
(s1656 1.0)
(s1657 1.0)
(s1658 1.0)
(s1659 1.0)
(s1660 1.0)
(s1661 1.0)
(s1662 1.0)
(s1663 1.0)
(s1664 1.0)
(s1665 1.0)
(s1666 1.0)
(s1667 1.0)
(s1668 1.0)
(s1669 1.0)
(s1670 1.0)
(s1671 1.0)
(s1672 1.0)
(s1673 1.0)
(s1674 1.0)
(s1675 1.0)
(s1676 1.0)
(s1677 1.0)
(s1678 1.0)
(s1679 1.0)
(s1680 1.0)
(s1681 1.0)
(s1682 1.0)
(s1683 1.0)
(s1684 1.0)
(s1685 1.0)
(s1686 1.0)
(s1687 1.0)
(s1688 1.0)
(s1689 1.0)
(s1690 1.0)
(s1691 1.0)
(s1692 1.0)
(s1693 1.0)
(s1694 1.0)
(s1695 1.0)
(s1696 1.0)
(s1697 1.0)
(s1698 1.0)
(s1699 1.0)
(s1700 1.0)
(s1701 1.0)
(s1702 1.0)
(s1703 1.0)
(s1704 1.0)
(s1705 1.0)
(s1706 1.0)
(s1707 1.0)
(s1708 1.0)
(s1709 1.0)
(s1710 1.0)
(s1711 1.0)
(s1712 1.0)
(s1713 1.0)
(s1714 1.0)
(s1715 1.0)
(s1716 1.0)
(s1717 1.0)
(s1718 1.0)
(s1719 1.0)
(s1720 1.0)
(s1721 1.0)
(s1722 1.0)
(s1723 1.0)
(s1724 1.0)
(s1725 1.0)
(s1726 1.0)
(s1727 1.0)
(s1728 1.0)
(s1729 1.0)
(s1730 1.0)
(s1731 1.0)
(s1732 1.0)
(s1733 1.0)
(s1734 1.0)
(s1735 1.0)
(s1736 1.0)
(s1737 1.0)
(s1738 1.0)
(s1739 1.0)
(s1740 1.0)
(s1741 1.0)
(s1742 1.0)
(s1743 1.0)
(s1744 1.0)
(s1745 1.0)
(s1746 1.0)
(s1747 1.0)
(s1748 1.0)
(s1749 1.0)
(s1750 1.0)
(s1751 1.0)
(s1752 1.0)
(s1753 1.0)
(s1754 1.0)
(s1755 1.0)
(s1756 1.0)
(s1757 1.0)
(s1758 1.0)
(s1759 1.0)
(s1760 1.0)
(s1761 1.0)
(s1762 1.0)
(s1763 1.0)
(s1764 1.0)
(s1765 1.0)
(s1766 1.0)
(s1767 1.0)
(s1768 1.0)
(s1769 1.0)
(s1770 1.0)
(s1771 1.0)
(s1772 1.0)
(s1773 1.0)
(s1774 1.0)
(s1775 1.0)
(s1776 1.0)
(s1777 1.0)
(s1778 1.0)
(s1779 1.0)
(s1780 1.0)
(s1781 1.0)
(s1782 1.0)
(s1783 1.0)
(s1784 1.0)
(s1785 1.0)
(s1786 1.0)
(s1787 1.0)
(s1788 1.0)
(s1789 1.0)
(s1790 1.0)
(s1791 1.0)
(s1792 1.0)
(s1793 1.0)
(s1794 1.0)
(s1795 1.0)
(s1796 1.0)
(s1797 1.0)
(s1798 1.0)
(s1799 1.0)
(s1800 1.0)
(s1801 1.0)
(s1802 1.0)
(s1803 1.0)
(s1804 1.0)
(s1805 1.0)
(s1806 1.0)
(s1807 1.0)
(s1808 1.0)
(s1809 1.0)
(s1810 1.0)
(s1811 1.0)
(s1812 1.0)
(s1813 1.0)
(s1814 1.0)
(s1815 1.0)
(s1816 1.0)
(s1817 1.0)
(s1818 1.0)
(s1819 1.0)
(s1820 1.0)
(s1821 1.0)
(s1822 1.0)
(s1823 1.0)
(s1824 1.0)
(s1825 1.0)
(s1826 1.0)
(s1827 1.0)
(s1828 1.0)
(s1829 1.0)
(s1830 1.0)
(s1831 1.0)
(s1832 1.0)
(s1833 1.0)
(s1834 1.0)
(s1835 1.0)
(s1836 1.0)
(s1837 1.0)
(s1838 1.0)
(s1839 1.0)
(s1840 1.0)
(s1841 1.0)
(s1842 1.0)
(s1843 1.0)
(s1844 1.0)
(s1845 1.0)
(s1846 1.0)
(s1847 1.0)
(s1848 1.0)
(s1849 1.0)
(s1850 1.0)
(s1851 1.0)
(s1852 1.0)
(s1853 1.0)
(s1854 1.0)
(s1855 1.0)
(s1856 1.0)
(s1857 1.0)
(s1858 1.0)
(s1859 1.0)
(s1860 1.0)
(s1861 1.0)
(s1862 1.0)
(s1863 1.0)
(s1864 1.0)
(s1865 1.0)
(s1866 1.0)
(s1867 1.0)
(s1868 1.0)
(s1869 1.0)
(s1870 1.0)
(s1871 1.0)
(s1872 1.0)
(s1873 1.0)
(s1874 1.0)
(s1875 1.0)
(s1876 1.0)
(s1877 1.0)
(s1878 1.0)
(s1879 1.0)
(s1880 1.0)
(s1881 1.0)
(s1882 1.0)
(s1883 1.0)
(s1884 1.0)
(s1885 1.0)
(s1886 1.0)
(s1887 1.0)
(s1888 1.0)
(s1889 1.0)
(s1890 1.0)
(s1891 1.0)
(s1892 1.0)
(s1893 1.0)
(s1894 1.0)
(s1895 1.0)
(s1896 1.0)
(s1897 1.0)
(s1898 1.0)
(s1899 1.0)
(s1900 1.0)
(s1901 1.0)
(s1902 1.0)
(s1903 1.0)
(s1904 1.0)
(s1905 1.0)
(s1906 1.0)
(s1907 1.0)
(s1908 1.0)
(s1909 1.0)
(s1910 1.0)
(s1911 1.0)
(s1912 1.0)
(s1913 1.0)
(s1914 1.0)
(s1915 1.0)
(s1916 1.0)
(s1917 1.0)
(s1918 1.0)
(s1919 1.0)
(s1920 1.0)
(s1921 1.0)
(s1922 1.0)
(s1923 1.0)
(s1924 1.0)
(s1925 1.0)
(s1926 1.0)
(s1927 1.0)
(s1928 1.0)
(s1929 1.0)
(s1930 1.0)
(s1931 1.0)
(s1932 1.0)
(s1933 1.0)
(s1934 1.0)
(s1935 1.0)
(s1936 1.0)
(s1937 1.0)
(s1938 1.0)
(s1939 1.0)
(s1940 1.0)
(s1941 1.0)
(s1942 1.0)
(s1943 1.0)
(s1944 1.0)
(s1945 1.0)
(s1946 1.0)
(s1947 1.0)
(s1948 1.0)
(s1949 1.0)
(s1950 1.0)
(s1951 1.0)
(s1952 1.0)
(s1953 1.0)
(s1954 1.0)
(s1955 1.0)
(s1956 1.0)
(s1957 1.0)
(s1958 1.0)
(s1959 1.0)
(s1960 1.0)
(s1961 1.0)
(s1962 1.0)
(s1963 1.0)
(s1964 1.0)
(s1965 1.0)
(s1966 1.0)
(s1967 1.0)
(s1968 1.0)
(s1969 1.0)
(s1970 1.0)
(s1971 1.0)
(s1972 1.0)
(s1973 1.0)
(s1974 1.0)
(s1975 1.0)
(s1976 1.0)
(s1977 1.0)
(s1978 1.0)
(s1979 1.0)
(s1980 1.0)
(s1981 1.0)
(s1982 1.0)
(s1983 1.0)
(s1984 1.0)
(s1985 1.0)
(s1986 1.0)
(s1987 1.0)
(s1988 1.0)
(s1989 1.0)
(s1990 1.0)
(s1991 1.0)
(s1992 1.0)
(s1993 1.0)
(s1994 1.0)
(s1995 1.0)
(s1996 1.0)
(s1997 1.0)
(s1998 1.0)
(s1999 1.0)
(s2000 1.0)
(s2001 1.0)
(s2002 1.0)
(s2003 1.0)
(s2004 1.0)
(s2005 1.0)
(s2006 1.0)
(s2007 1.0)
(s2008 1.0)
(s2009 1.0)
(s2010 1.0)
(s2011 1.0)
(s2012 1.0)
(s2013 1.0)
(s2014 1.0)
(s2015 1.0)
(s2016 1.0)
(s2017 1.0)
(s2018 1.0)
(s2019 1.0)
(s2020 1.0)
(s2021 1.0)
(s2022 1.0)
(s2023 1.0)
(s2024 1.0)
(s2025 1.0)
(s2026 1.0)
(s2027 1.0)
(s2028 1.0)
(s2029 1.0)
(s2030 1.0)
(s2031 1.0)
(s2032 1.0)
(s2033 1.0)
(s2034 1.0)
(s2035 1.0)
(s2036 1.0)
(s2037 1.0)
(s2038 1.0)
(s2039 1.0)
(s2040 1.0)
(s2041 1.0)
(s2042 1.0)
(s2043 1.0)
(s2044 1.0)
(s2045 1.0)
(s2046 1.0)
(s2047 1.0)
(s2048 1.0)
(s2049 1.0)
(s2050 1.0)
(s2051 1.0)
(s2052 1.0)
(s2053 1.0)
(s2054 1.0)
(s2055 1.0)
(s2056 1.0)
(s2057 1.0)
(s2058 1.0)
(s2059 1.0)
(s2060 1.0)
(s2061 1.0)
(s2062 1.0)
(s2063 1.0)
(s2064 1.0)
(s2065 1.0)
(s2066 1.0)
(s2067 1.0)
(s2068 1.0)
(s2069 1.0)
(s2070 1.0)
(s2071 1.0)
(s2072 1.0)
(s2073 1.0)
(s2074 1.0)
(s2075 1.0)
(s2076 1.0)
(s2077 1.0)
(s2078 1.0)
(s2079 1.0)
(s2080 1.0)
(s2081 1.0)
(s2082 1.0)
(s2083 1.0)
(s2084 1.0)
(s2085 1.0)
(s2086 1.0)
(s2087 1.0)
(s2088 1.0)
(s2089 1.0)
(s2090 1.0)
(s2091 1.0)
(s2092 1.0)
(s2093 1.0)
(s2094 1.0)
(s2095 1.0)
(s2096 1.0)
(s2097 1.0)
(s2098 1.0)
(s2099 1.0)
(s2100 1.0)
(s2101 1.0)
(s2102 1.0)
(s2103 1.0)
(s2104 1.0)
(s2105 1.0)
(s2106 1.0)
(s2107 1.0)
(s2108 1.0)
(s2109 1.0)
(s2110 1.0)
(s2111 1.0)
(s2112 1.0)
(s2113 1.0)
(s2114 1.0)
(s2115 1.0)
(s2116 1.0)
(s2117 1.0)
(s2118 1.0)
(s2119 1.0)
(s2120 1.0)
(s2121 1.0)
(s2122 1.0)
(s2123 1.0)
(s2124 1.0)
(s2125 1.0)
(s2126 1.0)
(s2127 1.0)
(s2128 1.0)
(s2129 1.0)
(s2130 1.0)
(s2131 1.0)
(s2132 1.0)
(s2133 1.0)
(s2134 1.0)
(s2135 1.0)
(s2136 1.0)
(s2137 1.0)
(s2138 1.0)
(s2139 1.0)
(s2140 1.0)
(s2141 1.0)
(s2142 1.0)
(s2143 1.0)
(s2144 1.0)
(s2145 1.0)
(s2146 1.0)
(s2147 1.0)
(s2148 1.0)
(s2149 1.0)
(s2150 1.0)
(s2151 1.0)
(s2152 1.0)
(s2153 1.0)
(s2154 1.0)
(s2155 1.0)
(s2156 1.0)
(s2157 1.0)
(s2158 1.0)
(s2159 1.0)
(s2160 1.0)
(s2161 1.0)
(s2162 1.0)
(s2163 1.0)
(s2164 1.0)
(s2165 1.0)
(s2166 1.0)
(s2167 1.0)
(s2168 1.0)
(s2169 1.0)
(s2170 1.0)
(s2171 1.0)
(s2172 1.0)
timeout
(s2173 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3702/4209 variables, and 3200 constraints, problems are : Problem set: 0 solved, 472 unsolved in 30040 ms.
Refiners :[Generalized P Invariants (flows): 3200/3200 constraints, State Equation: 0/3703 constraints, PredecessorRefiner: 472/472 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 472 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3702 variables, 3200/3200 constraints. Problems are: Problem set: 0 solved, 472 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3702/4209 variables, and 3200 constraints, problems are : Problem set: 0 solved, 472 unsolved in 30023 ms.
Refiners :[Generalized P Invariants (flows): 3200/3200 constraints, State Equation: 0/3703 constraints, PredecessorRefiner: 0/472 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60604ms problems are : Problem set: 0 solved, 472 unsolved
Search for dead transitions found 0 dead transitions in 60609ms
Finished structural reductions in LTL mode , in 1 iterations and 89253 ms. Remains : 3703/3703 places, 506/506 transitions.
Stuttering acceptance computed with spot in 346 ms :[(NOT p0), (OR (NOT p0) (AND p1 p2)), (AND p1 p2), (AND p1 p2), p1]
Running random walk in product with property : QuasiCertifProtocol-COL-32-LTLFireability-00
Stuttering criterion allowed to conclude after 1416 steps with 69 reset in 20 ms.
FORMULA QuasiCertifProtocol-COL-32-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-32-LTLFireability-00 finished in 89689 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((F(G(p1))||p0)))))'
Support contains 68 out of 3703 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3703/3703 places, 506/506 transitions.
Applied a total of 0 rules in 243 ms. Remains 3703 /3703 variables (removed 0) and now considering 506/506 (removed 0) transitions.
[2025-06-05 15:46:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:47:06] [INFO ] Implicit Places using invariants in 6435 ms returned []
[2025-06-05 15:47:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:47:21] [INFO ] Implicit Places using invariants and state equation in 15047 ms returned []
Implicit Place search using SMT with State Equation took 21486 ms to find 0 implicit places.
Running 472 sub problems to find dead transitions.
[2025-06-05 15:47:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3702 variables, 3200/3200 constraints. Problems are: Problem set: 0 solved, 472 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 timeout
1.0)
(s363 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3702/4209 variables, and 3200 constraints, problems are : Problem set: 0 solved, 472 unsolved in 30033 ms.
Refiners :[Generalized P Invariants (flows): 3200/3200 constraints, State Equation: 0/3703 constraints, PredecessorRefiner: 472/472 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 472 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3702 variables, 3200/3200 constraints. Problems are: Problem set: 0 solved, 472 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3702/4209 variables, and 3200 constraints, problems are : Problem set: 0 solved, 472 unsolved in 30023 ms.
Refiners :[Generalized P Invariants (flows): 3200/3200 constraints, State Equation: 0/3703 constraints, PredecessorRefiner: 0/472 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60412ms problems are : Problem set: 0 solved, 472 unsolved
Search for dead transitions found 0 dead transitions in 60418ms
Finished structural reductions in LTL mode , in 1 iterations and 82151 ms. Remains : 3703/3703 places, 506/506 transitions.
Stuttering acceptance computed with spot in 194 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : QuasiCertifProtocol-COL-32-LTLFireability-01
Product exploration explored 100000 steps with 25000 reset in 592 ms.
Product exploration explored 100000 steps with 25000 reset in 533 ms.
Computed a total of 3703 stabilizing places and 506 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3703 transition count 506
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND p0 (NOT p1)), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 103 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 215 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (1070 resets) in 299 ms. (133 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (37 resets) in 637 ms. (62 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (46 resets) in 731 ms. (54 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 9356 steps, run visited all 2 properties in 142 ms. (steps per millisecond=65 )
Probabilistic random walk after 9356 steps, saw 9187 distinct states, run finished after 144 ms. (steps per millisecond=64 ) properties seen :2
Knowledge obtained : [(AND p0 (NOT p1)), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : [(F (NOT p0)), (F p1)]
Knowledge based reduction with 3 factoid took 132 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 176 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 192 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 68 out of 3703 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3703/3703 places, 506/506 transitions.
Applied a total of 0 rules in 201 ms. Remains 3703 /3703 variables (removed 0) and now considering 506/506 (removed 0) transitions.
[2025-06-05 15:48:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:48:31] [INFO ] Implicit Places using invariants in 6301 ms returned []
[2025-06-05 15:48:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:48:46] [INFO ] Implicit Places using invariants and state equation in 15140 ms returned []
Implicit Place search using SMT with State Equation took 21444 ms to find 0 implicit places.
Running 472 sub problems to find dead transitions.
[2025-06-05 15:48:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3702 variables, 3200/3200 constraints. Problems are: Problem set: 0 solved, 472 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3702/4209 variables, and 3200 constraints, problems are : Problem set: 0 solved, 472 unsolved in 30026 ms.
Refiners :[Generalized P Invariants (flows): 3200/3200 constraints, State Equation: 0/3703 constraints, PredecessorRefiner: 472/472 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 472 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3702 variables, 3200/3200 constraints. Problems are: Problem set: 0 solved, 472 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3702/4209 variables, and 3200 constraints, problems are : Problem set: 0 solved, 472 unsolved in 30024 ms.
Refiners :[Generalized P Invariants (flows): 3200/3200 constraints, State Equation: 0/3703 constraints, PredecessorRefiner: 0/472 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60451ms problems are : Problem set: 0 solved, 472 unsolved
Search for dead transitions found 0 dead transitions in 60455ms
Finished structural reductions in LTL mode , in 1 iterations and 82103 ms. Remains : 3703/3703 places, 506/506 transitions.
Computed a total of 3703 stabilizing places and 506 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3703 transition count 506
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND p0 (NOT p1)), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 67 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 165 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (1067 resets) in 305 ms. (130 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (33 resets) in 155 ms. (256 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (46 resets) in 87 ms. (454 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 9356 steps, run visited all 2 properties in 130 ms. (steps per millisecond=71 )
Probabilistic random walk after 9356 steps, saw 9187 distinct states, run finished after 132 ms. (steps per millisecond=70 ) properties seen :2
Knowledge obtained : [(AND p0 (NOT p1)), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : [(F (NOT p0)), (F p1)]
Knowledge based reduction with 3 factoid took 137 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 164 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 166 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 190 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 25000 reset in 504 ms.
Product exploration explored 100000 steps with 25000 reset in 531 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 176 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 68 out of 3703 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3703/3703 places, 506/506 transitions.
Graph (complete) has 40925 edges and 3703 vertex of which 3669 are kept as prefixes of interest. Removing 34 places using SCC suffix rule.32 ms
Discarding 34 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
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 3669 transition count 505
Deduced a syphon composed of 1 places in 1 ms
Applied a total of 2 rules in 824 ms. Remains 3669 /3703 variables (removed 34) and now considering 505/506 (removed 1) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 15:49:51] [INFO ] Redundant transitions in 75 ms returned []
Running 471 sub problems to find dead transitions.
// Phase 1: matrix 505 rows 3669 cols
[2025-06-05 15:49:52] [INFO ] Computed 3168 invariants in 757 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3668 variables, 3168/3168 constraints. Problems are: Problem set: 0 solved, 471 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3668/4174 variables, and 3168 constraints, problems are : Problem set: 0 solved, 471 unsolved in 30022 ms.
Refiners :[Generalized P Invariants (flows): 3168/3168 constraints, State Equation: 0/3669 constraints, PredecessorRefiner: 471/471 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 471 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3668 variables, 3168/3168 constraints. Problems are: Problem set: 0 solved, 471 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 3668/4174 variables, and 3168 constraints, problems are : Problem set: 0 solved, 471 unsolved in 30017 ms.
Refiners :[Generalized P Invariants (flows): 3168/3168 constraints, State Equation: 0/3669 constraints, PredecessorRefiner: 0/471 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61205ms problems are : Problem set: 0 solved, 471 unsolved
Search for dead transitions found 0 dead transitions in 61207ms
Starting structural reductions in SI_LTL mode, iteration 1 : 3669/3703 places, 505/506 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 62115 ms. Remains : 3669/3703 places, 505/506 transitions.
Built C files in :
/tmp/ltsmin5034239644046134890
[2025-06-05 15:50:52] [INFO ] Built C files in 46ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5034239644046134890
Running compilation step : cd /tmp/ltsmin5034239644046134890;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2452 ms.
Running link step : cd /tmp/ltsmin5034239644046134890;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin5034239644046134890;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased9882318515324130071.hoa' '--buchi-type=spotba'
LTSmin run took 2490 ms.
FORMULA QuasiCertifProtocol-COL-32-LTLFireability-01 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property QuasiCertifProtocol-COL-32-LTLFireability-01 finished in 238060 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p1)||p0))))'
Support contains 35 out of 3703 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3703/3703 places, 506/506 transitions.
Graph (complete) has 40925 edges and 3703 vertex of which 3669 are kept as prefixes of interest. Removing 34 places using SCC suffix rule.16 ms
Discarding 34 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 3667 transition count 502
Applied a total of 3 rules in 462 ms. Remains 3667 /3703 variables (removed 36) and now considering 502/506 (removed 4) transitions.
// Phase 1: matrix 502 rows 3667 cols
[2025-06-05 15:50:58] [INFO ] Computed 3168 invariants in 488 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:51:04] [INFO ] Implicit Places using invariants in 6536 ms returned []
[2025-06-05 15:51:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:51:32] [INFO ] Implicit Places using invariants and state equation in 28378 ms returned [3400, 3401, 3402, 3403, 3404, 3405, 3406, 3407, 3408, 3409, 3410, 3411, 3412, 3413, 3414, 3415, 3416, 3417, 3418, 3419, 3420, 3421, 3422, 3423, 3424, 3425, 3426, 3427, 3428, 3429, 3430, 3431, 3432]
Discarding 33 places :
Implicit Place search using SMT with State Equation took 34918 ms to find 33 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 3634/3703 places, 502/506 transitions.
Applied a total of 0 rules in 230 ms. Remains 3634 /3634 variables (removed 0) and now considering 502/502 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 35611 ms. Remains : 3634/3703 places, 502/506 transitions.
Stuttering acceptance computed with spot in 55 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : QuasiCertifProtocol-COL-32-LTLFireability-03
Product exploration explored 100000 steps with 2463 reset in 430 ms.
Product exploration explored 100000 steps with 2462 reset in 414 ms.
Computed a total of 3634 stabilizing places and 502 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3634 transition count 502
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X p1)), (F (G p1)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 11 factoid took 16 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-COL-32-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-32-LTLFireability-03 finished in 37123 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(!p0)))'
Support contains 1 out of 3703 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3703/3703 places, 506/506 transitions.
Applied a total of 0 rules in 212 ms. Remains 3703 /3703 variables (removed 0) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3703 cols
[2025-06-05 15:51:35] [INFO ] Computed 3200 invariants in 446 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:51:41] [INFO ] Implicit Places using invariants in 6691 ms returned []
[2025-06-05 15:51:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:52:02] [INFO ] Implicit Places using invariants and state equation in 20755 ms returned []
Implicit Place search using SMT with State Equation took 27451 ms to find 0 implicit places.
Running 472 sub problems to find dead transitions.
[2025-06-05 15:52:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3702 variables, 3200/3200 constraints. Problems are: Problem set: 0 solved, 472 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3702/4209 variables, and 3200 constraints, problems are : Problem set: 0 solved, 472 unsolved in 30027 ms.
Refiners :[Generalized P Invariants (flows): 3200/3200 constraints, State Equation: 0/3703 constraints, PredecessorRefiner: 472/472 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 472 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3702 variables, 3200/3200 constraints. Problems are: Problem set: 0 solved, 472 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 3702/4209 variables, and 3200 constraints, problems are : Problem set: 0 solved, 472 unsolved in 30015 ms.
Refiners :[Generalized P Invariants (flows): 3200/3200 constraints, State Equation: 0/3703 constraints, PredecessorRefiner: 0/472 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60432ms problems are : Problem set: 0 solved, 472 unsolved
Search for dead transitions found 0 dead transitions in 60439ms
Finished structural reductions in LTL mode , in 1 iterations and 88104 ms. Remains : 3703/3703 places, 506/506 transitions.
Stuttering acceptance computed with spot in 70 ms :[true, p0, p0]
Running random walk in product with property : QuasiCertifProtocol-COL-32-LTLFireability-04
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-32-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-32-LTLFireability-04 finished in 88194 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 34 out of 3703 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3703/3703 places, 506/506 transitions.
Graph (complete) has 40925 edges and 3703 vertex of which 3669 are kept as prefixes of interest. Removing 34 places using SCC suffix rule.14 ms
Discarding 34 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Performed 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 3666 transition count 501
Applied a total of 5 rules in 454 ms. Remains 3666 /3703 variables (removed 37) and now considering 501/506 (removed 5) transitions.
// Phase 1: matrix 501 rows 3666 cols
[2025-06-05 15:53:03] [INFO ] Computed 3168 invariants in 494 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:53:10] [INFO ] Implicit Places using invariants in 6670 ms returned []
[2025-06-05 15:53:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:53:22] [INFO ] Implicit Places using invariants and state equation in 12826 ms returned [3400, 3401, 3402, 3403, 3404, 3405, 3406, 3407, 3408, 3409, 3410, 3411, 3412, 3413, 3414, 3415, 3416, 3417, 3418, 3419, 3420, 3421, 3422, 3423, 3424, 3425, 3426, 3427, 3428, 3429, 3430, 3431, 3432]
Discarding 33 places :
Implicit Place search using SMT with State Equation took 19500 ms to find 33 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 3633/3703 places, 501/506 transitions.
Applied a total of 0 rules in 223 ms. Remains 3633 /3633 variables (removed 0) and now considering 501/501 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 20179 ms. Remains : 3633/3703 places, 501/506 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-32-LTLFireability-05
Product exploration explored 100000 steps with 2939 reset in 421 ms.
Product exploration explored 100000 steps with 2941 reset in 458 ms.
Computed a total of 3633 stabilizing places and 501 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3633 transition count 501
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)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 18 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-COL-32-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-32-LTLFireability-05 finished in 21689 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((F(p1)&&F(!p2)&&p0)) U X(p3)))'
Support contains 69 out of 3703 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3703/3703 places, 506/506 transitions.
Applied a total of 0 rules in 193 ms. Remains 3703 /3703 variables (removed 0) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3703 cols
[2025-06-05 15:53:25] [INFO ] Computed 3200 invariants in 444 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:53:31] [INFO ] Implicit Places using invariants in 6720 ms returned []
[2025-06-05 15:53:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:53:52] [INFO ] Implicit Places using invariants and state equation in 20469 ms returned []
Implicit Place search using SMT with State Equation took 27190 ms to find 0 implicit places.
Running 472 sub problems to find dead transitions.
[2025-06-05 15:53:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3702 variables, 3200/3200 constraints. Problems are: Problem set: 0 solved, 472 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3702/4209 variables, and 3200 constraints, problems are : Problem set: 0 solved, 472 unsolved in 30023 ms.
Refiners :[Generalized P Invariants (flows): 3200/3200 constraints, State Equation: 0/3703 constraints, PredecessorRefiner: 472/472 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 472 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3702 variables, 3200/3200 constraints. Problems are: Problem set: 0 solved, 472 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 3702/4209 variables, and 3200 constraints, problems are : Problem set: 0 solved, 472 unsolved in 30014 ms.
Refiners :[Generalized P Invariants (flows): 3200/3200 constraints, State Equation: 0/3703 constraints, PredecessorRefiner: 0/472 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60429ms problems are : Problem set: 0 solved, 472 unsolved
Search for dead transitions found 0 dead transitions in 60431ms
Finished structural reductions in LTL mode , in 1 iterations and 87817 ms. Remains : 3703/3703 places, 506/506 transitions.
Stuttering acceptance computed with spot in 336 ms :[(NOT p3), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3)) (AND p2 (NOT p3))), (NOT p3), (AND (NOT p1) (NOT p3)), (AND p2 (NOT p3)), (OR (NOT p1) (NOT p0) p2), (NOT p1), p2]
Running random walk in product with property : QuasiCertifProtocol-COL-32-LTLFireability-06
Product exploration explored 100000 steps with 50000 reset in 763 ms.
Product exploration explored 100000 steps with 50000 reset in 767 ms.
Computed a total of 3703 stabilizing places and 506 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3703 transition count 506
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2) p3), (X (NOT p2)), (X p3), (X (NOT (AND p0 p2 (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p3)))), (X (NOT (AND p2 (NOT p3)))), (X (NOT (AND p0 (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p3)), (X (X (NOT (AND p0 p2 (NOT p3))))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT p1))), (F (G (NOT p0))), (F (G (NOT p1))), (F (G (NOT p2))), (F (G p3))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 25 factoid took 19 ms. Reduced automaton from 8 states, 18 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-COL-32-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-32-LTLFireability-06 finished in 90352 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||(F(!p0) U X(X(p1)))))'
Support contains 34 out of 3703 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3703/3703 places, 506/506 transitions.
Applied a total of 0 rules in 196 ms. Remains 3703 /3703 variables (removed 0) and now considering 506/506 (removed 0) transitions.
[2025-06-05 15:54:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:55:01] [INFO ] Implicit Places using invariants in 6053 ms returned []
[2025-06-05 15:55:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:55:22] [INFO ] Implicit Places using invariants and state equation in 20987 ms returned []
Implicit Place search using SMT with State Equation took 27046 ms to find 0 implicit places.
Running 472 sub problems to find dead transitions.
[2025-06-05 15:55:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3702 variables, 3200/3200 constraints. Problems are: Problem set: 0 solved, 472 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 3702/4209 variables, and 3200 constraints, problems are : Problem set: 0 solved, 472 unsolved in 30020 ms.
Refiners :[Generalized P Invariants (flows): 3200/3200 constraints, State Equation: 0/3703 constraints, PredecessorRefiner: 472/472 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 472 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3702 variables, 3200/3200 constraints. Problems are: Problem set: 0 solved, 472 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1)
(s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 timeout
1 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3702/4209 variables, and 3200 constraints, problems are : Problem set: 0 solved, 472 unsolved in 30021 ms.
Refiners :[Generalized P Invariants (flows): 3200/3200 constraints, State Equation: 0/3703 constraints, PredecessorRefiner: 0/472 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60418ms problems are : Problem set: 0 solved, 472 unsolved
Search for dead transitions found 0 dead transitions in 60420ms
Finished structural reductions in LTL mode , in 1 iterations and 87666 ms. Remains : 3703/3703 places, 506/506 transitions.
Stuttering acceptance computed with spot in 262 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND p0 (NOT p1)), (AND (NOT p1) (NOT p0)), (AND p0 (NOT p1)), p0]
Running random walk in product with property : QuasiCertifProtocol-COL-32-LTLFireability-07
Product exploration explored 100000 steps with 33333 reset in 730 ms.
Product exploration explored 100000 steps with 33333 reset in 732 ms.
Computed a total of 3703 stabilizing places and 506 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3703 transition count 506
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT p0))), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 11 ms. Reduced automaton from 8 states, 13 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-COL-32-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-32-LTLFireability-07 finished in 90005 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(!p0)))'
Support contains 33 out of 3703 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3703/3703 places, 506/506 transitions.
Graph (complete) has 40925 edges and 3703 vertex of which 3669 are kept as prefixes of interest. Removing 34 places using SCC suffix rule.8 ms
Discarding 34 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Performed 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 3666 transition count 501
Applied a total of 5 rules in 440 ms. Remains 3666 /3703 variables (removed 37) and now considering 501/506 (removed 5) transitions.
// Phase 1: matrix 501 rows 3666 cols
[2025-06-05 15:56:25] [INFO ] Computed 3168 invariants in 496 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:56:32] [INFO ] Implicit Places using invariants in 6906 ms returned []
[2025-06-05 15:56:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:57:02] [INFO ] Implicit Places using invariants and state equation in 29855 ms returned [3400, 3401, 3402, 3403, 3404, 3405, 3406, 3407, 3408, 3409, 3410, 3411, 3412, 3413, 3414, 3415, 3416, 3417, 3418, 3419, 3420, 3421, 3422, 3423, 3424, 3425, 3426, 3427, 3428, 3429, 3430, 3431, 3432]
Discarding 33 places :
Implicit Place search using SMT with State Equation took 36768 ms to find 33 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 3633/3703 places, 501/506 transitions.
Applied a total of 0 rules in 235 ms. Remains 3633 /3633 variables (removed 0) and now considering 501/501 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 37445 ms. Remains : 3633/3703 places, 501/506 transitions.
Stuttering acceptance computed with spot in 43 ms :[p0]
Running random walk in product with property : QuasiCertifProtocol-COL-32-LTLFireability-09
Product exploration explored 100000 steps with 2462 reset in 664 ms.
Product exploration explored 100000 steps with 2463 reset in 592 ms.
Computed a total of 3633 stabilizing places and 501 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3633 transition count 501
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)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 20 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-COL-32-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-32-LTLFireability-09 finished in 39398 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(!p0)))'
Support contains 1 out of 3703 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3703/3703 places, 506/506 transitions.
Graph (complete) has 40925 edges and 3703 vertex of which 103 are kept as prefixes of interest. Removing 3600 places using SCC suffix rule.8 ms
Discarding 3600 places :
Also discarding 237 output transitions
Drop transitions (Output transitions of discarded places.) removed 237 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 198 transitions
Reduce isomorphic transitions removed 198 transitions.
Iterating post reduction 0 with 198 rules applied. Total rules applied 199 place count 102 transition count 70
Applied a total of 199 rules in 34 ms. Remains 102 /3703 variables (removed 3601) and now considering 70/506 (removed 436) transitions.
// Phase 1: matrix 70 rows 102 cols
[2025-06-05 15:57:04] [INFO ] Computed 32 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:57:04] [INFO ] Implicit Places using invariants in 86 ms returned []
[2025-06-05 15:57:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:57:04] [INFO ] Implicit Places using invariants and state equation in 133 ms returned [34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66]
Discarding 33 places :
Implicit Place search using SMT with State Equation took 221 ms to find 33 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 69/3703 places, 70/506 transitions.
Applied a total of 0 rules in 1 ms. Remains 69 /69 variables (removed 0) and now considering 70/70 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 256 ms. Remains : 69/3703 places, 70/506 transitions.
Stuttering acceptance computed with spot in 85 ms :[p0, p0]
Running random walk in product with property : QuasiCertifProtocol-COL-32-LTLFireability-11
Stuttering criterion allowed to conclude after 35 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-COL-32-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-32-LTLFireability-11 finished in 372 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(!p0)) U (X(!p1)||F(p2))))'
Support contains 68 out of 3703 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3703/3703 places, 506/506 transitions.
Applied a total of 0 rules in 412 ms. Remains 3703 /3703 variables (removed 0) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3703 cols
[2025-06-05 15:57:05] [INFO ] Computed 3200 invariants in 456 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:57:12] [INFO ] Implicit Places using invariants in 7012 ms returned []
[2025-06-05 15:57:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:57:27] [INFO ] Implicit Places using invariants and state equation in 14833 ms returned []
Implicit Place search using SMT with State Equation took 21848 ms to find 0 implicit places.
Running 472 sub problems to find dead transitions.
[2025-06-05 15:57:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3702 variables, 3200/3200 constraints. Problems are: Problem set: 0 solved, 472 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3702/4209 variables, and 3200 constraints, problems are : Problem set: 0 solved, 472 unsolved in 30029 ms.
Refiners :[Generalized P Invariants (flows): 3200/3200 constraints, State Equation: 0/3703 constraints, PredecessorRefiner: 472/472 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 472 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3702 variables, 3200/3200 constraints. Problems are: Problem set: 0 solved, 472 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3702/4209 variables, and 3200 constraints, problems are : Problem set: 0 solved, 472 unsolved in 30023 ms.
Refiners :[Generalized P Invariants (flows): 3200/3200 constraints, State Equation: 0/3703 constraints, PredecessorRefiner: 0/472 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60418ms problems are : Problem set: 0 solved, 472 unsolved
Search for dead transitions found 0 dead transitions in 60423ms
Finished structural reductions in LTL mode , in 1 iterations and 82685 ms. Remains : 3703/3703 places, 506/506 transitions.
Stuttering acceptance computed with spot in 115 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND (NOT p2) p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-32-LTLFireability-12
Product exploration explored 100000 steps with 2680 reset in 848 ms.
Product exploration explored 100000 steps with 2675 reset in 918 ms.
Computed a total of 3703 stabilizing places and 506 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3703 transition count 506
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (NOT p2)), (X (AND (NOT p2) p1)), (X p1), (X (X (NOT p2))), (X (X (AND (NOT p2) p1))), (X (X p1)), (F (G (NOT p2))), (F (G p1)), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X p0)), (X (X (NOT p0)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 10 factoid took 542 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 199 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
RANDOM walk for 40000 steps (1067 resets) in 595 ms. (67 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (35 resets) in 138 ms. (287 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (33 resets) in 231 ms. (172 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (47 resets) in 133 ms. (298 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (43 resets) in 120 ms. (330 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (34 resets) in 127 ms. (312 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (43 resets) in 99 ms. (400 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 520906 steps, run timeout after 3001 ms. (steps per millisecond=173 ) properties seen :5 out of 6
Probabilistic random walk after 520906 steps, saw 88653 distinct states, run finished after 3003 ms. (steps per millisecond=173 ) properties seen :5
[2025-06-05 15:58:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 300/335 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/335 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf4 is UNSAT
After SMT solving in domain Real declared 2981/4209 variables, and 2479 constraints, problems are : Problem set: 1 solved, 0 unsolved in 517 ms.
Refiners :[Generalized P Invariants (flows): 0/3200 constraints, State Equation: 2479/3703 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 532ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (NOT p2)), (X (AND (NOT p2) p1)), (X p1), (X (X (NOT p2))), (X (X (AND (NOT p2) p1))), (X (X p1)), (F (G (NOT p2))), (F (G p1)), (F (G (NOT p0))), (G (OR p1 (NOT p2)))]
False Knowledge obtained : [(X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X p0)), (X (X (NOT p0))), (F (NOT (AND p1 (NOT p2)))), (F (NOT p1)), (F p2), (F (NOT (OR p1 p2))), (F (NOT (OR (NOT p1) (NOT p2))))]
Knowledge based reduction with 11 factoid took 1105 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 207 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 193 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
[2025-06-05 15:58:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
Proved EG (AND p1 (NOT p2))
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (NOT p2)), (X (AND (NOT p2) p1)), (X p1), (X (X (NOT p2))), (X (X (AND (NOT p2) p1))), (X (X p1)), (F (G (NOT p2))), (F (G p1)), (F (G (NOT p0))), (G (OR p1 (NOT p2)))]
False Knowledge obtained : [(X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X p0)), (X (X (NOT p0))), (F (NOT (AND p1 (NOT p2)))), (F (NOT p1)), (F p2), (F (NOT (OR p1 p2))), (F (NOT (OR (NOT p1) (NOT p2)))), (G (AND p1 (NOT p2)))]
Property proved to be false thanks to negative knowledge :(G (AND p1 (NOT p2)))
Knowledge based reduction with 11 factoid took 1212 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-COL-32-LTLFireability-12 FALSE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-32-LTLFireability-12 finished in 94175 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&(X(X((F(p1)&&X(!p2)))) U (X(X(G((F(p1)&&X(!p2)))))||(p3&&X(X((F(p1)&&X(!p2))))))))))'
Support contains 102 out of 3703 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3703/3703 places, 506/506 transitions.
Applied a total of 0 rules in 202 ms. Remains 3703 /3703 variables (removed 0) and now considering 506/506 (removed 0) transitions.
[2025-06-05 15:58:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:58:45] [INFO ] Implicit Places using invariants in 6703 ms returned []
[2025-06-05 15:58:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:59:00] [INFO ] Implicit Places using invariants and state equation in 14913 ms returned []
Implicit Place search using SMT with State Equation took 21621 ms to find 0 implicit places.
Running 472 sub problems to find dead transitions.
[2025-06-05 15:59:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3702 variables, 3200/3200 constraints. Problems are: Problem set: 0 solved, 472 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3702/4209 variables, and 3200 constraints, problems are : Problem set: 0 solved, 472 unsolved in 30023 ms.
Refiners :[Generalized P Invariants (flows): 3200/3200 constraints, State Equation: 0/3703 constraints, PredecessorRefiner: 472/472 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 472 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3702 variables, 3200/3200 constraints. Problems are: Problem set: 0 solved, 472 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 3702/4209 variables, and 3200 constraints, problems are : Problem set: 0 solved, 472 unsolved in 30036 ms.
Refiners :[Generalized P Invariants (flows): 3200/3200 constraints, State Equation: 0/3703 constraints, PredecessorRefiner: 0/472 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60473ms problems are : Problem set: 0 solved, 472 unsolved
Search for dead transitions found 0 dead transitions in 60476ms
Finished structural reductions in LTL mode , in 1 iterations and 82302 ms. Remains : 3703/3703 places, 506/506 transitions.
Stuttering acceptance computed with spot in 965 ms :[(OR (NOT p1) (NOT p0) p2), (OR (NOT p1) p2), (OR (NOT p1) p2), (OR (NOT p1) p2), (OR (NOT p1) p2), p2, (OR (NOT p1) p2), (OR (NOT p1) p2), (NOT p1), p2, p2, p2, p2, p2, p2, p2, p2]
Running random walk in product with property : QuasiCertifProtocol-COL-32-LTLFireability-15
Stuttering criterion allowed to conclude after 35 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-COL-32-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-32-LTLFireability-15 finished in 83320 ms.
All properties solved by simple procedures.
Total runtime 907093 ms.

BK_STOP 1749139202612

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="QuasiCertifProtocol-COL-32"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
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-5832"
echo " Executing tool itstools"
echo " Input is QuasiCertifProtocol-COL-32, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r156-tall-174881254600772"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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