Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r156-tall-174881254700820.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-PT-28, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r156-tall-174881254700820
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.0M
-rw-r--r-- 1 mcc users 135K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 817K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 16K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 109K 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 21K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 94K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 36K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 127K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 750K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 17K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 106K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.0K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.9K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 749K 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-PT-28-LTLFireability-00
FORMULA_NAME QuasiCertifProtocol-PT-28-LTLFireability-01
FORMULA_NAME QuasiCertifProtocol-PT-28-LTLFireability-02
FORMULA_NAME QuasiCertifProtocol-PT-28-LTLFireability-03
FORMULA_NAME QuasiCertifProtocol-PT-28-LTLFireability-04
FORMULA_NAME QuasiCertifProtocol-PT-28-LTLFireability-05
FORMULA_NAME QuasiCertifProtocol-PT-28-LTLFireability-06
FORMULA_NAME QuasiCertifProtocol-PT-28-LTLFireability-07
FORMULA_NAME QuasiCertifProtocol-PT-28-LTLFireability-08
FORMULA_NAME QuasiCertifProtocol-PT-28-LTLFireability-09
FORMULA_NAME QuasiCertifProtocol-PT-28-LTLFireability-10
FORMULA_NAME QuasiCertifProtocol-PT-28-LTLFireability-11
FORMULA_NAME QuasiCertifProtocol-PT-28-LTLFireability-12
FORMULA_NAME QuasiCertifProtocol-PT-28-LTLFireability-13
FORMULA_NAME QuasiCertifProtocol-PT-28-LTLFireability-14
FORMULA_NAME QuasiCertifProtocol-PT-28-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1749153815985

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-PT-28
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-05 20:03:37] [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 20:03:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-05 20:03:37] [INFO ] Load time of PNML (sax parser for PT used): 139 ms
[2025-06-05 20:03:37] [INFO ] Transformed 2998 places.
[2025-06-05 20:03:37] [INFO ] Transformed 446 transitions.
[2025-06-05 20:03:37] [INFO ] Parsed PT model containing 2998 places and 446 transitions and 6489 arcs in 244 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA QuasiCertifProtocol-PT-28-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-28-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-28-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 1171 out of 2998 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2998/2998 places, 446/446 transitions.
Reduce places removed 62 places and 0 transitions.
Iterating post reduction 0 with 62 rules applied. Total rules applied 62 place count 2936 transition count 446
Applied a total of 62 rules in 229 ms. Remains 2936 /2998 variables (removed 62) and now considering 446/446 (removed 0) transitions.
// Phase 1: matrix 446 rows 2936 cols
[2025-06-05 20:03:38] [INFO ] Computed 2492 invariants in 107 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:03:41] [INFO ] Implicit Places using invariants in 4000 ms returned []
[2025-06-05 20:03:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:03:49] [INFO ] Implicit Places using invariants and state equation in 7559 ms returned [1969, 1970, 1972, 1981, 1982, 1983, 1984, 1985, 1986, 1987, 1989, 1990, 1991, 1992, 1993, 1994, 1996, 1997, 1998, 2005, 2006, 2007, 2008, 2009, 2010, 2011, 2012]
Discarding 27 places :
Implicit Place search using SMT with State Equation took 11603 ms to find 27 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2909/2998 places, 446/446 transitions.
Applied a total of 0 rules in 56 ms. Remains 2909 /2909 variables (removed 0) and now considering 446/446 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 11903 ms. Remains : 2909/2998 places, 446/446 transitions.
Support contains 1171 out of 2909 places after structural reductions.
[2025-06-05 20:03:49] [INFO ] Flatten gal took : 198 ms
[2025-06-05 20:03:50] [INFO ] Flatten gal took : 107 ms
[2025-06-05 20:03:50] [INFO ] Input system was already deterministic with 446 transitions.
Reduction of identical properties reduced properties to check from 24 to 23
RANDOM walk for 40000 steps (1211 resets) in 2652 ms. (15 steps per ms) remains 19/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 162 ms. (24 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 374 ms. (10 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 87 ms. (45 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 113 ms. (35 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 19/19 properties
// Phase 1: matrix 446 rows 2909 cols
[2025-06-05 20:03:51] [INFO ] Computed 2465 invariants in 78 ms
Excessive predecessor constraint size, skipping predecessor.
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
At refinement iteration 0 (INCLUDED_ONLY) 0/1110 variables, 785/785 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1110 variables, 0/785 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (OVERLAPS) 840/1950 variables, 868/1653 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1950 variables, 0/1653 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (OVERLAPS) 415/2365 variables, 1950/3603 constraints. Problems are: Problem set: 0 solved, 19 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2365/3355 variables, and 3603 constraints, problems are : Problem set: 0 solved, 19 unsolved in 5017 ms.
Refiners :[Generalized P Invariants (flows): 1653/2465 constraints, State Equation: 1950/2909 constraints, PredecessorRefiner: 19/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 19 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1110 variables, 785/785 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1110 variables, 0/785 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (OVERLAPS) 840/1950 variables, 868/1653 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1950 variables, 0/1653 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (OVERLAPS) 415/2365 variables, 1950/3603 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2365 variables, 10/3613 constraints. Problems are: Problem set: 0 solved, 19 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2365/3355 variables, and 3613 constraints, problems are : Problem set: 0 solved, 19 unsolved in 5008 ms.
Refiners :[Generalized P Invariants (flows): 1653/2465 constraints, State Equation: 1950/2909 constraints, PredecessorRefiner: 17/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10217ms problems are : Problem set: 0 solved, 19 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1110 out of 2909 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2909/2909 places, 446/446 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 2909 transition count 445
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 2908 transition count 444
Applied a total of 2 rules in 307 ms. Remains 2908 /2909 variables (removed 1) and now considering 444/446 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 307 ms. Remains : 2908/2909 places, 444/446 transitions.
RANDOM walk for 40000 steps (1160 resets) in 1099 ms. (36 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 121 ms. (32 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 19/19 properties
Interrupted probabilistic random walk after 509101 steps, run timeout after 3001 ms. (steps per millisecond=169 ) properties seen :0 out of 19
Probabilistic random walk after 509101 steps, saw 70514 distinct states, run finished after 3009 ms. (steps per millisecond=169 ) properties seen :0
// Phase 1: matrix 444 rows 2908 cols
[2025-06-05 20:04:05] [INFO ] Computed 2466 invariants in 56 ms
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1110 variables, 785/785 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1110 variables, 0/785 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (OVERLAPS) 840/1950 variables, 868/1653 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1950 variables, 0/1653 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (OVERLAPS) 415/2365 variables, 1950/3603 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2365 variables, 0/3603 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (OVERLAPS) 958/3323 variables, 929/4532 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3323 variables, 784/5316 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3323 variables, 0/5316 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (OVERLAPS) 29/3352 variables, 29/5345 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3352 variables, 29/5374 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3352 variables, 0/5374 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 12 (OVERLAPS) 0/3352 variables, 0/5374 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3352/3352 variables, and 5374 constraints, problems are : Problem set: 0 solved, 19 unsolved in 21656 ms.
Refiners :[Generalized P Invariants (flows): 2466/2466 constraints, State Equation: 2908/2908 constraints, PredecessorRefiner: 19/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 19 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1110 variables, 785/785 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1110 variables, 0/785 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (OVERLAPS) 840/1950 variables, 868/1653 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1950 variables, 0/1653 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (OVERLAPS) 415/2365 variables, 1950/3603 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2365 variables, 10/3613 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2365 variables, 0/3613 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (OVERLAPS) 958/3323 variables, 929/4542 constraints. Problems are: Problem set: 0 solved, 19 unsolved
SMT process timed out in 66820ms, After SMT, problems are : Problem set: 0 solved, 19 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1110 out of 2908 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2908/2908 places, 444/444 transitions.
Applied a total of 0 rules in 81 ms. Remains 2908 /2908 variables (removed 0) and now considering 444/444 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 81 ms. Remains : 2908/2908 places, 444/444 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2908/2908 places, 444/444 transitions.
Applied a total of 0 rules in 86 ms. Remains 2908 /2908 variables (removed 0) and now considering 444/444 (removed 0) transitions.
[2025-06-05 20:05:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:05:16] [INFO ] Implicit Places using invariants in 3621 ms returned [213]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 3624 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 2907/2908 places, 444/444 transitions.
Applied a total of 0 rules in 74 ms. Remains 2907 /2907 variables (removed 0) and now considering 444/444 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3785 ms. Remains : 2907/2908 places, 444/444 transitions.
RANDOM walk for 40000 steps (1154 resets) in 1004 ms. (39 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 96 ms. (41 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 19/19 properties
Interrupted probabilistic random walk after 592054 steps, run timeout after 3001 ms. (steps per millisecond=197 ) properties seen :0 out of 19
Probabilistic random walk after 592054 steps, saw 81206 distinct states, run finished after 3001 ms. (steps per millisecond=197 ) properties seen :0
// Phase 1: matrix 444 rows 2907 cols
[2025-06-05 20:05:19] [INFO ] Computed 2465 invariants in 28 ms
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1110 variables, 785/785 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1110 variables, 0/785 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (OVERLAPS) 840/1950 variables, 868/1653 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1950 variables, 0/1653 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (OVERLAPS) 415/2365 variables, 1950/3603 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2365 variables, 0/3603 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (OVERLAPS) 957/3322 variables, 928/4531 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3322 variables, 784/5315 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3322 variables, 0/5315 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (OVERLAPS) 29/3351 variables, 28/5343 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3351 variables, 29/5372 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3351 variables, 0/5372 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 12 (OVERLAPS) 0/3351 variables, 0/5372 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3351/3351 variables, and 5372 constraints, problems are : Problem set: 0 solved, 19 unsolved in 21807 ms.
Refiners :[Generalized P Invariants (flows): 2465/2465 constraints, State Equation: 2907/2907 constraints, PredecessorRefiner: 19/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 19 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1110 variables, 785/785 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1110 variables, 0/785 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (OVERLAPS) 840/1950 variables, 868/1653 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1950 variables, 0/1653 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (OVERLAPS) 415/2365 variables, 1950/3603 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2365 variables, 10/3613 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2365 variables, 0/3613 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (OVERLAPS) 957/3322 variables, 928/4541 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3322 variables, 784/5325 constraints. Problems are: Problem set: 0 solved, 19 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3322/3351 variables, and 5327 constraints, problems are : Problem set: 0 solved, 19 unsolved in 75036 ms.
Refiners :[Generalized P Invariants (flows): 2437/2465 constraints, State Equation: 2878/2907 constraints, PredecessorRefiner: 19/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 96926ms problems are : Problem set: 0 solved, 19 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1110 out of 2907 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2907/2907 places, 444/444 transitions.
Applied a total of 0 rules in 57 ms. Remains 2907 /2907 variables (removed 0) and now considering 444/444 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59 ms. Remains : 2907/2907 places, 444/444 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2907/2907 places, 444/444 transitions.
Applied a total of 0 rules in 44 ms. Remains 2907 /2907 variables (removed 0) and now considering 444/444 (removed 0) transitions.
[2025-06-05 20:06:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:07:00] [INFO ] Implicit Places using invariants in 3707 ms returned []
[2025-06-05 20:07:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:07:07] [INFO ] Implicit Places using invariants and state equation in 7616 ms returned [2561, 2562, 2563, 2564, 2565, 2566, 2567, 2568, 2569, 2570, 2571, 2572, 2573, 2574, 2575, 2576, 2581, 2582, 2583, 2584, 2811, 2812, 2813, 2814, 2815, 2816, 2817, 2818, 2825]
Discarding 29 places :
Implicit Place search using SMT with State Equation took 11330 ms to find 29 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 2878/2907 places, 444/444 transitions.
Applied a total of 0 rules in 41 ms. Remains 2878 /2878 variables (removed 0) and now considering 444/444 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 11416 ms. Remains : 2878/2907 places, 444/444 transitions.
Computed a total of 2909 stabilizing places and 446 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2909 transition count 446
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' '!((F(G(!p0)) U X(G((X(X(X(p1))) U p0)))))'
Support contains 900 out of 2909 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2909/2909 places, 446/446 transitions.
Applied a total of 0 rules in 43 ms. Remains 2909 /2909 variables (removed 0) and now considering 446/446 (removed 0) transitions.
// Phase 1: matrix 446 rows 2909 cols
[2025-06-05 20:07:08] [INFO ] Computed 2465 invariants in 27 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:07:12] [INFO ] Implicit Places using invariants in 3895 ms returned []
[2025-06-05 20:07:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:07:20] [INFO ] Implicit Places using invariants and state equation in 8383 ms returned [1978, 1979]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 12283 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2907/2909 places, 446/446 transitions.
Applied a total of 0 rules in 169 ms. Remains 2907 /2907 variables (removed 0) and now considering 446/446 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 12496 ms. Remains : 2907/2909 places, 446/446 transitions.
Stuttering acceptance computed with spot in 423 ms :[(NOT p0), (NOT p0), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), p0]
Running random walk in product with property : QuasiCertifProtocol-PT-28-LTLFireability-01
Stuttering criterion allowed to conclude after 65 steps with 1 reset in 4 ms.
FORMULA QuasiCertifProtocol-PT-28-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-28-LTLFireability-01 finished in 12990 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((p0&&X(p1)))) U ((!p2&&X(X((p0&&X(p1)))))||X(X(G((p0&&X(p1))))))))'
Support contains 32 out of 2909 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2909/2909 places, 446/446 transitions.
Applied a total of 0 rules in 153 ms. Remains 2909 /2909 variables (removed 0) and now considering 446/446 (removed 0) transitions.
[2025-06-05 20:07:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:07:25] [INFO ] Implicit Places using invariants in 4700 ms returned []
[2025-06-05 20:07:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:07:38] [INFO ] Implicit Places using invariants and state equation in 12388 ms returned [1978, 1979]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 17094 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2907/2909 places, 446/446 transitions.
Applied a total of 0 rules in 126 ms. Remains 2907 /2907 variables (removed 0) and now considering 446/446 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 17374 ms. Remains : 2907/2909 places, 446/446 transitions.
Stuttering acceptance computed with spot in 247 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true, (NOT p1), (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-PT-28-LTLFireability-02
Entered a terminal (fully accepting) state of product in 22 steps with 5 reset in 2 ms.
FORMULA QuasiCertifProtocol-PT-28-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-28-LTLFireability-02 finished in 17651 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 30 out of 2909 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2909/2909 places, 446/446 transitions.
Graph (complete) has 28369 edges and 2909 vertex of which 2879 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.20 ms
Discarding 30 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 2876 transition count 441
Applied a total of 5 rules in 364 ms. Remains 2876 /2909 variables (removed 33) and now considering 441/446 (removed 5) transitions.
// Phase 1: matrix 441 rows 2876 cols
[2025-06-05 20:07:39] [INFO ] Computed 2437 invariants in 29 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:07:43] [INFO ] Implicit Places using invariants in 4720 ms returned []
[2025-06-05 20:07:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:07:53] [INFO ] Implicit Places using invariants and state equation in 9844 ms returned [1975, 1976, 2559, 2560, 2561, 2562, 2563, 2564, 2565, 2566, 2567, 2568, 2569, 2570, 2571, 2572, 2573, 2574, 2579, 2580, 2581, 2582, 2783, 2784, 2785, 2786, 2787, 2788, 2789, 2790, 2797]
Discarding 31 places :
Implicit Place search using SMT with State Equation took 14567 ms to find 31 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 2845/2909 places, 441/446 transitions.
Applied a total of 0 rules in 173 ms. Remains 2845 /2845 variables (removed 0) and now considering 441/441 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 15105 ms. Remains : 2845/2909 places, 441/446 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-28-LTLFireability-03
Stuttering criterion allowed to conclude after 35 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-PT-28-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-28-LTLFireability-03 finished in 15157 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 ((p2&&X(p2))||X(G(p2)))))))))'
Support contains 32 out of 2909 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2909/2909 places, 446/446 transitions.
Applied a total of 0 rules in 294 ms. Remains 2909 /2909 variables (removed 0) and now considering 446/446 (removed 0) transitions.
// Phase 1: matrix 446 rows 2909 cols
[2025-06-05 20:07:54] [INFO ] Computed 2465 invariants in 32 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:07:58] [INFO ] Implicit Places using invariants in 4787 ms returned []
[2025-06-05 20:07:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:08:10] [INFO ] Implicit Places using invariants and state equation in 11445 ms returned [1978, 1979]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 16239 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2907/2909 places, 446/446 transitions.
Applied a total of 0 rules in 128 ms. Remains 2907 /2907 variables (removed 0) and now considering 446/446 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 16662 ms. Remains : 2907/2909 places, 446/446 transitions.
Stuttering acceptance computed with spot in 252 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-PT-28-LTLFireability-04
Product exploration explored 100000 steps with 33333 reset in 567 ms.
Product exploration explored 100000 steps with 33333 reset in 544 ms.
Computed a total of 2907 stabilizing places and 446 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2907 transition count 446
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 p1 p2), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p1)), (F (G p0)), (F (G p1)), (F (G p2))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 25 ms. Reduced automaton from 6 states, 8 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-PT-28-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-PT-28-LTLFireability-04 finished in 18575 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)&&F(p1)))'
Support contains 88 out of 2909 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2909/2909 places, 446/446 transitions.
Graph (complete) has 28369 edges and 2909 vertex of which 2879 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.10 ms
Discarding 30 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 2877 transition count 442
Applied a total of 5 rules in 309 ms. Remains 2877 /2909 variables (removed 32) and now considering 442/446 (removed 4) transitions.
// Phase 1: matrix 442 rows 2877 cols
[2025-06-05 20:08:12] [INFO ] Computed 2437 invariants in 30 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:08:17] [INFO ] Implicit Places using invariants in 4612 ms returned []
[2025-06-05 20:08:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:08:29] [INFO ] Implicit Places using invariants and state equation in 11738 ms returned [1975, 1976]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 16356 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 2875/2909 places, 442/446 transitions.
Applied a total of 0 rules in 165 ms. Remains 2875 /2875 variables (removed 0) and now considering 442/442 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 16831 ms. Remains : 2875/2909 places, 442/446 transitions.
Stuttering acceptance computed with spot in 130 ms :[(NOT p1), (NOT p0), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : QuasiCertifProtocol-PT-28-LTLFireability-05
Stuttering criterion allowed to conclude after 31 steps with 0 reset in 2 ms.
FORMULA QuasiCertifProtocol-PT-28-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-28-LTLFireability-05 finished in 16982 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) U X(X((G(p1)&&X(!p2)))))))'
Support contains 31 out of 2909 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2909/2909 places, 446/446 transitions.
Applied a total of 0 rules in 133 ms. Remains 2909 /2909 variables (removed 0) and now considering 446/446 (removed 0) transitions.
// Phase 1: matrix 446 rows 2909 cols
[2025-06-05 20:08:29] [INFO ] Computed 2465 invariants in 35 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:08:34] [INFO ] Implicit Places using invariants in 4761 ms returned []
[2025-06-05 20:08:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:08:45] [INFO ] Implicit Places using invariants and state equation in 11359 ms returned [1978, 1979]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 16127 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2907/2909 places, 446/446 transitions.
Applied a total of 0 rules in 136 ms. Remains 2907 /2907 variables (removed 0) and now considering 446/446 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 16396 ms. Remains : 2907/2909 places, 446/446 transitions.
Stuttering acceptance computed with spot in 837 ms :[(OR (NOT p1) p2), (OR (NOT p1) p2), (OR (NOT p1) p2), (OR (NOT p1) p2), (OR (NOT p1) p2), true, (AND p1 p2), (NOT p1), (OR (NOT p1) p2), (OR (NOT p1) p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (AND p1 p2), (NOT p1), (NOT p1), p2, (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) p1 p2)]
Running random walk in product with property : QuasiCertifProtocol-PT-28-LTLFireability-06
Product exploration explored 100000 steps with 5198 reset in 395 ms.
Product exploration explored 100000 steps with 5277 reset in 448 ms.
Computed a total of 2907 stabilizing places and 446 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2907 transition count 446
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 (NOT p2)), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0))), (F (G p1)), (F (G (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 141 ms. Reduced automaton from 18 states, 51 edges and 3 AP (stutter sensitive) to 7 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 291 ms :[true, (OR (NOT p1) p2), (OR (NOT p1) p2), (NOT p1), (OR (NOT p1) p2), (OR (NOT p1) p2), (OR (NOT p1) p2)]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 40000 steps (1207 resets) in 521 ms. (76 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (57 resets) in 473 ms. (84 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (56 resets) in 133 ms. (298 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (53 resets) in 145 ms. (274 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 913618 steps, run timeout after 3001 ms. (steps per millisecond=304 ) properties seen :0 out of 3
Probabilistic random walk after 913618 steps, saw 116293 distinct states, run finished after 3001 ms. (steps per millisecond=304 ) properties seen :0
// Phase 1: matrix 446 rows 2907 cols
[2025-06-05 20:08:52] [INFO ] Computed 2464 invariants in 287 ms
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 90/120 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1254/1374 variables, 989/1019 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1374 variables, 28/1047 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1374 variables, 0/1047 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 70/1444 variables, 840/1887 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1444 variables, 70/1957 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1444 variables, 0/1957 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 800/2244 variables, 784/2741 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2244 variables, 800/3541 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2244 variables, 0/3541 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 206/2450 variables, 117/3658 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2450 variables, 0/3658 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 902/3352 variables, 900/4558 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3352 variables, 812/5370 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3352 variables, 0/5370 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 1/3353 variables, 1/5371 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3353 variables, 0/5371 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 0/3353 variables, 0/5371 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3353/3353 variables, and 5371 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2246 ms.
Refiners :[Generalized P Invariants (flows): 2464/2464 constraints, State Equation: 2907/2907 constraints, PredecessorRefiner: 3/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 90/120 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1254/1374 variables, 989/1019 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1374 variables, 28/1047 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1374 variables, 1/1048 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1374 variables, 0/1048 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 70/1444 variables, 840/1888 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1444 variables, 70/1958 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1444 variables, 0/1958 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 800/2244 variables, 784/2742 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2244 variables, 800/3542 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2244 variables, 0/3542 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 206/2450 variables, 117/3659 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2450 variables, 0/3659 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 902/3352 variables, 900/4559 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3352 variables, 812/5371 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3352 variables, 0/5371 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 1/3353 variables, 1/5372 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3353 variables, 0/5372 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 0/3353 variables, 0/5372 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3353/3353 variables, and 5372 constraints, problems are : Problem set: 0 solved, 3 unsolved in 3065 ms.
Refiners :[Generalized P Invariants (flows): 2464/2464 constraints, State Equation: 2907/2907 constraints, PredecessorRefiner: 3/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5625ms problems are : Problem set: 0 solved, 3 unsolved
Finished Parikh walk after 64 steps, including 0 resets, run visited all 3 properties in 7 ms. (steps per millisecond=9 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 3 properties in 12 ms.
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0))), (F (G p1)), (F (G (NOT p2)))]
False Knowledge obtained : [(F (NOT p1)), (F p2), (F (NOT (AND p1 (NOT p2)))), (F (NOT (AND p1 (NOT p2))))]
Knowledge based reduction with 6 factoid took 300 ms. Reduced automaton from 7 states, 10 edges and 2 AP (stutter sensitive) to 7 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 281 ms :[true, (OR (NOT p1) p2), (OR (NOT p1) p2), (NOT p1), (OR (NOT p1) p2), (OR (NOT p1) p2), (OR (NOT p1) p2)]
Stuttering acceptance computed with spot in 266 ms :[true, (OR (NOT p1) p2), (OR (NOT p1) p2), (NOT p1), (OR (NOT p1) p2), (OR (NOT p1) p2), (OR (NOT p1) p2)]
Support contains 30 out of 2907 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 2907/2907 places, 446/446 transitions.
Applied a total of 0 rules in 128 ms. Remains 2907 /2907 variables (removed 0) and now considering 446/446 (removed 0) transitions.
[2025-06-05 20:08:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:09:03] [INFO ] Implicit Places using invariants in 4761 ms returned []
[2025-06-05 20:09:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:09:16] [INFO ] Implicit Places using invariants and state equation in 13043 ms returned []
Implicit Place search using SMT with State Equation took 17813 ms to find 0 implicit places.
Running 416 sub problems to find dead transitions.
[2025-06-05 20:09:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2906 variables, 2464/2464 constraints. Problems are: Problem set: 0 solved, 416 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 2906/3353 variables, and 2464 constraints, problems are : Problem set: 0 solved, 416 unsolved in 30030 ms.
Refiners :[Generalized P Invariants (flows): 2464/2464 constraints, State Equation: 0/2907 constraints, PredecessorRefiner: 416/416 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 416 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2906 variables, 2464/2464 constraints. Problems are: Problem set: 0 solved, 416 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2906/3353 variables, and 2464 constraints, problems are : Problem set: 0 solved, 416 unsolved in 30016 ms.
Refiners :[Generalized P Invariants (flows): 2464/2464 constraints, State Equation: 0/2907 constraints, PredecessorRefiner: 0/416 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60424ms problems are : Problem set: 0 solved, 416 unsolved
Search for dead transitions found 0 dead transitions in 60428ms
Finished structural reductions in LTL mode , in 1 iterations and 78379 ms. Remains : 2907/2907 places, 446/446 transitions.
Computed a total of 2907 stabilizing places and 446 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2907 transition count 446
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 (NOT p2)), (F (G p1)), (F (G (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 101 ms. Reduced automaton from 7 states, 10 edges and 2 AP (stutter sensitive) to 7 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 272 ms :[true, (OR (NOT p1) p2), (OR (NOT p1) p2), (NOT p1), (OR (NOT p1) p2), (OR (NOT p1) p2), (OR (NOT p1) p2)]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 40000 steps (1209 resets) in 573 ms. (69 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (58 resets) in 149 ms. (266 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (56 resets) in 87 ms. (454 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (58 resets) in 43 ms. (909 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 924363 steps, run timeout after 3001 ms. (steps per millisecond=308 ) properties seen :0 out of 3
Probabilistic random walk after 924363 steps, saw 117766 distinct states, run finished after 3001 ms. (steps per millisecond=308 ) properties seen :0
[2025-06-05 20:10:20] [INFO ] Invariant cache hit.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 90/120 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1254/1374 variables, 989/1019 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1374 variables, 28/1047 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1374 variables, 0/1047 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 70/1444 variables, 840/1887 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1444 variables, 70/1957 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1444 variables, 0/1957 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 800/2244 variables, 784/2741 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2244 variables, 800/3541 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2244 variables, 0/3541 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 206/2450 variables, 117/3658 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2450 variables, 0/3658 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 902/3352 variables, 900/4558 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3352 variables, 812/5370 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3352 variables, 0/5370 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 1/3353 variables, 1/5371 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3353 variables, 0/5371 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 0/3353 variables, 0/5371 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3353/3353 variables, and 5371 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2262 ms.
Refiners :[Generalized P Invariants (flows): 2464/2464 constraints, State Equation: 2907/2907 constraints, PredecessorRefiner: 3/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 90/120 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1254/1374 variables, 989/1019 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1374 variables, 28/1047 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1374 variables, 1/1048 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1374 variables, 0/1048 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 70/1444 variables, 840/1888 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1444 variables, 70/1958 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1444 variables, 0/1958 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 800/2244 variables, 784/2742 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2244 variables, 800/3542 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2244 variables, 0/3542 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 206/2450 variables, 117/3659 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2450 variables, 0/3659 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 902/3352 variables, 900/4559 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3352 variables, 812/5371 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3352 variables, 0/5371 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 1/3353 variables, 1/5372 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3353 variables, 0/5372 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 0/3353 variables, 0/5372 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3353/3353 variables, and 5372 constraints, problems are : Problem set: 0 solved, 3 unsolved in 3238 ms.
Refiners :[Generalized P Invariants (flows): 2464/2464 constraints, State Equation: 2907/2907 constraints, PredecessorRefiner: 3/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5518ms problems are : Problem set: 0 solved, 3 unsolved
Finished Parikh walk after 64 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=32 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 3 properties in 1 ms.
Knowledge obtained : [(AND p1 (NOT p2)), (F (G p1)), (F (G (NOT p2)))]
False Knowledge obtained : [(F (NOT p1)), (F p2), (F (NOT (AND p1 (NOT p2)))), (F (NOT (AND p1 (NOT p2))))]
Knowledge based reduction with 3 factoid took 187 ms. Reduced automaton from 7 states, 10 edges and 2 AP (stutter sensitive) to 7 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 250 ms :[true, (OR (NOT p1) p2), (OR (NOT p1) p2), (NOT p1), (OR (NOT p1) p2), (OR (NOT p1) p2), (OR (NOT p1) p2)]
Stuttering acceptance computed with spot in 249 ms :[true, (OR (NOT p1) p2), (OR (NOT p1) p2), (NOT p1), (OR (NOT p1) p2), (OR (NOT p1) p2), (OR (NOT p1) p2)]
Stuttering acceptance computed with spot in 227 ms :[true, (OR (NOT p1) p2), (OR (NOT p1) p2), (NOT p1), (OR (NOT p1) p2), (OR (NOT p1) p2), (OR (NOT p1) p2)]
Product exploration explored 100000 steps with 3023 reset in 304 ms.
Product exploration explored 100000 steps with 3024 reset in 308 ms.
Applying partial POR strategy [true, true, false, true, false, false, false]
Stuttering acceptance computed with spot in 253 ms :[true, (OR (NOT p1) p2), (OR (NOT p1) p2), (NOT p1), (OR (NOT p1) p2), (OR (NOT p1) p2), (OR (NOT p1) p2)]
Support contains 30 out of 2907 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2907/2907 places, 446/446 transitions.
Graph (complete) has 28309 edges and 2907 vertex of which 2036 are kept as prefixes of interest. Removing 871 places using SCC suffix rule.9 ms
Discarding 871 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Discarding 57 places :
Symmetric choice reduction at 0 with 57 rule applications. Total rules 58 place count 1979 transition count 330
Iterating global reduction 0 with 57 rules applied. Total rules applied 115 place count 1979 transition count 330
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 116 place count 1979 transition count 331
Deduced a syphon composed of 1 places in 1 ms
Applied a total of 116 rules in 534 ms. Remains 1979 /2907 variables (removed 928) and now considering 331/446 (removed 115) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 20:10:28] [INFO ] Redundant transitions in 46 ms returned []
Running 301 sub problems to find dead transitions.
// Phase 1: matrix 331 rows 1979 cols
[2025-06-05 20:10:29] [INFO ] Computed 1652 invariants in 23 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1978 variables, 1652/1652 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1978 variables, 0/1652 constraints. Problems are: Problem set: 0 solved, 301 unsolved
Problem TDEAD69 is UNSAT
Problem TDEAD261 is UNSAT
At refinement iteration 2 (OVERLAPS) 331/2309 variables, 1978/3630 constraints. Problems are: Problem set: 2 solved, 299 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2309/2310 variables, and 3630 constraints, problems are : Problem set: 2 solved, 299 unsolved in 30019 ms.
Refiners :[Generalized P Invariants (flows): 1652/1652 constraints, State Equation: 1978/1979 constraints, PredecessorRefiner: 301/301 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 299 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1977 variables, 1652/1652 constraints. Problems are: Problem set: 2 solved, 299 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1977 variables, 0/1652 constraints. Problems are: Problem set: 2 solved, 299 unsolved
At refinement iteration 2 (OVERLAPS) 330/2307 variables, 1977/3629 constraints. Problems are: Problem set: 2 solved, 299 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2307 variables, 299/3928 constraints. Problems are: Problem set: 2 solved, 299 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2307/2310 variables, and 3928 constraints, problems are : Problem set: 2 solved, 299 unsolved in 30022 ms.
Refiners :[Generalized P Invariants (flows): 1652/1652 constraints, State Equation: 1977/1979 constraints, PredecessorRefiner: 299/301 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60243ms problems are : Problem set: 2 solved, 299 unsolved
Search for dead transitions found 2 dead transitions in 60247ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 1979/2907 places, 329/446 transitions.
Graph (complete) has 28249 edges and 1979 vertex of which 1978 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.8 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 127 ms. Remains 1978 /1979 variables (removed 1) and now considering 329/329 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 1978/2907 places, 329/446 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60968 ms. Remains : 1978/2907 places, 329/446 transitions.
Built C files in :
/tmp/ltsmin4005925941997356053
[2025-06-05 20:11:29] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4005925941997356053
Running compilation step : cd /tmp/ltsmin4005925941997356053;'/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 1949 ms.
Running link step : cd /tmp/ltsmin4005925941997356053;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin4005925941997356053;'/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/stateBased6798868466758699332.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 30 out of 2907 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2907/2907 places, 446/446 transitions.
Applied a total of 0 rules in 200 ms. Remains 2907 /2907 variables (removed 0) and now considering 446/446 (removed 0) transitions.
// Phase 1: matrix 446 rows 2907 cols
[2025-06-05 20:11:44] [INFO ] Computed 2464 invariants in 254 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:11:49] [INFO ] Implicit Places using invariants in 4901 ms returned []
[2025-06-05 20:11:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:12:02] [INFO ] Implicit Places using invariants and state equation in 12928 ms returned []
Implicit Place search using SMT with State Equation took 17840 ms to find 0 implicit places.
Running 416 sub problems to find dead transitions.
[2025-06-05 20:12: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/2906 variables, 2464/2464 constraints. Problems are: Problem set: 0 solved, 416 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2906/3353 variables, and 2464 constraints, problems are : Problem set: 0 solved, 416 unsolved in 30020 ms.
Refiners :[Generalized P Invariants (flows): 2464/2464 constraints, State Equation: 0/2907 constraints, PredecessorRefiner: 416/416 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 416 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2906 variables, 2464/2464 constraints. Problems are: Problem set: 0 solved, 416 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2906/3353 variables, and 2464 constraints, problems are : Problem set: 0 solved, 416 unsolved in 30022 ms.
Refiners :[Generalized P Invariants (flows): 2464/2464 constraints, State Equation: 0/2907 constraints, PredecessorRefiner: 0/416 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60387ms problems are : Problem set: 0 solved, 416 unsolved
Search for dead transitions found 0 dead transitions in 60389ms
Finished structural reductions in LTL mode , in 1 iterations and 78432 ms. Remains : 2907/2907 places, 446/446 transitions.
Built C files in :
/tmp/ltsmin11297684206365427233
[2025-06-05 20:13:02] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11297684206365427233
Running compilation step : cd /tmp/ltsmin11297684206365427233;'/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 1956 ms.
Running link step : cd /tmp/ltsmin11297684206365427233;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin11297684206365427233;'/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/stateBased8063751587679666406.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-05 20:13:18] [INFO ] Flatten gal took : 69 ms
[2025-06-05 20:13:18] [INFO ] Flatten gal took : 68 ms
[2025-06-05 20:13:18] [INFO ] Time to serialize gal into /tmp/LTL2785643670979945619.gal : 20 ms
[2025-06-05 20:13:18] [INFO ] Time to serialize properties into /tmp/LTL14141512941699590891.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2785643670979945619.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14529798441871400867.hoa' '-atoms' '/tmp/LTL14141512941699590891.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL14141512941699590891.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14529798441871400867.hoa
Detected timeout of ITS tools.
[2025-06-05 20:13:33] [INFO ] Flatten gal took : 65 ms
[2025-06-05 20:13:33] [INFO ] Flatten gal took : 68 ms
[2025-06-05 20:13:33] [INFO ] Time to serialize gal into /tmp/LTL11443231242487498191.gal : 11 ms
[2025-06-05 20:13:33] [INFO ] Time to serialize properties into /tmp/LTL8337898662056539791.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11443231242487498191.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8337898662056539791.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X((G("(a2>=1)"))U(X(X((G("(a4<1)"))&&(X(!("((((((s4_0>=1)||(s4_2>=1))||((s4_1>=1)||(s4_9>=1)))||(((s4_7>=1)||(s4_10>=1))||((s4_5>=1...469
Formula 0 simplified : X(F!"(a2>=1)" R XX(F!"(a4<1)" | X"((((((s4_0>=1)||(s4_2>=1))||((s4_1>=1)||(s4_9>=1)))||(((s4_7>=1)||(s4_10>=1))||((s4_5>=1)||(s4_8>=...452
Detected timeout of ITS tools.
[2025-06-05 20:13:48] [INFO ] Flatten gal took : 59 ms
[2025-06-05 20:13:48] [INFO ] Applying decomposition
[2025-06-05 20:13:48] [INFO ] Flatten gal took : 60 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph15934726359292250395.txt' '-o' '/tmp/graph15934726359292250395.bin' '-w' '/tmp/graph15934726359292250395.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph15934726359292250395.bin' '-l' '-1' '-v' '-w' '/tmp/graph15934726359292250395.weights' '-q' '0' '-e' '0.001'
[2025-06-05 20:13:49] [INFO ] Decomposing Gal with order
[2025-06-05 20:13:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 20:13:49] [INFO ] Removed a total of 289 redundant transitions.
[2025-06-05 20:13:49] [INFO ] Flatten gal took : 457 ms
[2025-06-05 20:13:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 162 labels/synchronizations in 130 ms.
[2025-06-05 20:13:49] [INFO ] Time to serialize gal into /tmp/LTL15442592667629610358.gal : 24 ms
[2025-06-05 20:13:49] [INFO ] Time to serialize properties into /tmp/LTL559092996406923478.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15442592667629610358.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL559092996406923478.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X((G("(i53.i0.u77.a2>=1)"))U(X(X((G("(i53.i0.u79.a4<1)"))&&(X(!("((((((i54.i1.u127.s4_0>=1)||(i55.i1.u30.s4_2>=1))||((i56.i1.u128.s...800
Formula 0 simplified : X(F!"(i53.i0.u77.a2>=1)" R XX(F!"(i53.i0.u79.a4<1)" | X"((((((i54.i1.u127.s4_0>=1)||(i55.i1.u30.s4_2>=1))||((i56.i1.u128.s4_1>=1)||(...783
Detected timeout of ITS tools.
Treatment of property QuasiCertifProtocol-PT-28-LTLFireability-06 finished in 335483 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 30 out of 2909 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2909/2909 places, 446/446 transitions.
Graph (complete) has 28369 edges and 2909 vertex of which 2879 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.9 ms
Discarding 30 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 2876 transition count 441
Applied a total of 5 rules in 453 ms. Remains 2876 /2909 variables (removed 33) and now considering 441/446 (removed 5) transitions.
// Phase 1: matrix 441 rows 2876 cols
[2025-06-05 20:14:05] [INFO ] Computed 2437 invariants in 34 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:14:09] [INFO ] Implicit Places using invariants in 4455 ms returned []
[2025-06-05 20:14:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:14:19] [INFO ] Implicit Places using invariants and state equation in 9326 ms returned [1975, 1976, 2559, 2560, 2561, 2562, 2563, 2564, 2565, 2566, 2567, 2568, 2569, 2570, 2571, 2572, 2573, 2574, 2579, 2580, 2581, 2582, 2783, 2784, 2785, 2786, 2787, 2788, 2789, 2790, 2797]
Discarding 31 places :
Implicit Place search using SMT with State Equation took 13792 ms to find 31 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 2845/2909 places, 441/446 transitions.
Applied a total of 0 rules in 230 ms. Remains 2845 /2845 variables (removed 0) and now considering 441/441 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 14477 ms. Remains : 2845/2909 places, 441/446 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-28-LTLFireability-07
Product exploration explored 100000 steps with 2810 reset in 519 ms.
Product exploration explored 100000 steps with 2815 reset in 531 ms.
Computed a total of 2845 stabilizing places and 441 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2845 transition count 441
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 : [p0, (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 17 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-PT-28-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-PT-28-LTLFireability-07 finished in 16120 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(!p0)&&(G((!p1 U X(p2)))||F(p3))))'
Support contains 63 out of 2909 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2909/2909 places, 446/446 transitions.
Applied a total of 0 rules in 229 ms. Remains 2909 /2909 variables (removed 0) and now considering 446/446 (removed 0) transitions.
// Phase 1: matrix 446 rows 2909 cols
[2025-06-05 20:14:21] [INFO ] Computed 2465 invariants in 33 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:14:26] [INFO ] Implicit Places using invariants in 4784 ms returned []
[2025-06-05 20:14:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:14:38] [INFO ] Implicit Places using invariants and state equation in 12478 ms returned [1978]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 17267 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2908/2909 places, 446/446 transitions.
Applied a total of 0 rules in 211 ms. Remains 2908 /2908 variables (removed 0) and now considering 446/446 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 17707 ms. Remains : 2908/2909 places, 446/446 transitions.
Stuttering acceptance computed with spot in 247 ms :[(OR p0 (AND (NOT p2) (NOT p3))), p0, (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p2)), true, (NOT p3)]
Running random walk in product with property : QuasiCertifProtocol-PT-28-LTLFireability-08
Stuttering criterion allowed to conclude after 31 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-28-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-28-LTLFireability-08 finished in 17978 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((F(!p0)&&G(p1))))'
Support contains 3 out of 2909 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2909/2909 places, 446/446 transitions.
Applied a total of 0 rules in 199 ms. Remains 2909 /2909 variables (removed 0) and now considering 446/446 (removed 0) transitions.
[2025-06-05 20:14:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:14:43] [INFO ] Implicit Places using invariants in 4644 ms returned []
[2025-06-05 20:14:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:14:54] [INFO ] Implicit Places using invariants and state equation in 10904 ms returned [1978, 1979]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 15562 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2907/2909 places, 446/446 transitions.
Applied a total of 0 rules in 210 ms. Remains 2907 /2907 variables (removed 0) and now considering 446/446 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 15972 ms. Remains : 2907/2909 places, 446/446 transitions.
Stuttering acceptance computed with spot in 143 ms :[(NOT p1), (OR (NOT p1) p0), true, (OR (NOT p1) p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-28-LTLFireability-09
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-28-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-28-LTLFireability-09 finished in 16139 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((F(p0)&&X((p1&&X(G((G(p3)||p2))))))))'
Support contains 33 out of 2909 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2909/2909 places, 446/446 transitions.
Applied a total of 0 rules in 209 ms. Remains 2909 /2909 variables (removed 0) and now considering 446/446 (removed 0) transitions.
[2025-06-05 20:14:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:14:59] [INFO ] Implicit Places using invariants in 4460 ms returned []
[2025-06-05 20:14:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:15:12] [INFO ] Implicit Places using invariants and state equation in 12248 ms returned [1978, 1979]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 16714 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2907/2909 places, 446/446 transitions.
Applied a total of 0 rules in 221 ms. Remains 2907 /2907 variables (removed 0) and now considering 446/446 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 17144 ms. Remains : 2907/2909 places, 446/446 transitions.
Stuttering acceptance computed with spot in 310 ms :[(OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), (NOT p0), (OR (NOT p1) (AND (NOT p2) (NOT p3))), true, (AND (NOT p3) (NOT p2)), (NOT p3)]
Running random walk in product with property : QuasiCertifProtocol-PT-28-LTLFireability-10
Product exploration explored 100000 steps with 3027 reset in 328 ms.
Product exploration explored 100000 steps with 3025 reset in 351 ms.
Computed a total of 2907 stabilizing places and 446 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2907 transition count 446
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 p1 p2 p3), (X p0), (X (X p1)), (X (X p0)), (F (G p0)), (F (G p1)), (F (G p2)), (F (G p3))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 90 ms. Reduced automaton from 7 states, 12 edges and 4 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 206 ms :[true, (NOT p3), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2))]
RANDOM walk for 40000 steps (1207 resets) in 173 ms. (229 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (44 resets) in 135 ms. (294 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (42 resets) in 194 ms. (205 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (55 resets) in 141 ms. (281 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (44 resets) in 1304 ms. (30 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 888353 steps, run timeout after 3001 ms. (steps per millisecond=296 ) properties seen :0 out of 4
Probabilistic random walk after 888353 steps, saw 112700 distinct states, run finished after 3001 ms. (steps per millisecond=296 ) properties seen :0
// Phase 1: matrix 446 rows 2907 cols
[2025-06-05 20:15:17] [INFO ] Computed 2464 invariants in 281 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 29/61 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 236/297 variables, 61/89 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/297 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 413/710 variables, 206/295 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/710 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 2/712 variables, 1/296 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/712 variables, 2/298 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/712 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 54/766 variables, 27/325 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/766 variables, 54/379 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/766 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 2586/3352 variables, 2583/2962 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3352 variables, 2408/5370 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3352 variables, 0/5370 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 1/3353 variables, 1/5371 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3353 variables, 0/5371 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 0/3353 variables, 0/5371 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3353/3353 variables, and 5371 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2949 ms.
Refiners :[Generalized P Invariants (flows): 2464/2464 constraints, State Equation: 2907/2907 constraints, PredecessorRefiner: 4/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 29/61 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 236/297 variables, 61/89 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/297 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 413/710 variables, 206/295 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/710 variables, 2/297 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/710 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 2/712 variables, 1/298 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/712 variables, 2/300 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/712 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 54/766 variables, 27/327 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/766 variables, 54/381 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/766 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 2586/3352 variables, 2583/2964 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3352 variables, 2408/5372 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3352 variables, 0/5372 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 1/3353 variables, 1/5373 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3353 variables, 0/5373 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 0/3353 variables, 0/5373 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3353/3353 variables, and 5373 constraints, problems are : Problem set: 0 solved, 4 unsolved in 4099 ms.
Refiners :[Generalized P Invariants (flows): 2464/2464 constraints, State Equation: 2907/2907 constraints, PredecessorRefiner: 4/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7356ms problems are : Problem set: 0 solved, 4 unsolved
Finished Parikh walk after 61 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=61 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 4 properties in 82 ms.
Knowledge obtained : [(AND p0 p1 p2 p3), (X p0), (X (X p1)), (X (X p0)), (F (G p0)), (F (G p1)), (F (G p2)), (F (G p3))]
False Knowledge obtained : [(F (NOT (OR p2 (NOT p3)))), (F (NOT p2)), (F (NOT p3)), (F (NOT (OR p2 p3)))]
Knowledge based reduction with 8 factoid took 227 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 201 ms :[true, (NOT p3), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2))]
Stuttering acceptance computed with spot in 217 ms :[true, (NOT p3), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2))]
Support contains 32 out of 2907 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 2907/2907 places, 446/446 transitions.
Applied a total of 0 rules in 205 ms. Remains 2907 /2907 variables (removed 0) and now considering 446/446 (removed 0) transitions.
[2025-06-05 20:15:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:15:30] [INFO ] Implicit Places using invariants in 4733 ms returned []
[2025-06-05 20:15:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:15:42] [INFO ] Implicit Places using invariants and state equation in 12278 ms returned []
Implicit Place search using SMT with State Equation took 17015 ms to find 0 implicit places.
Running 416 sub problems to find dead transitions.
[2025-06-05 20:15:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2906 variables, 2464/2464 constraints. Problems are: Problem set: 0 solved, 416 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 timeout
1.0)
( org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2906/3353 variables, and 2464 constraints, problems are : Problem set: 0 solved, 416 unsolved in 30036 ms.
Refiners :[Generalized P Invariants (flows): 2464/2464 constraints, State Equation: 0/2907 constraints, PredecessorRefiner: 416/416 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 416 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2906 variables, 2464/2464 constraints. Problems are: Problem set: 0 solved, 416 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2906/3353 variables, and 2464 constraints, problems are : Problem set: 0 solved, 416 unsolved in 30029 ms.
Refiners :[Generalized P Invariants (flows): 2464/2464 constraints, State Equation: 0/2907 constraints, PredecessorRefiner: 0/416 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60370ms problems are : Problem set: 0 solved, 416 unsolved
Search for dead transitions found 0 dead transitions in 60373ms
Finished structural reductions in LTL mode , in 1 iterations and 77595 ms. Remains : 2907/2907 places, 446/446 transitions.
Computed a total of 2907 stabilizing places and 446 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2907 transition count 446
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 p3 p2), (F (G p3)), (F (G p2))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 90 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 194 ms :[true, (NOT p3), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2))]
RANDOM walk for 40000 steps (1210 resets) in 173 ms. (229 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (42 resets) in 47 ms. (833 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (46 resets) in 71 ms. (555 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (56 resets) in 63 ms. (625 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (39 resets) in 64 ms. (615 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 874948 steps, run timeout after 3001 ms. (steps per millisecond=291 ) properties seen :0 out of 4
Probabilistic random walk after 874948 steps, saw 111201 distinct states, run finished after 3001 ms. (steps per millisecond=291 ) properties seen :0
[2025-06-05 20:16:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 29/61 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 236/297 variables, 61/89 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/297 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 413/710 variables, 206/295 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/710 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 2/712 variables, 1/296 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/712 variables, 2/298 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/712 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 54/766 variables, 27/325 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/766 variables, 54/379 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/766 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 2586/3352 variables, 2583/2962 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3352 variables, 2408/5370 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3352 variables, 0/5370 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 1/3353 variables, 1/5371 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3353 variables, 0/5371 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 0/3353 variables, 0/5371 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3353/3353 variables, and 5371 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2976 ms.
Refiners :[Generalized P Invariants (flows): 2464/2464 constraints, State Equation: 2907/2907 constraints, PredecessorRefiner: 4/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 29/61 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 236/297 variables, 61/89 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/297 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 413/710 variables, 206/295 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/710 variables, 2/297 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/710 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 2/712 variables, 1/298 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/712 variables, 2/300 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/712 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 54/766 variables, 27/327 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/766 variables, 54/381 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/766 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 2586/3352 variables, 2583/2964 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3352 variables, 2408/5372 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3352 variables, 0/5372 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 1/3353 variables, 1/5373 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3353 variables, 0/5373 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 0/3353 variables, 0/5373 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3353/3353 variables, and 5373 constraints, problems are : Problem set: 0 solved, 4 unsolved in 3849 ms.
Refiners :[Generalized P Invariants (flows): 2464/2464 constraints, State Equation: 2907/2907 constraints, PredecessorRefiner: 4/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6845ms problems are : Problem set: 0 solved, 4 unsolved
Finished Parikh walk after 124 steps, including 1 resets, run visited all 4 properties in 5 ms. (steps per millisecond=24 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 4 properties in 7 ms.
Knowledge obtained : [(AND p3 p2), (F (G p3)), (F (G p2))]
False Knowledge obtained : [(F (NOT (OR p2 (NOT p3)))), (F (NOT p2)), (F (NOT p3)), (F (NOT (OR p2 p3)))]
Knowledge based reduction with 3 factoid took 208 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 203 ms :[true, (NOT p3), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2))]
Stuttering acceptance computed with spot in 211 ms :[true, (NOT p3), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2))]
Stuttering acceptance computed with spot in 219 ms :[true, (NOT p3), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2))]
Product exploration explored 100000 steps with 3028 reset in 297 ms.
Product exploration explored 100000 steps with 3026 reset in 313 ms.
Applying partial POR strategy [true, true, true, false, false, false]
Stuttering acceptance computed with spot in 232 ms :[true, (NOT p3), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2))]
Support contains 32 out of 2907 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2907/2907 places, 446/446 transitions.
Graph (complete) has 28309 edges and 2907 vertex of which 2877 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.12 ms
Discarding 30 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 2877 transition count 445
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 2 rules in 443 ms. Remains 2877 /2907 variables (removed 30) and now considering 445/446 (removed 1) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 20:16:56] [INFO ] Redundant transitions in 30 ms returned []
Running 415 sub problems to find dead transitions.
// Phase 1: matrix 445 rows 2877 cols
[2025-06-05 20:16:56] [INFO ] Computed 2436 invariants in 378 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2876 variables, 2436/2436 constraints. Problems are: Problem set: 0 solved, 415 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2876/3322 variables, and 2436 constraints, problems are : Problem set: 0 solved, 415 unsolved in 30028 ms.
Refiners :[Generalized P Invariants (flows): 2436/2436 constraints, State Equation: 0/2877 constraints, PredecessorRefiner: 415/415 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 415 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2876 variables, 2436/2436 constraints. Problems are: Problem set: 0 solved, 415 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2876/3322 variables, and 2436 constraints, problems are : Problem set: 0 solved, 415 unsolved in 30023 ms.
Refiners :[Generalized P Invariants (flows): 2436/2436 constraints, State Equation: 0/2877 constraints, PredecessorRefiner: 0/415 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60744ms problems are : Problem set: 0 solved, 415 unsolved
Search for dead transitions found 0 dead transitions in 60747ms
Starting structural reductions in SI_LTL mode, iteration 1 : 2877/2907 places, 445/446 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61230 ms. Remains : 2877/2907 places, 445/446 transitions.
Built C files in :
/tmp/ltsmin11884835562859414371
[2025-06-05 20:17:57] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11884835562859414371
Running compilation step : cd /tmp/ltsmin11884835562859414371;'/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 1907 ms.
Running link step : cd /tmp/ltsmin11884835562859414371;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin11884835562859414371;'/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/stateBased7085936414777779309.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 32 out of 2907 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2907/2907 places, 446/446 transitions.
Applied a total of 0 rules in 212 ms. Remains 2907 /2907 variables (removed 0) and now considering 446/446 (removed 0) transitions.
// Phase 1: matrix 446 rows 2907 cols
[2025-06-05 20:18:12] [INFO ] Computed 2464 invariants in 281 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:18:17] [INFO ] Implicit Places using invariants in 4787 ms returned []
[2025-06-05 20:18:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:18:29] [INFO ] Implicit Places using invariants and state equation in 12285 ms returned []
Implicit Place search using SMT with State Equation took 17078 ms to find 0 implicit places.
Running 416 sub problems to find dead transitions.
[2025-06-05 20:18:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2906 variables, 2464/2464 constraints. Problems are: Problem set: 0 solved, 416 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2906/3353 variables, and 2464 constraints, problems are : Problem set: 0 solved, 416 unsolved in 30015 ms.
Refiners :[Generalized P Invariants (flows): 2464/2464 constraints, State Equation: 0/2907 constraints, PredecessorRefiner: 416/416 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 416 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2906 variables, 2464/2464 constraints. Problems are: Problem set: 0 solved, 416 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2906/3353 variables, and 2464 constraints, problems are : Problem set: 0 solved, 416 unsolved in 30019 ms.
Refiners :[Generalized P Invariants (flows): 2464/2464 constraints, State Equation: 0/2907 constraints, PredecessorRefiner: 0/416 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60305ms problems are : Problem set: 0 solved, 416 unsolved
Search for dead transitions found 0 dead transitions in 60307ms
Finished structural reductions in LTL mode , in 1 iterations and 77600 ms. Remains : 2907/2907 places, 446/446 transitions.
Built C files in :
/tmp/ltsmin12337253482406532215
[2025-06-05 20:19:29] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12337253482406532215
Running compilation step : cd /tmp/ltsmin12337253482406532215;'/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 1966 ms.
Running link step : cd /tmp/ltsmin12337253482406532215;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin12337253482406532215;'/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/stateBased377484967975062538.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-05 20:19:45] [INFO ] Flatten gal took : 61 ms
[2025-06-05 20:19:45] [INFO ] Flatten gal took : 58 ms
[2025-06-05 20:19:45] [INFO ] Time to serialize gal into /tmp/LTL12220848215856566565.gal : 8 ms
[2025-06-05 20:19:45] [INFO ] Time to serialize properties into /tmp/LTL14529109710156628448.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12220848215856566565.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6572011005347523874.hoa' '-atoms' '/tmp/LTL14529109710156628448.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL14529109710156628448.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6572011005347523874.hoa
Detected timeout of ITS tools.
[2025-06-05 20:20:00] [INFO ] Flatten gal took : 71 ms
[2025-06-05 20:20:00] [INFO ] Flatten gal took : 56 ms
[2025-06-05 20:20:00] [INFO ] Time to serialize gal into /tmp/LTL13995136762624276232.gal : 8 ms
[2025-06-05 20:20:00] [INFO ] Time to serialize properties into /tmp/LTL89715167480368026.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13995136762624276232.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL89715167480368026.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...274
Read 1 LTL properties
Checking formula 0 : !((X((F("((((malicious_reservoir<1)||(s3_11<1))||(s6_9<1))&&(s6_9<1))"))&&(X(("((malicious_reservoir<1)||(s3_11<1))")&&(X(G(("((malici...575
Formula 0 simplified : X(G!"((((malicious_reservoir<1)||(s3_11<1))||(s6_9<1))&&(s6_9<1))" | X(!"((malicious_reservoir<1)||(s3_11<1))" | XF(!"((malicious_re...561
Detected timeout of ITS tools.
[2025-06-05 20:20:15] [INFO ] Flatten gal took : 52 ms
[2025-06-05 20:20:15] [INFO ] Applying decomposition
[2025-06-05 20:20:15] [INFO ] Flatten gal took : 51 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph273652096934957818.txt' '-o' '/tmp/graph273652096934957818.bin' '-w' '/tmp/graph273652096934957818.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph273652096934957818.bin' '-l' '-1' '-v' '-w' '/tmp/graph273652096934957818.weights' '-q' '0' '-e' '0.001'
[2025-06-05 20:20:15] [INFO ] Decomposing Gal with order
[2025-06-05 20:20:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 20:20:15] [INFO ] Removed a total of 289 redundant transitions.
[2025-06-05 20:20:16] [INFO ] Flatten gal took : 180 ms
[2025-06-05 20:20:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 156 labels/synchronizations in 57 ms.
[2025-06-05 20:20:16] [INFO ] Time to serialize gal into /tmp/LTL3809284865095367951.gal : 19 ms
[2025-06-05 20:20:16] [INFO ] Time to serialize properties into /tmp/LTL5375380336008460984.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3809284865095367951.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5375380336008460984.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X((F("((((u0.malicious_reservoir<1)||(i53.i1.u148.s3_11<1))||(u8.s6_9<1))&&(u8.s6_9<1))"))&&(X(("((u0.malicious_reservoir<1)||(i53....955
Formula 0 simplified : X(G!"((((u0.malicious_reservoir<1)||(i53.i1.u148.s3_11<1))||(u8.s6_9<1))&&(u8.s6_9<1))" | X(!"((u0.malicious_reservoir<1)||(i53.i1.u...941
Detected timeout of ITS tools.
Treatment of property QuasiCertifProtocol-PT-28-LTLFireability-10 finished in 336027 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(F(X(F((G(p0)||(!(!p1 U !p0)&&!p1))))))))'
Support contains 31 out of 2909 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2909/2909 places, 446/446 transitions.
Graph (complete) has 28369 edges and 2909 vertex of which 2038 are kept as prefixes of interest. Removing 871 places using SCC suffix rule.10 ms
Discarding 871 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Discarding 57 places :
Symmetric choice reduction at 0 with 57 rule applications. Total rules 58 place count 1981 transition count 330
Iterating global reduction 0 with 57 rules applied. Total rules applied 115 place count 1981 transition count 330
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 119 place count 1979 transition count 328
Applied a total of 119 rules in 336 ms. Remains 1979 /2909 variables (removed 930) and now considering 328/446 (removed 118) transitions.
// Phase 1: matrix 328 rows 1979 cols
[2025-06-05 20:20:31] [INFO ] Computed 1653 invariants in 14 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:20:34] [INFO ] Implicit Places using invariants in 3110 ms returned []
[2025-06-05 20:20:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:20:57] [INFO ] Implicit Places using invariants and state equation in 22753 ms returned [1078]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 25871 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1978/2909 places, 328/446 transitions.
Applied a total of 0 rules in 119 ms. Remains 1978 /1978 variables (removed 0) and now considering 328/328 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 26326 ms. Remains : 1978/2909 places, 328/446 transitions.
Stuttering acceptance computed with spot in 119 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-28-LTLFireability-11
Product exploration explored 100000 steps with 3023 reset in 287 ms.
Product exploration explored 100000 steps with 3028 reset in 359 ms.
Computed a total of 1978 stabilizing places and 328 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1978 transition count 328
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)), (X (NOT (AND p1 p0))), (X (NOT p1)), (X (X (NOT (AND p1 p0)))), (X (X (NOT p1))), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : [(X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X p0), (X (NOT p0)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 18 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-PT-28-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-PT-28-LTLFireability-11 finished in 27428 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)&&(X(!p2)||G(!p3))&&p0)))'
Support contains 33 out of 2909 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2909/2909 places, 446/446 transitions.
Applied a total of 0 rules in 204 ms. Remains 2909 /2909 variables (removed 0) and now considering 446/446 (removed 0) transitions.
// Phase 1: matrix 446 rows 2909 cols
[2025-06-05 20:20:58] [INFO ] Computed 2465 invariants in 30 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:21:03] [INFO ] Implicit Places using invariants in 4327 ms returned []
[2025-06-05 20:21:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:21:16] [INFO ] Implicit Places using invariants and state equation in 13426 ms returned [1978, 1979]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 17766 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2907/2909 places, 446/446 transitions.
Applied a total of 0 rules in 220 ms. Remains 2907 /2907 variables (removed 0) and now considering 446/446 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 18191 ms. Remains : 2907/2909 places, 446/446 transitions.
Stuttering acceptance computed with spot in 292 ms :[(OR (NOT p0) (NOT p1) (AND p2 p3)), (NOT p1), (AND p2 p3), (OR (AND (NOT p0) p2) (AND (NOT p1) p2) (AND p2 p3)), (OR (AND (NOT p0) p3) (AND (NOT p1) p3) (AND p2 p3)), (AND (NOT p1) p3)]
Running random walk in product with property : QuasiCertifProtocol-PT-28-LTLFireability-12
Stuttering criterion allowed to conclude after 37 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-PT-28-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-28-LTLFireability-12 finished in 18514 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(F(((F(p0) U p1)&&X(G(p0))))))'
Support contains 32 out of 2909 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2909/2909 places, 446/446 transitions.
Applied a total of 0 rules in 212 ms. Remains 2909 /2909 variables (removed 0) and now considering 446/446 (removed 0) transitions.
[2025-06-05 20:21:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:21:21] [INFO ] Implicit Places using invariants in 4594 ms returned []
[2025-06-05 20:21:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:21:33] [INFO ] Implicit Places using invariants and state equation in 11345 ms returned [1978, 1979]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 15945 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2907/2909 places, 446/446 transitions.
Applied a total of 0 rules in 201 ms. Remains 2907 /2907 variables (removed 0) and now considering 446/446 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 16359 ms. Remains : 2907/2909 places, 446/446 transitions.
Stuttering acceptance computed with spot in 211 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-28-LTLFireability-15
Stuttering criterion allowed to conclude after 36 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-28-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-28-LTLFireability-15 finished in 16596 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) U X(X((G(p1)&&X(!p2)))))))'
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((F(p0)&&X((p1&&X(G((G(p3)||p2))))))))'
[2025-06-05 20:21:34] [INFO ] Flatten gal took : 56 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin12670646552478482479
[2025-06-05 20:21:34] [INFO ] Computing symmetric may disable matrix : 446 transitions.
[2025-06-05 20:21:34] [INFO ] Applying decomposition
[2025-06-05 20:21:34] [INFO ] Computation of Complete disable matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 20:21:34] [INFO ] Computing symmetric may enable matrix : 446 transitions.
[2025-06-05 20:21:34] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 20:21:34] [INFO ] Flatten gal took : 53 ms
[2025-06-05 20:21:34] [INFO ] Computing Do-Not-Accords matrix : 446 transitions.
[2025-06-05 20:21:34] [INFO ] Computation of Completed DNA matrix. took 13 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 20:21:34] [INFO ] Built C files in 114ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12670646552478482479
Running compilation step : cd /tmp/ltsmin12670646552478482479;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '360' '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'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph15455362131037687433.txt' '-o' '/tmp/graph15455362131037687433.bin' '-w' '/tmp/graph15455362131037687433.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph15455362131037687433.bin' '-l' '-1' '-v' '-w' '/tmp/graph15455362131037687433.weights' '-q' '0' '-e' '0.001'
[2025-06-05 20:21:34] [INFO ] Decomposing Gal with order
[2025-06-05 20:21:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 20:21:34] [INFO ] Removed a total of 288 redundant transitions.
[2025-06-05 20:21:34] [INFO ] Flatten gal took : 177 ms
[2025-06-05 20:21:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 164 labels/synchronizations in 56 ms.
[2025-06-05 20:21:34] [INFO ] Time to serialize gal into /tmp/LTLFireability14775584743522192751.gal : 20 ms
[2025-06-05 20:21:34] [INFO ] Time to serialize properties into /tmp/LTLFireability6843588146831522772.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability14775584743522192751.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability6843588146831522772.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 2 LTL properties
Checking formula 0 : !((X((G("(i43.i1.u79.a2>=1)"))U(X(X((G("(i44.i0.u81.a4<1)"))&&(X(!("((((((i21.i0.u30.s4_0>=1)||(i22.i0.u31.s4_2>=1))||((i49.i0.u49.s4_...796
Formula 0 simplified : X(F!"(i43.i1.u79.a2>=1)" R XX(F!"(i44.i0.u81.a4<1)" | X"((((((i21.i0.u30.s4_0>=1)||(i22.i0.u31.s4_2>=1))||((i49.i0.u49.s4_1>=1)||(i5...779
Compilation finished in 2464 ms.
Running link step : cd /tmp/ltsmin12670646552478482479;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin12670646552478482479;'/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' '--ltl' 'X(([]((LTLAPp0==true)) U X(X(([]((LTLAPp1==true))&&X(!(LTLAPp2==true)))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin12670646552478482479;'/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' '--ltl' 'X(([]((LTLAPp0==true)) U X(X(([]((LTLAPp1==true))&&X(!(LTLAPp2==true)))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin12670646552478482479;'/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' '--ltl' 'X((<>((LTLAPp3==true))&&X(((LTLAPp4==true)&&X([](([]((LTLAPp6==true))||(LTLAPp5==true))))))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 3/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.036: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.036: LTL layer: formula: X((<>((LTLAPp3==true))&&X(((LTLAPp4==true)&&X([](([]((LTLAPp6==true))||(LTLAPp5==true))))))))
pins2lts-mc-linux64( 3/ 8), 0.036: "X((<>((LTLAPp3==true))&&X(((LTLAPp4==true)&&X([](([]((LTLAPp6==true))||(LTLAPp5==true))))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 3/ 8), 0.037: Using Spin LTL semantics
pins2lts-mc-linux64( 5/ 8), 0.041: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.046: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.050: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.053: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.054: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.055: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.057: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.069: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.363: DFS-FIFO for weak LTL, using special progress label 454
pins2lts-mc-linux64( 0/ 8), 0.363: There are 455 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.363: State length is 2910, there are 468 groups
pins2lts-mc-linux64( 0/ 8), 0.363: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.363: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.363: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.363: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 4/ 8), 0.715: ~1 levels ~960 states ~27336 transitions
pins2lts-mc-linux64( 4/ 8), 0.927: ~1 levels ~1920 states ~57080 transitions
pins2lts-mc-linux64( 1/ 8), 1.349: ~1 levels ~3840 states ~125576 transitions
pins2lts-mc-linux64( 5/ 8), 1.916: ~1 levels ~7680 states ~250584 transitions
pins2lts-mc-linux64( 4/ 8), 3.027: ~1 levels ~15360 states ~468368 transitions
pins2lts-mc-linux64( 7/ 8), 5.043: ~1 levels ~30720 states ~897672 transitions
pins2lts-mc-linux64( 7/ 8), 8.650: ~1 levels ~61440 states ~1832496 transitions
pins2lts-mc-linux64( 7/ 8), 16.196: ~1 levels ~122880 states ~3962184 transitions
pins2lts-mc-linux64( 4/ 8), 34.581: ~1 levels ~245760 states ~10199024 transitions
pins2lts-mc-linux64( 1/ 8), 69.071: ~1 levels ~491520 states ~20915936 transitions
pins2lts-mc-linux64( 7/ 8), 128.967: ~1 levels ~983040 states ~39106296 transitions
pins2lts-mc-linux64( 7/ 8), 276.230: ~1 levels ~1966080 states ~78405800 transitions
pins2lts-mc-linux64( 0/ 8), 304.836: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 305.417:
pins2lts-mc-linux64( 0/ 8), 305.417: mean standard work distribution: 5.8% (states) 3.6% (transitions)
pins2lts-mc-linux64( 0/ 8), 305.419:
pins2lts-mc-linux64( 0/ 8), 305.419: Explored 1928916 states 91489218 transitions, fanout: 47.430
pins2lts-mc-linux64( 0/ 8), 305.419: Total exploration time 305.030 sec (304.480 sec minimum, 304.756 sec on average)
pins2lts-mc-linux64( 0/ 8), 305.419: States per second: 6324, Transitions per second: 299935
pins2lts-mc-linux64( 0/ 8), 305.419:
pins2lts-mc-linux64( 0/ 8), 305.419: Progress states detected: 24141820
pins2lts-mc-linux64( 0/ 8), 305.419: Redundant explorations: -92.0101
pins2lts-mc-linux64( 0/ 8), 305.419:
pins2lts-mc-linux64( 0/ 8), 305.419: Queue width: 8B, total height: 29969666, memory: 228.65MB
pins2lts-mc-linux64( 0/ 8), 305.419: Tree memory: 440.2MB, 19.1 B/state, compr.: 0.2%
pins2lts-mc-linux64( 0/ 8), 305.419: Tree fill ratio (roots/leafs): 17.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 305.420: Stored 485 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 305.433: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 305.433: Est. total memory use: 668.8MB (~1252.7MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin12670646552478482479;'/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' '--ltl' 'X((<>((LTLAPp3==true))&&X(((LTLAPp4==true)&&X([](([]((LTLAPp6==true))||(LTLAPp5==true))))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin12670646552478482479;'/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' '--ltl' 'X((<>((LTLAPp3==true))&&X(((LTLAPp4==true)&&X([](([]((LTLAPp6==true))||(LTLAPp5==true))))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:241)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:176)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:114)
at java.base/java.lang.Thread.run(Thread.java:1583)
Detected timeout of ITS tools.
[2025-06-05 20:47:35] [INFO ] Flatten gal took : 617 ms
[2025-06-05 20:47:35] [INFO ] Time to serialize gal into /tmp/LTLFireability7640737122753320260.gal : 37 ms
[2025-06-05 20:47:35] [INFO ] Time to serialize properties into /tmp/LTLFireability9188159251979906295.ltl : 6 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability7640737122753320260.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability9188159251979906295.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...297
Read 2 LTL properties
Checking formula 0 : !((X((G("(a2>=1)"))U(X(X((G("(a4<1)"))&&(X(!("((((((s4_0>=1)||(s4_2>=1))||((s4_1>=1)||(s4_9>=1)))||(((s4_7>=1)||(s4_10>=1))||((s4_5>=1...469
Formula 0 simplified : X(F!"(a2>=1)" R XX(F!"(a4<1)" | X"((((((s4_0>=1)||(s4_2>=1))||((s4_1>=1)||(s4_9>=1)))||(((s4_7>=1)||(s4_10>=1))||((s4_5>=1)||(s4_8>=...452

BK_TIME_CONFINEMENT_REACHED

--------------------
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-PT-28"
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-PT-28, 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-174881254700820"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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